Submission #645825

#TimeUsernameProblemLanguageResultExecution timeMemory
645825ymmCatfish Farm (IOI22_fish)C++17
6 / 100
163 ms65872 KiB
#include "fish.h" #include <bits/stdc++.h> #define Loop(x,l,r) for (ll x = (l); x < (r); ++x) #define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x) typedef long long ll; typedef std::pair<int, int> pii; typedef std::pair<ll , ll > pll; using namespace std; const int N = 300'010; ll dpu[N*2], dpd[N*2]; int n, m; vector<pii> C[N]; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { n = N; m = M; Loop (i,0,m) C[X[i]].push_back({Y[i], i}); Loop (i,0,n) { C[i].push_back({-1, m}); X.push_back(i); Y.push_back(-1); ++m; C[i].push_back({n, m}); X.push_back(i); Y.push_back(n); ++m; sort(C[i].begin(), C[i].end()); } W.resize(m, 0); // base Loop (i,0,C[0].size()) dpu[C[0][i].second] = 0; dpd[C[0].front().second] = 0; Loop (i,1,C[0].size()) { int x = C[0][i].second; int y = C[0][i-1].second; dpd[x] = dpd[y] + W[x]; } // second base dpu[C[1].back().second] = 0; int p = C[1].size()-1; LoopR (i,0,C[1].size()-1) { int x = C[1][i].second; int y = C[1][i+1].second; while (p > 0 && C[0][p-1].first > C[1][i].first) --p; dpu[x] = max(dpu[y], dpu[C[0][p].second]) + W[x]; } dpd[C[1].front().second] = dpu[C[0].front().second]; p = 0; Loop (i,1,C[1].size()) { int x = C[1][i].second; int y = C[1][i-1].second; while (p+1 < C[0].size() && C[0][p+1].first < C[1][i].first) ++p; dpd[x] = max(dpd[y], dpd[C[0][p].second]) + W[x]; } // update Loop (c,2,n) { dpu[C[c].back().second] = dpd[C[c-2].back().second]; p = C[c].size()-1; LoopR (i,0,C[c].size()-1) { int x = C[c][i].second; int y = C[c][i+1].second; while (p > 0 && C[c-1][p-1].first > C[c][i].first) --p; dpu[x] = max(dpu[y], dpu[C[c-1][p].second]) + W[x]; } dpd[C[c].front().second] = dpu[C[c-1].front().second]; p = 0; Loop (i,1,C[c].size()) { int x = C[c][i].second; int y = C[c][i-1].second; while (p+1 < C[c-1].size() && C[c-1][p+1].first < C[c][i].first) ++p; dpd[x] = max(dpd[y], dpd[C[c-1][p].second]) + W[x]; } } // debug //Loop (i,0,m) { // cout << "[" << X[i] << ' ' << Y[i] << ' ' << W[i] << "]: " << dpu[i] << ' ' << dpd[i] << '\n'; //} // ans ll ans = max(dpu[C[n-1].front().second], dpd[C[n-2].back().second]); return ans; }

Compilation message (stderr)

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
fish.cpp:34:2: note: in expansion of macro 'Loop'
   34 |  Loop (i,0,C[0].size())
      |  ^~~~
fish.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
fish.cpp:37:2: note: in expansion of macro 'Loop'
   37 |  Loop (i,1,C[0].size()) {
      |  ^~~~
fish.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
fish.cpp:55:2: note: in expansion of macro 'Loop'
   55 |  Loop (i,1,C[1].size()) {
      |  ^~~~
fish.cpp:58:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   while (p+1 < C[0].size() && C[0][p+1].first < C[1][i].first)
      |          ~~~~^~~~~~~~~~~~~
fish.cpp:3:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
      |                                        ^
fish.cpp:76:3: note: in expansion of macro 'Loop'
   76 |   Loop (i,1,C[c].size()) {
      |   ^~~~
fish.cpp:79:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    while (p+1 < C[c-1].size() && C[c-1][p+1].first < C[c][i].first)
      |           ~~~~^~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...