oj.uz

Submission #974936

# Submission time Handle Problem Language Result Execution time Memory
974936 2024-05-04T07:28:17 Z yeediot Port Facility (JOI17_port_facility) C++17
100 / 100
 1445 ms 223276 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].pb(i);
    }
    set<pii>st;
    for(int i=1;i<=2*n;i++){
        for(auto 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 6 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 5 ms 25436 KB Output is correct
4 Correct 6 ms 25436 KB Output is correct
5 Correct 6 ms 25644 KB Output is correct
6 Correct 7 ms 25688 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25432 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25436 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25436 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25544 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 7 ms 25632 KB Output is correct
19 Correct 5 ms 25432 KB Output is correct
20 Correct 7 ms 25564 KB Output is correct
21 Correct 6 ms 25436 KB Output is correct
22 Correct 7 ms 25560 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 6 ms 25640 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 5 ms 25436 KB Output is correct
4 Correct 6 ms 25436 KB Output is correct
5 Correct 6 ms 25644 KB Output is correct
6 Correct 7 ms 25688 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25432 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25436 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25436 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25544 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 7 ms 25632 KB Output is correct
19 Correct 5 ms 25432 KB Output is correct
20 Correct 7 ms 25564 KB Output is correct
21 Correct 6 ms 25436 KB Output is correct
22 Correct 7 ms 25560 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 6 ms 25640 KB Output is correct
25 Correct 7 ms 25948 KB Output is correct
26 Correct 7 ms 25692 KB Output is correct
27 Correct 6 ms 25692 KB Output is correct
28 Correct 7 ms 25692 KB Output is correct
29 Correct 9 ms 25948 KB Output is correct
30 Correct 7 ms 25824 KB Output is correct
31 Correct 8 ms 25688 KB Output is correct
32 Correct 8 ms 25908 KB Output is correct
33 Correct 6 ms 25688 KB Output is correct
34 Correct 7 ms 25692 KB Output is correct
35 Correct 6 ms 25780 KB Output is correct
36 Correct 6 ms 25692 KB Output is correct
37 Correct 6 ms 25948 KB Output is correct
38 Correct 8 ms 26204 KB Output is correct
39 Correct 6 ms 25692 KB Output is correct
40 Correct 6 ms 25688 KB Output is correct
41 Correct 6 ms 25948 KB Output is correct
42 Correct 7 ms 25948 KB Output is correct
43 Correct 7 ms 25948 KB Output is correct
44 Correct 8 ms 25804 KB Output is correct
45 Correct 62 ms 40032 KB Output is correct
46 Correct 66 ms 40392 KB Output is correct
47 Correct 87 ms 39792 KB Output is correct
48 Correct 68 ms 40468 KB Output is correct
49 Correct 62 ms 40136 KB Output is correct
50 Correct 64 ms 40200 KB Output is correct
51 Correct 70 ms 40512 KB Output is correct
52 Correct 36 ms 36040 KB Output is correct
53 Correct 50 ms 40868 KB Output is correct
54 Correct 89 ms 42180 KB Output is correct
55 Correct 60 ms 42440 KB Output is correct
56 Correct 67 ms 41680 KB Output is correct
57 Correct 45 ms 39368 KB Output is correct
58 Correct 32 ms 36304 KB Output is correct
59 Correct 43 ms 38088 KB Output is correct
60 Correct 71 ms 38948 KB Output is correct
61 Correct 65 ms 39068 KB Output is correct
62 Correct 55 ms 39368 KB Output is correct
63 Correct 61 ms 38596 KB Output is correct
64 Correct 67 ms 39108 KB Output is correct
65 Correct 66 ms 39876 KB Output is correct
66 Correct 70 ms 39884 KB Output is correct
67 Correct 75 ms 41956 KB Output is correct
68 Correct 74 ms 41924 KB Output is correct
69 Correct 67 ms 42696 KB Output is correct
70 Correct 74 ms 42696 KB Output is correct
71 Correct 72 ms 42024 KB Output is correct
72 Correct 65 ms 42120 KB Output is correct
73 Correct 64 ms 43092 KB Output is correct
74 Correct 75 ms 43072 KB Output is correct
75 Correct 55 ms 42952 KB Output is correct
76 Correct 57 ms 45512 KB Output is correct
77 Correct 59 ms 45512 KB Output is correct
78 Correct 76 ms 40304 KB Output is correct
79 Correct 90 ms 40068 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 5 ms 25436 KB Output is correct
4 Correct 6 ms 25436 KB Output is correct
5 Correct 6 ms 25644 KB Output is correct
6 Correct 7 ms 25688 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25432 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25436 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25436 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25544 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 7 ms 25632 KB Output is correct
19 Correct 5 ms 25432 KB Output is correct
20 Correct 7 ms 25564 KB Output is correct
21 Correct 6 ms 25436 KB Output is correct
22 Correct 7 ms 25560 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 6 ms 25640 KB Output is correct
25 Correct 7 ms 25948 KB Output is correct
26 Correct 7 ms 25692 KB Output is correct
27 Correct 6 ms 25692 KB Output is correct
28 Correct 7 ms 25692 KB Output is correct
29 Correct 9 ms 25948 KB Output is correct
30 Correct 7 ms 25824 KB Output is correct
31 Correct 8 ms 25688 KB Output is correct
32 Correct 8 ms 25908 KB Output is correct
33 Correct 6 ms 25688 KB Output is correct
34 Correct 7 ms 25692 KB Output is correct
35 Correct 6 ms 25780 KB Output is correct
36 Correct 6 ms 25692 KB Output is correct
37 Correct 6 ms 25948 KB Output is correct
38 Correct 8 ms 26204 KB Output is correct
39 Correct 6 ms 25692 KB Output is correct
40 Correct 6 ms 25688 KB Output is correct
41 Correct 6 ms 25948 KB Output is correct
42 Correct 7 ms 25948 KB Output is correct
43 Correct 7 ms 25948 KB Output is correct
44 Correct 8 ms 25804 KB Output is correct
45 Correct 62 ms 40032 KB Output is correct
46 Correct 66 ms 40392 KB Output is correct
47 Correct 87 ms 39792 KB Output is correct
48 Correct 68 ms 40468 KB Output is correct
49 Correct 62 ms 40136 KB Output is correct
50 Correct 64 ms 40200 KB Output is correct
51 Correct 70 ms 40512 KB Output is correct
52 Correct 36 ms 36040 KB Output is correct
53 Correct 50 ms 40868 KB Output is correct
54 Correct 89 ms 42180 KB Output is correct
55 Correct 60 ms 42440 KB Output is correct
56 Correct 67 ms 41680 KB Output is correct
57 Correct 45 ms 39368 KB Output is correct
58 Correct 32 ms 36304 KB Output is correct
59 Correct 43 ms 38088 KB Output is correct
60 Correct 71 ms 38948 KB Output is correct
61 Correct 65 ms 39068 KB Output is correct
62 Correct 55 ms 39368 KB Output is correct
63 Correct 61 ms 38596 KB Output is correct
64 Correct 67 ms 39108 KB Output is correct
65 Correct 66 ms 39876 KB Output is correct
66 Correct 70 ms 39884 KB Output is correct
67 Correct 75 ms 41956 KB Output is correct
68 Correct 74 ms 41924 KB Output is correct
69 Correct 67 ms 42696 KB Output is correct
70 Correct 74 ms 42696 KB Output is correct
71 Correct 72 ms 42024 KB Output is correct
72 Correct 65 ms 42120 KB Output is correct
73 Correct 64 ms 43092 KB Output is correct
74 Correct 75 ms 43072 KB Output is correct
75 Correct 55 ms 42952 KB Output is correct
76 Correct 57 ms 45512 KB Output is correct
77 Correct 59 ms 45512 KB Output is correct
78 Correct 76 ms 40304 KB Output is correct
79 Correct 90 ms 40068 KB Output is correct
80 Correct 1275 ms 166244 KB Output is correct
81 Correct 1189 ms 165880 KB Output is correct
82 Correct 1210 ms 165084 KB Output is correct
83 Correct 1248 ms 167692 KB Output is correct
84 Correct 1201 ms 168264 KB Output is correct
85 Correct 1407 ms 166576 KB Output is correct
86 Correct 1384 ms 167936 KB Output is correct
87 Correct 686 ms 131212 KB Output is correct
88 Correct 709 ms 176816 KB Output is correct
89 Correct 1315 ms 196340 KB Output is correct
90 Correct 1354 ms 192864 KB Output is correct
91 Correct 1307 ms 190128 KB Output is correct
92 Correct 1002 ms 160596 KB Output is correct
93 Correct 666 ms 129168 KB Output is correct
94 Correct 960 ms 151792 KB Output is correct
95 Correct 1173 ms 158056 KB Output is correct
96 Correct 1183 ms 157076 KB Output is correct
97 Correct 1174 ms 156584 KB Output is correct
98 Correct 1336 ms 157636 KB Output is correct
99 Correct 1445 ms 160944 KB Output is correct
100 Correct 1343 ms 167776 KB Output is correct
101 Correct 1336 ms 168936 KB Output is correct
102 Correct 1402 ms 188652 KB Output is correct
103 Correct 1329 ms 186996 KB Output is correct
104 Correct 1405 ms 194732 KB Output is correct
105 Correct 1406 ms 194720 KB Output is correct
106 Correct 1195 ms 188256 KB Output is correct
107 Correct 1264 ms 188132 KB Output is correct
108 Correct 1251 ms 196728 KB Output is correct
109 Correct 1344 ms 196132 KB Output is correct
110 Correct 1178 ms 221956 KB Output is correct
111 Correct 1166 ms 223276 KB Output is correct
112 Correct 1195 ms 223052 KB Output is correct
113 Correct 1199 ms 166544 KB Output is correct
114 Correct 1301 ms 167376 KB Output is correct