oj.uz

Submission #828118

# Submission time Handle Problem Language Result Execution time Memory
828118 2023-08-17T05:29:00 Z Seb Prisoner Challenge (IOI22_prison) C++17
38 / 100
 17 ms 1592 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define f first
#define s second

std::vector<std::vector<int>> devise_strategy(int N) {
    vector <vector<int>> ans;
    vector <int> aux;
    aux.push_back(0);
    for (int i=1;i<=N;i++) {
        if ((i>>12)&1) aux.push_back(26);
        else aux.push_back(13);
    }
    ans.push_back(aux);
    aux.clear();

    for (int k=0;k<=12;k++) {
        aux.push_back(1);
        for (int i=1;i<=N;i++) {
            if ((i>>k)&1) aux.push_back(-1);
            else aux.push_back(26+k);
        }
        ans.push_back(aux);
        aux.clear();
    }

    for (int k=0;k<=12;k++) {
        aux.push_back(1);
        for (int i=1;i<=N;i++) {
            if ((i>>k)&1) aux.push_back(26+k);
            else aux.push_back(-2);
        }
        ans.push_back(aux);
        aux.clear();
    }

    for (int k=0;k<=11;k++) {
        aux.push_back(0);
        for (int i=1;i<=N;i++) {
            if ((i>>k)&1) aux.push_back(14+k);
            else aux.push_back(1+k);
        }
        ans.push_back(aux);
        aux.clear();
    }
    /*
    for (auto it=ans.begin();it!=ans.end();it++) {
        for (auto itr=it->begin();itr!=it->end();itr++) cout<<*itr<<" ";
        cout<<"\n";
    }
    */
    return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
28.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Output is partially correct
3 Partially correct 0 ms 212 KB Output is partially correct
4 Partially correct 7 ms 852 KB Output is partially correct
5 Partially correct 12 ms 1360 KB Output is partially correct
6 Partially correct 15 ms 1564 KB Output is partially correct
7 Partially correct 17 ms 1592 KB Output is partially correct
8 Partially correct 1 ms 212 KB Output is partially correct
9 Partially correct 2 ms 340 KB Output is partially correct
10 Partially correct 2 ms 468 KB Output is partially correct
11 Partially correct 7 ms 724 KB Output is partially correct
12 Partially correct 12 ms 1364 KB Output is partially correct