Submission #832640

#TimeUsernameProblemLanguageResultExecution timeMemory
832640JokubasCrosses on the Grid (FXCUP4_cross)C++17
63 / 100
1084 ms30736 KiB
#include <iostream> #include <bits/stdc++.h> #define pb push_back typedef long long ll; using namespace std; ll SelectCross (int K, vector<int> I, vector<int> O) { ll ats = 0; int N = I.size(); map<int, vector<int>> lol; vector<pair<int, int>> visi; //int didziausias = 0; for(int i = 0; i<N; i++) { visi.pb({I[i], O[i]}); lol[I[i]].pb(O[i]); //didziausias = max(didziausias, I[i]); } sort(visi.begin(), visi.end()); reverse(visi.begin(), visi.end()); int kiek = lol.size(); int kur = 0; int isviso = 0; vector<int> didziausi; for(int i = 0; i<kiek; i++) { int dabar = visi[kur].first; int kiekisI = lol[dabar].size(); isviso += kiekisI; if(isviso<K) { for(auto c : lol[dabar]) { didziausi.pb(c); } kur = isviso; continue; } for(int j = 0; j<min(K, kiekisI); j++) { if(didziausi.size()>0) { if(visi[kur + j].second > didziausi[K-1]) { didziausi.pb(visi[kur + j].second); } } else { didziausi.pb(visi[kur + j].second); } } sort(didziausi.begin(), didziausi.end()); reverse(didziausi.begin(), didziausi.end()); if(didziausi.size()>K) didziausi.erase(didziausi.begin() + K, didziausi.end()); ll plotas = (ll)dabar*(2*(ll)didziausi[didziausi.size()-1] - (ll)dabar); ats = max(ats, plotas); kur = isviso; } return ats; }

Compilation message (stderr)

cross.cpp: In function 'll SelectCross(int, std::vector<int>, std::vector<int>)':
cross.cpp:79:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   79 |         if(didziausi.size()>K)
      |            ~~~~~~~~~~~~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...