oj.uz

Submission #626347

# Submission time Handle Problem Language Result Execution time Memory
626347 2022-08-11T11:58:08 Z boris_mihov Catfish Farm (IOI22_fish) C++17
9 / 100
 91 ms 10860 KB 
#include "fish.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXM = 300000 + 10;
const int MAXN = 3000 + 10;
const int INF  = 1e9;

int n, m;
struct Fish
{
    int x, y, w;
    inline friend bool operator < (const Fish &a, const Fish &b)
    {
        return a.x < b.x || (a.x == b.x && a.y < b.y);
    }

} fish[MAXM];

llong solveOdd()
{
    llong ans = 0;
    for (int i = 1 ; i <= m ; ++i)
    {
        ans += fish[i].w;
    }

    return ans;
}

llong solveX12()
{
    llong sum[2];
    sum[0] = sum[1] = 0;
    for (int i = 1 ; i <= m ; ++i)
    {
        --fish[i].x;
        sum[fish[i].x] += fish[i].w; 
    }

    if (n == 2)
    {
        return std::max(sum[0], sum[1]);
    }
    std::sort(fish+1, fish+1+m);
    int ptr0 = 1;
    int ptr1 = 1;
    
    while (ptr1 <= m && fish[ptr1].x == 0) ptr1++;
    if (ptr1 == m+1) return sum[0];
    
    sum[0] = 0;
    llong ans = sum[1];
    
    while (ptr0 <= m && fish[ptr0].x == 0)
    {
        sum[0] += fish[ptr0].w;
        while (ptr1 <= m && fish[ptr1].y <= fish[ptr0].y)
        {
            sum[1] -= fish[ptr1].w;
            ++ptr1;
        }

        ans = std::max(ans, sum[0] + sum[1]);
        ptr0++;
    }

    return ans;
}

llong solveY1()
{
    llong ans = 0;
    return ans;
}

llong solveNSmall()
{
    llong ans = 0;
    return ans;
}

llong max_weights(int N, int M, std::vector <int> X, std::vector <int> Y, std::vector <int> W) 
{
    n = N;
    m = M;
    bool isOdd = true;
    bool isX01 = true;
    bool isY0 = true;

    for (int i = 1 ; i <= m ; ++i)    
    {
        ++X[i-1];
        ++Y[i-1];
        fish[i].x = X[i-1];
        fish[i].y = Y[i-1];
        fish[i].w = W[i-1];
        isOdd &= (fish[i].x &1);
        isX01 &= (fish[i].x <= 2);
        isY0 &= (fish[i].y == 1);
    }
    
    if (isOdd) return solveOdd();
    if (isX01) return solveX12();
    if (isY0) return solveY1();
    return solveNSmall();
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3048 KB Output is correct
2 Correct 27 ms 3796 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 91 ms 10860 KB Output is correct
6 Correct 89 ms 10732 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 75 ms 5916 KB Output is correct
3 Correct 75 ms 7256 KB Output is correct
4 Correct 21 ms 3060 KB Output is correct
5 Correct 27 ms 3796 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 220 KB Output is correct
12 Correct 32 ms 3188 KB Output is correct
13 Correct 35 ms 3792 KB Output is correct
14 Correct 32 ms 3244 KB Output is correct
15 Correct 36 ms 3428 KB Output is correct
16 Correct 38 ms 3060 KB Output is correct
17 Correct 44 ms 3412 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 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 212 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 212 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 212 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 1 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 22 ms 3048 KB Output is correct
2 Correct 27 ms 3796 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 91 ms 10860 KB Output is correct
6 Correct 89 ms 10732 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 75 ms 5916 KB Output is correct
9 Correct 75 ms 7256 KB Output is correct
10 Correct 21 ms 3060 KB Output is correct
11 Correct 27 ms 3796 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 220 KB Output is correct
18 Correct 32 ms 3188 KB Output is correct
19 Correct 35 ms 3792 KB Output is correct
20 Correct 32 ms 3244 KB Output is correct
21 Correct 36 ms 3428 KB Output is correct
22 Correct 38 ms 3060 KB Output is correct
23 Correct 44 ms 3412 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
26 Halted 0 ms 0 KB -