oj.uz

Submission #771785

# Submission time Handle Problem Language Result Execution time Memory
771785 2023-07-03T09:17:54 Z Sam_a17 Duathlon (APIO18_duathlon) C++17
31 / 100
 290 ms 43360 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else if(str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}

const int N = 2e5 + 10;
vector<int> adj[N], adj2[N], comps[N];
// vector<pair<int, int>> adj2[N];
bool vis[N], vis2[N];
int dp[51][51][51];
long long n, m, ans, n2;
int st, tin[N], tout[N], timer;
int low[N], comp[N], sz_comp[N];

set<pair<int, int>> mp;
void IS_BRIDGE(int a, int b) {
  mp.insert({a, b});
  mp.insert({b, a});
}

void dfs(int v, int p = -1) {
  vis[v] = true;
  tin[v] = low[v] = timer++;
  for (int to : adj[v]) {
      if (to == p) continue;
      if (vis[to]) {
          low[v] = min(low[v], tin[to]);
      } else {
          dfs(to, v);
          low[v] = min(low[v], low[to]);
          if (low[to] > tin[v]) {
              IS_BRIDGE(v, to);
          }
      }
  }
}

void dfs_gen(int node) {
  vis[node] = true;
  comps[st].push_back(node);
  for(auto i: adj[node]) {
    pair<int, int> edge = {i, node};

    if(mp.find(edge) != mp.end()) {
      if(comp[i]) {
        adj2[st].push_back(comp[i]);
        adj2[comp[i]].push_back(st);
      }
      continue;
    }
    if(vis[i]) continue;
    

    comp[i] = st;
    sz_comp[i]++;
    dfs_gen(i);
  }
}

long long sub[N];
void dfsik(int node, int parent) {
  vis[node] = true;
  sub[node] = sz(comps[node]);
  for(auto i: adj2[node]) {
    if(i == parent) continue;
    dfsik(i, node);
    sub[node] += sub[i];
  }
}

long long cur_al = 0, answ = 0;

void dfs1(int node, int parent) {
  vector<long long> child;
  if(sub[node] != cur_al) {
    child.push_back(cur_al - sub[node]);
  }

  for(auto i: adj2[node]) {
    if(i == parent) continue;
    child.push_back(sub[i]);
  }

  long long sum = cur_al - sz(comps[node]);
  for(auto i: child) {
    answ += 2 * (sum - i) * i;
    sum -= i;
  }

  if(sz(comps[node]) != 1) {
    for(auto i: child) {
      long long cmp = sz(comps[node]);
      answ += sub[i] * (cmp - 1);

      answ += sub[i] * (cmp - 2) * (cmp - 3); 
    }
  }
  
  for(auto i: adj2[node]) {
    if(i == parent) continue;
    dfs1(i, node);
  }
}

long long c_n(long long x) {
  if(x < 2) return 0;
  return x * (x - 1);
}

void solve_() {
  cin >> n >> m;

  for(int i = 1; i <= m; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  for(int i = 1; i <= n; i++) {
    low[i] = tin[i] = -1;
  }
  for(int i = 1; i <= n; i++) {
    if(vis[i]) continue;
    dfs(i, 0);
  }

  memset(vis, 0, sizeof(vis));

  for(int i = 1; i <= n; i++) {
    if(!vis[i]) {
      st = i;
      comp[i] = st;
      sz_comp[i]++;
      dfs_gen(i);
    }
  }

  for(int i = 1; i <= n; i++) {
    if(comp[i] == i) {
      // dbg(comps[i])
      for(auto j: comps[i]) {
        ans += c_n(sz(comps[i]) - 1);
      }
    }
  }

  memset(vis, 0, sizeof(vis));

  for(int i = 1; i <= n; i++) {
    if(vis[i]) continue;
    dfsik(i, 0);

    cur_al = sub[i];
    dfs1(i, 0);
  }
  cout << ans + answ << '\n';
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

count_triplets.cpp: In function 'void solve_()':
count_triplets.cpp:219:16: warning: unused variable 'j' [-Wunused-variable]
  219 |       for(auto j: comps[i]) {
      |                ^
count_triplets.cpp: In function 'void setIO(std::string)':
count_triplets.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 8 ms 14548 KB Output is correct
3 Correct 8 ms 14640 KB Output is correct
4 Correct 7 ms 14548 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Incorrect 7 ms 14548 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 8 ms 14548 KB Output is correct
3 Correct 8 ms 14640 KB Output is correct
4 Correct 7 ms 14548 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Incorrect 7 ms 14548 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 28588 KB Output is correct
2 Correct 54 ms 29696 KB Output is correct
3 Correct 156 ms 35156 KB Output is correct
4 Correct 116 ms 31848 KB Output is correct
5 Correct 111 ms 30452 KB Output is correct
6 Correct 170 ms 34920 KB Output is correct
7 Correct 181 ms 33608 KB Output is correct
8 Correct 154 ms 34016 KB Output is correct
9 Correct 153 ms 32316 KB Output is correct
10 Correct 141 ms 31320 KB Output is correct
11 Correct 114 ms 28512 KB Output is correct
12 Correct 120 ms 28400 KB Output is correct
13 Correct 99 ms 28492 KB Output is correct
14 Correct 110 ms 28100 KB Output is correct
15 Correct 79 ms 27944 KB Output is correct
16 Correct 90 ms 27432 KB Output is correct
17 Correct 15 ms 20092 KB Output is correct
18 Correct 15 ms 20052 KB Output is correct
19 Correct 15 ms 20100 KB Output is correct
20 Correct 14 ms 20060 KB Output is correct
21 Correct 14 ms 20040 KB Output is correct
22 Correct 15 ms 20148 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14804 KB Output is correct
2 Correct 8 ms 14804 KB Output is correct
3 Correct 7 ms 14804 KB Output is correct
4 Correct 10 ms 14852 KB Output is correct
5 Correct 11 ms 14932 KB Output is correct
6 Correct 8 ms 14804 KB Output is correct
7 Correct 8 ms 14932 KB Output is correct
8 Correct 8 ms 14888 KB Output is correct
9 Correct 8 ms 14804 KB Output is correct
10 Correct 10 ms 14824 KB Output is correct
11 Correct 8 ms 14844 KB Output is correct
12 Correct 8 ms 14816 KB Output is correct
13 Correct 7 ms 14804 KB Output is correct
14 Correct 8 ms 14804 KB Output is correct
15 Correct 8 ms 14844 KB Output is correct
16 Correct 7 ms 14720 KB Output is correct
17 Correct 8 ms 14804 KB Output is correct
18 Correct 7 ms 14804 KB Output is correct
19 Correct 7 ms 14804 KB Output is correct
20 Correct 8 ms 14844 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 35864 KB Output is correct
2 Correct 201 ms 35916 KB Output is correct
3 Correct 209 ms 35984 KB Output is correct
4 Correct 200 ms 35888 KB Output is correct
5 Correct 245 ms 35880 KB Output is correct
6 Correct 269 ms 43360 KB Output is correct
7 Correct 216 ms 41056 KB Output is correct
8 Correct 224 ms 39800 KB Output is correct
9 Correct 227 ms 38404 KB Output is correct
10 Correct 190 ms 35916 KB Output is correct
11 Correct 191 ms 35912 KB Output is correct
12 Correct 276 ms 35916 KB Output is correct
13 Correct 201 ms 35872 KB Output is correct
14 Correct 206 ms 34744 KB Output is correct
15 Correct 194 ms 33680 KB Output is correct
16 Correct 109 ms 29408 KB Output is correct
17 Correct 180 ms 37664 KB Output is correct
18 Correct 183 ms 37652 KB Output is correct
19 Correct 160 ms 37800 KB Output is correct
20 Correct 190 ms 37384 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 7 ms 14804 KB Output is correct
3 Incorrect 9 ms 14824 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 36080 KB Output is correct
2 Correct 290 ms 35864 KB Output is correct
3 Incorrect 215 ms 31408 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 8 ms 14548 KB Output is correct
3 Correct 8 ms 14640 KB Output is correct
4 Correct 7 ms 14548 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Incorrect 7 ms 14548 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 8 ms 14548 KB Output is correct
3 Correct 8 ms 14640 KB Output is correct
4 Correct 7 ms 14548 KB Output is correct
5 Correct 8 ms 14548 KB Output is correct
6 Correct 7 ms 14548 KB Output is correct
7 Incorrect 7 ms 14548 KB Output isn't correct
8 Halted 0 ms 0 KB -