Submission #1079299

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1079299	2024-08-28T12:43:41 Z	glupan	Catfish Farm (IOI22_fish)	C++17	9 / 100	55 ms	7284 KB

fish

#include "fish.h"

#include <bits/stdc++.h>

#define fore(i, l, r) for(int i=int(l); i<int(r); i++)

using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  long long ok=1,ok1=1;
    fore(i,0,M) {
        if(X[i] % 2)
            ok=0;
        if(X[i] > 1)
            ok1=0;
    }
    long long ans=0;
    if(ok)
      fore(i,0,M)
        ans+=W[i];
    else if(ok1) {
      long long grid[2][N+5];
      memset(grid,0,sizeof grid);
      fore(i,0,M)
        grid[X[i]][Y[i]] = W[i];
      long long sum1=0,sum2=0,temp1=0,temp2=0;
      if(N > 2) {
        fore(i,0,N) {
          sum1+=grid[0][i];
          sum2+=grid[1][i];
          if(sum1 >= sum2 and abs(sum1-sum2) >= abs(temp1-temp2)) {
            temp1=sum1;
            temp2=sum2;
          }
        }
        ans = sum2-temp2+temp1;
      } else {
        fore(i,0,N) {
          sum1+=grid[0][i];
          sum2+=grid[1][i];
        }
        return max(sum1,sum2);
      }
    } else {
      long long grid[N+5];
      memset(grid,0,sizeof grid);
      fore(i,0,M)
        grid[X[i]] = W[i];
      long long dp[N+5];
      memset(dp,0,sizeof dp);
      dp[1] = grid[0];
      fore(i,0,N) {
        dp[i] += grid[i+1];
        if(i>1)
          dp[i]+=dp[i-2];
        if(i) {
          long long newDp=0;
          newDp=max(dp[i],dp[i-1]);
          newDp=max(newDp,dp[i]+dp[i-1]-grid[i]);
          dp[i] = max(dp[i],newDp);
        }
      }
      ans = dp[N-1];
    }
    return ans;
}

Subtask #1
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	2140 KB	Output is correct
2	Correct	17 ms	2636 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	54 ms	7284 KB	Output is correct
6	Correct	55 ms	7284 KB	Output is correct

Subtask #2
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	29 ms	5428 KB	Output is correct
3	Correct	34 ms	6480 KB	Output is correct
4	Correct	18 ms	2140 KB	Output is correct
5	Correct	20 ms	2648 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	15 ms	3708 KB	Output is correct
13	Correct	18 ms	4184 KB	Output is correct
14	Correct	16 ms	3712 KB	Output is correct
15	Correct	17 ms	3932 KB	Output is correct
16	Correct	16 ms	3676 KB	Output is correct
17	Correct	17 ms	4056 KB	Output is correct

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	1884 KB	Output is correct
3	Incorrect	10 ms	2904 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '6744065803165511594'
4	Halted	0 ms	0 KB	-

Subtask #4
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	1st lines differ - on the 1st token, expected: '3', found: '4'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	1st lines differ - on the 1st token, expected: '3', found: '4'
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	1st lines differ - on the 1st token, expected: '3', found: '4'
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	1884 KB	Output is correct
3	Incorrect	10 ms	2904 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '6744065803165511594'
4	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	2140 KB	Output is correct
2	Correct	17 ms	2636 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	54 ms	7284 KB	Output is correct
6	Correct	55 ms	7284 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	29 ms	5428 KB	Output is correct
9	Correct	34 ms	6480 KB	Output is correct
10	Correct	18 ms	2140 KB	Output is correct
11	Correct	20 ms	2648 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	15 ms	3708 KB	Output is correct
19	Correct	18 ms	4184 KB	Output is correct
20	Correct	16 ms	3712 KB	Output is correct
21	Correct	17 ms	3932 KB	Output is correct
22	Correct	16 ms	3676 KB	Output is correct
23	Correct	17 ms	4056 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	1 ms	1884 KB	Output is correct
26	Incorrect	10 ms	2904 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '6744065803165511594'
27	Halted	0 ms	0 KB	-

Submission #1079299

Compilation message