Submission #829266

#	Time	Username	Problem	Language	Result	Execution time	Memory
829266		FatihSolak	메기 농장 (IOI22_fish)	C++17	0 / 100	37 ms	15652 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	vector<pair<int,int>> v[N];
	vector<long long>pre[N];
	for(int i = 0;i<M;i++){
		v[X[i]].push_back({Y[i],W[i]});
	}
	for(int i = 0;i<N;i++){
		v[i].push_back({N+1,0});
		sort(v[i].begin(),v[i].end());
		pre[i].assign(v[i].size(),0);
		for(int j = 0;j<v[i].size();j++){
			pre[i][j] = v[i][j].second + (j?pre[i][j-1]:0);
		}
	}
    vector<pair<int,long long>> dp[N + 1];
    dp[0].push_back({0,0});
    // for(int i = 0;i<N;i++){
    //     vector<pair<int,long long>> ndp[N + 1];
    //     for(int y = 0;y<N + 1;y++){
    //         for(auto u:dp[y]){
    //             for(auto c:v[i]){
    //                 array<long long,3> nw;
    //                 nw[0] = u.first;
    //                 nw[1] = c.first-1;
    //                 nw[2] = u.second;
    //                 if(c.first - 1 <= u.first){
    //                     for(auto x:v[i]){
    //                         if(c.first-1 < x.first && x.first <= u.first)
    //                             nw[2] += x.second;
    //                     }
    //                 }
    //                 else{
    //                     if(i){
    //                         for(auto x:v[i-1]){
    //                             if(u.first < x.first && y-1 < x.first && x.first <= c.first - 1)
    //                                 nw[2] += x.second;
    //                         }
    //                     }
    //                 }
    //                 ndp[nw[0] + 1].push_back({nw[1],nw[2]});
    //             }
    //         }
    //     }
    //     for(int j = 0;j<N + 1;j++){
    //         sort(ndp[j].begin(),ndp[j].end());
    //         vector<pair<int,long long>> tmp;
    //         for(auto u:ndp[j]){
    //             if(tmp.empty() || u.first != tmp.back().first)
    //                 tmp.push_back(u);
    //             else tmp.back().second = max(tmp.back().second,u.second);
    //         }
    //         ndp[j] = tmp;
    //         dp[j] = ndp[j];
    //     }
    // }
    long long ans = 0;
    for(int i = 0;i<N + 1;i++){
        for(auto c:dp[i]){
            ans = max(ans,c.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:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   for(int j = 0;j<v[i].size();j++){
      |                 ~^~~~~~~~~~~~

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16