oj.uz

답안 #220754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
220754 2020-04-08T17:13:11 Z infinite_iq 친구 (IOI14_friend) C++14
11 / 100
 1000 ms 3960 KB 
    #define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
    #include <bits/stdc++.h>
    using namespace std;
    #define sqr 200
    #define mid (l+r)/2
    #define pb push_back
    #define ppb pop_back
    #define fi first
    #define se second
    #define lb lower_bound
    #define ub upper_bound
    #define ins insert
    #define era erase
    #define C continue
    #define mem(dp,i) memset(dp,i,sizeof(dp))
    #define mset multiset
    typedef long long ll;
    typedef short int si;
    typedef long double ld;
    typedef pair<int,int> pi;
    typedef pair<ll,ll> pll;
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pi> vpi;
    typedef vector<pll> vpll;
    const ll mod=1e9+7;
    const ll inf= 4e18;
    const ld pai=acos(-1);
    #include "friend.h"
    int adj[19][19];
    int check(vi v){
            for(int i=0;i<v.size();i++){
                    for(int j=i+1;j<v.size();j++){
                            int a=v[i];
                            int b=v[j];
                            if(adj[a][b])return 0;
                    }
            }
            return 1;
    }
    int findSample(int n,int confidence[],int host[],int protocol[]){
            for(int i=1;i<n;i++){
                    int t=protocol[i];
                    int j=host[i];
                    if(t==0){
                            adj[i][j]=adj[j][i]=1;
                            C;
                    }
                    for(int k=0;k<n;k++){
                            if(adj[j][k])adj[i][k]=adj[k][i]=1;
                    }
                    if(t==2)adj[i][j]=adj[j][i]=1;
            }
            int ans=0;
            for(int mask=0;mask<(1<<n);mask++){
                    vi ret;
                    int sum=0;
                    for(int i=0;i<n;i++){
                            if( (mask&(1<<i)) ) ret.pb(i) , sum+=confidence[i];
                    }
                    if(check(ret))ans=max(ans,sum);
            }
            return ans;
    }

Compilation message

friend.cpp: In function 'int check(vi)':
friend.cpp:32:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<v.size();i++){
                         ~^~~~~~~~~
friend.cpp:33:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for(int j=i+1;j<v.size();j++){
                                   ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1089 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Incorrect 7 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 7 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Runtime error 43 ms 3960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -