# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114938 | AdamGS | JJOOII 2 (JOI20_ho_t2) | C++17 | 1 ms | 336 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;
const int MAX=2*1e5+7;
int kolejnak[MAX];
int kolejnal[MAX];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
string s;
cin >> s;
queue<int> indeksyj;
queue<int> indeksyo;
queue<int> indeksyi;
int ostatnij=n+2, ostatnio=n+2;
for (int i=1; i<=n; i++){
kolejnak[i] = n+1;
kolejnal[i] = n+1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |