oj.uz

Submission #129856

# Submission time Handle Problem Language Result Execution time Memory
129856 2019-07-13T11:18:00 Z nikolapesic2802 Port Facility (JOI17_port_facility) C++14
100 / 100
 1664 ms 85364 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]);
}
int n;
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;
	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 poc=ok.begin(),kraj=ok.upper_bound({niz[i].s,n});
        if(kraj!=ok.begin())
            for(kraj--;;poc++)
            {
                merge(i,(*poc).s+n),merge(i+n,(*poc).s);
                if(find((*poc).s)==find((*kraj).s))
                    break;
                if(poc==kraj)
                    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:49:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(int i=0;i<N;i++)
     ^~~
port_facility.cpp:51:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  scanf("%i",&n);
  ^~~~~
port_facility.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  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]
         scanf("%i %i",&niz[i].f,&niz[i].s);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8184 KB Output is correct
2 Correct 10 ms 8172 KB Output is correct
3 Correct 10 ms 8184 KB Output is correct
4 Correct 10 ms 8184 KB Output is correct
5 Correct 10 ms 8184 KB Output is correct
6 Correct 10 ms 8184 KB Output is correct
7 Correct 10 ms 8184 KB Output is correct
8 Correct 10 ms 8184 KB Output is correct
9 Correct 10 ms 8184 KB Output is correct
10 Correct 10 ms 8184 KB Output is correct
11 Correct 10 ms 8184 KB Output is correct
12 Correct 10 ms 8184 KB Output is correct
13 Correct 13 ms 8240 KB Output is correct
14 Correct 12 ms 8184 KB Output is correct
15 Correct 10 ms 8184 KB Output is correct
16 Correct 10 ms 8184 KB Output is correct
17 Correct 10 ms 8184 KB Output is correct
18 Correct 10 ms 8184 KB Output is correct
19 Correct 10 ms 8184 KB Output is correct
20 Correct 10 ms 8184 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 10 ms 8184 KB Output is correct
23 Correct 10 ms 8184 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8184 KB Output is correct
2 Correct 10 ms 8172 KB Output is correct
3 Correct 10 ms 8184 KB Output is correct
4 Correct 10 ms 8184 KB Output is correct
5 Correct 10 ms 8184 KB Output is correct
6 Correct 10 ms 8184 KB Output is correct
7 Correct 10 ms 8184 KB Output is correct
8 Correct 10 ms 8184 KB Output is correct
9 Correct 10 ms 8184 KB Output is correct
10 Correct 10 ms 8184 KB Output is correct
11 Correct 10 ms 8184 KB Output is correct
12 Correct 10 ms 8184 KB Output is correct
13 Correct 13 ms 8240 KB Output is correct
14 Correct 12 ms 8184 KB Output is correct
15 Correct 10 ms 8184 KB Output is correct
16 Correct 10 ms 8184 KB Output is correct
17 Correct 10 ms 8184 KB Output is correct
18 Correct 10 ms 8184 KB Output is correct
19 Correct 10 ms 8184 KB Output is correct
20 Correct 10 ms 8184 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 10 ms 8184 KB Output is correct
23 Correct 10 ms 8184 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct
25 Correct 11 ms 8184 KB Output is correct
26 Correct 11 ms 8184 KB Output is correct
27 Correct 11 ms 8184 KB Output is correct
28 Correct 11 ms 8184 KB Output is correct
29 Correct 11 ms 8312 KB Output is correct
30 Correct 11 ms 8312 KB Output is correct
31 Correct 11 ms 8312 KB Output is correct
32 Correct 11 ms 8184 KB Output is correct
33 Correct 11 ms 8312 KB Output is correct
34 Correct 11 ms 8316 KB Output is correct
35 Correct 13 ms 8184 KB Output is correct
36 Correct 11 ms 8312 KB Output is correct
37 Correct 11 ms 8312 KB Output is correct
38 Correct 11 ms 8284 KB Output is correct
39 Correct 11 ms 8184 KB Output is correct
40 Correct 11 ms 8184 KB Output is correct
41 Correct 11 ms 8312 KB Output is correct
42 Correct 11 ms 8312 KB Output is correct
43 Correct 11 ms 8184 KB Output is correct
44 Correct 11 ms 8184 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8184 KB Output is correct
2 Correct 10 ms 8172 KB Output is correct
3 Correct 10 ms 8184 KB Output is correct
4 Correct 10 ms 8184 KB Output is correct
5 Correct 10 ms 8184 KB Output is correct
6 Correct 10 ms 8184 KB Output is correct
7 Correct 10 ms 8184 KB Output is correct
8 Correct 10 ms 8184 KB Output is correct
9 Correct 10 ms 8184 KB Output is correct
10 Correct 10 ms 8184 KB Output is correct
11 Correct 10 ms 8184 KB Output is correct
12 Correct 10 ms 8184 KB Output is correct
13 Correct 13 ms 8240 KB Output is correct
14 Correct 12 ms 8184 KB Output is correct
15 Correct 10 ms 8184 KB Output is correct
16 Correct 10 ms 8184 KB Output is correct
17 Correct 10 ms 8184 KB Output is correct
18 Correct 10 ms 8184 KB Output is correct
19 Correct 10 ms 8184 KB Output is correct
20 Correct 10 ms 8184 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 10 ms 8184 KB Output is correct
23 Correct 10 ms 8184 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct
25 Correct 11 ms 8184 KB Output is correct
26 Correct 11 ms 8184 KB Output is correct
27 Correct 11 ms 8184 KB Output is correct
28 Correct 11 ms 8184 KB Output is correct
29 Correct 11 ms 8312 KB Output is correct
30 Correct 11 ms 8312 KB Output is correct
31 Correct 11 ms 8312 KB Output is correct
32 Correct 11 ms 8184 KB Output is correct
33 Correct 11 ms 8312 KB Output is correct
34 Correct 11 ms 8316 KB Output is correct
35 Correct 13 ms 8184 KB Output is correct
36 Correct 11 ms 8312 KB Output is correct
37 Correct 11 ms 8312 KB Output is correct
38 Correct 11 ms 8284 KB Output is correct
39 Correct 11 ms 8184 KB Output is correct
40 Correct 11 ms 8184 KB Output is correct
41 Correct 11 ms 8312 KB Output is correct
42 Correct 11 ms 8312 KB Output is correct
43 Correct 11 ms 8184 KB Output is correct
44 Correct 11 ms 8184 KB Output is correct
45 Correct 74 ms 11512 KB Output is correct
46 Correct 74 ms 11512 KB Output is correct
47 Correct 73 ms 11512 KB Output is correct
48 Correct 75 ms 11512 KB Output is correct
49 Correct 74 ms 11512 KB Output is correct
50 Correct 72 ms 11556 KB Output is correct
51 Correct 72 ms 11484 KB Output is correct
52 Correct 50 ms 9080 KB Output is correct
53 Correct 86 ms 13944 KB Output is correct
54 Correct 95 ms 14052 KB Output is correct
55 Correct 90 ms 11512 KB Output is correct
56 Correct 91 ms 11512 KB Output is correct
57 Correct 52 ms 9208 KB Output is correct
58 Correct 50 ms 9208 KB Output is correct
59 Correct 66 ms 10744 KB Output is correct
60 Correct 67 ms 10744 KB Output is correct
61 Correct 72 ms 10872 KB Output is correct
62 Correct 61 ms 10744 KB Output is correct
63 Correct 65 ms 10876 KB Output is correct
64 Correct 68 ms 10744 KB Output is correct
65 Correct 99 ms 11512 KB Output is correct
66 Correct 101 ms 11600 KB Output is correct
67 Correct 85 ms 12376 KB Output is correct
68 Correct 85 ms 12280 KB Output is correct
69 Correct 82 ms 12920 KB Output is correct
70 Correct 82 ms 12792 KB Output is correct
71 Correct 89 ms 14652 KB Output is correct
72 Correct 88 ms 14712 KB Output is correct
73 Correct 90 ms 14456 KB Output is correct
74 Correct 89 ms 14456 KB Output is correct
75 Correct 53 ms 9208 KB Output is correct
76 Correct 56 ms 9208 KB Output is correct
77 Correct 53 ms 9336 KB Output is correct
78 Correct 79 ms 11512 KB Output is correct
79 Correct 74 ms 11588 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8184 KB Output is correct
2 Correct 10 ms 8172 KB Output is correct
3 Correct 10 ms 8184 KB Output is correct
4 Correct 10 ms 8184 KB Output is correct
5 Correct 10 ms 8184 KB Output is correct
6 Correct 10 ms 8184 KB Output is correct
7 Correct 10 ms 8184 KB Output is correct
8 Correct 10 ms 8184 KB Output is correct
9 Correct 10 ms 8184 KB Output is correct
10 Correct 10 ms 8184 KB Output is correct
11 Correct 10 ms 8184 KB Output is correct
12 Correct 10 ms 8184 KB Output is correct
13 Correct 13 ms 8240 KB Output is correct
14 Correct 12 ms 8184 KB Output is correct
15 Correct 10 ms 8184 KB Output is correct
16 Correct 10 ms 8184 KB Output is correct
17 Correct 10 ms 8184 KB Output is correct
18 Correct 10 ms 8184 KB Output is correct
19 Correct 10 ms 8184 KB Output is correct
20 Correct 10 ms 8184 KB Output is correct
21 Correct 10 ms 8184 KB Output is correct
22 Correct 10 ms 8184 KB Output is correct
23 Correct 10 ms 8184 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct
25 Correct 11 ms 8184 KB Output is correct
26 Correct 11 ms 8184 KB Output is correct
27 Correct 11 ms 8184 KB Output is correct
28 Correct 11 ms 8184 KB Output is correct
29 Correct 11 ms 8312 KB Output is correct
30 Correct 11 ms 8312 KB Output is correct
31 Correct 11 ms 8312 KB Output is correct
32 Correct 11 ms 8184 KB Output is correct
33 Correct 11 ms 8312 KB Output is correct
34 Correct 11 ms 8316 KB Output is correct
35 Correct 13 ms 8184 KB Output is correct
36 Correct 11 ms 8312 KB Output is correct
37 Correct 11 ms 8312 KB Output is correct
38 Correct 11 ms 8284 KB Output is correct
39 Correct 11 ms 8184 KB Output is correct
40 Correct 11 ms 8184 KB Output is correct
41 Correct 11 ms 8312 KB Output is correct
42 Correct 11 ms 8312 KB Output is correct
43 Correct 11 ms 8184 KB Output is correct
44 Correct 11 ms 8184 KB Output is correct
45 Correct 74 ms 11512 KB Output is correct
46 Correct 74 ms 11512 KB Output is correct
47 Correct 73 ms 11512 KB Output is correct
48 Correct 75 ms 11512 KB Output is correct
49 Correct 74 ms 11512 KB Output is correct
50 Correct 72 ms 11556 KB Output is correct
51 Correct 72 ms 11484 KB Output is correct
52 Correct 50 ms 9080 KB Output is correct
53 Correct 86 ms 13944 KB Output is correct
54 Correct 95 ms 14052 KB Output is correct
55 Correct 90 ms 11512 KB Output is correct
56 Correct 91 ms 11512 KB Output is correct
57 Correct 52 ms 9208 KB Output is correct
58 Correct 50 ms 9208 KB Output is correct
59 Correct 66 ms 10744 KB Output is correct
60 Correct 67 ms 10744 KB Output is correct
61 Correct 72 ms 10872 KB Output is correct
62 Correct 61 ms 10744 KB Output is correct
63 Correct 65 ms 10876 KB Output is correct
64 Correct 68 ms 10744 KB Output is correct
65 Correct 99 ms 11512 KB Output is correct
66 Correct 101 ms 11600 KB Output is correct
67 Correct 85 ms 12376 KB Output is correct
68 Correct 85 ms 12280 KB Output is correct
69 Correct 82 ms 12920 KB Output is correct
70 Correct 82 ms 12792 KB Output is correct
71 Correct 89 ms 14652 KB Output is correct
72 Correct 88 ms 14712 KB Output is correct
73 Correct 90 ms 14456 KB Output is correct
74 Correct 89 ms 14456 KB Output is correct
75 Correct 53 ms 9208 KB Output is correct
76 Correct 56 ms 9208 KB Output is correct
77 Correct 53 ms 9336 KB Output is correct
78 Correct 79 ms 11512 KB Output is correct
79 Correct 74 ms 11588 KB Output is correct
80 Correct 742 ms 39792 KB Output is correct
81 Correct 735 ms 54264 KB Output is correct
82 Correct 719 ms 54132 KB Output is correct
83 Correct 733 ms 54008 KB Output is correct
84 Correct 741 ms 54228 KB Output is correct
85 Correct 701 ms 54076 KB Output is correct
86 Correct 709 ms 54108 KB Output is correct
87 Correct 453 ms 30456 KB Output is correct
88 Correct 1108 ms 77712 KB Output is correct
89 Correct 1139 ms 77724 KB Output is correct
90 Correct 1044 ms 54032 KB Output is correct
91 Correct 1174 ms 54108 KB Output is correct
92 Correct 467 ms 30584 KB Output is correct
93 Correct 456 ms 30712 KB Output is correct
94 Correct 610 ms 46200 KB Output is correct
95 Correct 689 ms 46276 KB Output is correct
96 Correct 721 ms 46456 KB Output is correct
97 Correct 607 ms 46212 KB Output is correct
98 Correct 677 ms 46224 KB Output is correct
99 Correct 677 ms 46200 KB Output is correct
100 Correct 1647 ms 54264 KB Output is correct
101 Correct 1664 ms 54172 KB Output is correct
102 Correct 992 ms 61944 KB Output is correct
103 Correct 995 ms 61972 KB Output is correct
104 Correct 964 ms 67228 KB Output is correct
105 Correct 967 ms 67192 KB Output is correct
106 Correct 1119 ms 85284 KB Output is correct
107 Correct 1101 ms 85364 KB Output is correct
108 Correct 1114 ms 82808 KB Output is correct
109 Correct 1116 ms 82836 KB Output is correct
110 Correct 489 ms 30456 KB Output is correct
111 Correct 503 ms 30456 KB Output is correct
112 Correct 490 ms 30712 KB Output is correct
113 Correct 725 ms 54136 KB Output is correct
114 Correct 726 ms 54100 KB Output is correct