Submission #303255

#TimeUsernameProblemLanguageResultExecution timeMemory
303255Kevin_Zhang_TWComparing Plants (IOI20_plants)C++17
0 / 100
2 ms512 KiB
#include "plants.h" #include<bits/stdc++.h> #define pb emplace_back using namespace std; using ll = long long; #ifdef KEV #define DE(a, b) cerr << #a << ' ' << a << b void debug(auto L, auto R) { while (L != R) cerr << *L << " \n"[L+1==R], ++L; } #else #define DE(...) 0 void debug(...) {} #endif const int maxn = 300010; int nxt[maxn], n, r[maxn], k; int F(int i) { return i % n; } void init(int k, std::vector<int> r) { ::k = k; n = r.size(); copy(r.begin(), r.end(), ::r); return; } int compare_plants(int x, int y) { assert(k == 2); if (F(x+1) == y) return (r[x] ? -1 : 1); if (F(y+1) == x) return (r[y] ? 1 : -1); return 0; }

Compilation message (stderr)

plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:29:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   29 |     if (F(y+1) == x)
      |     ^~
plants.cpp:32:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   32 |  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...