Submission #25628979

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
/*~Rainybunny~*/
#include <bits/stdc++.h>
#define rep( i, l, r ) for ( int i = l, rep##i = r; i <= rep##i; ++i )
#define per( i, r, l ) for ( int i = r, per##i = l; i >= per##i; --i )
struct Set {
    int adt; std::multiset<int> ms;
    inline void insert( const int x ) { ms.insert( x - adt ); }
    inline int max() const { return adt + *ms.rbegin(); }
    inline int min() const { return adt + *ms.begin(); }
    inline void erase( const int x ) { ms.erase( ms.find( x - adt ) ); }
} L, R;
int main() {
    int q, t, d, x, las = 0;
    long long ans = 0;
    scanf( "%d", &q );
    rep ( i, 1, q ) L.insert( 0 ), R.insert( 0 );
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

/*~Rainybunny~*/

#include <bits/stdc++.h>

#define rep( i, l, r ) for ( int i = l, rep##i = r; i <= rep##i; ++i )
#define per( i, r, l ) for ( int i = r, per##i = l; i >= per##i; --i )

struct Set {
    int adt; std::multiset<int> ms;
    inline void insert( const int x ) { ms.insert( x - adt ); }
    inline int max() const { return adt + *ms.rbegin(); }
    inline int min() const { return adt + *ms.begin(); }
    inline void erase( const int x ) { ms.erase( ms.find( x - adt ) ); }
} L, R;

int main() {
    int q, t, d, x, las = 0;
    long long ans = 0;
    scanf( "%d", &q );
    rep ( i, 1, q ) L.insert( 0 ), R.insert( 0 );

    while ( q-- ) {
        scanf( "%d %d %d", &t, &d, &x );
        L.adt -= t - las, R.adt += t - las, las = t;
        if ( !d ) {
            if ( R.min() >= x ) L.insert( x );
            else {
                R.insert( x ), L.insert( R.min() ), R.erase( R.min() );
                ans += x - L.max();
            }
        } else {
            if ( L.max() <= x ) R.insert( x );
            else {
                L.insert( x ), R.insert( L.max() ), L.erase( L.max() );
                ans += R.min() - x;
            }
        }
    }
    printf( "%lld\n", ans );
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   19 |     scanf( "%d", &q );
      |     ~~~~~^~~~~~~~~~~~
./Main.cpp:23:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   23 |         scanf( "%d %d %d", &t, &d, &x );
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result