# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
787989 | 2023-07-19T15:52:18 Z | tolbi | 친구 (IOI14_friend) | C++17 | 1 ms | 468 KB |
#pragma optimize("Bismillahirrahmanirrahim") //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█■█ //█─█─█▄─█▄─█─█─█─█ //Allahuekber //ahmet23 orz... //FatihSultanMehmedHan //YavuzSultanSelimHan //AbdulhamidHan //Sani buyuk Osman Pasa Plevneden cikmam diyor #define author tolbi #include <bits/stdc++.h> using namespace std; template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;} template<typename X> ostream& operator<<(ostream& os, vector<X> v){for (auto &it : v) os<<it<<" ";return os;} template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> v){for (auto &it : v) os<<it<<" ";return os;} ostream& operator<<(ostream& os, bool bl){return os<<(int32_t)bl;} #define endl '\n' #define deci(x) int x;cin>>x; #define decstr(x) string x;cin>>x; #define cinarr(x) for(auto &it : x) cin>>it; #define coutarr(x) for(auto &it : x) cout<<it<<" ";cout<<endl; #define sortarr(x) sort(x.begin(), x.end()) #define sortrarr(x) sort(x.rbegin(), x.rend()) #define rev(x) reverse(x.begin(), x.end()) #define tol(bi) (1ll<<((int)(bi))) typedef long long ll; const ll INF = LONG_LONG_MAX; const ll MOD = 1e9+9; mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count()); #include "friend.h" int findSample(int n,int confidence[],int host[],int protocol[]){ bool subt2=true,subt3=true,subt4=true; for (int i = 1; i < n; ++i) { if (protocol[i]!=0) subt4=false; else if (protocol[i]!=1) subt2=false; else if (protocol[i]!=2) subt3=false; } if (subt4){ vector<vector<int>> arr(n); for (int i = 1; i < n; i++){ arr[i].push_back(host[i]); arr[host[i]].push_back(i); } vector<vector<ll>> dp(n,vector<ll>(2,-1)); auto dfs = [&](int node, int lnode, int flag, auto dfs)->ll{ if (dp[node][flag]!=-1) return dp[node][flag]; ll alirsam=confidence[node]; ll almazsam=0; for (int i = 0; i < arr[node].size(); i++){ if (arr[node][i]==lnode) continue; almazsam+=dfs(arr[node][i],node,0,dfs); alirsam+=dfs(arr[node][i],node,1,dfs); } if (flag) return dp[node][flag]=almazsam; return dp[node][flag]=max(alirsam,almazsam); }; return dfs(0,-1,0,dfs); } else if (subt3){ ll ans=0; for (int i = 0; i < n; ++i) { ans=max(ans,(ll)confidence[i]); } return ans; } else if (subt2){ ll ans = 0; for (int i = 0; i < n; ++i) { ans+=confidence[i]; } return ans; } vector<vector<int>> arr(n); for (int i = 1; i < n; ++i) { int j = host[i]; if (protocol[i]==0){ arr[i].push_back(j); arr[j].push_back(i); } else if (protocol[i]==1){ for (int k = 0; k < arr[j].size(); k++){ int ele = arr[j][k]; arr[i].push_back(ele); arr[ele].push_back(i); } } else { for (int k = 0; k < arr[j].size(); k++){ int ele = arr[j][k]; arr[i].push_back(ele); arr[ele].push_back(i); } arr[i].push_back(j); arr[j].push_back(i); } } vector<vector<bool>> vis(n,vector<bool>(n,false)); for (int i = 0; i < n; ++i) { for (int j = 0; j < arr[i].size(); j++){ vis[i][arr[i][j]]=true; } } ll ans = 0; for (int i = 0; i < tol(n); i++){ ll somma = 0; bool valid = true; for (int j = 0; j < n; j++){ if (tol(j)&i) continue; somma+=confidence[j]; for (int k = 0; k < n; k++){ if (tol(k)&i) continue; if (vis[j][k]){ valid=false; break; } } if (!valid) break; } if (valid) ans=max(ans,somma); } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 284 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Incorrect | 0 ms | 212 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 312 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 468 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
11 | Correct | 1 ms | 340 KB | Output is correct |
12 | Correct | 1 ms | 340 KB | Output is correct |
13 | Correct | 1 ms | 340 KB | Output is correct |
14 | Correct | 1 ms | 340 KB | Output is correct |
15 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |