제출 #409453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
409453		duality	Long Distance Coach (JOI17_coach)	C++11	71 / 100	2090 ms	11160 KiB

coach

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

LLI T;
LLI S[200001];
bool comp(LLI a,LLI b) {
    if ((a % T) == (b % T)) return a < b;
    else return (a % T) < (b % T);
}
pair<LLI,int> p[200000];
LLI dp[200000];
int main() {
    int i;
    LLI X;
    int N,M,W;
    scanf("%lld %d %d %d %lld",&X,&N,&M,&W,&T);
    for (i = 0; i < N; i++) scanf("%lld",&S[i]);
    S[N++] = X,sort(S,S+N,comp);
    for (i = 0; i < M; i++) scanf("%lld %d",&p[i].first,&p[i].second);
    sort(p,p+M);

    int j = 0,k;
    for (i = 0; i < M; i++) {
        while ((j < N) && ((S[j] % T) < p[i].first)) j++;
        dp[i] = (LLI) W*((X-p[i].first)/T+1)+((i == 0) ? 0:dp[i-1]);
        if ((j < N) && ((i == M-1) || ((S[j] % T) < p[i+1].first))) {
            LLI s = S[j];
            while ((j < N) && ((S[j] % T) < ((i == M-1) ? T:p[i+1].first))) s = min(s,S[j]),j++;
            LLI c = 0;
            for (k = i; k >= 0; k--) {
                c += p[k].second;
                dp[i] = min(dp[i],c+((k == 0) ? 0:dp[k-1])+(LLI) W*(i-k+1)*(s/T));
            }
        }
    }
    printf("%lld\n",dp[M-1]+(LLI) W*(X/T+1));

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

coach.cpp: In function 'int main()':
coach.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     scanf("%lld %d %d %d %lld",&X,&N,&M,&W,&T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
coach.cpp:71:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     for (i = 0; i < N; i++) scanf("%lld",&S[i]);
      |                             ~~~~~^~~~~~~~~~~~~~
coach.cpp:73:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     for (i = 0; i < M; i++) scanf("%lld %d",&p[i].first,&p[i].second);
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 16 / 16
• Subtask 2: 30 / 30
• Subtask 3: 25 / 25
• Subtask 4: 0 / 29