oj.uz

답안 #528105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528105 2022-02-19T09:31:17 Z CSQ31 Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll c[200005][3];
int main()
{
	int n;
	cin>>n;
	ll ans = 0;
	for(int i=0;i<2*n;i++){
		int x,y;
		cin>>x>>y;
		if(x<1){
			ans+=1-x;
			x = 1;
		}else if(x>n){
			ans+=x-n;
			x = n;
		}
		if(y<1){
			ans+=1-y;
			y = 1;
		}else if(y>2){
			ans+=y-2;
			y = 2;
		}
		c[x][y]++;
	}
	int cnt = 0;
	for(int i=1;i<=n;i++)cnt+=c[i][1];
	ans+=abs(cnt-n);
	cnt = 0;
	for(int i=1;i<=n;i++){
		cnt+=c[i][1] + c[i][2];
		cnt-=2;
		ans+=abs(cnt);
	}
	cout<<ans<<'\n';
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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