제출 #1332872

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1332872		dusky	Dark Ride (EGOI25_darkride)	C++20	55 / 100	41 ms	840 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int n;

int find(vector<int> space) {
    if (space.size() == 1) return space[0];

    vector<bool> inq(n, 0); int mid = ((space.size()-1)/2);
    for (int i = 0; i <= mid; i++) inq[space[i]] = true;
    printf("? "); for (int i = 0; i < n; i++) printf("%d", inq[i] == true); printf("\n"); fflush(stdout);

    int x; scanf("%d", &x);
    vector<int> nextq;
    if (x%2) for (int i = 0; i <= mid; i++) nextq.push_back(space[i]);
    else for (int i = mid+1; i < space.size(); i++) nextq.push_back(space[i]);
    return find(nextq);
}

int main() {
    // freopen("in.txt", "r", stdin);

    scanf("%d", &n);
    for (int i = 0; i <= 10; i++) {
        printf("? ");
        for (int j = 0; j < n; j++) printf("%d", (bool)(j & (1 << i)));
        printf("\n"); fflush(stdout);

        int x; scanf("%d", &x);
        if (x%2) {
            vector<int> lh, rh;
            for (int j = 0; j < n; j++) {
                if (j & (1 << i)) lh.push_back(j);
                else rh.push_back(j);
            } printf("! %d %d\n", find(lh), find(rh)); fflush(stdout);
            return 0;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int find(std::vector<int>)':
Main.cpp:13:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     int x; scanf("%d", &x);
      |            ~~~~~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:29:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         int x; scanf("%d", &x);
      |                ~~~~~^~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 9 / 9
• Subtask 3: 15 / 15
• Subtask 4: 17 / 17
• Subtask 5: 0 / 16
• Subtask 6: 14 / 14
• Subtask 7: 0 / 29