oj.uz

답안 #626378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626378 2022-08-11T12:12:57 Z boris_mihov 메기 농장 (IOI22_fish) C++17
9 / 100
 104 ms 10868 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 llong INF = 1e18;

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 dp2[MAXM][2][2];
llong solveY1()
{
    llong ans = 0;
    std::sort(fish+1, fish+1+m);
    fish[0].x = -1;
    dp2[0][1][0] = -INF;
    for (int i = 1 ; i <= m ; ++i)
    {
        dp2[i][0][0] = std::max(dp2[i-1][0][0], dp2[i-1][1][0] + fish[i].w);
        dp2[i][1][0] = std::max(dp2[i-1][0][1], dp2[i-1][1][1]);
        dp2[i][0][1] = std::max(dp2[i-1][0][0], dp2[i-1][1][0]) + fish[i].w;
        dp2[i][1][1] = std::max(dp2[i-1][0][1], dp2[i-1][1][1]);
        if (fish[i].x != fish[i-1].x + 1 && fish[i].x >= 2)
        {
            dp2[i][0][0] = std::max(dp2[i][0][0], dp2[i-1][0][0] + fish[i].w);
        }
    }

    return std::max(dp2[m][0][0], dp2[m][1][0]);
}

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();
}

Compilation message

fish.cpp: In function 'llong solveY1()':
fish.cpp:78:11: warning: unused variable 'ans' [-Wunused-variable]
   78 |     llong ans = 0;
      |           ^~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3060 KB Output is correct
2 Correct 42 ms 3788 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 104 ms 10860 KB Output is correct
6 Correct 98 ms 10868 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 78 ms 5924 KB Output is correct
3 Correct 87 ms 7260 KB Output is correct
4 Correct 25 ms 3020 KB Output is correct
5 Correct 29 ms 3796 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 32 ms 3156 KB Output is correct
13 Correct 37 ms 3788 KB Output is correct
14 Correct 39 ms 3068 KB Output is correct
15 Correct 36 ms 3500 KB Output is correct
16 Correct 32 ms 3156 KB Output is correct
17 Correct 36 ms 3424 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 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

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

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3060 KB Output is correct
2 Correct 42 ms 3788 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 104 ms 10860 KB Output is correct
6 Correct 98 ms 10868 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 78 ms 5924 KB Output is correct
9 Correct 87 ms 7260 KB Output is correct
10 Correct 25 ms 3020 KB Output is correct
11 Correct 29 ms 3796 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 32 ms 3156 KB Output is correct
19 Correct 37 ms 3788 KB Output is correct
20 Correct 39 ms 3068 KB Output is correct
21 Correct 36 ms 3500 KB Output is correct
22 Correct 32 ms 3156 KB Output is correct
23 Correct 36 ms 3424 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Incorrect 26 ms 3888 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20817026671884'
27 Halted 0 ms 0 KB -