oj.uz

Submission #648578

# Submission time Handle Problem Language Result Execution time Memory
648578 2022-10-07T06:00:14 Z mychecksedad Joker (BOI20_joker) C++17
0 / 100
 2000 ms 36536 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;


int n, m, q, pos[N];
bool ok;
vector<int> g[N], path;
vector<bool> vis;
void dfs(int v, int p){
    vis[v] = 1;
    path.pb(v);
    pos[v] = path.size();
    for(int u: g[v]){
        if(u != p){
            if(vis[u]){
                if(pos[v] % 2 == pos[u] % 2){
                    ok = 1;
                }
            }
            else
                dfs(u, v);
        }
    }
    path.pop_back();
}
void solve(){
    cin >> n >> m >> q;
    for(int i = 0; i < m; ++i){
        int u, v; cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    for(int i = 0; i < q; ++i){
        int l, r; cin >> l >> r;
        vis.clear();
        vis.resize(n+1);
        ok = 0;
        for(int v = 1; v <= n; ++v) if(!vis[i]) dfs(i, i);
        if(ok) cout << "YES\n";
        else cout << "NO\n";
    }
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

Joker.cpp: In function 'int main()':
Joker.cpp:64:16: warning: unused variable 'aa' [-Wunused-variable]
   64 |     int T = 1, aa;
      |                ^~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23744 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23744 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Execution timed out 2061 ms 36536 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23744 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23744 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23744 KB Output is correct
4 Incorrect 12 ms 23764 KB Output isn't correct
5 Halted 0 ms 0 KB -