# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174835 | khanhphucscratch | Stations (IOI20_stations) | C++20 | 2 ms | 552 KiB |
#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
//Subtask 1
vector<int> ad[1005];
int deg[1005], tin[1005], tout[1005], dfsc = 0;
bool visited[1005];
int decode(int x, int y)
{
x--; y--;
//x >= y
int ans = x*(x+1)/2;
return ans + y;
}
pair<int, int> encode(int x)
{
int p = 0;
while(p*(p+1)/2 <= x) p++;
p--;
return {p+1, x - p*(p+1)/2+1};
}
void dfs(int u)
{
visited[u] = 1; tin[u] = dfsc;
bool befchild = 0;
for(int v : ad[u]) if(visited[v] == 0){
dfs(v);
if(befchild == 1) dfsc++;
befchild = 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |