QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#878735 | #9695. Trash Problem | ucup-team5243# | Compile Error | / | / | C++23 | 3.0kb | 2025-02-01 17:13:28 | 2025-02-01 17:13:29 |
Judging History
This is the latest submission verdict.
- [2025-02-01 17:13:29]
- Judged
- Verdict: Compile Error
- Time: 0ms
- Memory: 0kb
- [2025-02-01 17:13:28]
- Submitted
answer
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <bitset>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;
const int Z = 300;
using Bitset = bitset<Z+1>;
Bitset S0[301];
Bitset S1[301];
Bitset S[301];
Bitset X[301];
Bitset F[301];
Bitset XS[301];
Bitset D[301];
Bitset Lmask[301];
void testcase(){
int N; cin >> N;
vector<string> A(N); rep(i,N) cin >> A[i];
for(int i=N-1; i>=0; i--){
int c = 0;
for(int j=N-1; j>=0; j--){
if(A[i][j] == '1') c ^= 1;
if(c) S0[i].set(j);
}
S0[i] ^= S0[i+1];
S1[i] = ~S0[i];
}
rep(i,N) rep(j,N) if(A[i][j] == '0'){
rep(f,2) rep(s,2) X[i+f].set(j+s);
}
rep(i,Z) rep(j,i) Lmask[i].set(j);
//rep(i,N){ cout << S0[i] << endl; } cout << endl;
//rep(i,N){ cout << S1[i] << endl; } cout << endl;
//rep(i,N){ cout << X[i] << endl; } cout << endl;
i64 ans = 0;
for(int ry=1; ry<=N; ry++){
for(int rx=1; rx<=N; rx++){
//cout << "ry = " << ry << " , rx = " << rx << endl;
rep(y,ry){
int f = (S0[y].test(rx) ? 1 : 0) ^ (S0[ry].test(rx) ? 1 : 0);
if(f) S[y] = S1[y]; else S[y] = S0[y];
S[y] ^= S0[ry];
}
rep(y,ry) S[y] &= Lmask[rx];
S[ry] = Bitset();
rep(y,ry) F[y] = (S[y] >> 1) | S[y+1] | (S[y+1] >> 1);
rep(y,ry) XS[y] = X[y] | F[y];
rep(y,ry) XS[y] &= S[y];
for(int y=ry-2; y>=0; y--) XS[y] |= XS[y+1];
for(int y=ry-1; y>=0; y--) D[y] = D[y+1] | S[y];
int border = rx;
int c = 0;
for(int ly=0; ly<ry; ly++){
Bitset d = S[ly] | (S[ry] << 1);
d.set(rx, false);
for(int x=1; x<=256; x*=2) d |= d >> x;
while(border > 0 && !XS[ly].test(border)) border--;
int xborder = max(border, int(d.count()));
//cout << "xborder = " << xborder << endl;
c += (rx - xborder) - (D[ly] & ~Lmask[xborder]).count();
}
//rep(i,ry){ rep(j,rx){ cout << F[i].test(j); } cout << endl; }
//cout << endl;
//rep(i,ry){ rep(j,rx){ cout << XS[i].test(j); } cout << endl; }
//cout << endl;
//cout << "c = " << c << endl;
ans += c;
}
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false); cin.tie(nullptr);
testcase();
return 0;
}
詳細信息
In file included from /usr/include/c++/14/string:43, from /usr/include/c++/14/bits/locale_classes.h:40, from /usr/include/c++/14/bits/ios_base.h:41, from /usr/include/c++/14/ios:44, from /usr/include/c++/14/ostream:40, from /usr/include/c++/14/iostream:41, from answer.code:10: /usr/include/c++/14/bits/allocator.h: In destructor ‘constexpr std::__cxx11::basic_string<char>::_Alloc_hider::~_Alloc_hider()’: /usr/include/c++/14/bits/allocator.h:182:7: error: inlining failed in call to ‘always_inline’ ‘constexpr std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = char]’: target specific option mismatch 182 | ~allocator() _GLIBCXX_NOTHROW { } | ^ In file included from /usr/include/c++/14/string:54: /usr/include/c++/14/bits/basic_string.h:186:14: note: called from here 186 | struct _Alloc_hider : allocator_type // TODO check __is_final | ^~~~~~~~~~~~