Submission #1149328

#	Time	Username	Problem	Language	Result	Execution time	Memory
1149328		KluydQ	Coin Collecting (JOI19_ho_t4)	C++20	0 / 100	0 ms	328 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
 
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define ll long long
#define int long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N = 1e6 + 123;
const int inf = 2e18;
const int MOD = 1e9 + 7;
const int MOD1 = 998244353;
const int P = 6547;
 
int a[N], b[N], c[N], n, m, x, y, z, w;
int mz[N], used[N][2];
 
mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
void solve()
{
	cin >> n;
	int ans = 0;
	
	FOR( i, 1, n * 2, 1 )
	{
		cin >> x >> y;
		
		if( x < 1 ) ans += 1 - x, x = 1;
		if( x > n ) ans += x - n, x = n;
		if( y < 1 ) ans += 1 - y, y = 1;
		if( y > 2 ) ans += y - 2, y = 2;
		
		used[x][y] ++;
	}
	FORR( i, n, 1, 1 )
	{
		FOR( j, 1, 2, 1 )
		{
			if( !used[i][j] )
			{
				int mn = inf, idx, idy;
				
				FOR( i2, i, n, 1 )
				{
					FOR( j2, 1, 2, 1 )
					{
						if( used[i2][j2] > 1 && abs(i - i2) + abs(j - j2) < mn )
						{
							mn = abs(i - i2) + abs(j - j2);
							idx = i2, idy = j2;
						}
					}
				}
				if( mn == inf )
				{
					FOR( i2, 1, i - 1, 1 )
					{
						FOR( j2, 1, 2, 1 )
						{
							if( used[i2][j2] > 0 && abs(i - i2) + abs(j - j2) < mn )
							{
								mn = abs(i - i2) + abs(j - j2);
								idx = i2, idy = j2;
							}
						}
					}
				}
				used[idx][idy] --;
				ans += mn;
			}
		}
	}
	cout << ans;
}
signed main() 
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ  

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'void solve()':
joi2019_ho_t4.cpp:58:39: warning: iteration 1 invokes undefined behavior [-Waggressive-loop-optimizations]
   58 |                         if( !used[i][j] )
      |                              ~~~~~~~~~^
joi2019_ho_t4.cpp:7:45: note: within this loop
    7 | #define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
      |                                             ^
joi2019_ho_t4.cpp:56:17: note: in expansion of macro 'FOR'
   56 |                 FOR( j, 1, 2, 1 )
      |                 ^~~
joi2019_ho_t4.cpp:79:72: warning: iteration 1 invokes undefined behavior [-Waggressive-loop-optimizations]
   79 |                                                         if( used[i2][j2] > 0 && abs(i - i2) + abs(j - j2) < mn )
      |                                                             ~~~~~~~~~~~^
joi2019_ho_t4.cpp:7:45: note: within this loop
    7 | #define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
      |                                             ^
joi2019_ho_t4.cpp:77:49: note: in expansion of macro 'FOR'
   77 |                                                 FOR( j2, 1, 2, 1 )
      |                                                 ^~~
joi2019_ho_t4.cpp:66:64: warning: iteration 1 invokes undefined behavior [-Waggressive-loop-optimizations]
   66 |                                                 if( used[i2][j2] > 1 && abs(i - i2) + abs(j - j2) < mn )
      |                                                     ~~~~~~~~~~~^
joi2019_ho_t4.cpp:7:45: note: within this loop
    7 | #define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
      |                                             ^
joi2019_ho_t4.cpp:64:41: note: in expansion of macro 'FOR'
   64 |                                         FOR( j2, 1, 2, 1 )
      |                                         ^~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63