oj.uz

Submission #1061952

# Submission time Handle Problem Language Result Execution time Memory
1061952 2024-08-16T15:56:25 Z trMatherz Duathlon (APIO18_duathlon) C++17
0 / 100
 132 ms 38308 KB 
#include <iostream>
 
// #include <fstream>
// std::ifstream cin ("pop.in");
// std::ofstream cout ("pop.out");
 
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
#include <bitset>
#include <complex>
 
// usings
using namespace std;
using namespace __gnu_pbds;
 
// misc
#define ll long long
#define ld long double
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template <typename T, typename U>
bool emin(T &a, const U &b) { return b < a ? a = b, true : false; }
template <typename T, typename U>
bool emax(T &a, const U &b) { return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
 
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
#define vc vector<char>
#define vvc vector<vc>
 
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
 
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for (auto &x : y)




struct BCC { 
    int n; vvi a; vb b; vi v; vvi tre; int ct = 0; 
    void init(int tn) { n = tn, a = vvi(n), b = vb(n, false), v = vi(n); }
    void ad(int x, int y) { a[x].pb(y); a[y].pb(x); }
    void go() {
        vvi c(n); vi stck, num(n, -1), low(n); vb vis(n, false); 
        function<void(int, int, int &)> dfs = [&](int x, int p, int &t) {
            num[x] = low[x] = t++; v[x] = true; 
            stck.pb(x); 
            A(u, a[x]) {
                if(u == p) continue; 
                if(num[u] != -1) emin(low[x], num[u]); 
                else {
                    dfs(u, x, t); 
                    emin(low[x], low[u]); 
                    if(low[u] >= num[x]) {
                        b[x] = (num[x] > 0 || num[u] > 1); c.pb({}); c[x].pb(n + ct++); 
                        for(; c.back().empty() || c.back().back() != u; stck.pop_back()) c.back().pb(stck.back());
                    }
                }
            }
        };
        int t = 0; 
        F(i, n) if(!v[i]) dfs(i, -1, t); 
        tre = c; 
    }
};
ll an = 0;
BCC a; vl b; int n, m; vb c;
ll amt = 0; 
void plop(int x, int p){
    amt += b[x]; c[x] = true; 
    A(u, a.tre[x]) if(u != p) plop(u, x); 
}
void dfs(int x, int p){
    // cout << x << ": ";
    // A(u, a.tre[x]) cout << u << " ";
    // cout << endl;
    if(x < n) b[x] = 1; else b[x] = 0; 
    A(u, a.tre[x]) {
        if(u == p) continue; 
        dfs(u, x); 
        b[x] += b[u]; 
        if(x >= n) an -= ( sz(a.tre[x]))  * b[u] * (b[u] - 1); 
    }
    if(x >= n) an -= ( sz(a.tre[x])) * (amt - b[x]) * (amt - b[x] - 1);
}
int main() {
    cin >> n >> m; 
    a.init(n); b = vl(n * 3, 0); c= vb(n * 3, false); 
    F(i, m){
        int x, y; cin >> x >> y; x--; y--; a.ad(x, y); 
    }
    a.go();
    F(i, n) b[a.v[i]]++; 
    F(i, n){
        amt = 0;
        if(!c[i]) {
            plop(i, -1); 
            an += amt * (amt - 1) * (amt - 2); 
            dfs(i, -1); 
        }
    }
    cout << an; 
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 29276 KB Output is correct
2 Correct 61 ms 28580 KB Output is correct
3 Incorrect 77 ms 29608 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 760 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Incorrect 1 ms 604 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 28320 KB Output is correct
2 Correct 86 ms 28460 KB Output is correct
3 Correct 77 ms 28452 KB Output is correct
4 Correct 80 ms 28204 KB Output is correct
5 Correct 81 ms 28200 KB Output is correct
6 Correct 132 ms 38308 KB Output is correct
7 Correct 92 ms 34348 KB Output is correct
8 Correct 93 ms 32928 KB Output is correct
9 Correct 92 ms 31660 KB Output is correct
10 Incorrect 79 ms 28324 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Incorrect 1 ms 600 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 28200 KB Output is correct
2 Correct 86 ms 28968 KB Output is correct
3 Correct 89 ms 26700 KB Output is correct
4 Correct 84 ms 23336 KB Output is correct
5 Correct 71 ms 20432 KB Output is correct
6 Correct 71 ms 18504 KB Output is correct
7 Correct 63 ms 18732 KB Output is correct
8 Correct 61 ms 18732 KB Output is correct
9 Correct 61 ms 17964 KB Output is correct
10 Correct 58 ms 16940 KB Output is correct
11 Correct 56 ms 16684 KB Output is correct
12 Correct 54 ms 17452 KB Output is correct
13 Correct 55 ms 16424 KB Output is correct
14 Correct 57 ms 19112 KB Output is correct
15 Correct 94 ms 33064 KB Output is correct
16 Correct 90 ms 30648 KB Output is correct
17 Correct 90 ms 30504 KB Output is correct
18 Correct 94 ms 28564 KB Output is correct
19 Incorrect 105 ms 23412 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -