Submission #925269

# Submission time Handle Problem Language Result Execution time Memory
925269 2024-02-11T09:30:55 Z IS_Rushdi Catfish Farm (IOI22_fish) C++17
Compilation error
0 ms 0 KB
// #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){
    long long dp[n+1][n+1][2]{};
    int sum[n+1][n+1]{};
    for(int i = 0; i < m; i++) x[i] += 1;
    for(int i = 0; i < m; i++) y[i] += 1;
    for(int i = 0; i < m; i++) sum[x[i]][y[i]] += w[i];
    long long ans = 0;

    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 2; j++){
            dp[0][i][j] = -1e18;
        }
    }
    dp[0][0][1] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            for(int k = 0; k <= n; k++){
                long long now = dp[i-1][j][1];
                int cur = k;
                while(cur > j) now += sum[i-1][cur--];
                cur = j;
                while(cur > k) now += sum[i][cur--];
                if(k >= j) dp[i][k][1] = max(dp[i][k][1],now);
                else dp[i][k][0] = max(dp[i][k][0],now);
                
                ans = max(ans,now);
            }
            for(int k = 0; k < j; k++){
                long long now = dp[i-1][j][0];
                int cur = k;
                while(cur > j) now += sum[i-1][cur--];
                cur = j;
                while(cur > k) now += sum[i][cur--];
                dp[i][k][0] = max(dp[i][k][0],now);
                ans = max(ans,now);
            }
        }
    }
    return ans;
}
 
int main(){
    cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
}

Compilation message

/usr/bin/ld: /tmp/ccRuNiBo.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cccT5L6r.o:fish.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status