#870410 (C++17) No.2308 [Cherry 5th Tune B] もしかして、真?

• 問題: No.2308 [Cherry 5th Tune B] もしかして、真?
• ユーザー: snrnsidy
• 提出日時: 2023-05-19 22:00:08
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 3,172 bytes
• コンパイル時間: 3,360 ms
• コンパイル使用メモリ: 385,104 KB
• 最終ジャッジ日時: 2025-02-13 01:55:24
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
other	AC * 13 WA * 26

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#pragma GCC optimize("O3")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")   
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping") 
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma") 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int func(int op,int x,int y)
{
    if(op==0)
    {
        if(x==1 && y==1) return 1;
        return 0;
    }
    else if(op==1)
    {
        if(x==1 || y==1) return 1;
        return 0;
    }
    else if(op==2)
    {
        if(x!=y) return 1;
        return 0;
    }
    else
    {
        if(x==1) return y;
        else return 1;
    }
    return -1;
}
int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int tc;
    cin >> tc;
    while(tc--)
    {
        set <int> S;
        int n,t;
        string s;
        vector <int> x,y,z;
        cin >> n;
        for(int i=0;i<n;i++)
        {
            cin >> s;
            if(s=="True") x.push_back(1);
            else x.push_back(0);
        }
        for(int i=0;i<n-1;i++)
        {
            cin >> s;
            if(s=="and") y.push_back(0);
            else if(s=="or") y.push_back(1);
            else if(s=="xor") y.push_back(2);
            else y.push_back(3);
        }
        for(int i=0;i<n-1;i++)
        {
            int a;
            cin >> a;
            a-=1;
            z.push_back(a);
        }
        for(int i=0;i<n;i++) S.insert(i);
        int res = 0;
        for(int i=0;i<n-1;i++)
        {
            auto it = S.lower_bound(z[i]);
            auto it2 = it;
            it2++;
            int idx1 = *it;
            int idx2 = *it2;
            int val = func(y[idx1],x[idx1],x[idx2]);
            S.erase(idx1);
            x[idx2] = val;
            res = val;
        }
        if(res==0) cout << "False" << '\n';
        else cout << "True" << '\n';
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX