oj.uz

답안 #621185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
621185 2022-08-03T13:45:32 Z moyindavid 분수 공원 (IOI21_parks) C++17
0 / 100
 1105 ms 2097152 KB 
#include <bits/stdc++.h>
#include "parks.h"

using namespace std;

vector<bool> vis(200000,false);int cnt=0;set<int> node[200000];vector<int> u,v,a,b;
void dsf(int i, vector<int> x, vector<int> y){
    vis[i]=true;
    cnt++;
    for(auto j: node[i]){
        if(!vis[j]){
            u.push_back(i);v.push_back(j);

            if(x[i]==x[j]){
                b.push_back((y[i]+y[j])/2);
                if(x[i]==2)a.push_back(x[i]-1);
                else a.push_back(x[i]+1);
            }
            else{
                a.push_back((x[i]+x[j])/2);
                b.push_back(y[i]-1);
            }
            dsf(j,x,y);
        }
    }
}

int construct_roads(vector<int> x, vector<int> y){


    map<pair<int,int>,bool> m;
    map<pair<int,int>,int> n;

    for(int i=0;i<x.size();i++){
        m[{x[i],y[i]}]=1;
        n[{x[i],y[i]}]=i;
    }

    for(int i=0;i<x.size();i++){
        if(m[{x[i]-2,y[i]}]){node[i].insert(n[{x[i]-2,y[i]}]);node[n[{x[i]-2,y[i]}]].insert(i);}
        if(m[{x[i]+2,y[i]}]){node[i].insert(n[{x[i]+2,y[i]}]);node[n[{x[i]+2,y[i]}]].insert(i);}
        if(m[{x[i],y[i]-2}]){node[i].insert(n[{x[i],y[i]-2}]);node[n[{x[i],y[i]-2}]].insert(i);}
        if(m[{x[i],y[i]+2}]){node[i].insert(n[{x[i],y[i]+2}]);node[n[{x[i],y[i]+2}]].insert(i);}
    }

    dsf(0,x,y);
    if(cnt==x.size()){
        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:34:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~
parks.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~
parks.cpp:47:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     if(cnt==x.size()){
      |        ~~~^~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 6 ms 9716 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 7 ms 9716 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9712 KB Output is correct
9 Runtime error 1105 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 6 ms 9716 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 7 ms 9716 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9712 KB Output is correct
9 Runtime error 1105 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 6 ms 9716 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 7 ms 9716 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9712 KB Output is correct
9 Runtime error 1105 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 6 ms 9716 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 7 ms 9716 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9712 KB Output is correct
9 Runtime error 1105 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 6 ms 9716 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 7 ms 9716 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9712 KB Output is correct
9 Runtime error 1105 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 6 ms 9716 KB Output is correct
5 Correct 6 ms 9716 KB Output is correct
6 Correct 7 ms 9716 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9712 KB Output is correct
9 Runtime error 1105 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -