oj.uz

답안 #1058121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058121 2024-08-14T08:36:16 Z Zbyszek99 Circle Passing (EGOI24_circlepassing) C++17
31 / 100
 213 ms 47444 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;
    set<int> good;
    rep(i,m)
    {
        int a;
        cin >> a;
        good.insert(a);
        good.insert(a+n);
    }
    rep(i,q)
    {
        int a,b;
        cin >> a >> b;
        if(a > b) swap(a,b);
        int l = -1;
        int r = -1;
        auto it1 = good.upper_bound(a);
        if(it1 != good.begin())
        {
            l = (*it1)%(n*2);
        }
        else
        {
            it1 = good.end();
            it1--;
            l = (*it1)%(n*2);    
        }
        it1 = good.lower_bound(a);
        if(it1 != good.end())
        {
            r = (*it1)%(n*2);
        }
        else
        {
            it1 = good.begin();
            r = (*it1)%(n*2);    
        }
        int m1 = dist(a,b);
        int m2 = dist(a,l) + dist((l+n) % (n*2),b)+1;
        int m3 = 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
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 136 ms 33364 KB Output is correct
4 Correct 33 ms 8028 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 420 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 664 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 4 ms 1116 KB Output is correct
15 Correct 76 ms 20052 KB Output is correct
16 Correct 74 ms 19160 KB Output is correct
17 Correct 189 ms 47440 KB Output is correct
18 Correct 213 ms 47444 KB Output is correct
19 Correct 0 ms 344 KB Output is correct

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 476 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -