# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
488429 | alexander707070 | Floppy (RMI20_floppy) | C++14 | 112 ms | 22196 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>
#include "floppy.h"
using namespace std;
string s;
vector<int> vv;
int num;
struct node{
int num;
int pos;
int sz;
int l;
int r;
};
node tree[80007];
bool li[80007][20];
int dp[80007][20];
int power[20],lg[80007];
void calc(){
power[0]=1;
for(int i=1;i<20;i++)power[i]=power[i-1]*2;
lg[1]=0;
for(int i=2;i<=80000;i++)lg[i]=lg[i/2]+1;
}
int best(int x,int y){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |