Submission #2091303
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N; int X[15],Y[15],A[15]; double AS[1<<15],DS[1<<15],V[1<<15]; double D[15][15]; vector<int> C[1<<15]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; FOR(i,N) cin>>X[i]>>Y[i]>>A[i]; FOR(x,N) FOR(y,N) D[x][y]=hypot(X[x]-X[y],Y[x]-Y[y]); for(int mask=1;mask<1<<N;mask++) { FOR(i,N) if(mask&(1<<i)) { AS[mask]+=A[i]; C[mask].push_back(i); } if(__builtin_popcount(mask)==1) { V[mask]=AS[mask]; continue; } DS[mask]=1e10; for(int smask=(mask-1)&mask; smask>0; smask=(smask-1)&mask) { FORR(x,C[smask]) FORR(y,C[smask^mask]) { DS[mask]=min(DS[mask],DS[smask]+DS[mask^smask]+D[x][y]); } } V[mask]=(AS[mask]-DS[mask])/__builtin_popcount(mask); for(int smask=(mask-1)&mask; smask>0; smask=(smask-1)&mask) { V[mask]=max(V[mask],min(V[smask],V[mask^smask])); } } _P("%.12lf\n",V[(1<<N)-1]); } int main(int argc,char** argv){ string s;int i; if(argc==1) ios::sync_with_stdio(false), cin.tie(0); FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin); cout.tie(0); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Water Distribution |
User | kmjp |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1588 Byte |
Status | AC |
Exec Time | 613 ms |
Memory | 3712 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 612 ms | 3584 KB |
001.txt | AC | 609 ms | 3584 KB |
002.txt | AC | 607 ms | 3584 KB |
003.txt | AC | 608 ms | 3584 KB |
004.txt | AC | 610 ms | 3584 KB |
005.txt | AC | 607 ms | 3712 KB |
006.txt | AC | 611 ms | 3584 KB |
007.txt | AC | 608 ms | 3584 KB |
008.txt | AC | 610 ms | 3584 KB |
009.txt | AC | 611 ms | 3584 KB |
010.txt | AC | 610 ms | 3584 KB |
011.txt | AC | 611 ms | 3584 KB |
012.txt | AC | 610 ms | 3584 KB |
013.txt | AC | 608 ms | 3584 KB |
014.txt | AC | 611 ms | 3584 KB |
015.txt | AC | 613 ms | 3584 KB |
016.txt | AC | 607 ms | 3584 KB |
017.txt | AC | 611 ms | 3584 KB |
018.txt | AC | 609 ms | 3584 KB |
019.txt | AC | 607 ms | 3584 KB |
020.txt | AC | 604 ms | 3584 KB |
021.txt | AC | 607 ms | 3584 KB |
022.txt | AC | 605 ms | 3584 KB |
023.txt | AC | 603 ms | 3584 KB |
024.txt | AC | 603 ms | 3584 KB |
025.txt | AC | 603 ms | 3584 KB |
026.txt | AC | 605 ms | 3584 KB |
027.txt | AC | 604 ms | 3584 KB |
028.txt | AC | 603 ms | 3584 KB |
029.txt | AC | 604 ms | 3584 KB |
030.txt | AC | 602 ms | 3584 KB |
031.txt | AC | 603 ms | 3584 KB |
032.txt | AC | 602 ms | 3584 KB |
033.txt | AC | 603 ms | 3584 KB |
034.txt | AC | 601 ms | 3584 KB |
035.txt | AC | 601 ms | 3584 KB |
036.txt | AC | 603 ms | 3584 KB |
037.txt | AC | 602 ms | 3584 KB |
038.txt | AC | 603 ms | 3584 KB |
039.txt | AC | 602 ms | 3584 KB |
040.txt | AC | 2 ms | 1024 KB |
041.txt | AC | 2 ms | 1024 KB |
042.txt | AC | 2 ms | 1024 KB |
043.txt | AC | 2 ms | 1024 KB |
example0.txt | AC | 2 ms | 1024 KB |
example1.txt | AC | 606 ms | 3584 KB |