oj.uz

Submission #148347

# Submission time Handle Problem Language Result Execution time Memory
148347 2019-09-01T03:39:53 Z 12tqian Arranging Shoes (IOI19_shoes) C++14
100 / 100
 296 ms 32520 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

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

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 2e5 + 5;
template<class T, int SZ> struct Seg { // SZ should be power of 2
    T ID = 0; // comb(ID,b) must equal b
    T comb(T a, T b) { return a+b; } // easily change this to min or max

    T seg[2*SZ];
    Seg() { memset(seg,0,sizeof seg); }


    void upd(int p, T value) {  // set value at position p
        seg[p += SZ] = value;
        for (p /= 2; p; p /= 2) seg[p] = comb(seg[2*p],seg[2*p+1]);
    }

    T query(int l, int r) {  // sum on interval [l, r]
        r ++; T lres = ID, rres = ID; // make sure non-commutative operations work
        for (l += SZ, r += SZ; l < r; l /= 2, r /= 2) {
            if (l&1) lres = comb(lres,seg[l++]);
            if (r&1) rres = comb(seg[--r],rres);
        }
        return comb(lres,rres);
    }
};
Seg<ll, (1<<18)> seg;
vi loc[2][MAX];
int vis[MAX];
int other[MAX];
unordered_map<int, int> um;
ll count_swaps(vi s){
    int sz = sz(s);
    int n = sz/2;
    ll ans = 0;
    set<int> vals;
    for(int x: s) vals.insert(abs(x));
    int cnt = 1;
    //int mx = 0;
    for(int x: vals){
        um[x] = cnt;
        cnt++;
    }
    int mx = cnt; ///1 greater than the maximum
    f0r(i, sz){
        if(s[i]>0){
            loc[1][um[s[i]]].eb(i);
        }
        else{
            loc[0][um[-s[i]]].eb(i);
        }
    }
   // vi a;
   // a.resize(sz);
    int tot = 0;
    f0r(i, mx){
        f0r(j, sz(loc[0][i])){
            if(loc[0][i][j] >loc[1][i][j]){
                ans++;
            }
          //  a[loc[0][i][j]] = tot;
            //a[loc[1][i][j]] = tot;
            other[loc[0][i][j]] = loc[1][i][j];
            other[loc[1][i][j]] = loc[0][i][j];
            tot++;
        }
    }
   // cout << a << endl;
    f0r(i, sz){
        if(other[i]<i) continue;
        ans += other[i] - i - 1;
        ans -= seg.query(i, other[i]);
        seg.upd(other[i], 1);
    }
    return ans;

}
/*
int main(){
    fast_io();
    int n;
    cin >> n;
    vi a;
    f0r(i,n){
        int ai;
        cin >> ai;
        a.eb(ai);
    }
    cout << count_swaps(a) << endl;
    return 0;
}*/

Compilation message

shoes.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:86:9: warning: unused variable 'n' [-Wunused-variable]
     int n = sz/2;
         ^
shoes.cpp: In function 'void io(std::__cxx11::string)':
shoes.cpp:52:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
shoes.cpp:53:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 13816 KB Output is correct
2 Correct 18 ms 13816 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 13816 KB Output is correct
2 Correct 18 ms 13816 KB Output is correct
3 Correct 15 ms 13944 KB Output is correct
4 Correct 14 ms 13816 KB Output is correct
5 Correct 14 ms 13804 KB Output is correct
6 Correct 15 ms 13816 KB Output is correct
7 Correct 15 ms 13816 KB Output is correct
8 Correct 17 ms 13816 KB Output is correct
9 Correct 15 ms 13816 KB Output is correct
10 Correct 15 ms 13828 KB Output is correct
11 Correct 14 ms 13816 KB Output is correct
12 Correct 15 ms 13816 KB Output is correct
13 Correct 15 ms 13816 KB Output is correct
14 Correct 15 ms 13816 KB Output is correct
15 Correct 16 ms 13816 KB Output is correct
16 Correct 15 ms 13816 KB Output is correct
17 Correct 15 ms 13816 KB Output is correct
18 Correct 15 ms 13816 KB Output is correct
19 Correct 16 ms 13816 KB Output is correct
20 Correct 20 ms 14248 KB Output is correct
21 Correct 20 ms 14200 KB Output is correct
22 Correct 64 ms 17144 KB Output is correct
23 Correct 54 ms 17132 KB Output is correct
24 Correct 61 ms 17132 KB Output is correct
25 Correct 60 ms 17132 KB Output is correct
26 Correct 65 ms 18512 KB Output is correct
27 Correct 53 ms 18300 KB Output is correct
28 Correct 63 ms 18416 KB Output is correct
29 Correct 63 ms 18420 KB Output is correct
30 Correct 65 ms 18388 KB Output is correct
31 Correct 69 ms 18432 KB Output is correct
32 Correct 63 ms 18348 KB Output is correct
33 Correct 61 ms 18220 KB Output is correct
34 Correct 63 ms 18412 KB Output is correct
35 Correct 15 ms 13820 KB Output is correct
36 Correct 15 ms 13944 KB Output is correct
37 Correct 63 ms 18416 KB Output is correct
38 Correct 62 ms 18396 KB Output is correct
39 Correct 62 ms 18344 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 13816 KB Output is correct
2 Correct 15 ms 13820 KB Output is correct
3 Correct 15 ms 13816 KB Output is correct
4 Correct 14 ms 13816 KB Output is correct
5 Correct 255 ms 31160 KB Output is correct
6 Correct 121 ms 19776 KB Output is correct
7 Correct 251 ms 32344 KB Output is correct
8 Correct 67 ms 18452 KB Output is correct
9 Correct 261 ms 32424 KB Output is correct
10 Correct 187 ms 24900 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 13816 KB Output is correct
2 Correct 18 ms 13816 KB Output is correct
3 Correct 15 ms 13816 KB Output is correct
4 Correct 15 ms 13816 KB Output is correct
5 Correct 15 ms 13816 KB Output is correct
6 Correct 15 ms 13816 KB Output is correct
7 Correct 16 ms 13944 KB Output is correct
8 Correct 15 ms 13812 KB Output is correct
9 Correct 15 ms 13816 KB Output is correct
10 Correct 15 ms 13788 KB Output is correct
11 Correct 15 ms 13816 KB Output is correct
12 Correct 15 ms 13816 KB Output is correct
13 Correct 15 ms 13816 KB Output is correct
14 Correct 15 ms 13816 KB Output is correct
15 Correct 15 ms 13816 KB Output is correct
16 Correct 15 ms 13788 KB Output is correct
17 Correct 15 ms 13816 KB Output is correct
18 Correct 17 ms 13820 KB Output is correct
19 Correct 15 ms 13888 KB Output is correct
20 Correct 15 ms 13816 KB Output is correct
21 Correct 14 ms 13816 KB Output is correct
22 Correct 14 ms 13816 KB Output is correct
23 Correct 15 ms 13864 KB Output is correct
24 Correct 15 ms 13816 KB Output is correct
25 Correct 15 ms 13816 KB Output is correct
26 Correct 15 ms 13816 KB Output is correct
27 Correct 15 ms 13816 KB Output is correct
28 Correct 15 ms 13816 KB Output is correct
29 Correct 14 ms 13816 KB Output is correct
30 Correct 14 ms 13820 KB Output is correct
31 Correct 15 ms 13944 KB Output is correct
32 Correct 15 ms 13816 KB Output is correct
33 Correct 15 ms 13816 KB Output is correct
34 Correct 15 ms 13788 KB Output is correct
35 Correct 15 ms 13816 KB Output is correct
36 Correct 14 ms 13816 KB Output is correct
37 Correct 15 ms 13788 KB Output is correct
38 Correct 15 ms 13816 KB Output is correct
39 Correct 15 ms 13852 KB Output is correct
40 Correct 15 ms 13816 KB Output is correct
41 Correct 16 ms 13944 KB Output is correct
42 Correct 16 ms 13944 KB Output is correct
43 Correct 16 ms 13900 KB Output is correct
44 Correct 16 ms 13944 KB Output is correct
45 Correct 16 ms 13944 KB Output is correct
46 Correct 15 ms 13916 KB Output is correct
47 Correct 16 ms 13944 KB Output is correct
48 Correct 15 ms 13816 KB Output is correct
49 Correct 15 ms 13816 KB Output is correct
50 Correct 15 ms 13816 KB Output is correct
51 Correct 15 ms 13816 KB Output is correct
52 Correct 19 ms 13944 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 13816 KB Output is correct
2 Correct 18 ms 13816 KB Output is correct
3 Correct 15 ms 13816 KB Output is correct
4 Correct 15 ms 13816 KB Output is correct
5 Correct 15 ms 13816 KB Output is correct
6 Correct 15 ms 13816 KB Output is correct
7 Correct 16 ms 13944 KB Output is correct
8 Correct 15 ms 13812 KB Output is correct
9 Correct 15 ms 13816 KB Output is correct
10 Correct 15 ms 13788 KB Output is correct
11 Correct 15 ms 13816 KB Output is correct
12 Correct 15 ms 13816 KB Output is correct
13 Correct 15 ms 13816 KB Output is correct
14 Correct 15 ms 13816 KB Output is correct
15 Correct 15 ms 13816 KB Output is correct
16 Correct 15 ms 13788 KB Output is correct
17 Correct 15 ms 13816 KB Output is correct
18 Correct 17 ms 13820 KB Output is correct
19 Correct 15 ms 13888 KB Output is correct
20 Correct 15 ms 13816 KB Output is correct
21 Correct 14 ms 13816 KB Output is correct
22 Correct 14 ms 13816 KB Output is correct
23 Correct 15 ms 13864 KB Output is correct
24 Correct 15 ms 13816 KB Output is correct
25 Correct 15 ms 13816 KB Output is correct
26 Correct 15 ms 13816 KB Output is correct
27 Correct 15 ms 13816 KB Output is correct
28 Correct 15 ms 13816 KB Output is correct
29 Correct 14 ms 13816 KB Output is correct
30 Correct 14 ms 13820 KB Output is correct
31 Correct 15 ms 13944 KB Output is correct
32 Correct 15 ms 13816 KB Output is correct
33 Correct 15 ms 13816 KB Output is correct
34 Correct 15 ms 13788 KB Output is correct
35 Correct 15 ms 13816 KB Output is correct
36 Correct 14 ms 13816 KB Output is correct
37 Correct 15 ms 13944 KB Output is correct
38 Correct 14 ms 13816 KB Output is correct
39 Correct 14 ms 13804 KB Output is correct
40 Correct 15 ms 13816 KB Output is correct
41 Correct 15 ms 13816 KB Output is correct
42 Correct 17 ms 13816 KB Output is correct
43 Correct 15 ms 13816 KB Output is correct
44 Correct 15 ms 13828 KB Output is correct
45 Correct 14 ms 13816 KB Output is correct
46 Correct 15 ms 13816 KB Output is correct
47 Correct 15 ms 13816 KB Output is correct
48 Correct 15 ms 13816 KB Output is correct
49 Correct 16 ms 13816 KB Output is correct
50 Correct 15 ms 13816 KB Output is correct
51 Correct 15 ms 13816 KB Output is correct
52 Correct 15 ms 13816 KB Output is correct
53 Correct 16 ms 13816 KB Output is correct
54 Correct 20 ms 14248 KB Output is correct
55 Correct 20 ms 14200 KB Output is correct
56 Correct 64 ms 17144 KB Output is correct
57 Correct 54 ms 17132 KB Output is correct
58 Correct 61 ms 17132 KB Output is correct
59 Correct 60 ms 17132 KB Output is correct
60 Correct 65 ms 18512 KB Output is correct
61 Correct 53 ms 18300 KB Output is correct
62 Correct 63 ms 18416 KB Output is correct
63 Correct 63 ms 18420 KB Output is correct
64 Correct 65 ms 18388 KB Output is correct
65 Correct 69 ms 18432 KB Output is correct
66 Correct 63 ms 18348 KB Output is correct
67 Correct 61 ms 18220 KB Output is correct
68 Correct 63 ms 18412 KB Output is correct
69 Correct 15 ms 13820 KB Output is correct
70 Correct 15 ms 13944 KB Output is correct
71 Correct 63 ms 18416 KB Output is correct
72 Correct 62 ms 18396 KB Output is correct
73 Correct 62 ms 18344 KB Output is correct
74 Correct 14 ms 13816 KB Output is correct
75 Correct 15 ms 13820 KB Output is correct
76 Correct 15 ms 13816 KB Output is correct
77 Correct 14 ms 13816 KB Output is correct
78 Correct 255 ms 31160 KB Output is correct
79 Correct 121 ms 19776 KB Output is correct
80 Correct 251 ms 32344 KB Output is correct
81 Correct 67 ms 18452 KB Output is correct
82 Correct 261 ms 32424 KB Output is correct
83 Correct 187 ms 24900 KB Output is correct
84 Correct 15 ms 13788 KB Output is correct
85 Correct 15 ms 13816 KB Output is correct
86 Correct 15 ms 13852 KB Output is correct
87 Correct 15 ms 13816 KB Output is correct
88 Correct 16 ms 13944 KB Output is correct
89 Correct 16 ms 13944 KB Output is correct
90 Correct 16 ms 13900 KB Output is correct
91 Correct 16 ms 13944 KB Output is correct
92 Correct 16 ms 13944 KB Output is correct
93 Correct 15 ms 13916 KB Output is correct
94 Correct 16 ms 13944 KB Output is correct
95 Correct 15 ms 13816 KB Output is correct
96 Correct 15 ms 13816 KB Output is correct
97 Correct 15 ms 13816 KB Output is correct
98 Correct 15 ms 13816 KB Output is correct
99 Correct 19 ms 13944 KB Output is correct
100 Correct 16 ms 13944 KB Output is correct
101 Correct 31 ms 15512 KB Output is correct
102 Correct 25 ms 14456 KB Output is correct
103 Correct 296 ms 32404 KB Output is correct
104 Correct 215 ms 32304 KB Output is correct
105 Correct 205 ms 26268 KB Output is correct
106 Correct 255 ms 32416 KB Output is correct
107 Correct 115 ms 19960 KB Output is correct
108 Correct 123 ms 21300 KB Output is correct
109 Correct 66 ms 18672 KB Output is correct
110 Correct 62 ms 18416 KB Output is correct
111 Correct 249 ms 30744 KB Output is correct
112 Correct 230 ms 29448 KB Output is correct
113 Correct 154 ms 20088 KB Output is correct
114 Correct 244 ms 32456 KB Output is correct
115 Correct 231 ms 32520 KB Output is correct