# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1124487 | lmToT27 | Line Town (CCO23_day1problem3) | C++20 | 17 ms | 836 KiB |
#include <bits/stdc++.h>
#define all(dataStructure) dataStructure.begin(),dataStructure.end()
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 3;
const int inf = 1e9;
const ll MOD[] = {1000000007, 998244353};
int n, h[MAX];
void Solve() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> h[i];
int ans = inf;
for (int negaNums = 0; negaNums <= n; negaNums++) {
deque <int> t0, t1;
for (int i = 1; i <= n; i++) {
if (i & 1) {
if (h[i] == 1) t0.push_back(i);
else t1.push_back(i);
} else {
if (h[i] == -1) t0.push_back(i);
else t1.push_back(i);
}
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |