oj.uz

답안 #1058118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058118 2024-08-14T08:34:45 Z 정희우(#11078) Telephone Plans (CCO24_day2problem3) C++17
11 / 25
 4000 ms 48252 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>

using namespace std;
using lint = long long;
using vint = vector<int>;
using pii = pair<int,int>;

const int MAX_N=500010;
const int MAX_Q=1500010;

struct Obj
{
    int v,p,i;
};

int in,n,q;
vint edge[MAX_N];
vint nxt[MAX_N];
vint ec[MAX_N];
map<pii,pii> mp;
int cidx=0;
int cnt[MAX_N<<1];
int col[MAX_N<<1];
lint sum[MAX_Q],sump[MAX_Q];

int rnxt(int v,int i)
{
    if(i==edge[v].size() || ec[v][i]==1)return i;
    return nxt[v][i]=rnxt(v,nxt[v][i]);
}

int getmin(int x,int y)
{
    vector<Obj> vx={{x,x,rnxt(x,0)}},vy={{y,y,rnxt(y,0)}};
    while(1)
    {
        while(!vx.empty())
        {
            auto p=vx.back();
            vx.pop_back();
            if(p.i==edge[p.v].size())continue;
            int v=edge[p.v][p.i];
            p.i=rnxt(p.v,nxt[p.v][p.i]);
            vx.push_back(p);
            if(v!=p.p)continue;
            vx.push_back({v,p.v,rnxt(v,0)});
            break;
        }
        if(vx.empty())return x;
        while(!vy.empty())
        {
            auto p=vy.back();
            vy.pop_back();
            if(p.i==edge[p.v].size())continue;
            int v=edge[p.v][p.i];
            p.i=rnxt(p.v,nxt[p.v][p.i]);
            vy.push_back(p);
            if(v!=p.p)continue;
            vy.push_back({v,p.v,rnxt(v,0)});
            break;
        }
        if(vy.empty())return y;
    }
    return x;
}

void colorall(int v,int p,int c)
{
    cnt[col[v]]--;
    col[v]=c;
    cnt[col[v]]++;
    for(int i=rnxt(v,0);i<edge[v].size();i=rnxt(v,nxt[v][i]))
        if(edge[v][i]!=p)
            colorall(edge[v][i],v,c);
}

int main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin >> in >> n >> q;
    for(int i=0;i<n;i++)
    {
        col[i+1]=i;
        cnt[i]=1;
    }
    cidx=n;
    lint lasta=0,change=0;
    for(int i=1;i<=q;i++)
    {
        int o;
        lint x,y,t;
        cin >> o;
        if(o==1)
        {
            cin >> x >> y;
            if(in)x^=lasta,y^=lasta;
            if(x>y)swap(x,y);
            change=(lint)cnt[col[x]]*cnt[col[y]];
            if(getmin(x,y)==x)
                colorall(x,x,col[y]);
            else
                colorall(y,y,col[x]);
            int j=edge[x].size(),l=edge[y].size();
            edge[x].push_back(y);
            nxt[x].push_back(j+1);
            ec[x].push_back(1);
            edge[y].push_back(x);
            nxt[y].push_back(l+1);
            ec[y].push_back(1);
            mp[{x,y}]={j,l};
        }
        if(o==2)
        {
            cin >> x >> y;
            if(in)x^=lasta,y^=lasta;
            if(x>y)swap(x,y);
            pii idx=mp[{x,y}];
            ec[x][idx.first]=0;
            ec[y][idx.second]=0;
            if(getmin(x,y)==x)
                colorall(x,x,cidx++);
            else
                colorall(y,y,cidx++);
            change=-(lint)cnt[col[x]]*cnt[col[y]];
        }
        if(o==3)change=0;
        sum[i]=sum[i-1]+change;
        sump[i]=sump[i-1]+max(0LL,change);
        if(o==3)
        {
            cin >> t;
            if(in)t^=lasta;
            int j=max(0LL,i-t);
            lasta=sum[j]+sump[i]-sump[j];
            cout << lasta << '\n';
        }
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int rnxt(int, int)':
Main.cpp:31:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     if(i==edge[v].size() || ec[v][i]==1)return i;
      |        ~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int getmin(int, int)':
Main.cpp:44:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             if(p.i==edge[p.v].size())continue;
      |                ~~~^~~~~~~~~~~~~~~~~~
Main.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             if(p.i==edge[p.v].size())continue;
      |                ~~~^~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void colorall(int, int, int)':
Main.cpp:75:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i=rnxt(v,0);i<edge[v].size();i=rnxt(v,nxt[v][i]))
      |                         ~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 40028 KB Output is correct
2 Correct 5 ms 40140 KB Output is correct
3 Correct 5 ms 40132 KB Output is correct
4 Correct 5 ms 40156 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40028 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40160 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40108 KB Output is correct
11 Correct 5 ms 40028 KB Output is correct
12 Correct 7 ms 40112 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 6 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 5 ms 40280 KB Output is correct
17 Correct 6 ms 40028 KB Output is correct
18 Correct 5 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40072 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40028 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40100 KB Output is correct
25 Correct 5 ms 40028 KB Output is correct
26 Correct 5 ms 40028 KB Output is correct
27 Correct 7 ms 40080 KB Output is correct
28 Correct 5 ms 40028 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 40028 KB Output is correct
2 Correct 5 ms 40092 KB Output is correct
3 Correct 5 ms 40140 KB Output is correct
4 Correct 5 ms 40028 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40072 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40028 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40028 KB Output is correct
11 Correct 5 ms 40108 KB Output is correct
12 Correct 5 ms 40124 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 5 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 8 ms 40028 KB Output is correct
17 Correct 5 ms 40132 KB Output is correct
18 Correct 6 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40028 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40104 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40028 KB Output is correct
25 Correct 6 ms 40028 KB Output is correct
26 Correct 5 ms 40112 KB Output is correct
27 Correct 5 ms 40096 KB Output is correct
28 Correct 6 ms 40028 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 40028 KB Output is correct
2 Correct 5 ms 40140 KB Output is correct
3 Correct 5 ms 40132 KB Output is correct
4 Correct 5 ms 40156 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40028 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40160 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40108 KB Output is correct
11 Correct 5 ms 40028 KB Output is correct
12 Correct 7 ms 40112 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 6 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 5 ms 40280 KB Output is correct
17 Correct 6 ms 40028 KB Output is correct
18 Correct 5 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40072 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40028 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40100 KB Output is correct
25 Correct 5 ms 40028 KB Output is correct
26 Correct 5 ms 40028 KB Output is correct
27 Correct 7 ms 40080 KB Output is correct
28 Correct 5 ms 40028 KB Output is correct
29 Correct 40 ms 40520 KB Output is correct
30 Correct 47 ms 40536 KB Output is correct
31 Correct 8 ms 40536 KB Output is correct
32 Correct 43 ms 40556 KB Output is correct
33 Correct 20 ms 40540 KB Output is correct
34 Correct 9 ms 40540 KB Output is correct
35 Correct 37 ms 40480 KB Output is correct
36 Correct 20 ms 40528 KB Output is correct
37 Correct 9 ms 40536 KB Output is correct
38 Correct 15 ms 40540 KB Output is correct
39 Correct 59 ms 40536 KB Output is correct
40 Correct 41 ms 40536 KB Output is correct
41 Correct 39 ms 40540 KB Output is correct
42 Correct 21 ms 40540 KB Output is correct
43 Correct 9 ms 40540 KB Output is correct
44 Correct 40 ms 40672 KB Output is correct
45 Correct 20 ms 40536 KB Output is correct
46 Correct 37 ms 40540 KB Output is correct
47 Correct 21 ms 40536 KB Output is correct
48 Correct 8 ms 40540 KB Output is correct
49 Correct 7 ms 40540 KB Output is correct
50 Correct 6 ms 40028 KB Output is correct
51 Correct 6 ms 40028 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 40028 KB Output is correct
2 Correct 5 ms 40092 KB Output is correct
3 Correct 5 ms 40140 KB Output is correct
4 Correct 5 ms 40028 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40072 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40028 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40028 KB Output is correct
11 Correct 5 ms 40108 KB Output is correct
12 Correct 5 ms 40124 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 5 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 8 ms 40028 KB Output is correct
17 Correct 5 ms 40132 KB Output is correct
18 Correct 6 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40028 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40104 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40028 KB Output is correct
25 Correct 6 ms 40028 KB Output is correct
26 Correct 5 ms 40112 KB Output is correct
27 Correct 5 ms 40096 KB Output is correct
28 Correct 6 ms 40028 KB Output is correct
29 Correct 39 ms 40540 KB Output is correct
30 Correct 39 ms 40624 KB Output is correct
31 Correct 7 ms 40536 KB Output is correct
32 Correct 33 ms 40544 KB Output is correct
33 Correct 20 ms 40392 KB Output is correct
34 Correct 9 ms 40536 KB Output is correct
35 Correct 39 ms 40540 KB Output is correct
36 Correct 18 ms 40540 KB Output is correct
37 Correct 8 ms 40536 KB Output is correct
38 Correct 29 ms 40548 KB Output is correct
39 Correct 55 ms 40532 KB Output is correct
40 Correct 42 ms 40560 KB Output is correct
41 Correct 30 ms 40576 KB Output is correct
42 Correct 16 ms 40536 KB Output is correct
43 Correct 12 ms 40540 KB Output is correct
44 Correct 40 ms 40672 KB Output is correct
45 Correct 20 ms 40528 KB Output is correct
46 Correct 37 ms 40548 KB Output is correct
47 Correct 22 ms 40540 KB Output is correct
48 Correct 8 ms 40540 KB Output is correct
49 Correct 8 ms 40540 KB Output is correct
50 Correct 7 ms 40284 KB Output is correct
51 Correct 6 ms 40220 KB Output is correct

Subtask #5
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 40028 KB Output is correct
2 Correct 5 ms 40140 KB Output is correct
3 Correct 5 ms 40132 KB Output is correct
4 Correct 5 ms 40156 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40028 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40160 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40108 KB Output is correct
11 Correct 5 ms 40028 KB Output is correct
12 Correct 7 ms 40112 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 6 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 5 ms 40280 KB Output is correct
17 Correct 6 ms 40028 KB Output is correct
18 Correct 5 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40072 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40028 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40100 KB Output is correct
25 Correct 5 ms 40028 KB Output is correct
26 Correct 5 ms 40028 KB Output is correct
27 Correct 7 ms 40080 KB Output is correct
28 Correct 5 ms 40028 KB Output is correct
29 Correct 40 ms 40520 KB Output is correct
30 Correct 47 ms 40536 KB Output is correct
31 Correct 8 ms 40536 KB Output is correct
32 Correct 43 ms 40556 KB Output is correct
33 Correct 20 ms 40540 KB Output is correct
34 Correct 9 ms 40540 KB Output is correct
35 Correct 37 ms 40480 KB Output is correct
36 Correct 20 ms 40528 KB Output is correct
37 Correct 9 ms 40536 KB Output is correct
38 Correct 15 ms 40540 KB Output is correct
39 Correct 59 ms 40536 KB Output is correct
40 Correct 41 ms 40536 KB Output is correct
41 Correct 39 ms 40540 KB Output is correct
42 Correct 21 ms 40540 KB Output is correct
43 Correct 9 ms 40540 KB Output is correct
44 Correct 40 ms 40672 KB Output is correct
45 Correct 20 ms 40536 KB Output is correct
46 Correct 37 ms 40540 KB Output is correct
47 Correct 21 ms 40536 KB Output is correct
48 Correct 8 ms 40540 KB Output is correct
49 Correct 7 ms 40540 KB Output is correct
50 Correct 6 ms 40028 KB Output is correct
51 Correct 6 ms 40028 KB Output is correct
52 Execution timed out 4054 ms 48168 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 40028 KB Output is correct
2 Correct 5 ms 40092 KB Output is correct
3 Correct 5 ms 40140 KB Output is correct
4 Correct 5 ms 40028 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40072 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40028 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40028 KB Output is correct
11 Correct 5 ms 40108 KB Output is correct
12 Correct 5 ms 40124 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 5 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 8 ms 40028 KB Output is correct
17 Correct 5 ms 40132 KB Output is correct
18 Correct 6 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40028 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40104 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40028 KB Output is correct
25 Correct 6 ms 40028 KB Output is correct
26 Correct 5 ms 40112 KB Output is correct
27 Correct 5 ms 40096 KB Output is correct
28 Correct 6 ms 40028 KB Output is correct
29 Correct 39 ms 40540 KB Output is correct
30 Correct 39 ms 40624 KB Output is correct
31 Correct 7 ms 40536 KB Output is correct
32 Correct 33 ms 40544 KB Output is correct
33 Correct 20 ms 40392 KB Output is correct
34 Correct 9 ms 40536 KB Output is correct
35 Correct 39 ms 40540 KB Output is correct
36 Correct 18 ms 40540 KB Output is correct
37 Correct 8 ms 40536 KB Output is correct
38 Correct 29 ms 40548 KB Output is correct
39 Correct 55 ms 40532 KB Output is correct
40 Correct 42 ms 40560 KB Output is correct
41 Correct 30 ms 40576 KB Output is correct
42 Correct 16 ms 40536 KB Output is correct
43 Correct 12 ms 40540 KB Output is correct
44 Correct 40 ms 40672 KB Output is correct
45 Correct 20 ms 40528 KB Output is correct
46 Correct 37 ms 40548 KB Output is correct
47 Correct 22 ms 40540 KB Output is correct
48 Correct 8 ms 40540 KB Output is correct
49 Correct 8 ms 40540 KB Output is correct
50 Correct 7 ms 40284 KB Output is correct
51 Correct 6 ms 40220 KB Output is correct
52 Execution timed out 4041 ms 48252 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 40028 KB Output is correct
2 Correct 5 ms 40092 KB Output is correct
3 Correct 5 ms 40140 KB Output is correct
4 Correct 5 ms 40028 KB Output is correct
5 Correct 5 ms 40028 KB Output is correct
6 Correct 5 ms 40072 KB Output is correct
7 Correct 5 ms 40028 KB Output is correct
8 Correct 5 ms 40028 KB Output is correct
9 Correct 5 ms 40028 KB Output is correct
10 Correct 5 ms 40028 KB Output is correct
11 Correct 5 ms 40108 KB Output is correct
12 Correct 5 ms 40124 KB Output is correct
13 Correct 5 ms 40028 KB Output is correct
14 Correct 5 ms 40028 KB Output is correct
15 Correct 5 ms 40028 KB Output is correct
16 Correct 8 ms 40028 KB Output is correct
17 Correct 5 ms 40132 KB Output is correct
18 Correct 6 ms 40028 KB Output is correct
19 Correct 5 ms 40028 KB Output is correct
20 Correct 5 ms 40028 KB Output is correct
21 Correct 5 ms 40028 KB Output is correct
22 Correct 5 ms 40104 KB Output is correct
23 Correct 5 ms 40028 KB Output is correct
24 Correct 5 ms 40028 KB Output is correct
25 Correct 6 ms 40028 KB Output is correct
26 Correct 5 ms 40112 KB Output is correct
27 Correct 5 ms 40096 KB Output is correct
28 Correct 6 ms 40028 KB Output is correct
29 Correct 39 ms 40540 KB Output is correct
30 Correct 39 ms 40624 KB Output is correct
31 Correct 7 ms 40536 KB Output is correct
32 Correct 33 ms 40544 KB Output is correct
33 Correct 20 ms 40392 KB Output is correct
34 Correct 9 ms 40536 KB Output is correct
35 Correct 39 ms 40540 KB Output is correct
36 Correct 18 ms 40540 KB Output is correct
37 Correct 8 ms 40536 KB Output is correct
38 Correct 29 ms 40548 KB Output is correct
39 Correct 55 ms 40532 KB Output is correct
40 Correct 42 ms 40560 KB Output is correct
41 Correct 30 ms 40576 KB Output is correct
42 Correct 16 ms 40536 KB Output is correct
43 Correct 12 ms 40540 KB Output is correct
44 Correct 40 ms 40672 KB Output is correct
45 Correct 20 ms 40528 KB Output is correct
46 Correct 37 ms 40548 KB Output is correct
47 Correct 22 ms 40540 KB Output is correct
48 Correct 8 ms 40540 KB Output is correct
49 Correct 8 ms 40540 KB Output is correct
50 Correct 7 ms 40284 KB Output is correct
51 Correct 6 ms 40220 KB Output is correct
52 Execution timed out 4041 ms 48252 KB Time limit exceeded
53 Halted 0 ms 0 KB -