# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27860 | suhgyuho_william | Port Facility (JOI17_port_facility) | C++14 | 0 ms | 11788 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>
#define lld long long
#define pii pair<int,int>
#define pll pair<lld,lld>
#define pb push_back
#define next nextt
#define left leftt
#define right rightt
#define Inf 1000000000
#define Linf 1000000000000000000LL
#define Mod 1000000007LL
using namespace std;
int N; lld ans,inv;
struct data{
int x,y;
}a[1000002];
bool check[2000002];
int main(){
scanf("%d",&N); ans = 1;
for(int i=1; i<=N; i++){
scanf("%d %d",&a[i].x,&a[i].y);
a[i+N].x = a[i].y; a[i+N].y = -a[i].y;
ans *= 2; ans %= Mod;
}
sort(a+1,a+N*2+1,[&](data &x,data &y){
if(x.x != y.x) return x.x < y.x;
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... |