oj.uz

Submission #728953

# Submission time Handle Problem Language Result Execution time Memory
728953 2023-04-23T10:11:26 Z Uniq0rn Unija (COCI17_unija) C++17
100 / 100
 296 ms 30956 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) begin(x),end(x)
#define pb push_back
#define sz(x) (int)x.size()
#define s second
#define f first

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;cin >> n;
    vector<pair<ll,ll>> a(n);
    for(auto &[x,y]:a){
        cin >> x >> y;
        x/=2;
        y/=2;
    }
    sort(all(a),greater<pair<ll,ll>>());
    ll mxy = 0,ans = 0;
    for(auto &[x,y]:a){
        if(y <= mxy) continue;
        ans += x*(y-mxy);
        mxy = y;
    }
    cout << ans*4;
    return 0;
}

Subtask #1
10.0 / 10.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

Subtask #2
10.0 / 10.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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 15956 KB Output is correct
2 Correct 259 ms 15956 KB Output is correct
3 Correct 273 ms 15956 KB Output is correct

Subtask #6
10.0 / 10.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 1 ms 212 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 724 KB Output is correct
2 Correct 7 ms 1108 KB Output is correct
3 Correct 9 ms 1108 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1876 KB Output is correct
2 Correct 26 ms 3172 KB Output is correct
3 Correct 26 ms 3296 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 4948 KB Output is correct
2 Correct 82 ms 9036 KB Output is correct
3 Correct 79 ms 8980 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 15952 KB Output is correct
2 Correct 279 ms 30956 KB Output is correct
3 Correct 282 ms 30936 KB Output is correct