# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470172 | radal | Watermelon (INOI20_watermelon) | C++14 | 2107 ms | 743248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define rep(i,l,r) for (int i = l; i < r; i++)
#define pb push_back
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
const ll N = 1e5+20;
int b[N];
int n,k;
int vis[N],din[N],a[N];
bool fl[N];
vector<int> in[N],out[N];
bool dfs(int v){
vis[v] = 1;
for (int u : out[v]){
if(vis[u] == 1) return 0;
if (!vis[u] && !dfs(u)) return 0;
}
vis[v] = 2;
return 1;
}
int main(){
ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
rep(i,1,n+1) cin >> b[i];
if (b[n] != -1){
cout << -1;
return 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |