oj.uz

답안 #966197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966197 2024-04-19T13:58:02 Z andrej246 메기 농장 (IOI22_fish) C++17
6 / 100
 68 ms 10068 KB 
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

#define NL '\n'
#define EL cout << NL
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define FORS(i,s,n) for(int i = (s); i < (n); i++)
#define PRINTV(v) for(auto a:v) {cout << a << " ";} EL;
#define PRINTVV(v) for(auto a:v) {PRINTV(a);}
#define f first
#define s second
#define all(v) (v).begin(),(v).end()
#define STRP(p) "{" << (p).f << "," << (p).s << "}"
#define PRINTVP(v) for(auto a:v) {cout << STRP(a) << " ";} EL;
#define PRINTVVP(v) for(auto a:v) {PRINTVP(a);}

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<vpl> vvpl;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    vl left(N);
    vl right(N);
    FOR(i,M) {
        if (X[i] == 0) left[Y[i]] = W[i];
        else right[Y[i]] = W[i];
    }
    if (N == 2) {
        return max(right[0]+right[1],left[0]+left[1]);
    }
    ll ans = 0;
    FOR(i,N) {
        ans += right[i];
    }
    ll psum = ans;
    FOR(i,N) {
        psum += left[i]-right[i];
        ans = max(ans,psum);
    }
    return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 3568 KB Output is correct
2 Correct 23 ms 4188 KB Output is correct
3 Correct 1 ms 2136 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Incorrect 68 ms 8808 KB 1st lines differ - on the 1st token, expected: '149814460735479', found: '49851995244248'
6 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 39 ms 5460 KB Output is correct
3 Correct 46 ms 10068 KB Output is correct
4 Correct 19 ms 4952 KB Output is correct
5 Correct 23 ms 6088 KB Output is correct
6 Correct 1 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 1 ms 1884 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 18 ms 4956 KB Output is correct
13 Correct 22 ms 5976 KB Output is correct
14 Correct 20 ms 4956 KB Output is correct
15 Correct 21 ms 5464 KB Output is correct
16 Correct 23 ms 4956 KB Output is correct
17 Correct 27 ms 5468 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '2268305442'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '2268305442'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '2268305442'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 3568 KB Output is correct
2 Correct 23 ms 4188 KB Output is correct
3 Correct 1 ms 2136 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Incorrect 68 ms 8808 KB 1st lines differ - on the 1st token, expected: '149814460735479', found: '49851995244248'
6 Halted 0 ms 0 KB -