제출 #1093702

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093702		kem	Circle Passing (EGOI24_circlepassing)	C++14	100 / 100	74 ms	9816 KiB

Main

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

#define NAME "name"

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define endl "\n"

#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

const int LIM = 2e5 + 3;
const int INF = 1e9;
const int mod = 1e9 + 7;

int n, m, q;
vector<int> num;

int dist(int x, int y)
{
    return min((x - y + (2 * n)) % (2 * n), (y - x + (2 * n)) % (2 * n));
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if (ifstream(NAME ".inp"))
    {
        freopen(NAME ".inp", "r", stdin);
        freopen(NAME ".out", "w", stdout);
    }

    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++)
    {
        int x;
        cin >> x;
        num.pb(x);
        num.pb(x + n);
    }
    sort(all(num));
    num.erase(unique(all(num)), num.end());
    while (q--)
    {
        int x, y;
        cin >> x >> y;
        int pos1 = (lower_bound(all(num), x) - num.begin()) % sz(num), pos2 = (pos1 - 1 + sz(num)) % sz(num);
        cout << min(dist(x, y), min(dist(x, num[pos1]) + 1 + dist(num[pos1] + n * ((num[pos1] >= n) ? -1 : 1), y),
                                    dist(x, num[pos2]) + 1 + dist(num[pos2] + n * ((num[pos2] >= n) ? -1 : 1), y)))
             << endl;
    }

    return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(NAME ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen(NAME ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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