제출 #752750

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
752750		mariaclara	Pictionary (COCI18_pictionary)	C++17	140 / 140	245 ms	3308 KiB

pictionary

#include<bits/stdc++.h>
 
using namespace std;
 
const int MAXN = 1e5+10;
typedef pair<int,int> pii;
#define mk make_pair
#define pb push_back
#define f first
#define s second
 
int n, m, q, day, t[MAXN], pai[MAXN], sz[MAXN], comp;
 
int find(int x) {
    if(pai[x]==x) return x;
    return find(pai[x]);
}
 
void merge(int x, int y, int Time) {
    x = find(x);
    y = find(y);
    if(x==y) return;
    if(sz[x]>sz[y]) swap(x,y);
    pai[x] = y;
    t[x] = Time;
    sz[y] += sz[x];
}
int main() {
    cin >> n >> m >> q;
 
    for(int i = 1; i <= n; i++)
        pai[i] = i, sz[i] = 1, t[i] = 1e9;
    
    while(m--) {
        day++;
        for(int i = 2*m+2; i <= n; i+=m+1)
            merge(m+1, i, day);
    }

    while(q--) {
        int a, b, resp = 0;
        cin >> a >> b;
        while(a!=b) {
            if(t[a]<t[b]) resp = t[a], a = pai[a];
            else resp = t[b], b = pai[b];
        }
        cout << resp <<"\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