oj.uz

답안 #89471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89471 2018-12-15T03:16:06 Z inom 금 캐기 (IZhO14_divide) C++14
0 / 100
 1000 ms 1712 KB 
#include<bits/stdc++.h>
/*
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
*/
#define fi first
#define se second
#define new new228
#define pb push_back
#define rank rank228
#define int long long
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()

using namespace std;
/*using namespace __gnu_pbds;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key();
*/
const int N = 300300;
const int INF = 1e15;
const int MOD = 1e9 + 7;

int TN = 1;

int n, ans;
int x[N], g[N], d[N];

void solve() {
	scanf("%lld", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld %lld %lld", &x[i], &g[i], &d[i]);
		ans = max(ans, g[i]);
		g[i] += g[i - 1]; d[i] += d[i - 1];		
	}
	for (int i = 1; i <= n; i++) {
		for (int j = i; j <= n; j++) {
			int len = x[j] - x[i - 1];
			int gold = g[j] - g[i - 1];
			int energy = d[j] - d[i - 1];
			// cout << i << " " << j << " " << len << " " << gold << " " << energy << "\n";
			if (energy >= len) {
				ans = max(ans, gold);
			}
		}
	}
	printf("%lld\n", ans);
	return;
}

signed main() {
    // ios_base::sync_with_stdio(0);
    // in; out; // cin >> TN;
    while (TN--) { solve(); }
    return 0;
 }

Compilation message

divide.cpp: In function 'void solve()':
divide.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
divide.cpp:40: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], &d[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 536 KB Output is correct
3 Incorrect 3 ms 536 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 628 KB Output is correct
2 Correct 72 ms 796 KB Output is correct
3 Correct 74 ms 796 KB Output is correct
4 Execution timed out 1063 ms 1712 KB Time limit exceeded
5 Halted 0 ms 0 KB -