oj.uz

Submission #967575

# Submission time Handle Problem Language Result Execution time Memory
967575 2024-04-22T13:01:21 Z GrindMachine Sorting (IOI15_sorting) C++17
16 / 100
 2 ms 600 KB 
#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;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "sorting.h"

int findSwapPairs(int n, int a[], int m, int X[], int Y[], int P[], int Q[]) {
    vector<int> plates(n), plate_pos(n);
    iota(all(plates),0), iota(all(plate_pos),0);
    rep(i,m){
        // swap plates x and y
        int x = X[i], y = Y[i];
        int &p = plate_pos[x], &q = plate_pos[y];
        swap(plates[p],plates[q]);
        swap(p,q);
    }

    vector<bool> vis(n);
    vector<pii> to_swap; // pairs of apples that need to be swapped

    rep(i,n){
        if(vis[i]) conts;
        int j = i;
        vector<int> apples;

        while(!vis[j]){
            vis[j] = 1;
            apples.pb(a[j]);
            j = plate_pos[a[j]];
        }

        rep(j,sz(apples)-1){
            to_swap.pb({apples[j],apples.back()});
        }
    }

    assert(sz(to_swap) <= m);

    iota(all(plates),0), iota(all(plate_pos),0);
    vector<int> apples(n), apple_pos(n);
    rep(i,n) apples[i] = a[i], apple_pos[a[i]] = i;

    rep(i,m){
        {
            int x = X[i], y = Y[i];
            int &p = plate_pos[x], &q = plate_pos[y];
            swap(plates[p],plates[q]);
            swap(p,q);
        }

        if(!to_swap.empty()){
            auto [x,y] = to_swap.back();
            to_swap.pop_back();
            int &p = apple_pos[x], &q = apple_pos[y];
            P[i] = plates[p], Q[i] = plates[q];
            swap(apples[p],apples[q]);
            swap(p,q);
        }
    }

    rep(i,n) assert(plates[i] == apples[i]);

    rep(i,m){
        swap(a[X[i]],a[Y[i]]);
        swap(a[P[i]],a[Q[i]]);
    }

    rep(i,n) assert(a[i] == i);

    return m;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:88:13: warning: declaration of 'j' shadows a previous local [-Wshadow]
   88 |         rep(j,sz(apples)-1){
      |             ^
sorting.cpp:28:26: note: in definition of macro 'rep'
   28 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                          ^
sorting.cpp:79:13: note: shadowed declaration is here
   79 |         int j = i;
      |             ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Incorrect 0 ms 600 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Incorrect 0 ms 600 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 356 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Incorrect 0 ms 600 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -