oj.uz

Submission #376218

# Submission time Handle Problem Language Result Execution time Memory
376218 2021-03-11T04:40:52 Z daniel920712 Bitaro, who Leaps through Time (JOI19_timeleap) C++14
0 / 100
 143 ms 54640 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>

using namespace std;
vector < pair < long long , long long > > Next[300005];
pair < long long , long long > how[300005];
long long F(long long here,long long fa,long long fin,long long x,long long y,long long z)
{
    //if(here<1) while(1);
    if(here==fin) printf("%lld\n",y+max((long long) 0,x-z));
    else
    {
        for(auto i:Next[here])
        {
            if(i.first==fa) continue;
            if(i.first<0) while(1);
            if(x>=how[i.second].second) F(i.first,here,fin,how[i.second].second,y+x-how[i.second].second+1,z);
            else if(x<=how[i.second].first) F(i.first,here,fin,how[i.second].first+1,y,z);
            else F(i.first,here,fin,x+1,y,z);
        }
    }
}
int main()
{
    long long N,M,a,b,c,d,i;
    scanf("%lld %lld",&N,&M);
    //if(N>=100000) while(1);
    for(i=1;i<N;i++)
    {
        scanf("%lld %lld",&c,&d);
        Next[i].push_back(make_pair(i+1,i));
        Next[i+1].push_back(make_pair(i,i));
        how[i]=make_pair(c,d);
    }
    while(M--)
    {
        scanf("%lld",&a);
        if(a==1)
        {
            scanf("%lld %lld %lld",&b,&c,&d);
            how[b]=make_pair(c,d);
        }
        else
        {
            scanf("%lld %lld %lld %lld",&a,&b,&c,&d);
            //if(a<1) while(1);
            F(a,-1,c,b,0,d);
        }
    }
    return 0;
}

Compilation message

timeleap.cpp: In function 'long long int F(long long int, long long int, long long int, long long int, long long int, long long int)':
timeleap.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
timeleap.cpp: In function 'int main()':
timeleap.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%lld %lld",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
timeleap.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |         scanf("%lld %lld",&c,&d);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
timeleap.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |         scanf("%lld",&a);
      |         ~~~~~^~~~~~~~~~~
timeleap.cpp:42:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |             scanf("%lld %lld %lld",&b,&c,&d);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
timeleap.cpp:47:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   47 |             scanf("%lld %lld %lld %lld",&a,&b,&c,&d);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 14976 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 143 ms 54640 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 66.0

# Verdict Execution time Memory Grader output
1 Runtime error 15 ms 14976 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -