| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 263402 |
2020-08-13T16:39:03 Z |
rqi |
ICC (CEOI16_icc) |
C++14 |
|
166 ms |
760 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#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
#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;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
constexpr int pct(int x) { return __builtin_popcount(x); }
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
ll half(ll x) { return fdiv(x,2); }
template<class T, class U> 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 = half(lo+hi);
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
template<class T, class U> 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 = half(lo+hi+1);
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
template<class T> void remDup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)),end(v)); }
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
template<class T> 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); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,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
}
template<class A> str ts(complex<A> 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; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> 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
}
template<class A, class B> str ts(pair<A,B> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#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() { ios_base::sync_with_stdio(0); cin.tie(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
}
/**
* Description: Disjoint Set Union with path compression
* and union by size. Add edges and test connectivity.
* Use for Kruskal's or Boruvka's minimum spanning tree.
* Time: O(\alpha(N))
* Source: CSAcademy, KACTL
* Verification: *
*/
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/**template<class T> T kruskal(int N, vector<pair<T,pi>> ed) {
sort(all(ed));
T ans = 0; DSU D; D.init(N); // edges that unite are in MST
trav(a,ed) if (D.unite(a.s.f,a.s.s)) ans += a.f;
return ans;
}*/
int N;
DSU dsu;
pi ans;
// int query(int As, int Bs, int* a, int* b){
// for(int i = 0; i < As; i++){
// cout << a[i] << " ";
// }
// cout << "\n";
// for(int i = 0; i < Bs; i++){
// cout << b[i] << " ";
// }
// cout << "\n";
// cout.flush();
// int res;
// cin >> res;
// return res;
// }
// void setRoad(int a, int b){
// dbg(a, b);
// }
int q;
int QUERY(vi A, vi B){
q++;
int a[sz(A)], b[sz(B)];
for(int i = 0; i < sz(A); i++){
a[i] = A[i];
}
for(int i = 0; i < sz(B); i++){
b[i] = B[i];
}
return query(sz(A), sz(B), a, b);
}
int typ[105];
int QUERY2(vi A, vi B){ //A and B contain parents of components
vi Ap, Bp;
for(int i = 1; i <= N; i++){
typ[i] = 0;
}
for(auto u: A) typ[u] = 1;
for(auto u: B) typ[u] = 2;
for(int i = 1; i <= N; i++){
if(typ[dsu.get(i)] == 1) Ap.pb(i);
if(typ[dsu.get(i)] == 2) Bp.pb(i);
}
return QUERY(Ap, Bp);
}
int QUERY3(vector<vi> A, vector<vi> B){
vi Ap, Bp;
for(auto x: A){
for(auto u: x){
Ap.pb(u);
}
}
for(auto x: B){
for(auto u: x){
Bp.pb(u);
}
}
return QUERY2(Ap, Bp);
}
void search(vi a, vi b){
if(sz(a) == 1 && sz(b) == 1){
ans = mp(a[0], b[0]);
return;
}
if(sz(a) == 1) swap(a, b);
vi a1, a2;
for(int i = 0; i < sz(a)/2; i++){
a1.pb(a[i]);
}
for(int i = sz(a)/2; i < sz(a); i++){
a2.pb(a[i]);
}
int x = QUERY(a1, b);
if(x == 1){
search(a1, b);
}
else{
search(a2, b);
}
}
void search3(vector<vi> c1, vector<vi> c2){
//dbg(c1, c2);
assert(sz(c1) == sz(c2));
if(sz(c1) == 1){
vi n1, n2;
for(int i = 1; i <= N; i++){
typ[i] = 0;
}
for(auto u: c1[0]){
typ[u] = 1;
}
for(auto u: c2[0]){
typ[u] = 2;
}
for(int i = 1; i <= N; i++){
if(typ[dsu.get(i)] == 1) n1.pb(i);
else if(typ[dsu.get(i)] == 2) n2.pb(i);
}
search(n1, n2);
return;
}
vpi szs;
for(int i = 0; i < sz(c1); i++){
szs.pb(mp(sz(c1[i])+sz(c2[i]), i));
}
sort(szs.rbegin(), szs.rend());
pair<vector<vi>, vector<vi>> nc1, nc2;
int sz1 = 0;
int sz2 = 0;
for(auto u: szs){
if(sz1 > sz2){
swap(nc1, nc2);
swap(sz1, sz2);
}
nc1.f.pb(c1[u.s]);
nc1.s.pb(c2[u.s]);
sz1+=u.f;
}
//dbg(nc1, nc2);
int res = QUERY3(nc1.f, nc1.s);
if(res == 1){
search3(nc1.f, nc1.s);
}
else{
search3(nc2.f, nc2.s);
}
}
void search2(vector<vi> c){
vector<vi> trash;
for(int i = 0; i < sz(c); i++){
if(sz(c[i]) > 1) trash.pb(c[i]); //get rid of single components
}
swap(c, trash);
vector<vi> nc1, nc2;
for(int i = 0; i < sz(c); i++){
vi c1, c2; //split c[i] into two evenly sized
vpi a;
for(int j = 0; j < sz(c[i]); j++){
a.pb(mp(dsu.size(c[i][j]), c[i][j]));
}
sort(a.rbegin(), a.rend());
int sz1 = 0;
int sz2 = 0;
for(auto u: a){
if(sz1 > sz2){
swap(c1, c2);
swap(sz1, sz2);
}
c1.pb(u.s);
sz1+=u.f;
}
nc1.pb(c1);
nc2.pb(c2);
}
int res = QUERY3(nc1, nc2);
if(res == 0){
vector<vi> nc;
for(auto u: nc1){
nc.pb(u);
}
for(auto u: nc2){
nc.pb(u);
}
search2(nc);
return;
}
else{
search3(nc1, nc2); //between nc1[i] and nc2[i]
return;
}
}
void run(int _N){
N = _N;
dsu.init(N+5);
for(int t = 0; t < N-1; t++){
vi c;
for(int i = 1; i <= N; i++){
c.pb(dsu.get(i));
}
remDup(c);
search2(vector<vi>{c});
setRoad(ans.f, ans.s);
dsu.unite(ans.f, ans.s);
}
}
// int main(){
// int N = 8;
// run(N);
// }
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/
Compilation message
icc.cpp: In function 'void setIn(str)':
icc.cpp:166:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
166 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
icc.cpp: In function 'void setOut(str)':
icc.cpp:167:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
167 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
512 KB |
Ok! 96 queries used. |
| 2 |
Correct |
7 ms |
512 KB |
Ok! 96 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
512 KB |
Ok! 511 queries used. |
| 2 |
Correct |
40 ms |
632 KB |
Ok! 448 queries used. |
| 3 |
Correct |
41 ms |
512 KB |
Ok! 470 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
131 ms |
608 KB |
Ok! 1257 queries used. |
| 2 |
Correct |
139 ms |
632 KB |
Ok! 1058 queries used. |
| 3 |
Correct |
130 ms |
760 KB |
Ok! 1250 queries used. |
| 4 |
Correct |
140 ms |
736 KB |
Ok! 1199 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
140 ms |
632 KB |
Ok! 1240 queries used. |
| 2 |
Correct |
146 ms |
512 KB |
Ok! 1233 queries used. |
| 3 |
Correct |
147 ms |
632 KB |
Ok! 1182 queries used. |
| 4 |
Correct |
145 ms |
512 KB |
Ok! 1255 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
149 ms |
512 KB |
Ok! 1176 queries used. |
| 2 |
Correct |
152 ms |
636 KB |
Ok! 1179 queries used. |
| 3 |
Correct |
149 ms |
632 KB |
Ok! 1172 queries used. |
| 4 |
Correct |
151 ms |
640 KB |
Ok! 1211 queries used. |
| 5 |
Correct |
135 ms |
512 KB |
Ok! 1242 queries used. |
| 6 |
Correct |
147 ms |
512 KB |
Ok! 1222 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
166 ms |
620 KB |
Ok! 1180 queries used. |
| 2 |
Correct |
160 ms |
512 KB |
Ok! 1115 queries used. |
