-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path1.cpp
61 lines (54 loc) · 1.49 KB
/
1.cpp
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
#include <bits/stdc++.h>
#define f first
#define s second
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
vector<pii> p;
bool vis[10000];
signed main(){
freopen("input.txt", "r", stdin);
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
string nxt;
int ans =0;
int progloc = 0;
bool instruc = true;
int cinst = 0;
while(cin >> nxt){
if(instruc){
if(nxt == "nop"){
cinst = 0;
}else if(nxt == "acc"){
cinst = 1;
}else{
cinst = 2;
}
}else{
p.push_back(pii(cinst, stoi(nxt)));
}
instruc = !instruc;
}
while(true){
if(vis[progloc]) break;
if(p[progloc].f == 0){
progloc++;
}else if(p[progloc].f == 1){
ans += p[progloc].s;
progloc++;
}else{
progloc += p[progloc].s;
}
}
return 0;
}