oj.uz

답안 #89760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89760 2018-12-18T10:06:21 Z inom 금 캐기 (IZhO14_divide) C++14
17 / 100
 56 ms 4732 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 L = 20;
const int N = 200200;
const int INF = 1e15;
const int MOD = 998244353;
 
int TN = 1;

int n;
int x[N], g[N], d[N];
int preg[N], pred[N];

void solve() {
	scanf("%lld", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld %lld %lld", x + i, g + i, d + i);
		pred[i] = pred[i - 1] + d[i]; preg[i] = preg[i - 1] + g[i]; 
	}
	int l = 1, r = 1, ans = 0;
	while (l <= r) {
		// printf("%lld %lld\n", l, r);
		int len = x[r] - x[l], energy = pred[r] - pred[l - 1];
		if (energy < 0) {
			break;
		}
		if (len <= energy) {
			ans = max(ans, preg[r] - preg[l - 1]); r++;
		} else {
			l++;
		}
	}
	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:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable : 4996)
 
divide.cpp: In function 'void solve()':
divide.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
divide.cpp:41: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
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Correct 2 ms 548 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 4 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 620 KB Output is correct

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 748 KB Output is correct
2 Correct 6 ms 1004 KB Output is correct
3 Correct 7 ms 1020 KB Output is correct
4 Correct 24 ms 2532 KB Output is correct
5 Correct 28 ms 2532 KB Output is correct
6 Correct 56 ms 4732 KB Output is correct
7 Correct 40 ms 4732 KB Output is correct
8 Correct 43 ms 4732 KB Output is correct
9 Correct 40 ms 4732 KB Output is correct
10 Incorrect 39 ms 4732 KB Output isn't correct
11 Halted 0 ms 0 KB -