oj.uz

Submission #580612

# Submission time Handle Problem Language Result Execution time Memory
580612 2022-06-21T14:02:47 Z maomao90 On the Grid (FXCUP4_grid) C++17
100 / 100
 21 ms 344 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "grid.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1005;

int n;

vi shift(vi p) {
    vi res = p;
    REP (i, 0, SZ(p)) {
        if (i - 1 < 0) {
            res[i] = p[i - 1 + SZ(p)];
        } else {
            res[i] = p[i - 1];
        }
    }
    return res;
}

vi SortDisks(int N) {
    n = N;
    vi ans(n, -1), mpa(n + 1, -1);
    vi p(n, 0);
    iota(ALL(p), 0);
    int prv = PutDisks(p);
    while (1) {
        vi unfix;
        REP (i, 0, n) {
            if (ans[p[i]] == -1) {
                unfix.pb(p[i]);
            }
        }
        if (unfix.empty()) {
            break;
        }
        unfix = shift(unfix);
        reverse(ALL(unfix));
        vi np;
        REP (i, 0, n) {
            if (mpa[i + 1] != -1) {
                np.pb(mpa[i + 1]);
            } else {
                np.pb(unfix.back()); unfix.pop_back();
            }
        }
        p = np;
        int cur = PutDisks(p);
        if (cur >= prv) {
            ans[p[0]] = cur - (n - 1);
            mpa[cur - (n - 1)] = p[0];
        } else {
            prv = cur;
        }
    }
    return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 308 KB Output is correct

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 308 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 11 ms 340 KB Output is correct
19 Correct 14 ms 340 KB Output is correct
20 Correct 20 ms 308 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 20 ms 308 KB Output is correct
23 Correct 20 ms 344 KB Output is correct
24 Correct 20 ms 300 KB Output is correct
25 Correct 21 ms 340 KB Output is correct
26 Correct 19 ms 340 KB Output is correct