oj.uz

Submission #297112

# Submission time Handle Problem Language Result Execution time Memory
297112 2020-09-11T09:08:55 Z tmwilliamlin168 Fun Tour (APIO20_fun) C++14
0 / 100
 1 ms 512 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> createFunTour(int n, int q) {
	vector<int> s(n), d(n), ans;
	array<int, 2> c{n+1};
	for(int i=0; i<n; ++i) {
		s[i]=attractionsBehind(0, i);
		if(s[i]>n/2)
			c=min(array<int, 2>{s[i], i}, c);
	}
	vector<int> e;
	for(int i=0; i<n; ++i) {
		d[i]=hoursRequired(c[1], i);
		if(d[i]==1)
			e.push_back(i);
	}
	vector<vector<int>> d2(e.size()-1), f(e.size());
	for(int i=0; i<e.size()-1; ++i)
		for(int j=0; j<n; ++j)
			d2[i].push_back(hoursRequired(e[i], j));
	for(int i=0; i<n; ++i) {
		if(i==c[1])
			continue;
		int j=0;
		while(j<e.size()-1&&d2[j][i]>d[i])
			++j;
		f[j].push_back(i);
	}
	vector<int> g;
	for(int i=0; i<e.size(); ++i)
		g.insert(g.end(), f[i].begin(), f[i].end());
	sort(g.begin(), g.begin()+n/2, [&](const int &i, const int &j) {
		return d[i]>d[j];
	});
	sort(g.begin()+n/2, g.end(), [&](const int &i, const int &j) {
		return d[i]>d[j];
	});
	for(int i=0; i<n/2; ++i) {
		ans.push_back(g[i]);
		if(i+n/2<g.size())
			ans.push_back(g[i+n/2]);
	}
	ans.push_back(c[1]);
	// for(int a : ans)
		// cout << a << endl;
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for(int i=0; i<e.size()-1; ++i)
      |               ~^~~~~~~~~~~
fun.cpp:27:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   while(j<e.size()-1&&d2[j][i]>d[i])
      |         ~^~~~~~~~~~~
fun.cpp:32:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for(int i=0; i<e.size(); ++i)
      |               ~^~~~~~~~~
fun.cpp:42:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   if(i+n/2<g.size())
      |      ~~~~~^~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Incorrect 1 ms 256 KB Tour is not fun
12 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Incorrect 1 ms 256 KB Tour is not fun
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Incorrect 1 ms 512 KB Tour is not fun
13 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Tour is not fun
5 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Incorrect 1 ms 256 KB Tour is not fun
12 Halted 0 ms 0 KB -