oj.uz

답안 #895101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895101 2023-12-29T12:24:09 Z vjudge1 Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 38 ms 6748 KB 
// Problem: B - Coin Collecting
// Contest: Virtual Judge - Yosik IOI contest #1
// URL: https://vjudge.net/contest/601761#problem/B
// Memory Limit: 268 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define all(v) (v).begin(),(v).end()
#define rall(v) ((v).rbegin()), ((v).rend())
#define out(v)  for(auto& i : v) cout << i << ' ';
#define F first
#define S second
#define int long long

const ll N = 1e5 + 17;
const ll MOD = 1e9 + 7;
const string alf = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int n;
int dp[N][4];
pair <int , int > xy[] = {{0 , 1} , {0 , -1} , {1 , 0} , {-1 , 0}};

bool oke(int x ,int y){
	if (n >= 1 && n <= n && y >= 1 && y <= 2)return true;
	return false;
}

void solve (){
	cin >> n;
	map <pair <int , int > ,int > cnt;
	int ans = 0;
	queue <pair <int , int > > q;
	for(int i = 1; i <= 2 * n; i ++){
		int x , y;
		cin >> x >> y;
		int cur = 0 , cur2 = 0;
		if (x >= 1 && x <= n){}
		else {
			if (abs(x - 1) <= abs(x - n)){
				ans += abs(x - 1);
				x = 1;
			}
			else {
				ans += abs(x - n);
				x = n;
			}
		}
		if (y >= 1 && y <= 2){}
		else {
			if (abs(y - 1) <= abs(y - 2)){
				ans += abs(y - 1);
				y = 1;
			}
			else {
				ans += abs(y - 2);
				y = 2;
			}
		}
		dp[x][y] ++;
	}
	// cout << ans << endl;
	int cur = 0 , cur2 = 0;
	for(int i = 1; i <= n; i ++){
		cur += dp[i][1] - 1;
		cur2 += dp[i][2] - 1;
		// cout << cur << " " << cur2 << endl;
		while (cur > 0 && cur2 < 0){
			ans ++;
			cur --;
			cur2 ++;
		}
		while (cur < 0 && cur2 > 0){
			ans ++;
			cur ++;
			cur2 --;
		}
		ans += abs(cur + cur2);
	}
	cout << ans;
	cout << endl;
}

signed main(){
	// freopen("ones.in" , "r" , stdin) ;
	// freopen("ones.out" , "w" , stdout) ;
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	// int cs = 1;
	// cin >>T;
	while (T --){
		// cout <<"Case " << cs ++<< ":" << endl;
		solve ();
		// cout <<endl;
	}
}

Compilation message

joi2019_ho_t4.cpp: In function 'bool oke(long long int, long long int)':
joi2019_ho_t4.cpp:30:18: warning: self-comparison always evaluates to true [-Wtautological-compare]
   30 |  if (n >= 1 && n <= n && y >= 1 && y <= 2)return true;
      |                ~ ^~ ~
joi2019_ho_t4.cpp: In function 'void solve()':
joi2019_ho_t4.cpp:42:7: warning: unused variable 'cur' [-Wunused-variable]
   42 |   int cur = 0 , cur2 = 0;
      |       ^~~
joi2019_ho_t4.cpp:42:17: warning: unused variable 'cur2' [-Wunused-variable]
   42 |   int cur = 0 , cur2 = 0;
      |                 ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 0 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 0 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 476 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 484 KB Output is correct
40 Correct 1 ms 488 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 512 KB Output is correct
48 Correct 1 ms 508 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 532 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 480 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 856 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 524 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 0 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 476 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 484 KB Output is correct
40 Correct 1 ms 488 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 512 KB Output is correct
48 Correct 1 ms 508 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 532 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 480 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 856 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 524 KB Output is correct
65 Correct 20 ms 4956 KB Output is correct
66 Correct 38 ms 4928 KB Output is correct
67 Correct 29 ms 6748 KB Output is correct
68 Correct 29 ms 6740 KB Output is correct
69 Correct 29 ms 6736 KB Output is correct
70 Correct 34 ms 6736 KB Output is correct
71 Correct 28 ms 6740 KB Output is correct
72 Correct 28 ms 5468 KB Output is correct
73 Correct 28 ms 3676 KB Output is correct
74 Correct 28 ms 5564 KB Output is correct
75 Correct 30 ms 5556 KB Output is correct
76 Correct 28 ms 5676 KB Output is correct
77 Correct 32 ms 5460 KB Output is correct
78 Correct 30 ms 5700 KB Output is correct
79 Correct 28 ms 5724 KB Output is correct
80 Correct 28 ms 5692 KB Output is correct
81 Correct 29 ms 5696 KB Output is correct
82 Correct 28 ms 5456 KB Output is correct
83 Correct 28 ms 5712 KB Output is correct
84 Correct 28 ms 5724 KB Output is correct
85 Correct 28 ms 5708 KB Output is correct
86 Correct 28 ms 6224 KB Output is correct
87 Correct 30 ms 6228 KB Output is correct
88 Correct 29 ms 6644 KB Output is correct
89 Correct 29 ms 6644 KB Output is correct
90 Correct 29 ms 6644 KB Output is correct
91 Correct 28 ms 6744 KB Output is correct
92 Correct 28 ms 6748 KB Output is correct
93 Correct 32 ms 6740 KB Output is correct
94 Correct 28 ms 6512 KB Output is correct
95 Correct 27 ms 6492 KB Output is correct
96 Correct 28 ms 6512 KB Output is correct
97 Correct 28 ms 6580 KB Output is correct
98 Correct 29 ms 5456 KB Output is correct
99 Correct 28 ms 6224 KB Output is correct
100 Correct 31 ms 5848 KB Output is correct
101 Correct 29 ms 5936 KB Output is correct
102 Correct 29 ms 5704 KB Output is correct
103 Correct 28 ms 5712 KB Output is correct