Submission #1058008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058008		Zbyszek99	Circle Passing (EGOI24_circlepassing)	C++17	0 / 100	426 ms	1048580 KiB

Main

#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,b)+1;
            int m3 = right[a] == -1 ? 1e9 : dist(a,right[a]) + dist(right[a]+n,b)+1;
           // cout << m1 << " " << m2 << " " << m3 << " 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 / 14
• Subtask 2: 0 / 20
• Subtask 3: 0 / 22
• Subtask 4: 0 / 17
• Subtask 5: 0 / 27