제출 #869688

#제출 시각아이디문제언어결과실행 시간메모리
869688andrewp기지국 (IOI20_stations)C++14
0 / 100
3042 ms2097152 KiB
//Dedicated to my love,ivaziva #include<bits/stdc++.h> #include "stations.h" using namespace std; #define ll long long #define pb push_back const int maxn=1050; const int mx=1000; const int mod=998244353; vector<int> es[maxn]; //ivice int tin[maxn],tout[maxn]; int vu=0,vi=0;//vreme ulaza, vreme izlaza void dfs(int u,int par){ tin[u]=vu;vu++; for(auto e:es[u]){ if(e!=par){ dfs(e,u); } } tout[u]=vi;vi++; } vector<int> label(int n,int k,vector<int> u,vector<int> v){ vector<int> kodiraj(n,0); for(int i=0;i<v.size();i++){ es[u[i]].pb(v[i]); es[v[i]].pb(u[i]); } dfs(0,-1); for(int i=0;i<n;i++){ kodiraj[i]=tin[i]*mx+tout[i];//tout[i]<=1k } return kodiraj; } int find_next_station(int s,int e,vector<int> c){ if(((e/mx)<(s/mx))||((e%mx)>(s%mx))){ for(auto p:c){ if((p/mx)<=(s/mx)) return p; } } for(auto p:c){ int x=p/mx,y=p%mx; if((x>s/mx)&&x<=(e/mx)&&y>=(e%mx)) return p; } return -1; } // void sol(){ // } // int main(){ // int T=1; // // scanf("%d",&T); // while(T--){ // sol(); // } // return 0; // }

컴파일 시 표준 에러 (stderr) 메시지

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=0;i<v.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...