oj.uz

Submission #1069266

# Submission time Handle Problem Language Result Execution time Memory
1069266 2024-08-21T18:33:57 Z vjudge1 Potemkin cycle (CEOI15_indcyc) C++17
10 / 100
 9 ms 456 KB 
#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef pair<char, int> ci;
typedef pair<string, int> si;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
#define pb push_back
#define fi first
#define se second
#define whole(v) v.begin(), v.end()
#define rwhole(v) v.rbegin(), v.rend()
#define inf INT_MAX/2
#define fro front

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, r; cin >> n >> r;
    vector<ii> x(n+1, ii(inf, -1));
    for(int i = 0; i < r; ++i){
        int a, b; cin >> a >> b;
        if(b < a){
            swap(a, b);
        }
        if(b == a+1){
            x[a].se = 1;
        }else if(b < x[a].fi){
            x[a].fi = b;
        }
    }
    vector<int> ans;
    for(int i = 1; i <= n; ++i){
        int target = x[i].fi;
        ans.clear();
        if(target - i < 3 || target == inf){
            continue;
        }
        if(x[i].se == -1){
            continue;
        }
        int j = i+1;
        ans.pb(i);
        while(j != target){
            if(x[j].fi <= target){
                ans.clear();
                j = target-1;
            }
            if(x[j].se == -1){
                ans.clear();
                j = target-1;
            }
            ans.pb(j);
            j++;
        }
        ans.pb(target);
        if((int)ans.size() >= 4){
            break;
        }
    }
    if((int)ans.size() < 4){
        cout << "no" << endl;
    }else{
        for(auto e:ans){
            cout << e << " ";
        }
        cout << endl;
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Expected integer, but "no" found
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 348 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 456 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -