제출 #1199431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1199431		TahirAliyev	열대 식물원 (Tropical Garden) (IOI11_garden)	C++20	0 / 100	10 ms	22848 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define all(v) v.begin(), v.end()

const int MAX = 3e5 + 5;
int n, m, p, q;
vector<pii> g[MAX];
vector<int> ids[MAX];
int nxt[MAX];
int id;
vector<int> G[MAX];
int vis[MAX], cyc[MAX];
int H[MAX][2], sz[2];

void dfs(int node, int h, int md, int t){
    vis[node] = 1;
    if(node < n) H[h % md][t]++;
    for(int to : G[node]){
        if(vis[to]) continue;
        dfs(to, h + 1, md, t);
    }
}

void count_routes(int N, int M, int P, int R[][2], int Q, int QQ[]){
    n = N, m = M, p = P, q = Q;
    for(int i = 0; i < M; i++){
        g[R[i][0]].push_back({i, R[i][1]});
        g[R[i][1]].push_back({i, R[i][0]});
    }
    for(int i = 0; i < n; i++) sort(all(g[i]));
    for(int i = 0; i < 2 * n; i++) nxt[i] = -1;
    for(int i = 0; i < n; i++){
        int j = g[i][0].second;
        if(g[j][0].second == i){
            nxt[i] = j + n;
            if(g[i].size() > 1) nxt[i + n] = g[i][1].second;
            else nxt[i + n] = j + n;
        }
        else nxt[i] = j;
    }
    for(int i = 0; i < 2 * n; i++){
        if(vis[i] || nxt[i] == -1) continue;
        int a = i;
        while(!vis[a]){
            vis[a] = i + 1;
            a = nxt[a];
        }
        if(vis[a] != i + 1) continue;
        int b = nxt[a];
        cyc[a] = 1;
        while(b != a){
            cyc[b] = 1;
            b = nxt[b];
        }
    }
    for(int i = 0; i < 2 * n; i++){
        // cout << i << ' ' << nxt[i] << endl;
        if(nxt[i] != -1) G[nxt[i]].push_back(i);
    }
    if(!cyc[P]){
        sz[0] = 1e9;
        if(nxt[P] != -1) dfs(P, 0, 1e9, 0);
    } 
    else{
        int a = nxt[P];
        sz[0] = 1;
        while(a != P){
            sz[0]++;
            a = nxt[a];
        } 
        fill(vis, vis + MAX, 0);    
        dfs(P, 0, sz[0], 0);
    } 
    if(!cyc[P+n]){
        sz[1] = 1e9;
        if(nxt[P+n] != -1) dfs(P+n, 0, 1e9, 1);
    } 
    else{
        int a = nxt[P+n];
        sz[1] = 1;
        while(a != P+n){
            sz[1]++;
            a = nxt[a];
        } 
        fill(vis, vis + MAX, 0);
        dfs(P+n, 0, sz[1], 1);
    } 
    for(int z = 0; z < Q; z++){
        int k = QQ[z];
        answer(((k%sz[0]<MAX)?H[k%sz[0]][0]:0) + ((k%sz[1]<MAX)?H[k%sz[1]][1]:0));
    }
}

• Subtask 1: 0 / 49
• Subtask 2: 0 / 20
• Subtask 3: 0 / 31