oj.uz

답안 #497607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497607 2021-12-23T10:39:39 Z mansur Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 59 ms 4556 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e18, N = 1e6 + 1, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
int c[N][3];
 
main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, ans = 0;
	cin >> n;
	for (int i = 1, x, y; i <= n * 2; i++) {
		cin >> x >> y;
		if (x >= 1 && x <= n) {
			if (y <= 1) c[x][1]++, ans += 1 - y;
			if (y >= 2) c[x][2]++, ans += y - 2; 
		}else if (y == 1 || y == 2) {
			if (x > n) c[n][y]++, ans += x - n;
			if (x < 1) c[1][y]++, ans += 1 - x;		
		}else {                                           
			if (x < 1) {
				if (y < 1) c[1][1]++, ans += 1 - x + 1 - y;
				if (y > 2) c[1][2]++, ans += 1 - x + y - 2;
			}else {
				if (y < 1) c[n][1]++, ans += x - n + 1 - y;
				if (y > 2) c[n][2]++, ans += x - n + y - 2;
			}
		}
	}
	int u = 0, d = 0;
	for (int i = 1; i <= n; i++) {
		int x = max(0ll, min(d, c[i][1] - 1));
		d -= x;
		c[i][1] -= x;
		x = max(0ll, min(u, c[i][2] - 1));
		u -= x;
		c[i][2] -= x;
		x = max(0ll, min(d, c[i][2] - 1));
		d -= x;       
		c[i][2] -= x;
		ans += x;
		x = max(0ll, min(u, c[i][1] - 1));
		u -= x;
		c[i][1] -= x;
		ans += x;
		if (c[i][1] > 1 && !c[i][2]) {
			ans++;
			c[i][1]--;
			c[i][2]++;
		}
		if (c[i][2] > 1 && !c[i][1]) {
			ans++;
			c[i][2]--;
			c[i][1]++;
		}
		if (c[i][1] > 1) {
			c[i + 1][1] += c[i][1] - 1;
			ans += c[i][1] - 1;
			c[i][1] = 1;
		}
		if (c[i][2] > 1) {
			c[i + 1][2] += c[i][2] - 1;
			ans += c[i][2] - 1;
			c[i][2] = 1;
		}
		if (!c[i][1]) d++;
		if (!c[i][2]) u++;
		ans += u + d;
	}
	cout << ans;
}

Compilation message

joi2019_ho_t4.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
joi2019_ho_t4.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
joi2019_ho_t4.cpp:37:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   37 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 304 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 0 ms 320 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 324 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 304 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 0 ms 320 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 324 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 356 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 352 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 304 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 0 ms 320 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 324 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 356 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 352 KB Output is correct
65 Correct 38 ms 4176 KB Output is correct
66 Correct 52 ms 4444 KB Output is correct
67 Correct 53 ms 4404 KB Output is correct
68 Correct 47 ms 4404 KB Output is correct
69 Correct 47 ms 4556 KB Output is correct
70 Correct 52 ms 4504 KB Output is correct
71 Correct 40 ms 4456 KB Output is correct
72 Correct 41 ms 4500 KB Output is correct
73 Correct 48 ms 4452 KB Output is correct
74 Correct 43 ms 4408 KB Output is correct
75 Correct 39 ms 4460 KB Output is correct
76 Correct 41 ms 4468 KB Output is correct
77 Correct 41 ms 4420 KB Output is correct
78 Correct 40 ms 4468 KB Output is correct
79 Correct 49 ms 4428 KB Output is correct
80 Correct 40 ms 4412 KB Output is correct
81 Correct 40 ms 4476 KB Output is correct
82 Correct 55 ms 4404 KB Output is correct
83 Correct 47 ms 4492 KB Output is correct
84 Correct 41 ms 4404 KB Output is correct
85 Correct 41 ms 4404 KB Output is correct
86 Correct 45 ms 4424 KB Output is correct
87 Correct 52 ms 4420 KB Output is correct
88 Correct 50 ms 4420 KB Output is correct
89 Correct 41 ms 4292 KB Output is correct
90 Correct 46 ms 4300 KB Output is correct
91 Correct 56 ms 4296 KB Output is correct
92 Correct 46 ms 4324 KB Output is correct
93 Correct 59 ms 4356 KB Output is correct
94 Correct 49 ms 4288 KB Output is correct
95 Correct 42 ms 4352 KB Output is correct
96 Correct 39 ms 4292 KB Output is correct
97 Correct 58 ms 4276 KB Output is correct
98 Correct 53 ms 4292 KB Output is correct
99 Correct 47 ms 4292 KB Output is correct
100 Correct 41 ms 4280 KB Output is correct
101 Correct 40 ms 4228 KB Output is correct
102 Correct 42 ms 4232 KB Output is correct
103 Correct 45 ms 4328 KB Output is correct