oj.uz

Submission #615371

# Submission time Handle Problem Language Result Execution time Memory
615371 2022-07-31T08:39:02 Z Omar_Fakhry Gap (APIO16_gap) C++17
0 / 100
 29 ms 1740 KB 
//بسم الله الرحمن الرحيم
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.14159265358979323846
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define For(start,end,step) for(ll i=start;i<=end;i+=step)
#define For2(start,end,step) for(ll j=start;j<=end;j+=step)
#define mult(x,y) x*(y-1)
#define ALL(x) x.begin(), x.end()
using namespace std;
using namespace __gnu_pbds;
const ll mod=1e9+7;
bool prime(ll n)
{
for(int i=2;i*i<=n;i++)if(n%i==0)return 0;
return 1;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll po(ll x,ll y)
{
    if(y==0) return 1;
    ll ret=po(x,y/2);
    ret=(ret*ret);
    if(y&1)
        return (x*ret);
    return ret;
}
ll sigma(ll s,ll e,ll num_elements)
{
    ll res1=s+e;
    ll res=(((s+e)/2)*(num_elements));
    if(res1%2)res+=num_elements/2;
    return res;
}
ll mod_inverse(ll x)
{
    return po(x,mod-2);
}
string bin(ll x)
{
    string str="";
    while(x)
    {
        if(x%2)
        {
            str+='1';
        }
        else
        {
            str+='0';
        }
        x/=2;
    }
    return str;
}
ll GP(ll base,ll power,ll step)
{
    return (po(base,power+step)+mod-1)%mod*mod_inverse(po(base,step)-1)%mod;
}
ll fact(ll x)
{
    if(x<2)return 1;
    return x*fact(x-1)%mod;
}
ll ncr(ll x,ll y)
{
    return fact(x)*mod_inverse(fact(y)*fact(x-y)%mod)%mod;
}
bool valid(ll x,ll y,ll n,ll m)
{
    return(x>=0&&y>=0&&x<n&&y<m);
}
int dx[8]= {0,0,1,-1,-1,1,1,-1};
int dy[8]= {-1,1,0,0,-1,1,-1,1};

const int N=605;

ll mn,mx;
void MinMax(ll s,ll t,ll &mn,ll &mx)
{
    return;
}
ll findGap(int T,int n)
{
    ll start_num=0,end_num=1e18;
    vector<int>vec;
    for(int i=0;i<n/2+n%2;i++)
    {
        MinMax(start_num,end_num,mn,mx);
        vec.push_back(mn);
        vec.push_back(mx);
        start_num=mn+1;
        end_num=mx+1;
    }
    sort(vec.begin(),vec.end());
    int ans=0;
    for(int i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
    return ans;
}
/*
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt","w",stdout);
}
*/

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:101:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for(int i=1;i<vec.size();i++)ans=max(ans,vec[i]-vec[i-1]);
      |                 ~^~~~~~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Incorrect 0 ms 208 KB Output isn't correct
3 Incorrect 1 ms 208 KB Output isn't correct
4 Incorrect 1 ms 208 KB Output isn't correct
5 Incorrect 1 ms 208 KB Output isn't correct
6 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 280 KB Output isn't correct
8 Incorrect 1 ms 256 KB Output isn't correct
9 Incorrect 1 ms 208 KB Output isn't correct
10 Incorrect 1 ms 256 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 3 ms 316 KB Output isn't correct
15 Incorrect 0 ms 336 KB Output isn't correct
16 Incorrect 6 ms 720 KB Output isn't correct
17 Incorrect 7 ms 672 KB Output isn't correct
18 Incorrect 5 ms 720 KB Output isn't correct
19 Incorrect 5 ms 720 KB Output isn't correct
20 Incorrect 3 ms 744 KB Output isn't correct
21 Incorrect 18 ms 1704 KB Output isn't correct
22 Incorrect 17 ms 1692 KB Output isn't correct
23 Incorrect 20 ms 1692 KB Output isn't correct
24 Incorrect 20 ms 1700 KB Output isn't correct
25 Incorrect 14 ms 1732 KB Output isn't correct
26 Incorrect 24 ms 1740 KB Output isn't correct
27 Incorrect 26 ms 1724 KB Output isn't correct
28 Incorrect 17 ms 1732 KB Output isn't correct
29 Incorrect 18 ms 1692 KB Output isn't correct
30 Incorrect 11 ms 1664 KB Output isn't correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 1 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 0 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 336 KB Output isn't correct
15 Incorrect 1 ms 336 KB Output isn't correct
16 Incorrect 5 ms 720 KB Output isn't correct
17 Incorrect 5 ms 688 KB Output isn't correct
18 Incorrect 5 ms 720 KB Output isn't correct
19 Incorrect 7 ms 684 KB Output isn't correct
20 Incorrect 4 ms 720 KB Output isn't correct
21 Incorrect 27 ms 1700 KB Output isn't correct
22 Incorrect 23 ms 1644 KB Output isn't correct
23 Incorrect 18 ms 1684 KB Output isn't correct
24 Incorrect 25 ms 1692 KB Output isn't correct
25 Incorrect 15 ms 1676 KB Output isn't correct
26 Incorrect 24 ms 1692 KB Output isn't correct
27 Incorrect 29 ms 1628 KB Output isn't correct
28 Incorrect 27 ms 1644 KB Output isn't correct
29 Incorrect 19 ms 1688 KB Output isn't correct
30 Incorrect 17 ms 1652 KB Output isn't correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct