# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
80974 | 2018-10-23T10:26:49 Z | farukkastamonuda | 금 캐기 (IZhO14_divide) | C++14 | 60 ms | 4476 KB |
#include <bits/stdc++.h> #define fi first #define se second #define lo long long #define inf 1000000000 #define md 1000000007 #define li 100005 #define mp make_pair #define pb push_back using namespace std; int n,beg; lo int x[li], g[li], d[li]; lo int cev, sume[li], sumg[li]; int main(){ scanf("%d", &n); //cin>>n; for(int i = 1; i <= n; i ++){ scanf("%lld %lld %lld", &x[i], &g[i], &d[i]); sume[i] = sume[i - 1] + d[i]; sumg[i] = sumg[i - 1] + g[i]; } for(int i = 1; i <= n; i ++){ int bas = i, son = n; while(bas <= son){ int mid = (bas + son) / 2; if(x[mid] - x[i] <= sume[mid] - sume[i - 1]) bas = mid + 1; else son = mid - 1; } cev = max(cev, sumg[son] - sumg[i - 1]); } printf("%lld\n", cev); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 440 KB | Output is correct |
4 | Correct | 2 ms | 568 KB | Output is correct |
5 | Correct | 2 ms | 636 KB | Output is correct |
6 | Correct | 2 ms | 636 KB | Output is correct |
7 | Correct | 2 ms | 668 KB | Output is correct |
8 | Correct | 2 ms | 668 KB | Output is correct |
9 | Correct | 2 ms | 668 KB | Output is correct |
10 | Correct | 2 ms | 668 KB | Output is correct |
11 | Correct | 2 ms | 668 KB | Output is correct |
12 | Correct | 2 ms | 668 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 668 KB | Output is correct |
2 | Correct | 2 ms | 668 KB | Output is correct |
3 | Incorrect | 2 ms | 668 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 720 KB | Output is correct |
2 | Correct | 5 ms | 976 KB | Output is correct |
3 | Correct | 6 ms | 992 KB | Output is correct |
4 | Correct | 26 ms | 2656 KB | Output is correct |
5 | Correct | 29 ms | 2656 KB | Output is correct |
6 | Correct | 60 ms | 4464 KB | Output is correct |
7 | Correct | 52 ms | 4464 KB | Output is correct |
8 | Correct | 49 ms | 4464 KB | Output is correct |
9 | Correct | 44 ms | 4476 KB | Output is correct |
10 | Incorrect | 45 ms | 4476 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |