oj.uz

Submission #833849

# Submission time Handle Problem Language Result Execution time Memory
833849 2023-08-22T09:02:15 Z BilAktauAlmansur Divide and conquer (IZhO14_divide) C++17
100 / 100
 226 ms 5948 KB 
#include <bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
// #define int long long
using namespace std;
const int N = 1e5 + 7;
int n;
pair<int, pair<int, int> > a[N];
long long pref_d[N], pref_x[N];
signed main() {
    // freopen("bank.in", "r", stdin); 
    // freopen("bank.out", "w", stdout);
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cin>>n;
    for(int i = 1; i <= n; i++) {
        int pos, d, x;
        cin>>pos>>d>>x;
        a[i].first = pos, a[i].second.first = d, a[i].second.second = x;
    }
    sort(a + 1, a + 1 + n);
    for(int i = 1; i <= n; i++) {
        pref_d[i] = pref_d[i - 1] + a[i].second.first;
        pref_x[i] = pref_x[i - 1] + a[i].second.second;
    }
    long long ans = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = i; j <= min(i + 1000, n); j++) {
            long long sum_x = pref_x[j] - pref_x[i - 1], sum_d = pref_d[j] - pref_d[i - 1];
            int len = a[j].first - a[i].first;
            if(len <= sum_x) {
                ans = max(ans, sum_d);
            }
        }
        for(int j = n; j >= max(i, n - 1000); j--) {
            long long sum_x = pref_x[j] - pref_x[i - 1], sum_d = pref_d[j] - pref_d[i - 1];
            int len = a[j].first - a[i].first;
            if(len <= sum_x) {
                ans = max(ans, sum_d);
            }
        }
    }
    cout << ans << '\n';
}

Compilation message

divide.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("g",on)
      | 
divide.cpp:8: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    8 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 7 ms 468 KB Output is correct
24 Correct 7 ms 468 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 7 ms 468 KB Output is correct
24 Correct 7 ms 468 KB Output is correct
25 Correct 10 ms 468 KB Output is correct
26 Correct 20 ms 612 KB Output is correct
27 Correct 21 ms 608 KB Output is correct
28 Correct 104 ms 1688 KB Output is correct
29 Correct 106 ms 2996 KB Output is correct
30 Correct 226 ms 5948 KB Output is correct
31 Correct 207 ms 4780 KB Output is correct
32 Correct 207 ms 4872 KB Output is correct
33 Correct 211 ms 4684 KB Output is correct
34 Correct 143 ms 4692 KB Output is correct
35 Correct 142 ms 5188 KB Output is correct
36 Correct 140 ms 5356 KB Output is correct