Submission #1205181

#TimeUsernameProblemLanguageResultExecution timeMemory
1205181dostsHow to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)C++20
10 / 100
0 ms420 KiB
#include <bits/stdc++.h>
#include "avoid.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int> 
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " << 
#define all(x) x.begin(),x.end()
using namespace std;
const int MOD = 1e9+7;

std::pair<int, int> scout(int R, int H) {
  if (H == 1) {
    if (R == 10) {
      int ans = 0;
      for (int i=0;i<10;i++) {
        vi v;
        for (int j = 0;j<1000;j++) {
          if (j&(1<<i)) v.push_back(j+1);
        }
        send(v);
      }
      vi rets = wait();
      for (int i = 0;i<10;i++) if (rets[i]) ans|=(1<<i);
      return {ans+1,ans+1};
    }
    else {
      
    }
  }
  else if (H == 2) {

  }
  else {

  }
}

Compilation message (stderr)

avoid.cpp: In function 'std::pair<int, int> scout(int, int)':
avoid.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...