제출 #735731

#제출 시각아이디문제언어결과실행 시간메모리
735731myrcella친구 (IOI14_friend)C++17
0 / 100
1065 ms392 KiB
//by szh #include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pii pair<int,int> #define pll pair<long long,long long> #define pb push_back #define debug(x) cerr<<#x<<"="<<x<<endl #define pq priority_queue #define inf 0x3f #define rep(i,a,b) for (int i=a;i<(b);i++) #define MP make_pair #define SZ(x) (int(x.size())) #define ll long long #define mod 1000000007 #define ALL(x) x.begin(),x.end() void inc(int &a,int b) {a=(a+b)%mod;} void dec(int &a,int b) {a=(a-b+mod)%mod;} int lowbit(int x) {return x&(-x);} ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;} #include "friend.h" int fr[19][19]; // Find out best sample int findSample(int n,int confidence[],int host[],int protocol[]){ int ans=0; rep(i,1,n) { if (protocol[i]==0) fr[i][host[i]] = 1; else { rep(j,0,i) if (fr[j][host[i]]) fr[i][j] = 1; if (protocol[i]==2) fr[i][host[i]] = 1; } } rep(i,0,(1<<n)) { bool ok = true; rep(j,0,n) rep(k,0,n) if (((i>>j)&1) and ((i>>k)&1) and fr[j][k]) ok = false; if (ok) { int tmp = 0; rep(k,0,n) if ((i>>k)&1) tmp += confidence[k]; ans = max(ans,tmp); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...