Submission #829451

#	Time	Username	Problem	Language	Result	Execution time	Memory
829451		tolbi	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	11 ms	10284 KiB

prison

#include <bits/stdc++.h>
using namespace std;
#include "prison.h"
#include <vector>

std::vector<std::vector<int>> devise_strategy(int n) {
    function<void(int,int,int,int)> solve;
    vector<int> yeni(n+1,0);
    vector<vector<int>> ansarr;
    ansarr.push_back(yeni);
    int crr = 1;
    solve = [&](int l, int r, int turn, int x){
        ansarr[x][0]=turn;
        if (l==r){
            for (int i = 1; i < l; i++){
                ansarr[x][i]=(1-turn)-2;
            }
            for (int i = r; i < ansarr[x].size(); i++){
                ansarr[x][i]=turn-2;
            }
        }
        for (int i = 1; i <= l; i++){
            ansarr[x][i]=(1-turn)-2;
        }
        for (int i = r; i < ansarr[x].size(); i++){
            ansarr[x][i]=turn-2;
        }
        l++,r--;
        if (l>r) return;
        int mid = l+(r-l)/2;
        for (int i = l; i <= mid; i++){
            ansarr[x][i]=crr;
        }
        ansarr.push_back(yeni);
        crr++;
        solve(l,mid,1-turn,crr-1);

        if (l==r) return;
        for (int i = mid+1; i <= r; i++){
            ansarr[x][i]=crr;
        }
        ansarr.push_back(yeni);
        crr++;
        solve(mid+1,r,1-turn,crr-1);

    };
    solve(1,n,0,0);
    /*
    for (int i = 0; i < ansarr.size(); i++){
        for (int j = 0; j < ansarr[i].size(); j++){
            cout<<ansarr[i][j]<<" ";
        }
        cout<<endl;
    }
    */
    return ansarr;
}

Compilation message (stderr)

prison.cpp: In lambda function:
prison.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |             for (int i = r; i < ansarr[x].size(); i++){
      |                             ~~^~~~~~~~~~~~~~~~~~
prison.cpp:25:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int i = r; i < ansarr[x].size(); i++){
      |                         ~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90