oj.uz

Submission #532929

# Submission time Handle Problem Language Result Execution time Memory
532929 2022-03-04T08:46:10 Z amunduzbaev Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 316 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n; n <<= 1;
	vector<ar<int, 2>> a(n), b(n);
	for(int i=0;i<n;i++){
		cin>>a[i][0]>>a[i][1];
		b[i][0] = i / 2 + 1, b[i][1] = (i&1) + 1;
	}
	int res = 0;
	for(int i=0;i<n;i++){
		if(a[i][1] > 2) res += (a[i][1] - 2), a[i][1] = 2;
		if(a[i][1] < 1) res += (1 - a[i][1]), a[i][1] = 1;
	}
	
	sort(a.begin(), a.end());
	deque<int> tmp[2];
	for(int i=0;i<n;i++){
		if(a[i][1] == b[i][1]){
			res += abs(a[i][0] - b[i][0]);
		} else {
			tmp[a[i][1] - 1].push_back(i);
		}
	}
	
	while(!tmp[0].empty() && !tmp[1].empty()){
		int i = tmp[0].front(), j = tmp[1].front();
		if(i > j) swap(i, j);
		if(a[j][0] <= b[i][0] || b[j][0] <= a[i][0]){
			assert(a[i][1] == b[j][1] && a[j][1] == b[i][1]);
			res += abs(a[i][0] - b[j][0]) + abs(a[j][0] - b[i][0]);
			tmp[0].pop_front(), tmp[1].pop_front();
		} else {
			res += abs(a[i][0] - b[i][0]) + 1;
			if(tmp[0].front() == i) tmp[0].pop_front();
			else tmp[1].pop_front();
		}
	}
	
	for(auto i : tmp[0]) res += abs(a[i][0] - b[i][0]) + 1;
	for(auto i : tmp[1]) res += abs(a[i][0] - b[i][0]) + 1;
	
	cout<<res<<"\n";
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -