제출 #823315

#제출 시각아이디문제언어결과실행 시간메모리
823315Sohsoh84식물 비교 (IOI20_plants)C++17
0 / 100
40 ms3020 KiB
#include "plants.h" #include <bits/stdc++.h> using namespace std; #define debug(x) cerr << #x << ": " << x << endl; #define sep ' ' void add(int u, int v); const int MAXN = 4e5 + 10; int R[MAXN], n, k, L[MAXN]; void init(int k_, std::vector<int> r) { k = k_; n = r.size(); for (int i = 0; i < n; i++) R[i] = r[i]; L[n - 1] = 1; for (int i = n - 2; i >= 0; i--) L[i] = (R[i] == R[i + 1] ? L[i + 1] + 1 : 1); } int compare_plants(int x, int y) { if (R[x] < R[y]) return 1; if (R[x] > R[y]) return -1; 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...