Platformer

input/code.cpp: In function 'int main()':
input/code.cpp:23:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d",&n,&q,&w,&k);
                                  ^
input/code.cpp:34:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&t);
                       ^
input/code.cpp:39:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&e);
                            ^

#include <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>

#define all(x) (x).begin(),x.end()

#define pb push_back
#define mp make_pair
#define x1 first
#define x2 second.first
#define x3 second.second
#define trip(a,b,c) mp(a,mp(b,c))

using namespace std;
const int inf = 1000000007;

int main()
{
    int n,q,w,k;
    scanf("%d%d%d%d",&n,&q,&w,&k);

    set<pair<int,int> > S;
    S.insert(mp(q,w));

    int mycost = -k;
    for(int i=0;i<n;i++)
    {
        mycost += k;
//        printf("%d cost = %d\n",i,mycost);
        int t;
        scanf("%d",&t);
        if(t==0)
            continue;

        int x,e;
        scanf("%d%d",&x,&e);
        set<pair<int,int> >::iterator fff;
        

        int upper=-inf;
        for(;;)
        {
//            puts("a");
            fff = S.lower_bound(mp(x,-inf));
            if(fff==S.end())
                break;
            if(fff->second - abs(fff->first - x) >= mycost)
            {
                upper = fff->second - abs(fff->first - x);
                break;
            }
            if(fff->second > mycost)
                break;
            S.erase(fff);
        }
        int lower=-inf;
        for(;;)
        {
//            puts("b");
            fff = S.lower_bound(mp(x,-inf));
            if(fff==S.begin())
                break;
            fff--;

            if(fff->second - abs(fff->first - x) >= mycost)
            {
                lower = fff->second - abs(fff->first - x);
                break;
            }
            if(fff->second > mycost)
                break;
            S.erase(fff);
        }
        int tmp = max(lower,upper); 
        if(tmp < 0)
        {
            continue;
        }
        tmp += e;
        
        fff = S.lower_bound(mp(x,-inf));
        if(fff!=S.end() && fff->first == x)
        {
            S.erase(fff);
        }
        S.insert(mp(x,tmp));
        for(;;)
        {
//            puts("c");
            set<pair<int,int> >::iterator ggg;
            ggg = S.find(mp(x,tmp));
            ggg++;
            if(ggg==S.end())
                break;
            if(abs(ggg->first - x) + ggg->second < tmp)
                S.erase(ggg);
            else
                break;
        }
        for(;;)
        {
//            puts("d");
            set<pair<int,int> >::iterator ggg;
            ggg = S.find(mp(x,tmp));
            if(ggg==S.begin())
                break;
            ggg--;
            if(abs(ggg->first - x) + ggg->second < tmp)
                S.erase(ggg);
            else
                break;
        }
//        for(fff=S.begin();fff!=S.end();fff++)
//        {
//            printf("%d %d\n",fff->first, fff->second);
//        }
    }
    for(set<pair<int,int> >::iterator fff=S.begin();fff!=S.end();fff++)
        if(fff->second >= mycost)
        {
            puts("10-4");
            return 0;
        }
    puts("QAQ");
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED