oj.uz

Submission #419055

# Submission time Handle Problem Language Result Execution time Memory
419055 2021-06-06T11:23:56 Z EncryptingWolf Split the Attractions (IOI19_split) C++14
11 / 100
 97 ms 10940 KB 
#include <vector>
#include <iostream>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define FOR(i,x,y) for (ll i = x; i <y; i++)

vector<vector<int>> adj;

vector<int> ret;
int counts = 0;
int B;
void dfs(int x)
{
	if (counts >= B)
		return;
	if (ret[x] == 2)
		return;
	ret[x] = 2;
	counts++;

	for (auto i : adj[x])
		dfs(i);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
	B = b;
	adj.resize(n);
	ret.resize(n, 3);
	FOR(i, 0, p.size())
	{
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	dfs(0);
	FOR(i, 0, n)
	{
		if (ret[i] != 2)
		{
			ret[i] = 1;
			return ret;
		}
	}

	return ret;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:7:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define FOR(i,x,y) for (ll i = x; i <y; i++)
......
   32 |  FOR(i, 0, p.size())
      |      ~~~~~~~~~~~~~~                  
split.cpp:32:2: note: in expansion of macro 'FOR'
   32 |  FOR(i, 0, p.size())
      |  ^~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 1 ms 288 KB ok, correct split
4 Incorrect 0 ms 204 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 1 ms 204 KB ok, correct split
4 Correct 79 ms 9768 KB ok, correct split
5 Correct 67 ms 8672 KB ok, correct split
6 Correct 64 ms 8528 KB ok, correct split
7 Correct 81 ms 10156 KB ok, correct split
8 Correct 97 ms 10940 KB ok, correct split
9 Correct 64 ms 8108 KB ok, correct split
10 Correct 49 ms 8488 KB ok, correct split
11 Correct 56 ms 8496 KB ok, correct split
12 Correct 53 ms 8492 KB ok, correct split

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB invalid split: #1=1, #2=1, #3=3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB invalid split: #1=1, #2=2, #3=6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB ok, correct split
2 Correct 1 ms 204 KB ok, correct split
3 Correct 1 ms 288 KB ok, correct split
4 Incorrect 0 ms 204 KB invalid split: #1=1, #2=1, #3=2
5 Halted 0 ms 0 KB -