oj.uz

Submission #568649

# Submission time Handle Problem Language Result Execution time Memory
568649 2022-05-26T00:52:35 Z Deepesson Gap (APIO16_gap) C++17
0 / 100
 74 ms 8548 KB 
#include <bits/stdc++.h>

#include "gap.h"

void MinMax(long long, long long, long long*, long long*);

using ll = long long;
long long findGap(int T, int N)
{
    if(T==2)
	return 0;
    else {
        std::map<ll,bool> mapa;
        ll l=-1,r=1e18+1;
        while(l+1<=r-1){
            ll a,b;
            MinMax(l+1,r-1,&a,&b);
            if(a!=-1){
                mapa[a]=true;
                l=a;
            }
            if(b!=-1){
                mapa[b]=true;
                r=b;
            }
            if(a==b&&a==-1)break;
            if(mapa.size()==N)break;
        }
        ll max=0;
        std::vector<ll> vec;
        for(auto&x:mapa)vec.push_back(x.first);
        for(int i=1;i!=vec.size();++i)max=std::max(max,vec[i]-vec[i-1]);
        return max;
    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:27:27: warning: comparison of integer expressions of different signedness: 'std::map<long long int, bool>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |             if(mapa.size()==N)break;
      |                ~~~~~~~~~~~^~~
gap.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for(int i=1;i!=vec.size();++i)max=std::max(max,vec[i]-vec[i-1]);
      |                     ~^~~~~~~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 20 ms 2376 KB Output is correct
17 Correct 21 ms 2376 KB Output is correct
18 Correct 16 ms 2392 KB Output is correct
19 Correct 16 ms 2412 KB Output is correct
20 Correct 13 ms 2416 KB Output is correct
21 Correct 59 ms 8472 KB Output is correct
22 Correct 60 ms 8512 KB Output is correct
23 Correct 74 ms 8512 KB Output is correct
24 Correct 62 ms 8464 KB Output is correct
25 Correct 60 ms 8468 KB Output is correct
26 Correct 72 ms 8512 KB Output is correct
27 Correct 66 ms 8512 KB Output is correct
28 Correct 59 ms 8480 KB Output is correct
29 Correct 69 ms 8548 KB Output is correct
30 Correct 57 ms 8492 KB Output is correct
31 Incorrect 1 ms 208 KB Output isn't correct
32 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Output isn't correct
2 Incorrect 0 ms 208 KB Output isn't correct
3 Incorrect 0 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Incorrect 0 ms 208 KB Output isn't correct
6 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Incorrect 1 ms 208 KB Output isn't correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 1 ms 208 KB Output isn't correct
15 Incorrect 1 ms 208 KB Output isn't correct
16 Incorrect 6 ms 464 KB Output isn't correct
17 Incorrect 5 ms 464 KB Output isn't correct
18 Incorrect 5 ms 464 KB Output isn't correct
19 Incorrect 4 ms 428 KB Output isn't correct
20 Incorrect 3 ms 464 KB Output isn't correct
21 Incorrect 17 ms 1064 KB Output isn't correct
22 Incorrect 26 ms 1084 KB Output isn't correct
23 Incorrect 20 ms 1004 KB Output isn't correct
24 Incorrect 19 ms 1056 KB Output isn't correct
25 Incorrect 14 ms 1064 KB Output isn't correct
26 Incorrect 20 ms 968 KB Output isn't correct
27 Incorrect 19 ms 1012 KB Output isn't correct
28 Incorrect 24 ms 1096 KB Output isn't correct
29 Incorrect 19 ms 1060 KB Output isn't correct
30 Incorrect 11 ms 1104 KB Output isn't correct
31 Incorrect 1 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct