oj.uz

답안 #829733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829733 2023-08-18T14:38:48 Z Abrar_Al_Samit 분수 공원 (IOI21_parks) C++17
5 / 100
 718 ms 54064 KB 
#include <bits/stdc++.h>
#include "parks.h"
using namespace std;

const int nax = 200000;
vector<int>g[nax];
bool vis[nax];
int par[nax], sz[nax];

void trav(int v) {
    vis[v] = 1;
    for(int u : g[v]) if(!vis[u]) {
        trav(u);
    }
}

int find(int v) {
    return par[v] = (v==par[v]) ? v : find(par[v]);
}
void unite(int u, int v) {
    u = find(u), v = find(v);
    if(sz[u] < sz[v]) swap(u, v);
    sz[u] += sz[v];
    par[v] = u;
}
int construct_roads(vector<int> x, vector<int> y) {
    int n = x.size();
    map<pair<int,int>, int>ft;
    for(int i=0; i<n; ++i) {
        ft[{x[i], y[i]}] = i;
    }

    int dx[] = {2, -2, 0, 0};
    int dy[] = {0, 0, 2, -2};

    vector<int>u, v, a, b;

    map<pair<int,int>, int>ben;

    for(int i=0; i<n; ++i) {
        par[i] = i, sz[i] = 1;
    }
    for(int i=0; i<n; ++i) {
        for(int j=0; j<4; ++j) {
            int nx = x[i] + dx[j], ny = y[i] + dy[j];
            if(ft.count(make_pair(nx, ny))) {
                int she = ft[{nx, ny}];
                if(find(i) == find(she)) continue;



                if(j < 2) {
                    if(!ben.count(make_pair(x[i] + nx >> 1, ny + 1))) {
                        ben[{x[i] + nx >> 1, ny + 1}] = 1;
                        a.push_back(x[i] + nx >> 1);
                        b.push_back(ny + 1);
                    } else {
                        assert(!ben.count(make_pair(x[i] + nx >> 1, ny - 1)));
                        ben[{x[i] + nx >> 1, ny - 1}] = 1;
                        a.push_back(x[i] + nx >> 1);
                        b.push_back(ny - 1);
                    }
                } else {
                    if(!ben.count(make_pair(x[i] - 1, y[i] + ny >> 1))) {
                        ben[{x[i] - 1, y[i] + ny >> 1}] = 1;
                        a.push_back(x[i] - 1);
                        b.push_back(y[i] + ny >> 1);
                    } else {
                        assert(!ben.count(make_pair(x[i] + 1, y[i] + ny >> 1)));
                        ben[{x[i] + 1, y[i] + ny >> 1}] = 1;
                        a.push_back(x[i] + 1);
                        b.push_back(y[i] + ny >> 1);
                    }
                }
                
                g[i].push_back(she);
                g[she].push_back(i);
                unite(i, she);
                u.push_back(i);
                v.push_back(she);
            }
        }
    }
    trav(0);
    for(int i=0; i<n; ++i) if(!vis[i]) {
        return 0;
    }

    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:53:50: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |                     if(!ben.count(make_pair(x[i] + nx >> 1, ny + 1))) {
parks.cpp:54:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |                         ben[{x[i] + nx >> 1, ny + 1}] = 1;
parks.cpp:55:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |                         a.push_back(x[i] + nx >> 1);
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from parks.cpp:1:
parks.cpp:58:58: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |                         assert(!ben.count(make_pair(x[i] + nx >> 1, ny - 1)));
parks.cpp:59:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |                         ben[{x[i] + nx >> 1, ny - 1}] = 1;
parks.cpp:60:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |                         a.push_back(x[i] + nx >> 1);
parks.cpp:64:60: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |                     if(!ben.count(make_pair(x[i] - 1, y[i] + ny >> 1))) {
parks.cpp:65:45: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |                         ben[{x[i] - 1, y[i] + ny >> 1}] = 1;
parks.cpp:67:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   67 |                         b.push_back(y[i] + ny >> 1);
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from parks.cpp:1:
parks.cpp:69:68: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |                         assert(!ben.count(make_pair(x[i] + 1, y[i] + ny >> 1)));
parks.cpp:70:45: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |                         ben[{x[i] + 1, y[i] + ny >> 1}] = 1;
parks.cpp:72:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |                         b.push_back(y[i] + ny >> 1);

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 226 ms 29352 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 77 ms 18208 KB Output is correct
12 Correct 19 ms 8920 KB Output is correct
13 Correct 51 ms 14220 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5376 KB Output is correct
16 Correct 222 ms 28688 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 226 ms 29352 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 77 ms 18208 KB Output is correct
12 Correct 19 ms 8920 KB Output is correct
13 Correct 51 ms 14220 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5376 KB Output is correct
16 Correct 222 ms 28688 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 4908 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Runtime error 129 ms 48300 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 226 ms 29352 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 77 ms 18208 KB Output is correct
12 Correct 19 ms 8920 KB Output is correct
13 Correct 51 ms 14220 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5376 KB Output is correct
16 Correct 222 ms 28688 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 4908 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Runtime error 129 ms 48300 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 226 ms 29352 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 77 ms 18208 KB Output is correct
12 Correct 19 ms 8920 KB Output is correct
13 Correct 51 ms 14220 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5376 KB Output is correct
16 Correct 222 ms 28688 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 718 ms 54064 KB Output is correct
21 Runtime error 112 ms 48204 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 226 ms 29352 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 77 ms 18208 KB Output is correct
12 Correct 19 ms 8920 KB Output is correct
13 Correct 51 ms 14220 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5376 KB Output is correct
16 Correct 222 ms 28688 KB Output is correct
17 Correct 702 ms 53536 KB Output is correct
18 Correct 639 ms 52568 KB Output is correct
19 Runtime error 120 ms 49564 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 226 ms 29352 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 77 ms 18208 KB Output is correct
12 Correct 19 ms 8920 KB Output is correct
13 Correct 51 ms 14220 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5376 KB Output is correct
16 Correct 222 ms 28688 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 4908 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Runtime error 129 ms 48300 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -