oj.uz

Submission #297833

# Submission time Handle Problem Language Result Execution time Memory
297833 2020-09-12T03:41:54 Z ToMmyDong Sorting (IOI15_sorting) C++17
100 / 100
 390 ms 34004 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) static_cast<int>(i.size())
#define FOR(i, j, k, in) for (int i=j; i < (k) ; i+=in)
#define RFOR(i, j, k, in) for (int i=j; i >= (k) ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i, j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(), _a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
template<typename T, typename S>
istream &operator >> (istream &is, pair<T, S> &p) {
    return is >> p.X >> p.Y;
}
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do {\
    fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T> void _do(T &&_x) {cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x, S &&..._t) {cerr <<_x <<" ,"; _do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s, const pair<_a, _b> &_p) {return _s << "(" << _p.X << "," << _p.Y << ")";}
template<typename It> ostream& _OUTC(ostream &_s, It _ita, It _itb)
{
    _s << "{";
    for (It _it=_ita; _it != _itb; _it++) {
        _s <<(_it == _ita?"":",")<< *_it;
    }
    _s << "}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s, const vector<_a> &_c) {return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,2> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,3> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,4> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,5> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const set<_a> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const deque<_a> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s, const map<_a,_b> &_c) {return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
class Timer {
private:
    string scope_name;
    chrono::high_resolution_clock::time_point start_time;
public:
    Timer (string name) : scope_name(name) {
        start_time = chrono::high_resolution_clock::now();
    }
    ~Timer () {
        auto stop_time = chrono::high_resolution_clock::now();
        auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
        double mlength = double(length) * 0.001;
        debug(scope_name, mlength);
    }
};
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif
#include "sorting.h"

int n;
vector<int> org, fnl, pos;
vector<pii> opr, res;

void change (int pa, int pb) {
    swap(fnl[pa], fnl[pb]);
    swap(pos[fnl[pa]], pos[fnl[pb]]);
}
bool solve (int cnt) {
    fnl = org;
    for (int i=0; i<cnt; i++) {
        swap(fnl[opr[i].X], fnl[opr[i].Y]);
    }
    debug(cnt, fnl);
    pos.resize(n);
    for (int i=0; i<n; i++) {
        pos[fnl[i]] = i;
    }

    vector<pii> swp;
    for (int i=0; i<n; i++) {
        if (fnl[i] != i) {
            swp.eb(i, fnl[i]);
            int ot = fnl[i];
            swap(fnl[pos[i]], fnl[i]);
            pos[ot] = pos[i];
            pos[i] = i;
        }
    }
    debug(swp);

    fnl = org;
    for (int i=0; i<n; i++) {
        pos[fnl[i]] = i;
    }
    if (swp.size() > cnt) return false;
    res.clear();
    for (int i=0; i<cnt; i++) {
        change(opr[i].X, opr[i].Y);        
        int pa = 0, pb = 0;
        if (i < SZ(swp)) {
            pa = pos[swp[i].X];
            pb = pos[swp[i].Y];
        }
        change(pa, pb);
        res.eb(pa, pb);
    }


    return true;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n = N;
    for (int i=0; i<N; i++) {
        org.eb(S[i]);
    }
    for (int i=0; i<M; i++) {
        opr.eb(X[i], Y[i]);
    }

    int L = -1, R = M;
    while (L < R - 1) {
        int M = (L + R) >> 1;
        if (solve(M)) R = M;
        else L = M;
    }

    solve(R);
    debug(R, res.size());
    assert(res.size() == R);
    for (int i=0; i<R; i++) {
        tie(P[i], Q[i]) = res[i];
    }
    debug(R);
	return R;
}

Compilation message

sorting.cpp: In function 'bool solve(int)':
sorting.cpp:114:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  114 |     if (swp.size() > cnt) return false;
      |         ~~~~~~~~~~~^~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:142:13: warning: declaration of 'int M' shadows a parameter [-Wshadow]
  142 |         int M = (L + R) >> 1;
      |             ^
sorting.cpp:131:39: note: shadowed declaration is here
  131 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from sorting.cpp:1:
sorting.cpp:149:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  149 |     assert(res.size() == R);
      |            ~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 288 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 768 KB Output is correct
26 Correct 2 ms 652 KB Output is correct
27 Correct 2 ms 896 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 273 ms 30408 KB Output is correct
16 Correct 322 ms 30984 KB Output is correct
17 Correct 339 ms 32464 KB Output is correct
18 Correct 144 ms 27604 KB Output is correct
19 Correct 257 ms 30932 KB Output is correct
20 Correct 269 ms 31696 KB Output is correct
21 Correct 253 ms 31832 KB Output is correct
22 Correct 277 ms 27864 KB Output is correct
23 Correct 306 ms 33488 KB Output is correct
24 Correct 372 ms 33368 KB Output is correct
25 Correct 390 ms 32724 KB Output is correct
26 Correct 268 ms 30804 KB Output is correct
27 Correct 242 ms 30164 KB Output is correct
28 Correct 328 ms 32980 KB Output is correct
29 Correct 343 ms 32084 KB Output is correct
30 Correct 200 ms 29392 KB Output is correct
31 Correct 354 ms 32724 KB Output is correct
32 Correct 318 ms 32600 KB Output is correct
33 Correct 369 ms 32976 KB Output is correct
34 Correct 321 ms 32976 KB Output is correct
35 Correct 260 ms 30588 KB Output is correct
36 Correct 119 ms 27868 KB Output is correct
37 Correct 360 ms 34004 KB Output is correct
38 Correct 350 ms 32596 KB Output is correct
39 Correct 369 ms 32856 KB Output is correct