結果
問題 | No.5009 Draw A Convex Polygon |
ユーザー | 👑 AngrySadEight |
提出日時 | 2022-12-02 02:08:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,260 ms / 2,600 ms |
コード長 | 3,265 bytes |
コンパイル時間 | 6,036 ms |
実行使用メモリ | 66,844 KB |
スコア | 1,000,000 |
平均クエリ数 | 1000001.00 |
最終ジャッジ日時 | 2022-12-02 02:08:17 |
合計ジャッジ時間 | 11,585 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
純コード判定しない問題か言語 |
(要ログイン)
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll my_gcd(ll a, ll b){ ll ret = 0; if (a < b){ swap(a, b); } if (b == 0){ ret = a; } else{ ret = my_gcd(b, a % b); } return ret; } int main(){ vector<pair<double, pll>> vec(0); for (ll i = 1; i <= 1000; i++){ for (ll j = 1; j <= 2000; j++){ if (my_gcd(i, j) == 1){ double d = (double)j / (double)i; pll p = pll(i, j); vec.push_back(pair<double, pll>(d, p)); } } } sort(all(vec)); //cout << vec.size() << endl; vector<pll> ans(1000000); ll x = 0; ll y = 0; for (ll i = 0; i < 1000000; i++){ ans[i].first = x; ans[i].second = y; x += vec[i].second.first; y += vec[i].second.second; } ans[999998].first = x; ans[999998].second = y; ans[999999].first = 0; ans[999999].second = y; //cout << x << " " << y << endl; cout << 1000000 << endl; for (ll i = 0; i < 1000000; i++){ cout << ans[i].first << " " << ans[i].second << endl; } }