# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
804799 | mousebeaver | Chorus (JOI23_chorus) | C++14 | 7007 ms | 79488 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.
#define ll long long
#define INF numeric_limits<ll>::max()/2
#include <bits/stdc++.h>
using namespace std;
ll sum(ll l, ll r, vector<ll>& pref)
{
return pref[r] - (l == 0 ? 0 : pref[l-1]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin>>n>>k;
string s;
cin>>s;
vector<ll> a(0);
for(ll i = 0; i < 2*n; i++)
{
if(s[i] == 'A')
{
a.push_back(i+1);
}
}
ll output = 0;
for(ll i = 0; i < n; i++)
{
# | 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... |