답안 #166385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166385 2019-12-02T03:30:38 Z abil 금 캐기 (IZhO14_divide) C++14
48 / 100
1000 ms 2284 KB
#include <bits/stdc++.h>

#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long

using namespace std;

const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (1e15 + 9);

int x[N], g[N], c[N], pr[N], prg[N];
main()
{
	int n;
	scanf("%lld", &n);
	for(int i = 1;i <= n; i++){
		scanf("%lld%lld%lld", &x[i], &g[i], &c[i]);
		pr[i] = pr[i - 1] + c[i];
		prg[i] = prg[i - 1] + g[i];
	}
	int ans = 0;
	for(int i = 1;i <= n; i++){
		ans = max(ans, g[i]);
		for(int j = i + 1;j <= n; j++){
			if(pr[j] - pr[i - 1] >= x[j] - x[i]){
				ans = max(ans, prg[j] - prg[i - 1]);
			}
		}
	}
	cout << ans;
}

Compilation message

divide.cpp:17:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
divide.cpp: In function 'int main()':
divide.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
divide.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &x[i], &g[i], &c[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 16 ms 632 KB Output is correct
12 Correct 16 ms 632 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 632 KB Output is correct
2 Correct 72 ms 812 KB Output is correct
3 Correct 78 ms 780 KB Output is correct
4 Execution timed out 1070 ms 2284 KB Time limit exceeded
5 Halted 0 ms 0 KB -