QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#537234#4561. Catfish FarmModyKachef#0 17ms12064kbC++20862b2024-08-30 00:03:022024-08-30 00:03:03

Judging History

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

  • [2024-08-30 00:03:03]
  • 评测
  • 测评结果:0
  • 用时:17ms
  • 内存:12064kb
  • [2024-08-30 00:03:02]
  • 提交

answer

#include "fish.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("trapv")

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  vector<vector<int>> v;
  v.resize(N); 
  for (int i = 0 ; i < M ; i++){
    v[X[i]].push_back(W[i]); 
  }
  vector<int> u(N+1);
  for (int i = 0 ; i < N ; i++){
    //for (auto j : v[i]) cout << j << ' '; 
    if (!v[i].empty()) u[i+1] = v[i][0];
  }
  //cout << '\n';
  long long dp[N+1] = {};
  dp[1] = u[1];
  for (int i = 2 ; i <= 3 ; i++){
    dp[i] = max(dp[i-1] , dp[i-2] + u[i]); 
   // cout << i << ' ' << u[i] << ' ' << dp[i-1] << ' ' << dp[i-2] << '\n';
  }
  for (int i = 4 ; i <= N ; i++){
    dp[i] = max({dp[i-1] , dp[i-2] + u[i] , dp[i-4] + u[i-2] + u[i-1]});
  }
  return dp[N]; 
}

詳細信息

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 11ms
memory: 8744kb

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:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
55091480

result:

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

Subtask #2:

score: 0
Wrong Answer

Test #7:

score: 0
Wrong Answer
time: 0ms
memory: 4072kb

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
Wrong Answer

Test #20:

score: 9
Accepted
time: 0ms
memory: 6584kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
100000 1
0 0 10082010

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
10082010

result:

ok 3 lines

Test #21:

score: 9
Accepted
time: 3ms
memory: 6976kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
100000 1
99999 0 882019

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
882019

result:

ok 3 lines

Test #22:

score: 0
Wrong Answer
time: 15ms
memory: 9300kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
90000 53444
40538 0 933021958
22736 0 403565340
52395 0 535014365
46488 0 818102149
19082 0 825246110
7712 0 581240932
30019 0 143288209
16519 0 206714026
8855 0 737518859
44939 0 63482743
40524 0 963968043
2663 0 953447256
25511 0 762455895
10794 0 880225092...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
18478940299979

result:

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

Subtask #4:

score: 0
Wrong Answer

Test #28:

score: 0
Wrong Answer
time: 0ms
memory: 3772kb

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
Wrong Answer

Test #60:

score: 0
Wrong Answer
time: 17ms
memory: 12064kb

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:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
50000

result:

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

Subtask #8:

score: 0
Skipped

Dependency #1:

0%