Submission #398711

#TimeUsernameProblemLanguageResultExecution timeMemory
398711dualitySemiexpress (JOI17_semiexpress)C++11
100 / 100
17 ms2496 KiB
#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 ---------- int S[3000]; vi poss; int main() { int i; int N,M,K; int A,B,C; LLI T; scanf("%d %d %d",&N,&M,&K); scanf("%d %d %d %lld",&A,&B,&C,&T); for (i = 0; i < M; i++) scanf("%d",&S[i]),S[i]--; int j,ans = -1; for (i = 0; i < M; i++) { LLI t = T-(LLI) S[i]*B; if (i == M-1) { if (t >= 0) ans++; continue; } int x = S[i+1]-S[i]-1; if (t >= 0) { ans += min(t/A,(LLI) x)+1; int s = S[i]+min(t/A,(LLI) x)+1; for (j = 1; j <= K-M; j++) { if (s < S[i+1]) { t = T-(LLI) S[i]*B-(LLI) (s-S[i])*C; if (t >= 0) { x = S[i+1]-s-1; poss.pb(min(t/A,(LLI) x)+1); s += min(t/A,(LLI) x)+1; } else break; } } } } sort(poss.begin(),poss.end(),greater<int>()); for (i = 0; i < min(K-M,(int) poss.size()); i++) ans += poss[i]; printf("%d\n",ans); return 0; }

Compilation message (stderr)

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |     scanf("%d %d %d",&N,&M,&K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |     scanf("%d %d %d %lld",&A,&B,&C,&T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:67:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   67 |     for (i = 0; i < M; i++) scanf("%d",&S[i]),S[i]--;
      |                             ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...