Submission #433012

#	Time	Username	Problem	Language	Result	Execution time	Memory
433012		cheetose	Stations (IOI20_stations)	C++17	100 / 100	922 ms	760 KiB

stations

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

#include "stations.h"
Vi vv[1000];
Vi labels;
int cc;
void dfs(int N,int p=-1,int d=0){
	if(d==0)labels[N]=cc++;
	for(int next:vv[N]){
		if(next==p)continue;
		dfs(next,N,d^1);
	}
	if(d==1)labels[N]=cc++;
}
Vi label(int n, int k, Vi u, Vi v) {
	fup(i,0,n-1,1)vv[i].clear();
	cc=0;
	labels=Vi(n);
	fup(i,0,n-2,1){
		int x=u[i],y=v[i];
		vv[x].pb(y);
		vv[y].pb(x);
	}
	dfs(0);
	return labels;
}

int find_next_station(int s, int t, Vi c) {
	int N=c.size();
	if(s<c[0]){
		int pr=s;
		fup(i,0,N-2,1){
			if(pr+1<=t && t<=c[i])return c[i];
			pr=c[i];
		}
		return c.back();
	}else{
		int pr=s;
		fdn(i,N-1,1,1){
			if(c[i]<=t && t<=pr-1)return c[i];
			pr=c[i];
		}
		return c[0];
	}
}

Compilation message (stderr)

stations.cpp: In function 'Vi label(int, int, Vi, Vi)':
stations.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
stations.cpp:56:2: note: in expansion of macro 'fup'
   56 |  fup(i,0,n-1,1)vv[i].clear();
      |  ^~~
stations.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
stations.cpp:59:2: note: in expansion of macro 'fup'
   59 |  fup(i,0,n-2,1){
      |  ^~~
stations.cpp: In function 'int find_next_station(int, int, Vi)':
stations.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
stations.cpp:72:3: note: in expansion of macro 'fup'
   72 |   fup(i,0,N-2,1){
      |   ^~~
stations.cpp:11:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
stations.cpp:79:3: note: in expansion of macro 'fdn'
   79 |   fdn(i,N-1,1,1){
      |   ^~~

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