oj.uz

답안 #609669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609669 2022-07-27T19:03:30 Z gagik_2007 Jail (JOI22_jail) C++17
77 / 100
 5000 ms 557692 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef ll itn;

#define ff first
#define ss second

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 32768;
const ll N = 100007;
ll n, m, k;
vector<int>g[120007];
ll s[120007];
ll f[120007];
queue<int>q;

struct Point {
    int ind, val, tp;
    Point(int i, int vl, int tip) {
        ind = i;
        val = vl;
        tp = tip;
    }
    bool operator<(Point other)const {
        if (val < other.val)return true;
        else if (val > other.val)return false;
        else return tp < other.tp;
    }
};

vector<Point>d;
int tin[120007];
int tout[120007];
int timer = 0;
int up[120007][20];
int lg;

void dfs(int v, int par) {
    tin[v] = timer++;
    up[v][0] = par;
    for (int i = 0; i < g[v].size(); i++) {
        int to = g[v][i];
        if (to != par) {
            dfs(to, v);
        }
    }
    tout[v] = timer++;
}

void calc() {
    for (int i = 1; i <= lg; i++) {
        for (int v = 1; v <= n; v++) {
            up[v][i] = up[up[v][i - 1]][i - 1];
        }
    }
}

bool pap(int v, int u) {
    return tin[v]<=tin[u] && tout[v]>=tout[u];
}

int lca(int v, int u) {
    if (pap(v, u)) {
        return v;
    }
    if (pap(u, v)) {
        return u;
    }
    for (int i = lg; i >= 0; i--) {
        if (!pap(up[u][i], v)) {
            u = up[u][i];
        }
    }
    //cout << "lca of " << v << " and " << u << " is: " << up[u][0] << endl;
    return up[u][0];
}

bool votitak(int v, int u, int c) {
    return pap(lca(v, u), c) && (pap(c, u) || pap(c, v));
}

vector<int> champa(int v, int u){
    int papa = lca(v,u);
    vector<int>ans;
    while(v!=papa){
        ans.push_back(v);
        v=up[v][0];
    }
    while(u!=papa){
        ans.push_back(u);
        u=up[u][0];
    }
    ans.push_back(papa);
    return ans;
}

vector<int>g2[120007];
int color[120007];
int prc[120007];
int skz[120007];

bool is_cyclic(int v){
    color[v]=1;
    bool ans=false;
    for(int i=0;i<g2[v].size();i++){
        int to=g2[v][i];
        if(color[to]==1)ans=true;
        if(color[to]==0){
            if(is_cyclic(to)){
                ans=true;
            }
        }
    }
    color[v]=2;
    return ans;
}

void sax_jnjxel(){
    timer = 0;
    fill(tin, tin + 120007, 0);
    fill(tout, tout + 120007, 0);
    fill(color,color+120007,0);
    fill(prc,prc+120007,0);
    fill(skz,skz+120007,0);
    for (int i = 1; i <= n; i++) {
        g[i].clear();
        g2[i].clear();
    }
}

void solve(){
    cin >> n;
    lg = ceil(log2(n));
    bool ent1 = true;
    for (int i = 0; i < n - 1; i++) {
        ll x, y;
        cin >> x >> y;
        if (x != i + 1 || y != i + 2) {
            ent1 = false;
        }
        g[x].push_back(y);
        g[y].push_back(x);
    }
    cin >> m;
    for (int i = 1; i <= m; i++) {
        cin >> s[i] >> f[i];
    }
    //ent1 = false;
    if (ent1) {
        for (int i = 1; i <= m; i++) {
            Point x(i, s[i], 1), y(i, f[i], -1);
            d.push_back(x);
            d.push_back(y);
        }
        sort(d.begin(), d.end());
        bool aj = (d[0].tp == 1);
        bool ok = true;
        for (auto x : d) {
            //cout << x.ind << " " << x.tp << "  ";
            if (aj) {
                if (x.tp == 1) {
                    q.push(x.ind);
                }
                else {
                    if (q.empty()) {
                        aj = false;
                        q.push(x.ind);
                    }
                    else {
                        if (x.ind != q.front()) {
                            ok = false;
                            break;
                        }
                        else {
                            q.pop();
                        }
                    }
                }
            }
            else {
                if (x.tp == -1) {
                    q.push(x.ind);
                }
                else {
                    if (q.empty()) {
                        aj = true;
                        q.push(x.ind);
                    }
                    else {
                        if (x.ind != q.front()) {
                            ok = false;
                            break;
                        }
                        else {
                            q.pop();
                        }
                    }
                }
            }
        }
        cout << (ok ? "Yes" : "No") << endl;
        while (!q.empty()) {
            q.pop();
        }
        d.clear();
        for (int i = 1; i <= n; i++) {
            g[i].clear();
        }
    }
    else if(m<=500){
        dfs(1, 1);
        calc();
        for(int i=1;i<=m;i++){
            for(int j=1;j<=m;j++){
                if(j!=i){
                    bool skizb = votitak(f[i],s[i],f[j]);
                    bool verj = votitak(f[i],s[i],s[j]);
                    if(skizb&&verj){
                        //cout<<i<<" "<<j<<endl;
                        cout<<"No"<<endl;
                        sax_jnjxel();
                        return;
                    }
                    if(skizb){
                        g2[i].push_back(j);
                    }
                    else if(verj){
                        g2[j].push_back(i);
                    }
                }
            }
        }
        bool res=false;
        for(int i=1;i<=m;i++){
            if(color[i]==0){
                if(is_cyclic(i)){
                    res=true;
                    break;
                }
            }
        }
        if(!res){
            cout<<"Yes"<<endl;
        }
        else cout<<"No"<<endl;
        sax_jnjxel();
    }
    else{
        dfs(1, 1);
        calc();
        for(int i=1;i<=m;i++){
            prc[s[i]]=i;
            skz[f[i]]=i;
        }
        for(int i=1;i<=m;i++){
            vector<int>c=champa(f[i],s[i]);
            for(auto x:c){
                if(prc[x]!=0&&prc[x]!=i){
                    g2[prc[x]].push_back(i);
                }
                if(skz[x]!=0&&skz[x]!=i){
                    g2[i].push_back(skz[x]);
                }
            }
        }
        bool res=false;
        for(int i=1;i<=m;i++){
            if(color[i]==0){
                if(is_cyclic(i)){
                    res=true;
                    break;
                }
            }
        }
        if(!res){
            cout<<"Yes"<<endl;
        }
        else cout<<"No"<<endl;
        sax_jnjxel();
    }
}

int main() {
    cin >> ttt;
    while (ttt--) {
        solve();
    }
}

/*
4
7
1 2
1 3
2 4
2 5
3 6
3 7
2
4 3
2 7
7
1 2
1 3
2 4
2 5
3 6
3 7
2
4 3
7 2
7
1 2
1 3
2 4
2 5
3 6
3 7
2
4 7
3 2
7
1 2
1 3
2 4
2 5
3 6
3 7
2
4 7
3 4
*/

Compilation message

jail.cpp: In function 'void dfs(int, int)':
jail.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < g[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
jail.cpp: In function 'bool is_cyclic(int)':
jail.cpp:111:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     for(int i=0;i<g2[v].size();i++){
      |                 ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5844 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 29 ms 5972 KB Output is correct
5 Correct 64 ms 5952 KB Output is correct
6 Correct 7 ms 5908 KB Output is correct
7 Correct 6 ms 5972 KB Output is correct
8 Correct 7 ms 5972 KB Output is correct
9 Correct 69 ms 6100 KB Output is correct
10 Correct 97 ms 9744 KB Output is correct
11 Correct 20 ms 5844 KB Output is correct
12 Correct 80 ms 5972 KB Output is correct
13 Correct 125 ms 12092 KB Output is correct
14 Correct 135 ms 12152 KB Output is correct
15 Correct 129 ms 12100 KB Output is correct
16 Correct 180 ms 14700 KB Output is correct
17 Correct 143 ms 12280 KB Output is correct
18 Correct 216 ms 14680 KB Output is correct
19 Correct 124 ms 12224 KB Output is correct
20 Correct 133 ms 12280 KB Output is correct
21 Correct 165 ms 12296 KB Output is correct
22 Correct 159 ms 12252 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5928 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 7 ms 5972 KB Output is correct
4 Correct 10 ms 8324 KB Output is correct
5 Correct 8 ms 8276 KB Output is correct
6 Correct 11 ms 8276 KB Output is correct
7 Correct 8 ms 8296 KB Output is correct
8 Correct 11 ms 8336 KB Output is correct
9 Correct 9 ms 8336 KB Output is correct
10 Correct 11 ms 8276 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 9 ms 8276 KB Output is correct
13 Correct 9 ms 8212 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5928 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 7 ms 5972 KB Output is correct
4 Correct 10 ms 8324 KB Output is correct
5 Correct 8 ms 8276 KB Output is correct
6 Correct 11 ms 8276 KB Output is correct
7 Correct 8 ms 8296 KB Output is correct
8 Correct 11 ms 8336 KB Output is correct
9 Correct 9 ms 8336 KB Output is correct
10 Correct 11 ms 8276 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 9 ms 8276 KB Output is correct
13 Correct 9 ms 8212 KB Output is correct
14 Correct 5 ms 8276 KB Output is correct
15 Correct 4 ms 5844 KB Output is correct
16 Correct 6 ms 5884 KB Output is correct
17 Correct 11 ms 8276 KB Output is correct
18 Correct 8 ms 8276 KB Output is correct
19 Correct 7 ms 8208 KB Output is correct
20 Correct 9 ms 8276 KB Output is correct
21 Correct 11 ms 8276 KB Output is correct
22 Correct 9 ms 8344 KB Output is correct
23 Correct 8 ms 8276 KB Output is correct
24 Correct 8 ms 8276 KB Output is correct
25 Correct 12 ms 8312 KB Output is correct
26 Correct 9 ms 8316 KB Output is correct
27 Correct 12 ms 8276 KB Output is correct
28 Correct 6 ms 8280 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5928 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 7 ms 5972 KB Output is correct
4 Correct 10 ms 8324 KB Output is correct
5 Correct 8 ms 8276 KB Output is correct
6 Correct 11 ms 8276 KB Output is correct
7 Correct 8 ms 8296 KB Output is correct
8 Correct 11 ms 8336 KB Output is correct
9 Correct 9 ms 8336 KB Output is correct
10 Correct 11 ms 8276 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 9 ms 8276 KB Output is correct
13 Correct 9 ms 8212 KB Output is correct
14 Correct 5 ms 8276 KB Output is correct
15 Correct 4 ms 5844 KB Output is correct
16 Correct 6 ms 5884 KB Output is correct
17 Correct 11 ms 8276 KB Output is correct
18 Correct 8 ms 8276 KB Output is correct
19 Correct 7 ms 8208 KB Output is correct
20 Correct 9 ms 8276 KB Output is correct
21 Correct 11 ms 8276 KB Output is correct
22 Correct 9 ms 8344 KB Output is correct
23 Correct 8 ms 8276 KB Output is correct
24 Correct 8 ms 8276 KB Output is correct
25 Correct 12 ms 8312 KB Output is correct
26 Correct 9 ms 8316 KB Output is correct
27 Correct 12 ms 8276 KB Output is correct
28 Correct 6 ms 8280 KB Output is correct
29 Correct 7 ms 5972 KB Output is correct
30 Correct 11 ms 8280 KB Output is correct
31 Correct 10 ms 8348 KB Output is correct
32 Correct 13 ms 8340 KB Output is correct
33 Correct 11 ms 8336 KB Output is correct
34 Correct 18 ms 8276 KB Output is correct
35 Correct 15 ms 8276 KB Output is correct
36 Correct 27 ms 8332 KB Output is correct
37 Correct 24 ms 8276 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5928 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 7 ms 5972 KB Output is correct
4 Correct 10 ms 8324 KB Output is correct
5 Correct 8 ms 8276 KB Output is correct
6 Correct 11 ms 8276 KB Output is correct
7 Correct 8 ms 8296 KB Output is correct
8 Correct 11 ms 8336 KB Output is correct
9 Correct 9 ms 8336 KB Output is correct
10 Correct 11 ms 8276 KB Output is correct
11 Correct 8 ms 8276 KB Output is correct
12 Correct 9 ms 8276 KB Output is correct
13 Correct 9 ms 8212 KB Output is correct
14 Correct 5 ms 8276 KB Output is correct
15 Correct 4 ms 5844 KB Output is correct
16 Correct 6 ms 5884 KB Output is correct
17 Correct 11 ms 8276 KB Output is correct
18 Correct 8 ms 8276 KB Output is correct
19 Correct 7 ms 8208 KB Output is correct
20 Correct 9 ms 8276 KB Output is correct
21 Correct 11 ms 8276 KB Output is correct
22 Correct 9 ms 8344 KB Output is correct
23 Correct 8 ms 8276 KB Output is correct
24 Correct 8 ms 8276 KB Output is correct
25 Correct 12 ms 8312 KB Output is correct
26 Correct 9 ms 8316 KB Output is correct
27 Correct 12 ms 8276 KB Output is correct
28 Correct 6 ms 8280 KB Output is correct
29 Correct 7 ms 5972 KB Output is correct
30 Correct 11 ms 8280 KB Output is correct
31 Correct 10 ms 8348 KB Output is correct
32 Correct 13 ms 8340 KB Output is correct
33 Correct 11 ms 8336 KB Output is correct
34 Correct 18 ms 8276 KB Output is correct
35 Correct 15 ms 8276 KB Output is correct
36 Correct 27 ms 8332 KB Output is correct
37 Correct 24 ms 8276 KB Output is correct
38 Correct 89 ms 6228 KB Output is correct
39 Correct 92 ms 9680 KB Output is correct
40 Correct 461 ms 9172 KB Output is correct
41 Correct 773 ms 9040 KB Output is correct
42 Correct 578 ms 9368 KB Output is correct
43 Correct 82 ms 9108 KB Output is correct
44 Correct 386 ms 8432 KB Output is correct
45 Correct 180 ms 21484 KB Output is correct
46 Correct 170 ms 21364 KB Output is correct
47 Correct 157 ms 25064 KB Output is correct
48 Correct 198 ms 25096 KB Output is correct
49 Correct 110 ms 21508 KB Output is correct
50 Correct 168 ms 21576 KB Output is correct
51 Correct 135 ms 22588 KB Output is correct
52 Correct 126 ms 22588 KB Output is correct
53 Correct 491 ms 9252 KB Output is correct
54 Correct 197 ms 21324 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5844 KB Output is correct
2 Correct 6 ms 8276 KB Output is correct
3 Correct 3 ms 5844 KB Output is correct
4 Correct 4 ms 5844 KB Output is correct
5 Correct 14 ms 5972 KB Output is correct
6 Correct 9 ms 8276 KB Output is correct
7 Correct 6 ms 8276 KB Output is correct
8 Correct 6 ms 8276 KB Output is correct
9 Correct 5 ms 8276 KB Output is correct
10 Correct 5 ms 8276 KB Output is correct
11 Correct 6 ms 8276 KB Output is correct
12 Correct 25 ms 8352 KB Output is correct
13 Correct 109 ms 8300 KB Output is correct
14 Correct 170 ms 8316 KB Output is correct
15 Correct 259 ms 8276 KB Output is correct
16 Correct 166 ms 21988 KB Output is correct
17 Correct 290 ms 30988 KB Output is correct
18 Correct 552 ms 55284 KB Output is correct
19 Correct 160 ms 23608 KB Output is correct
20 Correct 168 ms 23348 KB Output is correct
21 Correct 147 ms 23680 KB Output is correct
22 Correct 229 ms 30816 KB Output is correct
23 Correct 226 ms 30776 KB Output is correct
24 Correct 208 ms 29428 KB Output is correct
25 Correct 196 ms 30532 KB Output is correct
26 Correct 207 ms 30532 KB Output is correct
27 Correct 284 ms 31032 KB Output is correct
28 Correct 291 ms 37680 KB Output is correct
29 Correct 300 ms 33864 KB Output is correct
30 Correct 190 ms 29600 KB Output is correct
31 Correct 226 ms 30336 KB Output is correct
32 Correct 220 ms 28620 KB Output is correct
33 Correct 205 ms 30372 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5844 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 29 ms 5972 KB Output is correct
5 Correct 64 ms 5952 KB Output is correct
6 Correct 7 ms 5908 KB Output is correct
7 Correct 6 ms 5972 KB Output is correct
8 Correct 7 ms 5972 KB Output is correct
9 Correct 69 ms 6100 KB Output is correct
10 Correct 97 ms 9744 KB Output is correct
11 Correct 20 ms 5844 KB Output is correct
12 Correct 80 ms 5972 KB Output is correct
13 Correct 125 ms 12092 KB Output is correct
14 Correct 135 ms 12152 KB Output is correct
15 Correct 129 ms 12100 KB Output is correct
16 Correct 180 ms 14700 KB Output is correct
17 Correct 143 ms 12280 KB Output is correct
18 Correct 216 ms 14680 KB Output is correct
19 Correct 124 ms 12224 KB Output is correct
20 Correct 133 ms 12280 KB Output is correct
21 Correct 165 ms 12296 KB Output is correct
22 Correct 159 ms 12252 KB Output is correct
23 Correct 4 ms 5928 KB Output is correct
24 Correct 4 ms 5844 KB Output is correct
25 Correct 7 ms 5972 KB Output is correct
26 Correct 10 ms 8324 KB Output is correct
27 Correct 8 ms 8276 KB Output is correct
28 Correct 11 ms 8276 KB Output is correct
29 Correct 8 ms 8296 KB Output is correct
30 Correct 11 ms 8336 KB Output is correct
31 Correct 9 ms 8336 KB Output is correct
32 Correct 11 ms 8276 KB Output is correct
33 Correct 8 ms 8276 KB Output is correct
34 Correct 9 ms 8276 KB Output is correct
35 Correct 9 ms 8212 KB Output is correct
36 Correct 5 ms 8276 KB Output is correct
37 Correct 4 ms 5844 KB Output is correct
38 Correct 6 ms 5884 KB Output is correct
39 Correct 11 ms 8276 KB Output is correct
40 Correct 8 ms 8276 KB Output is correct
41 Correct 7 ms 8208 KB Output is correct
42 Correct 9 ms 8276 KB Output is correct
43 Correct 11 ms 8276 KB Output is correct
44 Correct 9 ms 8344 KB Output is correct
45 Correct 8 ms 8276 KB Output is correct
46 Correct 8 ms 8276 KB Output is correct
47 Correct 12 ms 8312 KB Output is correct
48 Correct 9 ms 8316 KB Output is correct
49 Correct 12 ms 8276 KB Output is correct
50 Correct 6 ms 8280 KB Output is correct
51 Correct 7 ms 5972 KB Output is correct
52 Correct 11 ms 8280 KB Output is correct
53 Correct 10 ms 8348 KB Output is correct
54 Correct 13 ms 8340 KB Output is correct
55 Correct 11 ms 8336 KB Output is correct
56 Correct 18 ms 8276 KB Output is correct
57 Correct 15 ms 8276 KB Output is correct
58 Correct 27 ms 8332 KB Output is correct
59 Correct 24 ms 8276 KB Output is correct
60 Correct 89 ms 6228 KB Output is correct
61 Correct 92 ms 9680 KB Output is correct
62 Correct 461 ms 9172 KB Output is correct
63 Correct 773 ms 9040 KB Output is correct
64 Correct 578 ms 9368 KB Output is correct
65 Correct 82 ms 9108 KB Output is correct
66 Correct 386 ms 8432 KB Output is correct
67 Correct 180 ms 21484 KB Output is correct
68 Correct 170 ms 21364 KB Output is correct
69 Correct 157 ms 25064 KB Output is correct
70 Correct 198 ms 25096 KB Output is correct
71 Correct 110 ms 21508 KB Output is correct
72 Correct 168 ms 21576 KB Output is correct
73 Correct 135 ms 22588 KB Output is correct
74 Correct 126 ms 22588 KB Output is correct
75 Correct 491 ms 9252 KB Output is correct
76 Correct 197 ms 21324 KB Output is correct
77 Correct 4 ms 5844 KB Output is correct
78 Correct 6 ms 8276 KB Output is correct
79 Correct 3 ms 5844 KB Output is correct
80 Correct 4 ms 5844 KB Output is correct
81 Correct 14 ms 5972 KB Output is correct
82 Correct 9 ms 8276 KB Output is correct
83 Correct 6 ms 8276 KB Output is correct
84 Correct 6 ms 8276 KB Output is correct
85 Correct 5 ms 8276 KB Output is correct
86 Correct 5 ms 8276 KB Output is correct
87 Correct 6 ms 8276 KB Output is correct
88 Correct 25 ms 8352 KB Output is correct
89 Correct 109 ms 8300 KB Output is correct
90 Correct 170 ms 8316 KB Output is correct
91 Correct 259 ms 8276 KB Output is correct
92 Correct 166 ms 21988 KB Output is correct
93 Correct 290 ms 30988 KB Output is correct
94 Correct 552 ms 55284 KB Output is correct
95 Correct 160 ms 23608 KB Output is correct
96 Correct 168 ms 23348 KB Output is correct
97 Correct 147 ms 23680 KB Output is correct
98 Correct 229 ms 30816 KB Output is correct
99 Correct 226 ms 30776 KB Output is correct
100 Correct 208 ms 29428 KB Output is correct
101 Correct 196 ms 30532 KB Output is correct
102 Correct 207 ms 30532 KB Output is correct
103 Correct 284 ms 31032 KB Output is correct
104 Correct 291 ms 37680 KB Output is correct
105 Correct 300 ms 33864 KB Output is correct
106 Correct 190 ms 29600 KB Output is correct
107 Correct 226 ms 30336 KB Output is correct
108 Correct 220 ms 28620 KB Output is correct
109 Correct 205 ms 30372 KB Output is correct
110 Correct 175 ms 9172 KB Output is correct
111 Correct 101 ms 8936 KB Output is correct
112 Execution timed out 5052 ms 557692 KB Time limit exceeded
113 Halted 0 ms 0 KB -