# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159182 | Bilyana | Arranging Shoes (IOI19_shoes) | C++17 | 214 ms | 138464 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<iostream>
#include<queue>
#include<cmath>
using namespace std;
const long long MAXN = 100000;
long long n, to[MAXN+10];
queue<long long> bs[MAXN+10];
long long counter=0;
/*void input()
{
long long temp;
cin>>n;
for (long long i=0; i<2*n; i++)
{
cin>>temp;
s.push_back(temp);
}
}*/
void output()
{
cout<<counter<<endl;
}
void find_place(vector<int> S)
{
long long curr = 0;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |