| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1062304 | nightfal | Stations (IOI20_stations) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 cnt = 0;
for(int i=0; i<n; i++)
if (g[i].size()>2) cnt++;
if (cnt==0) return 1;
bool subtask2 = true;
for(int i=0; i<u.size(); i++)
if (!(u[i]==i+1 && v[i]==i/2 || u[i]==i/2 && v[i]==i+1)) subtask2= false;
if (subtask2) return 2;
if (cnt==1) return 3;
}
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) node=i;
labelLine(0,node,g,labels);
// int cnt = 0;
// while(labels[node]==-1) {
// labels[node] = cnt++;
// for(int elem: g[node])
// if(labels[elem]==-1) node = elem;
// }
return;
}
void subtask2Label(int n, vector<int> &labels) {
for(int i=0; i<n; i++)
labels[i] = i+1;
return;
}
void labelLine(int cnt, int node, vector<vector<int>> &g, vector<int> &labels) {
while(labels[node]==-1) {
labels[node] = cnt++;
for(int elem: g[node])
if (labels[elem]==-1) node = elem;
}
return;
}
void subtask3Label(int n, int k, vector<vector<int>> &g, vector<int> &labels) {
int root = 0;
for(int i=0; i<n; i++)
if(g[i].size() > 2) {root = i; break;}
labels[root] = 1'000;
for(int i=0; i<g[i].size(); i++)
labelLine((i+1)*1'000+1,i,g,labels);
}
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: subtask2Label(n,labels); return labels;
case 3: subtask3Label(n,k,g,labels); return labels;
}
}
int decideSubtaskFind(int s, int t, vector<int> &c) {
if (s >= 1'000 && t >= 1'000) return 3;
for(int i=0; i<c.size(); i++)
if (c[i] < s-1 || c[i] > s+1) return 2;
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];
}
bool ancestor(int a, int b) {
if (a==0) return true;
while(b!=0) { if(a==b) return true; else b >>= 1; }
return false;
}
int subtask2Find(int s, int t, vector<int> &c) {
for(int i=c.size()-1; i>=0; i--)
if(ancestor(c[i],t)) return c[i];
return c[0];
}
int subtask3Find(int s, int t, vector<int> &c) {
if (s==1'000) {
for(int elem: c)
if(t/1000==elem/1000) return elem;
}
else if (s/1000 == t/1000) {
if(s < t) {
for(int elem: c)
if(elem > s) return elem;
}
else {
for(int elem: c)
if(elem < s) return elem;
}
}
else {
for(int elem: c)
if(elem < s) return elem;
}
}
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);
case 2: return subtask2Find(s,t,c);
case 3: return subtask3Find(s,t,c);
}
return c[0];
}