Submission #99385

#	Time	Username	Problem	Language	Result	Execution time	Memory
99385		dantoh000	Park (BOI16_park)	C++14	0 / 100	506 ms	50056 KiB

park

#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
vector<iii> a;
int n,m,w,h;
vi p,rk;
void init(int n){
    for (int i = 0; i < n; i++){
        p.push_back(i);
        rk.push_back(0);
    }
}
int findset(int x){
    return x == p[x] ? x : p[x] = findset(p[x]);
}
bool sameset(int x, int y){
    return findset(x) == findset(y);
}
void unionset(int i, int j){
    int x = findset(i);
    int y=  findset(j);
    if (x == y) return;
    if (rk[x] < rk[y]){
        p[x] =y;
    }
    else{
        p[y] = x;
        if (rk[x] == rk[y]) rk[x]++;
    }
}
int sqrt(int x){
    return (int)(pow(x,0.5));
}
int dist(int i, int j){
    int r = a[i].first, x = a[i].second.first, y = a[i].second.second;
    if (j >= n){
        if (j == n) return x-r;
        if (j == n+1) return y-r;
        if (j == n+2) return w-x-r;
        if (j == n+3) return h-y-r;
    }
    else{
        int r1 = a[j].first, x1 = a[j].second.first, y1 = a[j].second.second;
        return sqrt((x1-x)*(x1-x)+(y1-y)*(y1-y)) - r1-r;
    }
}
main(){
    scanf("%lld%lld%lld%lld",&n,&m,&w,&h);
    for (int i = 0; i < n; i++){
        int x,y,z;
        scanf("%lld%lld%lld",&x,&y,&z);
        a.push_back(iii(z,ii(x,y)));
    }
    vector<iii> edgelist;
    vector<iii> qu;
    for (int i = 0; i < m; i++){
        int x,y;
        scanf("%lld%lld",&x,&y);
        qu.push_back(iii(x*2,ii(y-1,i)));
    }
    sort(qu.begin(),qu.end());
    string ans[m];
    for (int i = 0; i < n; i++){
        for (int j = i+1; j < n+4; j++){
            //printf("dist from %lld %lld = %lld\n",i,j,dist(i,j));
            edgelist.push_back(iii(dist(i,j),ii(i,j)));
        }
    }
    sort(edgelist.begin(),edgelist.end());
    init(n+4);
    int ce, cv;
    bool b[4];
    b[0] = b[1] = b[2] = b[3] = true;
    ce = cv = 0;
    while (cv < m){
        iii v = qu[cv];
        int r = v.first, e = v.second.first, id = v.second.second;
        //printf("at %lld %lld %lld\n",r,e,id);
        while (ce < edgelist.size() && edgelist[ce].first < r){
            //printf("unioning set %lld %lld %lld\n",edgelist[ce].first, edgelist[ce].second.first, edgelist[ce].second.second);
            unionset(edgelist[ce].second.first, edgelist[ce].second.second);
            ce++;
        }
        for (int i = 0; i < 4; i++){
            b[i] &= !sameset(n+i,n+(i+1)%4);
            //printf("at size %lld, b[%lld] = %d\n",r,i,b[i]);
        }
        ans[id] = "";
        for (int i = 0; i < 4; i++){
            if (e == i || (b[e] && b[i])) ans[id] += (char)(i)+'1';
        }
        ans[id] += '\n';
        cv++;
    }
    for (int i = 0; i < m; i++){
        cout << ans[i];
    }
}

Compilation message (stderr)

park.cpp:50:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
park.cpp: In function 'int main()':
park.cpp:82:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (ce < edgelist.size() && edgelist[ce].first < r){
                ~~~^~~~~~~~~~~~~~~~~
park.cpp: In function 'long long int dist(long long int, long long int)':
park.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
park.cpp: In function 'int main()':
park.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld%lld",&n,&m,&w,&h);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
park.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&x,&y,&z);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
park.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&x,&y);
         ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 27
• Subtask 2: 0 / 31
• Subtask 3: 0 / 42