oj.uz

답안 #1058091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058091 2024-08-14T08:23:35 Z Zbyszek99 Circle Passing (EGOI24_circlepassing) C++17
20 / 100
 425 ms 1048580 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));
}

bool* best;
int* right_;
int* left_;

bool* best2;
int* right_2;
int* left_2;

void solve()
{
    cin >> n >> m >> q;
    best = new bool[n];
    right_ = new int[n];
    left_ = new int[n];
    
    best2 = new bool[n];
    right_2 = new int[n];
    left_2 = new int[n];
    
    rep(i,n) best[i] = false;
    rep(i,n) best2[i] = false;
    rep(i,m)
    {
        int a;
        cin >> a;
        best[a] = true;
        best2[a] = true;
    }
    int pop = -1;
    int cur_i = 0;
    rep(i,n*3)
    {
        if(cur_i < n)
        {
            if(best[cur_i]) pop = cur_i;
            left_[cur_i] = pop;
        }
        else
        {
            if(best2[cur_i-n]) pop = cur_i;
            left_2[cur_i-n] = pop;    
        }
        cur_i++;
        if(cur_i == 2*n) cur_i = 0;
    }
    pop = -1;
    cur_i = n-1;
    for(int i = n*3-1; i>=0;i--)
    {
       // cout << cur_i << " " << pop << " right\n";
        if(cur_i < n)
        {
            if(best[cur_i]) pop = cur_i;
            right_[cur_i] = pop;
        }
        else
        {
            if(best2[cur_i-n]) pop = cur_i;
            right_2[cur_i-n] = pop;    
        }
        cur_i--;
        if(cur_i == -1) cur_i = n*2-1;
    }
    rep(i,q)
    {
        int a,b;
        cin >> a >> b;
        if(a > b) swap(a,b);
            int l = 0;
            int r = 0;
            if(a < n)
            {
                l = left_[a];
                r = right_[a]; 
            }
            else
            {
                l = left_2[a-n];
                r = right_2[a-n];
            }
            int m1 = dist(a,b);
            int m2 = left_[a] == -1 ? 1e9 : dist(a,l) + dist((l+n) % (n*2),b)+1;
            int m3 = right_[a] == -1 ? 1e9 : dist(a,r) + dist((r+n) % (n*2),b)+1;
         //   cout << m1 << " " << m2 << " " << m3 << " " << l << " " << r << " 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 3 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 2140 KB Output is correct
6 Runtime error 425 ms 1048580 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 0 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 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 0 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 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct

Subtask #3
0.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 0 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 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 0 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 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 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 0 ms 348 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 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 600 KB Output is correct
37 Runtime error 125 ms 241268 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

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

Subtask #5
0.0 / 27.0

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