oj.uz

답안 #1002336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002336 2024-06-19T12:52:50 Z overwatch9 메기 농장 (IOI22_fish) C++17
3 / 100
 49 ms 13908 KB 
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// vector <vector <pair <int, ll>>> fish;
// vector <vector <ll>> pfx;
// int n, m;
// ll get_sum(int l, int r, int col) {
//     int it = upper_bound(fish[col].begin(), fish[col].end(), l) - fish[col].begin();
//     it--;
//     int it2 = upper_bound(fish[col].begin(), fish[col].end(), r) - fish[col].begin();
//     it2--;
//     return pfx[col][it2] - pfx[col][it];
// }
vector <vector <ll>> dp;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    // n = N;
    // m = M;
    // fish.resize(N+1);
    // pfx.resize(N+1);
    // dp = vector <vector <ll>> (N+1, vector <ll> (N+1, -1));
    ll ans = 0;
    for (int i = 0; i < M; i++) {
        // fish[X[i]+1].push_back({Y[i]+1, W[i]});
        ans += W[i];
    }
    return ans;
    // for (int i = 1; i <= N; i++) {
    //     fish[i].push_back(0);
    //     sort(fish[i].begin(), fish[i].end());
    //     for (int j = 1; j < fish[i].size(); j++)
    //         pfx[i][j] = pfx[i][j-1] + fish[i][j].second;
    // }
    
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 3676 KB Output is correct
2 Correct 24 ms 4436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 48 ms 13796 KB Output is correct
6 Correct 49 ms 13908 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 25 ms 6484 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80901044391025'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Incorrect 15 ms 2392 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 440 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 388 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 440 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 388 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 440 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 388 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Incorrect 15 ms 2392 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 3676 KB Output is correct
2 Correct 24 ms 4436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 48 ms 13796 KB Output is correct
6 Correct 49 ms 13908 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 25 ms 6484 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80901044391025'
9 Halted 0 ms 0 KB -