제출 #1183917

#제출 시각아이디문제언어결과실행 시간메모리
1183917lance0Friend (IOI14_friend)C++20
컴파일 에러
0 ms0 KiB
#include <dreaming.h> int findSample(int n, int confidence[], int host[], int protocol[]) { int dp[n][2] = {}; for (int i = 0; i < n; i++) { dp[i][0] = confidence[i]; } for (int i = n-1; i > 0; i--) { int j = host[i]; if (protocol[i] == 0) { dp[j][0] += dp[i][1]; // dont take invitee dp[j][1] += max(dp[i][0], dp[i][1]); // free to do anything with invitee } else if (protocol[i] == 1) { dp[j][0] += max(dp[i][0], dp[i][1]); // free to do anything with invitee dp[j][0] = max(dp[j][0], dp[j][1] + dp[i][0]); // as well as the case of taking host but not invitee (1 person case) dp[j][1] += dp[i][1]; //dont take either } else { dp[j][0] = max(dp[j][0] + dp[i][1], dp[i][0] + dp[j][1]); // taking one is fine dp[j][1] += dp[i][1]; // and so is taking none } return max(dp[0][0], dp[0][1]) //best is dependent on taking or not person 0, so just look at both. } }

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp:1:10: fatal error: dreaming.h: No such file or directory
    1 | #include <dreaming.h>
      |          ^~~~~~~~~~~~
compilation terminated.