Submission #1779135
Source Code Expand
#include <iostream> #include <cstdlib> #include <string> #include <vector> #include <algorithm> #include <queue> #include <limits.h> #include <map> #define MAXN 100000 #define Amari 1000000007 #define p pair <int,int> using namespace std; multimap <int, int> ship; bool clear = false; vector <int> buckets(100004,0); int main(int argc,char const* argv[]) { int n; cin >> n; vector <long long> a(n,0); vector <long long> b(n,0); long long answer=0; long long count=0; for(int i=0;i<n;i++) { cin >> a[i] >> b[i]; } for(int i=n-1;i>=0;i--) { if(a[i]==0) { a[i]++; count++; } long long temp=a[i]%b[i]; if(temp !=0)answer+=(b[i]-temp); if(i>0)a[i-1]+=answer+count; } answer+=count; cout << answer << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | Tendaysago |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 832 Byte |
Status | WA |
Exec Time | 87 ms |
Memory | 2176 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 80 ms | 2176 KB |
02.txt | AC | 80 ms | 2176 KB |
03.txt | AC | 80 ms | 2176 KB |
04.txt | AC | 80 ms | 2176 KB |
05.txt | AC | 80 ms | 2176 KB |
06.txt | AC | 87 ms | 2176 KB |
07.txt | AC | 57 ms | 2176 KB |
08.txt | AC | 84 ms | 2176 KB |
09.txt | WA | 59 ms | 2176 KB |
10.txt | AC | 86 ms | 2176 KB |
11.txt | AC | 57 ms | 2176 KB |
12.txt | WA | 35 ms | 2176 KB |
13.txt | AC | 58 ms | 2176 KB |
14.txt | AC | 87 ms | 2176 KB |
15.txt | WA | 1 ms | 640 KB |
16.txt | WA | 1 ms | 640 KB |
s1.txt | AC | 1 ms | 640 KB |
s2.txt | AC | 1 ms | 640 KB |