# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
798331 | 2023-07-30T15:34:46 Z | Khizri | 친구 (IOI14_friend) | C++17 | 1000 ms | 65536 KB |
#include "friend.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) const int mxn=1005; int n,arr[mxn],rel[mxn][mxn]; vector<int>vt[mxn]; int findSample(int N,int confidence[],int host[],int protocol[]){ n=N; for(int i=0;i<n;i++){ arr[i+1]=confidence[i]; } for(int i=1;i<n;i++){ int node=host[i]+1; int type=protocol[i]; if(type==0){ vt[node].pb(i+1); vt[i+1].pb(node); } else if(type==1){ int sz=vt[node].size(); for(int j=0;j<sz;j++){ int v=vt[node][j]; vt[v].pb(i+1); vt[i+1].pb(v); } } else{ int sz=vt[node].size(); for(int j=0;j<sz;j++){ int v=vt[node][j]; vt[v].pb(i+1); vt[i+1].pb(v); } vt[node].pb(i+1); vt[i+1].pb(node); } } for(int i=1;i<=n;i++){ for(int v:vt[i]){ rel[i][v]=1; } } int ans=0; for(int mask=1;mask<(1<<n);mask++){ vector<int>v; int sum=0; for(int i=0;i<n;i++){ if(mask&(1<<i)){ v.pb(i+1); sum+=arr[i+1]; } } bool ok=true; for(int i=0;i<v.size();i++){ for(int j=i+1;j<v.size();j++){ if(rel[v[i]][v[j]]){ ok=false; } } } if(ok) ans=max(ans,sum); } return ans; } // g++ friend.cpp grader.cpp ; .\a.exe /* 6 13 3 6 20 10 15 0 0 0 1 1 2 2 1 0 0 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 328 KB | Output is correct |
7 | Correct | 0 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 340 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 | 0 ms | 340 KB | Output is correct |
16 | Correct | 1 ms | 340 KB | Output is correct |
17 | Correct | 1 ms | 332 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1076 ms | 328 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 18 ms | 2900 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Incorrect | 4 ms | 4308 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 328 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 340 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 | 340 KB | Output is correct |
7 | Correct | 0 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Incorrect | 4 ms | 4308 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 0 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 0 ms | 340 KB | Output is correct |
11 | Correct | 0 ms | 340 KB | Output is correct |
12 | Runtime error | 110 ms | 65536 KB | Execution killed with signal 9 |
13 | Halted | 0 ms | 0 KB | - |