제출 #547386

#제출 시각아이디문제언어결과실행 시간메모리
547386dualitySightseeing in Kyoto (JOI22_kyoto)C++17
40 / 100
338 ms20820 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 A[100000],B[100000]; LLI dp[1001][1001]; LLI solve(vi a,vi b) { int i,j; for (i = 0; i < a.size(); i++) { for (j = 0; j < b.size(); j++) { if (i == 0) dp[i][j] = (LLI) A[a[0]]*(b[j]-b[0]); else if (j == 0) dp[i][j] = (LLI) B[b[0]]*(a[i]-a[0]); else dp[i][j] = min(dp[i-1][j]+(LLI) B[b[j]]*(a[i]-a[i-1]),dp[i][j-1]+(LLI) A[a[i]]*(b[j]-b[j-1])); } } return dp[a.size()-1][b.size()-1]; } int main() { int i; int H,W; scanf("%d %d",&H,&W); for (i = 0; i < H; i++) scanf("%d",&A[i]); for (i = 0; i < W; i++) scanf("%d",&B[i]); LLI ans = 0; int x = min_element(A,A+H)-A,y = min_element(B,B+W)-B; vi a,b; for (i = x; i < H; i++) { while (!a.empty() && (A[a.back()] >= A[i]) && (a.back() != x)) a.pop_back(); a.pb(i); } for (i = y; i < W; i++) { while (!b.empty() && (B[b.back()] >= B[i]) && (b.back() != y)) b.pop_back(); b.pb(i); } ans += solve(a,b); a.clear(),b.clear(); for (i = x; i >= 0; i--) { while (!a.empty() && (A[a.back()] >= A[i]) && (a.back() != x)) a.pop_back(); a.pb(i); } for (i = y; i >= 0; i--) { while (!b.empty() && (B[b.back()] >= B[i]) && (b.back() != y)) b.pop_back(); b.pb(i); } reverse(a.begin(),a.end()); reverse(b.begin(),b.end()); ans += solve(a,b); printf("%lld\n",ans); return 0; }

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

kyoto.cpp: In function 'LLI solve(vi, vi)':
kyoto.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (i = 0; i < a.size(); i++) {
      |                 ~~^~~~~~~~~~
kyoto.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for (j = 0; j < b.size(); j++) {
      |                     ~~^~~~~~~~~~
kyoto.cpp: In function 'int main()':
kyoto.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     scanf("%d %d",&H,&W);
      |     ~~~~~^~~~~~~~~~~~~~~
kyoto.cpp:75:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     for (i = 0; i < H; i++) scanf("%d",&A[i]);
      |                             ~~~~~^~~~~~~~~~~~
kyoto.cpp:76:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     for (i = 0; i < W; i++) scanf("%d",&B[i]);
      |                             ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...