oj.uz

Submission #927326

# Submission time Handle Problem Language Result Execution time Memory
927326 2024-02-14T18:05:18 Z velislavgarkov Prisoner Challenge (IOI22_prison) C++17
65 / 100
 11 ms 1624 KB 
#include "prison.h"
#include <iostream>
#include <vector>
using namespace std;
vector <vector <int> > sol;
int decide(int number, int s) {
    if (number==0) return 1 + ((s & (1<<12)) > 0);
    number--;
    int last, cur, type;
    type=sol[number+1][0];
    last=12-number/2;
    bool l=(s & (1<<last));
    if (number%2!=l) {
        if (number%2>l) return -1-type;
        return -1-!type;
    }
    cur=last-1;
    l=(s & (1<<cur));
    if (cur==0) {
        if (l) return -1-!type;
        return -1-type;
    }
    return 1+(number/2+1)*2+l;
}
vector<vector<int> > devise_strategy(int N) {
    sol.resize(25);
    for (int i=0;i<25;i++) {
        sol[i].resize(N+1);
        if (i==0) sol[i][0]=0;
        else sol[i][0]=((i-1)/2+1)%2;
        for (int j=1;j<=N;j++) {
            sol[i][j]=decide(i,j);
        }
    }
    return sol;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
55.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Output is partially correct
3 Partially correct 0 ms 376 KB Output is partially correct
4 Partially correct 5 ms 860 KB Output is partially correct
5 Partially correct 9 ms 1372 KB Output is partially correct
6 Partially correct 10 ms 1624 KB Output is partially correct
7 Partially correct 11 ms 1624 KB Output is partially correct
8 Partially correct 0 ms 344 KB Output is partially correct
9 Partially correct 1 ms 344 KB Output is partially correct
10 Partially correct 2 ms 372 KB Output is partially correct
11 Partially correct 4 ms 860 KB Output is partially correct
12 Partially correct 10 ms 1372 KB Output is partially correct