oj.uz

답안 #371478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
371478 2021-02-26T17:08:05 Z nikolapesic2802 Port Facility (JOI17_port_facility) C++14
100 / 100
 1706 ms 85552 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
const int N=2e6+5,mod=1e9+7;
vector<int> par(N);
int find(int tr)
{
    if(par[tr]==tr)
        return tr;
    return par[tr]=find(par[tr]);
}
void merge(int a,int b)
{
    par[find(a)]=find(b);
}
int powmod(int k,int x=2)
{
    int ans=1;
    for(;k;k>>=1,x=(ll)x*x%mod)
        if(k&1)
            ans=(ll)ans*x%mod;
    return ans;
}
int main()
{
    for(int i=0;i<N;i++)
        par[i]=i;
    int n;
	scanf("%i",&n);
	vector<pair<int,int> > niz(n);
	for(int i=0;i<n;i++)
        scanf("%i %i",&niz[i].f,&niz[i].s);
    sort(all(niz));
    set<pair<int,int> > ok;
    for(int i=0;i<n;i++)
    {
        while(ok.size()&&(*ok.begin()).f<niz[i].f)
            ok.erase(ok.begin());
        auto it=ok.upper_bound({niz[i].s,n});
        if(it!=ok.begin())
            for(it--;;it--)
            {
                merge(i,(*it).s+n),merge(i+n,(*it).s);
                if(find(i)==find((*ok.begin()).s+n))
                    break;
                if(it==ok.begin())
                    break;
            }
        ok.insert({niz[i].s,i});
    }
    for(int i=0;i<n;i++)
        if(find(i)==find(i+n))
        {
            printf("0\n");
            return 0;
        }
    int ans=0;
    for(int i=0;i<2*n;i++)
        if(find(i)==i)
            ans++;
    printf("%i\n",powmod(ans/2));
    return 0;
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  scanf("%i",&n);
      |  ~~~~~^~~~~~~~~
port_facility.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |         scanf("%i %i",&niz[i].f,&niz[i].s);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8172 KB Output is correct
2 Correct 7 ms 8172 KB Output is correct
3 Correct 7 ms 8172 KB Output is correct
4 Correct 7 ms 8172 KB Output is correct
5 Correct 6 ms 8172 KB Output is correct
6 Correct 7 ms 8172 KB Output is correct
7 Correct 7 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 9 ms 8172 KB Output is correct
10 Correct 7 ms 8172 KB Output is correct
11 Correct 7 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 7 ms 8172 KB Output is correct
14 Correct 9 ms 8172 KB Output is correct
15 Correct 8 ms 8172 KB Output is correct
16 Correct 7 ms 8172 KB Output is correct
17 Correct 7 ms 8172 KB Output is correct
18 Correct 7 ms 8172 KB Output is correct
19 Correct 6 ms 8172 KB Output is correct
20 Correct 6 ms 8172 KB Output is correct
21 Correct 7 ms 8172 KB Output is correct
22 Correct 9 ms 8172 KB Output is correct
23 Correct 7 ms 8172 KB Output is correct
24 Correct 6 ms 8172 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8172 KB Output is correct
2 Correct 7 ms 8172 KB Output is correct
3 Correct 7 ms 8172 KB Output is correct
4 Correct 7 ms 8172 KB Output is correct
5 Correct 6 ms 8172 KB Output is correct
6 Correct 7 ms 8172 KB Output is correct
7 Correct 7 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 9 ms 8172 KB Output is correct
10 Correct 7 ms 8172 KB Output is correct
11 Correct 7 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 7 ms 8172 KB Output is correct
14 Correct 9 ms 8172 KB Output is correct
15 Correct 8 ms 8172 KB Output is correct
16 Correct 7 ms 8172 KB Output is correct
17 Correct 7 ms 8172 KB Output is correct
18 Correct 7 ms 8172 KB Output is correct
19 Correct 6 ms 8172 KB Output is correct
20 Correct 6 ms 8172 KB Output is correct
21 Correct 7 ms 8172 KB Output is correct
22 Correct 9 ms 8172 KB Output is correct
23 Correct 7 ms 8172 KB Output is correct
24 Correct 6 ms 8172 KB Output is correct
25 Correct 8 ms 8172 KB Output is correct
26 Correct 10 ms 8172 KB Output is correct
27 Correct 8 ms 8172 KB Output is correct
28 Correct 8 ms 8172 KB Output is correct
29 Correct 8 ms 8172 KB Output is correct
30 Correct 9 ms 8172 KB Output is correct
31 Correct 8 ms 8172 KB Output is correct
32 Correct 8 ms 8172 KB Output is correct
33 Correct 8 ms 8172 KB Output is correct
34 Correct 8 ms 8172 KB Output is correct
35 Correct 7 ms 8172 KB Output is correct
36 Correct 8 ms 8300 KB Output is correct
37 Correct 8 ms 8300 KB Output is correct
38 Correct 7 ms 8192 KB Output is correct
39 Correct 7 ms 8192 KB Output is correct
40 Correct 8 ms 8172 KB Output is correct
41 Correct 8 ms 8300 KB Output is correct
42 Correct 10 ms 8448 KB Output is correct
43 Correct 9 ms 8172 KB Output is correct
44 Correct 7 ms 8172 KB Output is correct

Subtask #3
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8172 KB Output is correct
2 Correct 7 ms 8172 KB Output is correct
3 Correct 7 ms 8172 KB Output is correct
4 Correct 7 ms 8172 KB Output is correct
5 Correct 6 ms 8172 KB Output is correct
6 Correct 7 ms 8172 KB Output is correct
7 Correct 7 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 9 ms 8172 KB Output is correct
10 Correct 7 ms 8172 KB Output is correct
11 Correct 7 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 7 ms 8172 KB Output is correct
14 Correct 9 ms 8172 KB Output is correct
15 Correct 8 ms 8172 KB Output is correct
16 Correct 7 ms 8172 KB Output is correct
17 Correct 7 ms 8172 KB Output is correct
18 Correct 7 ms 8172 KB Output is correct
19 Correct 6 ms 8172 KB Output is correct
20 Correct 6 ms 8172 KB Output is correct
21 Correct 7 ms 8172 KB Output is correct
22 Correct 9 ms 8172 KB Output is correct
23 Correct 7 ms 8172 KB Output is correct
24 Correct 6 ms 8172 KB Output is correct
25 Correct 8 ms 8172 KB Output is correct
26 Correct 10 ms 8172 KB Output is correct
27 Correct 8 ms 8172 KB Output is correct
28 Correct 8 ms 8172 KB Output is correct
29 Correct 8 ms 8172 KB Output is correct
30 Correct 9 ms 8172 KB Output is correct
31 Correct 8 ms 8172 KB Output is correct
32 Correct 8 ms 8172 KB Output is correct
33 Correct 8 ms 8172 KB Output is correct
34 Correct 8 ms 8172 KB Output is correct
35 Correct 7 ms 8172 KB Output is correct
36 Correct 8 ms 8300 KB Output is correct
37 Correct 8 ms 8300 KB Output is correct
38 Correct 7 ms 8192 KB Output is correct
39 Correct 7 ms 8192 KB Output is correct
40 Correct 8 ms 8172 KB Output is correct
41 Correct 8 ms 8300 KB Output is correct
42 Correct 10 ms 8448 KB Output is correct
43 Correct 9 ms 8172 KB Output is correct
44 Correct 7 ms 8172 KB Output is correct
45 Correct 107 ms 11244 KB Output is correct
46 Correct 179 ms 11172 KB Output is correct
47 Correct 85 ms 11244 KB Output is correct
48 Correct 175 ms 11292 KB Output is correct
49 Correct 117 ms 11244 KB Output is correct
50 Correct 173 ms 11244 KB Output is correct
51 Correct 101 ms 11244 KB Output is correct
52 Correct 44 ms 9068 KB Output is correct
53 Correct 67 ms 13676 KB Output is correct
54 Correct 90 ms 13676 KB Output is correct
55 Correct 79 ms 12524 KB Output is correct
56 Correct 77 ms 12524 KB Output is correct
57 Correct 47 ms 10220 KB Output is correct
58 Correct 46 ms 10220 KB Output is correct
59 Correct 57 ms 11756 KB Output is correct
60 Correct 68 ms 11884 KB Output is correct
61 Correct 68 ms 11756 KB Output is correct
62 Correct 63 ms 11884 KB Output is correct
63 Correct 59 ms 11756 KB Output is correct
64 Correct 66 ms 11756 KB Output is correct
65 Correct 92 ms 12652 KB Output is correct
66 Correct 123 ms 12524 KB Output is correct
67 Correct 79 ms 13292 KB Output is correct
68 Correct 78 ms 13292 KB Output is correct
69 Correct 72 ms 13932 KB Output is correct
70 Correct 71 ms 13932 KB Output is correct
71 Correct 87 ms 15724 KB Output is correct
72 Correct 78 ms 15724 KB Output is correct
73 Correct 76 ms 15468 KB Output is correct
74 Correct 75 ms 15340 KB Output is correct
75 Correct 49 ms 10220 KB Output is correct
76 Correct 52 ms 10220 KB Output is correct
77 Correct 52 ms 10380 KB Output is correct
78 Correct 185 ms 12524 KB Output is correct
79 Correct 115 ms 12524 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8172 KB Output is correct
2 Correct 7 ms 8172 KB Output is correct
3 Correct 7 ms 8172 KB Output is correct
4 Correct 7 ms 8172 KB Output is correct
5 Correct 6 ms 8172 KB Output is correct
6 Correct 7 ms 8172 KB Output is correct
7 Correct 7 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 9 ms 8172 KB Output is correct
10 Correct 7 ms 8172 KB Output is correct
11 Correct 7 ms 8172 KB Output is correct
12 Correct 8 ms 8172 KB Output is correct
13 Correct 7 ms 8172 KB Output is correct
14 Correct 9 ms 8172 KB Output is correct
15 Correct 8 ms 8172 KB Output is correct
16 Correct 7 ms 8172 KB Output is correct
17 Correct 7 ms 8172 KB Output is correct
18 Correct 7 ms 8172 KB Output is correct
19 Correct 6 ms 8172 KB Output is correct
20 Correct 6 ms 8172 KB Output is correct
21 Correct 7 ms 8172 KB Output is correct
22 Correct 9 ms 8172 KB Output is correct
23 Correct 7 ms 8172 KB Output is correct
24 Correct 6 ms 8172 KB Output is correct
25 Correct 8 ms 8172 KB Output is correct
26 Correct 10 ms 8172 KB Output is correct
27 Correct 8 ms 8172 KB Output is correct
28 Correct 8 ms 8172 KB Output is correct
29 Correct 8 ms 8172 KB Output is correct
30 Correct 9 ms 8172 KB Output is correct
31 Correct 8 ms 8172 KB Output is correct
32 Correct 8 ms 8172 KB Output is correct
33 Correct 8 ms 8172 KB Output is correct
34 Correct 8 ms 8172 KB Output is correct
35 Correct 7 ms 8172 KB Output is correct
36 Correct 8 ms 8300 KB Output is correct
37 Correct 8 ms 8300 KB Output is correct
38 Correct 7 ms 8192 KB Output is correct
39 Correct 7 ms 8192 KB Output is correct
40 Correct 8 ms 8172 KB Output is correct
41 Correct 8 ms 8300 KB Output is correct
42 Correct 10 ms 8448 KB Output is correct
43 Correct 9 ms 8172 KB Output is correct
44 Correct 7 ms 8172 KB Output is correct
45 Correct 107 ms 11244 KB Output is correct
46 Correct 179 ms 11172 KB Output is correct
47 Correct 85 ms 11244 KB Output is correct
48 Correct 175 ms 11292 KB Output is correct
49 Correct 117 ms 11244 KB Output is correct
50 Correct 173 ms 11244 KB Output is correct
51 Correct 101 ms 11244 KB Output is correct
52 Correct 44 ms 9068 KB Output is correct
53 Correct 67 ms 13676 KB Output is correct
54 Correct 90 ms 13676 KB Output is correct
55 Correct 79 ms 12524 KB Output is correct
56 Correct 77 ms 12524 KB Output is correct
57 Correct 47 ms 10220 KB Output is correct
58 Correct 46 ms 10220 KB Output is correct
59 Correct 57 ms 11756 KB Output is correct
60 Correct 68 ms 11884 KB Output is correct
61 Correct 68 ms 11756 KB Output is correct
62 Correct 63 ms 11884 KB Output is correct
63 Correct 59 ms 11756 KB Output is correct
64 Correct 66 ms 11756 KB Output is correct
65 Correct 92 ms 12652 KB Output is correct
66 Correct 123 ms 12524 KB Output is correct
67 Correct 79 ms 13292 KB Output is correct
68 Correct 78 ms 13292 KB Output is correct
69 Correct 72 ms 13932 KB Output is correct
70 Correct 71 ms 13932 KB Output is correct
71 Correct 87 ms 15724 KB Output is correct
72 Correct 78 ms 15724 KB Output is correct
73 Correct 76 ms 15468 KB Output is correct
74 Correct 75 ms 15340 KB Output is correct
75 Correct 49 ms 10220 KB Output is correct
76 Correct 52 ms 10220 KB Output is correct
77 Correct 52 ms 10380 KB Output is correct
78 Correct 185 ms 12524 KB Output is correct
79 Correct 115 ms 12524 KB Output is correct
80 Correct 1530 ms 54016 KB Output is correct
81 Correct 1683 ms 54252 KB Output is correct
82 Correct 895 ms 54252 KB Output is correct
83 Correct 1625 ms 54064 KB Output is correct
84 Correct 1576 ms 54044 KB Output is correct
85 Correct 1027 ms 54268 KB Output is correct
86 Correct 1589 ms 54248 KB Output is correct
87 Correct 426 ms 30880 KB Output is correct
88 Correct 758 ms 77692 KB Output is correct
89 Correct 811 ms 77548 KB Output is correct
90 Correct 775 ms 54100 KB Output is correct
91 Correct 779 ms 54124 KB Output is correct
92 Correct 440 ms 30700 KB Output is correct
93 Correct 424 ms 30700 KB Output is correct
94 Correct 566 ms 46316 KB Output is correct
95 Correct 659 ms 46316 KB Output is correct
96 Correct 714 ms 46720 KB Output is correct
97 Correct 568 ms 46496 KB Output is correct
98 Correct 620 ms 46508 KB Output is correct
99 Correct 698 ms 46572 KB Output is correct
100 Correct 1706 ms 54264 KB Output is correct
101 Correct 1668 ms 54252 KB Output is correct
102 Correct 784 ms 62064 KB Output is correct
103 Correct 781 ms 62000 KB Output is correct
104 Correct 787 ms 67232 KB Output is correct
105 Correct 771 ms 67232 KB Output is correct
106 Correct 827 ms 85552 KB Output is correct
107 Correct 866 ms 85356 KB Output is correct
108 Correct 834 ms 82860 KB Output is correct
109 Correct 858 ms 83052 KB Output is correct
110 Correct 463 ms 30572 KB Output is correct
111 Correct 479 ms 30700 KB Output is correct
112 Correct 495 ms 30620 KB Output is correct
113 Correct 972 ms 54380 KB Output is correct
114 Correct 1660 ms 54144 KB Output is correct