Submission #161594

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
161594	2019-11-03T08:30:57 Z	oolimry	Toys (CEOI18_toy)	C++14	Compilation error	0 ms	0 KB

toy

#include <bits/stdc++.h>

using namespace std;

bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    // This is checked so that we can skip
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;

    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}

int p;
bool comp(int x, int y){
	int xx = 0;
	int yy = 0;
	while(x % p == 0){
		xx++;
		x /= p;
	}
	while(y % p == 0){
		yy++;
		y /= p;
	}
	return xx < yy;
}

vector<vector<int> > adj;
unordered_map<int, int> index;
vector<vector<int> > memo;
vector<int> factors;


int main(){
	int n;
	cin >> n;
	
	vector<int> primes;
	for(int i = 1;i <= min(n,100000);i++){
		if(n % i == 0){
			factors.push_back(i);
			factors.push_back(n/i);
		}
	}
	sort(factors.begin(),factors.end());
	factors.erase(unique(factors.begin(),factors.end()),factors.end());
	
	for(int x : factors){
		if(isPrime(x)) primes.push_back(x);
	}
	
	for(int pp : primes){
		p = pp;
		stable_sort(factors.begin(),factors.end(),comp);
	}
	for(int i = 0;i < (int) factors.size();i++){
		vector<int> v;
		adj.push_back(v);
		memo.push_back({});
		index[factors[i]] = i;
	}
	memo[0].push_back({0});
	for(int i = 0;i < (int) factors.size();i++){
		for(int j = i+1;j < (int) factors.size();j++){
			int x = factors[i];
			int y = factors[j];
			if(y % x == 0){
				int z = y / x;
				if(true){
					adj[j].push_back(i);
					//cout << i << " " << j << "\n";
				}
			}
		}
	}
	vector<int> answer;
	for(int i = 1;i < (int) factors.size();i++){
		for(int j : adj[i]){
			int c = factors[i] / factors[j] - 1;
			for(int v : memo[j]){
				memo[i].push_back(v + c);
			}
		}
		answer = memo[i];
		sort(answer.begin(),answer.end());
		answer.erase(unique(answer.begin(),answer.end()),answer.end());
	}
	
	
	//sort(answer.begin(),answer.end());
	//answer.erase(unique(answer.begin(),answer.end()),answer.end());
	cout << answer.size() << "\n";
	for(int x : answer){
		cout << x << " ";
	}
	
}

Compilation message

toy.cpp:38:25: error: 'std::unordered_map<int, int> index' redeclared as different kind of symbol
 unordered_map<int, int> index;
                         ^~~~~
In file included from /usr/include/c++/7/cstring:42:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:48,
                 from toy.cpp:1:
/usr/include/string.h:477:1: note: previous declaration 'const char* index(const char*, int)'
 index (const char *__s, int __c) __THROW
 ^~~~~
toy.cpp: In function 'int main()':
toy.cpp:69:19: error: invalid types '<unresolved overloaded function type>[__gnu_cxx::__alloc_traits<std::allocator<int> >::value_type {aka int}]' for array subscript
   index[factors[i]] = i;
                   ^
toy.cpp:77:9: warning: unused variable 'z' [-Wunused-variable]
     int z = y / x;
         ^