제출 #1040629

#제출 시각아이디문제언어결과실행 시간메모리
1040629Ausp3x친구 (IOI14_friend)C++17
11 / 100
100 ms65536 KiB
// 人外有人,天外有天 // author: Ausp3x #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include "friend.h" using namespace std; using namespace __gnu_pbds; #define fi first #define se second #define pb push_back // #define DEBUG typedef long long lng; int const INF32 = 0x3f3f3f3f; lng const INF64 = 0x3f3f3f3f3f3f3f3f; int findSample(int n, int confidence[], int host[], int protocol[]) { vector<vector<int>> adjl(n); for (int i = 1; i < n; i++) { switch (protocol[i]) { case 0: // IAmYourFriend adjl[host[i]].pb(i); adjl[i].pb(host[i]); break; case 1: // MyFriendsAreYourFriends for (int j : adjl[host[i]]) { adjl[j].pb(i); adjl[i].pb(j); } break; case 2: // WeAreYourFriends for (int j : adjl[host[i]]) { adjl[j].pb(i); adjl[i].pb(j); } adjl[host[i]].pb(i); adjl[i].pb(host[i]); break; default: return -1; } } if (n <= 10) { lng ans = 0; for (int msk = 0; msk < (1 << n); msk++) { vector<bool> vst(n); for (int i = 0; i < n; i++) vst[i] = msk & (1 << i); lng cur = 0; for (int i = 0; i < n; i++) { if (!vst[i]) continue; cur += confidence[i]; for (int j : adjl[i]) if (vst[j]) goto exit; } ans = max(ans, cur); exit:; } return ans; } bool isAll0 = true, isAll1 = true, isAll2 = true; for (int i = 1; i < n; i++) { isAll0 &= protocol[i] == 0; isAll1 &= protocol[i] == 1; isAll2 &= protocol[i] == 2; } if (isAll1) { lng ans = 0; for (int i = 1; i < n; i++) ans = max<lng>(ans, confidence[i]); return ans; } return -1; } #ifdef DEBUG int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin >> t; while (t--) { solve(); } return 0; } #endif

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

friend.cpp:4:55: warning: bad option '-f O2' to pragma 'optimize' [-Wpragmas]
    4 | #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
      |                                                       ^
friend.cpp:4:55: warning: bad option '-f O3' to pragma 'optimize' [-Wpragmas]
friend.cpp:4:55: warning: bad option '-f Ofast' to pragma 'optimize' [-Wpragmas]
friend.cpp:4:55: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
In file included from friend.cpp:7:
friend.h:7:64: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
    7 | int findSample(int n,int confidence[],int host[],int protocol[]);
      |                                                                ^
friend.h:7:64: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
friend.h:7:64: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
friend.h:7:64: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
friend.h:7:64: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
friend.h:7:64: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
friend.h:7:64: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
friend.h:7:64: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
friend.cpp:20:67: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
   20 | int findSample(int n, int confidence[], int host[], int protocol[]) {
      |                                                                   ^
friend.cpp:20:67: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
friend.cpp:20:67: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
friend.cpp:20:67: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...