제출 #447207

#제출 시각아이디문제언어결과실행 시간메모리
447207hhhhauraInside information (BOI21_servers)C++14
2.50 / 100
249 ms524292 KiB
#define wiwihorz #include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma loop-opt(on) #define rep(i, a, b) for(int i = a; i <= b; i ++) #define rrep(i, a, b) for(int i = b; i >= a; i --) #define ceil(a, b) ((a + b - 1) / (b)) #define all(x) x.begin(), x.end() #define INF 1000000000000000000 #define MOD 1000000007 #define eps (1e-9) using namespace std; #define lld long double #define pii pair<int, int> #define random mt19938 rnd(chrono::steady_clock::now().time_since_epoch().count()) #ifdef wiwihorz #define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a) void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;} void kout() { cerr << endl; } template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); } #else #define print(...) 0 #define vprint(...) 0 #endif namespace solver { int n; const int P = 120000; vector<bitset<P>> a; void init_(int _n) { n = _n; a.assign(n, bitset<P>()); rep(i, 0, n - 1) a[i][i] = 1; } void S(int x, int y) { x--, y--; a[x] = a[x] | a[y]; a[y] = a[x]; } int Q(int x, int y) { return a[x - 1][y - 1]; } int C(int x) { return 0; } }; using namespace solver; signed main() { ios::sync_with_stdio(false), cin.tie(0); int n, k; cin >> n >> k; init_(n); rep(i, 1, k + n - 1) { char op; cin >> op; if(op == 'S') { int x, y; cin >> x >> y; S(x, y); } else if(op == 'Q') { int x, y; cin >> x >> y; if(Q(x, y)) cout << "yes\n"; else cout << "no\n"; } else { int x; cin >> x; cout << C(x) << "\n"; } } return 0; }

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

servers.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
servers.cpp:23:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
servers.cpp:23:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~
#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...
#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...