結果
| 問題 |
No.2080 Simple Nim Query
|
| コンテスト | |
| ユーザー |
 cutmdo
|
| 提出日時 | 2022-09-25 22:06:52 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,542 bytes |
| コンパイル時間 | 11,577 ms |
| コンパイル使用メモリ | 297,896 KB |
| 最終ジャッジ日時 | 2025-02-07 15:30:08 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 3 WA * 5 |
ソースコード
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/Utils/debug.hpp"
#include "./CompetitiveProgrammingCpp/Utils/Timer.hpp"
#include "./CompetitiveProgrammingCpp/Utils/sample.hpp"
#else
#define dump(...)
template<class T>constexpr inline auto d_val(T a, T b) { return a; }
#endif
/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }
/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;
/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
/* Initial processing */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;
/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }
/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}
/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }
/* constant value */
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
//=============================================================================================
template<class ValType = long long, class SizeType = long long>
class SegmentMap {
const SizeType n;
std::map<SizeType, ValType> mp;
auto add(SizeType i, ValType val, bool left = true, bool right = true) {
auto it = std::prev(mp.upper_bound(i));
if(right && std::next(it)->second == val) { mp.erase(std::next(it)); }
if(left && it->second == val) { return; }
mp.emplace(i, val);
}
template <class Iterator>
auto remove(SizeType l, SizeType r, Iterator& it) {
auto nx = std::next(it)->first;
auto val = it->second;
auto ret = std::next(it);
if(l <= it->first) { ret = mp.erase(it); }
if(r < nx - 1) { add(r + 1, val, false, true); }
return ret;
}
auto remove(SizeType l, SizeType r) {
auto it = std::prev(mp.upper_bound(l));
while(it->first <= r) {
it = remove(l, r, it);
}
}
public:
SegmentMap(SizeType n) :n(n) {
mp.emplace(-1, -1);
mp.emplace(0, -2);
mp.emplace(n, -1);
}
auto output() const {
for(auto it = std::next(mp.begin()); it != std::prev(mp.end()); ++it) {
std::cout << "[" << it->first << ", " <<
std::next(it)->first - 1 << "] :" <<
it->second << std::endl;
}
}
auto update(SizeType l, SizeType r, ValType val) {
if(l < 0 || r >= n) { throw std::runtime_error(""); }
if(l > r) { throw std::runtime_error(""); }
remove(l, r);
add(l, val);
}
auto query(SizeType l, SizeType r) {
if(l < 0 || r >= n) { throw std::runtime_error(""); }
if(l > r) { throw std::runtime_error(""); }
auto it = std::prev(mp.upper_bound(l));
std::deque<std::pair<ValType, std::pair<SizeType, SizeType>>> dq;
while(it->first <= r) {
auto nx = std::next(it)->first;
auto nr = std::min(nx - 1, r);
auto nl = std::max(l, it->first);
dq.emplace_back(it->second, std::pair{nl,nr});
++it;
}
return dq;
}
auto get(SizeType i) {
auto it = std::prev(mp.upper_bound(i));
auto nx = std::next(it)->first;
auto nr = nx - 1;
auto nl = it->first;
return std::pair{it->second,std::pair{nl,nr}};
}
};
signed main() {
ll n, q;
cin >> n >> q;
VL a(n);
cin >> a;
auto segmap = SegmentMap(n);
REP(i, n) { segmap.update(i, i, (a[i] == 1) ? 1 : 0); }
REP(_, q) {
ll t, x, y;
cin >> t >> x >> y; --x;
if(t == 1) {
segmap.update(x, x, (y == 1) ? 1 : 0);
} else {
--y;
auto [c, range] = segmap.get(y);
auto [l, r] = range;
chmax(l, x); chmin(r, y);
auto len = r - l + 1;
cout << ((c == 1 && len & 1) ? "S" : "F") << endl;
}
}
}