답안 #1003701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003701	2024-06-20T15:50:09 Z	MarwenElarbi	Gap (APIO16_gap)	C++17	0 / 100	36 ms	1208 KB

gap

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=2e3+5;
void MinMax(long long, long long, long long*, long long*);
long long findGap(int T, int N)
{
    long long lst,mx;
    MinMax(0,1e18,&lst,&mx);
    long long ans=1;
    while(mx!=lst){
        long long a,b;
        MinMax(lst+1,lst+ans,&a,&b);
        if(a==-1){
            while(a==-1){
                ans*=2;
                MinMax(lst+1,lst+ans,&a,&b);
            }
            long long cur=lst+ans;
            ans=a-lst;
            lst=cur;
        }else{
            lst=b;
        }
    }
    return ans;
}

Subtask #1

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	0 ms	344 KB	Execution failed because the return code was nonzero
2	Incorrect	0 ms	344 KB	Output isn't correct
3	Incorrect	0 ms	344 KB	Output isn't correct
4	Runtime error	0 ms	344 KB	Execution failed because the return code was nonzero
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	1 ms	344 KB	Output isn't correct
9	Incorrect	0 ms	344 KB	Output isn't correct
10	Incorrect	0 ms	344 KB	Output isn't correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	472 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Incorrect	1 ms	344 KB	Output isn't correct
16	Correct	4 ms	660 KB	Output is correct
17	Correct	4 ms	600 KB	Output is correct
18	Correct	5 ms	600 KB	Output is correct
19	Correct	5 ms	600 KB	Output is correct
20	Incorrect	4 ms	600 KB	Output isn't correct
21	Correct	16 ms	1112 KB	Output is correct
22	Correct	19 ms	1112 KB	Output is correct
23	Correct	14 ms	1112 KB	Output is correct
24	Correct	15 ms	1132 KB	Output is correct
25	Incorrect	36 ms	1112 KB	Output isn't correct
26	Correct	16 ms	1084 KB	Output is correct
27	Correct	16 ms	1112 KB	Output is correct
28	Correct	24 ms	1112 KB	Output is correct
29	Correct	17 ms	1112 KB	Output is correct
30	Incorrect	14 ms	1112 KB	Output isn't correct
31	Runtime error	0 ms	344 KB	Execution failed because the return code was nonzero
32	Incorrect	1 ms	344 KB	Output isn't correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	0 ms	344 KB	Execution failed because the return code was nonzero
2	Partially correct	0 ms	344 KB	Partially correct
3	Runtime error	0 ms	344 KB	Execution failed because the return code was nonzero
4	Incorrect	0 ms	344 KB	Output isn't correct
5	Partially correct	0 ms	344 KB	Partially correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Runtime error	1 ms	344 KB	Execution failed because the return code was nonzero
10	Incorrect	0 ms	344 KB	Output isn't correct
11	Correct	0 ms	356 KB	Output is correct
12	Correct	0 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	Partially correct	1 ms	344 KB	Partially correct
16	Correct	4 ms	600 KB	Output is correct
17	Correct	5 ms	596 KB	Output is correct
18	Correct	6 ms	600 KB	Output is correct
19	Correct	6 ms	600 KB	Output is correct
20	Incorrect	4 ms	600 KB	Output isn't correct
21	Correct	16 ms	1112 KB	Output is correct
22	Correct	18 ms	1012 KB	Output is correct
23	Correct	16 ms	1112 KB	Output is correct
24	Correct	20 ms	1208 KB	Output is correct
25	Partially correct	32 ms	1112 KB	Partially correct
26	Correct	18 ms	1176 KB	Output is correct
27	Correct	19 ms	1164 KB	Output is correct
28	Correct	17 ms	1112 KB	Output is correct
29	Correct	16 ms	1100 KB	Output is correct
30	Incorrect	16 ms	1112 KB	Output isn't correct
31	Runtime error	0 ms	344 KB	Execution failed because the return code was nonzero
32	Correct	0 ms	344 KB	Output is correct