oj.uz

Submission #1040475

# Submission time Handle Problem Language Result Execution time Memory
1040475 2024-08-01T05:39:26 Z 김은성(#10995) How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) C++17
0 / 100
 1 ms 420 KB 
#include "avoid.h"
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;

std::pair<int, int> scout(int R, int H) {
	int i, j, ans = 0;
	for (i = 0; i < 10; i++) {
		vector<int> vec;
		for (j = 0; j < 1000; j++) {
			if (j & (1 << i))
				vec.push_back(j);
		}
		send(vec);
	}
	vector<int> ret = wait();
	for (i = 0; i < 10; i++) {
		if (ret[i] == 1)
			ans |= (1 << i);
	}
	return make_pair(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
0.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 1 ms 348 KB Correct: 10 robot(s) used, 1 hour(s) passed
3 Correct 0 ms 348 KB Correct: 10 robot(s) used, 1 hour(s) passed
4 Correct 0 ms 348 KB Correct: 10 robot(s) used, 1 hour(s) passed
5 Correct 1 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 0 ms 344 KB Correct: 10 robot(s) used, 1 hour(s) passed
8 Correct 0 ms 348 KB Correct: 10 robot(s) used, 1 hour(s) passed
9 Incorrect 0 ms 420 KB Not correct
10 Halted 0 ms 0 KB -

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 -