Submission #653942

#	Time	Username	Problem	Language	Result	Execution time	Memory
653942		coding_snorlax	Stations (IOI20_stations)	C++14	0 / 100	908 ms	1132 KiB

stations

#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> G[10055];
int vis[10055]={0};
int now_Count=0;
void dfs(int node){
    vis[node]=1;
    int Count=0;
    for(int i:G[node]){
        if(!vis[i]) dfs(i);
    }
    return;
}
void get_graph(vector<int> G1,vector<int> G2){
    for(int i=0;i<(int)G1.size();i++){
        G[G1[i]+1000*now_Count].push_back(G2[i]+1000*now_Count);
        G[G2[i]+1000*now_Count].push_back(G1[i]+1000*now_Count);
    }
    return;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v){
    vector<int> Answer;
    get_graph(u,v);
    for(int i=0;i<n;i++){
        Answer.push_back(i+1000*now_Count);
    }
    now_Count+=1;
    return Answer;
}
//s/1000 is node, s%1000 is connect place
int find_next_station(int s,int t,vector<int> c){
    int stage=(s/1000)*1000;
    for(int i:c){
        for(int j=stage;j<stage+1000;j++){
            vis[j]=0;
        }
        vis[s]=1;
        dfs(i);
        if(vis[t]) return i;
    }
    return 0;
}

Compilation message (stderr)

stations.cpp: In function 'void dfs(int)':
stations.cpp:9:9: warning: unused variable 'Count' [-Wunused-variable]
    9 |     int Count=0;
      |         ^~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61