oj.uz

Submission #833834

# Submission time Handle Problem Language Result Execution time Memory
833834 2023-08-22T08:54:03 Z BilAktauAlmansur Divide and conquer (IZhO14_divide) C++17
48 / 100
 1000 ms 880 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];
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);
    long long ans = 0;
    for(int i = 1; i <= n; i++) {
        long long sum_d = 0, sum_x = 0;
        for(int j = i; j <= n; j++) {
            sum_x += a[j].second.second, sum_d += a[j].second.first;
            int len = a[j].first - a[i].first;
            if(len <= sum_x) {
                // cout << i << ' ' << j << ' ' << len << ' ' << sum_x << '\n';
                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 1 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 0 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 212 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 1 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 0 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 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 11 ms 340 KB Output is correct
24 Correct 11 ms 352 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 11 ms 340 KB Output is correct
24 Correct 11 ms 352 KB Output is correct
25 Correct 18 ms 380 KB Output is correct
26 Correct 54 ms 424 KB Output is correct
27 Correct 61 ms 424 KB Output is correct
28 Execution timed out 1093 ms 880 KB Time limit exceeded
29 Halted 0 ms 0 KB -