제출 #699257

#제출 시각아이디문제언어결과실행 시간메모리
699257dattranxxxToys (CEOI18_toy)C++11
79 / 100
5071 ms85512 KiB
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 1e5 + 5;

int n;
vector<int> divi[N];
map<int, bool> vis[N];

vector<pair<int, int>> adj[N];

int main() {
  cin.tie(0)->sync_with_stdio(0); cout.tie(0);
  cin >> n;
  vector<int> d;
  for (int i = 2; i * i <= n; ++i) if (n % i == 0) {
    d.emplace_back(i);
    if (i * i != n) d.emplace_back(n / i);
  }
  d.emplace_back(n);
  sort(d.begin(), d.end());
  
  for (int i = 0; i < d.size(); ++i) {
    for (int j = 0; j < i; ++j) if (d[i] % d[j] == 0) {
      int k = lower_bound(d.begin(), d.end(), d[i] / d[j]) - d.begin();
      adj[i].emplace_back(j, k);
    }
  }

  
  queue<pair<int, int>> q;
  q.emplace(d.size() - 1, 0);
  
  while (!q.empty()) {
    int i, s; tie(i, s) = q.front(); q.pop();
    
    for (auto& p : adj[i]) {
      int j, k; tie(j, k) = p;
      if (!vis[k][s + d[j] - 1]) {
        q.emplace(k, s + d[j] - 1);
        vis[k][s + d[j] - 1] = 1;
      }
    }
    
    vis[d.size()][s + d[i] - 1] = 1;
  }
  
  cout << vis[d.size()].size() << '\n';
  for (auto& x : vis[d.size()]) {
    cout << x.first << ' ';
  }
  
  
  
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

toy.cpp: In function 'int main()':
toy.cpp:24:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for (int i = 0; i < d.size(); ++i) {
      |                   ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...