-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
975.cpp
163 lines (141 loc) · 4.29 KB
/
975.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
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
154
155
156
157
158
159
160
161
162
163
__________________________________________________________________________________________________
sample 48 ms submission
class Solution
{
public:
int oddEvenJumps(vector<int> const &v)
{
vector<pair<int, size_t>> w;
for (size_t i = 0; i < v.size(); i++)
w.emplace_back(v[i], i);
vector<int> odd(v.size(), -1), even(v.size(), -1);
stack<pair<int, size_t>> s;
sort(w.begin(), w.end());
for (auto const &p : w)
{
while (! s.empty() && s.top().second <= p.second)
{
odd[s.top().second] = p.second;
s.pop();
}
s.emplace(p);
}
s = {};
sort(w.begin(), w.end(), [] (pair<int, size_t> const &a, pair<int, size_t> const &b)
{
if (a.first == b.first)
return a.second < b.second;
return a.first > b.first;
});
for (auto const &p : w)
{
while (! s.empty() && s.top().second <= p.second)
{
even[s.top().second] = p.second;
s.pop();
}
s.emplace(p);
}
int count = 1;
vector<int> state(v.size());
state.back() = 0b11;
for (int i = v.size() - 2; i >= 0; i--)
{
if (odd[i] != -1 && state[odd[i]] & 0b01)
{
state[i] |= 0b10;
count++;
}
if (even[i] != -1 && state[even[i]] & 0b10)
state[i] |= 0b01;
}
return count;
}
};
static int x = []() { ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
__________________________________________________________________________________________________
sample 56 ms submission
static int x = []() { ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
class Solution {
public:
int oddEvenJumps(vector<int>& A) {
vector<pair<int,int>> v;
for(int i=0;i<A.size();i++){
v.push_back(make_pair(A[i],i));
}
vector<int> nxtodd(A.size(),-1);
vector<int> nxteven(A.size(),-1);
sort(v.begin(),v.end());
make(nxtodd,v);
for(int i=0;i<A.size();i++){
v[i].first = -v[i].first;
}
sort(v.begin(),v.end());
make(nxteven,v);
vector<int> even(A.size(),0);
vector<int> odd(A.size(),0);
// for(int i=0;i<nxtodd.size();i++)
// cout << nxtodd[i] << " ";
// cout << endl;
// for(int i=0;i<nxteven.size();i++)
// cout << nxteven[i] << " ";
odd[A.size()-1]=even[A.size()-1]=1;
for(int i=A.size()-2;i>=0;i--){
if(nxtodd[i]!=-1) odd[i] = even[nxtodd[i]];
if(nxteven[i]!=-1) even[i] = odd[nxteven[i]];
}
return accumulate(odd.begin(),odd.end(),0);
}
void make(vector<int>& nxt,vector<pair<int,int>>& v){
stack<int> st;
for(int i=0;i<v.size();i++){
while(!st.empty() && v[i].second>st.top()){
nxt[st.top()] = v[i].second;
st.pop();
}
st.push(v[i].second);
}
}
};
__________________________________________________________________________________________________
sample 10600 kb submission
class Solution {
public:
int oddEvenJumps(vector<int>& A) {
vector<vector<bool>>fuck;
int count = 0, minn, maxx, temp1, temp2;
fuck.resize(2);
fuck[0].resize(A.size(),0);
fuck[1].resize(A.size(),0);
fuck[0][A.size() - 1] = 1;
fuck[1][A.size() - 1] = 1;
for (int i = A.size() - 2; i >= 0; i--) {
minn = 100001;
maxx = -1;
for (int k = 1; i + k < A.size(); k++) {
if (A[i] <= A[i+k]&&A[i + k] < minn) {
minn = A[i + k];
temp1 = i + k;
}
if (A[i] >= A[i+k]&&A[i + k] > maxx) {
maxx = A[i + k];
temp2 = i + k;
}
}
if (minn < 100001) {
if (fuck[0][temp1] == 1)
fuck[1][i] = 1;
}
if (maxx > -1) {
if (fuck[1][temp2] == 1)
fuck[0][i] = 1;
}
}
for (int i = 0; i < A.size(); i++) {
if (fuck[1][i] == 1){
count++;
}
}
return count;
}
};