oj.uz

Submission #896835

# Submission time Handle Problem Language Result Execution time Memory
896835 2024-01-02T09:23:18 Z Aiperiii Port Facility (JOI17_port_facility) C++14
22 / 100
 6000 ms 33044 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int mod=1e9+7;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);
    int n;
    cin>>n;
    vector <pair <int,int> > seg(n);
    vector <vector <int> > v;
    for(int i=0;i<n;i++){
        cin>>seg[i].ff>>seg[i].ss;
    }
    sort(all(seg));
    
    for(int i=0;i<n;i++){
        v.pb({seg[i].ff,i,0});
        v.pb({seg[i].ss,i,1});
    }
    sort(all(v));
    
    vector <int> g[n];
    set <pair <int,int> > st;
    for(int i=0;i<v.size();i++){
        if(v[i][2]==0){
            int ind=v[i][1];
            st.insert({seg[ind].ss,ind});
        }
        else{
            auto it=st.lower_bound({v[i][0],v[i][1]});
            it++;
            while(it!=st.end()){
                if(it->ff>v[i][0] && it->ss>v[i][1]){
                    g[v[i][1]].pb(it->ss);
                    g[it->ss].pb(v[i][1]);
                }
                it++;
            }
            st.erase({v[i][0],v[i][1]});
        }
        
    }
    
    queue <int> q;
    vector <int> vis(n);
    int cnt=0;
    for(int i=0;i<n;i++){
        if(!vis[i]){
            cnt++;
            q.push(i);
            vis[i]=1;
            while(!q.empty()){
                int v=q.front();
                q.pop();
                for(auto to : g[v]){
                    if(!vis[to]){
                        vis[to]=1;
                        q.push(to);
                    }
                }
            }
        }
    }
    for(int i=0;i<n;i++)vis[i]=0;
    bool flag=true;
    for(int i=0;i<n;i++){
        if(!vis[i]){
            q.push(i);
            vis[i]=1;
            while(!q.empty()){
                int v=q.front();
                q.pop();
                for(auto to : g[v]){
                    if(!vis[to]){
                        if(vis[v]==1)vis[to]=2;
                        if(vis[v]==2)vis[to]=1;
                        q.push(to);
                    }
                    else if(vis[to]==vis[v]){
                        flag=false;break;
                    }
                }
            }
        }
    }
    if(flag){
        int x=1;
        for(int i=0;i<cnt;i++){
            x*=2;
            x%=mod;
        }
        cout<<x<<"\n";
    }
    else cout<<0<<"\n";
}

Compilation message

port_facility.cpp: In function 'int main()':
port_facility.cpp:29:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 0 ms 428 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 436 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 0 ms 428 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 436 KB Output is correct
25 Correct 9 ms 1112 KB Output is correct
26 Correct 9 ms 1368 KB Output is correct
27 Correct 9 ms 1116 KB Output is correct
28 Correct 11 ms 1624 KB Output is correct
29 Correct 9 ms 1372 KB Output is correct
30 Correct 9 ms 1620 KB Output is correct
31 Correct 9 ms 1372 KB Output is correct
32 Correct 11 ms 1116 KB Output is correct
33 Correct 10 ms 1112 KB Output is correct
34 Correct 8 ms 1116 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 10 ms 700 KB Output is correct
37 Correct 39 ms 33044 KB Output is correct
38 Correct 21 ms 16988 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 1 ms 740 KB Output is correct
41 Correct 26 ms 16876 KB Output is correct
42 Correct 26 ms 16840 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 740 KB Output is correct

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 0 ms 428 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 436 KB Output is correct
25 Correct 9 ms 1112 KB Output is correct
26 Correct 9 ms 1368 KB Output is correct
27 Correct 9 ms 1116 KB Output is correct
28 Correct 11 ms 1624 KB Output is correct
29 Correct 9 ms 1372 KB Output is correct
30 Correct 9 ms 1620 KB Output is correct
31 Correct 9 ms 1372 KB Output is correct
32 Correct 11 ms 1116 KB Output is correct
33 Correct 10 ms 1112 KB Output is correct
34 Correct 8 ms 1116 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 10 ms 700 KB Output is correct
37 Correct 39 ms 33044 KB Output is correct
38 Correct 21 ms 16988 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 1 ms 740 KB Output is correct
41 Correct 26 ms 16876 KB Output is correct
42 Correct 26 ms 16840 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 740 KB Output is correct
45 Execution timed out 6090 ms 20156 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 0 ms 428 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 436 KB Output is correct
25 Correct 9 ms 1112 KB Output is correct
26 Correct 9 ms 1368 KB Output is correct
27 Correct 9 ms 1116 KB Output is correct
28 Correct 11 ms 1624 KB Output is correct
29 Correct 9 ms 1372 KB Output is correct
30 Correct 9 ms 1620 KB Output is correct
31 Correct 9 ms 1372 KB Output is correct
32 Correct 11 ms 1116 KB Output is correct
33 Correct 10 ms 1112 KB Output is correct
34 Correct 8 ms 1116 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 10 ms 700 KB Output is correct
37 Correct 39 ms 33044 KB Output is correct
38 Correct 21 ms 16988 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 1 ms 740 KB Output is correct
41 Correct 26 ms 16876 KB Output is correct
42 Correct 26 ms 16840 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 740 KB Output is correct
45 Execution timed out 6090 ms 20156 KB Time limit exceeded
46 Halted 0 ms 0 KB -