# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61754 | gusfring | Rope (JOI17_rope) | C++14 | 55 ms | 26780 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>
using namespace std;
typedef pair<int, int> ii;
const int N = 1000005;
int n, m, cnt[N];
int a[N], res[N];
int val[N];
vector<int> p[N];
int main() {
scanf("%d %d", &n, &m);
if (m == 1 || m > 10){ puts("0"); return 0; }
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]); cnt[a[i]]++, p[a[i]].push_back(i);
}
set<ii> s;
for (int i = 1; i <= m; ++i) s.insert(ii(cnt[i], i));
for (int i = 1; i <= m; ++i) {
res[i] = 1e9;
for (int j = 0; j < 2; ++j) {
vector<int> go;
int sum = 0;
for (int k = 0; k < p[i].size(); ++k) {
if (p[i][k] % 2 == j) {
int cur = a[p[i][k] - 1];
if (p[i][k] > 1 && cur != i) {
if (++val[cur] == 1) go.push_back(cur);
}
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... |