oj.uz

Submission #151427

# Submission time Handle Problem Language Result Execution time Memory
151427 2019-09-02T22:30:08 Z scott_wu On the Grid (FXCUP4_grid) C++17
43 / 100
 13 ms 376 KB 
#include "grid.h"
#include <bits/stdc++.h>

using namespace std;
const int MAXN = 1100;

int N;
vector <int> cv;
vector <int> nv;
int ans[MAXN];

void cyc (int K)
{
    nv.clear();

    for (int i = 0; i < K; i++)
        nv.push_back(cv[(i+K-1)%K]);
    for (int i = K; i < N; i++)
        nv.push_back(cv[i]);
}

vector<int> SortDisks(int __N) {
    N = __N;
    for (int i = 0; i < N; i++)
        cv.push_back(i);

    int nhas = N;
    while (nhas)
    {
        int cval = PutDisks (cv);
        cyc (nhas);
        int nval = PutDisks (nv);

        cv = nv;
        if (cval != nval + 1)
        {
            ans[cv[0]] = nval - N;
            nhas--;
            for (int i = 0; i < N - 1; i++)
            {
                if (i >= nhas && ans[cv[i]] <= ans[cv[i+1]])
                    break;
                swap (cv[i], cv[i+1]);
            }
        }
    }
    

    vector <int> res;
    for (int i = 0; i < N; i++)
        res.push_back(ans[i] + 1);
    return res;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 248 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 4 ms 248 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Incorrect 13 ms 248 KB Output isn't correct
19 Halted 0 ms 0 KB -