oj.uz

답안 #286988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286988 2020-08-31T08:29:25 Z ACmachine 철인 이종 경기 (APIO18_duathlon) C++17
23 / 100
 1000 ms 1048580 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 

const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

// centroid decomposition of a biconnected component tree dafuq
// first only centoid decomp to pass those subtasks

template<typename T>
struct edge{
    int src;
    int dest;
    T cost;
};
template<typename T>
class graph{
    public: 
    vector<edge<T>> edges;
    vector<vector<int>> adj;
    int n;
    graph(){};
    graph(int _n){
        n = _n;
        adj.resize(n);
    }
};

template<typename T>
class undigraph : public graph<T>{
    public:
        using graph<T>::edges;
        using graph<T>::adj;
        using graph<T>::n;
        undigraph() : graph<T>(){};
        undigraph(int _n) : graph<T>(_n){};

        int add_edge(int src, int dest, T cost = 1){
            int id = edges.size();
            edges.push_back({src, dest, cost});
            adj[src].push_back(id);
            adj[dest].push_back(id);
            return id;
        }
};
/* int OneCentroid(int root, graph<int> &g, vector<bool> &dead){ */
/*     vi sz(g.n); */
/*     function<void (int, int)> get_sz = [&](int v, int p){ */
/*         sz[v] = 1; */
/*         for(int id : g.adj[v]){ */
/*             edge<int> e = g.edges[id]; */
/*             int other = e.src ^ e.dest ^ v; */
/*             if(other != p && !dead[other]){ */
/*                 get_sz(other, v); */
/*                 sz[v] += sz[other]; */
/*             } */
/*         } */
/*     }; */
/*     get_sz(root, -1); */
/*     int n = sz[root]; */
/*     function<int (int, int)> dfs = [&](int v, int p){ */
/*         for(int id : g.adj[v]){ */
/*             edge<int> e = g.edges[id]; */
/*             int other = e.src ^ e.dest ^ v; */
/*             if(other != p && !dead[other] && sz[other] > n / 2) return dfs(other, v); */
/*         } */
/*         return v; */
/*     }; */
/*     return dfs(root, -1); */
/* } */
/* ll CentroidDecomposition(graph<int> &g){ */
/*     ll ans = 0; */
/*     vector<bool> dead(g.n, false); */
/*     function<void (int)> rec = [&](int start){ */
/*         int c = OneCentroid(start, g, dead); */
/*         dead[c] = true; */
/*         for(int id : g.adj[c]){ */
/*             edge<int> e = g.edges[id]; */
/*             int other = e.src ^ e.dest ^ c; */
/*             if(!dead[other]) rec(other); */
/*         }; */
/*         // process centroid; */ 
/*         vi sz(g.n); */
/*         function<void (int, int)> get_sz = [&](int v, int p){ */
/*             sz[v] = 1; */
/*             for(int id : g.adj[v]){ */
/*                 edge<int> e = g.edges[id]; */
/*                 int other = e.src ^ e.dest ^ v; */
/*                 if(other != p && !dead[other]) { */
/*                     get_sz(other, v); */
/*                     sz[v] += sz[other]; */
/*                 } */
/*             } */
/*         }; */
/*         get_sz(c, -1); */
/*         vi children; */
/*         for(int id : g.adj[c]){ */
/*             edge<int> e = g.edges[id]; */
/*             int other = e.src ^ e.dest ^ c; */
/*             if(!dead[other]) children.pb(sz[other]); */
/*         } */
/*         ll sum = 0; */
/*         for(auto x : children) sum += x; */
/*         for(auto x : children){ */
/*             ans += (ll)x * (sum - (ll)x); */
/*         } */
/*         // end process centoid */
/*         dead[c] = false; */
/*     }; */
/*     rec(0); */
/*     return ans; */
/* } */
struct AcAutomaton{
    int n, m;
    undigraph<int> g;
	void read_in(){
		cin >> n >> m;
        g = undigraph<int>(n);
        REP(i, m){
            pii e; cin >> e;
            e.ff--; e.ss--;
            g.add_edge(e.ff, e.ss);
        }
	}
    ll ans = 0;
    vi sz;
    vi roots;
    void get_sz(){
        sz.resize(g.n);
        vector<bool> visited(g.n, false);
        function<void(int, int)> dfs = [&](int v, int p){
            sz[v] = 1;
            visited[v] = true;
            for(int id : g.adj[v]){
                edge<int> e = g.edges[id];
                int other = e.src ^ e.dest ^ v;
                if(other != p){
                    dfs(other, v);
                    sz[v] += sz[other];
                }
            }
        };
        REP(i, g.n){
            if(!visited[i]){
                roots.pb(i);
                dfs(i, -1);
            }
        }
    }
    void reroot(int v, int p){
        if(p != -1){
            sz[p] -= sz[v];
            sz[v] += sz[p];
        }
        // process;
        vi children;
        for(int id : g.adj[v]){
            edge<int> e = g.edges[id];
            int other = e.src ^ e.dest ^ v;
            children.pb(sz[other]);
        }
        ll sum = 0;
        for(auto x : children) sum += x;
        for(auto x : children) ans += (ll)x * (sum - (ll)x);
        children.clear();
        for(int id : g.adj[v]){
            edge<int> e = g.edges[id];
            int other = e.src ^ e.dest ^ v;
            if(other != p) reroot(other, v);
        }
        if(p != -1){
            sz[v] -= sz[p];
            sz[p] += sz[v];
        }
    }
	void solve(){
        get_sz();
        for(auto x : roots) reroot(x, -1);
		cout << ans << endl;
	}
};
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int tcase = 1;
	while(tcase--){
		AcAutomaton solver;
		solver.read_in();
		solver.solve();
	}
    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 710 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 710 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1118 ms 338636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 7468 KB Output is correct
2 Correct 98 ms 8852 KB Output is correct
3 Correct 108 ms 8724 KB Output is correct
4 Correct 101 ms 8748 KB Output is correct
5 Correct 100 ms 8876 KB Output is correct
6 Correct 136 ms 16388 KB Output is correct
7 Correct 132 ms 13740 KB Output is correct
8 Correct 128 ms 12460 KB Output is correct
9 Correct 122 ms 11208 KB Output is correct
10 Correct 107 ms 8748 KB Output is correct
11 Correct 122 ms 8748 KB Output is correct
12 Correct 121 ms 8748 KB Output is correct
13 Correct 116 ms 8748 KB Output is correct
14 Correct 100 ms 8560 KB Output is correct
15 Correct 89 ms 8364 KB Output is correct
16 Correct 53 ms 7088 KB Output is correct
17 Correct 52 ms 10028 KB Output is correct
18 Correct 56 ms 9776 KB Output is correct
19 Correct 59 ms 9776 KB Output is correct
20 Correct 56 ms 9516 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Runtime error 975 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 7468 KB Output is correct
2 Correct 113 ms 8912 KB Output is correct
3 Execution timed out 1166 ms 999112 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 710 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 710 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -