제출 #997147

#제출 시각아이디문제언어결과실행 시간메모리
997147daffuwuCloud Computing (CEOI18_clo)C++14
18 / 100
183 ms3228 KiB
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); long long n, m, dp1[2][100069], dp2[2][100069], c, f, v, ps1, ps2, ans, mn; int main() { long long i, sm; // for (sm=1; sm<=100000) dp1[0][sm] = 0; scanf("%lld", &n); for (i=1; i<=n; i++) { scanf("%lld%lld%lld", &c, &f, &v); for (sm=0; sm<=ps1+c; sm++) { if (sm<=ps1) dp1[i%2][sm] = dp1[(i+1)%2][sm]; else dp1[i%2][sm] = 1e15; if (sm>=c) dp1[i%2][sm] = min(dp1[i%2][sm], dp1[(i+1)%2][sm-c]+v); } ps1 += c; } scanf("%lld", &m); for (i=1; i<=m; i++) { scanf("%lld%lld%lld", &c, &f, &v); for (sm=0; sm<=ps2+c; sm++) { if (sm<=ps2) dp2[i%2][sm] = dp2[(i+1)%2][sm]; else dp2[i%2][sm] = -1e15; if (sm>=c) dp2[i%2][sm] = max(dp2[i%2][sm], dp2[(i+1)%2][sm-c]+v); } ps2 += c; } for (sm=ps1-1; sm>=0; sm--) dp1[n%2][sm] = min(dp1[n%2][sm], dp1[n%2][sm+1]); mn = min(ps1, ps2); for (sm=0; sm<=mn; sm++) { // printf("dp1[%lld][%lld] = %lld dp2[%lld][%lld] = %lld\n", n, sm, dp1[n%2][sm], m, sm, dp2[m%2][sm]); ans = max(ans, dp2[m%2][sm]-dp1[n%2][sm]); } printf("%lld\n", ans); }

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

clo.cpp: In function 'int main()':
clo.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
clo.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%lld%lld%lld", &c, &f, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf("%lld", &m);
      |     ~~~~~^~~~~~~~~~~~
clo.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         scanf("%lld%lld%lld", &c, &f, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...