oj.uz

답안 #1005543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005543 2024-06-22T15:25:54 Z underwaterkillerwhale 가로등 (APIO19_street_lamps) C++17
40 / 100
 62 ms 15548 KB 
//#ifdef ONLINE_JUDGE
//    #include "cyberland.h"
//#endif

#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N  = 3e5 + 2;
const ll Mod = 998244353;
const int szBL = 50;
const int INF = 1e9 + 7;
const int BASE = 137;

struct Query {
    int typ, u, v;
};

int n, Q;
int a[N], b[N];
Query qr[N];

namespace sub1 {
    bool check (int L, int R) {
        rep (i, L, R - 1) if (a[i] == 0) return 0;
        return 1;
    }
    void solution() {
        rep (i, 1, Q) {
            if (qr[i].typ == 0) {
                a[qr[i].u] ^= 1;
            }
            else {
                int L = qr[i].u, R = qr[i].v;
                int res = 0;
                reb (t, i, 1) {
                    if (qr[t].typ == 0) a[qr[t].u] ^= 1;
                    if (check(L, R)) {
                        ++res;
                    }
                }
                rep (t, 1, i) if (qr[t].typ == 0)  a[qr[t].u] ^= 1;
                cout << res <<"\n";
            }
        }
    }
}
namespace sub2 {
    int cnt[N];
    bool check () {
        rep (i, 1, Q) if (qr[i].typ == 1 && (qr[i].u != qr[i].v - 1)) return 0;
        return 1;
    }
    void solution() {
        rep (i, 1, n) a[i] = b[i];
        rep (i, 1, Q) {
            if (qr[i].typ == 0) {
                int pos = qr[i].u;
                a[pos] ^= 1;
                if (a[pos] == 0) cnt[pos] += i;
                else cnt[pos] -= i;
            }
            else {
                int pos = qr[i].u;
                int res = cnt[pos];
                if (a[pos] == 1) res += i;
                cout << res <<"\n";
            }
        }
    }
}
void solution() {
    cin >> n >> Q;
    string s; cin >> s;
    rep (i, 1, n) a[i] = s[i - 1] - '0', b[i] = a[i];
    rep (i, 1, Q) {
        string s;
        cin >> s;
        if (s == "toggle") cin >> qr[i].u, qr[i].typ = 0;
        else cin >> qr[i].u >> qr[i].v, qr[i].typ = 1;
    }
    if (n <= 100 && Q <= 100)
        sub1 :: solution();
    else
        if (sub2 :: check())
        sub2 :: solution();
//    else sub3 :: solution();
}
#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
int main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    file ("PAINT");
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}

/*
5 7
11011
query 1 2
query 1 2
query 1 2
query 3 4
toggle 3
query 3 4
query 1 2



3 2
0 1 5
0 2 5
1
1 2

*/

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 7380 KB Output is correct
2 Correct 39 ms 10832 KB Output is correct
3 Correct 41 ms 11348 KB Output is correct
4 Correct 50 ms 13596 KB Output is correct
5 Correct 51 ms 14144 KB Output is correct
6 Correct 41 ms 13288 KB Output is correct
7 Correct 60 ms 14188 KB Output is correct
8 Correct 62 ms 15548 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 39 ms 7380 KB Output is correct
9 Correct 39 ms 10832 KB Output is correct
10 Correct 41 ms 11348 KB Output is correct
11 Correct 50 ms 13596 KB Output is correct
12 Correct 51 ms 14144 KB Output is correct
13 Correct 41 ms 13288 KB Output is correct
14 Correct 60 ms 14188 KB Output is correct
15 Correct 62 ms 15548 KB Output is correct
16 Incorrect 1 ms 4440 KB Output isn't correct
17 Halted 0 ms 0 KB -