#include <vector>
#include <iostream>
using namespace std;
template <typename T> void print(T elem) {cout << elem << " ";}
template <typename T> void print(vector<T> &v) {for(auto elem: v) print(elem); cout << endl;}
template <typename T> void print(vector<vector<T>> &v) {for(auto elem: v) print(elem); cout << endl;}
void makeG(vector<vector<int>> &g, vector<int> &u, vector<int> &v) {
for(int i=0; i<u.size(); i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
}
int decideSubtaskLabel(int n, int k, vector<vector<int>> &g, vector<int> &u, vector<int> &v) {
int subtask = 0, cnt = 0;
bool subtask2 = true;
for(int i=0; i<n; i++) {
if (g[i].size()>2) cnt++;
if (!(u[i]==i+1 && v[i]==i/2 || u[i]==i/2 && v[i]==i+1)) subtask2= false;
}
if (cnt==0) return 1;
if (subtask2) return 2;
if (cnt==1) return 3;
}
void dfs1(int cnt, int node, vector<vector<int>> &g, vector<int> &labels) {
for(int elem: g[node])
if (labels[elem]==-1) {labels[elem] = cnt++; dfs1(cnt,elem,g,labels);}
return;
}
void subtask1Label(int n, vector<vector<int>> &g, vector<int> &labels) {
int node = 0;
for(int i=0; i<n; i++)
if(g[i].size()==1) { dfs1(0,node,g,labels); return; }
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<vector<int>> g(n);
makeG(g,u,v);
// print(g);
int subtask = decideSubtaskLabel(n,k,g,u,v);
vector<int> labels(n,-1);
switch(subtask) {
case 1: subtask1Label(n,g,labels); return labels;
// case 2:
// case 3:
}
}
int decideSubtaskFind(int s, int t, vector<int> &c) {
return 1;
}
int subtask1Find(int s, int t, vector<int> &c) {
if (c.size()==1) return c[0];
else return t<s? c[0]:c[1];
}
int find_next_station(int s, int t, std::vector<int> c) {
int subtask = decideSubtaskFind(s,t,c);
switch(subtask) {
case 1: return subtask1Find(s,t,c);
}
return c[0];
}
Compilation message
stations.cpp: In function 'void makeG(std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&)':
stations.cpp:10:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
10 | for(int i=0; i<u.size(); i++) {
| ~^~~~~~~~~
stations.cpp: In function 'int decideSubtaskLabel(int, int, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&)':
stations.cpp:20:19: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
20 | if (!(u[i]==i+1 && v[i]==i/2 || u[i]==i/2 && v[i]==i+1)) subtask2= false;
stations.cpp:16:6: warning: unused variable 'subtask' [-Wunused-variable]
16 | int subtask = 0, cnt = 0;
| ^~~~~~~
stations.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
25 | }
| ^
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:37:25: warning: control reaches end of non-void function [-Wreturn-type]
37 | vector<vector<int>> g(n);
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
344 KB |
Invalid labels (duplicates values). scenario=2, label=152 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
2 ms |
600 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
344 KB |
Invalid labels (duplicates values). scenario=1, label=67 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
626 ms |
684 KB |
Output is correct |
| 2 |
Incorrect |
473 ms |
684 KB |
Wrong query response. |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
344 KB |
Invalid labels (duplicates values). scenario=1, label=174 |
| 2 |
Halted |
0 ms |
0 KB |
- |
