oj.uz

답안 #436744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
436744 2021-06-24T20:18:46 Z PiejanVDC 분수 공원 (IOI21_parks) C++17
5 / 100
 293 ms 31036 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;

int construct_roads(vector<int>x, vector<int> y) {
    vector<pair<int,int>>two,four;
    for(int i = 0 ; i < y.size() ; i++) {
        if(x[i] == 2) two.push_back({y[i],i});
        else four.push_back({y[i],i});
    }
    vector<int>adj[x.size()];
    vector<int>u,v,a,b;
    sort(two.begin(),two.end());
    sort(four.begin(),four.end());
    for(int i = 0 ; i < (int)two.size()-1 ; i++) {
        if(two[i+1].first-two[i].first == 2) {
            u.push_back(two[i].second);
            v.push_back(two[i+1].second);
            a.push_back(1);
            b.push_back(two[i].first+1);
            adj[two[i].second].push_back(two[i+1].second);
            adj[two[i+1].second].push_back(two[i].second);
        }
    }
    for(int i = 0 ; i < (int)four.size()-1 ; i++) {
        if(four[i+1].first-four[i].first == 2) {
            u.push_back(four[i].second);
            v.push_back(four[i+1].second);
            a.push_back(5);
            b.push_back(four[i].first+1);
            adj[four[i].second].push_back(four[i+1].second);
            adj[four[i+1].second].push_back(four[i].second);
        }
    }
    if((int)two.size() > 0 && (int)four.size() > 0) {
        for(int i = 0 ; i < two.size() ; i++) {
            int left=0,right=four.size();
            while(left <= right) {
                int mid = (left+right)/2;
                if(four[mid].first == two[i].first) {
                    u.push_back(two[i].second);
                    v.push_back(four[i].second);
                    a.push_back(3);
                    b.push_back(two[i].first+1);
                    adj[two[i].second].push_back(four[mid].second);
                    adj[four[mid].second].push_back(two[i].second);
                    break;
                }
                if(four[mid].first < two[i].first) {
                    left=mid+1;
                } else {
                    right=mid-1;
                }
            }
        }
    }
    stack<int>s;
    s.push(0);
    vector<bool>vis(x.size(),false);
    while(!s.empty()) {
        int node = s.top();
        s.pop();
        vis[node]=true;
        for(auto z : adj[node]) {
            if(!vis[z]) s.push(z);
        }
    }
    bool f=true;
    for(auto z : vis) {
        if(!z) {
            f=false; break;
        }
    }
    if(f) {
        build(u,v,a,b);
        return 1;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:7:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |     for(int i = 0 ; i < y.size() ; i++) {
      |                     ~~^~~~~~~~~~
parks.cpp:36:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for(int i = 0 ; i < two.size() ; i++) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 97 ms 13316 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 40 ms 7316 KB Output is correct
12 Correct 11 ms 2308 KB Output is correct
13 Correct 18 ms 4476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 94 ms 13316 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 97 ms 13316 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 40 ms 7316 KB Output is correct
12 Correct 11 ms 2308 KB Output is correct
13 Correct 18 ms 4476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 94 ms 13316 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 244 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 293 ms 31036 KB Output is correct
24 Incorrect 1 ms 204 KB Pair u[7]=6 @(2, 183576) and v[7]=5 @(4, 183574) does not form a valid edge (distance != 2)
25 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 97 ms 13316 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 40 ms 7316 KB Output is correct
12 Correct 11 ms 2308 KB Output is correct
13 Correct 18 ms 4476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 94 ms 13316 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 244 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 293 ms 31036 KB Output is correct
24 Incorrect 1 ms 204 KB Pair u[7]=6 @(2, 183576) and v[7]=5 @(4, 183574) does not form a valid edge (distance != 2)
25 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 97 ms 13316 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 40 ms 7316 KB Output is correct
12 Correct 11 ms 2308 KB Output is correct
13 Correct 18 ms 4476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 94 ms 13316 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 97 ms 13316 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 40 ms 7316 KB Output is correct
12 Correct 11 ms 2308 KB Output is correct
13 Correct 18 ms 4476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 94 ms 13316 KB Output is correct
17 Incorrect 130 ms 16556 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 97 ms 13316 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 40 ms 7316 KB Output is correct
12 Correct 11 ms 2308 KB Output is correct
13 Correct 18 ms 4476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 94 ms 13316 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 244 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 293 ms 31036 KB Output is correct
24 Incorrect 1 ms 204 KB Pair u[7]=6 @(2, 183576) and v[7]=5 @(4, 183574) does not form a valid edge (distance != 2)
25 Halted 0 ms 0 KB -