# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598527 | SuffixAutomata | Art Collections (BOI22_art) | C++17 | 1530 ms | 712 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 "art.h"
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
// art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click
// onto an empty spot in the directory, left click on "Open in terminal") and
// enter e.g.:
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which
// you can execute from the terminal as ./a.out See task statement or
// sample_grader.cpp for the input specification
//
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> cur;
for (int i = 1; i <= N; i++)
cur.push_back(i);
int s = publish(cur), ps = 0;
vector<int> ii(N + 1);
ii[N] = s;
for (int i = 1; i <= N - 1; i++) {
vector<int> x = cur;
reverse(x.begin() + i, x.end());
int q = publish(x);
int d = s + q - (N - i) * (N - i - 1) / 2;
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... |