oj.uz

답안 #1040776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040776 2024-08-01T09:05:59 Z 정희우(#10998) How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) C++17
10 / 100
 1 ms 344 KB 
#include "avoid.h"
#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;
using lint = long long;
using intp = pair<int,int>;
using vint = vector<int>;

intp scout(int R, int H)
{
	for(int i=0;i<10;i++)
	{
		vint v;
		v.clear();
		for(int p=1;p<=1000;p++)
			if((p>>i)&1)v.push_back(p);
		send(v);
	}
	vint w=wait();
	int ans=0;
	for(int i=0;i<10;i++)
		ans+=w[i]<<i;
	return {ans, ans};
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 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 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Not correct
2 Halted 0 ms 0 KB -