oj.uz

답안 #998699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998699 2024-06-14T14:19:15 Z yeediot 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
100 / 100
 585 ms 70084 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 1e5+5;
int n, m, ans;
struct DSU{
    int to[mxn], num[mxn];
    set<int> g[mxn], out[mxn], in[mxn];
    queue<pii> to_merge;
    void init(){
        ans = 0;
        for(int i=1;i<=n;i++){
            g[i].clear();
            out[i].clear();
            in[i].clear();
            g[i].insert(i);
            num[i] = 1;
            to[i] = i;
        }
    }
    int find(int x){
        return x == to[x] ? x : to[x] = find(to[x]);
    }
    void merge(int x,int y){
        x = find(x);
        y = find(y);
        if(x == y){
            return ;
        }
        if(sz(g[x]) > sz(g[y])){
            swap(x, y);
        }
        ans = ans+num[x]*sz(g[y])+num[y]*sz(g[x]);
        for(auto u:g[x]){
            if(g[y].count(u)){
                ans -= num[x]+num[y];
            }
            else{
                g[y].insert(u);
            }
        }
        to[x] = y;
        num[y] += num[x];
        in[x].erase(y);
        in[y].erase(x);
        out[x].erase(y);
        out[y].erase(x);
        for(auto v : in[x]){
            out[v].erase(x);
            add(v, y);
        }
        for(auto v : out[x]){
            in[v].erase(x);
            add(y, v);
        }
    }
    void add(int x, int y){
        in[y].insert(x);
        out[x].insert(y);
        if(out[y].count(x)){
            to_merge.push({x, y});
        }
    }
    void cal(int x, int y){
        int px = find(x), py = find(y);
        y = py;
        if(px!=py and !g[y].count(x)){
            g[y].insert(x);
            ans += num[y];
            x = px;
            add(x, y);
            while(sz(to_merge)){
                auto [v, u] = to_merge.front();
                to_merge.pop();
                merge(v, u);
            }
        }
    }
}d;
signed main(){
    TOI_is_so_de;
    cin >> n >> m;
    d.init();
    for(int i=0;i<m;i++){
        int x, y;
        cin >> x >> y;
        d.cal(x, y);
        cout << ans << '\n';
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

joitter2.cpp: In function 'void setIO(std::string)':
joitter2.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 15708 KB Output is correct
2 Correct 2 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15708 KB Output is correct
5 Correct 2 ms 15708 KB Output is correct
6 Correct 3 ms 15708 KB Output is correct
7 Correct 3 ms 15964 KB Output is correct
8 Correct 3 ms 15964 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 2 ms 15708 KB Output is correct
11 Correct 2 ms 15964 KB Output is correct
12 Correct 2 ms 15708 KB Output is correct
13 Correct 2 ms 15708 KB Output is correct
14 Correct 2 ms 15708 KB Output is correct
15 Correct 2 ms 15708 KB Output is correct
16 Correct 2 ms 15708 KB Output is correct
17 Correct 2 ms 15804 KB Output is correct
18 Correct 2 ms 15708 KB Output is correct
19 Correct 2 ms 15708 KB Output is correct
20 Correct 2 ms 15964 KB Output is correct
21 Correct 3 ms 15960 KB Output is correct
22 Correct 2 ms 15964 KB Output is correct
23 Correct 3 ms 15964 KB Output is correct
24 Correct 2 ms 15964 KB Output is correct
25 Correct 3 ms 15964 KB Output is correct
26 Correct 2 ms 15964 KB Output is correct
27 Correct 2 ms 15964 KB Output is correct
28 Correct 2 ms 15964 KB Output is correct
29 Correct 3 ms 15960 KB Output is correct
30 Correct 2 ms 15964 KB Output is correct
31 Correct 3 ms 15960 KB Output is correct
32 Correct 2 ms 15708 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 15708 KB Output is correct
2 Correct 2 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15708 KB Output is correct
5 Correct 2 ms 15708 KB Output is correct
6 Correct 3 ms 15708 KB Output is correct
7 Correct 3 ms 15964 KB Output is correct
8 Correct 3 ms 15964 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 2 ms 15708 KB Output is correct
11 Correct 2 ms 15964 KB Output is correct
12 Correct 2 ms 15708 KB Output is correct
13 Correct 2 ms 15708 KB Output is correct
14 Correct 2 ms 15708 KB Output is correct
15 Correct 2 ms 15708 KB Output is correct
16 Correct 2 ms 15708 KB Output is correct
17 Correct 2 ms 15804 KB Output is correct
18 Correct 2 ms 15708 KB Output is correct
19 Correct 2 ms 15708 KB Output is correct
20 Correct 2 ms 15964 KB Output is correct
21 Correct 3 ms 15960 KB Output is correct
22 Correct 2 ms 15964 KB Output is correct
23 Correct 3 ms 15964 KB Output is correct
24 Correct 2 ms 15964 KB Output is correct
25 Correct 3 ms 15964 KB Output is correct
26 Correct 2 ms 15964 KB Output is correct
27 Correct 2 ms 15964 KB Output is correct
28 Correct 2 ms 15964 KB Output is correct
29 Correct 3 ms 15960 KB Output is correct
30 Correct 2 ms 15964 KB Output is correct
31 Correct 3 ms 15960 KB Output is correct
32 Correct 2 ms 15708 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct
34 Correct 4 ms 15964 KB Output is correct
35 Correct 48 ms 21588 KB Output is correct
36 Correct 69 ms 24604 KB Output is correct
37 Correct 67 ms 24812 KB Output is correct
38 Correct 66 ms 24180 KB Output is correct
39 Correct 4 ms 16220 KB Output is correct
40 Correct 5 ms 16476 KB Output is correct
41 Correct 6 ms 16668 KB Output is correct
42 Correct 4 ms 16220 KB Output is correct
43 Correct 5 ms 16220 KB Output is correct
44 Correct 5 ms 16220 KB Output is correct
45 Correct 4 ms 16220 KB Output is correct
46 Correct 4 ms 16260 KB Output is correct
47 Correct 6 ms 16472 KB Output is correct
48 Correct 5 ms 16476 KB Output is correct
49 Correct 9 ms 17244 KB Output is correct
50 Correct 71 ms 24916 KB Output is correct
51 Correct 8 ms 16472 KB Output is correct
52 Correct 57 ms 23004 KB Output is correct
53 Correct 10 ms 17056 KB Output is correct
54 Correct 65 ms 23892 KB Output is correct
55 Correct 6 ms 16728 KB Output is correct
56 Correct 6 ms 16476 KB Output is correct
57 Correct 8 ms 16476 KB Output is correct
58 Correct 6 ms 16476 KB Output is correct
59 Correct 5 ms 16476 KB Output is correct
60 Correct 47 ms 21636 KB Output is correct
61 Correct 6 ms 16476 KB Output is correct
62 Correct 65 ms 24028 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 15708 KB Output is correct
2 Correct 2 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15708 KB Output is correct
5 Correct 2 ms 15708 KB Output is correct
6 Correct 3 ms 15708 KB Output is correct
7 Correct 3 ms 15964 KB Output is correct
8 Correct 3 ms 15964 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 2 ms 15708 KB Output is correct
11 Correct 2 ms 15964 KB Output is correct
12 Correct 2 ms 15708 KB Output is correct
13 Correct 2 ms 15708 KB Output is correct
14 Correct 2 ms 15708 KB Output is correct
15 Correct 2 ms 15708 KB Output is correct
16 Correct 2 ms 15708 KB Output is correct
17 Correct 2 ms 15804 KB Output is correct
18 Correct 2 ms 15708 KB Output is correct
19 Correct 2 ms 15708 KB Output is correct
20 Correct 2 ms 15964 KB Output is correct
21 Correct 3 ms 15960 KB Output is correct
22 Correct 2 ms 15964 KB Output is correct
23 Correct 3 ms 15964 KB Output is correct
24 Correct 2 ms 15964 KB Output is correct
25 Correct 3 ms 15964 KB Output is correct
26 Correct 2 ms 15964 KB Output is correct
27 Correct 2 ms 15964 KB Output is correct
28 Correct 2 ms 15964 KB Output is correct
29 Correct 3 ms 15960 KB Output is correct
30 Correct 2 ms 15964 KB Output is correct
31 Correct 3 ms 15960 KB Output is correct
32 Correct 2 ms 15708 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct
34 Correct 4 ms 15964 KB Output is correct
35 Correct 48 ms 21588 KB Output is correct
36 Correct 69 ms 24604 KB Output is correct
37 Correct 67 ms 24812 KB Output is correct
38 Correct 66 ms 24180 KB Output is correct
39 Correct 4 ms 16220 KB Output is correct
40 Correct 5 ms 16476 KB Output is correct
41 Correct 6 ms 16668 KB Output is correct
42 Correct 4 ms 16220 KB Output is correct
43 Correct 5 ms 16220 KB Output is correct
44 Correct 5 ms 16220 KB Output is correct
45 Correct 4 ms 16220 KB Output is correct
46 Correct 4 ms 16260 KB Output is correct
47 Correct 6 ms 16472 KB Output is correct
48 Correct 5 ms 16476 KB Output is correct
49 Correct 9 ms 17244 KB Output is correct
50 Correct 71 ms 24916 KB Output is correct
51 Correct 8 ms 16472 KB Output is correct
52 Correct 57 ms 23004 KB Output is correct
53 Correct 10 ms 17056 KB Output is correct
54 Correct 65 ms 23892 KB Output is correct
55 Correct 6 ms 16728 KB Output is correct
56 Correct 6 ms 16476 KB Output is correct
57 Correct 8 ms 16476 KB Output is correct
58 Correct 6 ms 16476 KB Output is correct
59 Correct 5 ms 16476 KB Output is correct
60 Correct 47 ms 21636 KB Output is correct
61 Correct 6 ms 16476 KB Output is correct
62 Correct 65 ms 24028 KB Output is correct
63 Correct 320 ms 68432 KB Output is correct
64 Correct 330 ms 68520 KB Output is correct
65 Correct 326 ms 68328 KB Output is correct
66 Correct 137 ms 34384 KB Output is correct
67 Correct 228 ms 61524 KB Output is correct
68 Correct 127 ms 34392 KB Output is correct
69 Correct 235 ms 35532 KB Output is correct
70 Correct 157 ms 34388 KB Output is correct
71 Correct 142 ms 34576 KB Output is correct
72 Correct 273 ms 45652 KB Output is correct
73 Correct 254 ms 47352 KB Output is correct
74 Correct 585 ms 70084 KB Output is correct
75 Correct 333 ms 42436 KB Output is correct
76 Correct 445 ms 54608 KB Output is correct
77 Correct 431 ms 54868 KB Output is correct
78 Correct 157 ms 40532 KB Output is correct
79 Correct 248 ms 44884 KB Output is correct
80 Correct 131 ms 36848 KB Output is correct
81 Correct 202 ms 40532 KB Output is correct
82 Correct 489 ms 55260 KB Output is correct
83 Correct 478 ms 55120 KB Output is correct
84 Correct 411 ms 53844 KB Output is correct
85 Correct 393 ms 53824 KB Output is correct
86 Correct 199 ms 67156 KB Output is correct
87 Correct 222 ms 69496 KB Output is correct
88 Correct 257 ms 46676 KB Output is correct
89 Correct 402 ms 52564 KB Output is correct