Submission #497607

#	Time	Username	Problem	Language	Result	Execution time	Memory
497607		mansur	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	59 ms	4556 KiB

joi2019_ho_t4

#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 (stderr)

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 / 8
• Subtask 2: 29 / 29
• Subtask 3: 63 / 63