# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291566 | kingfran1907 | Trobojnica (COCI19_trobojnica) | C++14 | 61 ms | 7900 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>
#define X first
#define Y second
using namespace std;
typedef long long llint;
const int maxn = 2e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 20;
const int off = 1 << logo;
const int treesiz = off << 1;
int n;
char niz[maxn];
int cl[maxn], cnt[10];
int nx[maxn];
vector< int > x, y, s;
int main() {
scanf("%d%s", &n, niz);
for (int i = 0; i < n; i++) {
cl[i] = niz[i] - '1';
cnt[cl[i]]++, nx[i] = (i + 1) % n;
}
int tren = 0;
for (int i = 0; i < n - 3; 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... |