Submission #301224

#TimeUsernameProblemLanguageResultExecution timeMemory
301224joseacazComparing Plants (IOI20_plants)C++17
0 / 100
4094 ms16484 KiB
#include "plants.h" #include <bits/stdc++.h> #define pb push_back #define all(x) x.begin(), x.end() using namespace std; typedef long long ll; typedef vector<int> vi; const int MAXN = 2e5 + 5; int N, k, vis[MAXN]; vi r, Graph[MAXN]; void sub(int idx) { for(int i = 1; i < k; i++) { int id = ((idx - i)%N + N)%N; if(r[id] > 0) { r[id]--; if(r[id] == 0) Graph[idx].pb(id); } } } int getnext(int idx) { for(int i = 1; i < N; i++) { int id = ((idx + i)%N + N)%N; if(i < k && !vis[id]) Graph[idx].pb(id); if(r[id] == 0 && !vis[id]) return id; } return idx; } void init(int _k, vi _r) { k = _k; swap(r, _r); N = r.size(); int maxIdx = 0; for(int i = 0; i < N; i++) { if(r[i] != 0) continue; int maxim = 1; for(int j = 1; j < k; j++) { int id = ((i - j)%N + N)%N; if(r[id] == 0) maxim = 0; } if(maxim) maxIdx = i; } while(!vis[maxIdx]) { vis[maxIdx] = 1; sub(maxIdx); maxIdx = getnext(maxIdx); } return; } int dfs(int a, int b) { if(a == b) return 1; for(auto i : Graph[a]) if(dfs(i, b)) return 1; return 0; } int compare_plants(int x, int y) { int aux = dfs(x, y), aux2 = dfs(y, x); if(!aux && !aux2) return 0; else if(aux) return 1; else return -1; return 0; }

Compilation message (stderr)

plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:89:5: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
   89 |     else
      |     ^~~~
plants.cpp:91:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
   91 |  return 0;
      |  ^~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...