oj.uz

Submission #404614

# Submission time Handle Problem Language Result Execution time Memory
404614 2021-05-14T18:07:40 Z Antekb Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 1 ms 328 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int tab[N][3];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	long long ans=0;
	for(int i=0; i<2*n; i++){
		int x, y;
		cin>>x>>y;
		if(x>n){
			ans+=x-n;
			x=n;
		}
		if(x<1){
			ans+=1-x;
			x=1;
		}
		if(y<1){
			ans+=1-y;
			y=1;
		}
		if(y>2){
			ans+=y-2;
			y=2;
		}
		//cout<<ans<<" "<<x<<" "<<y<<"\n";
		tab[x][y]++;
	}
	long long ile=0, x=0;
	//potrzebne=2*i
	for(int i=1; i<=n; i++){
		x+=tab[i][1];
		ile+=tab[i][1]+tab[i][2];
		ans+=abs(ile-2*i);
	}
	ans+=abs(x-n);
	cout<<ans;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 320 KB Output isn't correct
7 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 320 KB Output isn't correct
7 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 320 KB Output isn't correct
7 Halted 0 ms 0 KB -