oj.uz

Submission #143333

# Submission time Handle Problem Language Result Execution time Memory
143333 2019-08-13T16:54:55 Z rqi Arranging Shoes (IOI19_shoes) C++14
100 / 100
 314 ms 22344 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include "shoes.h"
#include <ext/pb_ds/assoc_container.hpp>
#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 = 998244353; // 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());

vector<int> rshoes[100005];
vector<int> lshoes[100005];
Tree<int> removedinds;

long long count_swaps(std::vector<int> s) {
	
	int n = s.size()/2;
	ll ans = 0;
	for(int i = 0; i < sz(s); i++){
		if(s[i] > 0){
			rshoes[s[i]].pb(i);
		}
		else{
			lshoes[-s[i]].pb(i);
		}
    }
	for(int i = 1; i <= n; i++){
		sort(lshoes[i].rbegin(), lshoes[i].rend());
		sort(rshoes[i].rbegin(), rshoes[i].rend());
	}
	int curind = 0;
	for(int i = 0; i < 2*n; i++){
		if(removedinds.find(i) == removedinds.end()){
			if(s[i] < 0){
				int leftind = sz(removedinds)-(int)removedinds.order_of_key(i)+i;
				ans+=ll(leftind-curind);
				lshoes[-s[i]].pop_back();
				removedinds.insert(i);
				
				int rightind = rshoes[-s[i]][sz(rshoes[-s[i]])-1];
				int b = rightind;
				rightind = sz(removedinds)-(int)removedinds.order_of_key(rightind)+rightind;
				ans+=ll(rightind-(curind+1));
				rshoes[-s[i]].pop_back();
				removedinds.insert(b);
				
			}
			else{
				int leftind = lshoes[s[i]][sz(lshoes[s[i]])-1];
				
				int b = leftind;
				leftind = sz(removedinds)-(int)removedinds.order_of_key(leftind)+leftind;
				ans+=ll(leftind-curind);
				
				lshoes[s[i]].pop_back();
				removedinds.insert(b);
				
				int rightind = sz(removedinds)-(int)removedinds.order_of_key(i)+i;
				
				ans+=ll(rightind-(curind+1));
				rshoes[s[i]].pop_back();
				removedinds.insert(i);
			}
			curind+=2;
		}
	}
	
	return ans;
}

Compilation message

shoes.cpp: In function 'void io::setIn(std::__cxx11::string)':
shoes.cpp:116: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); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
shoes.cpp: In function 'void io::setOut(std::__cxx11::string)':
shoes.cpp:117: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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5040 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 8 ms 4984 KB Output is correct
20 Correct 7 ms 4984 KB Output is correct
21 Correct 8 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 7 ms 4984 KB Output is correct
26 Correct 7 ms 4984 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 4984 KB Output is correct
29 Correct 7 ms 4984 KB Output is correct
30 Correct 8 ms 4984 KB Output is correct
31 Correct 4 ms 4988 KB Output is correct
32 Correct 7 ms 4984 KB Output is correct
33 Correct 7 ms 4984 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 8 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 7 ms 5084 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 4956 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5112 KB Output is correct
20 Correct 30 ms 6240 KB Output is correct
21 Correct 22 ms 6136 KB Output is correct
22 Correct 202 ms 16816 KB Output is correct
23 Correct 250 ms 16912 KB Output is correct
24 Correct 154 ms 16868 KB Output is correct
25 Correct 268 ms 16876 KB Output is correct
26 Correct 184 ms 16748 KB Output is correct
27 Correct 216 ms 16876 KB Output is correct
28 Correct 267 ms 16752 KB Output is correct
29 Correct 273 ms 16880 KB Output is correct
30 Correct 266 ms 16880 KB Output is correct
31 Correct 207 ms 16772 KB Output is correct
32 Correct 249 ms 16772 KB Output is correct
33 Correct 269 ms 16748 KB Output is correct
34 Correct 269 ms 16912 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 249 ms 16924 KB Output is correct
38 Correct 251 ms 16704 KB Output is correct
39 Correct 251 ms 16748 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 292 ms 22268 KB Output is correct
6 Correct 298 ms 17400 KB Output is correct
7 Correct 295 ms 22236 KB Output is correct
8 Correct 277 ms 16872 KB Output is correct
9 Correct 292 ms 22264 KB Output is correct
10 Correct 312 ms 19128 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5040 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 8 ms 4984 KB Output is correct
20 Correct 7 ms 4984 KB Output is correct
21 Correct 8 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 7 ms 4984 KB Output is correct
26 Correct 7 ms 4984 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 4984 KB Output is correct
29 Correct 7 ms 4984 KB Output is correct
30 Correct 8 ms 4984 KB Output is correct
31 Correct 4 ms 4988 KB Output is correct
32 Correct 7 ms 4984 KB Output is correct
33 Correct 7 ms 4984 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 8 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 6 ms 4984 KB Output is correct
38 Correct 7 ms 4984 KB Output is correct
39 Correct 8 ms 4984 KB Output is correct
40 Correct 7 ms 5112 KB Output is correct
41 Correct 8 ms 5240 KB Output is correct
42 Correct 8 ms 5112 KB Output is correct
43 Correct 8 ms 5240 KB Output is correct
44 Correct 8 ms 5240 KB Output is correct
45 Correct 8 ms 5244 KB Output is correct
46 Correct 8 ms 5112 KB Output is correct
47 Correct 8 ms 5112 KB Output is correct
48 Correct 8 ms 5112 KB Output is correct
49 Correct 8 ms 5160 KB Output is correct
50 Correct 8 ms 5112 KB Output is correct
51 Correct 7 ms 5116 KB Output is correct
52 Correct 8 ms 5112 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 5040 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 8 ms 4984 KB Output is correct
19 Correct 8 ms 4984 KB Output is correct
20 Correct 7 ms 4984 KB Output is correct
21 Correct 8 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 7 ms 4984 KB Output is correct
26 Correct 7 ms 4984 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 7 ms 4984 KB Output is correct
29 Correct 7 ms 4984 KB Output is correct
30 Correct 8 ms 4984 KB Output is correct
31 Correct 4 ms 4988 KB Output is correct
32 Correct 7 ms 4984 KB Output is correct
33 Correct 7 ms 4984 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 8 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 7 ms 4984 KB Output is correct
38 Correct 8 ms 4984 KB Output is correct
39 Correct 7 ms 4984 KB Output is correct
40 Correct 7 ms 4984 KB Output is correct
41 Correct 7 ms 4984 KB Output is correct
42 Correct 7 ms 4984 KB Output is correct
43 Correct 7 ms 4984 KB Output is correct
44 Correct 6 ms 4984 KB Output is correct
45 Correct 7 ms 5084 KB Output is correct
46 Correct 6 ms 4984 KB Output is correct
47 Correct 7 ms 4984 KB Output is correct
48 Correct 7 ms 4956 KB Output is correct
49 Correct 7 ms 4984 KB Output is correct
50 Correct 7 ms 4984 KB Output is correct
51 Correct 8 ms 5112 KB Output is correct
52 Correct 8 ms 5112 KB Output is correct
53 Correct 8 ms 5112 KB Output is correct
54 Correct 30 ms 6240 KB Output is correct
55 Correct 22 ms 6136 KB Output is correct
56 Correct 202 ms 16816 KB Output is correct
57 Correct 250 ms 16912 KB Output is correct
58 Correct 154 ms 16868 KB Output is correct
59 Correct 268 ms 16876 KB Output is correct
60 Correct 184 ms 16748 KB Output is correct
61 Correct 216 ms 16876 KB Output is correct
62 Correct 267 ms 16752 KB Output is correct
63 Correct 273 ms 16880 KB Output is correct
64 Correct 266 ms 16880 KB Output is correct
65 Correct 207 ms 16772 KB Output is correct
66 Correct 249 ms 16772 KB Output is correct
67 Correct 269 ms 16748 KB Output is correct
68 Correct 269 ms 16912 KB Output is correct
69 Correct 6 ms 4984 KB Output is correct
70 Correct 7 ms 4984 KB Output is correct
71 Correct 249 ms 16924 KB Output is correct
72 Correct 251 ms 16704 KB Output is correct
73 Correct 251 ms 16748 KB Output is correct
74 Correct 7 ms 4984 KB Output is correct
75 Correct 6 ms 4984 KB Output is correct
76 Correct 6 ms 4984 KB Output is correct
77 Correct 7 ms 4984 KB Output is correct
78 Correct 292 ms 22268 KB Output is correct
79 Correct 298 ms 17400 KB Output is correct
80 Correct 295 ms 22236 KB Output is correct
81 Correct 277 ms 16872 KB Output is correct
82 Correct 292 ms 22264 KB Output is correct
83 Correct 312 ms 19128 KB Output is correct
84 Correct 6 ms 4984 KB Output is correct
85 Correct 7 ms 4984 KB Output is correct
86 Correct 8 ms 4984 KB Output is correct
87 Correct 7 ms 5112 KB Output is correct
88 Correct 8 ms 5240 KB Output is correct
89 Correct 8 ms 5112 KB Output is correct
90 Correct 8 ms 5240 KB Output is correct
91 Correct 8 ms 5240 KB Output is correct
92 Correct 8 ms 5244 KB Output is correct
93 Correct 8 ms 5112 KB Output is correct
94 Correct 8 ms 5112 KB Output is correct
95 Correct 8 ms 5112 KB Output is correct
96 Correct 8 ms 5160 KB Output is correct
97 Correct 8 ms 5112 KB Output is correct
98 Correct 7 ms 5116 KB Output is correct
99 Correct 8 ms 5112 KB Output is correct
100 Correct 8 ms 5240 KB Output is correct
101 Correct 25 ms 6648 KB Output is correct
102 Correct 23 ms 6264 KB Output is correct
103 Correct 295 ms 22304 KB Output is correct
104 Correct 293 ms 22236 KB Output is correct
105 Correct 235 ms 19576 KB Output is correct
106 Correct 270 ms 22264 KB Output is correct
107 Correct 208 ms 17528 KB Output is correct
108 Correct 283 ms 17980 KB Output is correct
109 Correct 225 ms 16880 KB Output is correct
110 Correct 271 ms 16752 KB Output is correct
111 Correct 314 ms 21624 KB Output is correct
112 Correct 269 ms 20856 KB Output is correct
113 Correct 314 ms 17492 KB Output is correct
114 Correct 276 ms 22292 KB Output is correct
115 Correct 273 ms 22344 KB Output is correct