| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1349901 | efeg | Dark Ride (EGOI25_darkride) | C++20 | 1 ms | 480 KiB |
#include <bits/stdc++.h>
using namespace std;
int query(string& sorgu) {
cout << "? " << sorgu << '\n';
cout.flush();
int q; cin >> q;
return (q & 1);
}
int main() {
int n;
cin >> n;
int d = 0,k = -1;
for (int i = 0; i < 15; i++){
string sorgu;
for (int j = 0; j < n; j++){
if ((j >> i) & 1) sorgu += "1";
else sorgu += "0";
}
int q = query(sorgu);
d += (1 << i) * q;
if (k == -1 && q) k = i;
}
int a = 0;
for (int i = 0; i < 15; i++){
string sorgu;
for (int j = 0; j < n; j++){
if (((j >> i) & 1) && ((j >> k) & 1)) sorgu += "1";
else sorgu += "0";
}
int q = query(sorgu);
a += (1 << i) * q;
}
cout << "! " << a << " " << (a ^ d) << '\n';
cout.flush();
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
