제출 #1239228

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239228		Jer	Circle Passing (EGOI24_circlepassing)	C++20	0 / 100	1828 ms	1114112 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int n, m, q;

unordered_map<int, int> d;
unordered_map<int, int> con;

void find()
{
    unordered_set<int> vis;
    queue<int> q;
    q.push(0);

    int l = 0;
    while (!q.empty())
    {
        int len = q.size();
        for (int x = 0; x < len; x++)
        {
            int curr = q.front();
            q.pop();

            if (vis.find(curr) != vis.end())
                continue;
            vis.insert(curr);

            d[curr] = l;

            if (curr > 0)
                q.push(curr - 1);
            if (curr < 2 * n - 1)
                q.push(curr + 1);
            if (curr == 0)
                q.push(2 * n - 1);
            if (curr == 2 * n - 1)
                q.push(0);
            if (con[curr] != 0)
                q.push(con[curr] - 1);
        }
        l++;
    }
}

int main()
{
    scanf("%d%d%d", &n, &m, &q);

    int k;
    for (int i = 0; i < m; i++)
        scanf("%d", &k), con[k] = n + k + 1, con[n + k] = k + 1;

    find();

    int a, b;
    while (q--)
    {
        scanf("%d%d", &a, &b);
        printf("%d\n", d[b]);
    }

    return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d%d%d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         scanf("%d", &k), con[k] = n + k + 1, con[n + k] = k + 1;
      |         ~~~~~^~~~~~~~~~
Main.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         scanf("%d%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 20
• Subtask 3: 0 / 22
• Subtask 4: 0 / 17
• Subtask 5: 0 / 27