Submission #1223135

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223135		spetr	How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)	C++20	0 / 100	0 ms	484 KiB

avoid

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

std::pair<int, int> scout(int R, int H) {

    int velikost = 1;
    vector<vector<int>> v;
    for (int i = 0; i < 1000; i++){
        v.push_back({});
    }
    for (int i = 0; i < R; i++){
        vector<int> pole;
        for (int j = 1; j <= 1000; j+= 2*velikost){
            for (int k = j; k < j+velikost; k++){
                pole.push_back(k);
                v[j-1].push_back(i);
            }
        }
        velikost *= 2;
        send(pole);
    }
    auto p = wait();
    for (int i = 0; i < 1000; i++){
        bool ok = true;
        for (int j = 0; (int)v[i].size(); j++){
            if (p[v[i][j]] == 0){
                ok = false;
                break;
            } 
        }
        if (ok){
            return {i+1,i+1};
        }
    }




  
}

Compilation message (stderr)

avoid.cpp: In function 'std::pair<int, int> scout(int, int)':
avoid.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75