QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#136423	#186. Street Lamps	Wawi^#	20	126ms	4284kb	C++20	2.4kb	2023-08-08 18:45:32	2024-07-04 01:25:11

Judging History

你现在查看的是最新测评结果

[2024-07-04 01:25:11]
评测

测评结果：20
用时：126ms
内存：4284kb

查看

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-08-08 18:45:32]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct item{
    int first=1,second=0,val=0;
};

void solve(){
    int n,q; cin >> n >> q;
    if(n<=100 && q<=100 && n!=6){
        vector<vector<int>> arr(q+1,vector<int>(n+1));
        for(int i=1; i <= n;i++){
            char c; cin >> c;
            arr[0][i]=c-'0';
        }
        vector<bool> changes(q+1);
        for(int i=1; i <=q;i++){
            string s; cin >> s;
            arr[i]=arr[i-1];
            if(s=="query"){
                int ans=0;
                int l,r; cin >> l >> r;
                for(int j=0; j <=i-1;j++){
                    for(int k=l; k <=r-1;k++){
                        if(arr[j][k]==0) break;
                        if(k==r-1) ans++;
                    }
                }
                cout << ans << endl;
            } else{
                int curr; cin >> curr;
                arr[i][curr]=!arr[i][curr];
            }
        }
    } else{
        vector<vector<int>> nums(n+1);
        vector<item> calced(n+1);
        for(int i=1; i <= n;i++){
            char c; cin >> c;
            nums[i].push_back(0);
            calced[i].second=c-'0';
        }
        for(int i=1; i <= q;i++){
            string s; cin >> s;
            if(s=="query"){
                int l,r; cin >> l >> r;
                int it=upper_bound(nums[l].begin(),nums[l].end(),calced[l].val)-nums[l].begin();
                bool ok=calced[l].second;
                for(int j=it ; j < nums[l].size();j++){
                    if(ok){
                        calced[l].val+=nums[l][j]-calced[l].first;
                        ok=false;
                        calced[l].first=nums[l][j];
                        calced[l].second=0;
                    }
                    else ok=true,calced[l].second=1;
                }
                if(calced[l].second){
                    calced[l].val+=i-calced[l].first;
                }
                calced[l].first=i;
                cout << calced[l].val << endl;
            } else{
                int curr; cin >> curr;
                nums[curr].push_back(i);
            }
        }

        
        
    }
    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t=1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

源文件, 语言: C++20

详细

Subtask #1:

score: 20

Accepted

Test #1:

score: 20

Accepted

time: 0ms

memory: 3524kb

input:

5 7
11011
query 1 2
query 1 2
query 1 6
query 3 4
toggle 3
query 3 4
query 1 6

output:

result:

ok 6 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3620kb

input:

5 50
01001
query 1 6
toggle 3
toggle 3
toggle 2
toggle 3
toggle 2
toggle 4
query 2 6
query 2 3
query 1 3
query 3 5
toggle 3
query 2 6
query 1 5
query 2 3
query 3 6
toggle 5
toggle 1
toggle 2
toggle 4
query 1 6
query 4 5
toggle 3
query 5 6
toggle 2
query 4 6
toggle 5
toggle 5
toggle 2
query 4 5
query...

output:

result:

ok 25 lines

Test #3:

score: 0

Accepted

time: 0ms

memory: 3596kb

input:

10 50
1111010011
toggle 3
toggle 1
toggle 5
toggle 5
toggle 7
query 7 10
query 6 8
query 6 8
toggle 7
toggle 4
toggle 4
toggle 3
toggle 8
toggle 8
toggle 3
query 4 6
query 1 4
toggle 10
query 4 8
query 4 11
toggle 8
toggle 7
query 6 8
toggle 6
query 3 8
toggle 5
toggle 3
toggle 7
toggle 4
query 2 11...

output:

result:

ok 24 lines

Test #4:

score: 0

Accepted

time: 0ms

memory: 3560kb

input:

20 100
01110011111110011110
toggle 16
query 1 13
toggle 2
query 9 21
toggle 8
toggle 7
query 2 5
toggle 18
query 18 21
query 9 11
query 3 5
query 13 20
query 9 10
toggle 4
query 5 21
query 5 19
query 1 15
query 19 21
toggle 16
query 6 21
query 8 21
toggle 14
toggle 19
toggle 1
query 8 11
toggle 13
t...

output:

result:

ok 46 lines

Test #5:

score: 0

Accepted

time: 1ms

memory: 3788kb

input:

100 100
1001001110110100110110100110000100100001111010111000011101010010010001101010101001100000111110000010
toggle 43
toggle 13
toggle 19
query 73 101
toggle 65
query 13 59
toggle 1
query 26 101
query 79 83
query 19 101
query 9 94
query 41 91
toggle 55
toggle 87
toggle 37
query 10 31
toggle 26
quer...

output:

result:

ok 51 lines

Test #6:

score: 0

Accepted

time: 1ms

memory: 3664kb

input:

100 100
0111010000111110011111000001101011010000000000111101011110010111011010010110111110111011101010010010
query 9 10
query 13 14
query 69 70
query 43 44
toggle 82
toggle 92
toggle 6
toggle 63
query 91 92
query 61 62
toggle 70
query 51 52
query 14 15
toggle 16
toggle 2
toggle 40
toggle 98
toggle 5...

output:

result:

ok 45 lines

Test #7:

score: 0

Accepted

time: 0ms

memory: 3660kb

input:

100 100
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
query 1 47
query 42 81
query 18 29
query 31 37
query 4 58
query 46 59
query 32 100
query 12 98
query 13 29
query 40 73
query 68 100
query 28 75
query 55 72
query 53 61
query 2 54
query 25 71
...

output:

result:

ok 100 lines

Test #8:

score: 0

Accepted

time: 0ms

memory: 3788kb

input:

100 100
1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
query 11 25
query 64 67
query 3 63
query 14 60
query 49 64
query 45 70
query 7 33
query 32 97
query 21 84
query 57 61
query 9 22
query 43 60
query 14 34
query 69 99
query 32 69
query 11 13
qu...

output:

result:

ok 100 lines

Subtask #2:

score: 0

Wrong Answer

Test #9:

score: 0

Wrong Answer

time: 126ms

memory: 4284kb

input:

100 300000
1100100000000101010010100111010001100010001100111101000010111110001101101110100100100110101010110010
query 13 14
query 42 43
toggle 64
query 78 79
toggle 85
query 35 36
toggle 35
query 4 5
toggle 5
query 4 5
query 42 43
query 35 36
query 13 14
query 14 15
toggle 15
toggle 31
query 20 21
q...

output:

result:

wrong answer 4th lines differ - expected: '6', found: '5'

Subtask #3:

score: 0

Wrong Answer

Test #17:

score: 0

Wrong Answer

time: 1ms

memory: 3596kb

input:

1000 1003
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

192
396
831

result:

wrong answer 1st lines differ - expected: '0', found: '192'

Subtask #4:

score: 0

Wrong Answer

Test #30:

score: 0

Wrong Answer

time: 2ms

memory: 3612kb

input:

1000 1003
10111011001010101101100010101100100010100110001000000001001100111110101100110100010001111101101100110111110100011000111101100100000110110010101011101001101110111100010100100000110001010001111101001010100101011111010000001110111110001011010111101100000001001110101110011111000101101100011010...

output:

result:

wrong answer 1st lines differ - expected: '0', found: '12'

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted

QOJ.ac

QOJ

Judging History

answer

详细

Subtask #1:

Test #1:

input:

output:

result:

Test #2:

input:

output:

result:

Test #3:

input:

output:

result:

Test #4:

input:

output:

result:

Test #5:

input:

output:

result:

Test #6:

input:

output:

result:

Test #7:

input:

output:

result:

Test #8:

input:

output:

result:

Subtask #2:

Test #9:

input:

output:

result:

Subtask #3:

Test #17:

input:

output:

result:

Subtask #4:

Test #30:

input:

output:

result:

Subtask #5:

Dependency #1:

Dependency #2: