oj.uz

Submission #370182

# Submission time Handle Problem Language Result Execution time Memory
370182 2021-02-23T14:31:32 Z Atill83 Unija (COCI17_unija) C++14
100 / 100
 332 ms 23576 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;
    vector<pii> st;
    for(int i = 0; i < n; i++){
        int x, y;
        cin>>x>>y;
        x /= -2;
        y /= -2;
        st.push_back({x, y});
    }

    sort(st.begin(), st.end());


    ll pos = -mod, ans = 0, heg = 0;
    

    for(auto u: st){
        ll ex = (u.ff - pos) * heg;
        ans += ex;
        heg = max(heg, 0LL - u.ss);
        pos = u.ff;
    }

    ans += -pos*heg;

    cout<<4*ans<<endl;  



    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 10432 KB Output is correct
2 Correct 332 ms 23576 KB Output is correct
3 Correct 327 ms 23504 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 4580 KB Output is correct
2 Correct 89 ms 4708 KB Output is correct
3 Correct 95 ms 4620 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 8668 KB Output is correct
2 Correct 317 ms 8668 KB Output is correct
3 Correct 329 ms 8668 KB Output is correct