oj.uz

답안 #1058032

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058032 2024-08-14T08:03:22 Z Zbyszek99 Circle Passing (EGOI24_circlepassing) C++17
42 / 100
 354 ms 1048576 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int n,m,q;
    
int dist(int a,int b)
{
    return min(abs(a-b),2*n-abs(a-b));
}

void solve()
{
    cin >> n >> m >> q;
    vector<bool> best(n*2,0);
    vector<int> left(n*2);
    vector<int> right(n*2);
    rep(i,m)
    {
        int a;
        cin >> a;
        best[a] = true;
        best[a+n] = true;
    }
    int pop = -1;
    rep(i,n*8)
    {
        if(best[i%(n*2)]) pop = i%(n*2);
        left[i%(n*2)] = pop;
    }
    pop = -1;
    for(int i = n*8-1; i >= 0; i--)
    {
        if(best[i%(n*2)]) pop = i%(n*2);
        right[i%(n*2)] = pop;
    }
    rep(i,q)
    {
        int a,b;
        cin >> a >> b;
        if(a > b) swap(a,b);
            int m1 = dist(a,b);
            int m2 = left[a] == -1 ? 1e9 : dist(a,left[a]) + dist((left[a]+n) % (n*2),b)+1;
            int m3 = right[a] == -1 ? 1e9 : dist(a,right[a]) + dist((right[a]+n) % (n*2),b)+1;
           // cout << m1 << " " << m2 << " " << m3 << " " << left[a] << " " << right[a] << " m\n";
            cout << min(min(m1,m2),m3) << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
 //   cin >> t;
    while(t--) solve();
}

Subtask #1
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2148 KB Output is correct
6 Runtime error 354 ms 1048576 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 460 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 204 ms 107628 KB Output is correct
38 Correct 220 ms 108920 KB Output is correct
39 Correct 174 ms 91556 KB Output is correct
40 Correct 251 ms 132256 KB Output is correct
41 Correct 178 ms 95588 KB Output is correct
42 Correct 293 ms 154540 KB Output is correct
43 Correct 96 ms 50008 KB Output is correct
44 Correct 281 ms 150052 KB Output is correct
45 Correct 318 ms 159472 KB Output is correct
46 Correct 304 ms 159472 KB Output is correct
47 Correct 303 ms 159468 KB Output is correct
48 Correct 306 ms 159320 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct

Subtask #4
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 328 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 8 ms 2148 KB Output is correct
6 Runtime error 354 ms 1048576 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -