oj.uz

Submission #151433

# Submission time Handle Problem Language Result Execution time Memory
151433 2019-09-02T22:40:47 Z scott_wu On the Grid (FXCUP4_grid) C++17
100 / 100
 21 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;
    int cval = PutDisks (cv);
    while (nhas)
    {
        cyc (nhas);
        int nval = PutDisks (nv);

        cv = nv;
        if (cval <= nval)
        {
            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]);
            }
            //if (cval == nval - nhas)
            //    cval = PutDisks (cv);
        }
        else
            cval = nval;
    }
    /*int r = (N * (N - 1)) / 2;
    for (int i = 1; i < N; i++)
        r -= ans[cv[i]];
    ans[cv[0]] = r;*/


    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 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 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 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 252 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 3 ms 248 KB Output is correct

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 252 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 3 ms 248 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 13 ms 376 KB Output is correct
19 Correct 17 ms 376 KB Output is correct
20 Correct 20 ms 248 KB Output is correct
21 Correct 11 ms 248 KB Output is correct
22 Correct 21 ms 376 KB Output is correct
23 Correct 21 ms 376 KB Output is correct
24 Correct 21 ms 376 KB Output is correct
25 Correct 20 ms 376 KB Output is correct
26 Correct 21 ms 248 KB Output is correct