結果

問題 No.1528 Not 1
ユーザー Ogtsn99Ogtsn99
提出日時 2021-06-04 21:03:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,121 bytes
コンパイル時間 2,923 ms
コンパイル使用メモリ 220,620 KB
実行使用メモリ 21,344 KB
最終ジャッジ日時 2024-11-19 10:59:35
合計ジャッジ時間 8,263 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 522 ms
18,912 KB
testcase_02 AC 118 ms
8,320 KB
testcase_03 AC 177 ms
10,336 KB
testcase_04 AC 494 ms
18,528 KB
testcase_05 AC 40 ms
5,760 KB
testcase_06 AC 293 ms
13,408 KB
testcase_07 AC 548 ms
19,424 KB
testcase_08 AC 189 ms
10,848 KB
testcase_09 AC 64 ms
6,656 KB
testcase_10 AC 209 ms
11,236 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 3 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 645 ms
21,344 KB
testcase_19 AC 646 ms
21,344 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
// p.real() or real(p) -> x軸, p.imag() or imag(p) -> y軸
using Vector2d = complex<Real>;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;

template<typename T>
int getIndexOfLowerBound(vector<T> &v, T x) {
    return lower_bound(v.begin(), v.end(), x) - v.begin();
}

template<typename T>
int getIndexOfUpperBound(vector<T> &v, T x) {
    return upper_bound(v.begin(), v.end(), x) - v.begin();
}

template<class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)

istream &operator>>(istream &is, Point &p) {
    Real a, b;
    is >> a >> b;
    p = Point(a, b);
    return is;
}

template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << pair_var.first << ' ' << pair_var.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    for (int i = 0; i < vec.size(); i++)
        os << vec[i] << ' ';
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, vector<pair<T, U>> &vec) {
    for (int i = 0; i < vec.size(); i++)
        os << vec[i] << '\n';
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
    for (auto &vec : df) os << vec;
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    repi(itr, map_var) {
        os << *itr << ' ';
        itr++;
        itr--;
    }
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    repi(itr, set_var) {
        os << *itr << ' ';
        itr++;
        itr--;
    }
    return os;
}

void print() { cout << endl; }

template<class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0) cout << " ";
    print(forward<Tail>(tail)...);
}

vector <bool>  primes(1000000,1) ;
void Eratosthenes(int n){
    for(int i = 2; i <= sqrt(n); i++){
		if(primes[i]){
			for(int j = 0; i * (j + 2) <= n; j++){
				primes[i *(j + 2)] = 0;
			}
		}
	}
	primes[0] = 0; primes[1] = 0;
}

vector< int > DIV(int64_t n) {
  vector<int> ret;
  for(int i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      ret.push_back(i);
      if(i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return (ret);
}

signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    int n; cin>>n;
    Eratosthenes(n+10);
    vector <int> ans;
    if(n == 1 || n == 2) {
        print(1);
        return 0;
    }

    int start = 2;
    string turn = "small";

    for (int i = 3; i <= n; ++i) {
        if (i % 2 == 0 && primes[i / 2]) {
            start = i / 2;
            turn = "big";
        }
    }

    map<int, bool> used;
    map<int, bool> usedNum;
    used[1] = true;


    while(ans.size() < (n+1)/2) {
        if(used[start]) break;
        if(turn == "big") {
            used[start] = true;
            vector<int> add;
            for (int i = 1; i < 1145141919; ++i) {
                if(start * i <= n) {
                    if(!usedNum[start*i]) {
                        add.pb(start * i);
                        usedNum[start*i] = true;
                    }
                } else break;
            }
            for (int i = 0; i < add.size(); ++i) {
                auto tmp = DIV(add[i]);
                for (int j = 0; j < tmp.size(); ++j) {
                    if(!used[tmp[j]]) {
                        swap(add[i], add[add.size()-1]);
                        start = tmp[j];
                        break;
                    }
                }
            }
            for (int i = 0; i < add.size(); ++i) {
                ans.push_back(add[i]);
            }
            turn = "small";
        } else {
            used[start] = true;
            vector<int> add;
            for (int i = 1; i < 1145141919; ++i) {
                if(start * i <= n) {
                    if(!usedNum[start*i]) {
                        add.pb(start * i);
                        usedNum[start*i] = true;
                    }
                } else break;
            }
            for (int i = 0; i < add.size(); ++i) {
                auto tmp = DIV(add[i]);
                for (int j = 0; j < tmp.size(); ++j) {
                    if(!used[tmp[j]]) {
                        swap(add[i], add[add.size()-1]);
                        start = tmp[j];
                    }
                }
            }
            for (int i = 0; i < add.size(); ++i) {
                ans.push_back(add[i]);
            }
            turn = "big";
        }
    }
    if(ans.size() >= (n+1) / 2) {
        for (int i = 0; i < (n+1) / 2; ++i) {
            cout << ans[i] << ' ';
        }
    } else print("No");

}
0