oj.uz

답안 #1116194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116194 2024-11-21T10:27:45 Z Dan4Life Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 2 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
#define int long long
const int N = (int)2e5+10;
int n, a[N][2], b[2];

int32_t main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n; int ans = 0, xd = 0;
	for(int i = 0; i < 2*n; i++){
		int x, y; cin >> x >> y; int X=x,Y=y;
		x=clamp(x,1ll,n), y=clamp(y,1ll,2ll);
		ans+=abs(X-x)+abs(Y-y); a[x][y-1]++;
	}
	for(int i = 1; i <= n; i++){
		b[0]+=a[i][0]-1,b[1]+=a[i][1]-1; xd=min(abs(b[0]),abs(b[1]));
		if(b[0]>0 and b[1]<0) ans+=xd,b[0]-=xd,b[1]+=xd;
		else if(b[1]>0 and b[0]<0) ans+=xd,b[1]-=xd,b[0]-=xd;
		ans+=abs(b[0])+abs(b[1]);
	}
	cout << ans << "\n";
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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