oj.uz

Submission #742659

# Submission time Handle Problem Language Result Execution time Memory
742659 2023-05-16T16:24:40 Z speedyArda Street Lamps (APIO19_street_lamps) C++14
40 / 100
 283 ms 26428 KB 
#include "bits/stdc++.h"

using namespace std;
const int MAXN = 3e5+5;
vector< pair<string, pair<int, int> > > queries(MAXN); 
string stats[MAXN];
int main() 
{
    int n, q;
    cin >> n >> q;
    string in;
    cin >> in;
    in = " " + in;
    stats[0] = in;
    int maxdiff = 0;
    int ltog = 0, fque = 1e9;
    for(int i = 1; i <= q; i++)
    {
        cin >> queries[i].first;
        if(queries[i].first == "toggle")
        {
            cin >> queries[i].second.first;
            ltog = i;
        } else {
            cin  >> queries[i].second.first >> queries[i].second.second; 
            maxdiff = max(maxdiff, queries[i].second.second - queries[i].second.first);
            fque = min(fque, i);
        }
    }
    if(max(n, q) <= 100) // Subtask 1
    {
        for(int i = 1; i <= q; i++)
        {
            if(queries[i].first == "toggle")
            {
                in[queries[i].second.first] = (in[queries[i].second.first] == '1' ? '0' : '1');
                stats[i] = in;
            } else 
            {
                stats[i] = in;
                int pos = 0;
                for(int ava = 0; ava < i; ava++) {
                    string temp = stats[ava];
                    int beg = queries[i].second.first;
                    int end = queries[i].second.second;
                    while(beg < end)
                    {

                        if(temp[beg] == '1')
                            beg++;
                        else
                            break;
                    }
                    if(beg == end)
                        pos++;
                }

               cout << pos << "\n";

            }

        }
    } else 
    {
        if(maxdiff == 1) // Subtask 2
        {
            vector<int> roads(n+5, 0);
            vector<int> last(n+5, 0);
            
            for(int i = 1; i <= q; i++)
            {
                int idx = queries[i].second.first;
                if(queries[i].first == "toggle")
                {
                    if(in[idx] == '1')
                    {
                        roads[idx] += i - last[idx];
                        in[idx] = '0';
                    } else 
                    {
                        last[idx] = i;
                        in[idx] = '1';
                    }
                } else 
                {
                    int val = roads[idx];
                    if(in[idx] == '1')
                    {
                        val += i - last[idx];
                    }
                    cout << val << "\n";
                }
            }
        } else if(ltog < fque) // Subtask 4
        { 
            
        } else 
        {

        }
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21332 KB Output is correct
2 Correct 13 ms 21420 KB Output is correct
3 Correct 12 ms 21332 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 12 ms 21344 KB Output is correct
7 Correct 11 ms 21444 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 22324 KB Output is correct
2 Correct 181 ms 22320 KB Output is correct
3 Correct 208 ms 22348 KB Output is correct
4 Correct 224 ms 24964 KB Output is correct
5 Correct 237 ms 25264 KB Output is correct
6 Correct 219 ms 24964 KB Output is correct
7 Correct 276 ms 24896 KB Output is correct
8 Correct 283 ms 26428 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 21332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 21336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21332 KB Output is correct
2 Correct 13 ms 21420 KB Output is correct
3 Correct 12 ms 21332 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 12 ms 21344 KB Output is correct
7 Correct 11 ms 21444 KB Output is correct
8 Correct 169 ms 22324 KB Output is correct
9 Correct 181 ms 22320 KB Output is correct
10 Correct 208 ms 22348 KB Output is correct
11 Correct 224 ms 24964 KB Output is correct
12 Correct 237 ms 25264 KB Output is correct
13 Correct 219 ms 24964 KB Output is correct
14 Correct 276 ms 24896 KB Output is correct
15 Correct 283 ms 26428 KB Output is correct
16 Incorrect 12 ms 21332 KB Output isn't correct
17 Halted 0 ms 0 KB -