oj.uz

Submission #160466

# Submission time Handle Problem Language Result Execution time Memory
160466 2019-10-27T14:16:13 Z Benq Mouse (info1cup19_mouse) C++14
100 / 100
 62 ms 944 KB 
#include "grader.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

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

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    modular(const ll& v) { 
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
    friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular pow(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vi V;
int N;

int query(vector<int> v); /* { 
	int res = 0;
	F0R(i,N) if (v[i] == V[i]) res ++;
	return res;
}*/

int tot = 0;
int q(vi v) {
	int x = query(v); tot ++;
	if (x == N) {
		// ps("FINISHED",tot);
		exit(0);
	}
	return x;
}

int cnt[256];
vpi posi[256];
vi d;

vi cyc;
bool vis[256];
vi adj[256];

vpi red(vpi v) {
	vpi V;
	trav(t,v) if (max(cnt[t.f],cnt[t.s]) < 2) V.pb(t);
	return V;
}

int get(vpi v) {
	auto D = d; trav(t,v) swap(D[t.f],D[t.s]);
	return q(D);
}

void divi(vpi v, int g) {
	v = red(v); if (!sz(v)) return;
	if (g == -1) g = get(v);
	if (g == 0) return;
	if (sz(v) == 1) {
		cnt[v[0].f] += g, cnt[v[0].s] += g;
		adj[v[0].f].pb(v[0].s);
		adj[v[0].s].pb(v[0].f);
		return;
	}
	vpi v0 = vpi(v.begin(),v.begin()+sz(v)/2);
	vpi v1 = vpi(v.begin()+sz(v)/2,v.end());
	int G = get(v0); divi(v0,G); divi(v1,g-G);
}

void dfs(int a) {
	vis[a] = 1; cyc.pb(a);
	trav(t,adj[a]) if (!vis[t]) dfs(t);
}

vi shift(vi cyc) {
	auto ans = d;
	F0R(j,sz(cyc)) ans[cyc[j]] = d[cyc[(j+1)%sz(cyc)]];
	return ans;
}

void solve(int _N) {
	N = _N;
	FOR(i,1,N+1) d.pb(i);
	while (query(d)) random_shuffle(all(d));
	F0R(i,N) FOR(j,i+1,N) posi[(i+j)%N].pb({i,j});
	F0R(i,N) divi(posi[i],-1);
	vi ans(N);
	F0R(i,N) if (!vis[i]) {
		cyc.clear(); dfs(i); 
		if (sz(cyc) == 2 || q(shift(cyc))) {
			F0R(j,sz(cyc)) ans[cyc[j]] = d[cyc[(j+1)%sz(cyc)]];
		} else {
			F0R(j,sz(cyc)) ans[cyc[j]] = d[cyc[(j+sz(cyc)-1)%sz(cyc)]];
		}
	}
	q(ans);
}

/*int main() {
	FOR(i,1,257) V.pb(i);
	random_shuffle(all(V));
	solve(256);
}*/

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

mouse.cpp: In function 'void io::setIn(std::__cxx11::string)':
mouse.cpp:114:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
mouse.cpp: In function 'void io::setOut(std::__cxx11::string)':
mouse.cpp:115:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Correct! Number of queries: 16
2 Correct 5 ms 248 KB Correct! Number of queries: 7
3 Correct 5 ms 376 KB Correct! Number of queries: 14
4 Correct 5 ms 252 KB Correct! Number of queries: 13
5 Correct 5 ms 248 KB Correct! Number of queries: 13
6 Correct 5 ms 376 KB Correct! Number of queries: 23

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Correct! Number of queries: 16
2 Correct 5 ms 248 KB Correct! Number of queries: 7
3 Correct 5 ms 376 KB Correct! Number of queries: 14
4 Correct 5 ms 252 KB Correct! Number of queries: 13
5 Correct 5 ms 248 KB Correct! Number of queries: 13
6 Correct 5 ms 376 KB Correct! Number of queries: 23
7 Correct 8 ms 248 KB Correct! Number of queries: 200
8 Correct 8 ms 248 KB Correct! Number of queries: 200
9 Correct 9 ms 248 KB Correct! Number of queries: 200
10 Correct 8 ms 248 KB Correct! Number of queries: 200
11 Correct 7 ms 248 KB Correct! Number of queries: 200
12 Correct 7 ms 376 KB Correct! Number of queries: 200
13 Correct 7 ms 248 KB Correct! Number of queries: 200
14 Correct 8 ms 376 KB Correct! Number of queries: 200
15 Correct 7 ms 336 KB Correct! Number of queries: 200
16 Correct 8 ms 376 KB Correct! Number of queries: 200

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Correct! Number of queries: 16
2 Correct 5 ms 248 KB Correct! Number of queries: 7
3 Correct 5 ms 376 KB Correct! Number of queries: 14
4 Correct 5 ms 252 KB Correct! Number of queries: 13
5 Correct 5 ms 248 KB Correct! Number of queries: 13
6 Correct 5 ms 376 KB Correct! Number of queries: 23
7 Correct 8 ms 248 KB Correct! Number of queries: 200
8 Correct 8 ms 248 KB Correct! Number of queries: 200
9 Correct 9 ms 248 KB Correct! Number of queries: 200
10 Correct 8 ms 248 KB Correct! Number of queries: 200
11 Correct 7 ms 248 KB Correct! Number of queries: 200
12 Correct 7 ms 376 KB Correct! Number of queries: 200
13 Correct 7 ms 248 KB Correct! Number of queries: 200
14 Correct 8 ms 376 KB Correct! Number of queries: 200
15 Correct 7 ms 336 KB Correct! Number of queries: 200
16 Correct 8 ms 376 KB Correct! Number of queries: 200
17 Correct 58 ms 944 KB Correct! Number of queries: 1500
18 Correct 51 ms 504 KB Correct! Number of queries: 1500
19 Correct 49 ms 632 KB Correct! Number of queries: 1400
20 Correct 54 ms 632 KB Correct! Number of queries: 1500
21 Correct 55 ms 504 KB Correct! Number of queries: 1500
22 Correct 52 ms 504 KB Correct! Number of queries: 1400
23 Correct 50 ms 504 KB Correct! Number of queries: 1500
24 Correct 62 ms 608 KB Correct! Number of queries: 1500
25 Correct 52 ms 600 KB Correct! Number of queries: 1500
26 Correct 53 ms 504 KB Correct! Number of queries: 1500