oj.uz

답안 #286723

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
286723 2020-08-30T19:44:38 Z ACmachine 가로등 (APIO19_street_lamps) C++17
40 / 100
 790 ms 26920 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 

const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

class segtree{
    public:
    vi tree;
    vi lchild; vi rchild; 
    int n;
    void create_node(int val){
        tree.pb(val); lchild.pb(-1); rchild.pb(-1);
    }
    void push(int v){
        if(rchild[v] == -1){
            create_node(-INF); rchild[v] = tree.size()-1;
        }
        if(lchild[v] == -1){
            create_node(-INF); lchild[v] = tree.size()-1;
        }
    }
    segtree(int sz){
        n = 1; while(n < sz) n*=2; 
        create_node(-INF);
    }
    void update(int pos, int val, int b, int e, int v = 1) { 
        if(v == 1) b = 0, e = n;
        if(b + 1 == e && b == pos) tree[v] = val;
        push(v);
        int mid = (b + e) / 2;
        if(pos < mid) update(pos, val, b, mid, lchild[v]);
        else update(pos, val, mid, e, rchild[v]);
        tree[v] = max(tree[lchild[v]], tree[rchild[v]]);
    }
    int query(int l, int r, int b, int e, int v = 1){
        if(v == 1) b = 0, e = n;
        if(b >= r || e <= l) return -INF;
        if(b >= l && e <= r) return tree[v];
        push(v);
        int mid = (b + e) / 2;
        return max(query(l, r, b, mid, lchild[v]), query(l, r, mid, e, rchild[v])); 
    }
};
struct AcAutomaton{
    vector<tuple<string, int, int>> queries;
    int n, q;
    string s;
	void read_in(){
		cin >> n >> q;
        cin >> s;
        REP(j, q){
            string type; cin >> type;
            if(type == "toggle"){
                int a; cin >> a; --a;
                queries.pb(make_tuple(type, a, 0));
            }
            else{
                int a, b; cin >> a >> b; --a; --b;
                queries.pb(make_tuple(type, a, b));
            }
        }
	}
    void solve_subtask1(){
        vector<string> strings;
        strings.pb(s);
        REP(j, q){
            tuple<string, int, int> query = queries[j];
            if(get<0>(query) == "toggle"){
                int id = get<1>(query);
                if(s[id] == '1') s[id] = '0';
                else s[id] = '1';
            }
            else{
                int ans = 0;
                int l = get<1>(query);
                int r = get<2>(query);
                REP(i, strings.size()){
                    string tmp = strings[i];
                    bool can = true;
                    FOR(j, l, r, 1){
                        if(tmp[j] == '0') can = false;
                    }
                    if(can) ans++;
                }
                cout << ans << endl;
            }
            strings.pb(s);
        }
    }
    void solve_subtask2(){
        vi prev(n, INF);
        vi cnt(n, 0);
        REP(i, s.length())
            if(s[i] == '1') prev[i] = -1;
        REP(j, q){
            tuple<string, int, int> query = queries[j];
            if(get<0>(query) == "toggle"){
                int id = get<1>(query);
                if(s[id] == '1'){
                    cnt[id] += (j - prev[id]);
                    prev[id] = INF;
                    s[id] = '0';
                }
                else{
                    prev[id] = j;
                    s[id] = '1';
                }
            }
            else{
                int id = get<1>(query);
                int ans = 0;
                if(s[id] == '1') {
                    ans += j - prev[id];
                }
                ans += cnt[id];
                cout << ans << endl;
            }
        }
    }
	void solve(){
        if(n <= 100 && q <= 100) solve_subtask1();
        else{
            bool sub2 = true;
            REP(i, q) if(get<0>(queries[i]) == "query" && get<1>(queries[i]) + 1 != get<2>(queries[i])) sub2 = false;
            if(sub2) solve_subtask2();
        }
	}
};
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int tcase = 1;
	while(tcase--){
		AcAutomaton solver;
		solver.read_in();
		solver.solve();
	}
    return 0;
}

Compilation message

street_lamps.cpp: In member function 'void AcAutomaton::solve_subtask1()':
street_lamps.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
street_lamps.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
street_lamps.cpp:154:17: note: in expansion of macro 'REP'
  154 |                 REP(i, strings.size()){
      |                 ^~~
street_lamps.cpp: In member function 'void AcAutomaton::solve_subtask2()':
street_lamps.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
street_lamps.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
street_lamps.cpp:170:9: note: in expansion of macro 'REP'
  170 |         REP(i, s.length())
      |         ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 433 ms 20940 KB Output is correct
2 Correct 444 ms 24440 KB Output is correct
3 Correct 447 ms 24788 KB Output is correct
4 Correct 475 ms 26280 KB Output is correct
5 Correct 534 ms 26412 KB Output is correct
6 Correct 385 ms 26020 KB Output is correct
7 Correct 789 ms 26920 KB Output is correct
8 Correct 790 ms 26920 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 433 ms 20940 KB Output is correct
9 Correct 444 ms 24440 KB Output is correct
10 Correct 447 ms 24788 KB Output is correct
11 Correct 475 ms 26280 KB Output is correct
12 Correct 534 ms 26412 KB Output is correct
13 Correct 385 ms 26020 KB Output is correct
14 Correct 789 ms 26920 KB Output is correct
15 Correct 790 ms 26920 KB Output is correct
16 Incorrect 1 ms 384 KB Output isn't correct
17 Halted 0 ms 0 KB -