oj.uz

Submission #971372

# Submission time Handle Problem Language Result Execution time Memory
971372 2024-04-28T12:14:04 Z KiaRez Alternating Heights (CCO22_day1problem1) C++17
25 / 25
 275 ms 24276 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, k, q, a[N], deg[N], ptr, res[N];
vector<int> adj[N];

bool check(int x, int y) {
    int wh = 0;
    for(int i=x; i<y; i++) {
        if(wh == 0) deg[a[i]]++, adj[a[i+1]].pb(a[i]);
        else deg[a[i+1]]++, adj[a[i]].pb(a[i+1]);
        wh^=1;
    }
    queue<int> qu;
    for(int i=1; i<=k; i++) if(deg[i] == 0) qu.push(i);
    int cnt = 0;
    while(size(qu) > 0) {
        int v = qu.front(); qu.pop(); cnt++;
        for(auto it : adj[v]) {
            deg[it] --;
            if(deg[it] == 0) qu.push(it);
        }
    }
    for(int i=1; i<=k; i++) {
        deg[i]=0; adj[i].clear();
    }
    return (cnt == k);
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n>>k>>q;
    for(int i=1; i<=n; i++) cin>>a[i];
    ptr=1;
    for(int i=1; i<=n; i++) {
        while(check(ptr, i) == 0) ptr++;
        res[i] = ptr;
    }

    while(q--) {
        int x,y; cin>>x>>y;
        if(res[y] <= x) cout<<"YES\n";
        else cout<<"NO\n";
    }

	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 23120 KB Output is correct
2 Correct 138 ms 23120 KB Output is correct
3 Correct 124 ms 23120 KB Output is correct
4 Correct 93 ms 17748 KB Output is correct
5 Correct 110 ms 19796 KB Output is correct
6 Correct 124 ms 23052 KB Output is correct
7 Correct 128 ms 23220 KB Output is correct
8 Correct 133 ms 23160 KB Output is correct
9 Correct 129 ms 23376 KB Output is correct
10 Correct 148 ms 23636 KB Output is correct
11 Correct 144 ms 24260 KB Output is correct
12 Correct 157 ms 23636 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 21332 KB Output is correct
2 Correct 115 ms 21576 KB Output is correct
3 Correct 119 ms 21488 KB Output is correct
4 Correct 96 ms 18688 KB Output is correct
5 Correct 111 ms 19792 KB Output is correct
6 Correct 119 ms 21332 KB Output is correct
7 Correct 120 ms 21548 KB Output is correct
8 Correct 118 ms 21396 KB Output is correct
9 Correct 123 ms 21740 KB Output is correct
10 Correct 120 ms 22496 KB Output is correct
11 Correct 117 ms 22476 KB Output is correct
12 Correct 2 ms 10844 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 139 ms 10968 KB Output is correct
3 Correct 135 ms 10840 KB Output is correct
4 Correct 3 ms 10840 KB Output is correct
5 Correct 3 ms 10840 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 84 ms 10960 KB Output is correct
8 Correct 122 ms 11236 KB Output is correct
9 Correct 143 ms 10948 KB Output is correct
10 Correct 68 ms 10840 KB Output is correct
11 Correct 92 ms 10960 KB Output is correct
12 Correct 53 ms 10840 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 23120 KB Output is correct
2 Correct 138 ms 23120 KB Output is correct
3 Correct 124 ms 23120 KB Output is correct
4 Correct 93 ms 17748 KB Output is correct
5 Correct 110 ms 19796 KB Output is correct
6 Correct 124 ms 23052 KB Output is correct
7 Correct 128 ms 23220 KB Output is correct
8 Correct 133 ms 23160 KB Output is correct
9 Correct 129 ms 23376 KB Output is correct
10 Correct 148 ms 23636 KB Output is correct
11 Correct 144 ms 24260 KB Output is correct
12 Correct 157 ms 23636 KB Output is correct
13 Correct 117 ms 21332 KB Output is correct
14 Correct 115 ms 21576 KB Output is correct
15 Correct 119 ms 21488 KB Output is correct
16 Correct 96 ms 18688 KB Output is correct
17 Correct 111 ms 19792 KB Output is correct
18 Correct 119 ms 21332 KB Output is correct
19 Correct 120 ms 21548 KB Output is correct
20 Correct 118 ms 21396 KB Output is correct
21 Correct 123 ms 21740 KB Output is correct
22 Correct 120 ms 22496 KB Output is correct
23 Correct 117 ms 22476 KB Output is correct
24 Correct 2 ms 10844 KB Output is correct
25 Correct 2 ms 10844 KB Output is correct
26 Correct 139 ms 10968 KB Output is correct
27 Correct 135 ms 10840 KB Output is correct
28 Correct 3 ms 10840 KB Output is correct
29 Correct 3 ms 10840 KB Output is correct
30 Correct 2 ms 10844 KB Output is correct
31 Correct 84 ms 10960 KB Output is correct
32 Correct 122 ms 11236 KB Output is correct
33 Correct 143 ms 10948 KB Output is correct
34 Correct 68 ms 10840 KB Output is correct
35 Correct 92 ms 10960 KB Output is correct
36 Correct 53 ms 10840 KB Output is correct
37 Correct 258 ms 23836 KB Output is correct
38 Correct 275 ms 23964 KB Output is correct
39 Correct 127 ms 23240 KB Output is correct
40 Correct 94 ms 18768 KB Output is correct
41 Correct 108 ms 20264 KB Output is correct
42 Correct 226 ms 23636 KB Output is correct
43 Correct 218 ms 24020 KB Output is correct
44 Correct 170 ms 23892 KB Output is correct
45 Correct 206 ms 24144 KB Output is correct
46 Correct 199 ms 24184 KB Output is correct
47 Correct 209 ms 24276 KB Output is correct