QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#536496#4561. Catfish FarmWansur#0 2ms8216kbC++231.1kb2024-08-29 13:48:562024-08-29 13:48:57

Judging History

你现在查看的是最新测评结果

  • [2024-08-29 13:48:57]
  • 评测
  • 测评结果:0
  • 用时:2ms
  • 内存:8216kb
  • [2024-08-29 13:48:56]
  • 提交

answer

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 2e5 + 12;

vector<pair<int, int>> g[maxn];
ll dp[322][322][322], pref[2022][2022];
ll a[2022][2022];

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    ll ans = 0;
    for(int i=0;i<m;i++){
        x[i]++, y[i]++;
        a[x[i]][y[i]] += w[i];
        for(int x=0;x<=n;x++){
            for(int y=0;y<=n;y++){
                dp[i][x][y] = -1e18;
            }
        }
    }
    dp[0][0][0] = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            pref[i][j] = pref[i][j-1] + a[i][j];
        }
        for(int l=0;l<=min(n, 8);l++){
            for(int x=0;x<=min(n, 8);x++){
                for(int y=0;y<=min(n, 8);y++){
                    ll val = dp[i-1][l][x];
                    ans = max(ans, val);
                    if(x > y) val += pref[i][x] - pref[i][y];
                    if(max(l, x) < y) val += pref[i-1][y] - pref[i-1][max(l, x)];
                    dp[i][x][y] = max(dp[i][x][y], val);
                }
            }
        }
    }
    return ans;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Time Limit Exceeded

Test #1:

score: 0
Time Limit Exceeded

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
90000 80699
0 10792 55091480
0 36762 389250726
0 79267 706445371
0 76952 290301137
0 13444 69711795
0 68980 66221400
0 1695 703252611
0 36628 632571604
0 87676 264578012
0 79496 397448339
0 57929 447544332
0 35453 355374818
0 62449 686423696
0 45614 667165709...

output:

Unauthorized output

result:


Subtask #2:

score: 0
Wrong Answer

Test #7:

score: 0
Wrong Answer
time: 2ms
memory: 8216kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
3 2
0 0 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
1

result:

wrong answer 3rd lines differ - expected: '2', found: '1'

Subtask #3:

score: 0
Time Limit Exceeded

Test #20:

score: 0
Time Limit Exceeded

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
100000 1
0 0 10082010

output:

Unauthorized output

result:


Subtask #4:

score: 0
Wrong Answer

Test #28:

score: 0
Wrong Answer
time: 1ms
memory: 7948kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
4 3
2 2 1
0 0 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
2

result:

wrong answer 3rd lines differ - expected: '3', found: '2'

Subtask #5:

score: 0
Skipped

Dependency #4:

0%

Subtask #6:

score: 0
Skipped

Dependency #5:

0%

Subtask #7:

score: 0
Runtime Error

Test #60:

score: 0
Runtime Error

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
100000 99999
31026 31026 1
42940 42940 1
69303 69303 1
90350 90350 1
77507 77507 1
87126 87126 1
17988 17988 1
5146 5146 1
63023 63023 1
27776 27776 1
6136 6136 1
82557 82557 1
24904 24904 1
21667 21667 1
67271 67271 1
80294 80294 1
81145 81145 1
47144 47144 ...

output:

Unauthorized output

result:


Subtask #8:

score: 0
Skipped

Dependency #1:

0%