oj.uz

답안 #834018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834018 2023-08-22T10:10:46 Z finn__ 식물 비교 (IOI20_plants) C++17
19 / 100
 4000 ms 5036 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse4")

#include <bits/stdc++.h>

#include "plants.h"

using namespace std;

constexpr size_t N = 200000;

size_t n;
int subtask, s[N], h[N];

void init(int k, std::vector<int> r)
{
    n = r.size();
    if (k == 2)
        subtask = 1;
    else
        subtask = 2;

    if (subtask == 1)
    {
        partial_sum(r.begin(), r.end(), s);
    }
    else
    {
        for (size_t i = 0; i < n - 1; ++i)
        {
            int conseq_nonzero = 0, next_max = 0;
            for (size_t j = 0; j < 2 * n;)
            {
                while (j < 2 * n && !r[j % n])
                    ++j;
                size_t k = j;
                while (k < 2 * n && r[k % n])
                    ++k;
                if (k - j > conseq_nonzero)
                    conseq_nonzero = k - j, next_max = k % n;
                j = k;
            }

            h[next_max] = n - i;
            r[next_max] = -1;

            for (int j = next_max - k + 1; j < next_max; ++j)
                r[(j + (int)n) % n]--;
        }
    }
}

int compare_plants(int x, int y)
{
    if (subtask == 1)
    {
        int z = s[y - 1] - (x ? s[x - 1] : 0);
        return !z ? 1 : (z == y - x ? -1 : (!(s[n - 1] - z) ? -1 : ((s[n - 1] - z == n - (y - x) ? 1 : 0))));
    }
    else
    {
        return h[x] > h[y] ? 1 : -1;
    }
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:39:27: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |                 if (k - j > conseq_nonzero)
      |                     ~~~~~~^~~~~~~~~~~~~~~~
plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:58:83: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         return !z ? 1 : (z == y - x ? -1 : (!(s[n - 1] - z) ? -1 : ((s[n - 1] - z == n - (y - x) ? 1 : 0))));
      |                                                                      ~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 37 ms 3048 KB Output is correct
7 Correct 46 ms 3268 KB Output is correct
8 Correct 54 ms 4940 KB Output is correct
9 Correct 54 ms 4992 KB Output is correct
10 Correct 54 ms 4940 KB Output is correct
11 Correct 55 ms 4988 KB Output is correct
12 Correct 55 ms 4940 KB Output is correct
13 Correct 56 ms 5036 KB Output is correct
14 Correct 55 ms 4940 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 212 KB Output is correct
6 Correct 14 ms 376 KB Output is correct
7 Correct 339 ms 3096 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 13 ms 340 KB Output is correct
10 Correct 341 ms 3100 KB Output is correct
11 Correct 308 ms 3088 KB Output is correct
12 Correct 320 ms 3224 KB Output is correct
13 Correct 381 ms 3100 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 212 KB Output is correct
6 Correct 14 ms 376 KB Output is correct
7 Correct 339 ms 3096 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 13 ms 340 KB Output is correct
10 Correct 341 ms 3100 KB Output is correct
11 Correct 308 ms 3088 KB Output is correct
12 Correct 320 ms 3224 KB Output is correct
13 Correct 381 ms 3100 KB Output is correct
14 Execution timed out 4027 ms 2884 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 80 ms 3148 KB Output is correct
4 Execution timed out 4005 ms 4240 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 37 ms 3048 KB Output is correct
7 Correct 46 ms 3268 KB Output is correct
8 Correct 54 ms 4940 KB Output is correct
9 Correct 54 ms 4992 KB Output is correct
10 Correct 54 ms 4940 KB Output is correct
11 Correct 55 ms 4988 KB Output is correct
12 Correct 55 ms 4940 KB Output is correct
13 Correct 56 ms 5036 KB Output is correct
14 Correct 55 ms 4940 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 7 ms 212 KB Output is correct
20 Correct 14 ms 376 KB Output is correct
21 Correct 339 ms 3096 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 13 ms 340 KB Output is correct
24 Correct 341 ms 3100 KB Output is correct
25 Correct 308 ms 3088 KB Output is correct
26 Correct 320 ms 3224 KB Output is correct
27 Correct 381 ms 3100 KB Output is correct
28 Execution timed out 4027 ms 2884 KB Time limit exceeded
29 Halted 0 ms 0 KB -