oj.uz

Submission #241122

# Submission time Handle Problem Language Result Execution time Memory
241122 2020-06-22T21:02:51 Z aggu_01000101 Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 6 ms 512 KB 
#include <bits/stdc++.h>
#define int long long
#define INF 100000000
using namespace std;
int n;
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    priority_queue<pair<int, int>> p;
    int cost = 0;
    vector<int> v[2];
    int mat[2*n+1][3];
    for(int i = 0;i<=(2*n);i++){
        for(int j = 0;j<3;j++) mat[i][j] = 0;
    }
    vector<int> coin[2], need[2];
    for(int i = 0;i<(2*n);i++){
        int x, y;
        cin>>x>>y;
        if(y<=1){
            cost+=(1 - y);
            y = 1;
        }
        else{
            cost+=(y - 2);
            y = 2;
        }
        if(x<1){
            cost += (1 - x);
            x = 1;
        }
        if(x>n){
            cost += (x - n);
            x = n;
        }
        mat[x][y]++;
    }
    for(int i = 1;i<=(2*n);i++){
        for(int j = 1;j<=2;j++){
            if(mat[i][j] == 0) coin[j].push_back(i);
            while(mat[i][j] > 1){
                need[j].push_back(i);
                mat[i][j]--;
            }
            while(need[j].size() && coin[j].size()){
                cost+=(abs(need[j].back() - coin[j].back()));
                need[j].pop_back(); coin[j].pop_back();
            }
        }
        for(int j = 1;j<=2;j++){
            int k = j^3;
            while(need[k].size() && coin[j].size()){
                cost+=(abs(need[k].back() - coin[j].back()) + 1);
                need[k].pop_back(); coin[j].pop_back();
            }
        }
    }
    cout<<cost<<endl;

}
/*

5
1000000000 1000000000
-1000000000 1000000000
-1000000000 -1000000000
1000000000 -1000000000
-1 -5
-2 2
2 8
4 7
-2 5
7 3
 */

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -