oj.uz

답안 #878852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878852 2023-11-25T10:44:18 Z niter Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ins isnert
#define pii pair<int,int>
#define ff first
#define ss second
#define loop(i,a,b) for(int i = (a); i < (b); i ++)
#define op(x) cerr << #x << " = " << x << endl;
#define opa(x) cerr << #x << " = " << x << ", ";
#define ops(x) cerr << x;
#define spac cerr << ' ';
#define entr cerr << endl;
#define STL(x) cerr << #x << " : "; for(auto &qwe:x) cerr << qwe << ' '; cerr << endl;
#define ARR(x, nnn) cerr << #x << " : "; loop(qwe,0,nnn) cerr << x[qwe] << ' '; cerr << endl;
#define BAE(x) (x).begin(), (x).end()
#pragma GCC optimize("O3")
using namespace std;
typedef long long ll;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());

vector<pii> v;
//ostream& operator<<(ostream &os, pair<int, char> x){
//    os << "[" << x.ff << ", " << x.ss << "]";
//}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    int n, m;
    cin >> n;
    m = n << 1;
    loop(i,0,m){
        int x, y;
        cin >> x >> y;
        v.pb({x, y});
    }
    long long ans = 0;
    // process X axis first
    vector<pair<int, char>> now;
    queue<int> S, T;
    for(auto &i:v){
        now.pb({i.ff, 'S'});
    }
    loop(i,1,n+1){
        now.pb({i, 'T'});
        now.pb({i, 'T'});
    }
    sort(BAE(now));
//    STL(now)
    for(auto &i:now){
        if(i.ss == 'S'){
            if(T.empty()) S.push(i.ff);
            else{
                ans += i.ff - T.front();
                T.pop();
            }
        }
        else{
            if(S.empty()) T.push(i.ff);
            else{
                ans += i.ff - S.front();
                S.pop();
            }
        }
    }
    // then process Y axis
    now.clear();
    for(auto &i:v){
        now.pb({i.ss, 'S'});
    }
    loop(i,1,n+1){
        now.pb({1, 'T'});
        now.pb({2, 'T'});
    }
    sort(BAE(now));
//    STL(now)
    assert(S.size() == 0);
    assert(T.size() == 0);
    for(auto &i:now){
        if(i.ss == 'S'){
            if(T.empty()) S.push(i.ff);
            else{
                ans += i.ff - T.front();
                T.pop();
            }
        }
        else{
            if(S.empty()) T.push(i.ff);
            else{
                ans += i.ff - S.front();
                S.pop();
            }
        }
    }
    cout << ans << '\n';
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -