제출 #621242

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
621242		moyindavid	분수 공원 (IOI21_parks)	C++17	0 / 100	959 ms	2097152 KiB

parks

#include <bits/stdc++.h>
#include "parks.h"
#define pb push_back

using namespace std;

vector<bool> vis(200100,false);int cnt=0;set<int> node[200100];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.pb(i);v.pb(j);

            if(x[i]==x[j]){
                b.pb((y[i]+y[j])/2);
                if(x[i]==2)a.pb(x[i]-1);
                else a.pb(x[i]+1);
            }
            else{
                a.pb((x[i]+x[j])/2);
                b.pb(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.count({x[i]-2,y[i]})>0){node[i].insert(n[{x[i]-2,y[i]}]);node[n[{x[i]-2,y[i]}]].insert(i);}
        if(m.count({x[i]+2,y[i]})>0){node[i].insert(n[{x[i]+2,y[i]}]);node[n[{x[i]+2,y[i]}]].insert(i);}
        if(m.count({x[i],y[i]-2})>0){node[i].insert(n[{x[i],y[i]-2}]);node[n[{x[i],y[i]-2}]].insert(i);}
        if(m.count({x[i],y[i]+2})>0){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;
}

컴파일 시 표준 에러 (stderr) 메시지

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~
parks.cpp:40:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~
parks.cpp:48:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     if(cnt==x.size()){
      |        ~~~^~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30