답안 #1075798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1075798	2024-08-26T09:13:33 Z	alexdd	Gap (APIO16_gap)	C++17	12.5315 / 100	40 ms	1220 KB

gap

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
pair<int,int> qry(int le, int ri)
{
    pair<int,int> aux;
    MinMax(le,ri,&aux.first,&aux.second);
    return aux;
}
long long findGap(int32_t T, int32_t N)
{
    int rez=1;
    pair<int,int> tot = qry(0,INF);
    int cur=tot.first;
    while(tot.second - cur > rez)
    {
        pair<int,int> aux = qry(cur+1,cur+rez);
        if(aux.first!=-1)
        {
            cur = aux.second;
            continue;
        }
        int c=rez;
        while(1)
        {
            aux = qry(cur+1,cur+rez+c);
            if(aux.first!=-1)
            {
                rez = max(rez, aux.first - cur);
                cur = aux.second;
                break;
            }
            c=c*2;
        }
    }
    return rez;
}

Subtask #1

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 KB	Output isn't correct
2	Incorrect	0 ms	344 KB	Output isn't correct
3	Incorrect	0 ms	344 KB	Output isn't correct
4	Incorrect	1 ms	344 KB	Output isn't correct
5	Incorrect	0 ms	344 KB	Output isn't correct
6	Incorrect	0 ms	344 KB	Output isn't correct
7	Incorrect	0 ms	344 KB	Output isn't correct
8	Incorrect	0 ms	344 KB	Output isn't correct
9	Incorrect	0 ms	344 KB	Output isn't correct
10	Incorrect	1 ms	344 KB	Output isn't correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Incorrect	1 ms	344 KB	Output isn't correct
16	Correct	5 ms	600 KB	Output is correct
17	Correct	7 ms	600 KB	Output is correct
18	Correct	5 ms	616 KB	Output is correct
19	Correct	5 ms	600 KB	Output is correct
20	Correct	4 ms	596 KB	Output is correct
21	Correct	27 ms	1176 KB	Output is correct
22	Correct	17 ms	1112 KB	Output is correct
23	Correct	26 ms	1112 KB	Output is correct
24	Correct	19 ms	1112 KB	Output is correct
25	Incorrect	34 ms	1220 KB	Output isn't correct
26	Correct	16 ms	1112 KB	Output is correct
27	Correct	19 ms	1112 KB	Output is correct
28	Correct	25 ms	1040 KB	Output is correct
29	Correct	25 ms	1108 KB	Output is correct
30	Correct	21 ms	1112 KB	Output is correct
31	Incorrect	0 ms	344 KB	Output isn't correct
32	Incorrect	0 ms	344 KB	Output isn't correct

Subtask #2

12.5315417564 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	344 KB	Partially correct
2	Partially correct	0 ms	344 KB	Partially correct
3	Partially correct	0 ms	344 KB	Partially correct
4	Partially correct	0 ms	344 KB	Partially correct
5	Partially correct	1 ms	344 KB	Partially correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Partially correct	1 ms	344 KB	Partially correct
16	Correct	5 ms	600 KB	Output is correct
17	Correct	7 ms	552 KB	Output is correct
18	Correct	8 ms	600 KB	Output is correct
19	Correct	5 ms	596 KB	Output is correct
20	Correct	4 ms	648 KB	Output is correct
21	Correct	19 ms	1216 KB	Output is correct
22	Correct	24 ms	1112 KB	Output is correct
23	Correct	17 ms	1112 KB	Output is correct
24	Correct	17 ms	1112 KB	Output is correct
25	Partially correct	40 ms	1112 KB	Partially correct
26	Correct	27 ms	1112 KB	Output is correct
27	Correct	25 ms	1112 KB	Output is correct
28	Correct	21 ms	1112 KB	Output is correct
29	Correct	26 ms	1080 KB	Output is correct
30	Correct	22 ms	1112 KB	Output is correct
31	Partially correct	1 ms	344 KB	Partially correct
32	Correct	0 ms	344 KB	Output is correct