# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226518 | Ruxandra985 | Rope (JOI17_rope) | C++14 | 2590 ms | 12684 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;
int v[1000010] , f[1000010] , sol[1000010] , w[1000010];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , m , i , j , curr , fmax , maxi , first;
fscanf (fin,"%d%d",&n,&m);
for (i = 1 ; i <= n ; i++){
fscanf (fin,"%d",&v[i]);
}
for (i = 1 ; i <= m ; i++)
sol[i] = 2000000000 * (m != 1);
for (i = 1 ; i <= m ; i++){
//if (i == 9)
// printf ("a");
curr = 0;
maxi = 0;
fmax = 0;
first = 0;
memset (f , 0 , sizeof(f));
/// cazul 1 : mereu 2k = 2k - 1
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |