Submission #296415

#	Time	Username	Problem	Language	Result	Execution time	Memory
296415		CaroLinda	Strange Device (APIO19_strange_device)	C++14	5 / 100	1 ms	512 KiB

strange_device

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimization ("O2")

#define lp(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define sz(x) (int)(x.size())
#define all(x) x.begin(),x.end()
#define debug printf
#define tiii tuple<int,int,int>
#define mkt make_tuple
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define ff first
#define ss second

using namespace std ;

int N ;
ll A , B , G ;

int main()
{
    scanf("%d%lld%lld", &N , &A, &B ) ;

    assert(N == 1) ;

    G = __gcd(A,B+1) ;
    G = A/G ;

    ll L , R ;
    scanf("%lld %lld", &L , &R ) ;

    if( 10000000000000000000LL/B < G ) printf("%lld\n",R-L+1LL);
    else printf("%lld\n" , min(B*G, R-L+1LL) ) ;

}

Compilation message (stderr)

strange_device.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
strange_device.cpp:6: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O2")
      | 
strange_device.cpp:38:9: warning: integer constant is so large that it is unsigned
   38 |     if( 10000000000000000000LL/B < G ) printf("%lld\n",R-L+1LL);
      |         ^~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp: In function 'int main()':
strange_device.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d%lld%lld", &N , &A, &B ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |     scanf("%lld %lld", &L , &R ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30