oj.uz

Submission #239682

# Submission time Handle Problem Language Result Execution time Memory
239682 2020-06-17T07:24:50 Z b00n0rp Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 305 ms 9968 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")\
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// -------------------</optimizations>--------------------

// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
// ---------------</Headers and namespaces>---------------

// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)

typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))

// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);

#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);

#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----

// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);

#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);

#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);

#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----

#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

// ----------------</Defines and typedefs>----------------

// -------------------<Debugging stuff>-------------------
#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
#else
#define trace(...)
#endif

// ------------------</Debugging stuff>-------------------

// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI = acos(-1);

#ifdef int
const int INF = 1e16;
#else
const int INF = 1e9;
#endif

const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;

// -----------------------</Consts>-----------------------

// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.

// ------------------------</RNG>-------------------------
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b) { return(b ? __gcd(a, b) : a); }
template<typename T> T lcm(T a, T b) { return(a * (b / gcd(a, b))); }
int add(int a, int b, int c = MOD) { int res = a + b; return(res >= c ? res - c : res); }
int mod_neg(int a, int b, int c = MOD) { int res; if (abs(a - b) < c)res = a - b; else res = (a - b) % c; return(res < 0 ? res + c : res); }
int mul(int a, int b, int c = MOD) { ll res = (ll)a * b; return(res >= c ? res % c : res); }
int muln(int a, int b, int c = MOD) { ll res = (ll)a * b; return ((res % c) + c) % c; }
ll mulmod(ll a, ll b, ll m = MOD) { ll q = (ll)(((LD)a * (LD)b) / (LD)m); ll r = a * b - q * m; if (r > m)r %= m; if (r < 0)r += m; return r; }
template<typename T>T expo(T e, T n) { T x = 1, p = e; while (n) { if (n & 1)x = x * p; p = p * p; n >>= 1; }return x; }
template<typename T>T power(T e, T n, T m = MOD) { T x = 1, p = e; while (n) { if (n & 1)x = mul(x, p, m); p = mul(p, p, m); n >>= 1; }return x; }
template<typename T>T extended_euclid(T a, T b, T& x, T& y) {
	T xx = 0, yy = 1; y = 0; x = 1; while (b) {
		T q = a / b, t = b; b = a % b; a = t; \
			t = xx; xx = x - q * xx; x = t; t = yy; yy = y - q * yy; y = t;
	}return a;
}
template<typename T>T mod_inverse(T a, T n = MOD) { T x, y, z = 0; T d = extended_euclid(a, n, x, y); return(d > 1 ? -1 : mod_neg(x, z, n)); }
const int FACSZ = 1; // Make sure to change this
int fact[FACSZ], ifact[FACSZ];
void precom(int c = MOD) {
	fact[0] = 1;
	FOR(i, 1, FACSZ) fact[i] = mul(fact[i - 1], i, c);
	ifact[FACSZ - 1] = mod_inverse(fact[FACSZ - 1], c);
	REPD(i, FACSZ - 1) {
		ifact[i] = mul(i + 1, ifact[i + 1], c);
	}
}
int ncr(int n, int r, int c = MOD) {
	return mul(mul(ifact[r], ifact[n - r], c), fact[n], c);
}
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------

void solvethetestcase();

signed main() {
	// (UNCOMMENT FOR CIN/COUT) \
	FAST_IO
	PRECISION(10)

		int t = 1;
	// (UNCOMMENT FOR MULTIPLE TEST CASES) \
	sfl(t);
	FOR(testcase, 1, t + 1) {
		// (UNCOMMENT FOR CODEJAM) \
		printf("Case #%lld: ",testcase); 
		solvethetestcase();
	}
}

int n;
pii a[200005];	
vi gg[2];
int ans = 0;

void solvethetestcase() {
	cin >> n;
	REP(i, 2 * n){
		cin >> a[i].F >> a[i].S;
		if (a[i].S >= 2) {
			ans += a[i].S - 2;
			a[i].S = 2;
		}
		else {
			ans += 1 - a[i].S;
			a[i].S = 1;
		}
		if (a[i].F <= 1) {
			ans += 1 - a[i].F;
			a[i].F = 1;
		}
		else if (a[i].F >= n) {
			ans += a[i].F - n;
			a[i].F = n;
		}
		a[i].F--;
		a[i].S--;
		gg[a[i].S].pb(a[i].F);
	}
	sort(all(gg[0]));
	sort(all(gg[1]));
	int i0 = 0,i1 = 0,c0 = 0,c1 = 0;
	REP(i,n){
		while(i0 <= i and c0 < gg[0].size() and gg[0][c0] <= i){
			ans += abs(i0-gg[0][c0]);
			i0++;
			c0++;
		}
		while(i1 <= i and c1 < gg[1].size() and gg[1][c1] <= i){
			ans += abs(i1-gg[1][c1]);
			i1++;	
			c1++;
		}
		while(i0 <= i and c1 < gg[1].size() and gg[1][c1] <= i){
			ans += abs(i0-gg[1][c1])+1;
			i0++;
			c1++;
		}
		while(i1 <= i and c0 < gg[0].size() and gg[0][c0] <= i){
			ans += abs(i1-gg[0][c0])+1;
			i1++;
			c0++;
		}
	}
	pfl(ans)
}

Compilation message

joi2019_ho_t4.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
joi2019_ho_t4.cpp:6:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN NEEDED)\
 ^
joi2019_ho_t4.cpp:54:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
joi2019_ho_t4.cpp:209:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
joi2019_ho_t4.cpp:214:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
joi2019_ho_t4.cpp:217:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
joi2019_ho_t4.cpp: In function 'void solvethetestcase()':
joi2019_ho_t4.cpp:256:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i0 <= i and c0 < gg[0].size() and gg[0][c0] <= i){
                     ~~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:261:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i1 <= i and c1 < gg[1].size() and gg[1][c1] <= i){
                     ~~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:266:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i0 <= i and c1 < gg[1].size() and gg[1][c1] <= i){
                     ~~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:271:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i1 <= i and c0 < gg[0].size() and gg[0][c0] <= i){
                     ~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 4 ms 256 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 260 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 4 ms 256 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 4 ms 256 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 260 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 4 ms 256 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 7 ms 384 KB Output is correct
40 Correct 7 ms 384 KB Output is correct
41 Correct 6 ms 384 KB Output is correct
42 Correct 7 ms 384 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 7 ms 384 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 6 ms 384 KB Output is correct
48 Correct 6 ms 384 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Correct 7 ms 384 KB Output is correct
51 Correct 7 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 7 ms 384 KB Output is correct
54 Correct 7 ms 384 KB Output is correct
55 Correct 7 ms 384 KB Output is correct
56 Correct 6 ms 384 KB Output is correct
57 Correct 7 ms 384 KB Output is correct
58 Correct 6 ms 384 KB Output is correct
59 Correct 7 ms 384 KB Output is correct
60 Correct 7 ms 384 KB Output is correct
61 Correct 8 ms 384 KB Output is correct
62 Correct 7 ms 384 KB Output is correct
63 Correct 6 ms 384 KB Output is correct
64 Correct 7 ms 384 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 4 ms 256 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 260 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 256 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 4 ms 256 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 7 ms 384 KB Output is correct
40 Correct 7 ms 384 KB Output is correct
41 Correct 6 ms 384 KB Output is correct
42 Correct 7 ms 384 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 7 ms 384 KB Output is correct
46 Correct 7 ms 384 KB Output is correct
47 Correct 6 ms 384 KB Output is correct
48 Correct 6 ms 384 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Correct 7 ms 384 KB Output is correct
51 Correct 7 ms 384 KB Output is correct
52 Correct 6 ms 384 KB Output is correct
53 Correct 7 ms 384 KB Output is correct
54 Correct 7 ms 384 KB Output is correct
55 Correct 7 ms 384 KB Output is correct
56 Correct 6 ms 384 KB Output is correct
57 Correct 7 ms 384 KB Output is correct
58 Correct 6 ms 384 KB Output is correct
59 Correct 7 ms 384 KB Output is correct
60 Correct 7 ms 384 KB Output is correct
61 Correct 8 ms 384 KB Output is correct
62 Correct 7 ms 384 KB Output is correct
63 Correct 6 ms 384 KB Output is correct
64 Correct 7 ms 384 KB Output is correct
65 Correct 158 ms 5728 KB Output is correct
66 Correct 305 ms 9968 KB Output is correct
67 Correct 229 ms 8332 KB Output is correct
68 Correct 242 ms 8324 KB Output is correct
69 Correct 233 ms 8416 KB Output is correct
70 Correct 237 ms 8460 KB Output is correct
71 Correct 227 ms 8372 KB Output is correct
72 Correct 224 ms 8332 KB Output is correct
73 Correct 223 ms 8460 KB Output is correct
74 Correct 220 ms 8332 KB Output is correct
75 Correct 224 ms 8288 KB Output is correct
76 Correct 224 ms 8404 KB Output is correct
77 Correct 224 ms 8500 KB Output is correct
78 Correct 221 ms 8684 KB Output is correct
79 Correct 221 ms 8424 KB Output is correct
80 Correct 225 ms 8380 KB Output is correct
81 Correct 225 ms 8312 KB Output is correct
82 Correct 223 ms 8380 KB Output is correct
83 Correct 221 ms 8416 KB Output is correct
84 Correct 225 ms 8416 KB Output is correct
85 Correct 221 ms 8312 KB Output is correct
86 Correct 237 ms 8468 KB Output is correct
87 Correct 232 ms 8416 KB Output is correct
88 Correct 232 ms 8416 KB Output is correct
89 Correct 234 ms 8416 KB Output is correct
90 Correct 235 ms 8324 KB Output is correct
91 Correct 231 ms 8336 KB Output is correct
92 Correct 242 ms 8420 KB Output is correct
93 Correct 236 ms 8548 KB Output is correct
94 Correct 233 ms 8400 KB Output is correct
95 Correct 228 ms 8296 KB Output is correct
96 Correct 228 ms 9576 KB Output is correct
97 Correct 229 ms 9424 KB Output is correct
98 Correct 228 ms 8396 KB Output is correct
99 Correct 226 ms 8420 KB Output is correct
100 Correct 233 ms 8568 KB Output is correct
101 Correct 230 ms 8420 KB Output is correct
102 Correct 232 ms 8416 KB Output is correct
103 Correct 236 ms 8488 KB Output is correct