結果
問題 | No.5007 Steiner Space Travel |
ユーザー |
|
提出日時 | 2022-07-30 14:37:57 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 3,560 bytes |
コンパイル時間 | 2,018 ms |
実行使用メモリ | 3,592 KB |
スコア | 1,226,000 |
最終ジャッジ日時 | 2022-07-30 14:38:01 |
合計ジャッジ時間 | 3,767 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge15 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
/*** author: shu8Cream* created: 30.07.2022 14:09:10**/#include <bits/stdc++.h>using namespace std;#define overload3(a,b,c,d,...) d#define rep1(i,n) for (int i=0; i<(n); i++)#define rep2(i,a,n) for (int i=(a); i<(n); i++)#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)#define rrep1(i,n) for (int i=(n-1); i>=0; i--)#define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--)#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define sz(x) int((x).size())#define pcnt __builtin_popcountllusing ll = long long;using P = pair<ll,ll>;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;using vi = vc<ll>;using vvi = vv<ll>;const ll INF = 8e18;template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}template<class T> inline bool chmax(T& a, T b) {if (a < b) { a = b; return true; }return false;}template<class T> inline bool chmin(T& a, T b) {if (a > b) { a = b; return true; }return false;}template <class T> string to_string(T s);template <class S, class T> string to_string(pair<S, T> p);string to_string(char c) { return string(1, c); }string to_string(string s) { return s; }string to_string(const char s[]) { return string(s); }template <class T>string to_string(T v) {if (v.empty()) return "{}";string ret = "{";for (auto x : v) ret += to_string(x) + ",";ret.back() = '}';return ret;}template <class S, class T>string to_string(pair<S, T> p) {return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";}void debug_out() { cout << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cout << to_string(H) << " ";debug_out(T...);}#ifdef _DEBUG#define debug(...) debug_out(__VA_ARGS__)#else#define debug(...)#endifconst int n = 100;const int m = 8;const int k = 5;vi a(n),b(n);// vi c(m),d(m);array<int,m> c = {0,0,333,334,666,667,1000,1000};array<int,m> d = {0,1000,333,666,334,667,0,1000};vc<P> ans;void input(){int N,M;cin >> N >> M;rep(i,n) cin >> a[i] >> b[i];}void output(){rep(i,m) cout<<c[i]<<" "<<d[i]<<endl;cout << sz(ans) << endl;for(auto[kind,id]:ans){cout<<kind<<" "<<id<<endl;}}int calc_dist(int px, int py, int qx, int qy){return (px-qx)*(px-qx)+(py-qy)*(py-qy);}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);input();ans.push_back({1,1});rep(i,1,n+1){int id = (i==n?0:i);int now_dist = calc_dist(a[i],b[i],a[id],b[id]) * k*k;int ISS = -1;rep(j,m){int new_dist = calc_dist(a[i],b[i],c[j],d[j])*k+ calc_dist(a[id],b[id],c[j],d[j])*k;if(new_dist<now_dist){now_dist = new_dist;ISS = j;}}if(ISS!=-1) ans.push_back({2,ISS+1});ans.push_back({1,id+1});}output();}