oj.uz

답안 #1059425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059425 2024-08-14T23:51:02 Z Trent 분수 공원 (IOI21_parks) C++17
15 / 100
 241 ms 35876 KB 
#include "parks.h"
#include "bits/stdc++.h"
using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef set<int> si;
struct pii{int a, b;};
bool operator <(pii a, pii b) {return a.a < b.a || a.a == b.a && a.b < b.b;}
const int MD = 2e5 + 10;

bool conn(int n, vi& u, vi& v) {
    vvi adj(n);
    forR(i, u.size()) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    vb vis(n);
    vi dfs = {0};
    while(!dfs.empty()) {
        int cur = dfs.back(); dfs.pop_back();
        if(!vis[cur]) {
            vis[cur] = true;
            for(int i : adj[cur]) if(!vis[i]) {
                dfs.push_back(i);
            }
        }
    }
    forR(i, n) if(!vis[i]) return false;
    return true;
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = x.size();
    map<pii, int> ci;
    forR(i, n) ci[{x[i], y[i]}] = i;
    vi u, v, a, b;

    for(int y = 2; y < MD; y += 2) {
        if(ci.count({2, y}) && ci.count({2, y+2})) {
            u.push_back(ci[{2,y}]);
            v.push_back(ci[{2, y+2}]);
            a.push_back(1);
            b.push_back(y + 1);
        }
        if(ci.count({4, y}) && ci.count({4, y+2})) {
            u.push_back(ci[{4,y}]);
            v.push_back(ci[{4, y+2}]);
            a.push_back(5);
            b.push_back(y + 1);
        }
        if(ci.count({4, y}) && ci.count({2, y})) {
            u.push_back(ci[{2, y}]);
            v.push_back(ci[{4, y}]);
            a.push_back(3);
            b.push_back(y + 1);
        }
    }
    if(conn(n, u, v)) {
        build(u, v, a, b);
        return 1;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'bool operator<(pii, pii)':
parks.cpp:12:63: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   12 | bool operator <(pii a, pii b) {return a.a < b.a || a.a == b.a && a.b < b.b;}
      |                                                    ~~~~~~~~~~~^~~~~~~~~~~~
parks.cpp: In function 'bool conn(int, vi&, vi&)':
parks.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
parks.cpp:17:5: note: in expansion of macro 'forR'
   17 |     forR(i, u.size()) {
      |     ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 80 ms 15300 KB Output is correct
10 Correct 18 ms 1904 KB Output is correct
11 Correct 50 ms 8200 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Correct 41 ms 6792 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 81 ms 15284 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 80 ms 15300 KB Output is correct
10 Correct 18 ms 1904 KB Output is correct
11 Correct 50 ms 8200 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Correct 41 ms 6792 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 81 ms 15284 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 221 ms 35876 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 6 ms 604 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 6 ms 1112 KB Output is correct
28 Correct 79 ms 14060 KB Output is correct
29 Correct 139 ms 21568 KB Output is correct
30 Correct 175 ms 27832 KB Output is correct
31 Correct 241 ms 34744 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 5 ms 692 KB Output is correct
45 Correct 88 ms 16128 KB Output is correct
46 Correct 143 ms 23024 KB Output is correct
47 Correct 129 ms 23104 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 80 ms 15300 KB Output is correct
10 Correct 18 ms 1904 KB Output is correct
11 Correct 50 ms 8200 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Correct 41 ms 6792 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 81 ms 15284 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 221 ms 35876 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 6 ms 604 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 6 ms 1112 KB Output is correct
28 Correct 79 ms 14060 KB Output is correct
29 Correct 139 ms 21568 KB Output is correct
30 Correct 175 ms 27832 KB Output is correct
31 Correct 241 ms 34744 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 5 ms 692 KB Output is correct
45 Correct 88 ms 16128 KB Output is correct
46 Correct 143 ms 23024 KB Output is correct
47 Correct 129 ms 23104 KB Output is correct
48 Incorrect 2 ms 344 KB Solution announced impossible, but it is possible.
49 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 80 ms 15300 KB Output is correct
10 Correct 18 ms 1904 KB Output is correct
11 Correct 50 ms 8200 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Correct 41 ms 6792 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 81 ms 15284 KB Output is correct
17 Incorrect 1 ms 348 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 80 ms 15300 KB Output is correct
10 Correct 18 ms 1904 KB Output is correct
11 Correct 50 ms 8200 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Correct 41 ms 6792 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 81 ms 15284 KB Output is correct
17 Incorrect 105 ms 23120 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 428 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 80 ms 15300 KB Output is correct
10 Correct 18 ms 1904 KB Output is correct
11 Correct 50 ms 8200 KB Output is correct
12 Correct 22 ms 2648 KB Output is correct
13 Correct 41 ms 6792 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 81 ms 15284 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 221 ms 35876 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 6 ms 604 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 6 ms 1112 KB Output is correct
28 Correct 79 ms 14060 KB Output is correct
29 Correct 139 ms 21568 KB Output is correct
30 Correct 175 ms 27832 KB Output is correct
31 Correct 241 ms 34744 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 2 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 4 ms 604 KB Output is correct
44 Correct 5 ms 692 KB Output is correct
45 Correct 88 ms 16128 KB Output is correct
46 Correct 143 ms 23024 KB Output is correct
47 Correct 129 ms 23104 KB Output is correct
48 Incorrect 2 ms 344 KB Solution announced impossible, but it is possible.
49 Halted 0 ms 0 KB -