oj.uz

Submission #887457

# Submission time Handle Problem Language Result Execution time Memory
887457 2023-12-14T14:50:40 Z cpptowin Curtains (NOI23_curtains) C++17
100 / 100
 1113 ms 124344 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
vi ke[maxn];
pii query[maxn];
int firstl[maxn],firstr[maxn];
vii adj[maxn];
int ans[maxn];
int n;
void solve(int x,int y)
{
    if(x > y) return;
    fo(i,x,y) firstl[i] = inf,firstr[i] = -inf;
    int mid = (x + y) >> 1;
    stack<pii> st;
    fod(i,mid,x) if(ke[i].size())
    {
        int j = inf,k = -inf;
        for(int it : ke[i])
        {
            if(it < mid) k = max(k,it);
            if(it >= mid)
            {
                j = it;
                break;
            }
        }
        firstl[i] = min(firstl[i],j);
        while(st.size() and st.top().se <= k + 1)
        {
            firstl[i] = min(firstl[i],st.top().fi);
            st.pop();
        }
        st.push({firstl[i],i});
    }
    while(st.size()) st.pop();
    fo(i,min(mid,y),y) if(ke[i].size())
    {
        int j = -inf,k = inf;
        fod(u,(int)ke[i].size() - 1,0)
        {
            if(ke[i][u] > mid) k = min(k,ke[i][u]);
            if(ke[i][u] <= mid)
            {
                j = ke[i][u];
                break;
            }
        }
//        if(x == 5 and y == 5) cout << j << "xxxx\n";
        firstr[i] = max(j,firstr[i]);
        while(st.size() and st.top().se >= k - 1)
        {
            firstr[i] = max(st.top().fi,firstr[i]);
            st.pop();
        }
        st.push({firstr[i],i});
    }
    fo(i,x,mid)
    {
        for(auto [u,id] : adj[i])
        {
            if(u > y) break;
//            if(u <= mid) continue;
            if(firstl[i] <= u and firstr[u] >= i) ans[id] = 1;
        }
    }
//    cout << x << ' ' << y << ' ' << mid << "\n";
//    fo(i,x,y) cout << firstl[i] << ' ';en;
//    fo(i,x,y) cout << firstr[i] << ' ';en;
    if(x == y) return;
    solve(x,mid);
    solve(mid + 1,y);
}
int m,q;
main()
{
#define name "TASK"
    if(fopen(name".inp","r"))
    {
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> q;
    fo(i,1,m)
    {
        int u,v;
        cin >> u >> v;
        ke[u].pb(v);
        ke[v].pb(u);
    }
    fo(i,1,n) sort(ke[i].begin(),ke[i].end());
    fo(i,1,q)
    {
        int u,v;
        cin >> u >> v;
        adj[u].pb(v,i);
        adj[v].pb(u,i);
    }
    fo(i,1,n) sort(adj[i].begin(),adj[i].end());
    solve(1,n);
    fo(i,1,q) cout << (ans[i] ? "YES" : "NO") << "\n";
}

Compilation message

curtains.cpp:109:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  109 | main()
      | ^~~~
curtains.cpp: In function 'int main()':
curtains.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
curtains.cpp:115:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53340 KB Output is correct
2 Correct 12 ms 53524 KB Output is correct
3 Correct 11 ms 53340 KB Output is correct
4 Correct 12 ms 53444 KB Output is correct
5 Correct 11 ms 53340 KB Output is correct
6 Correct 11 ms 53592 KB Output is correct
7 Correct 12 ms 53340 KB Output is correct
8 Correct 11 ms 53588 KB Output is correct
9 Correct 11 ms 53512 KB Output is correct
10 Correct 11 ms 53588 KB Output is correct
11 Correct 11 ms 53440 KB Output is correct
12 Correct 12 ms 53340 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53340 KB Output is correct
2 Correct 12 ms 53524 KB Output is correct
3 Correct 11 ms 53340 KB Output is correct
4 Correct 12 ms 53444 KB Output is correct
5 Correct 11 ms 53340 KB Output is correct
6 Correct 11 ms 53592 KB Output is correct
7 Correct 12 ms 53340 KB Output is correct
8 Correct 11 ms 53588 KB Output is correct
9 Correct 11 ms 53512 KB Output is correct
10 Correct 11 ms 53588 KB Output is correct
11 Correct 11 ms 53440 KB Output is correct
12 Correct 12 ms 53340 KB Output is correct
13 Correct 13 ms 53592 KB Output is correct
14 Correct 14 ms 53596 KB Output is correct
15 Correct 14 ms 53596 KB Output is correct
16 Correct 13 ms 53572 KB Output is correct
17 Correct 13 ms 53592 KB Output is correct
18 Correct 13 ms 53780 KB Output is correct
19 Correct 13 ms 53772 KB Output is correct
20 Correct 13 ms 53596 KB Output is correct
21 Correct 13 ms 53592 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53340 KB Output is correct
2 Correct 12 ms 53524 KB Output is correct
3 Correct 11 ms 53340 KB Output is correct
4 Correct 12 ms 53444 KB Output is correct
5 Correct 11 ms 53340 KB Output is correct
6 Correct 11 ms 53592 KB Output is correct
7 Correct 12 ms 53340 KB Output is correct
8 Correct 11 ms 53588 KB Output is correct
9 Correct 11 ms 53512 KB Output is correct
10 Correct 11 ms 53588 KB Output is correct
11 Correct 11 ms 53440 KB Output is correct
12 Correct 12 ms 53340 KB Output is correct
13 Correct 13 ms 53592 KB Output is correct
14 Correct 14 ms 53596 KB Output is correct
15 Correct 14 ms 53596 KB Output is correct
16 Correct 13 ms 53572 KB Output is correct
17 Correct 13 ms 53592 KB Output is correct
18 Correct 13 ms 53780 KB Output is correct
19 Correct 13 ms 53772 KB Output is correct
20 Correct 13 ms 53596 KB Output is correct
21 Correct 13 ms 53592 KB Output is correct
22 Correct 151 ms 85976 KB Output is correct
23 Correct 150 ms 86808 KB Output is correct
24 Correct 167 ms 89276 KB Output is correct
25 Correct 250 ms 102480 KB Output is correct
26 Correct 149 ms 86352 KB Output is correct
27 Correct 247 ms 101928 KB Output is correct
28 Correct 258 ms 102656 KB Output is correct
29 Correct 157 ms 87100 KB Output is correct
30 Correct 152 ms 83408 KB Output is correct
31 Correct 160 ms 84732 KB Output is correct
32 Correct 257 ms 98332 KB Output is correct
33 Correct 152 ms 83500 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 53340 KB Output is correct
2 Correct 11 ms 53340 KB Output is correct
3 Correct 11 ms 53336 KB Output is correct
4 Correct 11 ms 53468 KB Output is correct
5 Correct 13 ms 53596 KB Output is correct
6 Correct 13 ms 53596 KB Output is correct
7 Correct 13 ms 53596 KB Output is correct
8 Correct 151 ms 80244 KB Output is correct
9 Correct 169 ms 81456 KB Output is correct
10 Correct 248 ms 90860 KB Output is correct
11 Correct 156 ms 80220 KB Output is correct
12 Correct 120 ms 66172 KB Output is correct
13 Correct 117 ms 66236 KB Output is correct
14 Correct 121 ms 63936 KB Output is correct
15 Correct 124 ms 65776 KB Output is correct
16 Correct 121 ms 63932 KB Output is correct
17 Correct 121 ms 65888 KB Output is correct
18 Correct 809 ms 108052 KB Output is correct
19 Correct 786 ms 108464 KB Output is correct
20 Correct 799 ms 107864 KB Output is correct
21 Correct 783 ms 103592 KB Output is correct
22 Correct 834 ms 105368 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53340 KB Output is correct
2 Correct 12 ms 53524 KB Output is correct
3 Correct 11 ms 53340 KB Output is correct
4 Correct 12 ms 53444 KB Output is correct
5 Correct 11 ms 53340 KB Output is correct
6 Correct 11 ms 53592 KB Output is correct
7 Correct 12 ms 53340 KB Output is correct
8 Correct 11 ms 53588 KB Output is correct
9 Correct 11 ms 53512 KB Output is correct
10 Correct 11 ms 53588 KB Output is correct
11 Correct 11 ms 53440 KB Output is correct
12 Correct 12 ms 53340 KB Output is correct
13 Correct 13 ms 53592 KB Output is correct
14 Correct 14 ms 53596 KB Output is correct
15 Correct 14 ms 53596 KB Output is correct
16 Correct 13 ms 53572 KB Output is correct
17 Correct 13 ms 53592 KB Output is correct
18 Correct 13 ms 53780 KB Output is correct
19 Correct 13 ms 53772 KB Output is correct
20 Correct 13 ms 53596 KB Output is correct
21 Correct 13 ms 53592 KB Output is correct
22 Correct 72 ms 67968 KB Output is correct
23 Correct 69 ms 67832 KB Output is correct
24 Correct 131 ms 68924 KB Output is correct
25 Correct 128 ms 69032 KB Output is correct
26 Correct 111 ms 68692 KB Output is correct
27 Correct 112 ms 68564 KB Output is correct
28 Correct 109 ms 67552 KB Output is correct
29 Correct 107 ms 68176 KB Output is correct
30 Correct 135 ms 69068 KB Output is correct
31 Correct 134 ms 69100 KB Output is correct
32 Correct 133 ms 68692 KB Output is correct
33 Correct 128 ms 68688 KB Output is correct
34 Correct 123 ms 68436 KB Output is correct
35 Correct 123 ms 68564 KB Output is correct
36 Correct 119 ms 68432 KB Output is correct
37 Correct 122 ms 68096 KB Output is correct
38 Correct 127 ms 68244 KB Output is correct
39 Correct 122 ms 65852 KB Output is correct
40 Correct 121 ms 67780 KB Output is correct
41 Correct 121 ms 65844 KB Output is correct
42 Correct 126 ms 67840 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 53340 KB Output is correct
2 Correct 12 ms 53524 KB Output is correct
3 Correct 11 ms 53340 KB Output is correct
4 Correct 12 ms 53444 KB Output is correct
5 Correct 11 ms 53340 KB Output is correct
6 Correct 11 ms 53592 KB Output is correct
7 Correct 12 ms 53340 KB Output is correct
8 Correct 11 ms 53588 KB Output is correct
9 Correct 11 ms 53512 KB Output is correct
10 Correct 11 ms 53588 KB Output is correct
11 Correct 11 ms 53440 KB Output is correct
12 Correct 12 ms 53340 KB Output is correct
13 Correct 13 ms 53592 KB Output is correct
14 Correct 14 ms 53596 KB Output is correct
15 Correct 14 ms 53596 KB Output is correct
16 Correct 13 ms 53572 KB Output is correct
17 Correct 13 ms 53592 KB Output is correct
18 Correct 13 ms 53780 KB Output is correct
19 Correct 13 ms 53772 KB Output is correct
20 Correct 13 ms 53596 KB Output is correct
21 Correct 13 ms 53592 KB Output is correct
22 Correct 151 ms 85976 KB Output is correct
23 Correct 150 ms 86808 KB Output is correct
24 Correct 167 ms 89276 KB Output is correct
25 Correct 250 ms 102480 KB Output is correct
26 Correct 149 ms 86352 KB Output is correct
27 Correct 247 ms 101928 KB Output is correct
28 Correct 258 ms 102656 KB Output is correct
29 Correct 157 ms 87100 KB Output is correct
30 Correct 152 ms 83408 KB Output is correct
31 Correct 160 ms 84732 KB Output is correct
32 Correct 257 ms 98332 KB Output is correct
33 Correct 152 ms 83500 KB Output is correct
34 Correct 11 ms 53340 KB Output is correct
35 Correct 11 ms 53340 KB Output is correct
36 Correct 11 ms 53336 KB Output is correct
37 Correct 11 ms 53468 KB Output is correct
38 Correct 13 ms 53596 KB Output is correct
39 Correct 13 ms 53596 KB Output is correct
40 Correct 13 ms 53596 KB Output is correct
41 Correct 151 ms 80244 KB Output is correct
42 Correct 169 ms 81456 KB Output is correct
43 Correct 248 ms 90860 KB Output is correct
44 Correct 156 ms 80220 KB Output is correct
45 Correct 120 ms 66172 KB Output is correct
46 Correct 117 ms 66236 KB Output is correct
47 Correct 121 ms 63936 KB Output is correct
48 Correct 124 ms 65776 KB Output is correct
49 Correct 121 ms 63932 KB Output is correct
50 Correct 121 ms 65888 KB Output is correct
51 Correct 809 ms 108052 KB Output is correct
52 Correct 786 ms 108464 KB Output is correct
53 Correct 799 ms 107864 KB Output is correct
54 Correct 783 ms 103592 KB Output is correct
55 Correct 834 ms 105368 KB Output is correct
56 Correct 72 ms 67968 KB Output is correct
57 Correct 69 ms 67832 KB Output is correct
58 Correct 131 ms 68924 KB Output is correct
59 Correct 128 ms 69032 KB Output is correct
60 Correct 111 ms 68692 KB Output is correct
61 Correct 112 ms 68564 KB Output is correct
62 Correct 109 ms 67552 KB Output is correct
63 Correct 107 ms 68176 KB Output is correct
64 Correct 135 ms 69068 KB Output is correct
65 Correct 134 ms 69100 KB Output is correct
66 Correct 133 ms 68692 KB Output is correct
67 Correct 128 ms 68688 KB Output is correct
68 Correct 123 ms 68436 KB Output is correct
69 Correct 123 ms 68564 KB Output is correct
70 Correct 119 ms 68432 KB Output is correct
71 Correct 122 ms 68096 KB Output is correct
72 Correct 127 ms 68244 KB Output is correct
73 Correct 122 ms 65852 KB Output is correct
74 Correct 121 ms 67780 KB Output is correct
75 Correct 121 ms 65844 KB Output is correct
76 Correct 126 ms 67840 KB Output is correct
77 Correct 935 ms 123700 KB Output is correct
78 Correct 940 ms 124344 KB Output is correct
79 Correct 848 ms 122592 KB Output is correct
80 Correct 905 ms 122660 KB Output is correct
81 Correct 882 ms 121952 KB Output is correct
82 Correct 871 ms 121748 KB Output is correct
83 Correct 960 ms 124032 KB Output is correct
84 Correct 962 ms 123916 KB Output is correct
85 Correct 1113 ms 123324 KB Output is correct
86 Correct 929 ms 120368 KB Output is correct
87 Correct 819 ms 120784 KB Output is correct
88 Correct 892 ms 121892 KB Output is correct