oj.uz

답안 #329374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329374 2020-11-20T21:29:40 Z jc713 Swap (BOI16_swap) C++17
68 / 100
 1000 ms 236512 KB 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
    rb_tree_tag, tree_order_statistics_node_update>;
 
using ll = long long;
using ull = unsigned 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 int IINF = 1e9;
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
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

bitset<200000> needed[18][2]; // 18 levels, 0 = left, 1 = right
vi tr[18][2][200000];

void merge(vi& ret, const vi& A, const vi& B){
	int i = 0;
	for(int a = 1; i < max(sz(A), sz(B)); a *= 2){
		FOR(b, i, min(i + a, sz(A)))
			ret.push_back(A[b]);
		FOR(b, i, min(i + a, sz(B)))
			ret.push_back(B[b]);
		i += a;
	}
}

vi getmin(const vi& A, const vi& B){
	F0R(a, min(sz(A), sz(B))){
		if(A[a] < B[a])
			return A;
		if(A[a] > B[a])
			return B;
	}
	return (sz(A) < sz(B) ? A : B);
}

int main(){
    setIO();
	int n;
	cin >> n;
	vi A(n);
	F0R(a, n)
		cin >> A[a], A[a]--;
	needed[0][1][0] = 1;
	F0R(a, n / 2 + 1)
		F0R(b, 18)
			F0R(c, 2){
				if(!needed[b][c][a])
					 continue;
				int r = ((a + 1) >> b) / 2 * 2 - 1 + c;
				if(2 * a + 1 >= n)
					continue;
				if(2 * a + 2 >= n){
					if(A[r] > A[2 * a + 1])
						needed[b + 1][c][2 * a + 1] = 1;
					else
						needed[0][0][2 * a + 1] = 1;
					continue;
				}
				if(A[2 * a + 2] < min(A[r], A[2 * a + 1])){
					needed[b + 1][c][2 * a + 1] = 1;
					needed[0][0][2 * a + 1] = 1;
					needed[b + 1][c][2 * a + 2] = 1;
					needed[0][0][2 * a + 2] = 1;
				}
				else if(A[2 * a + 1] < min(A[r], A[2 * a + 2])){
					needed[b + 1][c][2 * a + 1] = 1;
					needed[0][1][2 * a + 2] = 1;
				}
				else{
					needed[0][0][2 * a + 1] = 1;
					needed[0][1][2 * a + 2] = 1;
				}
			}
	R0F(a, n){
		F0R(b, 18)
			F0R(c, 2){
				if(!needed[b][c][a])
					 continue;
				int r = ((a + 1) >> b) / 2 * 2 - 1 + c;
				tr[b][c][a].pb(A[r]);
				if(2 * a + 1 >= n)
					continue;
				if(2 * a + 2 >= n){
					if(A[r] > A[2 * a + 1])
						tr[b][c][a].insert(tr[b][c][a].end(), all(tr[b + 1][c][2 * a + 1])), tr[b][c][a][0] = A[2 * a + 1];
					else
						tr[b][c][a].insert(tr[b][c][a].end(), all(tr[0][0][2 * a + 1]));
					continue;
				}
				if(A[2 * a + 2] < min(A[r], A[2 * a + 1])){
					vi l, r;
					l.pb(A[2 * a + 2]);
					merge(l, tr[0][0][2 * a + 1], tr[b + 1][c][2 * a + 2]);
					r.pb(A[2 * a + 2]);
					merge(r, tr[b + 1][c][2 * a + 1], tr[0][0][2 * a + 2]);
					tr[b][c][a] = getmin(l, r);
				}
				else if(A[2 * a + 1] < min(A[r], A[2 * a + 2])){
					tr[b][c][a][0] = A[2 * a + 1];
					merge(tr[b][c][a], tr[b + 1][c][2 * a + 1], tr[0][1][2 * a + 2]);
				}
				else
					merge(tr[b][c][a], tr[0][0][2 * a + 1], tr[0][1][2 * a + 2]);
			}
		F0R(b, 18)
			F0R(c, 2){
				if(!needed[b][c][a])
					 continue;
				if(2 * a + 1 < n)
					vi().swap(tr[b][c][2 * a + 1]);
				if(2 * a + 2 < n)
					vi().swap(tr[b][c][2 * a + 2]);
			}
	}
	trav(a, tr[0][1][0])
		cout << a + 1 << " ";
	cout << endl;
	// you should actually read the stuff at the bottom
}

/* 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
*/

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 169584 KB Output is correct
2 Correct 113 ms 169452 KB Output is correct
3 Correct 117 ms 169452 KB Output is correct
4 Correct 116 ms 169452 KB Output is correct
5 Correct 113 ms 169452 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 169584 KB Output is correct
2 Correct 113 ms 169452 KB Output is correct
3 Correct 117 ms 169452 KB Output is correct
4 Correct 116 ms 169452 KB Output is correct
5 Correct 113 ms 169452 KB Output is correct
6 Correct 114 ms 169452 KB Output is correct
7 Correct 115 ms 169504 KB Output is correct
8 Correct 116 ms 169452 KB Output is correct
9 Correct 113 ms 169452 KB Output is correct
10 Correct 113 ms 169472 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 169584 KB Output is correct
2 Correct 113 ms 169452 KB Output is correct
3 Correct 117 ms 169452 KB Output is correct
4 Correct 116 ms 169452 KB Output is correct
5 Correct 113 ms 169452 KB Output is correct
6 Correct 114 ms 169452 KB Output is correct
7 Correct 115 ms 169504 KB Output is correct
8 Correct 116 ms 169452 KB Output is correct
9 Correct 113 ms 169452 KB Output is correct
10 Correct 113 ms 169472 KB Output is correct
11 Correct 114 ms 169580 KB Output is correct
12 Correct 116 ms 169708 KB Output is correct
13 Correct 116 ms 169580 KB Output is correct
14 Correct 117 ms 169708 KB Output is correct
15 Correct 118 ms 169836 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 169584 KB Output is correct
2 Correct 113 ms 169452 KB Output is correct
3 Correct 117 ms 169452 KB Output is correct
4 Correct 116 ms 169452 KB Output is correct
5 Correct 113 ms 169452 KB Output is correct
6 Correct 114 ms 169452 KB Output is correct
7 Correct 115 ms 169504 KB Output is correct
8 Correct 116 ms 169452 KB Output is correct
9 Correct 113 ms 169452 KB Output is correct
10 Correct 113 ms 169472 KB Output is correct
11 Correct 114 ms 169580 KB Output is correct
12 Correct 116 ms 169708 KB Output is correct
13 Correct 116 ms 169580 KB Output is correct
14 Correct 117 ms 169708 KB Output is correct
15 Correct 118 ms 169836 KB Output is correct
16 Correct 177 ms 177636 KB Output is correct
17 Correct 177 ms 177132 KB Output is correct
18 Correct 184 ms 177376 KB Output is correct
19 Correct 361 ms 188704 KB Output is correct
20 Correct 361 ms 188644 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 169584 KB Output is correct
2 Correct 113 ms 169452 KB Output is correct
3 Correct 117 ms 169452 KB Output is correct
4 Correct 116 ms 169452 KB Output is correct
5 Correct 113 ms 169452 KB Output is correct
6 Correct 114 ms 169452 KB Output is correct
7 Correct 115 ms 169504 KB Output is correct
8 Correct 116 ms 169452 KB Output is correct
9 Correct 113 ms 169452 KB Output is correct
10 Correct 113 ms 169472 KB Output is correct
11 Correct 114 ms 169580 KB Output is correct
12 Correct 116 ms 169708 KB Output is correct
13 Correct 116 ms 169580 KB Output is correct
14 Correct 117 ms 169708 KB Output is correct
15 Correct 118 ms 169836 KB Output is correct
16 Correct 177 ms 177636 KB Output is correct
17 Correct 177 ms 177132 KB Output is correct
18 Correct 184 ms 177376 KB Output is correct
19 Correct 361 ms 188704 KB Output is correct
20 Correct 361 ms 188644 KB Output is correct
21 Correct 399 ms 204440 KB Output is correct
22 Correct 403 ms 204992 KB Output is correct
23 Correct 403 ms 205360 KB Output is correct
24 Execution timed out 1112 ms 236512 KB Time limit exceeded
25 Halted 0 ms 0 KB -