oj.uz

답안 #811117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
811117 2023-08-07T00:12:16 Z penguinman 분수 공원 (IOI21_parks) C++17
25 / 100
 1449 ms 123192 KB 
#include "parks.h"

#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::vector;
using std::string;
using ll = int;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;
using std::endl;

#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define ln "\n"
#define pb emplace_back
#define mp std::make_pair
#define all(a) a.begin(),a.end()

int construct_roads(std::vector<int> x, std::vector<int> y) {
    std::map<pii,ll> xy;
    std::map<pii,ll> rev;
    rep(i,0,x.size()) xy[mp(x[i],y[i])] = i;
    ll cnt__ = 0;
    rep(i,0,x.size()){
        vi P = {2,0}, Q = {0,2};
        vi R = {0,1}, S = {1,0};
        rep(j,0,2){
            if(xy.count(mp(x[i]+P[j], y[i]+Q[j]))){
                ll mx = x[i]+P[j]/2;
                ll my = y[i]+Q[j]/2;
                rev[mp(mx+R[j], my+S[j])] = rev[mp(mx-R[j],my-S[j])] = 0;
                cnt__++;
            }
        }
    }
    if(cnt__ != ll(x.size()-1)) return 0;
    ll N = 0;
    vi rx, ry;
    for(auto &el: rev){
        el.second = N++;
        rx.pb(el.first.first);
        ry.pb(el.first.second);
    }
    vii edge(N);
    vii eu(N), ev(N);
    rep(i,0,x.size()){
        vi P = {2,0}, Q = {0,2};
        vi R = {0,1}, S = {1,0};
        rep(j,0,2){
            if(xy.count(mp(x[i]+P[j], y[i]+Q[j]))){
                ll mx = x[i]+P[j]/2;
                ll my = y[i]+Q[j]/2;
                ll nu = rev[mp(mx+R[j], my+S[j])];
                ll nv = rev[mp(mx-R[j],my-S[j])];
                ll nxy = xy[mp(x[i]+P[j], y[i]+Q[j])];
                edge[nu].pb(nv);
                eu[nu].pb(i);
                ev[nu].pb(nxy);
                edge[nv].pb(nu);
                eu[nv].pb(i);
                ev[nv].pb(nxy);
            }
        }
    }
    vi cnt(N);
    rep(i,0,N) cnt[i] = edge[i].size();
    vi u,v,a,b;
    rep(k,0,N){
        if(cnt[k] != 1) continue;
        cnt[k]--;
        ll now = k;
        while(true){
            ll nex = -1;
            rep(i,0,edge[now].size()){
                ll next = edge[now][i];
                if(cnt[next] == 0) continue;
                u.pb(eu[now][i]);
                v.pb(ev[now][i]);
                a.pb(rx[now]);
                b.pb(ry[now]);
                cnt[next]--;
                if(cnt[next] == 1){
                    cnt[next]--;
                    nex = next;
                }
            }
            if(nex == -1) break;
            now = nex;
        }
    }
    rep(i,0,N){
        if(cnt[i] > 2) return 0;
    }
    rep(i,0,N){
        assert(cnt[i] == 0 || cnt[i] == 2);
        if(cnt[i] == 0) continue;
        cnt[i] = 0;
        ll now = i;
        while(true){
            ll val = -1;
            rep(j,0,edge[now].size()){
                ll next = edge[now][j];
                if(cnt[next] == 0) continue;
                u.pb(eu[now][j]);
                v.pb(ev[now][j]);
                a.pb(rx[now]);
                b.pb(ry[now]);
                val = cnt[next];
                cnt[next] = 0;
                now = next;
                break;
            }
            if(val == -1) break;
        }
        rep(j,0,edge[now].size()){
            ll next = edge[now][j];
            if(next != i) continue;
            u.pb(eu[now][j]);
            v.pb(ev[now][j]);
            a.pb(rx[now]);
            b.pb(ry[now]);
        }
    }
    build(u,v,a,b);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 575 ms 61356 KB Output is correct
10 Correct 23 ms 6484 KB Output is correct
11 Correct 126 ms 33328 KB Output is correct
12 Correct 28 ms 9392 KB Output is correct
13 Correct 40 ms 9616 KB Output is correct
14 Correct 2 ms 432 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 544 ms 61416 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 575 ms 61356 KB Output is correct
10 Correct 23 ms 6484 KB Output is correct
11 Correct 126 ms 33328 KB Output is correct
12 Correct 28 ms 9392 KB Output is correct
13 Correct 40 ms 9616 KB Output is correct
14 Correct 2 ms 432 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 544 ms 61416 KB Output is correct
17 Incorrect 1 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 575 ms 61356 KB Output is correct
10 Correct 23 ms 6484 KB Output is correct
11 Correct 126 ms 33328 KB Output is correct
12 Correct 28 ms 9392 KB Output is correct
13 Correct 40 ms 9616 KB Output is correct
14 Correct 2 ms 432 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 544 ms 61416 KB Output is correct
17 Incorrect 1 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 575 ms 61356 KB Output is correct
10 Correct 23 ms 6484 KB Output is correct
11 Correct 126 ms 33328 KB Output is correct
12 Correct 28 ms 9392 KB Output is correct
13 Correct 40 ms 9616 KB Output is correct
14 Correct 2 ms 432 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 544 ms 61416 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 912 ms 74256 KB Output is correct
21 Correct 1090 ms 74240 KB Output is correct
22 Correct 938 ms 74148 KB Output is correct
23 Correct 1051 ms 104348 KB Output is correct
24 Correct 229 ms 16476 KB Output is correct
25 Correct 525 ms 41360 KB Output is correct
26 Correct 517 ms 41564 KB Output is correct
27 Correct 1447 ms 121884 KB Output is correct
28 Correct 1449 ms 121836 KB Output is correct
29 Correct 1382 ms 121884 KB Output is correct
30 Correct 1415 ms 121868 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 36 ms 6652 KB Output is correct
33 Correct 83 ms 9372 KB Output is correct
34 Correct 1006 ms 76248 KB Output is correct
35 Correct 11 ms 1876 KB Output is correct
36 Correct 67 ms 8528 KB Output is correct
37 Correct 166 ms 16788 KB Output is correct
38 Correct 357 ms 34696 KB Output is correct
39 Correct 527 ms 47040 KB Output is correct
40 Correct 790 ms 60288 KB Output is correct
41 Correct 966 ms 72792 KB Output is correct
42 Correct 1249 ms 85252 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 300 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 2 ms 596 KB Output is correct
55 Correct 3 ms 724 KB Output is correct
56 Correct 482 ms 46880 KB Output is correct
57 Correct 797 ms 68528 KB Output is correct
58 Correct 780 ms 68480 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1383 ms 123192 KB Output is correct
63 Correct 1388 ms 123140 KB Output is correct
64 Correct 1382 ms 122652 KB Output is correct
65 Correct 4 ms 956 KB Output is correct
66 Correct 8 ms 1620 KB Output is correct
67 Correct 467 ms 45644 KB Output is correct
68 Correct 843 ms 68964 KB Output is correct
69 Correct 1306 ms 91312 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 575 ms 61356 KB Output is correct
10 Correct 23 ms 6484 KB Output is correct
11 Correct 126 ms 33328 KB Output is correct
12 Correct 28 ms 9392 KB Output is correct
13 Correct 40 ms 9616 KB Output is correct
14 Correct 2 ms 432 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 544 ms 61416 KB Output is correct
17 Incorrect 475 ms 41516 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 296 KB Output is correct
9 Correct 575 ms 61356 KB Output is correct
10 Correct 23 ms 6484 KB Output is correct
11 Correct 126 ms 33328 KB Output is correct
12 Correct 28 ms 9392 KB Output is correct
13 Correct 40 ms 9616 KB Output is correct
14 Correct 2 ms 432 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 544 ms 61416 KB Output is correct
17 Incorrect 1 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -