# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723354 | drdilyor | Boarding Passes (BOI22_passes) | C++17 | 2058 ms | 377584 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.
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
inline ll exp_inv(ll x) {
return x * (x-1);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
char a = 'A';
string s; cin >> s;
const int G = 15, N = 1e5;
int n = s.size();
if (n == 1) {
cout << "0\n";
return 0;
}
ll suml[G][G][N];
ll sumr[G][G][N];
memset(suml, 0 ,sizeof(suml));
memset(sumr, 0 ,sizeof(sumr));
vector cl(G, vector(n, 0ll));
vector cr(G, vector(n, 0ll));
vector ix(G, vector<int>());
for (int c1 = 0; c1 < G; c1++) {
# | 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... |