oj.uz

Submission #199033

# Submission time Handle Problem Language Result Execution time Memory
199033 2020-01-28T17:21:05 Z brcode Drzava (COCI15_drzava) C++14
160 / 160
 979 ms 53216 KB 
#include <iostream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e4+5;
const long double eps = 0.000001;
bool visited[MAXN];
//long long test;
int n,k;
pair<pair<long long,long long>,long long> p[MAXN];
struct cmpf{
    inline bool operator()(const long long& i, const long long& j)const{
        if(p[i].first.second!=p[j].first.second){
             return p[i].first.second<p[j].first.second;
        }
         return i>j;
    }
};
set<int,cmpf> s1;
vector<int> v1[MAXN];
vector<int> tempv;
bool dp[MAXN][40];
bool dist(long long i,long long j,long double x){
    return (long double)((p[i].first.first-p[j].first.first)*(p[i].first.first-p[j].first.first))+((p[i].first.second-p[j].first.second)*(p[i].first.second-p[j].first.second))<=(long double)x*x;
}
void dfs(int curr){
    tempv.push_back(curr);
    visited[curr] = true;
    for(int x:v1[curr]){
        if(!visited[x]){
            dfs(x);
        }
    }
}
int checkmod(int x){
    if(x<k){
        return x;
    }
    return x-k;
}
bool findsubset(){
    int m = tempv.size();
    m--;
    if(m>k){
        return true;
    }
    
    for(int i=0;i<=m+1;i++){
        for(int j=0;j<=k+1;j++){
            dp[i][j] = false;
        }
    }
    for(int mod = 0;mod<k;mod++){
        dp[m+1][mod] = !mod;
    }
    for(int i=m;i>=1;i--){
        for(int mod = 0;mod<k;mod++){
            
                dp[i][mod] = dp[i+1][mod];
            
            
            if(dp[i+1][(checkmod(mod+p[tempv[i]].second))]){
                dp[i][mod] = true;
               
            }
        }
        if(dp[i+1][p[tempv[i]].second]){
            
            return true;
        }
    }
    return false;
    
    
}
bool check(long double x){
    for(int i=1;i<=n;i++){
        v1[i].clear();
        visited[i] = false;
    }
    s1.clear();
    int j = 1;
    for(int i=1;i<=n;i++){
   
        while((long double)(p[i].first.first-p[j].first.first)>x){
            
            
            s1.erase(j);
            j++;
        }
        
        
        if(!s1.empty()){
            int cnt = 0;
            p[n+1] = make_pair(make_pair(p[i].first.first,(long long)(p[i].first.second-(long long)x)),0);
            
            for(auto it = s1.lower_bound(n+1);it!=s1.end();it++){
                int idx = *it;
              
                if(p[idx].first.second>p[i].first.second+x){
                    break;
                }
                cnt++;
                if(cnt>=8*k){
                    return true;
                    
                }
                if(dist(i,idx,x)){
                    
                    v1[i].push_back(idx);
                    v1[idx].push_back(i);
                }
            }
        }
        s1.insert(i);
    }
    
    for(int i=1;i<=n;i++){
        if(!visited[i]){
            tempv.clear();
            tempv.push_back(-1);
            dfs(i);
           
            if(findsubset()){
                return true;
            }
            
        }
    }
   
    return false;
}
int main() {
     ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>p[i].first.first>>p[i].first.second>>p[i].second;
        p[i].second%=k;
    }
    sort(p+1,p+n+1);
    long double l = 0;
    long double r = 1e8;
    long double ans = -1;
    while(r-l>eps){
        long double mid = (l+r)/2;
        
        if(check(mid)){
            
            ans = mid;
            r = mid-eps;
        }else{
            l = mid+eps;
        }
       
    }
   
  //  cout<<check(11163410)<<endl;
    if(ans == -1){
        printf("No solution!\n");
    }else{
        
        printf("%.3lf",(double)ans);
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 6 ms 1532 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 6 ms 1528 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1528 KB Output is correct
2 Correct 22 ms 2168 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 16 ms 1912 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 22 ms 2040 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 27 ms 2168 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1528 KB Output is correct
2 Correct 22 ms 2040 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1528 KB Output is correct
2 Correct 17 ms 1912 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 162 ms 5624 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 914 ms 50288 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 979 ms 48620 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 779 ms 45176 KB Output is correct

Subtask #13
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 910 ms 53216 KB Output is correct

Subtask #14
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 854 ms 53204 KB Output is correct

Subtask #15
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 489 ms 10740 KB Output is correct

Subtask #16
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 506 ms 11000 KB Output is correct

Subtask #17
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 502 ms 15584 KB Output is correct

Subtask #18
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 554 ms 15764 KB Output is correct

Subtask #19
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1532 KB Output is correct
2 Correct 479 ms 10356 KB Output is correct

Subtask #20
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1528 KB Output is correct
2 Correct 508 ms 14712 KB Output is correct