oj.uz

Submission #874095

# Submission time Handle Problem Language Result Execution time Memory
874095 2023-11-16T09:10:26 Z YongXin Friend (IOI14_friend) C++14
11 / 100
 1000 ms 29116 KB 
#include <bits/stdc++.h>
using namespace std;
int N,Confidence[100000];
vector<int>adj[100000];
int dp(bool cant[],int i){
    if(i==N)return 0;
    if(cant[i])return dp(cant,i+1);
    bool choose[N];
    for(int j=0;j<N;++j)choose[j]=cant[j];
    for(int j=0;j<adj[i].size();++j)choose[adj[i][j]]=true;
    return max(dp(choose,i+1)+Confidence[i],dp(cant,i+1));
}
int findSample(int n,int confidence[],int host[],int protocol[]){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    N=n+1;
    for(int i=0;i<N;++i)Confidence[i]=confidence[i];
    for(int i=1;i<N;++i){
        if(protocol[i]!=1){
            adj[i].push_back(host[i]);
            adj[host[i]].push_back(i);
        }
        if(protocol[i]!=0)for(int j=0;j<adj[host[i]].size();++j){
            adj[i].push_back(adj[host[i]][j]);
            adj[adj[host[i]][j]].push_back(i);
        }
    }
    bool cant[N];
    memset(cant,0,N);
    return dp(cant,0);
}

Compilation message

friend.cpp: In function 'int dp(bool*, int)':
friend.cpp:10:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int j=0;j<adj[i].size();++j)choose[adj[i][j]]=true;
      |                 ~^~~~~~~~~~~~~~
friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:22:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         if(protocol[i]!=0)for(int j=0;j<adj[host[i]].size();++j){
      |                                       ~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2796 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2792 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2788 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1037 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 29116 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Execution timed out 1073 ms 3676 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Execution timed out 1098 ms 3676 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2792 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2792 KB Output is correct
12 Incorrect 21 ms 5036 KB Output isn't correct
13 Halted 0 ms 0 KB -