Submission #995606


Source Code Expand

#include <bits/stdc++.h>
      
#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )
#define REP(i,n) FOR(i,0,n)
#define YYS(x,arr) for(auto& x:arr)
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort( (x).begin(),(x).end() )
#define REVERSE(x) reverse( (x).begin(),(x).end() )
#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )
#define PW(x) (1LL<<(x))
#define SZ(x) ((ll)(x).size())
#define SHOW(x) cout << #x << " = " << x << endl
     
#define pb emplace_back
#define fi first
#define se second
     
using namespace std;
     
typedef long double ld;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpl> gr;
typedef vector<vl> ml;
typedef vector<vd> md;
typedef vector<vi> mi;
     
const ll INF = (ll)1e9 + 10;
const ll INFLL = (ll)1e18 + 10;
const ld EPS = 1e-12;
const ll MOD = 1e9+7;
     
template<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }
template<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }
template<class T> inline T sq( T a ){ return a * a; }
ll in(){ ll x; scanf( "%lld" , &x ); return x; }
     
// head

int n;

int a[100010], b[100010];

int main(){

  n = in();
  REP( i , n ){
    a[i] = in();
    b[i] = in();
  }

  if( a[0] != 0 ){
    puts( "-1" );
    return 0;
  }
  if( b[1] != 0 ){
    puts( "-1" );
    return 0;
  }
  if( a[1] != b[0] ){
    puts( "-1" );
    return 0;
  }

  REP( i , n ){
    if( a[1] + b[i] < a[i] ){
      puts( "-1" );
      return 0;
    }
    if( a[1] + a[i] < b[i] ){
      puts( "-1" );
      return 0;
    }
  }

  assert( false );
  
  return 0;
}

Submission Info

Submission Time
Task A - Distance Pairs
User joisino
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1839 Byte
Status RE
Exec Time 130 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘ll in()’:
./Main.cpp:43:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 ll in(){ ll x; scanf( "%lld" , &x ); return x; }
                                    ^

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 1500
Status
RE × 2
AC × 6
RE × 27
Set Name Test Cases
sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt
Case Name Status Exec Time Memory
01-01.txt AC 21 ms 1024 KB
01-02.txt AC 18 ms 1024 KB
01-03.txt RE 111 ms 256 KB
01-04.txt RE 110 ms 256 KB
01-05.txt RE 109 ms 256 KB
01-06.txt RE 119 ms 640 KB
01-07.txt RE 127 ms 1024 KB
01-08.txt RE 127 ms 1024 KB
01-09.txt RE 125 ms 1024 KB
01-10.txt RE 125 ms 1024 KB
01-11.txt RE 127 ms 1024 KB
01-12.txt RE 126 ms 1024 KB
01-13.txt RE 129 ms 1024 KB
01-14.txt RE 130 ms 1024 KB
01-15.txt RE 129 ms 1024 KB
01-16.txt RE 125 ms 1024 KB
01-17.txt RE 125 ms 1024 KB
01-18.txt RE 125 ms 1024 KB
01-19.txt RE 129 ms 1024 KB
01-20.txt RE 129 ms 1024 KB
01-21.txt RE 129 ms 1024 KB
01-22.txt RE 128 ms 1024 KB
01-23.txt RE 126 ms 1024 KB
01-24.txt RE 126 ms 1024 KB
01-25.txt AC 19 ms 1024 KB
01-26.txt AC 19 ms 1024 KB
01-27.txt RE 125 ms 1024 KB
01-28.txt RE 127 ms 1024 KB
01-29.txt RE 110 ms 256 KB
01-30.txt AC 2 ms 256 KB
01-31.txt AC 2 ms 256 KB
sample-01.txt RE 110 ms 256 KB
sample-02.txt RE 110 ms 256 KB