Submission #633937

#	Time	Username	Problem	Language	Result	Execution time	Memory
633937		Karliver	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	72 ms	10384 KiB

joi2019_ho_t4

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 205;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)

	
void solve() {	
	
	int n;
	cin >> n;
	
	VV<int> a(n, V<int>(2));
	ll ret = 0;
	forn(j, 2*n) {
		ll x, y;
		cin >> x >> y;
		
		if(x > n) ret += x - n, x = n;
		else if(x < 1) ret += 1 - x, x = 1;
		
		if(y > 2) ret += y - 2, y = 2;
		else if(y < 1) ret += 1 - y, y = 1;
		--y;
		--x;
		a[x][y]++;
	}
	
	for(int i1 = 0, i2 = 0, j = 0;i1 < n || i2 < n;) {
		while(!a[j][0] && !a[j][1]) ++j;
		
		if(a[j][0] && i1 <= j) {
			ret += j-i1++;
			a[j][0]--;
		}
		else if(a[j][1] && i2 <= j) {
			ret += j - i2++;
			a[j][1]--;
		}
		else if(a[j][0] && i2 <= j) {
			ret += j - i2++;
			ret++;
			a[j][0]--;
		}
		else if(a[j][1] && i1 <= j) {
			ret += j - i1++;
			ret++;
			a[j][1]--;
		}
		else {
		
			a[j+1][0] += a[j][0];
			a[j+1][1] += a[j][1];
			ret += a[j][0]+a[j][1];
			++j;
		}
	}
	cout  << ret << '\n';
			
}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}
         
    

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