제출 #746345

#제출 시각아이디문제언어결과실행 시간메모리
746345dooweyBrperm (RMI20_brperm)C++17
13 / 100
3057 ms1976 KiB
#include <bits/stdc++.h> #include "brperm.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; #define fi first #define se second #define mp make_pair vector<char> S; void init(int n, const char s[]) { for(int i = 0 ; i < n; i ++ ){ S.push_back(s[i]); } } int query(int i, int k) { int sz = (1 << k); if(i + sz - 1 >= S.size()) return 0; vector<char> A(sz), B(sz); for(int j = 0 ; j < sz; j ++ ){ A[j] = S[i + j]; int f = 0; for(int p = 0; p < k ; p ++ ){ if((j & (1 << p))){ f |= (1 << (k - p - 1)); } } B[f] = S[i + j]; } return (A == B); }

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

brperm.cpp: In function 'int query(int, int)':
brperm.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     if(i + sz - 1 >= S.size()) return 0;
      |        ~~~~~~~~~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...