NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #210688 | #3785. 恒真 | qiuqiu | 100 | 2ms | 1156kb | C++11 | 951b | 2024-08-07 09:56:23 | 2024-08-07 12:06:07 |
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize(2)
int a[10];
char p[100005];
int tp=0;
bool t=1,sta[100005];
int sp=0;
bool akioi(){
for(int i=1;i<=tp;i++){
if(p[i]=='a') sta[++sp]=a[1];
if(p[i]=='b') sta[++sp]=a[2];
if(p[i]=='c') sta[++sp]=a[3];
if(p[i]=='d') sta[++sp]=a[4];
if(p[i]=='e') sta[++sp]=a[5];
if(p[i]=='f') sta[++sp]=a[6];
if(p[i]=='g') sta[++sp]=a[7];
if(p[i]=='h') sta[++sp]=a[8];
if(p[i]=='!') sta[sp]=(!sta[sp]);
if(p[i]=='|') sta[sp-1]=(sta[sp]|sta[sp-1]),sp--;
if(p[i]=='&') sta[sp-1]=(sta[sp]&sta[sp-1]),sp--;
if(p[i]=='^') sta[sp-1]=(sta[sp]^sta[sp-1]),sp--;
}
sp=0;
return sta[1];
}
void fun(int dep){
if(dep==9){
if(!akioi()) t=0;
return;
}
fun(dep+1);
a[dep]=1;
fun(dep+1);
a[dep]=0;
}
signed main(){
char ch;
while(cin>>ch) p[++tp]=ch;
fun(1);
if(t) cout<<"YES";
else cout<<"NO";
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Subtask #1:
score: 30
Accepted
Test #1:
score: 30
Accepted
time: 0ms
memory: 1152kb
input:
a a | a b & |
output:
NO
result:
ok "NO"
Test #2:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a b | a b | & a b | a b | & &
output:
NO
result:
ok "NO"
Test #3:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a b | c d | & e f | g h | & &
output:
NO
result:
ok "NO"
Test #4:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
c d |
output:
NO
result:
ok "NO"
Test #5:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a a & b & b a & b b & & | b b | b b | & b b a & | | | b b & a a & & b a | a a | & & b a a | | a a & ...
output:
NO
result:
ok "NO"
Test #6:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
b a b | | b d & c b & & & d d | a | d c & b b & | & & c c & d & d a & d a & & | b & & a c & b b | | ...
output:
NO
result:
ok "NO"
Test #7:
score: 0
Accepted
time: 1ms
memory: 1156kb
input:
g d | f a & | h a & a a & | & d a e & e g & & | & b e & a a | & g f & h a & & & h e | f g | | e c & ...
output:
NO
result:
ok "NO"
Test #8:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
c b & a a | | g g h | & | a e | g b & | f f | c c & & & | b c b | f b | | | b e | f | b d & c a & | ...
output:
NO
result:
ok "NO"
Subtask #2:
score: 30
Accepted
Test #9:
score: 30
Accepted
time: 0ms
memory: 1156kb
input:
a a & a ! & a a | a a | & & ! a a a | & a a | a | | a a | a a & | ! | | a ! ! ! ! a a | a ! & ! ! | ...
output:
YES
result:
ok "YES"
Test #10:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a ! ! a a | a a & & | a a ! | a a & ! & & ! ! a ! ! a & a ! ! a a & a ! | | & a a & a a & | a a | ! ...
output:
NO
result:
ok "NO"
Test #11:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a ! ! a a | a a & & | a a ! | a a & ! & & ! ! a ! ! a & a ! ! a a & a ! | | & a a & a a & | a a | ! ...
output:
NO
result:
ok "NO"
Test #12:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a a a | ! | a & a a a | ! & a | | a a & ! a a & a a | | & ! a a a & | a a | a | & a a | a a | | a ! ...
output:
YES
result:
ok "YES"
Test #13:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a a ! a a | ^ a a | a a | ^ | a a | a ^ a ! a ! | ^ | ! | a a a | ! & a ! a | a a ^ a a ^ & | ^ a ^ ...
output:
NO
result:
ok "NO"
Test #14:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a a a a | a a | | a a | a a | ^ & ! a a | ! a a | a & | a | & & a a & a a ^ & a a | a ! | ^ a a & ! ...
output:
NO
result:
ok "NO"
Test #15:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a a ! a a ^ ^ a ! | | a a | a a | ^ a a | ! | a a | a a | | a a | a | ^ | | a | a a | a a | | a ! a ...
output:
YES
result:
ok "YES"
Subtask #3:
score: 40
Accepted
Test #16:
score: 40
Accepted
time: 1ms
memory: 1152kb
input:
a b | a ! b ! | |
output:
YES
result:
ok "YES"
Test #17:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a b ! | a ! b | &
output:
NO
result:
ok "NO"
Test #18:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a b ! | a ! b | |
output:
YES
result:
ok "YES"
Test #19:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
a b | c ! | a ! b | c | | a b ! c | | |
output:
YES
result:
ok "YES"
Test #20:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
c b b | | b b | c c | | | c ! c b | ^ ! ^ b c | b c | | c c | ! ^ b ! | | a a | b a | | b b | ! | ! ...
output:
NO
result:
ok "NO"
Test #21:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
b a | a a | ^ b | b a a & | ! | b ! c a ^ | ! a ^ | c ! ! b b | ! ^ c b | a | b & | b a | ! c c | a ...
output:
NO
result:
ok "NO"
Test #22:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
b ! b | c a c | ! | ! a c | b c | | ! b c a | c a | | | | ^ b c | c ! & a c & c c | | | c a | ! a ! ...
output:
YES
result:
ok "YES"
Test #23:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
d c c | ! c ! c ! | | | ! c a | d ! | c b | a d | | | d c ^ ! c c | ! | | b b | b | b a | ! | b b b ...
output:
NO
result:
ok "NO"
Test #24:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
b ! c ! d d | | d c ^ d d | | | ! d a | ! ! ! | c a c | d ! | ^ ! c a | c d | | a c | d c | ^ | b c ...
output:
NO
result:
ok "NO"
Test #25:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
b ! g ! h d | | d g ^ h d | | | ! d e | ! ! ! | g e c | h ! | ^ ! g e | c d | | e c | h c | ^ | b g ...
output:
NO
result:
ok "NO"
Test #26:
score: 0
Accepted
time: 0ms
memory: 1152kb
input:
b ! g ! h d | | d g ^ h d | | | ! d e | ! ! ! | g ! ! d ! ! h c | d ^ ! | | | c ! g e | | ! ! b b g ...
output:
NO
result:
ok "NO"
Test #27:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a ! b | c | d | a b ! | c | d | | a b | c ! | d | | a b | c | d ! | |
output:
YES
result:
ok "YES"
Test #28:
score: 0
Accepted
time: 0ms
memory: 1156kb
input:
a a ! | b b ! | & c c ! | d d ! | & & e e ! | f f ! | & & g ! g | h ! h | & &
output:
YES
result:
ok "YES"
Extra Test:
score: 0
Extra Test Passed
