Submission #306907

#TimeUsernameProblemLanguageResultExecution timeMemory
306907giorgikobStations (IOI20_stations)C++14
0 / 100
919 ms1008 KiB
#include "stations.h" #include <vector> #include<bits/stdc++.h> #define ll long long #define ff first #define ss second #define pb push_back using namespace std; const int N = 1e3+5; vector<int>gr[N]; int cnt = 0; int fix[N]; //int c = 0; void dfs(int x, vector<int>&v){ fix[x] = 1; for(auto to : gr[x]){ if(fix[to]) continue; dfs(to,v); } v[x] = cnt; cnt++; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { std::vector<int> labels(n,0); //for(int i = 0; i < n; i ++ ) labels[i] = i; for(int i = 0; i < u.size(); i++){ int x = u[i]; int y = v[i]; gr[x].pb(y); gr[y].pb(x); } /*cnt = 0; for(int i = 0; i < n; i++){ if(gr[i].size() == 1){ dfs(i,labels); break; } } */ dfs(0,labels); //if(labels[0] == 0) dfs(0,labels); //for(auto x : labels) cout << x <<" "; cout << endl; for(int i = 0; i < n; i++) gr[i].clear(), fix[i] = 0; return labels; } int find_next_station(int s, int t, std::vector<int> c) { //if(c.size() == 1) return c[0]; //if(s > t) return c[0]; if(s < t) return c[2]; if(c[0] >= t) return c[0]; return c[1]; }

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:32:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for(int i = 0; i < u.size(); i++){
      |                 ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...