제출 #1056657

#제출 시각아이디문제언어결과실행 시간메모리
1056657mychecksedad송신탑 (IOI22_towers)C++17
0 / 100
417 ms2516 KiB
#include "towers.h" #include<bits/stdc++.h> using namespace std; #define pb push_back #define all(x) x.begin(),x.end() #define ll long long int #define en cout << '\n' #define pi pair<int,int> #define vi vector<int> #define ff first #define ss second void op(vector<int> &a, vector<int> &A, vector<int> &B){ if(a.size() <= 1){ A = a; B.pb(0); return; } A.pb(a[0]); A.pb(a[1]); B.pb(0); B.pb(1); for(int i = 2; i < a.size(); ++i){ if(a[i] > A.back() && A.back() > A[int(A.size()) - 2]){ A.pop_back(); B.pop_back(); A.pb(a[i]); B.pb(i); }else if(a[i] < A.back() && A.back() < A[int(A.size()) - 2]){ A.pop_back(); B.pop_back(); A.pb(a[i]); B.pb(i); }else{ A.pb(a[i]); B.pb(i); } } } int n; vector<int> A, B, A2, A1, B1, B2, a; void init(int nn, std::vector<int> aa) { n=nn;a=aa; if(n == 1) return; op(a, A, B); vector<int> x, y; for(int i = 0; i < A.size(); i += 2){ x.pb(A[i]); } for(int i = 1; i < A.size(); i += 2){ y.pb(A[i]); } // op(y, A2, B2); // op(x, A1, B1); } int max_towers(int L, int R, int D) { if(n == 1) return 1; int l = L, r = R; L = lower_bound(all(B), L) - B.begin(); R = upper_bound(all(B), R) - B.begin(); --R; // cout << "f"; if(R < L) return min(r-l+1, 2); if(L == R) return min(r-l+1, 2); int add = (a[B[L]] > a[B[L + 1]] && l<L && a[l] < A[B[L]]) + (a[B[R]] > a[B[R - 1]] && r>R && a[r] < A[B[R]]); return max(min(2,r-l+1), (R-L+2)/2); }

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

towers.cpp: In function 'void op(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
towers.cpp:24:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for(int i = 2; i < a.size(); ++i){
      |                  ~~^~~~~~~~~~
towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:48:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int i = 0; i < A.size(); i += 2){
      |                  ~~^~~~~~~~~~
towers.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for(int i = 1; i < A.size(); i += 2){
      |                  ~~^~~~~~~~~~
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:66:7: warning: unused variable 'add' [-Wunused-variable]
   66 |   int add = (a[B[L]] > a[B[L + 1]] && l<L && a[l] < A[B[L]]) + (a[B[R]] > a[B[R - 1]] && r>R && a[r] < A[B[R]]);
      |       ^~~
#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...