oj.uz

Submission #1050807

# Submission time Handle Problem Language Result Execution time Memory
1050807 2024-08-09T14:41:42 Z MercubytheFirst How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) C++17
10 / 100
 1 ms 344 KB 
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;


std::pair<int, int> scout(int R, int H) {
  for(int b = 0; b < 10; ++b) {
    vector<int> curset;
    for(int i = 1; i <= 1000; ++i) {
      if(1 << b & i) {
        curset.push_back(i);
      }
    }
    send(curset);
  }
  vector<int> results = wait();
  int ans = 0;
  for(int b = 0; b < 10; ++b) {
    if(results[b]) {
      ans |= 1 << b;
    }
  }
  return {ans, ans};
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
2 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
3 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
4 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
5 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
6 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
7 Correct 1 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
8 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
9 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
10 Correct 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -