Submission #00010

ソースコード

?
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include<bits/stdc++.h>
using namespace std;
map<string,int> num_id;
char num_rev[6];
int num_cnt = 0;
int num[6]={};
string info[52],var[52][3];
int line[52],dest[52],con[52];
int id_cnt[1002]={};
int id_rev[52]={};
int n;
priority_queue<pair<char,int> >pq;
// N,num1,num2,num3,num4,num5
int dp[52][16][16][16][16][16] = {};
int die = 0;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>line[i];
id_cnt[line[i]]=1;id_rev[line[i]]=i;
cin>>info[i];
if(info[i] == "ADD" || info[i] == "SUB"){
cin>>var[i][0]>>var[i][1]>>var[i][2];
if(!num_id.count(var[i][0])){
num_id[var[i][0]] = num_cnt;num_rev[num_cnt]=var[i][0][0];num_cnt++;
}
if(!num_id.count(var[i][1])){
num_id[var[i][1]] = num_cnt;num_rev[num_cnt]=var[i][1][0];num_cnt++;
}
if('a' <= var[i][2][0] && var[i][2][0] <= 'z'){
if(!num_id.count(var[i][2])){
num_id[var[i][2]] = num_cnt;num_rev[num_cnt]=var[i][2][0];num_cnt++;
}
}
}
if(info[i] == "SET"){
cin>>var[i][0]>>var[i][1];
if(!num_id.count(var[i][0])){
num_id[var[i][0]] = num_cnt;num_rev[num_cnt]=var[i][0][0];num_cnt++;
}
if('a' <= var[i][1][0] && var[i][1][0] <= 'z'){
if(!num_id.count(var[i][1])){
num_id[var[i][1]] = num_cnt;num_rev[num_cnt]=var[i][1][0];num_cnt++;
}
}
}
if(info[i] == "IF"){
cin>>var[i][0]>>dest[i];
if(!num_id.count(var[i][0])){
num_id[var[i][0]] = num_cnt;num_rev[num_cnt]=var[i][0][0];num_cnt++;
}
}
}
int now_line=0;
while(true){
if(dp[now_line][num[0]][num[1]][num[2]][num[3]][num[4]] == 1){
die = 1;break;
}
dp[now_line][num[0]][num[1]][num[2]][num[3]][num[4]] = 1;
if(info[now_line] == "ADD"){
int temp = num[num_id[var[now_line][1]]];
int tt = 0;
if('a' <= var[now_line][2][0] && var[now_line][2][0] <= 'z'){
tt = num[num_id[var[now_line][2]]];
}
else{
int hoge = 0;
while('0' <= var[now_line][2][hoge] && var[now_line][2][hoge] <= '9'){
tt*=10;tt+=var[now_line][2][hoge] - '0';
hoge++;
}
}
temp += tt;
if(temp<0 || 15<temp)break;
num[num_id[var[now_line][0]]] = temp;
now_line = (now_line+1)%n;
}
else if(info[now_line] == "SUB"){
int temp = num[num_id[var[now_line][1]]];
int tt = 0;
if('a' <= var[now_line][2][0] && var[now_line][2][0] <= 'z'){
tt = num[num_id[var[now_line][2]]];
}
else{
int hoge = 0;
while('0' <= var[now_line][2][hoge] && var[now_line][2][hoge] <= '9'){
tt*=10;tt+=var[now_line][2][hoge] - '0';
hoge++;
}
}
temp -= tt;
if(temp<0 || 15<temp)break;
num[num_id[var[now_line][0]]] = temp;
now_line = (now_line+1)%n;
}
else if(info[now_line] == "SET"){
int temp=0;
if('a' <= var[now_line][1][0] && var[now_line][1][0] <= 'z'){
temp = num[num_id[var[now_line][1]]];
}
else{
int hoge = 0;
while('0' <= var[now_line][1][hoge] && var[now_line][1][hoge] <= '9'){
temp*=10;temp+=var[now_line][1][hoge] - '0';
hoge++;
}
}
if(temp<0 || 15<temp)break;
num[num_id[var[now_line][0]]] = temp;
now_line = (now_line+1)%n;
}
else if(info[now_line] == "IF"){
int temp = num[num_id[var[now_line][0]]];
if(temp!=0){
if(!id_cnt[dest[now_line]])break;
now_line = id_rev[dest[now_line]];
}
else{
now_line = (now_line+1)%n;
}
}
else if(info[now_line] == "HALT")break;
}
if(die)cout<<"inf"<<endl;
else{
for(int i=0;i<num_cnt;i++){
pq.push(make_pair(num_rev[i],num[i]));
}
int ans[10];char ans_c[10];
for(int i=num_cnt-1;i>=0;i--){
pair<char,int>f = pq.top();pq.pop();
ans_c[i] = f.first;ans[i] = f.second;
}
for(int i=0;i<num_cnt;i++){
cout<<ans_c[i]<<"="<<ans[i]<<endl;
}
}
return(0);
}

ステータス

項目 データ
問題 0006 - プログラム停止判定
ユーザー名 Doll
投稿日時 2017-10-24 17:07:00
言語 C++11
状態 Wrong Answer
得点 0
ソースコード長 3993 Byte
最大実行時間 1508 ms
最大メモリ使用量 201160 KB

セット

セット 得点 Cases
1 ALL 0 / 10 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 19 ms 10720 KB
1
in02.txt AC 25 ms 2488 KB
1
in03.txt AC 20 ms 2444 KB
1
in04.txt WA 19 ms 25060 KB
1
in05.txt WA 18 ms 22976 KB
1
in06.txt WA 18 ms 2580 KB
1
in07.txt AC 17 ms 4588 KB
1
in08.txt AC 17 ms 8772 KB
1
in09.txt AC 18 ms 4512 KB
1
in10.txt WA 15 ms 8692 KB
1
in11.txt WA 1508 ms 201160 KB
1
in12.txt AC 26 ms 160416 KB
1