oj.uz

Submission #1093511

# Submission time Handle Problem Language Result Execution time Memory
1093511 2024-09-27T01:52:00 Z duyhoanho Joker (BOI20_joker) C++14
0 / 100
 1 ms 600 KB 
#include<bits/stdc++.h>
#define int long long
#define forinc(i,a,b) for(int i=a;i<=b;i++)
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
using namespace std;
const int N = 2e3+10;
int n,m,q,fre[N];
bool ok;
pii a[N];
vector<int> ad[N];
void bfs(int x)
{
    queue<int> q;
    fre[x] = 0;
    q.push(x);
    while(q.size())
    {
        int u = q.front();q.pop();
        for(int v : ad[u])
        {
            if(fre[v] == fre[u])
            {
                ok = 1;
                return;
            }
            if(fre[v] != -1) continue;
            fre[v] = 1 - fre[u];
            q.push(v);
        }
    }
}
bool qu(int l,int r)
{
    ok = 0;
    forinc(i,1,m)
    {
        if(l<=i && i<=r) continue;
        int x,y;
        tie(x,y) = a[i];
        ad[x].pb(y);
        ad[y].pb(x);
    }

    for(int i=1;i<=n;i++) fre[i] = -1;
    for(int i=1;i<=n;i++)
    {
        if(fre[i] == -1)
        {
            bfs(i);
            if(ok == 1) return true;
        }
    }
    return false;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>q;
    forinc(i,1,m)
    {
        int x,y;
        cin>>x>>y;
        a[i] = {x,y};
    }
    while(q--)
    {
        int l,r;
        cin>>l>>r;
        cout<< (qu(l,r) ? "YES\n" : "NO\n");
    }


}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 1 ms 600 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -