제출 #1138973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138973		mnbvcxz123	Pictionary (COCI18_pictionary)	C++20	140 / 140	168 ms	19216 KiB

pictionary

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;

#define fi first
#define se second

constexpr int MAXN=1e5+5;
int n,m,q;
vector<int>g[MAXN];
pi que[MAXN];
int ans[MAXN];
int le[MAXN],ri[MAXN];
vector<int>cand[MAXN];

struct dsu{
    int n;
    vector<int>par;
    dsu(){}
    dsu(int n):n(n){
        par.resize(n+5);
        iota(par.begin(),par.end(),0);
    }
    int find(int x){
        if(par[x]==x)return x;
        return par[x]=find(par[x]);
    }
    void join(int a, int b){
        a=find(a);
        b=find(b);
        if(a==b)return;
        par[b]=a;
    }
}d;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>n>>m>>q;
    for(int i=1;i<=q;++i){
        cin>>que[i].fi>>que[i].se;
        le[i]=1,ri[i]=m;
        ans[i]=-1;
    }
    while(1){
        bool ok=0;
        for(int i=1;i<=q;++i)
            if(le[i]<=ri[i]){
                int mid=(le[i]+ri[i])>>1;
                cand[mid].push_back(i);
                ok=1;
            }
        if(!ok)break;
        d=dsu(n+m);
        for(int mid=1;mid<=m;++mid){
            int x=m-mid+1;
            for(int j=x;j<=n;j+=x)
                d.join(j,x+n);
            for(const int&i:cand[mid]){
                bool flag=d.find(que[i].fi)==d.find(que[i].se);
                if(flag){
                    ans[i]=mid;
                    ri[i]=mid-1;
                }else le[i]=mid+1;
            }
            cand[mid].clear();
        }
    }
    for(int i=1;i<=q;++i)
        cout<<ans[i]<<'\n';
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14