제출 #541434

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
541434	2022-03-23 15:03:31	MohamedFaresNebili	이상적인 도시 (IOI12_city)	C++14	32 / 100	1089 ms	3684 KiB

city

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
        using namespace std;
        using ll = long long;
        using ii = pair<ll, ll>;
        #define ff first
        #define ss second
        #define pb push_back
        /// #define int ll
        const int MOD = 1e9;
        vector<int> adj[100001];
        int DistanceSum(int N, int X[], int Y[]) {
            for(int l = 0; l < N; l++) {
                for(int i = l + 1; i < N; i++) {
                    if(X[l] == X[i] && abs(Y[l] - Y[i]) == 1)
                        adj[l].pb(i), adj[i].pb(l);
                    if(Y[l] == Y[i] && abs(X[l] - X[i]) == 1)
                        adj[l].pb(i), adj[i].pb(l);
                }
            }
            ll res = 0;
            for(int l = 0; l < N; l++) {
                vector<int> dist(N, -1);
                queue<int> q; q.push(l); dist[l] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 0 / 23
• Subtask 4: 0 / 45