oj.uz

Submission #227114

# Submission time Handle Problem Language Result Execution time Memory
227114 2020-04-26T06:23:37 Z caoash Arranging Shoes (IOI19_shoes) C++14
100 / 100
 332 ms 275960 KB 
#pragma GCC target ("sse4")

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

using namespace std;
using namespace __gnu_pbds;
 
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 pair<int, pi> pii;

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

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#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

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); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

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) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(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 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 = "") {
        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;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

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

BIT<int, MX> b; int N; bool done[MX]; queue<int> pos[MX+1][2];

void update(int l, int r, int x){
   l++; r++;
   b.upd(l, x);
   if(r < 2*N) {
      b.upd(r+1, -x);
   }
}

int qry(int i){
   i++;
   return b.query(1,i);
}

ll count_swaps(vi S) {
   setIO(); 
   N = sz(S)/2;
   vi a(2*N);
   vi pend(2*N);
   fax(i,2*N){
     a[i] = S[i];
     if(a[i] > 0) {
        pos[a[i]][0].push(i);
     }
     else {
        pos[-a[i]][1].push(i);
     }
   } 
   ll ans = 0;
   fax(i,2*N){
     if(done[i]){
      update(i,2*N-1,pend[i]);
      continue;
     }
     int nxt = -1; 
     int dist = -1;
     if(a[i] > 0){
      nxt = pos[a[i]][1].front(); 
      pos[a[i]][1].pop();
      pos[a[i]][0].pop();
      dist = (nxt-i)-qry(nxt);
     }
     else{
      nxt = pos[-a[i]][0].front();
      pos[abs(a[i])][0].pop();
      pos[abs(a[i])][1].pop();
      dist = (nxt-i-1)-qry(nxt);
     }
     ans += dist;
     update(nxt,2*N-1,1);
     update(i,2*N-1,pend[i]);
     pend[nxt]--;
     done[nxt] = true;
   }
   return ans;
}

Compilation message

shoes.cpp: In function 'void io::setIn(std::__cxx11::string)':
shoes.cpp:133: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:134: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 179 ms 269688 KB Output is correct
2 Correct 177 ms 269560 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 269688 KB Output is correct
2 Correct 177 ms 269560 KB Output is correct
3 Correct 178 ms 269664 KB Output is correct
4 Correct 191 ms 269692 KB Output is correct
5 Correct 182 ms 269688 KB Output is correct
6 Correct 226 ms 269692 KB Output is correct
7 Correct 210 ms 269688 KB Output is correct
8 Correct 180 ms 269692 KB Output is correct
9 Correct 184 ms 269688 KB Output is correct
10 Correct 214 ms 269816 KB Output is correct
11 Correct 183 ms 269688 KB Output is correct
12 Correct 183 ms 269688 KB Output is correct
13 Correct 185 ms 269688 KB Output is correct
14 Correct 183 ms 269688 KB Output is correct
15 Correct 177 ms 269688 KB Output is correct
16 Correct 180 ms 269688 KB Output is correct
17 Correct 186 ms 269688 KB Output is correct
18 Correct 204 ms 269688 KB Output is correct
19 Correct 184 ms 269688 KB Output is correct
20 Correct 179 ms 269688 KB Output is correct
21 Correct 209 ms 269688 KB Output is correct
22 Correct 180 ms 269688 KB Output is correct
23 Correct 196 ms 269688 KB Output is correct
24 Correct 178 ms 269688 KB Output is correct
25 Correct 181 ms 269816 KB Output is correct
26 Correct 185 ms 269692 KB Output is correct
27 Correct 228 ms 269688 KB Output is correct
28 Correct 181 ms 269688 KB Output is correct
29 Correct 211 ms 269688 KB Output is correct
30 Correct 182 ms 269688 KB Output is correct
31 Correct 182 ms 269688 KB Output is correct
32 Correct 178 ms 269688 KB Output is correct
33 Correct 181 ms 269688 KB Output is correct
34 Correct 180 ms 269688 KB Output is correct
35 Correct 182 ms 269788 KB Output is correct
36 Correct 185 ms 269688 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 269688 KB Output is correct
2 Correct 177 ms 269560 KB Output is correct
3 Correct 179 ms 269688 KB Output is correct
4 Correct 186 ms 269668 KB Output is correct
5 Correct 187 ms 269688 KB Output is correct
6 Correct 179 ms 269688 KB Output is correct
7 Correct 184 ms 269688 KB Output is correct
8 Correct 216 ms 269688 KB Output is correct
9 Correct 185 ms 269688 KB Output is correct
10 Correct 212 ms 269816 KB Output is correct
11 Correct 181 ms 269688 KB Output is correct
12 Correct 180 ms 269688 KB Output is correct
13 Correct 179 ms 269692 KB Output is correct
14 Correct 183 ms 269656 KB Output is correct
15 Correct 184 ms 269692 KB Output is correct
16 Correct 180 ms 269688 KB Output is correct
17 Correct 179 ms 269668 KB Output is correct
18 Correct 197 ms 269720 KB Output is correct
19 Correct 198 ms 269688 KB Output is correct
20 Correct 200 ms 270244 KB Output is correct
21 Correct 200 ms 270456 KB Output is correct
22 Correct 233 ms 275832 KB Output is correct
23 Correct 248 ms 275960 KB Output is correct
24 Correct 256 ms 275816 KB Output is correct
25 Correct 237 ms 275576 KB Output is correct
26 Correct 276 ms 275832 KB Output is correct
27 Correct 295 ms 275704 KB Output is correct
28 Correct 256 ms 275844 KB Output is correct
29 Correct 291 ms 275832 KB Output is correct
30 Correct 229 ms 275704 KB Output is correct
31 Correct 235 ms 275832 KB Output is correct
32 Correct 235 ms 275928 KB Output is correct
33 Correct 235 ms 275576 KB Output is correct
34 Correct 234 ms 275704 KB Output is correct
35 Correct 188 ms 269688 KB Output is correct
36 Correct 184 ms 269688 KB Output is correct
37 Correct 282 ms 275808 KB Output is correct
38 Correct 266 ms 275908 KB Output is correct
39 Correct 230 ms 275832 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 269688 KB Output is correct
2 Correct 188 ms 269664 KB Output is correct
3 Correct 189 ms 269688 KB Output is correct
4 Correct 225 ms 269688 KB Output is correct
5 Correct 270 ms 274936 KB Output is correct
6 Correct 245 ms 274936 KB Output is correct
7 Correct 315 ms 274936 KB Output is correct
8 Correct 235 ms 275832 KB Output is correct
9 Correct 273 ms 274936 KB Output is correct
10 Correct 264 ms 274936 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 269688 KB Output is correct
2 Correct 177 ms 269560 KB Output is correct
3 Correct 178 ms 269664 KB Output is correct
4 Correct 191 ms 269692 KB Output is correct
5 Correct 182 ms 269688 KB Output is correct
6 Correct 226 ms 269692 KB Output is correct
7 Correct 210 ms 269688 KB Output is correct
8 Correct 180 ms 269692 KB Output is correct
9 Correct 184 ms 269688 KB Output is correct
10 Correct 214 ms 269816 KB Output is correct
11 Correct 183 ms 269688 KB Output is correct
12 Correct 183 ms 269688 KB Output is correct
13 Correct 185 ms 269688 KB Output is correct
14 Correct 183 ms 269688 KB Output is correct
15 Correct 177 ms 269688 KB Output is correct
16 Correct 180 ms 269688 KB Output is correct
17 Correct 186 ms 269688 KB Output is correct
18 Correct 204 ms 269688 KB Output is correct
19 Correct 184 ms 269688 KB Output is correct
20 Correct 179 ms 269688 KB Output is correct
21 Correct 209 ms 269688 KB Output is correct
22 Correct 180 ms 269688 KB Output is correct
23 Correct 196 ms 269688 KB Output is correct
24 Correct 178 ms 269688 KB Output is correct
25 Correct 181 ms 269816 KB Output is correct
26 Correct 185 ms 269692 KB Output is correct
27 Correct 228 ms 269688 KB Output is correct
28 Correct 181 ms 269688 KB Output is correct
29 Correct 211 ms 269688 KB Output is correct
30 Correct 182 ms 269688 KB Output is correct
31 Correct 182 ms 269688 KB Output is correct
32 Correct 178 ms 269688 KB Output is correct
33 Correct 181 ms 269688 KB Output is correct
34 Correct 180 ms 269688 KB Output is correct
35 Correct 182 ms 269788 KB Output is correct
36 Correct 185 ms 269688 KB Output is correct
37 Correct 181 ms 269688 KB Output is correct
38 Correct 178 ms 269688 KB Output is correct
39 Correct 178 ms 269688 KB Output is correct
40 Correct 183 ms 269692 KB Output is correct
41 Correct 216 ms 269688 KB Output is correct
42 Correct 224 ms 269688 KB Output is correct
43 Correct 188 ms 269688 KB Output is correct
44 Correct 179 ms 269688 KB Output is correct
45 Correct 175 ms 269704 KB Output is correct
46 Correct 181 ms 269688 KB Output is correct
47 Correct 233 ms 269688 KB Output is correct
48 Correct 192 ms 269852 KB Output is correct
49 Correct 215 ms 269816 KB Output is correct
50 Correct 193 ms 269688 KB Output is correct
51 Correct 193 ms 269756 KB Output is correct
52 Correct 192 ms 269692 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 269688 KB Output is correct
2 Correct 177 ms 269560 KB Output is correct
3 Correct 178 ms 269664 KB Output is correct
4 Correct 191 ms 269692 KB Output is correct
5 Correct 182 ms 269688 KB Output is correct
6 Correct 226 ms 269692 KB Output is correct
7 Correct 210 ms 269688 KB Output is correct
8 Correct 180 ms 269692 KB Output is correct
9 Correct 184 ms 269688 KB Output is correct
10 Correct 214 ms 269816 KB Output is correct
11 Correct 183 ms 269688 KB Output is correct
12 Correct 183 ms 269688 KB Output is correct
13 Correct 185 ms 269688 KB Output is correct
14 Correct 183 ms 269688 KB Output is correct
15 Correct 177 ms 269688 KB Output is correct
16 Correct 180 ms 269688 KB Output is correct
17 Correct 186 ms 269688 KB Output is correct
18 Correct 204 ms 269688 KB Output is correct
19 Correct 184 ms 269688 KB Output is correct
20 Correct 179 ms 269688 KB Output is correct
21 Correct 209 ms 269688 KB Output is correct
22 Correct 180 ms 269688 KB Output is correct
23 Correct 196 ms 269688 KB Output is correct
24 Correct 178 ms 269688 KB Output is correct
25 Correct 181 ms 269816 KB Output is correct
26 Correct 185 ms 269692 KB Output is correct
27 Correct 228 ms 269688 KB Output is correct
28 Correct 181 ms 269688 KB Output is correct
29 Correct 211 ms 269688 KB Output is correct
30 Correct 182 ms 269688 KB Output is correct
31 Correct 182 ms 269688 KB Output is correct
32 Correct 178 ms 269688 KB Output is correct
33 Correct 181 ms 269688 KB Output is correct
34 Correct 180 ms 269688 KB Output is correct
35 Correct 182 ms 269788 KB Output is correct
36 Correct 185 ms 269688 KB Output is correct
37 Correct 179 ms 269688 KB Output is correct
38 Correct 186 ms 269668 KB Output is correct
39 Correct 187 ms 269688 KB Output is correct
40 Correct 179 ms 269688 KB Output is correct
41 Correct 184 ms 269688 KB Output is correct
42 Correct 216 ms 269688 KB Output is correct
43 Correct 185 ms 269688 KB Output is correct
44 Correct 212 ms 269816 KB Output is correct
45 Correct 181 ms 269688 KB Output is correct
46 Correct 180 ms 269688 KB Output is correct
47 Correct 179 ms 269692 KB Output is correct
48 Correct 183 ms 269656 KB Output is correct
49 Correct 184 ms 269692 KB Output is correct
50 Correct 180 ms 269688 KB Output is correct
51 Correct 179 ms 269668 KB Output is correct
52 Correct 197 ms 269720 KB Output is correct
53 Correct 198 ms 269688 KB Output is correct
54 Correct 200 ms 270244 KB Output is correct
55 Correct 200 ms 270456 KB Output is correct
56 Correct 233 ms 275832 KB Output is correct
57 Correct 248 ms 275960 KB Output is correct
58 Correct 256 ms 275816 KB Output is correct
59 Correct 237 ms 275576 KB Output is correct
60 Correct 276 ms 275832 KB Output is correct
61 Correct 295 ms 275704 KB Output is correct
62 Correct 256 ms 275844 KB Output is correct
63 Correct 291 ms 275832 KB Output is correct
64 Correct 229 ms 275704 KB Output is correct
65 Correct 235 ms 275832 KB Output is correct
66 Correct 235 ms 275928 KB Output is correct
67 Correct 235 ms 275576 KB Output is correct
68 Correct 234 ms 275704 KB Output is correct
69 Correct 188 ms 269688 KB Output is correct
70 Correct 184 ms 269688 KB Output is correct
71 Correct 282 ms 275808 KB Output is correct
72 Correct 266 ms 275908 KB Output is correct
73 Correct 230 ms 275832 KB Output is correct
74 Correct 177 ms 269688 KB Output is correct
75 Correct 188 ms 269664 KB Output is correct
76 Correct 189 ms 269688 KB Output is correct
77 Correct 225 ms 269688 KB Output is correct
78 Correct 270 ms 274936 KB Output is correct
79 Correct 245 ms 274936 KB Output is correct
80 Correct 315 ms 274936 KB Output is correct
81 Correct 235 ms 275832 KB Output is correct
82 Correct 273 ms 274936 KB Output is correct
83 Correct 264 ms 274936 KB Output is correct
84 Correct 181 ms 269688 KB Output is correct
85 Correct 178 ms 269688 KB Output is correct
86 Correct 178 ms 269688 KB Output is correct
87 Correct 183 ms 269692 KB Output is correct
88 Correct 216 ms 269688 KB Output is correct
89 Correct 224 ms 269688 KB Output is correct
90 Correct 188 ms 269688 KB Output is correct
91 Correct 179 ms 269688 KB Output is correct
92 Correct 175 ms 269704 KB Output is correct
93 Correct 181 ms 269688 KB Output is correct
94 Correct 233 ms 269688 KB Output is correct
95 Correct 192 ms 269852 KB Output is correct
96 Correct 215 ms 269816 KB Output is correct
97 Correct 193 ms 269688 KB Output is correct
98 Correct 193 ms 269756 KB Output is correct
99 Correct 192 ms 269692 KB Output is correct
100 Correct 185 ms 269820 KB Output is correct
101 Correct 197 ms 270148 KB Output is correct
102 Correct 231 ms 270200 KB Output is correct
103 Correct 276 ms 274936 KB Output is correct
104 Correct 267 ms 275068 KB Output is correct
105 Correct 266 ms 274936 KB Output is correct
106 Correct 268 ms 274936 KB Output is correct
107 Correct 294 ms 274936 KB Output is correct
108 Correct 251 ms 274936 KB Output is correct
109 Correct 267 ms 275832 KB Output is correct
110 Correct 236 ms 275832 KB Output is correct
111 Correct 320 ms 274936 KB Output is correct
112 Correct 315 ms 274936 KB Output is correct
113 Correct 241 ms 274940 KB Output is correct
114 Correct 332 ms 274880 KB Output is correct
115 Correct 270 ms 274912 KB Output is correct