답안 #321727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321727	2020-11-13T07:03:17 Z	daniel920712	Semiexpress (JOI17_semiexpress)	C++14	0 / 100	1 ms	492 KB

semiexpress

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <set>
#include <map>

using namespace std;

long long all[3005];
map < long long , long long > Con;
set < long long > have,have2;
vector < long long > how;
bool F(long long a,long long b)
{
    return a<b;
}
int main()
{
    //freopen("02-08.txt","rt",stdin);
    long long N,M,K,a,b,c,x,y,z,t,ans=0,con=0,now=0,i,ttt=0;
    scanf("%lld %lld %lld",&N,&M,&K);
    scanf("%lld %lld %lld",&a,&b,&c);
    scanf("%lld",&t);
    for(i=0;i<M;i++)
    {
        scanf("%lld",&all[i]);

        have.insert(all[i]);
        have2.insert(all[i]);
        Con[all[i]]=(all[i]-1)*b;
    }
    con=M;
    for(i=1;i<=N;i++)
    {
        if((i-1)*a<=t)
        {
            ans++;
        }
        else
        {
            if(have.find(i)!=have.end())
            {
                if((i-1)*b<=t)
                {
                    how.push_back(ttt);
                    ttt=0;
                    ans++;
                }
            }
            else
            {
                if((*prev(have.lower_bound(i))-1)*b+(i-*prev(have.lower_bound(i)))*a<=t)
                {
                    ans++;
                    continue;
                }
                if(Con[*prev(have2.lower_bound(i))]+(i-*prev(have2.lower_bound(i)))*a<=t)
                {
                    ttt++;
                    continue;
                }
                else
                {
                    how.push_back(ttt);
                    ttt=0;
                }

                if((i-*prev(have.lower_bound(i)))*c+(*prev(have.lower_bound(i))-1)*b<=t)
                {
                    Con[i]=(i-*prev(have.lower_bound(i)))*c+(*prev(have.lower_bound(i))-1)*b;

                    ttt=1;
                    have2.insert(i);
                }


            }
        }
    }
    sort(how.begin(),how.end(),F);
    for(i=M;i<K;i++) ans+=how[i];
    printf("%lld\n",ans-1);
    return 0;
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:22:27: warning: unused variable 'x' [-Wunused-variable]
   22 |     long long N,M,K,a,b,c,x,y,z,t,ans=0,con=0,now=0,i,ttt=0;
      |                           ^
semiexpress.cpp:22:29: warning: unused variable 'y' [-Wunused-variable]
   22 |     long long N,M,K,a,b,c,x,y,z,t,ans=0,con=0,now=0,i,ttt=0;
      |                             ^
semiexpress.cpp:22:31: warning: unused variable 'z' [-Wunused-variable]
   22 |     long long N,M,K,a,b,c,x,y,z,t,ans=0,con=0,now=0,i,ttt=0;
      |                               ^
semiexpress.cpp:22:41: warning: variable 'con' set but not used [-Wunused-but-set-variable]
   22 |     long long N,M,K,a,b,c,x,y,z,t,ans=0,con=0,now=0,i,ttt=0;
      |                                         ^~~
semiexpress.cpp:22:47: warning: unused variable 'now' [-Wunused-variable]
   22 |     long long N,M,K,a,b,c,x,y,z,t,ans=0,con=0,now=0,i,ttt=0;
      |                                               ^~~
semiexpress.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |     scanf("%lld %lld %lld",&N,&M,&K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |     scanf("%lld %lld %lld",&a,&b,&c);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%lld",&t);
      |     ~~~~~^~~~~~~~~~~
semiexpress.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |         scanf("%lld",&all[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	492 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	492 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	492 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-