oj.uz

답안 #821938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
821938 2023-08-11T23:26:31 Z beaconmc Ancient Machine 2 (JOI23_ancient2) C++17
37 / 100
 113 ms 680 KB 
#include "ancient2.h"


#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)


std::string Solve(int N) {
  vector<int> a(502), b(502);
  a[500] = 500;
  b[500] = 500;
  a[501] = 501;
  b[501] = 501;

  string sus = "";

  FOR(i,0,500){
    FOR(j,0,500){
      if (j==i) a[j] = 500, b[j] = 501;
      else a[j] =j+1, b[j] = j+1;
    }
    ll ans = Query(502, a, b);
    if (ans==500) sus = sus + "0";
    else sus = sus + "1";
  }

  FOR(i,0,500){
    FOR(j,0,500){
      a[j] =j+1, b[j] = j+1;

      if (j==499){
        a[j] = 0, b[j] = 0;
      }

      if (i==j){
        if (sus[j] == '0'){
          b[j] = 501;
        }else{
          a[j] = 501;
        }
      }
    }
    

    ll ans = Query(502, a, b);

    if (ans<500){
      if (sus[i] == '0') sus = sus + "0";
      else sus = sus + "1";
    }else{
      if (sus[i] == '0') sus = sus + "1";
      else sus = sus + "0";
    }
  }


  return sus;



}

Subtask #1
37.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 74 ms 352 KB Output is partially correct
2 Partially correct 71 ms 560 KB Output is partially correct
3 Partially correct 73 ms 312 KB Output is partially correct
4 Partially correct 74 ms 312 KB Output is partially correct
5 Partially correct 77 ms 360 KB Output is partially correct
6 Partially correct 73 ms 372 KB Output is partially correct
7 Partially correct 72 ms 372 KB Output is partially correct
8 Partially correct 74 ms 372 KB Output is partially correct
9 Partially correct 77 ms 440 KB Output is partially correct
10 Partially correct 80 ms 324 KB Output is partially correct
11 Partially correct 75 ms 328 KB Output is partially correct
12 Partially correct 73 ms 312 KB Output is partially correct
13 Partially correct 73 ms 316 KB Output is partially correct
14 Partially correct 91 ms 312 KB Output is partially correct
15 Partially correct 75 ms 316 KB Output is partially correct
16 Partially correct 76 ms 424 KB Output is partially correct
17 Partially correct 76 ms 356 KB Output is partially correct
18 Partially correct 73 ms 308 KB Output is partially correct
19 Partially correct 75 ms 352 KB Output is partially correct
20 Partially correct 87 ms 680 KB Output is partially correct
21 Partially correct 76 ms 364 KB Output is partially correct
22 Partially correct 77 ms 324 KB Output is partially correct
23 Partially correct 79 ms 368 KB Output is partially correct
24 Partially correct 113 ms 308 KB Output is partially correct
25 Partially correct 79 ms 352 KB Output is partially correct
26 Partially correct 75 ms 304 KB Output is partially correct
27 Partially correct 81 ms 368 KB Output is partially correct
28 Partially correct 82 ms 364 KB Output is partially correct
29 Partially correct 73 ms 308 KB Output is partially correct
30 Partially correct 75 ms 548 KB Output is partially correct
31 Partially correct 89 ms 284 KB Output is partially correct
32 Partially correct 72 ms 308 KB Output is partially correct
33 Partially correct 73 ms 472 KB Output is partially correct
34 Partially correct 75 ms 368 KB Output is partially correct
35 Partially correct 78 ms 312 KB Output is partially correct
36 Partially correct 72 ms 304 KB Output is partially correct
37 Partially correct 82 ms 420 KB Output is partially correct
38 Partially correct 75 ms 312 KB Output is partially correct
39 Partially correct 76 ms 328 KB Output is partially correct
40 Partially correct 72 ms 304 KB Output is partially correct
41 Partially correct 73 ms 356 KB Output is partially correct
42 Partially correct 79 ms 316 KB Output is partially correct
43 Partially correct 82 ms 360 KB Output is partially correct
44 Partially correct 74 ms 352 KB Output is partially correct
45 Partially correct 72 ms 432 KB Output is partially correct
46 Partially correct 73 ms 336 KB Output is partially correct
47 Partially correct 78 ms 348 KB Output is partially correct
48 Partially correct 71 ms 304 KB Output is partially correct
49 Partially correct 85 ms 308 KB Output is partially correct
50 Partially correct 72 ms 344 KB Output is partially correct
51 Partially correct 76 ms 308 KB Output is partially correct
52 Partially correct 74 ms 356 KB Output is partially correct
53 Partially correct 81 ms 328 KB Output is partially correct
54 Partially correct 73 ms 292 KB Output is partially correct
55 Partially correct 76 ms 424 KB Output is partially correct
56 Partially correct 75 ms 332 KB Output is partially correct
57 Partially correct 74 ms 328 KB Output is partially correct
58 Partially correct 72 ms 340 KB Output is partially correct
59 Partially correct 84 ms 420 KB Output is partially correct
60 Partially correct 75 ms 300 KB Output is partially correct
61 Partially correct 93 ms 356 KB Output is partially correct
62 Partially correct 81 ms 436 KB Output is partially correct
63 Partially correct 76 ms 288 KB Output is partially correct