oj.uz

Submission #257779

# Submission time Handle Problem Language Result Execution time Memory
257779 2020-08-04T19:09:26 Z Bruteforceman Making Friends on Joitter is Fun (JOI20_joitter2) C++11
1 / 100
 5000 ms 11196 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
set <int> in[maxn], out[maxn];
queue <pair <int, int>> Q;
int par[maxn];
int sub[maxn];
int root(int x) {
  if(par[x] == x) return x;
  return par[x] = root(par[x]);
}
bool change(set <int> &t, set <int> &r, int i, int j) {
  t.erase(i); t.insert(j);
  return r.count(j);
}
void join(int x, int y) {
  x = root(x);
  y = root(y);
  if(in[x].size() + out[x].size() > in[y].size() + out[y].size()) swap(x, y); 
  if(x != y) {
//    cout << x << " " << y << endl;
    par[x] = y;
    sub[y] += sub[x];
    for(int i : in[x]) {
      in[y].insert(i);
      if(change(out[i], in[i], x, y)) Q.emplace(i, y);
    }
    for(int i : out[x]) {
      out[y].insert(i);
      if(change(in[i], out[i], x, y)) Q.emplace(i, y);
    }
  }
}
bool exists(int i, int j) {
  i = root(i); j = root(j);
  return out[i].count(j);
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for(int i = 1; i <= n; i++) {
    par[i] = i;
    sub[i] = 1;
  }
  vector <pair <int, int>> edge;
  for(int x = 1; x <= m; x++) {
    int p, q;
    scanf("%d %d", &p, &q); 
    edge.emplace_back(p, q);

    p = root(p);
    q = root(q);
    out[p].insert(q);
    in[q].insert(p);
    if(exists(p, q) && exists(q, p)) Q.emplace(root(p), root(q));
    while(!Q.empty()) {
      int p = Q.front().first;
      int q = Q.front().second;
      Q.pop();
      join(p, q);
    }
    long long ans = 0;
    for(int i = 1; i <= n; i++) {
      if(root(i) == i) {
        ans += 1LL * sub[i] * (sub[i] - 1);
      }
    }
    set <pair <int, int>> s;
    for(auto i : edge) {
      if(root(i.first) != root(i.second)) {
        s.insert(make_pair(i.first, root(i.second)));
      }
    }
    for(auto i : s) ans += sub[i.second]; 
    printf("%lld\n", ans);
  }
}

Compilation message

joitter2.cpp: In function 'int main()':
joitter2.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &m);
   ~~~~~^~~~~~~~~~~~~~~~~
joitter2.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &p, &q); 
     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 8 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 25 ms 9856 KB Output is correct
8 Correct 31 ms 9856 KB Output is correct
9 Correct 24 ms 9856 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 7 ms 9728 KB Output is correct
12 Correct 8 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 7 ms 9728 KB Output is correct
15 Correct 8 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 6 ms 9728 KB Output is correct
20 Correct 8 ms 9728 KB Output is correct
21 Correct 24 ms 9824 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 10 ms 9856 KB Output is correct
24 Correct 8 ms 9728 KB Output is correct
25 Correct 17 ms 9856 KB Output is correct
26 Correct 6 ms 9728 KB Output is correct
27 Correct 6 ms 9728 KB Output is correct
28 Correct 6 ms 9728 KB Output is correct
29 Correct 6 ms 9728 KB Output is correct
30 Correct 6 ms 9728 KB Output is correct
31 Correct 16 ms 9728 KB Output is correct
32 Correct 6 ms 9728 KB Output is correct
33 Correct 17 ms 9856 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 8 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 25 ms 9856 KB Output is correct
8 Correct 31 ms 9856 KB Output is correct
9 Correct 24 ms 9856 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 7 ms 9728 KB Output is correct
12 Correct 8 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 7 ms 9728 KB Output is correct
15 Correct 8 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 6 ms 9728 KB Output is correct
20 Correct 8 ms 9728 KB Output is correct
21 Correct 24 ms 9824 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 10 ms 9856 KB Output is correct
24 Correct 8 ms 9728 KB Output is correct
25 Correct 17 ms 9856 KB Output is correct
26 Correct 6 ms 9728 KB Output is correct
27 Correct 6 ms 9728 KB Output is correct
28 Correct 6 ms 9728 KB Output is correct
29 Correct 6 ms 9728 KB Output is correct
30 Correct 6 ms 9728 KB Output is correct
31 Correct 16 ms 9728 KB Output is correct
32 Correct 6 ms 9728 KB Output is correct
33 Correct 17 ms 9856 KB Output is correct
34 Correct 239 ms 10168 KB Output is correct
35 Execution timed out 5027 ms 11196 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 8 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 25 ms 9856 KB Output is correct
8 Correct 31 ms 9856 KB Output is correct
9 Correct 24 ms 9856 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 7 ms 9728 KB Output is correct
12 Correct 8 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 7 ms 9728 KB Output is correct
15 Correct 8 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 6 ms 9728 KB Output is correct
20 Correct 8 ms 9728 KB Output is correct
21 Correct 24 ms 9824 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 10 ms 9856 KB Output is correct
24 Correct 8 ms 9728 KB Output is correct
25 Correct 17 ms 9856 KB Output is correct
26 Correct 6 ms 9728 KB Output is correct
27 Correct 6 ms 9728 KB Output is correct
28 Correct 6 ms 9728 KB Output is correct
29 Correct 6 ms 9728 KB Output is correct
30 Correct 6 ms 9728 KB Output is correct
31 Correct 16 ms 9728 KB Output is correct
32 Correct 6 ms 9728 KB Output is correct
33 Correct 17 ms 9856 KB Output is correct
34 Correct 239 ms 10168 KB Output is correct
35 Execution timed out 5027 ms 11196 KB Time limit exceeded
36 Halted 0 ms 0 KB -