結果

問題 No.2353 Guardian Dogs in Spring
ユーザー deuteridayodeuteridayo
提出日時 2023-06-16 22:13:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,058 bytes
コンパイル時間 4,593 ms
コンパイル使用メモリ 268,652 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-24 14:40:46
合計ジャッジ時間 11,447 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 37 ms
6,940 KB
testcase_06 AC 37 ms
6,944 KB
testcase_07 AC 39 ms
6,944 KB
testcase_08 AC 38 ms
6,944 KB
testcase_09 AC 38 ms
6,944 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 38 ms
6,944 KB
testcase_14 WA -
testcase_15 AC 68 ms
6,944 KB
testcase_16 AC 70 ms
6,940 KB
testcase_17 WA -
testcase_18 AC 70 ms
6,940 KB
testcase_19 AC 73 ms
6,940 KB
testcase_20 AC 2 ms
6,940 KB
testcase_21 AC 4 ms
6,940 KB
testcase_22 AC 13 ms
6,944 KB
testcase_23 AC 51 ms
6,944 KB
testcase_24 AC 3 ms
6,940 KB
testcase_25 AC 3 ms
6,940 KB
testcase_26 AC 3 ms
6,940 KB
testcase_27 AC 2 ms
6,944 KB
testcase_28 AC 5 ms
6,944 KB
testcase_29 AC 26 ms
6,940 KB
testcase_30 AC 13 ms
6,940 KB
testcase_31 AC 21 ms
6,944 KB
testcase_32 AC 54 ms
6,940 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 4 ms
6,944 KB
testcase_37 AC 3 ms
6,944 KB
testcase_38 AC 7 ms
6,944 KB
testcase_39 AC 8 ms
6,940 KB
testcase_40 WA -
testcase_41 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
// using mint = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()

struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){
    lint n;
    cin >> n;
    int x[n], y[n];
    
    rep(i, n) {
        cin >> x[i] >> y[i];
    }
    vec<bool>chk(n);

    vec<pair<int,int>>ans;
    rep(i, n) {
        if(chk[i])continue;
        int minn = INF;
        int arg = -1;
        repp(j, i+1, n) {
            if(chk[j])continue;
            if(minn > (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j])) {
                minn = (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
                arg = j;
            }
        }
        if(arg != -1) {
            chk[i] = true;
            chk[arg] = true;
            ans.pb({i+1, arg+1});
        }
    }
    cout << ans.size() << endl;
    for(auto p: ans) {
        cout << p.first << " " << p.second << endl;
    }
    
    
}
0