oj.uz

Submission #642208

# Submission time Handle Problem Language Result Execution time Memory
642208 2022-09-18T22:14:11 Z tigar Catfish Farm (IOI22_fish) C++17
3 / 100
 90 ms 11560 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W)
{
    bool subtask1=true, subtask2=true/*, subtask3=true*/;
    for(int i=0; i<M; i++)
    {
        if(X[i]%2!=0)subtask1=false;
        if(X[i]>1)subtask2=false;
        //if(Y[i]!=0)subtask3=false;
    }
    if(subtask1)
    {
        ll rez=0;
        for(int i=0; i<M; i++)rez+=W[i];
        return rez;
    }
    if(subtask2)
    {
        ll s1=0, s0=0, m[N][2];
        for(int i=0; i<M; i++)
        {
            if(X[i]==0)s0+=W[i];
            else s1+=W[i];
            m[Y[i]][X[i]]=W[i];
        }
        for(int i=0; i<N; i++)
        {
            m[i][0]=m[max(i-1, 0)][0]+m[i][0];
            m[i][1]=m[max(i-1, 0)][1]+m[i][1];
        }
        if(N==2)return max(m[N-1][0], m[N-1][1]);
        ll rez=0;
        for(int i=0; i<N; i++)
        {
            rez=max(rez, m[i][0]+m[N-1][1]-m[i][0]);
        }
        return rez;
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3276 KB Output is correct
2 Correct 27 ms 4092 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 90 ms 11512 KB Output is correct
6 Correct 86 ms 11560 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '281462383946537'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 300 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 300 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 300 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3276 KB Output is correct
2 Correct 27 ms 4092 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 90 ms 11512 KB Output is correct
6 Correct 86 ms 11560 KB Output is correct
7 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '281462383946537'
8 Halted 0 ms 0 KB -