oj.uz

Submission #257671

# Submission time Handle Problem Language Result Execution time Memory
257671 2020-08-04T14:20:54 Z trttrttrt Street Lamps (APIO19_street_lamps) C++17
20 / 100
 128 ms 7548 KB 
// Dmitry _kun_ Sayutin (2019)

#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::cerr;

using std::vector;
using std::map;
using std::array;
using std::set;
using std::string;

using std::pair;
using std::make_pair;

using std::tuple;
using std::make_tuple;
using std::get;

using std::min;
using std::abs;
using std::max;
using std::swap;

using std::unique;
using std::sort;
using std::generate;
using std::reverse;
using std::min_element;
using std::max_element;

#ifdef LOCAL
#define LASSERT(X) assert(X)
#else
#define LASSERT(X) {}
#endif

template <typename T>
T input() {
    T res;
    cin >> res;
    LASSERT(cin);
    return res;
}

template <typename IT>
void input_seq(IT b, IT e) {
    std::generate(b, e, input<typename std::remove_reference<decltype(*b)>::type>);
}

#define SZ(vec)         int((vec).size())
#define ALL(data)       data.begin(),data.end()
#define RALL(data)      data.rbegin(),data.rend()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()


int main() {
    std::iostream::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    // code here
    int n = input<int>();
    int q = input<int>();

    vector<char> state(n);
    for (int i = 0; i != n; ++i)
        state[i] = int(input<char>() == '1');

    vector<int> sum(n);
    
    for (int tm = 1; tm <= q; ++tm) {
        if (input<string>() == "toggle") {
            int i = input<int>() - 1;
            if (state[i] == 0)
                sum[i] -= tm;
            else
                sum[i] += tm;
            
            state[i] ^= 1;
        } else {
            int a = input<int>() - 1;
            int b = input<int>() - 1;

            assert(a == b - 1);
            int ans = sum[a];
            
            if (state[a] == 1)
                ans += tm;
            
            cout << ans << "\n";
        }
    }


    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 1272 KB Output is correct
2 Correct 82 ms 4728 KB Output is correct
3 Correct 85 ms 5240 KB Output is correct
4 Correct 101 ms 6264 KB Output is correct
5 Correct 109 ms 6648 KB Output is correct
6 Correct 97 ms 6264 KB Output is correct
7 Correct 125 ms 6136 KB Output is correct
8 Correct 128 ms 7548 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -