oj.uz

Submission #232084

# Submission time Handle Problem Language Result Execution time Memory
232084 2020-05-16T02:18:16 Z anonymous Friend (IOI14_friend) C++14
27 / 100
 46 ms 4480 KB 
#include "friend.h"
#include <vector>
#include <iostream>
#define MAXN 1005
using namespace std;
// Find out best sample
vector <int> adj[MAXN];
int wt[MAXN], dp[MAXN][2];
int findSample(int n,int C[],int H[],int P[]){ //confidence, host, protocol
	bool SB1=n <= 12, SB2=true, SB3=true, SB4=true, SB5=true;
    for (int i=1; i<n; i++) {
        if (P[i] != 1) {SB2=false;} //myfriends
        if (P[i] != 2) {SB3 = false;} //ourfriends
        if (P[i] != 0) {SB4 = false;} //Ifriends
        if (P[i] == 2) {SB5 = false;}
    }
    for (int i=1; i<n; i++) {
        if (P[i] == 0) { //I am friend
            adj[i].push_back(H[i]);
            adj[H[i]].push_back(i);
            //printf("%d %d\n",i,H[i]);
        } else if (P[i] == 1) { //My friends
            for (int v: adj[H[i]]) {
                adj[i].push_back(v);
                adj[v].push_back(i);
                //printf("%d %d\n",v,i);
            }
        } else { //everything
            //printf("%d %d\n",i,H[i]);
            for (int v: adj[H[i]]) {
                adj[i].push_back(v);
                adj[v].push_back(i);
                //printf("%d %d\n",v,i);
            }
            adj[i].push_back(H[i]);
            adj[H[i]].push_back(i);
        }
    }
    if (SB1) {
        int ans = 0;
        for (int i=0; i<(1<<n); i++) {
            bool ok = true;
            for (int a=0; a<n; a++) {
                for (int b: adj[a]) {
                    if ((i&(1<<a)) && (i&(1<<b))) {
                        ok = false;
                    }
                }
            }
            if (ok) {
                int res = 0;
                for (int j=0; j<n; j++) {
                    if (i&(1<<j)) {res += C[j];}
                }
                ans = max(ans, res);
            }
        }
        return(ans);
    } else if (SB3) { //no edges with myfriends
        int mx = 0;
        for (int i=0; i<n; i++) {
            mx = max(mx, C[i]);
        }
        return(mx);
    } else if (SB2) { //everything connected
        int Sum = 0;
        for (int i=0; i<n; i++) {
            Sum += C[i];
        }
        return(Sum);
    } else if (SB4) {

    } else if (SB5) {

    }
}

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:76:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 4 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 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 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
8.0 / 8.0

# Verdict Execution time Memory 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 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 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 14 ms 4224 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 10 ms 3072 KB Output is correct
5 Correct 13 ms 4096 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 896 KB Output is correct
8 Correct 6 ms 1152 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 15 ms 4480 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 Incorrect 5 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 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 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Incorrect 5 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory 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 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 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 4 ms 384 KB Output is correct
12 Runtime error 46 ms 3832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -