oj.uz

Submission #974772

# Submission time Handle Problem Language Result Execution time Memory
974772 2024-05-03T18:50:51 Z yeediot Port Facility (JOI17_port_facility) C++17
22 / 100
 3476 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#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){
    debug(v,ans);
    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>in[2*n+1],out[2*n+1];
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        v.pb({a,b});
        in[a].pb(i);
        out[b].pb(i);
    }
    set<pii>st;
    for(int i=1;i<=2*n;i++){
        for(auto x:in[i]){
            st.insert({i,x});
        }
        for(auto x:out[i]){
            auto it=st.upper_bound(make_pair(v[x].F,x));
            while(it!=st.end()){
                adj[x].pb(it->S);
                adj[it->S].pb(x);
                it=next(it);
            }
            st.erase(st.find(make_pair(v[x].F,x)));
        }
    }
    for(int i=1;i<=n;i++){
        if(!col[i]){
            col[i]=1;
            dfs(i,i);
            ans=ans*2%mod;
        }
        //cout<<col[i]<<','<<ans<<' ';
    }
    cout<<ans<<'\n';
}
 /*
 input:
 
 */

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 6 ms 25276 KB Output is correct
4 Correct 7 ms 25432 KB Output is correct
5 Correct 6 ms 25436 KB Output is correct
6 Correct 5 ms 25300 KB Output is correct
7 Correct 5 ms 25436 KB Output is correct
8 Correct 5 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25444 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25432 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25276 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 5 ms 25280 KB Output is correct
19 Correct 5 ms 25436 KB Output is correct
20 Correct 8 ms 25316 KB Output is correct
21 Correct 6 ms 25432 KB Output is correct
22 Correct 6 ms 25304 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 5 ms 25436 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 6 ms 25276 KB Output is correct
4 Correct 7 ms 25432 KB Output is correct
5 Correct 6 ms 25436 KB Output is correct
6 Correct 5 ms 25300 KB Output is correct
7 Correct 5 ms 25436 KB Output is correct
8 Correct 5 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25444 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25432 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25276 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 5 ms 25280 KB Output is correct
19 Correct 5 ms 25436 KB Output is correct
20 Correct 8 ms 25316 KB Output is correct
21 Correct 6 ms 25432 KB Output is correct
22 Correct 6 ms 25304 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 5 ms 25436 KB Output is correct
25 Correct 8 ms 26200 KB Output is correct
26 Correct 8 ms 26460 KB Output is correct
27 Correct 8 ms 26204 KB Output is correct
28 Correct 9 ms 26716 KB Output is correct
29 Correct 8 ms 26460 KB Output is correct
30 Correct 8 ms 26712 KB Output is correct
31 Correct 7 ms 26456 KB Output is correct
32 Correct 8 ms 26204 KB Output is correct
33 Correct 8 ms 26204 KB Output is correct
34 Correct 7 ms 26200 KB Output is correct
35 Correct 6 ms 25888 KB Output is correct
36 Correct 6 ms 25760 KB Output is correct
37 Correct 38 ms 58192 KB Output is correct
38 Correct 22 ms 41820 KB Output is correct
39 Correct 6 ms 25688 KB Output is correct
40 Correct 6 ms 25688 KB Output is correct
41 Correct 25 ms 42076 KB Output is correct
42 Correct 25 ms 42100 KB Output is correct
43 Correct 6 ms 25944 KB Output is correct
44 Correct 7 ms 25948 KB Output is correct

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 6 ms 25276 KB Output is correct
4 Correct 7 ms 25432 KB Output is correct
5 Correct 6 ms 25436 KB Output is correct
6 Correct 5 ms 25300 KB Output is correct
7 Correct 5 ms 25436 KB Output is correct
8 Correct 5 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25444 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25432 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25276 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 5 ms 25280 KB Output is correct
19 Correct 5 ms 25436 KB Output is correct
20 Correct 8 ms 25316 KB Output is correct
21 Correct 6 ms 25432 KB Output is correct
22 Correct 6 ms 25304 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 5 ms 25436 KB Output is correct
25 Correct 8 ms 26200 KB Output is correct
26 Correct 8 ms 26460 KB Output is correct
27 Correct 8 ms 26204 KB Output is correct
28 Correct 9 ms 26716 KB Output is correct
29 Correct 8 ms 26460 KB Output is correct
30 Correct 8 ms 26712 KB Output is correct
31 Correct 7 ms 26456 KB Output is correct
32 Correct 8 ms 26204 KB Output is correct
33 Correct 8 ms 26204 KB Output is correct
34 Correct 7 ms 26200 KB Output is correct
35 Correct 6 ms 25888 KB Output is correct
36 Correct 6 ms 25760 KB Output is correct
37 Correct 38 ms 58192 KB Output is correct
38 Correct 22 ms 41820 KB Output is correct
39 Correct 6 ms 25688 KB Output is correct
40 Correct 6 ms 25688 KB Output is correct
41 Correct 25 ms 42076 KB Output is correct
42 Correct 25 ms 42100 KB Output is correct
43 Correct 6 ms 25944 KB Output is correct
44 Correct 7 ms 25948 KB Output is correct
45 Correct 183 ms 96240 KB Output is correct
46 Correct 319 ms 180924 KB Output is correct
47 Correct 148 ms 71360 KB Output is correct
48 Correct 297 ms 176860 KB Output is correct
49 Correct 173 ms 85184 KB Output is correct
50 Correct 314 ms 176064 KB Output is correct
51 Correct 195 ms 106040 KB Output is correct
52 Correct 52 ms 44480 KB Output is correct
53 Correct 73 ms 50884 KB Output is correct
54 Runtime error 3476 ms 1048576 KB Execution killed with signal 9
55 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25432 KB Output is correct
2 Correct 5 ms 25436 KB Output is correct
3 Correct 6 ms 25276 KB Output is correct
4 Correct 7 ms 25432 KB Output is correct
5 Correct 6 ms 25436 KB Output is correct
6 Correct 5 ms 25300 KB Output is correct
7 Correct 5 ms 25436 KB Output is correct
8 Correct 5 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25444 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25432 KB Output is correct
13 Correct 6 ms 25436 KB Output is correct
14 Correct 6 ms 25276 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 5 ms 25280 KB Output is correct
19 Correct 5 ms 25436 KB Output is correct
20 Correct 8 ms 25316 KB Output is correct
21 Correct 6 ms 25432 KB Output is correct
22 Correct 6 ms 25304 KB Output is correct
23 Correct 6 ms 25436 KB Output is correct
24 Correct 5 ms 25436 KB Output is correct
25 Correct 8 ms 26200 KB Output is correct
26 Correct 8 ms 26460 KB Output is correct
27 Correct 8 ms 26204 KB Output is correct
28 Correct 9 ms 26716 KB Output is correct
29 Correct 8 ms 26460 KB Output is correct
30 Correct 8 ms 26712 KB Output is correct
31 Correct 7 ms 26456 KB Output is correct
32 Correct 8 ms 26204 KB Output is correct
33 Correct 8 ms 26204 KB Output is correct
34 Correct 7 ms 26200 KB Output is correct
35 Correct 6 ms 25888 KB Output is correct
36 Correct 6 ms 25760 KB Output is correct
37 Correct 38 ms 58192 KB Output is correct
38 Correct 22 ms 41820 KB Output is correct
39 Correct 6 ms 25688 KB Output is correct
40 Correct 6 ms 25688 KB Output is correct
41 Correct 25 ms 42076 KB Output is correct
42 Correct 25 ms 42100 KB Output is correct
43 Correct 6 ms 25944 KB Output is correct
44 Correct 7 ms 25948 KB Output is correct
45 Correct 183 ms 96240 KB Output is correct
46 Correct 319 ms 180924 KB Output is correct
47 Correct 148 ms 71360 KB Output is correct
48 Correct 297 ms 176860 KB Output is correct
49 Correct 173 ms 85184 KB Output is correct
50 Correct 314 ms 176064 KB Output is correct
51 Correct 195 ms 106040 KB Output is correct
52 Correct 52 ms 44480 KB Output is correct
53 Correct 73 ms 50884 KB Output is correct
54 Runtime error 3476 ms 1048576 KB Execution killed with signal 9
55 Halted 0 ms 0 KB -