QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#113053	#6394. Turn on the Light	hos_lyric	AC ✓	3ms	3760kb	C++14	2.7kb	2023-06-16 08:29:47	2023-06-16 08:29:48

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-06-16 08:29:48]
评测

测评结果：AC
用时：3ms
内存：3760kb

查看

[2023-06-16 08:29:47]
提交

answer

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int Ask(int x) {
  printf("? %d\n", x);
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  return ret;
}
void Answer(int x) {
  printf("! %d\n", x);
  fflush(stdout);
  exit(0);
}

int main() {
  int N;
  scanf("%d", &N);
  
  int last = 0;
  
  vector<int> cands;
  auto brute = [&]() -> void {
    const int len = cands.size();
    for (int i = 0; i < len - 1; ++i) {
      const int res = Ask(cands[i]);
      if (last == res) Answer(cands[i]);
      last = res;
    }
    Answer(cands[len - 1]);
  };
  
  int L = 1, R = N;
  int A, B;
  for (; ; ) {
    const int l = (L + L + L + R) / 4;
    const int r = (L + R + R + R) / 4;
    if (l == r) {
      for (int x = L; x <= R; ++x) cands.push_back(x);
      brute();
    }
    const int f = Ask(l); if (last == f) { Answer(l); } last = f;
    const int g = Ask(r); if (last == g) { Answer(r); } last = g;
    if (g) {
      A = l - 1;
      B = r + 1;
      break;
    } else {
      L = l + 1;
      R = r - 1;
    }
  }
// cerr<<"waf "<<L<<" "<<A<<" "<<B<<" "<<R<<endl;
  
  for (; L <= A && B <= R; ) {
    const int l = (L + A) / 2;
    const int r = (B + R) / 2;
    const int e = last;
    const int f = Ask(l); if (last == f) { Answer(l); } last = f;
    const int g = Ask(r); if (last == g) { Answer(r); } last = g;
    if (e < g) {
      A = l - 1;
      B = r + 1;
    } else {
      L = l + 1;
      R = r - 1;
    }
  }
  
  for (int x = L; x <= A; ++x) cands.push_back(x);
  for (int x = B; x <= R; ++x) cands.push_back(x);
  brute();
  
  return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 2ms

memory: 3732kb

input:

3
1
2

output:

? 1
? 2
! 3

result:

ok Correct position at 3

Test #2:

score: 0

Accepted

time: 2ms

memory: 3624kb

input:

output:

? 3
? 7
? 1
? 9
? 2
? 8
! 8

result:

ok Correct position at 8

Test #3:

score: 0

Accepted

time: 0ms

memory: 3736kb

input:

output:

? 3
? 7
? 1
? 8
! 8

result:

ok Correct position at 8

Test #4:

score: 0

Accepted

time: 1ms

memory: 3620kb

input:

output:

? 2
? 6
? 3
? 4
! 4

result:

ok Correct position at 4

Test #5:

score: 0

Accepted

time: 1ms

memory: 3624kb

input:

output:

? 2
? 5
? 1
? 6
! 6

result:

ok Correct position at 6

Test #6:

score: 0

Accepted

time: 1ms

memory: 3624kb

input:

output:

? 2
? 4
? 1
? 5
! 5

result:

ok Correct position at 5

Test #7:

score: 0

Accepted

time: 1ms

memory: 3612kb

input:

output:

? 2
? 4
? 1
? 5
! 5

result:

ok Correct position at 5

Test #8:

score: 0

Accepted

time: 1ms

memory: 3628kb

input:

4
1
1

output:

? 1
? 3
! 3

result:

ok Correct position at 3

Test #9:

score: 0

Accepted

time: 1ms

memory: 3676kb

input:

3
1
1

output:

? 1
? 2
! 2

result:

ok Correct position at 2

Test #10:

score: 0

Accepted

time: 2ms

memory: 3700kb

input:

2
1

output:

? 1
! 2

result:

ok Correct position at 2

Test #11:

score: 0

Accepted

time: 2ms

memory: 3580kb

input:

output:

! 1

result:

ok Correct position at 1

Test #12:

score: 0

Accepted

time: 2ms

memory: 3624kb

input:

output:

result:

ok Correct position at 749997

Test #13:

score: 0

Accepted

time: 2ms

memory: 3704kb

input:

output:

result:

ok Correct position at 999997

Test #14:

score: 0

Accepted

time: 0ms

memory: 3696kb

input:

output:

result:

ok Correct position at 999996

Test #15:

score: 0

Accepted

time: 2ms

memory: 3608kb

input:

output:

result:

ok Correct position at 999995

Test #16:

score: 0

Accepted

time: 1ms

memory: 3636kb

input:

output:

result:

ok Correct position at 749994

Test #17:

score: 0

Accepted

time: 2ms

memory: 3628kb

input:

output:

result:

ok Correct position at 999993

Test #18:

score: 0

Accepted

time: 2ms

memory: 3664kb

input:

output:

result:

ok Correct position at 999992

Test #19:

score: 0

Accepted

time: 2ms

memory: 3756kb

input:

output:

result:

ok Correct position at 999991

Test #20:

score: 0

Accepted

time: 1ms

memory: 3624kb

input:

output:

result:

ok Correct position at 749991

Test #21:

score: 0

Accepted

time: 3ms

memory: 3620kb

input:

output:

result:

ok Correct position at 999989

Test #22:

score: 0

Accepted

time: 2ms

memory: 3620kb

input:

output:

result:

ok Correct position at 43

Test #23:

score: 0

Accepted

time: 0ms

memory: 3644kb

input:

output:

result:

ok Correct position at 51

Test #24:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

output:

result:

ok Correct position at 51

Test #25:

score: 0

Accepted

time: 2ms

memory: 3676kb

input:

output:

result:

ok Correct position at 51

Test #26:

score: 0

Accepted

time: 2ms

memory: 3732kb

input:

output:

result:

ok Correct position at 999781

Test #27:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

output:

result:

ok Correct position at 999980

Test #28:

score: 0

Accepted

time: 0ms

memory: 3636kb

input:

output:

result:

ok Correct position at 999979

Test #29:

score: 0

Accepted

time: 3ms

memory: 3752kb

input:

output:

result:

ok Correct position at 999978

Test #30:

score: 0

Accepted

time: 1ms

memory: 3732kb

input:

output:

result:

ok Correct position at 499947

Test #31:

score: 0

Accepted

time: 3ms

memory: 3672kb

input:

output:

result:

ok Correct position at 500070

Test #32:

score: 0

Accepted

time: 3ms

memory: 3760kb

input:

output:

result:

ok Correct position at 500076

Test #33:

score: 0

Accepted

time: 2ms

memory: 3632kb

input:

output:

result:

ok Correct position at 499965

Test #34:

score: 0

Accepted

time: 2ms

memory: 3652kb

input:

output:

result:

ok Correct position at 749997

Test #35:

score: 0

Accepted

time: 1ms

memory: 3648kb

input:

output:

result:

ok Correct position at 999997

Test #36:

score: 0

Accepted

time: 2ms

memory: 3640kb

input:

output:

result:

ok Correct position at 999996

Test #37:

score: 0

Accepted

time: 2ms

memory: 3736kb

input:

output:

result:

ok Correct position at 999995

Test #38:

score: 0

Accepted

time: 2ms

memory: 3704kb

input:

output:

result:

ok Correct position at 1000000

Test #39:

score: 0

Accepted

time: 2ms

memory: 3620kb

input:

output:

result:

ok Correct position at 999999

Test #40:

score: 0

Accepted

time: 2ms

memory: 3700kb

input:

output:

result:

ok Correct position at 999998

Test #41:

score: 0

Accepted

time: 2ms

memory: 3648kb

input:

output:

result:

ok Correct position at 999997

Test #42:

score: 0

Accepted

time: 0ms

memory: 3656kb

input:

output:

result:

ok Correct position at 1000000

Test #43:

score: 0

Accepted

time: 1ms

memory: 3652kb

input:

output:

result:

ok Correct position at 1