Submission #803227

# Submission time Handle Problem Language Result Execution time Memory
803227 2023-08-03T01:43:31 Z boyliguanhan Fountain Parks (IOI21_parks) C++17
15 / 100
125 ms 27444 KB
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
bitset<200100> have[7];
int at[7][200100];
int construct1(int row) {
    vector<int>u,v,x,y;
    int prev = 0;
    for(int i = 2; i <= 200000; i+=2) {
        if(have[row][i]) {
            if(prev) {
                if(i-prev>2)
                    return 0;
                u.push_back(at[row][i]);
                v.push_back(at[row][i-2]);
                x.push_back(row+1);
                y.push_back(i-1);
            }
            prev = i;
        }
    }
    build(u,v,x,y);
    return 1;
}
int p[200100];
int abp(int n) {
    if(p[n]==n) return n;
    return p[n]=abp(p[n]);
}
int n;
int construct2(int row1, int row2) {
    int prev1 = 0, prev2 = 0;
    vector<pair<pair<int, int>, pair<int, int>>> edges;
    for(int i = 2; i <= 200000; i+=2) {
        if(have[row2][i]&&i>2){
            if(have[row2][i-2])
                edges.push_back({{at[row2][i], at[row2][i-2]}, {row2+1, i-1}});
        }
        if(have[row1][i]) {
            if(i>2) {
                if(have[row1][i-2])
                    edges.push_back({{at[row1][i], at[row1][i-2]}, {row1-1, i-1}});
            }
            if(have[row2][i])
                edges.push_back({{at[row1][i], at[row2][i]}, {row1+1, i-1}});
        }
    }
    iota(p,p+200100,0);
    vector<int> u,v,x,y;
    for(auto i: edges)
        u.push_back(i.first.first), v.push_back(i.first.second),x.push_back(i.second.first),y.push_back(i.second.second);
    int cnt = 0;
    for(int i = 0; i < edges.size(); i++)
        if(abp(u[i])!=abp(v[i]))
            p[p[u[i]]]=p[v[i]],cnt++;
    if(cnt!=n-1) return 0;
    build(u,v,x,y);
    return 1;
}
int construct_roads(vector<int> x, vector<int> y) {
    n = x.size();
    for(int i = 0; i < n; i++)
        have[x[i]][y[i]] = 1,at[x[i]][y[i]]=i;
    int a = have[2].count(), b = have[4].count(), c = have[6].count();
    if(!a&&!b) return construct1(6);
    if(!a&&!c) return construct1(4);
    if(!c&&!b) return construct1(2);
    if(!b) return 0;
    if(!c) return construct2(2,4);
    if(!a) return construct2(4,6);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct2(int, int)':
parks.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i = 0; i < edges.size(); i++)
      |                    ~~^~~~~~~~~~~~~~
parks.cpp:32:9: warning: unused variable 'prev1' [-Wunused-variable]
   32 |     int prev1 = 0, prev2 = 0;
      |         ^~~~~
parks.cpp:32:20: warning: unused variable 'prev2' [-Wunused-variable]
   32 |     int prev1 = 0, prev2 = 0;
      |                    ^~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 38 ms 7468 KB Output is correct
10 Correct 4 ms 1236 KB Output is correct
11 Correct 20 ms 4172 KB Output is correct
12 Correct 8 ms 1660 KB Output is correct
13 Correct 6 ms 2076 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 38 ms 7484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 38 ms 7468 KB Output is correct
10 Correct 4 ms 1236 KB Output is correct
11 Correct 20 ms 4172 KB Output is correct
12 Correct 8 ms 1660 KB Output is correct
13 Correct 6 ms 2076 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 38 ms 7484 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 125 ms 27444 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 2 ms 1540 KB Output is correct
28 Correct 45 ms 10664 KB Output is correct
29 Correct 66 ms 16212 KB Output is correct
30 Correct 88 ms 20248 KB Output is correct
31 Correct 115 ms 27432 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1152 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 1 ms 1108 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1108 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1236 KB Output is correct
44 Correct 1 ms 1364 KB Output is correct
45 Correct 40 ms 10436 KB Output is correct
46 Correct 61 ms 15380 KB Output is correct
47 Correct 63 ms 15384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 38 ms 7468 KB Output is correct
10 Correct 4 ms 1236 KB Output is correct
11 Correct 20 ms 4172 KB Output is correct
12 Correct 8 ms 1660 KB Output is correct
13 Correct 6 ms 2076 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 38 ms 7484 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 125 ms 27444 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 2 ms 1540 KB Output is correct
28 Correct 45 ms 10664 KB Output is correct
29 Correct 66 ms 16212 KB Output is correct
30 Correct 88 ms 20248 KB Output is correct
31 Correct 115 ms 27432 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1152 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 1 ms 1108 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1108 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1236 KB Output is correct
44 Correct 1 ms 1364 KB Output is correct
45 Correct 40 ms 10436 KB Output is correct
46 Correct 61 ms 15380 KB Output is correct
47 Correct 63 ms 15384 KB Output is correct
48 Correct 1 ms 1108 KB Output is correct
49 Correct 1 ms 1016 KB Output is correct
50 Incorrect 0 ms 340 KB Wrong answer detected in grader
51 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 38 ms 7468 KB Output is correct
10 Correct 4 ms 1236 KB Output is correct
11 Correct 20 ms 4172 KB Output is correct
12 Correct 8 ms 1660 KB Output is correct
13 Correct 6 ms 2076 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 38 ms 7484 KB Output is correct
17 Runtime error 1 ms 308 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 38 ms 7468 KB Output is correct
10 Correct 4 ms 1236 KB Output is correct
11 Correct 20 ms 4172 KB Output is correct
12 Correct 8 ms 1660 KB Output is correct
13 Correct 6 ms 2076 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 38 ms 7484 KB Output is correct
17 Runtime error 33 ms 6756 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 38 ms 7468 KB Output is correct
10 Correct 4 ms 1236 KB Output is correct
11 Correct 20 ms 4172 KB Output is correct
12 Correct 8 ms 1660 KB Output is correct
13 Correct 6 ms 2076 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 38 ms 7484 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 125 ms 27444 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 2 ms 1540 KB Output is correct
28 Correct 45 ms 10664 KB Output is correct
29 Correct 66 ms 16212 KB Output is correct
30 Correct 88 ms 20248 KB Output is correct
31 Correct 115 ms 27432 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1152 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 1 ms 1108 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1108 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1236 KB Output is correct
44 Correct 1 ms 1364 KB Output is correct
45 Correct 40 ms 10436 KB Output is correct
46 Correct 61 ms 15380 KB Output is correct
47 Correct 63 ms 15384 KB Output is correct
48 Correct 1 ms 1108 KB Output is correct
49 Correct 1 ms 1016 KB Output is correct
50 Incorrect 0 ms 340 KB Wrong answer detected in grader
51 Halted 0 ms 0 KB -