oj.uz

답안 #237240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237240 2020-06-05T11:42:46 Z _7_7_ Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


int n, x[N], y[N], ans, cnt[N][2], cnt1[2];
deque < int > need[2], have[2];

main () {
	cin >> n;
	for (int i = 1; i <= n + n; ++i) {
	    cin >> x[i] >> y[i];
		if (x[i] > n) {
			ans += x[i] - n;
			x[i] = n;
		}
		if (x[i] < 1) {
			ans += 1 - x[i];
			x[i] = 1;
		}
		if (y[i] > 2) {
			ans += y[i] - 2;
			y[i] = 2;
		}
		if (y[i] < 1) {
			ans += 1 - y[i];
			y[i] = 1;
		}

		--y[i];
		++cnt[x[i]][y[i]];
		++cnt1[y[i]];
	}

	if (cnt1[0] < cnt1[1]) {
		swap(cnt1[0], cnt1[1]);
		for (int i = 1; i <= n; ++i)
			swap(cnt[i][0], cnt[i][1]);
	}

	int diff = cnt1[0] - cnt1[1];

	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < 2; ++j) {
			for (int x = 0; x < cnt[i][j]; ++x)
				 have[j].pb(i); 			
			need[j].pb(i);
			while (sz(need[j]) && sz(have[j])) {
				ans += abs(need[j].front() - have[j].front());
				need[j].pop_front();
				have[j].pop_front();
			}
		}
		
		while (sz(need[1]) && sz(have[0]) && diff) {
			--diff;				
			ans += abs(need[1].front() - have[0].front()) + 1;
			have[0].pop_front();
			need[1].pop_front();
		}
	}

	cout << ans << endl;
}

Compilation message

joi2019_ho_t4.cpp:44:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -