# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
746271 | baluteshih | Chorus (JOI23_chorus) | C++14 | 95 ms | 10136 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 long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back
struct node {
int first, sz;
ll sum;
};
int lft[1000005];
list<node>::iterator arr[1000005];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, k;
long long ans = 0;
string s;
cin >> n >> k >> s;
if (n > 500) return 0;
vector<int> plA, plB;
for (int i = 0; i < n + n; ++i) {
if (s[i] == 'B')
# | 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... |