oj.uz

Submission #1105218

# Submission time Handle Problem Language Result Execution time Memory
1105218 2024-10-25T18:37:50 Z sktodow Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 344 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
     
#define int long long 
#define pb push_back
#define mid (l+(r-l)/2)
#define f first
#define s second
const int N=2505;
const int MOD=1e9+7;
const long long inf=2e18+5;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;


int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    int n; cin>>n;
    vector<array<int,2>>v(n+1);
    for(int i=1;i<=n;i++){
        cin>>v[i][0]>>v[i][1];
    }
    sort(v.begin(),v.end());
    vector<int>pref(n+1,0);
    for(int i=1;i<=n;i++){
        pref[i]=pref[i-1]+v[i][1];
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j++){
            int curr=pref[j]-pref[i-1];
            ans=max(ans,curr-v[j][0]+v[i][0]);
        }
    }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -