oj.uz

Submission #466010

# Submission time Handle Problem Language Result Execution time Memory
466010 2021-08-17T14:05:36 Z Rafi22 The Collection Game (BOI21_swaps) C++14
21 / 100
 554 ms 496 KB 
#include <bits/stdc++.h>
#include "swaps.h"

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

void solve(int n,int v)
{
    bool flag=0;
    while(v--)
    {
        for(int i=1+flag;i<n;i+=2) schedule(i,i+1);
        vector<int>vec=visit();
        flag=!flag;
    }
    vector<int>ans(n);
    for(int i=0;i<n;i++) ans[i]=i+1;
    answer(ans);
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 200 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 200 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 200 KB Correct
2 Correct 147 ms 200 KB Correct

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 200 KB Correct
2 Correct 147 ms 200 KB Correct
3 Incorrect 66 ms 200 KB Not correct
4 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 200 KB Correct
2 Correct 152 ms 200 KB Correct
3 Correct 294 ms 268 KB Correct
4 Correct 505 ms 396 KB Correct

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 200 KB Correct
2 Correct 152 ms 200 KB Correct
3 Correct 294 ms 268 KB Correct
4 Correct 505 ms 396 KB Correct
5 Incorrect 54 ms 200 KB Not correct
6 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 200 KB Correct
2 Correct 147 ms 200 KB Correct
3 Correct 287 ms 268 KB Correct
4 Correct 519 ms 496 KB Correct
5 Correct 59 ms 292 KB Correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 200 KB Correct
2 Correct 147 ms 200 KB Correct
3 Correct 287 ms 268 KB Correct
4 Correct 519 ms 496 KB Correct
5 Correct 59 ms 292 KB Correct
6 Incorrect 53 ms 200 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 200 KB Correct
2 Correct 156 ms 200 KB Correct
3 Correct 281 ms 284 KB Correct
4 Correct 544 ms 396 KB Correct
5 Correct 50 ms 288 KB Correct
6 Incorrect 10 ms 272 KB Not correct

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 200 KB Correct
2 Correct 156 ms 200 KB Correct
3 Correct 281 ms 284 KB Correct
4 Correct 544 ms 396 KB Correct
5 Correct 50 ms 288 KB Correct
6 Incorrect 10 ms 272 KB Not correct

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 200 KB Correct
2 Correct 150 ms 200 KB Correct
3 Correct 290 ms 268 KB Correct
4 Correct 554 ms 408 KB Correct
5 Correct 56 ms 388 KB Correct
6 Incorrect 11 ms 276 KB Not correct
7 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 200 KB Correct
2 Correct 150 ms 200 KB Correct
3 Correct 290 ms 268 KB Correct
4 Correct 554 ms 408 KB Correct
5 Correct 56 ms 388 KB Correct
6 Incorrect 11 ms 276 KB Not correct
7 Halted 0 ms 0 KB -