# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342725 | ogibogi2004 | Trampoline (info1cup20_trampoline) | C++14 | 1996 ms | 78748 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<bits/stdc++.h>
using namespace std;
#define x1 sdfds
#define y1 sdfdfds
#define x2 sdffdsds
#define y2 sdfdds
const int MAXN=2e5+6;
struct trampoline
{
int x,y;
bool operator<(trampoline const& other)const
{
return make_pair(x,y)<make_pair(other.x,other.y);
}
};
set<int>xs;
int n,m,k;
vector<trampoline>tr;
map<int,int> newx;
vector<int>xs1;
set<int>ys[MAXN];
vector<int>g[MAXN];
int dp[MAXN][18];
map<pair<int,int>,int> no;
bool vis[MAXN];
int not_root[MAXN];
void dfs(int u,int par)
{
dp[u][0]=par;
vis[u]=1;
Compilation message (stderr)
# | 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... |