oj.uz

Submission #300836

# Submission time Handle Problem Language Result Execution time Memory
300836 2020-09-17T14:10:55 Z Benq Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1102 ms 62276 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }

#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(u); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
tcT> str ts(complex<T> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
tcTU> str ts(pair<T,U> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
	pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
	DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/


long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = sz(x), m = sz(x[0]);
	ll ans = 0;
	vpi todo;
	F0R(i,n) {
		FOR(j,m-k,m) ans += x[i][j];
		F0R(j,k) todo.pb({-x[i][j]-x[i][m-k+j],i});
	}
	sort(rall(todo));
	vi num(n);
	F0R(i,n*k/2) {
		num[todo[i].s] ++;
		ans += todo[i].f;
	}
	// F0R(j,n) dbg(j,num[j]);
	std::vector<std::vector<int>> ret(n,vi(m,-1));
	vi lo(n,0), hi(n,m-1);
	F0R(i,k) {
		vi ha;
		int x = 0;
		F0R(j,n) {
			if (num[j] == k-i) {
				ret[j][lo[j]++] = i;
				num[j] --;
				x ++;
			} else if (num[j] == 0) {
				ret[j][hi[j]--] = i;
			} else {
				ha.pb(j);
			}
		}
		trav(t,ha) {
			if (x < n/2) {
				ret[t][lo[t]++] = i;
				num[t] --;
				x ++;
			} else {
				ret[t][hi[t]--] = i;
			}
		}
		assert(x == n/2);
	}
	allocate_tickets(ret);
	// F0R(i,k) {
	// 	vi v(n); iota(all(v),0);
	// 	sort(all(v),[&](int a, int b) { return x[a].ft+x[a].bk < x[b].ft+x[b].bk; });
	// 	F0R(j,n) {
	// 		int t = v[j];
	// 		if (j < n/2) {
	// 			ans -= x[t].ft;
	// 			x[t].erase(begin(x[t]));
	// 		} else {
	// 			ans += x[t].bk;
	// 			x[t].pop_back();
	// 		}
	// 	}
	// }
	return ans;
	// int n = x.size();
	// int m = x[0].size();
	// for (int i = 0; i < n; i++) {
	// 	std::vector<int> row(m);
	// 	for (int j = 0; j < m; j++) {
	// 		if (j < k) {
	// 			row[j] = j;
	// 		} else {
	// 			row[j] = -1;
	// 		}
	// 	}
	// 	answer.push_back(row);
	// }
	// allocate_tickets(answer);
	// return 1;
}

Compilation message

tickets.cpp: In function 'void setIn(str)':
tickets.cpp:184:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  184 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
tickets.cpp: In function 'void setOut(str)':
tickets.cpp:185:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  185 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 30 ms 2424 KB Output is correct
6 Correct 784 ms 51484 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 38 ms 2556 KB Output is correct
6 Correct 676 ms 53436 KB Output is correct
7 Correct 781 ms 56436 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 7 ms 904 KB Output is correct
13 Correct 31 ms 2300 KB Output is correct
14 Correct 34 ms 2300 KB Output is correct
15 Correct 701 ms 58752 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 42 ms 2808 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 1070 ms 62276 KB Output is correct
9 Correct 972 ms 58136 KB Output is correct
10 Correct 979 ms 58136 KB Output is correct
11 Correct 1024 ms 62232 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 520 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 520 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 43 ms 2432 KB Output is correct
14 Correct 37 ms 2440 KB Output is correct
15 Correct 43 ms 2568 KB Output is correct
16 Correct 57 ms 2820 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 42 ms 2544 KB Output is correct
21 Correct 51 ms 2552 KB Output is correct
22 Correct 35 ms 2676 KB Output is correct
23 Correct 37 ms 2676 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 784 ms 51484 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 38 ms 2556 KB Output is correct
18 Correct 676 ms 53436 KB Output is correct
19 Correct 781 ms 56436 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 7 ms 904 KB Output is correct
25 Correct 31 ms 2300 KB Output is correct
26 Correct 34 ms 2300 KB Output is correct
27 Correct 701 ms 58752 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 42 ms 2808 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 9 ms 1024 KB Output is correct
35 Correct 1070 ms 62276 KB Output is correct
36 Correct 972 ms 58136 KB Output is correct
37 Correct 979 ms 58136 KB Output is correct
38 Correct 1024 ms 62232 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 520 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 43 ms 2432 KB Output is correct
52 Correct 37 ms 2440 KB Output is correct
53 Correct 43 ms 2568 KB Output is correct
54 Correct 57 ms 2820 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 42 ms 2544 KB Output is correct
59 Correct 51 ms 2552 KB Output is correct
60 Correct 35 ms 2676 KB Output is correct
61 Correct 37 ms 2676 KB Output is correct
62 Correct 82 ms 6012 KB Output is correct
63 Correct 82 ms 6136 KB Output is correct
64 Correct 134 ms 7268 KB Output is correct
65 Correct 426 ms 24032 KB Output is correct
66 Correct 444 ms 27904 KB Output is correct
67 Correct 8 ms 1024 KB Output is correct
68 Correct 10 ms 768 KB Output is correct
69 Correct 733 ms 51532 KB Output is correct
70 Correct 879 ms 53564 KB Output is correct
71 Correct 1102 ms 62212 KB Output is correct
72 Correct 887 ms 59556 KB Output is correct
73 Correct 993 ms 59060 KB Output is correct
74 Correct 811 ms 52496 KB Output is correct
75 Correct 911 ms 52440 KB Output is correct