제출 #673270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673270		vjudge1	Stations (IOI20_stations)	C++17	0 / 100	3062 ms	2097152 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
#define ll long long
#define endl '\n'
#define all(a) a.begin(),a.end()
const int mod = 1e7 + 7;
const int N = 1003;

vector<int> node[N];
int col[N];
int t;
void dfs(int i, int p, bool cur){
    if (cur) col[i]=t++;
    for (auto it : node[i]){
        if (it==p) continue;
        dfs(it,i,cur^1);
    }
    if (!cur) col[i]=t++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
    for (int i=0;i<u.size();i++){
        node[u[i]].push_back(v[i]);
        node[v[i]].push_back(u[i]);
    }
    dfs(0,-1,0);
    for (int i=0;i<n;i++){
        labels[i]=col[i];
    }
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    int flag = 1;// 1 im the max, 0 am the min
    int mx = 0;
    int mn = 1e8;
    for (auto it : c){
        if (it < s) flag = 0;
        mx = max(mx,it);
        mn = min(mn,it);
    }
    if (flag){
        for (int i=c.size()-1;i>=1;i--){
            if (c[i] <= t) return c[i];
        }
        return c[0];
    }
    else {
        // am the smallest 
        for (int i=0;i<c.size()-1;i++){
            if (c[i] >= t) return c[i];
        }
        return c.back();
    }
}

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

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i=0;i<u.size();i++){
      |                  ~^~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for (int i=0;i<c.size()-1;i++){
      |                      ~^~~~~~~~~~~

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