oj.uz

Submission #974937

# Submission time Handle Problem Language Result Execution time Memory
974937 2024-05-04T07:29:14 Z yeediot Port Facility (JOI17_port_facility) C++17
100 / 100
 927 ms 153308 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e6+5;
const int mod=1e9+7;
vector<int>adj[mxn];
int col[mxn];
int ans;
void dfs(int v,int pa){
    for(auto u:adj[v]){
        if(u==pa){
            continue;
        }
        if(col[u]){
            if(col[u]+col[v]!=3){
                ans=0;
                return;
            }
        }
        else{
            col[u]=3-col[v];
            dfs(u,v);
        }
    }
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    vector<pii>v;
    ans=1;
    v.pb({0,0});
    vector<int>nxt(n+1);
    vector<int>in(2*n+1);
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        v.pb({a,b});
        in[a]=i;
    }
    set<pii>st;
    for(int i=1;i<=2*n;i++){
        if(!in[i])continue;
        int id=in[i];
            while(sz(st) and st.begin()->F<v[id].F){
                int x=st.begin()->S;
                st.erase(st.begin());
                if(nxt[x])st.insert({v[nxt[x]].S,nxt[x]});
            }
            auto cur=st.insert({v[id].S,id}).F;
            vector<pii>del;
            while(cur!=st.begin()){
                cur=prev(cur);
                del.pb(*cur);
            }
            for(auto p:del){
                adj[p.S].pb(id);
                adj[id].pb(p.S);
            }
            for(auto p:del){
                if(p!=del.back())st.erase(p);
            }
            for(int j=1;j<sz(del);j++){
                nxt[del[j].S]=del[j-1].S;
            }
    }
    for(int i=1;i<=n;i++){
        if(!col[i]){
            col[i]=1;
            dfs(i,i);
            ans=ans*2%mod;
        }
    }
    cout<<ans<<'\n';
}
 /*
 input:
 
 */

Compilation message

port_facility.cpp: In function 'void setIO(std::string)':
port_facility.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
port_facility.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25436 KB Output is correct
2 Correct 8 ms 25436 KB Output is correct
3 Correct 6 ms 25436 KB Output is correct
4 Correct 7 ms 25436 KB Output is correct
5 Correct 7 ms 25436 KB Output is correct
6 Correct 6 ms 25436 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25688 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25568 KB Output is correct
12 Correct 6 ms 25448 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25432 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25436 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 6 ms 25436 KB Output is correct
19 Correct 6 ms 25432 KB Output is correct
20 Correct 7 ms 25436 KB Output is correct
21 Correct 6 ms 25436 KB Output is correct
22 Correct 6 ms 25436 KB Output is correct
23 Correct 6 ms 25432 KB Output is correct
24 Correct 6 ms 25436 KB Output is correct
25 Correct 7 ms 25948 KB Output is correct
26 Correct 7 ms 25692 KB Output is correct
27 Correct 7 ms 25692 KB Output is correct
28 Correct 8 ms 25688 KB Output is correct
29 Correct 7 ms 25692 KB Output is correct
30 Correct 6 ms 25688 KB Output is correct
31 Correct 7 ms 25800 KB Output is correct
32 Correct 6 ms 25688 KB Output is correct
33 Correct 8 ms 25688 KB Output is correct
34 Correct 7 ms 25692 KB Output is correct
35 Correct 6 ms 25692 KB Output is correct
36 Correct 7 ms 25692 KB Output is correct
37 Correct 7 ms 25692 KB Output is correct
38 Correct 6 ms 25692 KB Output is correct
39 Correct 6 ms 25944 KB Output is correct
40 Correct 6 ms 25692 KB Output is correct
41 Correct 6 ms 25692 KB Output is correct
42 Correct 6 ms 25692 KB Output is correct
43 Correct 6 ms 25692 KB Output is correct
44 Correct 7 ms 25688 KB Output is correct

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25436 KB Output is correct
2 Correct 8 ms 25436 KB Output is correct
3 Correct 6 ms 25436 KB Output is correct
4 Correct 7 ms 25436 KB Output is correct
5 Correct 7 ms 25436 KB Output is correct
6 Correct 6 ms 25436 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25688 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25568 KB Output is correct
12 Correct 6 ms 25448 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25432 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25436 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 6 ms 25436 KB Output is correct
19 Correct 6 ms 25432 KB Output is correct
20 Correct 7 ms 25436 KB Output is correct
21 Correct 6 ms 25436 KB Output is correct
22 Correct 6 ms 25436 KB Output is correct
23 Correct 6 ms 25432 KB Output is correct
24 Correct 6 ms 25436 KB Output is correct
25 Correct 7 ms 25948 KB Output is correct
26 Correct 7 ms 25692 KB Output is correct
27 Correct 7 ms 25692 KB Output is correct
28 Correct 8 ms 25688 KB Output is correct
29 Correct 7 ms 25692 KB Output is correct
30 Correct 6 ms 25688 KB Output is correct
31 Correct 7 ms 25800 KB Output is correct
32 Correct 6 ms 25688 KB Output is correct
33 Correct 8 ms 25688 KB Output is correct
34 Correct 7 ms 25692 KB Output is correct
35 Correct 6 ms 25692 KB Output is correct
36 Correct 7 ms 25692 KB Output is correct
37 Correct 7 ms 25692 KB Output is correct
38 Correct 6 ms 25692 KB Output is correct
39 Correct 6 ms 25944 KB Output is correct
40 Correct 6 ms 25692 KB Output is correct
41 Correct 6 ms 25692 KB Output is correct
42 Correct 6 ms 25692 KB Output is correct
43 Correct 6 ms 25692 KB Output is correct
44 Correct 7 ms 25688 KB Output is correct
45 Correct 53 ms 32836 KB Output is correct
46 Correct 56 ms 33352 KB Output is correct
47 Correct 51 ms 32716 KB Output is correct
48 Correct 54 ms 33484 KB Output is correct
49 Correct 54 ms 32972 KB Output is correct
50 Correct 52 ms 33148 KB Output is correct
51 Correct 54 ms 33232 KB Output is correct
52 Correct 25 ms 29136 KB Output is correct
53 Correct 33 ms 33740 KB Output is correct
54 Correct 55 ms 35132 KB Output is correct
55 Correct 54 ms 35484 KB Output is correct
56 Correct 45 ms 34508 KB Output is correct
57 Correct 34 ms 32260 KB Output is correct
58 Correct 24 ms 29136 KB Output is correct
59 Correct 33 ms 31184 KB Output is correct
60 Correct 44 ms 31948 KB Output is correct
61 Correct 50 ms 31960 KB Output is correct
62 Correct 43 ms 32472 KB Output is correct
63 Correct 48 ms 31480 KB Output is correct
64 Correct 49 ms 32204 KB Output is correct
65 Correct 56 ms 32772 KB Output is correct
66 Correct 52 ms 32976 KB Output is correct
67 Correct 57 ms 34764 KB Output is correct
68 Correct 59 ms 35020 KB Output is correct
69 Correct 61 ms 35792 KB Output is correct
70 Correct 49 ms 35788 KB Output is correct
71 Correct 45 ms 35016 KB Output is correct
72 Correct 45 ms 35024 KB Output is correct
73 Correct 44 ms 36032 KB Output is correct
74 Correct 48 ms 35972 KB Output is correct
75 Correct 41 ms 35948 KB Output is correct
76 Correct 48 ms 38608 KB Output is correct
77 Correct 49 ms 38620 KB Output is correct
78 Correct 54 ms 33228 KB Output is correct
79 Correct 60 ms 33440 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25436 KB Output is correct
2 Correct 8 ms 25436 KB Output is correct
3 Correct 6 ms 25436 KB Output is correct
4 Correct 7 ms 25436 KB Output is correct
5 Correct 7 ms 25436 KB Output is correct
6 Correct 6 ms 25436 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25688 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25568 KB Output is correct
12 Correct 6 ms 25448 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25432 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25436 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 6 ms 25436 KB Output is correct
19 Correct 6 ms 25432 KB Output is correct
20 Correct 7 ms 25436 KB Output is correct
21 Correct 6 ms 25436 KB Output is correct
22 Correct 6 ms 25436 KB Output is correct
23 Correct 6 ms 25432 KB Output is correct
24 Correct 6 ms 25436 KB Output is correct
25 Correct 7 ms 25948 KB Output is correct
26 Correct 7 ms 25692 KB Output is correct
27 Correct 7 ms 25692 KB Output is correct
28 Correct 8 ms 25688 KB Output is correct
29 Correct 7 ms 25692 KB Output is correct
30 Correct 6 ms 25688 KB Output is correct
31 Correct 7 ms 25800 KB Output is correct
32 Correct 6 ms 25688 KB Output is correct
33 Correct 8 ms 25688 KB Output is correct
34 Correct 7 ms 25692 KB Output is correct
35 Correct 6 ms 25692 KB Output is correct
36 Correct 7 ms 25692 KB Output is correct
37 Correct 7 ms 25692 KB Output is correct
38 Correct 6 ms 25692 KB Output is correct
39 Correct 6 ms 25944 KB Output is correct
40 Correct 6 ms 25692 KB Output is correct
41 Correct 6 ms 25692 KB Output is correct
42 Correct 6 ms 25692 KB Output is correct
43 Correct 6 ms 25692 KB Output is correct
44 Correct 7 ms 25688 KB Output is correct
45 Correct 53 ms 32836 KB Output is correct
46 Correct 56 ms 33352 KB Output is correct
47 Correct 51 ms 32716 KB Output is correct
48 Correct 54 ms 33484 KB Output is correct
49 Correct 54 ms 32972 KB Output is correct
50 Correct 52 ms 33148 KB Output is correct
51 Correct 54 ms 33232 KB Output is correct
52 Correct 25 ms 29136 KB Output is correct
53 Correct 33 ms 33740 KB Output is correct
54 Correct 55 ms 35132 KB Output is correct
55 Correct 54 ms 35484 KB Output is correct
56 Correct 45 ms 34508 KB Output is correct
57 Correct 34 ms 32260 KB Output is correct
58 Correct 24 ms 29136 KB Output is correct
59 Correct 33 ms 31184 KB Output is correct
60 Correct 44 ms 31948 KB Output is correct
61 Correct 50 ms 31960 KB Output is correct
62 Correct 43 ms 32472 KB Output is correct
63 Correct 48 ms 31480 KB Output is correct
64 Correct 49 ms 32204 KB Output is correct
65 Correct 56 ms 32772 KB Output is correct
66 Correct 52 ms 32976 KB Output is correct
67 Correct 57 ms 34764 KB Output is correct
68 Correct 59 ms 35020 KB Output is correct
69 Correct 61 ms 35792 KB Output is correct
70 Correct 49 ms 35788 KB Output is correct
71 Correct 45 ms 35016 KB Output is correct
72 Correct 45 ms 35024 KB Output is correct
73 Correct 44 ms 36032 KB Output is correct
74 Correct 48 ms 35972 KB Output is correct
75 Correct 41 ms 35948 KB Output is correct
76 Correct 48 ms 38608 KB Output is correct
77 Correct 49 ms 38620 KB Output is correct
78 Correct 54 ms 33228 KB Output is correct
79 Correct 60 ms 33440 KB Output is correct
80 Correct 821 ms 97620 KB Output is correct
81 Correct 811 ms 97552 KB Output is correct
82 Correct 811 ms 95168 KB Output is correct
83 Correct 771 ms 95416 KB Output is correct
84 Correct 771 ms 95900 KB Output is correct
85 Correct 913 ms 94144 KB Output is correct
86 Correct 842 ms 95348 KB Output is correct
87 Correct 239 ms 59068 KB Output is correct
88 Correct 352 ms 105912 KB Output is correct
89 Correct 783 ms 125716 KB Output is correct
90 Correct 872 ms 122560 KB Output is correct
91 Correct 814 ms 119540 KB Output is correct
92 Correct 643 ms 90260 KB Output is correct
93 Correct 232 ms 59064 KB Output is correct
94 Correct 506 ms 81556 KB Output is correct
95 Correct 799 ms 87488 KB Output is correct
96 Correct 827 ms 86512 KB Output is correct
97 Correct 685 ms 86156 KB Output is correct
98 Correct 780 ms 87224 KB Output is correct
99 Correct 927 ms 90612 KB Output is correct
100 Correct 810 ms 96920 KB Output is correct
101 Correct 869 ms 96296 KB Output is correct
102 Correct 910 ms 116220 KB Output is correct
103 Correct 882 ms 116248 KB Output is correct
104 Correct 879 ms 124156 KB Output is correct
105 Correct 896 ms 124144 KB Output is correct
106 Correct 725 ms 117664 KB Output is correct
107 Correct 801 ms 117700 KB Output is correct
108 Correct 761 ms 126344 KB Output is correct
109 Correct 829 ms 125272 KB Output is correct
110 Correct 749 ms 151488 KB Output is correct
111 Correct 796 ms 152672 KB Output is correct
112 Correct 814 ms 153308 KB Output is correct
113 Correct 784 ms 94656 KB Output is correct
114 Correct 794 ms 95148 KB Output is correct