Submission #1691165
Source Code Expand
// 基本テンプレート #include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> #include <numeric> #include <fstream> #include <functional> using namespace std; #define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++) #define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++) #define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--) #define int long long int template<typename T> void chmax(T &a, T b) {a = max(a, b);} template<typename T> void chmin(T &a, T b) {a = min(a, b);} template<typename T> void chadd(T &a, T b) {a = a + b;} typedef pair<int, int> pii; typedef long long ll; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; constexpr ll INF = 1001001001001001LL; constexpr ll MOD = 1000000007LL; signed main() { int ub = 10, lb = 0; while(ub - lb > 1) { int mid = (ub + lb) / 2; int val = 1; rep(i,0,mid) val *= 10; printf("? %lld\n", val); fflush(stdout); char c; cin >> c; if(c == 'Y') lb = mid; else ub = mid; } int digit = lb; ub = 1, lb = 1; rep(i,0,digit) lb *= 10; rep(i,0,digit+1) ub *= 10; while(ub - lb > 1) { int mid = (ub + lb) / 2; printf("? %lld\n", mid); fflush(stdout); char c; cin >> c; if(c == 'Y') lb = mid; else ub = mid; } printf("! %lld\n", lb); fflush(stdout); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Awkward Response |
User | tsutaj |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1760 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 596 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 800 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt |
All | 00_example_01.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | WA | 3 ms | 592 KB |
01.txt | WA | 3 ms | 592 KB |
02.txt | WA | 3 ms | 592 KB |
03.txt | WA | 3 ms | 588 KB |
04.txt | WA | 4 ms | 592 KB |
05.txt | WA | 4 ms | 592 KB |
06.txt | WA | 4 ms | 592 KB |
07.txt | WA | 4 ms | 592 KB |
08.txt | WA | 4 ms | 584 KB |
09.txt | WA | 3 ms | 592 KB |
10.txt | WA | 3 ms | 592 KB |
11.txt | WA | 3 ms | 596 KB |
12.txt | WA | 3 ms | 596 KB |
13.txt | WA | 4 ms | 592 KB |
14.txt | WA | 3 ms | 592 KB |
15.txt | WA | 4 ms | 592 KB |
16.txt | WA | 4 ms | 592 KB |
17.txt | WA | 4 ms | 592 KB |
18.txt | WA | 3 ms | 592 KB |
19.txt | WA | 3 ms | 596 KB |
20.txt | WA | 3 ms | 588 KB |
21.txt | WA | 4 ms | 592 KB |
22.txt | WA | 4 ms | 592 KB |
23.txt | WA | 4 ms | 592 KB |
24.txt | WA | 4 ms | 596 KB |
25.txt | WA | 4 ms | 592 KB |
26.txt | WA | 4 ms | 596 KB |
27.txt | WA | 4 ms | 596 KB |
28.txt | WA | 4 ms | 592 KB |
29.txt | WA | 4 ms | 592 KB |
30.txt | WA | 4 ms | 592 KB |
31.txt | AC | 3 ms | 596 KB |
32.txt | AC | 3 ms | 592 KB |
33.txt | AC | 3 ms | 588 KB |
34.txt | AC | 4 ms | 592 KB |
35.txt | AC | 4 ms | 596 KB |
36.txt | AC | 4 ms | 592 KB |
37.txt | AC | 4 ms | 592 KB |
38.txt | AC | 4 ms | 592 KB |
39.txt | AC | 4 ms | 592 KB |