Submission #602379

#	Time	Username	Problem	Language	Result	Execution time	Memory
602379		rrrr10000	분수 공원 (IOI21_parks)	C++17	5 / 100	374 ms	46880 KiB

parks

#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<P> vp;
typedef vector<vp> vvp;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define fi first
#define se second
#define pb emplace_back
#define all(a) a.begin(),a.end()
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<endl;}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<endl;}
vi dx={2,0,-2,0},dy={0,2,0,-2};
int construct_roads(std::vector<int> X, std::vector<int> Y) {
    if (X.size() == 1) {
	    build({}, {}, {}, {});
        return 1;
    }
    ll n=X.size();
    map<P,ll> mp;
    rep(i,n)mp[P(X[i],Y[i])]=i;
    vp edge;
    rep(i,n)rep(j,2){
        ll nx=X[i]+dx[j],ny=Y[i]+dy[j];
        if(mp.count(P(nx,ny)))edge.pb(i,mp[P(nx,ny)]);
    }
    {
        vvi g(n);
        for(auto x:edge){
            g[x.fi].pb(x.se);
            g[x.se].pb(x.fi);
        }
        queue<ll> que;
        vb done(n,false);
        done[0]=true;
        que.push(0);
        while(!que.empty()){
            ll t=que.front();que.pop();
            for(ll x:g[t])if(!done[x]){
                done[x]=true;que.push(x);
            }
        }
        rep(i,n)if(!done[i])return 0;
    }
    vector<int> u, v, a, b;
    bool small=true;
    rep(i,n)if(X[i]>6)small=false;
    if(small){
        for(auto x:edge){
            if(X[x.fi]==X[x.se]){
                ll t=X[x.fi];
                if(t==2||t==6){
                    u.pb(x.fi);v.pb(x.se);
                    if(t==2)a.pb(1);
                    else a.pb(7);
                    b.pb((Y[x.fi]+Y[x.se])/2);
                }
                else{
                    if(mp.count(P(t-1,Y[x.fi]))&&mp.count(P(t-1,Y[x.se])))continue;
                    if(mp.count(P(t+1,Y[x.fi]))&&mp.count(P(t+1,Y[x.se])))continue;
                    u.pb(x.fi);v.pb(x.se);
                    a.pb(3);b.pb((Y[x.fi]+Y[x.se])/2);
                }
            }
            else{
                u.pb(x.fi);v.pb(x.se);
                a.pb((X[x.fi]+X[x.se])/2);
                b.pb(Y[x.fi]-1);
            }
        }
        build(u, v, a, b);
        return 1;
    }
}

Compilation message (stderr)

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:29:15: warning: control reaches end of non-void function [-Wreturn-type]
   29 |     map<P,ll> mp;
      |               ^~

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