oj.uz

Submission #1022635

# Submission time Handle Problem Language Result Execution time Memory
1022635 2024-07-13T19:50:09 Z grafff Catfish Farm (IOI22_fish) C++17
9 / 100
 66 ms 15060 KB 
#include<bits/stdc++.h>

using namespace std;

long long group1(vector <int> W)
{
    long long sum = 0;
    for(int i : W)
    {
        sum += i;
    }
    return sum;
}

long long group2(int N, int M, vector <int> X, vector <int> Y, vector <int> W)
{
    long long pref[2][N], cord = -1, mx = 0;
    for(int i = 0; i < 2; i++)
    {
        for(int j = 0; j < N; j++)
        {
            pref[i][j] = 0;;
        }
    }
    for(int i = 0; i < M; i++)
    {
        pref[X[i]][Y[i]] = W[i];
    }
    for(int i = 0; i < 2; i++)
    {
        for(int j = 1; j < N; j++)
        {
            pref[i][j] += pref[i][j - 1];
        }
    }
    for(int i = 0; i < N; i++)
    {
        if(pref[0][i] - pref[1][i] > mx)
        {
            mx = pref[0][i] - pref[1][i];
            cord = i;
        }
    }
    long long sum = pref[1][N - 1];
    if(cord >= 0)
    {
        sum = sum - pref[1][cord] + pref[0][cord];
    }
    if(N == 2)
    {
        sum = max(pref[0][1], pref[1][1]);
    }
    return sum;
}

long long group3(int N, int M, vector <int> X, vector <int> Y, vector <int> W)
{
    long long dp[2][N], a[N];
    for(int i = 0; i < N; i++)
    {
        dp[0][i] = 0;
        dp[1][i] = 0;
        a[i] = 0;
    }
    for(int i = 0; i < M; i++)
    {
        a[X[i]] = W[i];
    }
    for(int i = 1; i < N; i++)
    {
        if(i > 1)
        {
            dp[1][i] = dp[0][i - 2] + a[i - 1];
        }
        else
        {
            dp[1][i] = dp[0][i - 1] + a[i - 1];
        }
        dp[0][i] = max(dp[0][i - 1], dp[1][i - 1] + a[i]);
    }
    return max(dp[0][N - 1], dp[1][N - 1]);
}

long long group4()
{
}

long long group5()
{
}

long long group6()
{
}

long long group7()
{
}

long long full()
{
}

long long max_weights(int N, int M, vector <int> X, vector <int> Y, vector <int> W)
{
    bool flag1 = true;
    bool flag2 = true;
    bool flag3 = true;
    bool flag4 = true;
    for(int i = 0; i < M; i++)
    {
        if(X[i] % 2 != 0)
        {
            flag1 = false;
        }
        if(X[i] > 1)
        {
            flag2 = false;
        }
        if(Y[i] != 0)
        {
            flag3 = false;
        }
        if(Y[i] > 8)
        {
            flag4 = false;
        }
    }
    //cout << flag1 << " " << flag2 << " " << flag3 << " " << flag4 << endl;
    if(flag1)
    {
        return group1(W);
    }
    if(flag2)
    {
        return group2(N, M, X, Y, W);
    }
    if(flag3)
    {
        return group3(N, M, X, Y, W);
    }
    if(flag4)
    {
        return group4();
    }
    return 0;
}
/**
int main()
{
    ios_base::sync_with_stdio(false);
    cout << max_weights(3, 3, {0, 1, 2}, {0, 0, 0}, {1, 1, 1});
}
/**/

Compilation message

fish.cpp:154:1: warning: "/*" within comment [-Wcomment]
  154 | /**/
      |  
fish.cpp: In function 'long long int group4()':
fish.cpp:86:1: warning: no return statement in function returning non-void [-Wreturn-type]
   86 | }
      | ^
fish.cpp: In function 'long long int group5()':
fish.cpp:90:1: warning: no return statement in function returning non-void [-Wreturn-type]
   90 | }
      | ^
fish.cpp: In function 'long long int group6()':
fish.cpp:94:1: warning: no return statement in function returning non-void [-Wreturn-type]
   94 | }
      | ^
fish.cpp: In function 'long long int group7()':
fish.cpp:98:1: warning: no return statement in function returning non-void [-Wreturn-type]
   98 | }
      | ^
fish.cpp: In function 'long long int full()':
fish.cpp:102:1: warning: no return statement in function returning non-void [-Wreturn-type]
  102 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3928 KB Output is correct
2 Correct 19 ms 4680 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 66 ms 14808 KB Output is correct
6 Correct 59 ms 15060 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 32 ms 10128 KB Output is correct
3 Correct 48 ms 12368 KB Output is correct
4 Correct 15 ms 3828 KB Output is correct
5 Correct 17 ms 4816 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 15 ms 5980 KB Output is correct
13 Correct 20 ms 7104 KB Output is correct
14 Correct 16 ms 5980 KB Output is correct
15 Correct 19 ms 6584 KB Output is correct
16 Correct 18 ms 5968 KB Output is correct
17 Correct 18 ms 6492 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Incorrect 11 ms 5212 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20490646833592'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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

# Verdict Execution time Memory Grader output
1 Incorrect 1 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

# Verdict Execution time Memory Grader output
1 Incorrect 1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Incorrect 11 ms 5212 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20490646833592'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3928 KB Output is correct
2 Correct 19 ms 4680 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 66 ms 14808 KB Output is correct
6 Correct 59 ms 15060 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 32 ms 10128 KB Output is correct
9 Correct 48 ms 12368 KB Output is correct
10 Correct 15 ms 3828 KB Output is correct
11 Correct 17 ms 4816 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 15 ms 5980 KB Output is correct
19 Correct 20 ms 7104 KB Output is correct
20 Correct 16 ms 5980 KB Output is correct
21 Correct 19 ms 6584 KB Output is correct
22 Correct 18 ms 5968 KB Output is correct
23 Correct 18 ms 6492 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Incorrect 11 ms 5212 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20490646833592'
27 Halted 0 ms 0 KB -