제출 #804537

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
8045372023-08-03 09:38:45phoebe메기 농장 (IOI22_fish)C++17
100 / 100
139 ms36556 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n) for (int i = 0; i < n; i++)
#define PB push_back
#define pii pair<int, int>
#define F first
#define S second
#define ALL(x) x.begin(), x.end()
const int INF = 1e9 + 7;
const int maxn = 1e5 + 10;
int n, m;
vector<pii> fish[maxn]; // {y, w}
vector<ll> include[maxn], includent[maxn];
ll max_weights(int N, int M, vector<int> x,
vector<int> y, vector<int> w){
n = N, m = M;
FOR(i, m) fish[x[i]].PB({y[i], w[i]});
fish[0].PB({n, 0}); sort(ALL(fish[0]));
include[0].assign(fish[0].size(), 0);
includent[0].assign(fish[0].size(), 0);
for (int k = 1; k < n; k++){
fish[k].PB({n, 0}); sort(ALL(fish[k]));
// case 0: k + 1 pier is >= k pier
// k + 1 pier determines fish on k
// k - 1 pier length does not matter
ll best = 0;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:5:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define FOR(i, n) for (int i = 0; i < n; i++)
......
   37 |         FOR(i, fish[k].size()){
      |             ~~~~~~~~~~~~~~~~~        
fish.cpp:37:9: note: in expansion of macro 'FOR'
   37 |         FOR(i, fish[k].size()){
      |         ^~~
fish.cpp:39:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             while (j < fish[k - 1].size() && fish[k - 1][j].F < fish[k][i].F){
      |                    ~~^~~~~~~~~~~~~~~~~~~~
#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...