답안 #1115339

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115339	2024-11-20T10:52:15 Z	staszic_ojuz	Snake Escaping (JOI18_snake_escaping)	C++17	5 / 100	2000 ms	10404 KB

snake_escaping

#include <iostream>
using namespace std;
int main(){
    int l, q;
    cin>>l>>q;
    string s;
    cin>>s;
    int n=1;
    for (int i=0;i<l;i++) n<<=1;
    for (int qe=0;qe<q;qe++){
        string qs;
        cin>>qs;
        int x1=0, x2=0;
        for (char c:qs){
            if (c=='1') x1|=1;
            if (c=='0') x2|=1;
            x1<<=1;
            x2<<=1;
        }
        x1>>=1;
        x2>>=1;
        int out=0;
        for (int i=0;i<n;i++){
            if ((i&x1)==x1&&((~i)&x2)==x2){
                out+=s[i]-'0';
            }
        }
        cout<<out<<'\n';
    }
    return 0;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	336 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	336 KB	Output is correct
4	Correct	4 ms	336 KB	Output is correct
5	Correct	4 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	4 ms	336 KB	Output is correct
8	Correct	4 ms	336 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	4 ms	336 KB	Output is correct

Subtask #2

0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	336 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	336 KB	Output is correct
4	Correct	4 ms	336 KB	Output is correct
5	Correct	4 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	4 ms	336 KB	Output is correct
8	Correct	4 ms	336 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	4 ms	336 KB	Output is correct
11	Execution timed out	2049 ms	10404 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	336 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	336 KB	Output is correct
4	Correct	4 ms	336 KB	Output is correct
5	Correct	4 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	4 ms	336 KB	Output is correct
8	Correct	4 ms	336 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	4 ms	336 KB	Output is correct
11	Execution timed out	2049 ms	10404 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	336 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	336 KB	Output is correct
4	Correct	4 ms	336 KB	Output is correct
5	Correct	4 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	4 ms	336 KB	Output is correct
8	Correct	4 ms	336 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	4 ms	336 KB	Output is correct
11	Execution timed out	2041 ms	3636 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	336 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	336 KB	Output is correct
4	Correct	4 ms	336 KB	Output is correct
5	Correct	4 ms	336 KB	Output is correct
6	Correct	3 ms	336 KB	Output is correct
7	Correct	4 ms	336 KB	Output is correct
8	Correct	4 ms	336 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	4 ms	336 KB	Output is correct
11	Execution timed out	2049 ms	10404 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-