oj.uz

Submission #901530

# Submission time Handle Problem Language Result Execution time Memory
901530 2024-01-09T14:12:33 Z VinhLuu Art Exhibition (JOI18_art) C++17
50 / 100
 49 ms 21676 KB 
// happy

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
#define int long long
//#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 2e5 + 5;
const int oo = 1e16;
const int mod = 1e9 + 7;
const int base = 29; // >= so pt pb max

int n, a[N], b[N], sum, s[N], st[N << 2], ans;

pii p[N];

void update(int i,int x){
    i += n - 1;
    st[i] = max(st[i], x);
    while(i > 1){
        i /= 2;
        st[i] = max(st[i], x);
    }
}

int get(int l,int r){
    r++;
    int ret = -oo;
    for(l += n - 1, r += n - 1; l < r; l /= 2, r /= 2){
        if(l & 1) ret = max(ret, st[l ++]);
            if(r & 1) ret = max(ret, st[-- r]);
    }
    return ret;
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> a[i] >> b[i];
        p[i] = {a[i], b[i]};
    }
    sort(p + 1, p + n + 1);
    update(1, 0 + p[1].fi);
    for(int i = 1; i <= n; i ++){
        s[i] = s[i - 1] + p[i].se;

        int u = get(1, i) - p[i].fi + s[i];
//        cout << p[i].fi << " " << p[i].se << " h\n";
//        cout << u << " " << i << " " << -s[i]+p[i + 1].fi << " " << get(1, i) << " " << s[i] << " " << " g\n";
        ans = max(ans, u);
        if(i + 1 <= n) update(i + 1, -s[i]+p[i + 1].fi);
    }

    cout << ans;

}

Compilation message

art.cpp: In function 'int main()':
art.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
art.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen(task ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2512 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2520 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2548 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2512 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2520 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2548 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 3 ms 2652 KB Output is correct
35 Correct 2 ms 2896 KB Output is correct
36 Correct 3 ms 2704 KB Output is correct
37 Correct 3 ms 2700 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 2 ms 2792 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 3 ms 2652 KB Output is correct
44 Correct 2 ms 2760 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 2 ms 2900 KB Output is correct
47 Correct 2 ms 2648 KB Output is correct
48 Correct 3 ms 2652 KB Output is correct
49 Correct 3 ms 2648 KB Output is correct
50 Correct 3 ms 2724 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2516 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2512 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2520 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2548 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 3 ms 2652 KB Output is correct
34 Correct 3 ms 2652 KB Output is correct
35 Correct 2 ms 2896 KB Output is correct
36 Correct 3 ms 2704 KB Output is correct
37 Correct 3 ms 2700 KB Output is correct
38 Correct 2 ms 2652 KB Output is correct
39 Correct 2 ms 2792 KB Output is correct
40 Correct 2 ms 2648 KB Output is correct
41 Correct 2 ms 2648 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 3 ms 2652 KB Output is correct
44 Correct 2 ms 2760 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 2 ms 2900 KB Output is correct
47 Correct 2 ms 2648 KB Output is correct
48 Correct 3 ms 2652 KB Output is correct
49 Correct 3 ms 2648 KB Output is correct
50 Correct 3 ms 2724 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct
52 Runtime error 49 ms 21676 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -