Submission #865882

# Submission time Handle Problem Language Result Execution time Memory
865882 2023-10-25T02:01:19 Z phoenix0423 Coin Collecting (JOI19_ho_t4) C++17
37 / 100
1 ms 604 KB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 3000 + 5;
const int INF = 1e9;
const double eps = 1e-7;

int cnt[maxn][2];

int main(void){
	fastio;
	int n;
	cin>>n;
	ll ans = 0;
	for(int i = 0; i < 2 * n; i++){
		int x, y;
		cin>>x>>y;
		x--, y--;
		if(y >= 1) ans += y - 1, y = 1;
		else ans += -y, y = 0;
		if(x >= n - 1) ans += x - n + 1, x = n - 1;
		else if(x < 0) ans += -x, x = 0;
		cnt[x][y]++;
	}
	for(int j = 0; j < 2; j++){
		for(int i = 0; i < n; i++) cnt[i][j] -= 1;
	}
	vector<int> dist(2), cur(2);
	//see operations as moving boxed
	for(int i = 0; i < n; i++){
		ans += abs(cur[0]) + abs(cur[1]);
		cur[0] += cnt[i][0], cur[1] += cnt[i][1];
		if(cur[0] > 0 && cur[1] < 0){
			int trade = min(cur[0], -cur[1]);
			ans += trade;
			cur[0] -= trade, cur[1] += trade;
		}
		if(cur[1] > 0 && cur[0] < 0){
			int trade = min(-cur[0], cur[1]);
			ans += trade;
			cur[0] += trade, cur[1] -= trade;
		}
	}
	cout<<ans<<"\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 456 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 460 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 1 ms 356 KB Output is correct
33 Correct 0 ms 352 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 456 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 460 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 1 ms 356 KB Output is correct
33 Correct 0 ms 352 KB Output is correct
34 Correct 0 ms 352 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 352 KB Output is correct
39 Correct 1 ms 352 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 352 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 352 KB Output is correct
45 Correct 1 ms 472 KB Output is correct
46 Correct 1 ms 356 KB Output is correct
47 Correct 1 ms 352 KB Output is correct
48 Correct 1 ms 352 KB Output is correct
49 Correct 1 ms 352 KB Output is correct
50 Correct 1 ms 352 KB Output is correct
51 Correct 1 ms 356 KB Output is correct
52 Correct 1 ms 352 KB Output is correct
53 Correct 1 ms 356 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 496 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 456 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 460 KB Output is correct
31 Correct 0 ms 356 KB Output is correct
32 Correct 1 ms 356 KB Output is correct
33 Correct 0 ms 352 KB Output is correct
34 Correct 0 ms 352 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 352 KB Output is correct
39 Correct 1 ms 352 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 352 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 352 KB Output is correct
45 Correct 1 ms 472 KB Output is correct
46 Correct 1 ms 356 KB Output is correct
47 Correct 1 ms 352 KB Output is correct
48 Correct 1 ms 352 KB Output is correct
49 Correct 1 ms 352 KB Output is correct
50 Correct 1 ms 352 KB Output is correct
51 Correct 1 ms 356 KB Output is correct
52 Correct 1 ms 352 KB Output is correct
53 Correct 1 ms 356 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 496 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 464 KB Output is correct
65 Runtime error 1 ms 604 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -