# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
864256 | 2023-10-22T09:31:25 Z | noobcodur | Mađioničar (COI22_madionicar) | C++14 | 1 ms | 344 KB |
#include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; #define ll long long #define ld long double #define forn(i,j) for(ll i = 0; i < j; i++) #define forrange(i,j,k) for(int i = j; i < k; ++i) #define rof(i,j) rof(int i = j; i >= 0; --i) #define pii pair<int,int> #define vll vector<ll> #define vi vector<int> #define vvll vector<vll> #define vvi vector<vi> #define vb vector<bool> #define pb push_back #define p push #define f first #define s second #define all(x) x.begin(), x.end() #define eb emplace_back #define debug(x) cerr << #x << " is " << x << endl; #define MOD 1000000007 int t; void check(int l, int r){ t = 0; printf("? %d\n", l, r); fflush(stdout); scanf("%d\n", t); } bool check2(int l, int r){ check(l,r); if(t == 1){ return true; } return false; } int main(){ int n; cin >> n; int mtx = 0; forrange(i,1,n+1){ if(i + mtx + 1 < n + 1 && i - mtx - 1 > 0){ if(check2(i - mtx - 1,i + mtx + 1)){ mtx++; } } } if(mtx == 0){ cout << 1 << endl; } else{ cout << mtx << endl; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 0 ms | 344 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 0 ms | 344 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1 ms | 344 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 0 ms | 344 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |