Submission #143312

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
143312	2019-08-13T15:36:51 Z	rqi	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	278 ms	16812 KB

shoes

#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());

set<int> leftshoes; 
vector<int> rshoes[100005];
Tree<int> removedinds;
Tree<int> addedinds;
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){
			leftshoes.insert(i);
		}
		else{
			rshoes[s[i]].pb(i);
		}
    }
	for(int i = 1; i <= n; i++){
		sort(rshoes[i].rbegin(), rshoes[i].rend());
	}
	for(int i = 0; i < 2*n; i+=2){
		int b = *leftshoes.begin();
		int leftind = *leftshoes.begin() +sz(removedinds)-(int)removedinds.order_of_key(*leftshoes.begin());
		
		
		ans+=ll(leftind-i);
		removedinds.insert(*leftshoes.begin());
		
		leftshoes.erase(leftshoes.find(*leftshoes.begin()));
		
		int rightind = rshoes[-s[b]][sz(rshoes[-s[b]])-1];
		
		rshoes[-s[b]].pop_back();
		
		int a = rightind;
		
		rightind = rightind+sz(removedinds)-(int)removedinds.order_of_key(rightind);
		
		ans+=ll(rightind-(i+1));
		
		removedinds.insert(a);
		
	}
	
	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	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	4 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2684 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	4 ms	2680 KB	Output is correct
12	Correct	4 ms	2680 KB	Output is correct
13	Correct	4 ms	2684 KB	Output is correct
14	Incorrect	4 ms	2680 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	4 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2652 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	5 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	5 ms	2680 KB	Output is correct
12	Correct	5 ms	2680 KB	Output is correct
13	Correct	5 ms	2680 KB	Output is correct
14	Correct	5 ms	2680 KB	Output is correct
15	Correct	5 ms	2680 KB	Output is correct
16	Correct	5 ms	2684 KB	Output is correct
17	Correct	5 ms	2680 KB	Output is correct
18	Correct	5 ms	2808 KB	Output is correct
19	Correct	6 ms	2812 KB	Output is correct
20	Correct	17 ms	3832 KB	Output is correct
21	Correct	18 ms	3836 KB	Output is correct
22	Correct	182 ms	14056 KB	Output is correct
23	Correct	230 ms	14064 KB	Output is correct
24	Correct	169 ms	14012 KB	Output is correct
25	Correct	247 ms	14020 KB	Output is correct
26	Correct	173 ms	14064 KB	Output is correct
27	Correct	224 ms	14024 KB	Output is correct
28	Correct	245 ms	14088 KB	Output is correct
29	Correct	242 ms	14100 KB	Output is correct
30	Correct	245 ms	14064 KB	Output is correct
31	Correct	186 ms	14092 KB	Output is correct
32	Correct	245 ms	13996 KB	Output is correct
33	Correct	243 ms	14104 KB	Output is correct
34	Correct	244 ms	14064 KB	Output is correct
35	Correct	4 ms	2680 KB	Output is correct
36	Correct	4 ms	2680 KB	Output is correct
37	Correct	230 ms	14068 KB	Output is correct
38	Correct	246 ms	14068 KB	Output is correct
39	Correct	247 ms	14072 KB	Output is correct

Subtask #4

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	5 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	256 ms	16696 KB	Output is correct
6	Correct	271 ms	14456 KB	Output is correct
7	Correct	267 ms	16732 KB	Output is correct
8	Correct	242 ms	14104 KB	Output is correct
9	Correct	272 ms	16812 KB	Output is correct
10	Correct	278 ms	15272 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	4 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2684 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	4 ms	2680 KB	Output is correct
12	Correct	4 ms	2680 KB	Output is correct
13	Correct	4 ms	2684 KB	Output is correct
14	Incorrect	4 ms	2680 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	4 ms	2680 KB	Output is correct
3	Correct	4 ms	2680 KB	Output is correct
4	Correct	4 ms	2680 KB	Output is correct
5	Correct	4 ms	2680 KB	Output is correct
6	Correct	4 ms	2684 KB	Output is correct
7	Correct	4 ms	2680 KB	Output is correct
8	Correct	4 ms	2680 KB	Output is correct
9	Correct	4 ms	2680 KB	Output is correct
10	Correct	4 ms	2680 KB	Output is correct
11	Correct	4 ms	2680 KB	Output is correct
12	Correct	4 ms	2680 KB	Output is correct
13	Correct	4 ms	2684 KB	Output is correct
14	Incorrect	4 ms	2680 KB	Output isn't correct
15	Halted	0 ms	0 KB	-