oj.uz

Submission #203907

# Submission time Handle Problem Language Result Execution time Memory
203907 2020-02-23T01:19:33 Z rqi Secret Permutation (RMI19_permutation) C++14
100 / 100
 1743 ms 376 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 #include "permutation.h"
using namespace std;
 
typedef double db;
typedef long long ll;
typedef long double ld;
typedef string str;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;
 
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#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)
 
#define mp make_pair
#define pb push_back
#define eb emplace_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 rall(x) rbegin(x), rend(x)
#define rsz resize
#define ins insert
 
const int MOD = 1e9+7; // 998244353 = (119<<23)+1
const ll INF = 1e18;
const int MX = 2e5+5;
const ld PI = 4*atan((ld)1);
 
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
 
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define ook order_of_key
#define fbo find_by_order
 
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 T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    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 {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
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 = "") {
        cin.sync_with_stdio(0); cin.tie(0); // fast I/O
        cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        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 void pr(const modular& a) { pr(a.val); }
	friend void re(modular& a) { ll x; re(x); a = modular(x); }
   
	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;
 
int qnum[300];

map<vi, vector<vi>> m = {{{3, 5, 4}, {{1, 2, 3, 4}, {4, 3, 2, 1}}}, {{4, 5, 3}, {{1, 2, 4, 3}, {4, 3, 1, 2}}}, {{4, 5, 5}, {{2, 1, 3, 4}, {3, 4, 2, 1}}}, {{5, 4, 5}, {{1, 3, 2, 4}, {4, 2, 3, 1}}}, {{5, 5, 4}, {{2, 1, 4, 3}, {3, 4, 1, 2}}}, {{5, 5, 6}, {{2, 3, 4, 1}, {3, 2, 1, 4}}}, {{5, 6, 5}, {{1, 3, 4, 2}, {4, 2, 1, 3}}}, {{5, 6, 7}, {{2, 4, 3, 1}, {3, 1, 2, 4}}}, {{5, 7, 6}, {{1, 4, 3, 2}, {4, 1, 2, 3}}}, {{6, 3, 5}, {{2, 3, 1, 4}, {3, 2, 4, 1}}}, {{6, 5, 5}, {{1, 4, 2, 3}, {4, 1, 3, 2}}}, {{7, 4, 5}, {{2, 4, 1, 3}, {3, 1, 4, 2}}}};
void solve4(int N){
	assert(N == 4);
	vi perm1 = {1, 2, 3, 4};
    vi perm2 = {3, 1, 2, 4};
    vi perm3 = {1, 2, 4, 3};
    int a1 = query(perm1);
    int a2 = query(perm2);
    int a3 = query(perm3);
    answer(m[{a1, a2, a3}][0]);
}
int N;
vi P;
bool filled[305];
bool search(int ind){
	//ps(ind, P);
	if(ind == N){
		if(abs(P[N-1]-P[0]) == qnum[N]){
			//ps("HI");
			return 1;
		}
		return 0;
	}
	int diff = qnum[ind];
	int cand1 = P[ind-1]+diff;
	int cand2 = P[ind-1]-diff;
	if(cand1 > 0 && cand1 <= N && filled[cand1] == 0){
		filled[cand1] = 1;
		P[ind] = cand1;
		if(search(ind+1) == 1){
			return 1;
		}
		filled[cand1] = 0;
	}
	
	if(cand2 > 0 && cand2 <= N && filled[cand2] == 0){
		filled[cand2] = 1;
		P[ind] = cand2;
		if(search(ind+1) == 1){
			return 1;
		}
		filled[cand2] = 0;
	}
	return 0;
}
 
void solve(int _N){
	if(_N == 4){
		solve4(_N);
		return;
	}
	N = _N;
	P = vector<int>(N, 0);
	ll sum = 0;
	for(int i = 1; i <= N; i++){
		vi q(N, 0);
		for(int j = 1; j <= N; j++){
			q[j-1] = (i+j-1)%N+1;
		}
		qnum[i] = query(q);
		sum+=ll(qnum[i]);
	}
	sum/=(N-1);
	for(int i = 1; i <= N; i++){
		qnum[i] = int(sum)-qnum[i];
		//ps(i, qnum[i]);
	}
	
	for(int i = 1; i <= N; i++){
		filled[i] = 1;
		P[0] = i;
		if(search(1) == 1) break;
		filled[i] = 0;
	}
	
	
	int mn = MOD;
	for(int i = 0; i < N; i++){
		mn = min(mn, P[i]);
	}
	for(int i = 0; i < N; i++){
		P[i] = P[i]-mn;
		P[i]++;
	}
	//ps("answer: ", P);
	answer(P);
}
 
/* 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

permutation.cpp: In function 'void io::setIn(std::__cxx11::string)':
permutation.cpp:135: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); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
permutation.cpp: In function 'void io::setOut(std::__cxx11::string)':
permutation.cpp:136: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); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
stub.cpp: In function 'int query(int*)':
stub.cpp:15:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(stdin, "%d", &x);
   ~~~~~~^~~~~~~~~~~~~~~~~
stub.cpp: In function 'int main(int, char**)':
stub.cpp:48:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(stdin, "%d", &N);
   ~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 252 KB Output is correct
6 Correct 5 ms 248 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 252 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 6 ms 248 KB Output is correct
16 Correct 6 ms 376 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 252 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 6 ms 248 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 6 ms 248 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 14 ms 248 KB Output is correct
18 Correct 35 ms 248 KB Output is correct
19 Correct 32 ms 376 KB Output is correct
20 Correct 16 ms 248 KB Output is correct
21 Correct 105 ms 248 KB Output is correct
22 Correct 92 ms 248 KB Output is correct
23 Correct 19 ms 248 KB Output is correct
24 Correct 1743 ms 376 KB Output is correct
25 Correct 108 ms 248 KB Output is correct
26 Correct 16 ms 376 KB Output is correct