Submission #32569556
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;
int main(){
ll n;
cin >> n;
vector<ll> l(n);
vector<ll> r(n);
vector<ll> p(2e5+1,0);
REP(i,n){
cin >> l[i]>>r[i];
}
REP(i,n){
if(p[l[i]]==2){
p[l[i]]=0;
}else if(p[l[i]]==1){
p[l[i]]=3;
}else{
p[l[i]]=1;
}
if(p[r[i]]==1){
p[r[i]]=0;
}else if(p[r[i]]==2){
p[r[i]]=4;
}else{
p[r[i]]=2;
}
}
ll nn=0;
REP1(i,2e5){
ll st,gl;
if(p[i]==1){
if(nn==0){
st = i;
}
nn++;
}
if(p[i]==2){
nn--;
if(nn==0){
gl = i;
cout << st << " " << gl << endl;
}
}
if(p[i]==3){
if(nn==0){
st = i;
}
nn+=2;
}
if(p[i]==4){
nn-=2;
if(nn==0){
gl = i;
cout << st << " " << gl << endl;
}
}
}
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - Union of Interval |
| User | takkey |
| Language | C++ (GCC 9.2.1) |
| Score | 0 |
| Code Size | 1412 Byte |
| Status | WA |
| Exec Time | 123 ms |
| Memory | 7952 KiB |
Judge Result
| Set Name | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 400 | ||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt |
| All | random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, sample_01.txt, sample_02.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| random_01.txt | WA | 90 ms | 7788 KiB |
| random_02.txt | WA | 28 ms | 5492 KiB |
| random_03.txt | WA | 89 ms | 7720 KiB |
| random_04.txt | WA | 84 ms | 7512 KiB |
| random_05.txt | WA | 91 ms | 7812 KiB |
| random_06.txt | WA | 88 ms | 7532 KiB |
| random_07.txt | WA | 92 ms | 7952 KiB |
| random_08.txt | WA | 47 ms | 5964 KiB |
| random_09.txt | WA | 89 ms | 7744 KiB |
| random_10.txt | WA | 83 ms | 7260 KiB |
| random_11.txt | WA | 77 ms | 7952 KiB |
| random_12.txt | AC | 4 ms | 4664 KiB |
| random_13.txt | AC | 89 ms | 6224 KiB |
| random_14.txt | AC | 72 ms | 6140 KiB |
| random_15.txt | AC | 71 ms | 5368 KiB |
| random_16.txt | AC | 93 ms | 7952 KiB |
| random_17.txt | AC | 92 ms | 7732 KiB |
| random_18.txt | AC | 52 ms | 6200 KiB |
| random_19.txt | AC | 90 ms | 7784 KiB |
| random_20.txt | AC | 51 ms | 6224 KiB |
| random_21.txt | AC | 123 ms | 5576 KiB |
| random_22.txt | AC | 88 ms | 5148 KiB |
| sample_01.txt | AC | 7 ms | 4608 KiB |
| sample_02.txt | AC | 3 ms | 4732 KiB |