oj.uz

Submission #1026406

# Submission time Handle Problem Language Result Execution time Memory
1026406 2024-07-18T05:13:12 Z Mardonbekhazratov Prisoner Challenge (IOI22_prison) C++17
5 / 100
 19 ms 37956 KB 
#include "prison.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>>ans;

std::vector<std::vector<int>> devise_strategy(int N) {
    ans.assign(N,vector<int>(N+1));
    iota(ans[0].begin(),ans[0].end(),0);
    ans[0][N]=N-1;
    for(int i=1;i<N;i++){
        ans[i][0]=1;
        for(int j=1;j<=N;j++){
            if(j<=i) ans[i][j]=-2;
            else ans[i][j]=-1;
        }
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 5 ms 1116 KB Output is correct
5 Correct 16 ms 3176 KB Output is correct
6 Correct 17 ms 3164 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 10 ms 1804 KB Output is correct
9 Correct 11 ms 2136 KB Output is correct

Subtask #2
0.0 / 5.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 Incorrect 1 ms 860 KB Wrong answer detected in grader
4 Halted 0 ms 0 KB -

Subtask #3
0 / 90.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 19 ms 37956 KB Wrong answer detected in grader
5 Halted 0 ms 0 KB -