제출 #1053878

#제출 시각아이디문제언어결과실행 시간메모리
1053878VMaksimoski008케이크 (CEOI14_cake)C++17
15 / 100
2074 ms4568 KiB
#include <bits/stdc++.h> //#define int long long using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 3e5 + 5; struct SegTree { }; signed main() { ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0); int n, s, q; cin >> n >> s; int id = n + 1; vector<ll> v(n+1), v2; for(int i=1; i<=n; i++) cin >> v[i]; for(int i=1; i<=n; i++) v2.push_back(i); sort(v2.begin(), v2.end(), [&](int a, int b) { return v[a] > v[b]; }); while(v2.size() > 10) v2.pop_back(); for(int i=0; i<v2.size(); i++) v[v2[i]] = 1e6 - i; cin >> q; while(q--) { char t; cin >> t; if(t == 'F') { int p; cin >> p; if(p == s) { cout << 0 << '\n'; continue; } int l=s, r=s, ans=0; while(l != p && r != p) { ans++; if(l - 1 == 0) r++; else if(r + 1 > n) l--; else if(v[l-1] < v[r+1]) l--; else r++; } cout << ans << '\n'; } else { int a, b; cin >> a >> b; vector<ll> v3; for(int i=0; i<v2.size(); i++) if(a != v2[i]) v3.push_back(v2[i]); v2 = v3; v2.insert(v2.begin() + b - 1, a); if(v2.size() == 1) { v[v2.back()] = id++; v2.pop_back(); } for(int i=0; i<v2.size(); i++) v[v2[i]] = 1e6 - i; } } return 0; }

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

cake.cpp: In function 'int main()':
cake.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i=0; i<v2.size(); i++) v[v2[i]] = 1e6 - i;
      |                  ~^~~~~~~~~~
cake.cpp:65:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |             for(int i=0; i<v2.size(); i++)
      |                          ~^~~~~~~~~~
cake.cpp:76:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |             for(int i=0; i<v2.size(); i++) v[v2[i]] = 1e6 - i;
      |                          ~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...