oj.uz

답안 #858208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858208 2023-10-07T15:10:15 Z vjudge1 메기 농장 (IOI22_fish) C++17
3 / 100
 72 ms 7504 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int64_t max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    bool even = true;
    bool sub2 = true;

    for(int i=0; i<m; i++) {
        if(x[i] % 2 == 1) even = false;
        if(x[i] > 1) sub2 = false;
    }

    if(even) {
        ll ans = 0;
        for(int &x : w) ans += x;
        return ans;
    }

    if(sub2) {
        vector<ll> ans(2, 0);
        for(int i=0; i<m; i++)
            ans[x[i]] += w[i];
        return max(ans[0], ans[1]);
    }

    return 0;
}

// int32_t main() {
//     setIO();

//     int n, m;
//     cin >> n >> m;

//     int x[m], y[m], w[m];
//     for(int i=0; i<m; i++)
//         cin >> x[i] >> y[i] >> w[i];
    
//     cout << max_weights(n, m, x, y, w) << '\n';
//     return 0;
// }

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2140 KB Output is correct
2 Correct 21 ms 2644 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 65 ms 7252 KB Output is correct
6 Correct 72 ms 7504 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2140 KB Output is correct
2 Correct 21 ms 2644 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 65 ms 7252 KB Output is correct
6 Correct 72 ms 7504 KB Output is correct
7 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -