oj.uz

Submission #1049997

# Submission time Handle Problem Language Result Execution time Memory
1049997 2024-08-09T06:42:58 Z aykhn Comparing Plants (IOI20_plants) C++17
14 / 100
 132 ms 8440 KB 
#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

const int MXN = 5e3 + 5;

int n;
int a[MXN], cnt[MXN], f[MXN];

void init(int k, vector<int> r) 
{
	n = r.size();
	for (int i = 0; i < n; i++) cnt[i] = k - 1;
	for (int i = 0; i < n; i++)
	{
		vector<int> idx;
		for (int i = 0; i < n; i++)
		{
			if (f[i]) continue;
			if (r[i] == cnt[i]) idx.push_back(i);
		}
		int ind = -1;
		if (idx.size() == 1) ind = idx[0];
		else 
		{
			for (int i = 0; i < idx.size(); i++)
			{
				if ((idx[(i + 1) % (int)idx.size()] - idx[i] + n) % n >= k) 
				{
					ind = idx[(i + 1) % (int)idx.size()];
					break;
				}
			}
		}
		a[ind] = i;
		f[ind] = 1;
		for (int j = (ind - 1 + n) % n; j != (ind - k + n) % n; j = (j - 1 + n) % n) cnt[j]--;
	}
}

int compare_plants(int x, int y) 
{
	return (a[x] > a[y] ? 1 : -1);
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:27:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |    for (int i = 0; i < idx.size(); i++)
      |                    ~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 113 ms 3128 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 520 KB Output is correct
10 Correct 112 ms 3132 KB Output is correct
11 Correct 82 ms 3116 KB Output is correct
12 Correct 125 ms 3404 KB Output is correct
13 Correct 132 ms 3152 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 113 ms 3128 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 4 ms 520 KB Output is correct
10 Correct 112 ms 3132 KB Output is correct
11 Correct 82 ms 3116 KB Output is correct
12 Correct 125 ms 3404 KB Output is correct
13 Correct 132 ms 3152 KB Output is correct
14 Runtime error 21 ms 5724 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 30 ms 3064 KB Output is correct
4 Runtime error 32 ms 8440 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -