# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42566 | nonocut | Adriatic (CEOI13_adriatic) | C++14 | 2080 ms | 262144 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;
const int maxv = 2500;
const int maxn = 2.5e5 + 5;
struct node {
int x,y,id;
};
int n;
node p[maxn];
vector<int> pos[maxv+5];
vector<int> way[maxn];
bool cmp(node a, node b) {
if(a.x!=b.x) return a.x<b.x;
return a.y>b.y;
}
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d%d",&p[i].x,&p[i].y), p[i].id = i;
sort(&p[1],&p[n+1],cmp);
for(int i=1;i<=n;i++) {
for(int y=1;y<p[i].y;y++) {
for(auto x : pos[y]) {
way[p[i].id].push_back(x);
way[x].push_back(p[i].id);
}
}
pos[p[i].y].push_back(p[i].id);
}
//for(int x=1;x<=n;x++) {
// for(auto y : way[x]) printf("%d -> %d\n",x,y);
//}
}
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... |