oj.uz

답안 #851532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851532 2023-09-20T04:39:18 Z bachhoangxuan Alternating Heights (CCO22_day1problem1) C++17
25 / 25
 358 ms 49064 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int mod=998244353;
const int maxn=3005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
const int base=101;

vector<pii> edge[maxn];
int n,k,q,rt[maxn],a[maxn],dist[maxn];
int res[maxn][maxn];


void solve(){
    cin >> n >> k >> q;
    for(int i=1;i<=n;i++) cin >> a[i];
    rt[n]=n+1;
    for(int i=n-1;i>=1;i--){
        if(i&1) edge[a[i]].push_back({a[i+1],i});
        else edge[a[i+1]].push_back({a[i],i});
        priority_queue<pii,vector<pii>,greater<pii>> pq;
        for(int u=1;u<=k;u++) dist[u]=n;
        rt[i]=n+1;dist[a[i]]=0;pq.push({0,a[i]});
        while(!pq.empty()){
            auto [d,u]=pq.top();pq.pop();
            if(d>rt[i]) break;
            if(d!=dist[u]) continue;
            for(auto [v,w]:edge[u]){
                int nxt=max(d,w);
                if(nxt<dist[v]){
                    dist[v]=nxt;
                    pq.push({nxt,v});
                }
                else if(v==a[i]) rt[i]=min(rt[i],nxt+1);
            }
        }
    }
    for(int i=1;i<=n;i++){
        res[i][i]=rt[i];
        for(int j=i+1;j<=n;j++) res[i][j]=min(res[i][j-1],rt[j]);
    }
    for(int i=1;i<=q;i++){
        int x,y;cin >> x >> y;
        cout << (res[x][y]<=y?"NO\n":"YES\n");
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 38548 KB Output is correct
2 Correct 214 ms 47952 KB Output is correct
3 Correct 242 ms 48208 KB Output is correct
4 Correct 103 ms 7292 KB Output is correct
5 Correct 118 ms 11424 KB Output is correct
6 Correct 228 ms 48228 KB Output is correct
7 Correct 237 ms 47976 KB Output is correct
8 Correct 253 ms 47980 KB Output is correct
9 Correct 268 ms 47996 KB Output is correct
10 Correct 258 ms 48412 KB Output is correct
11 Correct 358 ms 48976 KB Output is correct
12 Correct 285 ms 48316 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 9888 KB Output is correct
2 Correct 122 ms 17488 KB Output is correct
3 Correct 125 ms 17212 KB Output is correct
4 Correct 98 ms 8272 KB Output is correct
5 Correct 116 ms 11680 KB Output is correct
6 Correct 115 ms 17232 KB Output is correct
7 Correct 122 ms 17744 KB Output is correct
8 Correct 122 ms 17400 KB Output is correct
9 Correct 132 ms 17988 KB Output is correct
10 Correct 116 ms 18252 KB Output is correct
11 Correct 120 ms 18304 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 17 ms 35672 KB Output is correct
3 Correct 18 ms 35676 KB Output is correct
4 Correct 45 ms 35668 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 40 ms 35664 KB Output is correct
8 Correct 13 ms 35672 KB Output is correct
9 Correct 12 ms 35676 KB Output is correct
10 Correct 11 ms 35672 KB Output is correct
11 Correct 13 ms 35672 KB Output is correct
12 Correct 13 ms 35672 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 38548 KB Output is correct
2 Correct 214 ms 47952 KB Output is correct
3 Correct 242 ms 48208 KB Output is correct
4 Correct 103 ms 7292 KB Output is correct
5 Correct 118 ms 11424 KB Output is correct
6 Correct 228 ms 48228 KB Output is correct
7 Correct 237 ms 47976 KB Output is correct
8 Correct 253 ms 47980 KB Output is correct
9 Correct 268 ms 47996 KB Output is correct
10 Correct 258 ms 48412 KB Output is correct
11 Correct 358 ms 48976 KB Output is correct
12 Correct 285 ms 48316 KB Output is correct
13 Correct 121 ms 9888 KB Output is correct
14 Correct 122 ms 17488 KB Output is correct
15 Correct 125 ms 17212 KB Output is correct
16 Correct 98 ms 8272 KB Output is correct
17 Correct 116 ms 11680 KB Output is correct
18 Correct 115 ms 17232 KB Output is correct
19 Correct 122 ms 17744 KB Output is correct
20 Correct 122 ms 17400 KB Output is correct
21 Correct 132 ms 17988 KB Output is correct
22 Correct 116 ms 18252 KB Output is correct
23 Correct 120 ms 18304 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 17 ms 35672 KB Output is correct
27 Correct 18 ms 35676 KB Output is correct
28 Correct 45 ms 35668 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 2648 KB Output is correct
31 Correct 40 ms 35664 KB Output is correct
32 Correct 13 ms 35672 KB Output is correct
33 Correct 12 ms 35676 KB Output is correct
34 Correct 11 ms 35672 KB Output is correct
35 Correct 13 ms 35672 KB Output is correct
36 Correct 13 ms 35672 KB Output is correct
37 Correct 184 ms 48724 KB Output is correct
38 Correct 198 ms 48464 KB Output is correct
39 Correct 222 ms 47956 KB Output is correct
40 Correct 97 ms 8272 KB Output is correct
41 Correct 111 ms 11824 KB Output is correct
42 Correct 208 ms 48976 KB Output is correct
43 Correct 192 ms 48976 KB Output is correct
44 Correct 219 ms 48652 KB Output is correct
45 Correct 206 ms 48860 KB Output is correct
46 Correct 190 ms 49064 KB Output is correct
47 Correct 197 ms 48940 KB Output is correct