oj.uz

Submission #86625

# Submission time Handle Problem Language Result Execution time Memory
86625 2018-11-27T04:05:38 Z dimash241 Potemkin cycle (CEOI15_indcyc) C++17
30 / 100
 1000 ms 37456 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
vector < int > g[N];
vector < int > gr[N];
int has[5050][5050];
int x[N], y[N];
int p[N], pos[N];
int dp[N][5];

int main () {               
    cin >> n >> m ;
    For (i, 1, m) {
    	cin >> x[i] >> y[i];
    	g[x[i]].pb(y[i]);
    	g[y[i]].pb(x[i]);
    	has[x[i]][y[i]] = has[y[i]][x[i]] = 1;
    }

    For (i, 1, m) {
    	for (auto l : g[x[i]]) {
    		if (l == y[i]) continue;
    		for (auto r : g[y[i]]) {
    			if (r == x[i]) continue;
    			if (!has[l][y[i]] && !has[r][x[i]] && has[l][r]) {
    				cout << l << ' ' << x[i] << ' ' << y[i] << ' ' << r;
    				exit(0);
    			}
    		}
    	}
    }

    cout << "no";
    exit(0);
    For (i, 1, n) p[i] = i;

    for (int i = 1; i <= 100; i ++) {
    	For (i, 1, n) pos[p[i]] = i, gr[i].clear();
    	For (i, 1, m) {
    		if (pos[x[i]] > pos[y[i]])
    			gr[x[i]].pb(y[i]);
    		else
    			gr[y[i]].pb(x[i]);
    	}



    	random_shuffle(p + 1, p + n + 1);
    }

    cout << "no";
    return Accepted;
}

// Coded By OB

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28508 KB Output is correct
2 Correct 27 ms 28704 KB Output is correct
3 Correct 27 ms 28704 KB Output is correct
4 Correct 29 ms 28704 KB Output is correct
5 Correct 28 ms 28704 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28704 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 28768 KB Output is correct
2 Correct 27 ms 28768 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 29092 KB Expected integer, but "no" found

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 29092 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 35 ms 30244 KB Output is correct
2 Incorrect 33 ms 30244 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 47 ms 30372 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 37456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 37456 KB Time limit exceeded
2 Halted 0 ms 0 KB -