oj.uz

답안 #1018759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018759 2024-07-10T09:30:02 Z MarwenElarbi Mađioničar (COI22_madionicar) C++17
100 / 100
 1335 ms 596 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int N;
 
int ask(int l, int r) {
  printf("? %d %d\n", l + 1, r + 1);
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  return ret;
}
 
void ans(int L) {
  printf("! %d\n", L);
  fflush(stdout);
}
 
int main(void) {
  scanf("%d", &N);
 
  int r_odd = 0, r_even = 0;
  for (int i = 0; i < N; ++i) {
    while (i - r_odd - 1 >= 0 && i + r_odd + 1 < N && ask(i - r_odd - 1, i + r_odd + 1)) ++r_odd;
    while (i - r_even >= 0 && i + r_even + 1 < N && ask(i - r_even, i + r_even + 1)) ++r_even;
  }
 
  ans(max(2 * r_odd + 1, 2 * r_even));
  return 0;
}

Compilation message

Main.cpp: In function 'int ask(int, int)':
Main.cpp:11:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |   scanf("%d", &ret);
      |   ~~~~~^~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%d", &N);
      |   ~~~~~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 344 KB Output is correct
2 Correct 61 ms 344 KB Output is correct
3 Correct 72 ms 340 KB Output is correct
4 Correct 66 ms 344 KB Output is correct
5 Correct 82 ms 344 KB Output is correct
6 Correct 90 ms 340 KB Output is correct
7 Correct 76 ms 344 KB Output is correct
8 Correct 75 ms 344 KB Output is correct
9 Correct 65 ms 344 KB Output is correct
10 Correct 79 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 344 KB Output is correct
2 Correct 61 ms 344 KB Output is correct
3 Correct 72 ms 340 KB Output is correct
4 Correct 66 ms 344 KB Output is correct
5 Correct 82 ms 344 KB Output is correct
6 Correct 90 ms 340 KB Output is correct
7 Correct 76 ms 344 KB Output is correct
8 Correct 75 ms 344 KB Output is correct
9 Correct 65 ms 344 KB Output is correct
10 Correct 79 ms 344 KB Output is correct
11 Correct 819 ms 344 KB Output is correct
12 Correct 795 ms 344 KB Output is correct
13 Correct 823 ms 344 KB Output is correct
14 Correct 785 ms 344 KB Output is correct
15 Correct 809 ms 344 KB Output is correct
16 Correct 782 ms 344 KB Output is correct
17 Correct 746 ms 344 KB Output is correct
18 Correct 805 ms 344 KB Output is correct
19 Correct 792 ms 344 KB Output is correct
20 Correct 764 ms 344 KB Output is correct
21 Correct 788 ms 344 KB Output is correct
22 Correct 819 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1100 ms 344 KB Output is correct
2 Correct 994 ms 344 KB Output is correct
3 Correct 1222 ms 344 KB Output is correct
4 Correct 1335 ms 344 KB Output is correct
5 Correct 1195 ms 340 KB Output is correct
6 Correct 1204 ms 596 KB Output is correct
7 Correct 1249 ms 344 KB Output is correct
8 Correct 1235 ms 344 KB Output is correct
9 Correct 1276 ms 344 KB Output is correct
10 Correct 1214 ms 340 KB Output is correct
11 Correct 1145 ms 344 KB Output is correct
12 Correct 1196 ms 344 KB Output is correct
13 Correct 1251 ms 344 KB Output is correct
14 Correct 1221 ms 344 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 344 KB Output is correct
2 Correct 61 ms 344 KB Output is correct
3 Correct 72 ms 340 KB Output is correct
4 Correct 66 ms 344 KB Output is correct
5 Correct 82 ms 344 KB Output is correct
6 Correct 90 ms 340 KB Output is correct
7 Correct 76 ms 344 KB Output is correct
8 Correct 75 ms 344 KB Output is correct
9 Correct 65 ms 344 KB Output is correct
10 Correct 79 ms 344 KB Output is correct
11 Correct 819 ms 344 KB Output is correct
12 Correct 795 ms 344 KB Output is correct
13 Correct 823 ms 344 KB Output is correct
14 Correct 785 ms 344 KB Output is correct
15 Correct 809 ms 344 KB Output is correct
16 Correct 782 ms 344 KB Output is correct
17 Correct 746 ms 344 KB Output is correct
18 Correct 805 ms 344 KB Output is correct
19 Correct 792 ms 344 KB Output is correct
20 Correct 764 ms 344 KB Output is correct
21 Correct 788 ms 344 KB Output is correct
22 Correct 819 ms 344 KB Output is correct
23 Correct 1100 ms 344 KB Output is correct
24 Correct 994 ms 344 KB Output is correct
25 Correct 1222 ms 344 KB Output is correct
26 Correct 1335 ms 344 KB Output is correct
27 Correct 1195 ms 340 KB Output is correct
28 Correct 1204 ms 596 KB Output is correct
29 Correct 1249 ms 344 KB Output is correct
30 Correct 1235 ms 344 KB Output is correct
31 Correct 1276 ms 344 KB Output is correct
32 Correct 1214 ms 340 KB Output is correct
33 Correct 1145 ms 344 KB Output is correct
34 Correct 1196 ms 344 KB Output is correct
35 Correct 1251 ms 344 KB Output is correct
36 Correct 1221 ms 344 KB Output is correct
37 Correct 1213 ms 344 KB Output is correct
38 Correct 1163 ms 344 KB Output is correct
39 Correct 1219 ms 344 KB Output is correct
40 Correct 1105 ms 344 KB Output is correct
41 Correct 1144 ms 344 KB Output is correct
42 Correct 1043 ms 344 KB Output is correct
43 Correct 1043 ms 344 KB Output is correct
44 Correct 1166 ms 344 KB Output is correct
45 Correct 1200 ms 344 KB Output is correct
46 Correct 1159 ms 344 KB Output is correct
47 Correct 1167 ms 344 KB Output is correct
48 Correct 1173 ms 344 KB Output is correct
49 Correct 1220 ms 344 KB Output is correct
50 Correct 1137 ms 344 KB Output is correct
51 Correct 1153 ms 344 KB Output is correct
52 Correct 1231 ms 344 KB Output is correct