text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
int c1 = 0, c2 = 0, c3 = 0, c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c1++;
c++;
}
if (s[i] == ')') {
c2++;
if (c != 0) c--;
}
if (s[i] == '#') {
c = 0;
c3++;
}
if (c2 + c3 > c1) {
cout << -1;
return 0;
}
}
if (c > 0) {
cout << -1;
return 0;
}
for (int i = 0; i < c3 - 1; i++) {
cout << 1 << endl;
c2++;
}
cout << c1 - c2;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string z;
cin >> z;
int o = 0;
int n = z.size();
vector<int> ans;
for (int i = 0; i < n; i++) {
if (z[i] == ')')
o--;
else if (z[i] == '(')
o++;
else {
ans.push_back(1);
o--;
}
if (o < 0) {
puts("-1");
return 0;
}
}
if (o > 0) {
ans.pop_back();
ans.push_back(o + 1);
} else if (o < 0) {
puts("-1");
return 0;
}
int j = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (z[i] == ')')
sum--;
else if (z[i] == '(')
sum++;
else {
sum -= ans[j];
j++;
}
if (sum < 0) {
puts("-1");
return 0;
}
}
if (sum)
puts("-1");
else
for (int i = 0; i < ans.size(); i++) printf("%d\n", ans[i]);
}
|
#include <bits/stdc++.h>
const long long int MOD = 1000000007ll;
const int mxsz = 200005;
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
string st;
cin >> st;
int has = 0, op = 0, cls = 0, ls = 0;
for (int i = 0; i < st.length(); i++) {
if (st[i] == '#') {
ls = i;
}
}
for (int i = 0; i < st.length(); i++) {
if (st[i] == '(') {
op++;
} else if (st[i] == '#') {
has++;
} else {
cls++;
}
if (cls + has > op) {
cout << -1;
return 0;
}
}
int op1 = 0, cls1 = 0, ans;
for (int i = 0; i < st.length(); i++) {
if (st[i] == '(') {
op1++;
} else if (st[i] == ')') {
cls1++;
}
if (ls == i) {
ans = op - has - cls + 1;
if (op1 < cls1 + op - cls) {
cout << -1;
return 0;
}
}
if (ls < i) {
if (cls1 + has + ans - 1 > op1) {
cout << -1;
return 0;
}
}
}
for (int i = 1; i < has; i++) {
cout << 1 << endl;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
char s[111111];
int ans[111111] = {0};
int n, d;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
int cnt = 0, sum = 0;
int last = n;
for (int i = n; i >= 1; i--) {
if (s[i] == '(') sum++;
if (s[i] == ')') sum--;
if (s[i] == '#') {
last = i;
break;
}
}
if (sum > 0) {
printf("-1\n");
return 0;
}
for (int i = 1; i <= n; i++) {
if (s[i] == '(') cnt++;
if (s[i] == ')') cnt--;
if (s[i] == '#') {
if (last == i) {
ans[++d] = cnt + sum;
if (cnt + sum <= 0) {
printf("-1\n");
return 0;
}
cnt -= ans[d];
} else
ans[++d] = 1, cnt--;
}
if (cnt < 0) {
printf("-1\n");
return 0;
}
}
if (cnt > 0) {
printf("-1\n");
return 0;
}
for (int i = 1; i <= d; i++) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)(INT_MAX - 100);
const int N = (int)(0);
const long long mod = (int)(1e+9 + 7);
int a, b;
int main() {
string s;
cin >> s;
vector<int> v;
for (int i = 0; i < int(s.size()); i++) {
a += (s[i] == ')');
b += (s[i] == '(');
if (s[i] == '#') {
a++;
v.push_back(1);
}
}
if (b > a) v[int(v.size()) - 1] += b - a;
int pos;
a = b = pos = 0;
for (int i = 0; i < int(s.size()); i++) {
a += (s[i] == ')');
b += (s[i] == '(');
if (s[i] == '#') a += v[pos++];
if (a > b) return printf("%d\n", -1), 0;
}
for (auto x : v) printf("%d\n", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
string s;
cin >> s;
int a = 0, c = 0, b = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(') a++;
if (s[i] == ')') b++;
if (s[i] == '#') c++;
}
if (a < b + c)
cout << -1;
else {
int idx = -1;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '#') s[i] = '1', idx = i;
}
if (c) c--;
b += c;
int sum = 0;
for (int i = 0; i < s.length(); i++) {
if (i == idx && b < a) {
sum -= (a - b);
} else if (s[i] == '(')
sum++;
else if (s[i] == '1' || s[i] == ')')
sum--;
if (sum < 0) {
cout << -1;
return 0;
}
}
if (sum) {
cout << -1;
return 0;
}
for (int i = 0; i < s.length(); i++) {
if (idx == i) {
cout << a - b << endl;
continue;
}
if (s[i] != '(' && s[i] != ')') cout << s[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string t;
long int i, j;
cin >> t;
long int c1 = 0, c2 = 0, c3 = 0;
long int last;
for (i = t.length() - 1; i >= 0; i--) {
if (t[i] == '#') {
last = i;
break;
}
}
long int f = 0, count = 0, g;
if (t[t.length() - 1] == '(') {
cout << "-1" << endl;
return 0;
}
for (i = 0; i <= last; i++) {
if (c1 < 0) {
cout << "-1" << endl;
f++;
break;
}
if (t[i] == '(') {
c1++;
} else if (t[i] == ')') {
c1--;
} else if (t[i] == '#') {
if (i == last) {
c2 = c1;
for (j = i + 1; j < t.length(); j++) {
if (c2 < 0) {
cout << "-1" << endl;
f++;
break;
}
if (t[j] == '(') {
c3++;
c2++;
} else if (t[j] == ')') {
c3--;
c2--;
}
}
if (c3 > 0) {
f++;
cout << "-1" << endl;
break;
}
if (f == 1) {
break;
}
if (c2 == 0) {
cout << "-1" << endl;
f++;
break;
}
g = c2;
break;
} else {
count++;
c1--;
}
}
}
if (f == 0) {
while (count--) {
cout << "1" << endl;
}
cout << g << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100000 + 10;
stack<int> st;
bool see[MAX];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int t = 0;
memset(see, 0, sizeof see);
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
st.push(i);
} else if (s[i] == ')') {
if (!st.empty()) {
see[st.top()] = 1;
see[i] = 1;
st.pop();
}
} else
t = i;
}
vector<int> ans;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (see[i] == 0 && s[i] == '(')
cnt++;
else if (see[i] == 0 && s[i] == '#') {
if (cnt == 0) {
cout << -1;
return 0;
}
if (t != i) {
ans.push_back(1);
cnt--;
} else {
ans.push_back(cnt);
cnt = 0;
}
} else if (see[i] == 0 && s[i] == ')') {
cout << -1;
return 0;
}
}
if (cnt != 0) {
cout << -1;
return 0;
}
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int a[100010];
int main() {
cin >> s;
n = s.size();
int ct = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
a[i] = 1;
else
a[i] = -1;
ct += a[i];
if (ct < 0) {
cout << -1;
return 0;
}
}
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '#') {
a[i] -= ct;
break;
}
}
ct = 0;
for (int i = 0; i < n; i++) {
ct += a[i];
if (ct < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '#') cout << -a[i] << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int MAX = 1e9 + 5;
int n, m, need, ans[N], t;
string str;
bool ctr() {
int need = 0;
for (int i = 1; i <= n; i++) {
if (need < 0) return false;
if (str[i] == '(') need++;
if (need < 0) return false;
if (str[i] == ')')
need--;
else
need -= ans[i];
if (need < 0) return false;
}
return !need;
}
int main() {
cin >> str;
n = str.size();
str = '0' + str;
for (int i = 1; i <= n; i++)
if (str[i] == '#') {
ans[i] = 1;
t++;
}
for (int i = n; i >= 1; i--)
if (str[i] == '#') {
need = 0;
for (int j = 1; j <= n; j++)
if (str[j] == '(')
need++;
else if (str[j] == ')')
need--;
ans[i] = need - t + 1;
if (need <= 0 || !ctr())
cout << "-1" << '\n';
else
for (int j = 1; j <= n; j++)
if (str[j] == '#') cout << ans[j] << '\n';
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[1000010];
int brr[1000010];
stack<int> st;
int main() {
int prev;
int cnt = 0;
string s;
cin >> s;
int lst = -1;
int l = s.length();
bool b = true;
for (int i = 0; i < l; i++) {
if (s[i] == '(') {
st.push(i);
cnt++;
}
if (s[i] == ')') {
cnt--;
if (cnt < 0) {
b = false;
break;
} else
st.pop();
}
if (s[i] == '#') {
cnt--;
if (cnt < 0) {
b = false;
break;
} else {
st.pop();
arr[i] = 1;
brr[i] = 1;
}
lst = max(lst, i);
}
}
while (!st.empty() and b) {
int tp = st.top();
if (tp > lst) {
b = false;
break;
} else {
cnt--;
st.pop();
brr[lst]++;
}
}
if (!b || (cnt != 0)) {
cout << -1 << endl;
return 0;
}
for (int i = 0; i < l; i++) {
if (arr[i] == 1) {
cout << brr[i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g;
int main() {
int c = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == ')') c--;
if (s[i] == '(') c++;
if (s[i] == '#') {
g.push_back(1);
c--;
}
}
if (c < 0) {
cout << -1 << endl;
return 0;
}
g[g.size() - 1] += c;
c = 0;
for (int i = 0, j = 0; i < s.length(); i++) {
if (s[i] == '#') {
c -= g[j];
j++;
} else if (s[i] == '(')
c++;
else if (s[i] == ')')
c--;
if (c < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < g.size(); i++) cout << g[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int hash_size = 0, one_size = 0, mone_size = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') hash_size++;
if (s[i] == '(') one_size++;
if (s[i] == ')') mone_size++;
}
int value = 0;
int h = 0;
vector<int> v;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') value++;
if (s[i] == ')') value--;
if (s[i] == '#') {
h++;
if (h < hash_size) {
value--;
v.push_back(1);
} else {
int x = one_size - mone_size + 1 - h;
if (x <= 0) {
cout << "-1";
return 0;
}
v.push_back(x);
value -= x;
}
}
if (value < 0) {
cout << "-1" << endl;
return 0;
}
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long n = s.length();
long long h = 0;
long long sharp = 0;
long long lastsharp = -1;
for (long long i = 0; i < n; i++) {
if (s[i] == '(') {
h++;
} else if (s[i] == ')') {
h--;
} else if (s[i] == '#') {
h--;
sharp++;
lastsharp = i;
}
if (h < 0) {
cout << -1 << endl;
return 0;
}
}
long long lastsharpminus = 1 + h;
h = 0;
for (long long i = 0; i < n; i++) {
if (i == lastsharp) {
h -= lastsharpminus;
} else if (s[i] == '(') {
h++;
} else if (s[i] == ')') {
h--;
} else if (s[i] == '#') {
h--;
}
if (h < 0) {
cout << -1 << endl;
return 0;
}
}
for (long long i = 0; i < (sharp - 1); i++) {
cout << 1 << endl;
}
cout << lastsharpminus << endl;
return 0;
}
|
#include <bits/stdc++.h>
int o, j, k;
char s[100005];
bool p = true, q;
int main() {
scanf("%s", s);
for (int i = 0; s[i]; i++) {
if (s[i] == '(')
o++;
else if (s[i] == ')')
o--;
else {
j = i;
--o;
}
if (o < 0) p = false;
}
o = 0;
for (int i = j; s[i]; i++) {
if (s[i] == '(') {
for (int l = i; s[l]; l++) {
if (s[l] == '(')
o++;
else
o--;
}
if (o > 0) p = false;
break;
}
}
o = 0;
if (p) {
for (int i = 0; s[i]; i++) {
if (s[i] == '(')
o++;
else if (s[i] == ')')
o--;
else {
if (!q)
q = true;
else
printf("1\n");
o--;
}
}
printf("%d\n", o + 1);
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int a, b, L, B;
vector<int> v, v2;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
b++;
else
B++;
if (b + B > a) {
cout << -1;
return 0;
}
}
int Q = 0, W = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '(')
Q++;
else if (s[i] == ')')
W++;
else {
if (Q > W) {
cout << -1;
return 0;
} else
break;
}
if (Q > W) {
cout << -1;
return 0;
}
}
b += B;
if (a < b) {
cout << -1;
return 0;
}
for (int i = 1; i < B; i++) cout << 1 << endl;
if (a >= b) cout << a - b + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[100001];
int k;
int main() {
string s;
cin >> s;
k = s.size();
int a = 0, b = 0, c = 0;
int last;
for (int i = 0; i < k; ++i) {
if (s[i] == '(') {
arr[i] = 1;
a++;
} else if (s[i] == ')') {
arr[i] = 2;
b++;
} else {
arr[i] = 0;
c++;
last = i;
}
}
if (b + c > a) {
cout << -1;
return 0;
}
int count = 0;
for (int i = 0; i < k; ++i) {
if (i != last) {
if (arr[i] == 1) {
arr[i] = count + 1;
count++;
} else if (arr[i] == 2) {
arr[i] = count - 1;
count--;
} else if (arr[i] == 0) {
arr[i] = count - 1;
count--;
}
} else {
arr[i] = count - (a - b - c + 1);
count = count - (a - b - c + 1);
}
}
if (*min_element(arr, arr + k - 1) < 0) {
cout << -1;
return 0;
} else {
for (int i = 0; i < c - 1; ++i) {
cout << 1 << "\n";
}
cout << a - b - c + 1;
}
}
|
#include <bits/stdc++.h>
char str[100012];
int sol[100012];
int main() {
fgets(str, 100010, stdin);
int n = strlen(str);
if (str[n - 1] == '\n') n--;
int last = 0;
for (int i = 0; i < n; ++i)
if (str[i] == '#') last = i;
while (last + 1 < n && str[last + 1] == ')') {
str[last++] = ')';
str[last] = '#';
}
int dif = 0;
for (int i = last + 1; i < n; ++i)
if (str[i] == '(')
dif++;
else
dif--;
if (dif > 0) {
printf("-1");
return 0;
}
int num = 0;
int open = 0;
for (int i = 0; i < n; ++i) {
if (str[i] == '(')
open++;
else if (str[i] == ')')
open--;
else if (str[i] == '#') {
if (i != last) {
sol[num++] = 1;
open--;
} else {
if (open + dif <= 0) {
printf("-1");
return 0;
}
sol[num++] = open + dif;
open = -dif;
}
}
if (open < 0) {
printf("-1");
return 0;
}
}
if (open != 0) {
printf("-1");
return 0;
}
for (int i = 0; i < num; ++i) printf("%d\n", sol[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
int last = 0;
int alc = 0;
int num = 0;
bool check = false;
for (int i = 0; i < s.size(); i++)
if (s[i] == '(')
alc++;
else {
alc--;
if (s[i] == '#') num++;
}
int diff = 0;
if (alc < 0)
check = true;
else {
diff = alc;
alc = 0;
int num2 = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] == '(')
alc++;
else {
alc--;
if (s[i] == '#' && ++num2 == num) alc -= diff;
if (alc < 0) check = true;
}
}
if (check)
cout << "-1\n";
else {
for (int i = 0; i < num - 1; i++) cout << "1\n";
cout << 1 + diff << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long i, l, ll, c = 0, k = 0, f = 0;
string s;
cin >> s;
l = s.size();
i = 0;
while (i < l) {
while (i < l && s[i] == '(') {
c++;
i++;
}
if ((s[i] == '#' || s[i] == ')') && i < l) {
c--;
if (s[i] == '#') {
k++;
}
i++;
}
if (c < 0) {
cout << "-1" << endl;
return 0;
}
}
l--;
int cc1 = 0, cc2 = 0;
while (l >= 0) {
while (l >= 0 && s[l] == ')') {
cc1++;
f++;
l--;
}
if (l >= 0 && s[l] == '(') {
f--;
cc2++;
}
if (f < 0) {
cout << "-1" << endl;
return 0;
}
if (s[l] == '#') break;
l--;
}
if (cc1 != cc2 && cc2 > 1) {
cout << "-1" << endl;
return 0;
}
for (i = 1; i < k; i++) cout << "1" << endl;
cout << c + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = 0, d, q;
int h = 0, p = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
h++;
else
p++;
if (h < p) {
cout << -1;
return 0;
}
if (s[i] == '#') {
x++;
q = h - p;
} else if (s[i] == ')')
d = h - p;
}
d -= h - p;
q -= h - p;
if (d < 0 || q < 0)
cout << -1;
else {
for (int i = 1; i < x; i++) cout << 1 << endl;
cout << h - p + 1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const int md = 1e9 + 7;
int a[N], b[N], c[N], dp[111][2];
int i, j, n, m, ans, x, y, t, z, k;
vector<int> v;
int d;
int main() {
string st;
cin >> st;
t = 0;
n = st.size() - 1;
while (n > 0 && st[n] != '#') n--;
for (i = 0; i < n; i++)
if (st[i] == '(')
t++;
else {
t--;
if (t < 0) {
cout << -1;
return 0;
}
if (st[i] == '#') v.push_back(1);
}
int tt = t;
z = tt;
for (i = n; i < st.size(); i++)
if (st[i] == '(')
tt++;
else {
tt--;
z = min(z, tt);
}
if (z != tt || z < 0) {
cout << -1;
return 0;
}
v.push_back(z + 1);
for (i = 0; i < v.size(); i++) cout << v[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
string s;
long long int i, j, flag = 0, cnt = 0, counts = 0, val1, val2, val3;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (s[i] == ')')
cnt--;
else if (s[i] == '(')
cnt++;
else
counts++;
if (cnt < 0) {
flag = 1;
break;
}
}
if (flag) {
cout << "-1";
return 0;
}
if (counts > cnt) {
cout << "-1";
return 0;
}
val1 = counts;
val2 = val3 = cnt;
flag = 0;
cnt = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == ')')
cnt--;
else if (s[i] == '(')
cnt++;
else {
if (val1 == 1) {
cnt -= val2;
} else {
cnt--;
val2--;
val1--;
}
}
if (cnt < 0) {
flag = 1;
break;
}
}
if (flag) {
cout << "-1";
return 0;
}
for (i = 0; i < counts; i++) {
if (i == counts - 1) {
cout << val3 << endl;
} else {
cout << "1" << endl;
val3--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int n = s.size(), l = 0, r = 0, cnt, ind;
for (int i = (0); i < int(n); i++) {
l += (s[i] == '(');
r += (s[i] == ')');
}
cnt = l - r;
for (int i = (0); i < int(n); i++)
if (s[i] == '#') ind = i;
string cad;
vector<int> ans;
for (int i = (0); i < int(n); i++) {
if (s[i] == '#') {
if (cnt) {
if (i == ind) {
for (int j = (0); j < int(cnt); j++) cad += ')';
ans.push_back(cnt);
} else {
cad += ')';
cnt--;
ans.push_back(1);
}
} else {
cout << -1 << endl;
return 0;
}
} else
cad += s[i];
}
l = r = 0;
for (int i = (0); i < int(cad.size()); i++) {
l += (cad[i] == '(');
r += (cad[i] == ')');
if (r > l) {
cout << -1 << endl;
return 0;
}
}
for (int i = (0); i < int(ans.size()); i++) cout << ans[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100009;
int last, x;
int n, a, d;
char s[MAXN];
int main() {
scanf("%s", s);
n = strlen(s);
for (int i = 0; i < n; i++)
if (s[i] == '#') last = i, d++;
for (int i = 0; i <= last; i++) {
a += (s[i] == '(' ? +1 : -1);
if (a < 0) {
printf("-1");
return 0;
}
}
x = a + 1, a = 0;
for (int i = last + 1; i < n; i++) {
a += (s[i] == '(' ? +1 : -1);
if (a < 0) x--, a++;
}
if (x < 1 || a != 0) {
printf("-1");
return 0;
}
for (int i = 0; i < d - 1; i++) printf("1\n");
printf("%d", x);
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100050];
int c[100050];
int main() {
while (~scanf("%s", s)) {
memset(c, 0, sizeof(c));
int i, a, c1, c2;
int len = strlen(s);
a = c1 = c2 = 0;
for (i = 0; i < len; ++i) {
if (s[i] == ')')
++c1;
else if (s[i] == '(')
++c2;
else
++a;
}
int tot = a;
if (c1 + a > c2) {
printf("-1\n");
continue;
}
int temp1 = 0, temp2 = 0, j;
for (i = 0; i < len; ++i) {
if (s[i] == ')') ++temp1;
if (s[i] == '(') ++temp2;
if (s[i] == '#') {
if ((--a) == 0) {
int cou = 0;
j = len - 1;
while (j > i) {
if (s[j] == ')') ++cou;
--j;
}
int temp = c2 - temp1 - cou;
temp1 += temp;
c[a] = temp;
} else {
++temp1;
c[a] = 1;
}
}
if (temp1 > temp2) break;
}
if (temp1 > temp2)
printf("-1\n");
else {
for (i = tot - 1; i >= 0; i--) printf("%d\n", c[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100003];
int main() {
gets(s);
int l = strlen(s);
int c = 0, last = 0, cnt = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '(')
c++;
else if (s[i] == ')')
c--;
else
cnt++, c--, last = i;
if (c < 0) {
printf("-1");
return 0;
}
}
int left = c;
c = 0;
for (int i = 0; i < l; i++) {
if (s[i] == '(')
c++;
else
c--;
if (i == last) c -= left;
if (c < 0) {
printf("-1");
return 0;
}
}
for (int i = 1; i <= cnt; i++) printf("%d\n", i == cnt ? left + 1 : 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int cnt_l = count(s.begin(), s.end(), '(');
int cnt_r = count(s.begin(), s.end(), ')');
int cnt_sh = count(s.begin(), s.end(), '#');
int need_cnt = cnt_l - cnt_r;
if (need_cnt < cnt_sh) {
puts("-1");
return 0;
}
auto first_sh = find(s.begin(), s.end(), '#');
int cnt_pref_l = count(s.begin(), first_sh, '(');
int cnt_pref_r = count(s.begin(), first_sh, ')');
if (cnt_pref_l < cnt_pref_r) {
puts("-1");
return 0;
}
vector<int> res;
int cur_cnt_l = 0, cur_cnt_r = 0;
for (int i = 0; s[i]; ++i) {
if (s[i] == '(')
++cur_cnt_l;
else if (s[i] == ')')
++cur_cnt_r;
else {
int add_cnt = cnt_sh == 1 ? need_cnt : 1;
res.push_back(add_cnt);
cur_cnt_r += add_cnt;
--cnt_sh;
need_cnt -= add_cnt;
}
if (cur_cnt_l < cur_cnt_r) {
puts("-1");
return 0;
}
}
for (int i = 0; i < (int)res.size(); ++i) printf("%d\n", res[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char a[110000];
int ans[110000];
int main() {
scanf("%s", a + 1);
n = strlen(a + 1);
int tl, tr, tc;
tl = tr = tc = 0;
for (int i = (1); i <= (int)n; i++)
if (a[i] == '(')
tl++;
else if (a[i] == ')')
tr++;
else
tc++;
if (tc > (tl - tr)) {
printf("-1");
return 0;
}
int res = 0;
bool fl = 0;
int u = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == ')')
res--;
else if (a[i] == '(')
res++;
if (res < 0) {
printf("-1\n");
return 0;
}
if (a[i] == '#') {
if (u != tc - 1)
ans[++u] = 1, res--;
else {
ans[++u] = tl - tr - (tc - 1);
res -= ans[u];
}
if (res < 0) {
printf("-1");
return 0;
}
}
}
for (int i = (1); i <= (int)tc; i++) printf("%d\n", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
char s[100005];
int a[100005], b[100005];
int ans[100005];
int main() {
int tot = 0, totr = 0, i;
scanf("%s", s);
int l = strlen(s);
for (i = 0; i < l; i++) {
if (s[i] == '#')
a[++tot] = i;
else if (s[i] == '(')
b[++totr] = i;
else {
if (totr == 0) {
printf("-1\n");
return 0;
} else
totr--;
}
}
int w = 0;
while (tot > 0) {
int sum = 0;
if (totr == 0 || a[tot] < b[totr]) {
printf("-1\n");
return 0;
}
totr--;
sum++;
while (totr >= 1 && b[totr] >= a[tot - 1]) {
totr--;
sum++;
}
ans[w++] = sum;
tot--;
}
for (i = w - 1; i >= 0; i--) printf("%d\n", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, stk = 0, last, to_close, cnt = 0;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (s[i] == '(') {
stk++;
} else {
stk--;
}
if (s[i] == '#') {
cnt++;
last = i;
}
if (stk < 0) {
cout << "-1\n";
return 0;
}
}
to_close = stk;
stk = 0;
for (i = 0; i < s.size(); i++) {
if (s[i] == '(') {
stk++;
} else {
stk--;
}
if (i == last) {
stk -= to_close;
}
if (stk < 0) {
cout << "-1\n";
return 0;
}
}
for (i = 0; i < cnt - 1; i++) {
cout << "1\n";
}
cout << to_close + 1 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
string s;
int a, b, c, d;
int ans[maxn];
bool mark = false;
void input() { cin >> s; }
void process() {
a = 1, b = 0;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
a--;
else {
b++;
a--;
}
}
for (int i = 0; i < n; i++) {
if (s[i] == '(')
c++;
else if (s[i] == ')')
c--;
else {
d++, c--;
if (d == b) {
c++;
c -= a;
}
};
if (c < 0) {
cout << -1 << endl;
return;
}
}
if (a <= 0)
cout << -1 << endl;
else {
for (int i = 1; i < b; i++) cout << 1 << endl;
cout << a << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
input();
process();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1.0);
int main() {
string s;
cin >> s;
int cont = 0;
int v[s.size()], mini[s.size()];
int curr = 0;
bool f = 0;
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '(')
v[i] = ++curr;
else if (s[i] == ')')
v[i] = --curr;
else {
cont++;
v[i] = curr;
}
if (curr < 0) f = 1;
}
if (f) {
puts("-1");
} else {
vector<int> ans;
mini[s.size() - 1] = v[s.size() - 1];
for (int i = s.size() - 2; i >= 0; i--) {
mini[i] = min(mini[i + 1], v[i]);
}
curr = 0;
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '#') {
if (cont == 1)
ans.push_back(mini[i] - curr);
else
ans.push_back(1);
if (mini[i] == curr) f = 1;
curr += ans.back();
cont--;
}
}
int j = 0;
curr = 0;
for (int i = (0); i < (s.size()); i++) {
if (s[i] == '(')
++curr;
else if (s[i] == ')')
--curr;
else
curr -= ans[j++];
if (curr < 0) f = 1;
}
if (curr > 0) f = 1;
if (f) {
puts("-1");
} else {
for (int i = (0); i < (ans.size()); i++) cout << ans[i] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string second;
cin >> second;
int open, b, h;
open = b = h = 0;
bool ok = 1;
for (int i = 0; i < second.size(); i++) {
if (second[i] == '(') {
b++;
open++;
} else if (second[i] == ')') {
b--;
if (open > 0) open--;
} else if (second[i] == '#') {
h++;
b--;
open = 0;
}
if (b < 0) {
ok = 0;
break;
}
}
if (open > 0) ok = 0;
if (ok) {
for (int i = 0; i < h - 1; i++) {
printf("1\n");
}
printf("%d\n", b + 1);
} else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int hash_count = 0;
int left = 0;
int last = s.find_last_of('#');
int last_value = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#') {
hash_count++;
if (i != last)
s[i] = ')';
else
continue;
}
left += (s[i] == '(' ? 1 : -1);
}
if (left <= 0) {
cout << "-1" << endl;
return 0;
}
last_value = left;
string new_s = s.substr(0, last);
for (int i = 0; i < left; i++) new_s.push_back(')');
new_s += s.substr(last + 1, s.size() - last - 1);
left = 0;
for (int i = 0; i < new_s.size(); i++) {
left += (new_s[i] == '(' ? 1 : -1);
if (left < 0) {
cout << "-1" << endl;
return 0;
}
}
if (left) {
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < hash_count - 1; i++) cout << "1" << endl;
cout << last_value << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> res;
int num = 0;
bool can = 1;
int last = 0;
for (int i = 0; i < s.size(); ++i) {
const char& op = s[i];
if (op == '(')
num++;
else if (op == ')')
num--;
else
num--, res.push_back(1), last = i;
if (num < 0) can = 0;
}
if (!can or s.back() == '(')
printf("-1\n");
else {
res.back() += num;
num = 0;
while (last < s.length() && s[last] != '(') last++;
for (int i = last; i < s.length(); ++i) num += s[i] == '(' ? 1 : -1;
if (num > 0)
printf("-1\n");
else
for (auto& op : res) printf("%d\n", op);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
char s[maxn];
int a[maxn];
int main() {
ios::sync_with_stdio(false);
scanf("%s", s);
int len = strlen(s);
int n = 0, m = 0, ln = 0, j;
bool flag = true;
int cn = 0;
for (int i = 0; i < len; ++i) {
if (s[i] == '(')
++n, ++cn;
else if (s[i] == ')')
--n;
else if (s[i] == '#') {
ln = n;
--n;
++m;
j = i;
}
if (n < 0) {
flag = false;
goto _output;
}
}
_output:
flag = flag && (cn >= len - cn);
if (flag) {
int x = n + 1;
n = ln - x;
if (n < 0) {
puts("-1");
return 0;
}
for (int i = j + 1; i < len; ++i) {
if (s[i] == '(')
++n;
else
--n;
if (n < 0) {
puts("-1");
return 0;
}
}
for (int i = 1; i < m; ++i) puts("1");
printf("%d\n", x);
} else {
puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int i;
stringstream(s) >> i;
return i;
}
inline string toString(int i) {
string s;
stringstream ss;
ss << i;
ss >> s;
return s;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int a = 0, b = 0, p, tmp;
bool f = 1;
vector<int> ans;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
a++;
else if (s[i] == ')')
b++;
else {
p = i;
b++;
ans.push_back(1);
}
if (a < b) f = 0;
}
if (a > b) {
tmp = a - b;
ans[ans.size() - 1] += tmp;
a = b = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
a++;
else
b++;
if (i == p) b += tmp;
if (a < b) f = 0;
}
}
if (f)
for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
int o = 0, c = 0;
int oct = 0, rest;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
o++;
else if (s[i] == ')')
c++;
else
oct++;
}
rest = o - c;
vector<int> ans(oct);
int m = oct;
for (int i = 0; i < m; i++) {
ans[i] = 1;
}
ans[m - 1] = rest - oct + 1;
if (ans[m - 1] < 1) {
cout << -1 << endl;
return 0;
}
int curr = 0;
int j = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
curr++;
} else if (s[i] == ')') {
curr--;
} else {
curr -= ans[j];
j++;
}
if (curr < 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < m; i++) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000010];
int main() {
int n;
cin >> s;
n = strlen(s);
int open = 0, close = 0, hashh = 0, i, j, hashd = 0, xx, r, boy;
for (i = 0; s[i] != '\0'; i++) {
if (s[i] == '(')
open++;
else if (s[i] == ')')
close++;
else if (s[i] == '#') {
hashh++;
}
}
xx = open - close - hashh;
if (xx < 0)
cout << -1;
else {
hashd = 0;
for (i = 0; s[i] != '\0'; i++) {
if (s[i] == '#' && hashd != (hashh - 1)) {
s[i] = ')';
hashd++;
} else if (s[i] == '#' && hashd == hashh - 1) {
s[i] = ')';
hashd++;
break;
}
}
for (j = n - 1 + xx; j >= (i + 1 + xx); j--) {
s[j] = s[j - xx];
}
s[n + xx] = '\0';
for (j = i + 1; j <= i + xx; j++) s[j] = ')';
r = 0;
boy = 0;
for (i = 0; s[i] != '\0'; i++) {
if (r < 0) {
boy = 1;
break;
} else if (s[i] == '(')
r++;
else if (s[i] == ')')
r--;
}
if (boy == 1)
cout << -1 << endl;
else {
for (i = 1; i <= hashh - 1; i++) cout << 1 << endl;
cout << xx + 1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100010];
int vis[100010];
int fi;
int b;
void match() {
int j = 0;
int num = 0;
for (int i = 0; i < b; ++i) {
if (str[i] == '(')
num++;
else if (str[i] == ')')
num--;
else
num -= vis[++j];
if (num < 0) {
cout << "-1" << endl;
return;
}
}
for (int i = 1; i < j + 1; i++) {
cout << vis[i] << endl;
}
}
int main() {
while (cin >> str) {
b = (int)strlen(str);
memset(vis, -1, sizeof(vis));
int num = 0, j = 0;
fi = 0;
for (int i = 0; i < b; ++i) {
if (str[i] == '(')
num++;
else if (str[i] == ')')
num--;
else {
vis[++fi] = 1;
num--;
}
}
if (num > 0) {
vis[fi] += num;
}
match();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[100100];
gets(a);
int loop = strlen(a);
int index = -1;
int bam = 0, dan = 0, has = 0;
for (int i = 0; i < loop; i++) {
if (a[i] == '(')
bam += 1;
else if (a[i] == ')')
dan += 1;
else {
has += 1;
index = i;
}
}
int need = bam - dan;
int flag = 1;
if (need < 0) {
cout << -1;
} else if (need < has) {
cout << -1;
} else {
dan = 0;
bam = 0;
has = 0;
int re[100100];
int j = 0;
for (int i = 0; i < loop; i++) {
if (i == index) {
re[j] = need;
dan += need;
j += 1;
if (bam < dan) {
cout << -1;
flag = 0;
break;
}
} else {
if (a[i] == '(')
bam += 1;
else if (a[i] == ')')
dan += 1;
else {
re[j] = 1;
j += 1;
need -= 1;
dan += 1;
}
if (bam < dan) {
cout << -1;
flag = 0;
break;
}
}
}
if (flag == 1) {
for (int i = 0; i < j; i++) printf("%d\n", re[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[220020], l, r, n, k, t, st, p;
bool f[220020];
char s[100];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%s", s);
if (s[0] == '?')
f[i] = 0;
else {
f[i] = 1;
sscanf(s, "%d", &a[i]);
}
}
for (int i = 1; i <= k; i++) {
a[i + n] = 1020000000;
f[i + n] = 1;
}
for (int i = 1; i <= k; i++) {
l = -1020000000;
t = 0;
for (int j = i; j <= n + k; j += k)
if (!f[j])
t++;
else {
if (t >= a[j] - l) {
printf("Incorrect sequence\n");
return 0;
}
r = a[j];
if (min(-l, r) * 2 > t)
st = -(t / 2);
else if ((-l) < r)
st = l + 1;
else
st = r - t;
for (int p = t; p > 0; p--) a[j - p * k] = st++;
t = 0;
l = r;
}
}
for (int i = 1; i < n; i++) printf("%d ", a[i]);
printf("%d\n", a[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const inline int __GET_INT() {
int ret;
scanf("%d", &ret);
return ret;
}
vector<int> a;
vector<bool> isKnown;
const int inf = 2 * 1000000000;
int toInt(string str) {
int ret = 0;
stringstream is(str);
is >> ret;
return ret;
}
long long getSum(long long cnt, long long val) {
if (val < 0) {
val = labs(val);
if (cnt <= (val + 1)) {
return val * cnt - ((cnt * (cnt - 1)) / 2);
}
return val * val - ((val * (val - 1)) / 2) + getSum(cnt - val, 0);
}
return val * cnt + ((cnt * (cnt - 1)) / 2);
}
void update(int st, int nd, int k) {
long long cnt = (nd - st) / k + 1;
if (isKnown[st]) --cnt;
if (st != nd && isKnown[nd]) --cnt;
long long low = -inf, high = inf, mid1, mid2;
if (isKnown[st]) low = a[st] + 1;
if (isKnown[nd]) high = a[nd] - cnt;
long long best = (1LL << 60), bestVal = -inf;
while (low <= high) {
long long dif = (high - low);
dif /= 3;
mid1 = low + dif;
mid2 = high - dif;
long long leftSum = getSum(cnt, mid1);
long long rightSum = getSum(cnt, mid2);
if (leftSum > rightSum) {
low = mid1 + 1;
if (rightSum < best) {
best = rightSum;
bestVal = mid2;
}
} else {
high = mid2 - 1;
if (leftSum < best) {
best = leftSum;
bestVal = mid1;
}
}
}
while (st <= nd) {
if (!isKnown[st]) {
a[st] = bestVal++;
}
st += k;
}
}
int main() {
int n = __GET_INT(), k = __GET_INT();
char token[20];
for (int i = 0; i < n; ++i) {
scanf("%s", token);
if (token[0] != '?') {
a.push_back(toInt(token));
isKnown.push_back(true);
} else {
a.push_back(-1);
isKnown.push_back(false);
}
}
for (int i = 0; i < k; ++i) {
int j = i, last = i;
while (j < n) {
if (isKnown[j]) {
update(last, j, k);
last = j;
}
j += k;
}
update(last, j - k, k);
}
bool correct = true;
for (int i = 0; correct && (i < k); ++i) {
int j = i + k;
while (j < n) {
if (a[j] <= a[j - k]) {
correct = false;
break;
}
j += k;
}
}
if (correct) {
for (int i = 0; i < n; ++i) {
if (i) printf(" ");
printf("%d", a[i]);
}
puts("");
} else
puts("Incorrect sequence");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void dbg_out() { cerr << "\b\b]\n"; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << H << ", ";
dbg_out(T...);
}
vector<string> split(string s, char delim) {
vector<string> v;
stringstream ss(s);
while (ss.good()) {
string stk;
getline(ss, stk, delim);
if (stk.empty()) continue;
v.push_back(stk);
}
return v;
}
const int INF = 2e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
cin.get();
string s;
getline(cin, s);
vector<string> X = split(s, ' ');
vector<long long> A(n);
vector<bool> ques(n, false);
for (int i = 0; i < n; ++i) {
A[i] = (X[i] == "?" ? '?' : stoi(X[i]));
ques[i] = (X[i] == "?");
}
for (int i = 0; i < k; ++i) {
vector<long long> nums;
vector<bool> ques1;
for (int j = i; j < n; j += k) {
if (j > i and !ques[j] and !ques[j - k] and A[j - k] >= A[j]) {
cout << "Incorrect sequence";
return 0;
}
nums.push_back(A[j]);
ques1.push_back(ques[j]);
}
for (int j = 0; j < (int)nums.size(); ++j) {
if (!ques1[j]) continue;
long long l = j;
while (l < (int)nums.size() and ques1[l]) l++;
long long left = (j ? nums[j - 1] + 1 : -INF);
long long right = (l < (int)nums.size() ? nums[l] - 1 : INF);
if (right - left + 1LL < l * 1LL - j) {
cout << "Incorrect sequence";
return 0;
}
if (left >= 0 and right >= 0) {
for (int x = j; x < l; ++x) nums[x] = left++;
} else if (left <= 0 and right <= 0) {
for (int x = l - 1; x >= j; --x) nums[x] = right--;
} else {
int cnts = (l - j) / 2;
int p = -cnts, q = cnts;
if (left <= p and q <= right) {
for (int x = l - 1; x >= j; --x) {
nums[x] = cnts--;
}
} else if (p < left) {
cnts = left;
for (int x = j; x < l; ++x) nums[x] = cnts++;
} else {
cnts = right;
for (int x = l - 1; x >= j; --x) {
nums[x] = cnts--;
}
}
}
j = l - 1;
}
for (int x = 0, j = i; x < (int)nums.size(); ++x, j += k) {
A[j] = nums[x];
}
}
for (long long i : A) cout << i << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)2e9 + 7;
const char noAns[] = "Incorrect sequence";
int n, m;
int a[100100];
int readInt(void) {
char s[22];
scanf("%s", s);
if (s[0] == '?') return (INF);
int val = 0;
if (s[0] == '-') {
for (int i = (1), _b = (strlen(s) - 1); i <= _b; i = i + 1)
val = val * 10 + s[i] - '0';
return (-val);
} else {
for (int i = 0, _n = (strlen(s)); i < _n; i = i + 1)
val = val * 10 + s[i] - '0';
return (val);
}
}
void init(void) {
n = readInt();
m = readInt();
for (int i = 0, _n = (n); i < _n; i = i + 1) a[i] = readInt();
}
void noAnswer(void) {
printf("%s\n", noAns);
exit(0);
}
void fillSeq(vector<int> &v, int l, int r) {
int minVal = l == 0 ? -INF : v[l - 1] + 1;
int maxVal = r == (int)v.size() - 1 ? INF : v[r + 1] - 1;
if (r - l + 1 > 1LL + maxVal - minVal) noAnswer();
if (minVal >= 0) {
for (int i = (l), _b = (r); i <= _b; i = i + 1) v[i] = minVal++;
} else if (maxVal <= 0) {
for (int i = (r), _a = (l); i >= _a; i = i - 1) v[i] = maxVal--;
} else {
int pos = 0;
int neg = -1;
for (int i = (l), _b = (r); i <= _b; i = i + 1) {
if (pos > maxVal)
v[i] = neg--;
else if (neg < minVal)
v[i] = pos++;
else if (-neg < pos)
v[i] = neg--;
else
v[i] = pos++;
}
sort(v.begin() + l, v.begin() + r + 1);
}
}
void process(void) {
for (int i = 0, _n = (m); i < _n; i = i + 1) {
vector<int> v, fst, lst;
for (int j = i; j < n; j = j + m) v.push_back(a[j]);
for (int j = 0, _n = (v.size()); j < _n; j = j + 1)
if (v[j] >= INF) {
if (j == 0 || v[j - 1] < INF) fst.push_back(j);
if (j == (int)v.size() - 1 || v[j + 1] < INF) lst.push_back(j);
}
for (int j = 0, _n = (fst.size()); j < _n; j = j + 1)
fillSeq(v, fst[j], lst[j]);
int id = 0;
for (int j = i; j < n; j = j + m) a[j] = v[id++];
}
for (int i = 0, _n = (n); i < _n; i = i + 1)
if (i + m < n && a[i] >= a[i + m]) noAnswer();
for (int i = 0, _n = (n); i < _n; i = i + 1) printf("%d ", a[i]);
printf("\n");
}
int main(void) {
init();
process();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int oo = (1 << 30) - 1;
int num[200005];
bool vis[200005];
int main() {
int n, k, t;
string str;
bool can = true;
memset(vis, false, sizeof vis);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> str;
if (str[0] == '?') {
num[i] = oo;
vis[i] = false;
} else {
stringstream ss(str);
ss >> t;
num[i] = t;
vis[i] = true;
}
}
for (int i = n; i < n + k; i++) {
vis[i] = true;
num[i] = oo + 1;
}
for (int i = 0; i < k; i++) {
int st = -oo, cnt = 0;
for (int j = i; j < n + k; j += k) {
if (!vis[j])
++cnt;
else {
if (num[j] - st <= cnt) {
cout << "Incorrect sequence" << endl;
return 0;
}
int tmp = max(st + 1, min(-cnt / 2, num[j] - cnt));
for (int p = cnt; p >= 1; p--) num[j - p * k] = tmp++;
cnt = 0;
st = num[j];
}
}
}
for (int i = 0; i < n; i++) cout << num[i] << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef struct {
int first, last;
int prev, next;
} Rec;
Rec rec[50000];
int size;
int a[100000];
int main(void) {
int i, j;
int n, k;
scanf("%d %d ", &n, &k);
for (i = 0; i < n; i++) {
int ch = getchar();
if (ch == '?') {
getchar();
a[i] = 1010000000;
} else {
ungetc(ch, stdin);
scanf("%d ", a + i);
}
}
for (i = 0; i < k; i++) {
int mode;
size = mode = 0;
for (j = i; j < n; j += k)
if (a[j] == 1010000000) {
if (!mode) {
mode = 1;
rec[size].first = j;
rec[size].prev = j - k >= 0 ? a[j - k] : -1010000000;
}
} else if (mode) {
mode = 0;
rec[size].last = j - k;
rec[size].next = a[j];
if (rec[size].prev >= rec[size].next) {
puts("Incorrect sequence");
return 0;
}
size++;
} else if (j - k >= 0)
if (a[j - k] >= a[j]) {
puts("Incorrect sequence");
return 0;
}
if (mode) {
rec[size].last = j - k;
rec[size].next = 1010000000;
if (rec[size].prev >= rec[size].next) {
puts("Incorrect sequence");
return 0;
}
size++;
}
while (size) {
Rec r = rec[--size];
int num = (r.last - r.first) / k + 1;
if (r.next - r.prev - 1 < num) {
puts("Incorrect sequence");
return 0;
} else {
int cnt;
int left = -(num / 2), right = left + num - 1;
if (!(r.prev < left))
left = r.prev + 1;
else if (!(right < r.next)) {
right = r.next - 1;
left = right - num + 1;
}
cnt = 0;
for (j = r.first; j <= r.last; j += k) a[j] = left + cnt++;
}
}
}
for (i = 0; i < n; i++) printf("%d ", a[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
const int UNKNOWN = numeric_limits<int>::min();
void solve(std::istream& in, std::ostream& out) {
int n, k;
in >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
string s;
in >> s;
if (s[0] == '?')
a[i] = UNKNOWN;
else {
istringstream is(s);
is >> a[i];
}
}
for (int i = 0; i < k; ++i) {
vector<int> u;
for (int j = i; j < n; j += k) u.push_back(a[j]);
if (!solve(u)) {
out << "Incorrect sequence" << endl;
return;
}
for (int j = i, t = 0; t < u.size(); j += k, ++t) {
a[j] = u[t];
}
}
for (int i : a) out << i << " ";
out << endl;
}
bool solve(vector<int>& a) {
const int n = a.size();
int first = 0;
while (first < n && a[first] == UNKNOWN) ++first;
if (first == n) {
first = -(n / 2);
for (int i = 0; i < n; ++i) a[i] = first++;
return true;
}
vector<int> prefix = solveOneSide(first, a[first]);
if (prefix.size() != first) return false;
for (int i = 0; i < first; ++i) a[i] = prefix[i];
while (true) {
int next = first + 1;
while (next < n && a[next] == UNKNOWN) {
++next;
}
if (next == n) {
vector<int> suffix = solveOneSide(n - first - 1, -a[first]);
if (suffix.size() != n - first - 1) return false;
for (int i = 0; i < n - first - 1; ++i) {
a[n - i - 1] = -suffix[i];
}
return true;
}
if (a[first] >= a[next]) return false;
vector<int> infix = solveTwoSide(a[first], next - first - 1, a[next]);
if (infix.size() != next - first - 1) return false;
for (int i = 0; i < next - first - 1; ++i) a[first + i + 1] = infix[i];
first = next;
}
}
vector<int> solveOneSide(int sz, int last) {
vector<int> res(sz);
if (sz == 0) return res;
last = min(last - 1, sz / 2);
for (int i = sz - 1; i >= 0; --i) res[i] = last--;
return res;
}
vector<int> solveTwoSide(int first, int sz, int last) {
vector<int> res(sz);
if (sz == 0 || last - first < sz + 1) return vector<int>();
if (last <= 0) {
for (int i = sz - 1; i >= 0; --i) res[i] = --last;
return res;
}
if (first >= 0) {
for (int i = 0; i < sz; ++i) res[i] = ++first;
return res;
}
set<int> nums;
nums.insert(0);
for (int i = 1; nums.size() < sz; ++i) {
if (i < last) nums.insert(i);
if (-i > first) nums.insert(-i);
}
std::copy(nums.begin(), nums.end(), res.begin());
return res;
}
};
void solve(std::istream& in, std::ostream& out) {
out << std::setprecision(12);
Solution solution;
solution.solve(in, out);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
istream& in = cin;
ostream& out = cout;
solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> grp[100002];
int main() {
int n, k, i, j, a[100002], flag = 0;
scanf("%d%d", &n, &k);
;
for (i = 0; i < n; i++) {
string s;
cin >> s;
if (s[0] == '?')
a[i] = INT_MIN;
else {
int sign = 1, l = s.size();
a[i] = 0, j = 0;
if (s[0] == '-') {
sign = -1;
j = 1;
}
for (; j < l; j++) a[i] = a[i] * 10 + (s[j] - '0');
a[i] *= sign;
}
grp[i % k].push_back(a[i]);
}
for (i = 0; i < k; i++) {
int l = grp[i].size(), val, cur = INT_MIN, pos = 0, prev = -1;
if (l == 0) {
if (grp[i][0] == INT_MIN) grp[i][0] = 0;
continue;
}
while (pos < l) {
if (grp[i][pos] != INT_MIN) {
int ele = pos - prev - 1, cnt;
if (cur >= 0)
cnt = cur + 1;
else if (grp[i][pos] < 0)
cnt = grp[i][pos] - ele;
else
cnt = min(max(0 - ele / 2, cur + 1), grp[i][pos] - ele);
for (j = prev + 1; j < pos; j++) grp[i][j] = cnt++;
cur = grp[i][pos];
prev = pos;
}
pos++;
}
int ele = l - 1 - prev, cnt = max(cur + 1, 0 - ele / 2);
for (j = prev + 1; j < l; j++) grp[i][j] = cnt++;
for (j = 0; j < l - 1; j++)
if (grp[i][j] >= grp[i][j + 1]) flag = 1;
}
if (flag)
cout << "Incorrect sequence\n";
else {
int cnt = 0, j = 0;
while (cnt < n) {
printf("%d ", grp[cnt % k][j]);
cnt++;
if (cnt % k == 0) j++;
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005], k, n;
bool ques[100005];
int toInt(char *s) {
int num = 0;
bool fu = 0;
if (s[0] == '-') fu = 1, s++;
int l = strlen(s), i;
for (i = 0; i < l; i++) {
num = num * 10 + s[i] - '0';
}
return fu ? (-num) : num;
}
bool flag;
int dfs(int len, int loc, int mn) {
if (loc > n) {
return len / 2;
}
if (ques[loc]) {
int tmp = dfs(len + 1, loc + k, mn + 1);
ques[loc] = 0;
a[loc] = max(mn, tmp);
return a[loc] - 1;
} else {
return min(len / 2, a[loc] - 1);
}
}
int main() {
scanf("%d%d", &n, &k);
int i;
for (i = 1; i <= n; i++) {
char tmp[15];
scanf("%s", tmp);
if (tmp[0] == '?')
ques[i] = 1;
else {
a[i] = toInt(tmp);
}
}
for (i = 1; i <= n; i++) {
if (!ques[i]) continue;
if (i - k >= 1)
dfs(0, i, a[i - k] + 1);
else
dfs(0, i, -2000000050);
}
for (i = 1; i + k <= n; i++) {
if (a[i] >= a[i + k]) {
flag = 1;
break;
}
}
if (flag)
puts("Incorrect sequence");
else
for (i = 1; i <= n; i++) {
printf("%d ", a[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100010];
bool mark[100010];
bool fill(const vector<int> &position, int low, int high) {
if (low >= high) return false;
if (position.empty()) return true;
if (low + 1 >= high) return false;
deque<int> values;
if (low < 0 && high > 0) {
values.push_back(0);
while (values.size() < position.size()) {
if (values.back() + 1 >= high && values.front() - 1 <= low)
return false;
else if (values.front() - 1 <= low ||
(values.back() + 1 < high && values.back() <= -values.front()))
values.push_back(values.back() + 1);
else
values.push_front(values.front() - 1);
}
} else if (high <= 0) {
values.push_front(high - 1);
while (values.size() < position.size()) {
if (values.front() - 1 <= low) return false;
values.push_front(values.front() - 1);
}
} else {
values.push_back(low + 1);
while (values.size() < position.size()) {
if (values.back() + 1 >= high) return false;
values.push_back(values.back() + 1);
}
}
for (int i = 0; i < position.size(); i++) a[position[i]] = values[i];
return true;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
if (s == "?")
mark[i] = true;
else
a[i] = strtol(s.c_str(), 0, 10);
}
for (int i = 1; i <= k; i++) {
int low = -2e9;
vector<int> position;
for (int j = i;; j += k) {
if (j > n || !mark[j]) {
int high;
if (j <= n)
high = a[j];
else
high = 2e9;
if (!fill(position, low, high)) {
cout << "Incorrect sequence\n";
return 0;
}
position.clear();
low = high;
if (j > n) break;
} else
position.push_back(j);
}
}
for (int i = 1; i <= n; i++) cout << a[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = (int)1e9;
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
int n, k;
int arr[100005];
bool fix(int prvIdx, int lastIdx, int prvVal, int lastVal) {
int cnt = 0;
for (int i = prvIdx + k; i < lastIdx; i += k) cnt++;
if ((long long)lastVal - prvVal - 1 < cnt) return false;
if (prvVal >= 0) {
for (int i = prvIdx + k, j = 1; j <= cnt; j++, i += k) {
arr[i] = prvVal + j;
}
} else if (lastVal <= 0) {
for (int i = prvIdx + k, j = cnt; j >= 1; j--, i += k) {
arr[i] = lastVal - j;
}
} else {
set<int> st;
for (int i = 0; i < cnt; i++) {
if (-i > prvVal) st.insert(-i);
if (((int)st.size()) == cnt) break;
if (i < lastVal) st.insert(i);
if (((int)st.size()) == cnt) break;
}
int i = prvIdx + k;
for (__typeof(st.begin()) it = st.begin(); it != st.end(); ++it) {
arr[i] = (*it);
i += k;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
bool question[100005] = {};
string s;
cin >> n >> k;
for (int i = 0; i < (int)(n); ++i) {
cin >> s;
if (s == "?")
question[i] = true;
else
arr[i] = atoi(s.c_str());
}
for (int i = 0; i < k; i++) {
int prvVal = -oo - 100005;
int prvIdx = i - k;
for (int j = i; j < n; j += k) {
if (!question[j]) {
if (!fix(prvIdx, j, prvVal, arr[j])) {
cout << "Incorrect sequence" << endl;
return 0;
}
prvIdx = j;
prvVal = arr[j];
}
}
if (!fix(prvIdx, n, prvVal, oo + 100001)) {
cout << "Incorrect sequence" << endl;
return 0;
}
}
for (int i = 0; i < n; i++)
if (i >= k && arr[i] <= arr[i - k]) {
cout << "Incorrect sequence" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
cout << arr[i] << " \n"[i == n - 1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v[2][100005];
int a[100005], cnt[100005];
int main() {
int n, k, i, j, x, bg;
while (cin >> n >> k) {
string s;
for (i = 0; i < n; i++) {
v[0][i].push_back(-1100000000LL);
v[1][i].push_back(0);
}
for (i = 0; i < n; i++) {
cin >> s;
if (s == "?")
v[1][i % k][v[1][i % k].size() - 1]++;
else {
a[i] = atoi(s.c_str());
v[0][i % k].push_back((long long)a[i]);
v[1][i % k].push_back(0);
}
}
for (i = 0; i < n; i++) v[0][i].push_back(1100000000LL);
int f = 0;
for (i = 0; i < k; i++) {
int tmp = 0;
for (j = 0; j < v[0][i].size() - 1; j++) {
if (v[0][i][j + 1] - v[0][i][j] - 1 < v[1][i][j]) {
f = 1;
break;
}
tmp++;
if (v[0][i][j] >= 0)
bg = v[0][i][j] + 1;
else if (v[0][i][j + 1] <= 0)
bg = v[0][i][j + 1] - v[1][i][j];
else {
if (2 * min(abs(v[0][i][j]), abs(v[0][i][j + 1])) - 1 >= v[1][i][j])
bg = -(v[1][i][j] - 1) / 2;
else if (abs(v[0][i][j]) < abs(v[0][i][j + 1]))
bg = v[0][i][j] + 1;
else
bg = v[0][i][j + 1] - v[1][i][j];
}
for (x = tmp; x < tmp + v[1][i][j]; x++) {
a[i + (x - 1) * k] = bg++;
}
tmp += v[1][i][j];
}
}
if (f)
cout << "Incorrect sequence" << endl;
else {
for (i = 0; i < n; i++) {
cout << a[i];
if (i < n - 1)
cout << " ";
else
cout << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
int n, k;
string s[300005];
long long strToll(string s) {
int fl = 0;
if (s[0] == '-') fl = 1;
long long tmp = 0;
for (int i = fl; i < ((int)(s).size()); ++i) {
tmp *= 10;
tmp += (long long)(s[i] - '0');
}
if (fl) tmp *= -1;
return tmp;
}
string llToString(long long x) {
long long fl = 0;
if (x < 0) x *= -1, fl = 1;
string lol = "";
if (x == 0) return "0";
while (x) {
lol += (char)('0' + (x % 10));
x /= 10;
}
reverse(lol.begin(), lol.end());
if (fl) lol = "-" + lol;
return lol;
}
void haha() {
cout << "Incorrect sequence" << endl;
exit(0);
}
void solve(int off) {
int last = off;
long long li = strToll(s[last]);
for (int i = off + k; i < n + 2 * k; i += k) {
if (s[i] != "?") {
long long si = strToll(s[i]);
long long dif = si - li;
if (dif < (i - last) / k) {
haha();
}
if (li >= 0) {
long long pt = li + 1;
for (int j = last + k; j < i; j += k) {
s[j] = llToString(pt);
pt++;
}
} else if (si <= 0) {
long long pt = si - 1;
for (int j = i - k; j > last; j -= k) {
s[j] = llToString(pt);
pt--;
}
} else {
long long l = -1;
long long r = 0;
vector<long long> vec;
long long d = (i - last - 1);
d /= k;
for (int j = 0; j < (d); ++j) {
if (abs(l) < abs(r) && l > li || r == si) {
vec.push_back(l), l--;
} else {
vec.push_back(r), r++;
}
}
sort(vec.begin(), vec.end());
for (int j = 0; j < ((int)(vec).size()); ++j) {
s[last + k * (1 + j)] = llToString(vec[j]);
}
}
last = i;
li = si;
}
}
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
cin >> n >> k;
string lol = "2000000001";
int pt = 0;
for (int i = 0; i < (k); ++i) s[pt] = "-" + lol, pt++;
for (int i = 0; i < (n); ++i) cin >> s[pt], pt++;
for (int i = 0; i < (k); ++i) s[pt] = lol, pt++;
for (int i = 0; i < (k); ++i) {
solve(i);
}
for (int i = 0; i < (n); ++i) {
cout << s[k + i] << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(423978);
const long long mod = 1e9 + 7;
const int mn = 3e5 + 10;
const int inf = 0x3f3f3f3f;
int a[mn];
void die() {
printf("Incorrect sequence");
exit(0);
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = k; i < n + k; i++) {
string s;
cin >> s;
if (s == "?")
a[i] = inf;
else
a[i] = stoi(s);
}
for (int i = 0; i < k; i++) a[i] = 0xc0c0c0c0;
for (int i = n + k; i < n + 2 * k; i++) a[i] = 0x3f3f3f3e;
for (int i = 0; i < k; i++) {
int lv = i;
for (int j = i + k; j < n + 2 * k; j += k) {
if (a[j] != inf) {
if (a[j] - a[lv] < (j - lv) / k) die();
int len = (j - lv) / k - 1;
int lo = a[lv] + 1, hi = a[j] - len;
int bes2 = -len + 1;
int u = 0;
if (lo <= bes2 / 2 && bes2 / 2 <= hi)
u = bes2 / 2;
else if (abs(bes2 - 2LL * lo) < abs(bes2 - 2LL * hi))
u = lo;
else
u = hi;
for (int l = lv + k; l < j; l += k) a[l] = u++;
lv = j;
}
}
}
for (int i = k; i < n + k; i++) printf("%d ", a[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Iter>
ostream& _out(ostream& s, Iter a, Iter b) {
for (auto it = a; it != b; it++) s << (it == a ? "" : " ") << *it;
return s;
}
template <typename A, typename B>
ostream& operator<<(ostream& s, pair<A, B>& p) {
return s << "(" << p.first << " , " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, vector<T>& v) {
return _out(s, v.begin(), v.end());
}
inline long long rit() {
int key = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') key = -1;
c = getchar();
}
long long x = 0;
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x * key;
}
int __ = 1;
void init() {}
void read() {}
void solve() {}
vector<int> G[100010];
vector<int> get_val(int l, int r, int cnt) {
vector<int> box;
if (l >= 0 && r >= 0) {
for (int i = 0; i < cnt; i++) box.push_back(l + i + 1);
}
if (l <= 0 && r <= 0) {
for (int i = 0; i < cnt; i++) box.push_back(r - i - 1);
reverse(box.begin(), box.end());
}
if (r > 0 && l < 0) {
int pos = cnt / 2;
if (-pos <= l) pos -= l + pos + 1;
if (cnt - pos - 1 >= r) pos += cnt - pos - 1 - r + 1;
int start = -pos;
for (int i = 0; i < cnt; i++) box.push_back(start + i);
}
return box;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) G[i].push_back(-0x3f3f3f3f);
for (int i = 0; i < n; i++) {
int pos = i % k;
string s;
int x;
cin >> s;
if (s == "?")
x = -0x3f3f3f3f - 1;
else {
stringstream ss(s);
ss >> x;
}
G[pos].push_back(x);
}
for (int i = 0; i < k; i++) G[i].push_back(0x3f3f3f3f);
for (int i = 0; i < k; i++) {
for (int j = 1; j < G[i].size() - 1; j++) {
if (G[i][j] == -0x3f3f3f3f - 1) {
int id = j;
while (id + 1 < G[i].size() - 1 && G[i][id + 1] == -0x3f3f3f3f - 1)
id++;
vector<int> v = get_val(G[i][j - 1], G[i][id + 1], id - j + 1);
for (int k = j; k <= id; k++) G[i][k] = v[k - j];
}
}
}
int ok = 1;
for (int i = 0; i < k; i++)
for (int j = 1; j < G[i].size() - 1; j++) {
if (G[i][j] == -0x3f3f3f3f - 1 || G[i][j] <= G[i][j - 1]) ok = 0;
}
if (ok == 0) {
printf("Incorrect sequence\n");
return 0;
}
for (int i = 0; i < k; i++) {
reverse(G[i].begin(), G[i].end());
G[i].pop_back();
}
int now = 0;
for (int i = 0; i < n; i++) {
printf("%d ", G[now].back());
G[now].pop_back();
now = (now + 1) % k;
}
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001000000;
int main() {
int n, k;
cin >> n >> k;
int* A = new int[n];
bool* B = new bool[n];
string s;
int js, jf, vs, vf;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == '?') {
B[i] = 1;
} else {
B[i] = 0;
A[i] = stoi(s);
}
}
for (int i = 0; i < k; i++) {
js = i - k;
vs = -INF;
int j;
for (j = i; j < n; j += k)
if (!B[j]) {
vf = A[j];
jf = j;
int jn = ((jf - js) / k);
if ((vf - vs) < jn) {
cout << "Incorrect sequence";
return 0;
}
if (jn > 1)
if (-(jn - 1) / 2 < vs + 1)
for (int t = js + k; t < jf; t += k) {
A[t] = vs + (t - js) / k;
}
else if ((jn - 2) / 2 > vf - 1)
for (int t = jf - k; t > js; t -= k) {
A[t] = vf - (jf - t) / k;
}
else
for (int t = js + k; t < jf; t += k) {
A[t] = -(jn - 1) / 2 + (t - js) / k - 1;
}
vs = A[j];
js = j;
}
jf = j;
vf = INF;
int jn = ((jf - js) / k);
if ((vf - vs) < jn) {
cout << "Incorrect sequence";
return 0;
}
if (jn > 1)
if (-(jn - 1) / 2 < vs + 1)
for (int t = js + k; t < jf; t += k) {
A[t] = vs + (t - js) / k;
}
else if ((jn - 2) / 2 > vf - 1)
for (int t = jf - k; t > js; t -= k) {
A[t] = vf - (jf - t) / k;
}
else
for (int t = js + k; t < jf; t += k) {
A[t] = -(jn - 1) / 2 + (t - js) / k - 1;
}
}
for (int i = 0; i < n; i++) cout << A[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, k;
int vis[N];
int pos[N];
long long a[N];
long long ABS(long long x) { return x < 0 ? -x : x; }
int get(int len, long long down, long long up, int t) {
if (t == 1) {
long long be = -len / 2 + len;
if (be < up)
return -len / 2;
else
return up - len;
} else if (t == -1) {
long long be = len / 2 - len + 1;
if (be > down)
return be;
else
return down + 1;
} else {
long long be = -len / 2;
long long tot1 = 0, tot2 = 0, tot3 = 0, now1 = down + 1, now2 = up - 1;
for (int i = 0; i < len; i++) tot1 += ABS(now1), now1++;
for (int i = 0; i < len; i++) tot2 += ABS(now2), now2--;
if (down < be && -be < up) {
for (int i = 0; i < len; i++) tot3 += be, be++;
} else
tot3 = 1LL << 50;
if (tot1 <= tot2 && tot1 <= tot3) return down + 1;
if (tot2 <= tot1 && tot2 <= tot3) return now2 + 1;
if (tot3 <= tot1 && tot3 <= tot2) return -len / 2;
}
}
bool work(int be) {
int cnt = 0, num = 0;
for (int i = be; i <= n; i += k) {
pos[++cnt] = i;
if (vis[i]) num++;
}
if (num == 0) {
for (int i = be + k; i <= n; i += k)
if (a[i] <= a[i - k]) return false;
return true;
}
if (cnt == num) {
int st = -cnt / 2;
for (int i = be; i <= n; i += k)
if (vis[i]) a[i] = st++;
} else {
if (vis[be]) {
int len = 0;
long long up;
for (int i = be; i <= n; i += k)
if (!vis[i]) {
up = a[i];
len = i - k;
break;
}
long long st = get((len - be) / k + 1, 0, up, 1);
for (int i = be; i <= len; i += k)
if (vis[i]) a[i] = st++;
}
if (vis[pos[cnt]]) {
int len = 0;
long long down;
for (int i = cnt; i >= 1; i--) {
int in = pos[i];
if (!vis[in]) {
down = a[in];
len = i;
break;
}
}
long long st = get(cnt - len, down, 0, -1);
for (int i = len + 1; i <= cnt; i++)
if (vis[pos[i]]) a[pos[i]] = st++;
}
int last = 1;
for (int i = 2; i <= cnt; i++) {
int in = pos[i], on = pos[last];
if (!vis[in]) {
if (a[in] - a[on] - 1 < i - last - 1) {
return false;
}
long long st = get(i - last - 1, a[on], a[in], 0);
for (int j = last + 1; j < i; j++)
if (vis[pos[j]]) a[pos[j]] = st++;
last = i;
}
}
}
return true;
}
int main() {
scanf("%d%d", &n, &k);
memset(a, 0, sizeof(a));
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
char s[15];
scanf("%s", s);
if (s[0] == '?')
vis[i]++;
else
sscanf(s, "%I64d", &a[i]);
}
int flag = 0;
for (int i = 1; i <= k && !flag; i++)
if (!work(i)) flag = 1;
if (flag)
puts("Incorrect sequence");
else {
for (int i = 1; i <= n; i++) {
if (i != 1) printf(" ");
cout << a[i];
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rnd(long long l, long long r) { return l + rng() % (r - l + 1); }
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
const long long N = 2e5 + 10;
long long a[N], n, k;
void GGWP() {
cout << "Incorrect sequence";
exit(0);
}
void solve(long long st) {
vector<tuple<long long, long long, long long, long long>> v;
long long l, r, lval = -1e9, rval, max_pos, last = -1e9 - 1;
max_pos = st + ((n - st) / k) * k;
for (long long i = st; i <= n; i += k) {
if (a[i] == 1e10) {
l = i;
while (a[i] == 1e10 && i <= n) {
r = i;
i += k;
}
i -= k;
if (l == st)
lval = -2e9;
else
lval = a[l - k] + 1;
if (r == max_pos)
rval = 2e9;
else
rval = a[r + k] - 1;
v.push_back(make_tuple(l, r, lval, rval));
} else {
if (a[i] <= last) GGWP();
last = a[i];
}
}
for (auto& tmp : v) {
tie(l, r, lval, rval) = tmp;
if (rval - lval + 1 < (r - l) / k + 1) GGWP();
if (lval >= 0)
for (long long i = l; i <= r; i += k) a[i] = lval++;
else if (rval <= 0)
for (long long i = r; i >= l; i -= k) a[i] = rval--;
else {
long long l_val = -(((r - l) / k + 1) / 2);
long long r_val = ((r - l) / k + 1) + l_val - 1;
if (l_val < lval)
l_val = lval;
else if (rval < r_val)
l_val -= (r_val - rval);
for (long long i = l; i <= r; i += k) a[i] = l_val++;
}
}
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
;
cin >> n >> k;
for (long long i = 1, _c = n; i <= _c; ++i) {
string s;
cin >> s;
if (s == "?")
a[i] = 1e10;
else
a[i] = stoi(s);
}
for (long long i = 1, _c = k; i <= _c; ++i) solve(i);
for (long long i = 1, _c = n; i <= _c; ++i) cout << a[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long a[300002];
bool b[300002];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
if (s == "?") {
b[i] = true;
} else {
int t = 0;
if (s[0] == '-') {
t = 1;
}
for (int j = t; j < (int)s.size(); j++) {
a[i] *= 10LL;
a[i] += s[j] - '0';
}
if (t) {
a[i] *= -1LL;
}
}
}
a[0] = -30000000000LL - 1;
for (int i = n + 1; i <= 3 * n; i++) {
a[i] = 30000000000LL + 1LL;
}
for (int i = 1; i <= k; i++) {
int g = i;
for (int j = i; j <= n + k; j += k) {
if (!b[j] && j != g) {
if (a[j] <= a[g] && j <= n && !b[g]) {
cout << "Incorrect sequence" << endl;
return 0;
}
if (b[g]) {
if (a[j] >= 0LL) {
vector<int> v;
vector<int> v1;
long long t = (min(j, n) - g) / k + 1;
for (int g1 = 0; g1 <= t && (int)v.size() + (int)v1.size() < t;
g1++) {
if (g1 == 0) {
v1.push_back(0);
} else {
if (g1 < a[j]) {
v1.push_back(g1);
}
if ((int)v.size() + (int)v1.size() == t) {
break;
}
v.push_back(-g1);
}
}
int l = 0;
for (int g1 = g; g1 < j; g1 += k) {
if ((int)v.size() > 0) {
a[g1] = v.back();
v.pop_back();
} else {
a[g1] = v1[l];
l++;
}
}
} else {
for (int g1 = j - k; g1 >= g; g1 -= k) {
a[g1] = a[g1 + k] - 1LL;
}
}
} else {
if (a[j] - a[g] - 1LL < (long long)(j - g - 1LL) / (long long)k &&
j <= n) {
cout << "Incorrect sequence" << endl;
return 0;
}
if (j != g + k) {
if (a[g] >= 0LL && a[j] >= 0LL) {
for (int g1 = g + k; g1 < j; g1 += k) {
a[g1] = a[g1 - k] + 1LL;
}
} else {
if (a[j] >= 0LL) {
vector<int> v;
vector<int> v1;
long long t = (min(j, n) - g) / k;
for (int g1 = 0; g1 <= t && (int)v.size() + (int)v1.size() < t;
g1++) {
if (g1 == 0) {
v1.push_back(0);
} else {
if (g1 < a[j]) {
v1.push_back(g1);
}
if ((int)v.size() + (int)v1.size() == t) {
break;
}
if (-g1 > a[g]) {
v.push_back(-g1);
}
}
}
int l = 0;
for (int g1 = g + k; g1 < j; g1 += k) {
if ((int)v.size() > 0) {
a[g1] = v.back();
v.pop_back();
} else {
a[g1] = v1[l];
l++;
}
}
} else {
for (int g1 = j - k; g1 > g; g1 -= k) {
a[g1] = a[g1 + k] - 1LL;
}
}
}
}
}
g = j;
}
if (!b[j]) {
g = j;
}
}
}
for (int i = 1; i <= n; i++) {
cout << a[i] << ' ';
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
const double EULER = 0.57721566490153286060651209;
const double PI = 3.14159265358979323846264338328;
const double E = 2.718281828459045235360287471352;
using namespace std;
long long a[100005];
bool b[100005];
long long c[100005];
int cnt;
const long long nega = -2e18;
const long long posi = 2e18;
int main() {
long long res;
int n, k;
cin.sync_with_stdio(false);
cin >> n >> k;
cin.get();
char ch;
for (int i = 0; i < n; i++) {
if (cin.peek() == '?') {
b[i] = true;
cin.get();
cin.get();
} else {
ch = cin.get();
bool neg = ch == '-';
if (neg) ch = cin.get();
res = 0;
while (ch != ' ' && ch != '\n') {
res *= 10;
res += ch - '0';
ch = cin.get();
}
a[i] = (neg) ? -res : res;
}
}
for (int i = 0; i < k; i++) {
cnt = 0;
int len = 0, last;
for (int j = i; j < n; j += k) {
len++;
if (j + k >= n) {
last = j;
}
if (b[j]) {
cnt++;
} else {
if (cnt == 0) {
if (j >= k && a[j] <= a[j - k]) {
puts("Incorrect sequence");
return 0;
}
} else {
long long l = (j < (cnt + 1) * k) ? nega : a[j - cnt * k - k];
long long r = a[j];
if (r - l <= cnt) {
puts("Incorrect sequence");
return 0;
} else {
if (l >= -cnt / 2) {
for (int p = j - cnt * k; p < j; p += k) {
a[p] = ++l;
}
} else if (r <= cnt / 2) {
for (int p = j - k; p >= j - cnt * k; p -= k) {
a[p] = --r;
}
} else {
l = -cnt / 2 - 1;
for (int p = j - cnt * k; p < j; p += k) {
a[p] = ++l;
}
}
}
}
cnt = 0;
}
}
if (cnt) {
int j = last + k;
long long l = (len == cnt) ? nega : a[j - cnt * k - k];
if (l >= -cnt / 2) {
for (int p = j - cnt * k; p < j; p += k) {
a[p] = ++l;
}
} else {
l = -cnt / 2 - 1;
for (int p = j - cnt * k; p < j; p += k) {
a[p] = ++l;
}
}
}
}
for (int i = 0; i < n - 1; i++) {
cout << a[i] << ' ';
}
cout << a[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long LINF = (long long)1e18;
const int INF = (int)1e9 + 7;
const int N = (int)1e6 + 7;
const double EPS = (double)1e-9;
const double PI = (double)3.14159265359;
const int MODULO[6] = {INF, 1000019677, 1000019393,
1000007521, 1000024073, 1000009667};
const int PF[5] = {77, 31, 98, 45, 67};
const int nx[4] = {0, 0, 1, -1};
const int ny[4] = {1, -1, 0, 0};
inline bool eq(const long double &a, const long double &b) {
return fabs(a - b) < EPS;
}
int n, k;
string a[N];
int b[N];
long long second[N];
inline int to_int(const string &x) {
int ret = 0;
for (int i = (x[0] == '-' ? 1 : 0); i < x.size(); i++)
ret = ret * 10 + (x[i] - 48);
if (x[0] == '-') ret *= -1;
return ret;
}
inline string str(int x) {
bool neg = (x < 0);
x = abs(x);
string st = "";
while (x) {
st += (x % 10) + '0';
;
x /= 10;
}
if (neg) st += "-";
reverse(st.begin(), st.end());
return st;
}
inline bool impossible() {
for (int i = 1; i <= n; i++) second[i] = second[i - 1] + b[i];
vector<long long> all;
for (int i = 1; i + k - 1 <= n; i++)
all.push_back(second[i + k - 1] - second[i - 1]);
for (int i = 0; i + 1 < all.size(); i++)
if (all[i] >= all[i + 1]) return true;
return false;
}
inline void update(int l, int r) {
int mn = (l > k ? b[l - k] + 1 : -2 * INF),
mx = (r + k <= n ? b[r + k] - 1 : 2 * INF);
int sz = (r - l) / k + 1;
if (mn <= -(sz / 2) && sz / 2 <= mx) {
sz = -(sz / 2);
for (int i = l; i <= r; i += k) b[i] = sz++;
} else {
long long fi = 0ll, se = 0ll;
for (int i = r; i >= l; i -= k) fi += abs(mx - (r - i) / k);
for (int i = l; i <= r; i += k) se += abs(mn + (i - l) / k);
if (fi < se)
for (int i = r; i >= l; i -= k) b[i] = mx - (r - i) / k;
else
for (int i = l; i <= r; i += k) b[i] = mn + (i - l) / k;
}
}
int main() {
srand(time(NULL));
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] == "?") {
if (i > k)
b[i] = b[i - k] + 1;
else
b[i] = -INF;
} else
b[i] = to_int(a[i]);
}
for (int i = 1; i <= k; i++) {
vector<int> id;
for (int j = i; j <= n; j += k) id.push_back(j);
int last = (a[i] == "?" ? i : INF);
for (auto it : id) {
if (a[it] != "?") {
if (last <= it - k) update(last, it - k);
last = it + k;
}
}
if (a[id.back()] == "?") {
if (last <= id.back()) update(last, id.back());
}
}
if (impossible()) {
cout << "Incorrect sequence";
return 0;
}
for (int i = 1; i <= n; i++) cout << b[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
bool solve(vector<int> &v) {
int sz = v.size();
for (int i = 0; i < sz - 1; i++)
if (v[i] != 2000000000 && v[i + 1] != 2000000000 && v[i + 1] <= v[i])
return 0;
for (int i = 0; i < sz - 1; i++)
if (v[i + 1] == 2000000000) {
int j;
for (j = i + 1; j < sz && v[j] == 2000000000; j++)
;
int num = j - i - 1;
if (v[i] + num >= v[j]) return 0;
if (v[j] <= 1)
for (int z = i + 1; z < j; z++) v[z] = z - j + v[j];
else if (v[i] >= -1)
for (int z = i + 1; z < j; z++) v[z] = z - i + v[i];
else {
int l = 0, r = 0;
num--;
while (num--) {
if (r == v[j] - 1 || (r + l > 0 && l > v[i] + 1))
l--;
else
r++;
}
for (int z = i + 1; z < j; z++) v[z] = z - i - 1 + l;
}
}
return 1;
}
int n, k;
int a[maxn];
vector<int> tmp;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
char s[20];
scanf("%s", s);
if (s[0] == '?')
a[i] = 2000000000;
else
sscanf(&s[0], "%d", &a[i]);
}
for (int i = 1; i <= k; i++) {
tmp.clear();
tmp.push_back(-2000000000 + 1);
for (int j = i; j <= n; j += k) tmp.push_back(a[j]);
tmp.push_back(2000000000 - 1);
if (!solve(tmp)) {
printf("Incorrect sequence\n");
return 0;
}
for (int j = i, cnt = 0; j <= n; j += k) a[j] = tmp[++cnt];
}
for (int i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}
|
#include <bits/stdc++.h>
using namespace std;
namespace {
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
void mainmain() {
const long long QUESTION = 1020000000;
const int INF = 1010101010;
int n, k;
scanf("%d%d", &n, &k);
vector<int> as(n, QUESTION);
for (int i = 0; i < n; ++i) {
if (scanf("%d", &as[i]) != 1) {
scanf("%*s");
}
}
for (int z = 0; z < k; ++z) {
vector<int> v(1, -INF);
for (int j = z; j < n; j += k) {
v.push_back(as[j]);
}
v.push_back(INF);
for (int l = 0; l + 1 < (int)v.size();) {
int r;
for (r = l + 1; v[r] == QUESTION; ++r)
;
int d = r - l - 1;
if (v[r] - v[l] <= d) {
puts("Incorrect sequence");
return;
}
int t = -((d - 1) >> 1);
int u = t + d - 1;
if (u >= v[r]) {
u = v[r] - 1;
t = u - d + 1;
} else if (t <= v[l]) {
t = v[l] + 1;
u = t + d - 1;
}
for (int i = 0; i < d; ++i) {
v[l + 1 + i] = t + i;
}
l = r;
}
for (int i = 1; i + 1 < (int)v.size(); ++i) {
as[(i - 1) * k + z] = v[i];
}
}
for (int i = 0; i < n; ++i) {
printf("%d%c", as[i], i + 1 == n ? '\n' : ' ');
}
}
} // namespace
int main() try {
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
} catch (...) {
}
|
#include <bits/stdc++.h>
using namespace std;
long long q = -3000000002;
int n, k;
int solve(vector<long long> &v) {
int prev = 0;
for (int ii = 1; ii < v.size(); ii++) {
if (v[ii] == q) continue;
if (ii - prev > v[ii] - v[prev]) return 0;
if (v[prev] >= 0) {
for (int jj = 1; jj < ii - prev; jj++) {
v[prev + jj] = v[prev] + jj;
}
} else if (v[ii] <= 0) {
for (int jj = 1; ii - jj > prev; jj++) {
v[ii - jj] = v[ii] - jj;
}
} else {
int d = (ii - prev - 1) / 2 + (ii - prev - 1) % 2;
if (v[ii] <= d) {
for (int jj = 1; ii - jj > prev; jj++) {
v[ii - jj] = v[ii] - jj;
}
} else if (v[prev] >= -d) {
for (int jj = 1; jj < ii - prev; jj++) {
v[prev + jj] = v[prev] + jj;
}
} else {
for (int jj = 1; jj < ii - prev; jj++) {
v[prev + jj] = -d + jj;
}
}
}
prev = ii;
}
return 1;
}
int main() {
long long seq[100007];
vector<long long> vs[100007];
cin >> n >> k;
for (int ii = 0; ii < n; ii++) {
string s;
cin >> s;
if (s == "?") {
seq[ii] = q;
} else {
seq[ii] = atoi(s.c_str());
}
}
for (int ii = 0; ii < k; ii++) {
vs[ii].push_back(q + 1);
for (int jj = 0; ii + jj * k < n; jj++) {
vs[ii].push_back(seq[ii + jj * k]);
}
vs[ii].push_back(-(q + 1));
if (solve(vs[ii]) == 0) {
cout << "Incorrect sequence" << endl;
return 0;
}
}
int ii = 1;
while (true) {
int printed = 0;
for (int jj = 0; jj < k; jj++) {
if (ii < vs[jj].size() - 1) {
cout << vs[jj][ii] << " ";
printed = 1;
}
}
ii++;
if (!printed) break;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = (1 << 20);
int to_number(string str) {
int ret = 0, st = 0;
if (str[0] == '-') st = 1;
for (int j = st; j < str.length(); j++) ret *= 10, ret += str[j] - '0';
if (st) ret *= -1;
return ret;
}
int n, arr[MX], K, q = 0, pref = 0;
string tt;
bool is[MX];
void process(int st, vector<pair<int, int> > v) {
int sz = (n - st) / K;
if (v.empty()) {
int V = -1 * sz / 2;
for (int j = st; j <= n; j += K) arr[j] = V++;
return;
}
int dif = (v[0].first - st) / K;
int V = min(v[0].second - 1, dif / 2);
for (int j = v[0].first - K; j > 0; j -= K) {
arr[j] = V--, is[j] = 0;
}
int omar = v.size(), med, D;
for (int j = 1; j < omar; j++) {
dif = (v[j].first - v[j - 1].first) / K;
if (dif - 1 > abs(v[j].second - v[j - 1].second)) {
puts("Incorrect sequence");
exit(0);
}
if (dif == 1) continue;
med = v[j - 1].first + (dif / 2 + dif % 2) * K;
arr[med] = 0;
for (int i = med + K; i < v[j].first; i += K) arr[i] = arr[i - K] + 1;
for (int i = med - K; i > v[j - 1].first; i -= K) arr[i] = arr[i + K] - 1;
D = min(0, arr[v[j].first] - arr[v[j].first - K] - 1);
if (!D) D = max(D, arr[v[j - 1].first] - arr[v[j - 1].first + K] + 1);
for (int i = v[j - 1].first + K; i < v[j].first; i += K) arr[i] += D;
}
dif = (n - v[omar - 1].first) / K;
V = max(v[omar - 1].second + 1, -1 * dif / 2);
for (int j = v[omar - 1].first + K; j <= n; j += K) arr[j] = V++, is[j] = 0;
}
int main() {
cin >> n >> K;
for (int j = 1; j <= n; j++) {
cin >> tt;
if (tt == "?")
is[j] = 1, q++;
else
arr[j] = to_number(tt);
}
for (int j = K + 1; j <= n; j++) {
if (is[j] || is[j - K]) continue;
if (arr[j] <= arr[j - K]) {
puts("Incorrect sequence");
return 0;
}
}
for (int j = 1; j <= K; j++) {
vector<pair<int, int> > v;
int ss = 1;
for (int i = j; i <= n; i += K) {
if (!is[i]) {
v.push_back(make_pair(i, arr[i]));
}
}
process(j, v);
}
for (int j = K + 1; j <= n; j++) {
if (is[j] && is[j - K]) continue;
if (arr[j] <= arr[j - K]) {
puts("Incorrect sequence");
return 0;
}
}
for (int j = 1; j <= n; j++) cout << arr[j] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, ad, a[444444], u[444444];
char str[11];
int getnum(char str[]) {
int ret = 0, neg = -1, i = 1;
if (str[0] != '-') {
neg = 1;
i = 0;
}
for (; str[i]; i++) {
ret = ret * 10 + str[i] - '0';
}
ret *= neg;
return ret;
}
int main() {
int i, j, fg = 0, nd, pd, ll, lt, rt, ds, mid, ld;
cin >> n >> k;
ad = k;
for (i = 1; i <= n; i++) {
scanf("%s", str);
if (str[0] == '?')
a[i + ad] = 1;
else
u[i + ad] = getnum(str);
}
for (i = 1; i <= ad; i++) {
u[i] = -1010000000 + i;
u[ad + n + i] = 1010000000 + i;
}
for (i = 1; i <= k; i++) {
if (fg) break;
nd = pd = -1;
ll = u[i];
for (j = i + k; j <= n + 2 * ad; j += k) {
if (a[j]) continue;
if (u[j] <= ll) {
fg = 1;
break;
}
ll = u[j];
}
if (fg) break;
for (j = i; j <= n + 2 * ad; j += k) {
if (pd == -1 && !a[j] && u[j] >= 0) {
pd = j;
break;
}
}
for (j = pd; j >= 1; j -= k) {
if (nd == -1 && !a[j] && u[j] < 0) {
nd = j;
break;
}
}
for (j = pd + k; j <= n + 2 * ad; j += k) {
ld = j - k;
if (!a[j]) {
if (u[ld] >= u[j]) fg = 1;
continue;
}
if (fg) break;
a[j] = 0;
u[j] = u[ld] + 1;
}
if (fg) break;
for (j = nd - k; j >= 1; j -= k) {
ld = j + k;
if (!a[j]) {
if (u[j] >= u[ld]) fg = 1;
continue;
}
if (fg) break;
a[j] = 0;
u[j] = u[ld] - 1;
}
mid = (pd - nd) / k - 1;
if (mid > u[pd] - u[nd]) {
fg = 1;
break;
}
lt = -((mid - 1) / 2);
rt = mid / 2;
if (u[pd] <= rt) {
ds = rt - u[pd] + 1;
rt -= ds;
lt -= ds;
}
if (u[nd] >= lt) {
ds = u[nd] - lt + 1;
rt += ds;
lt += ds;
}
for (j = nd + k; j < pd; j += k) {
u[j] = lt;
lt++;
}
}
if (fg)
puts("Incorrect sequence");
else {
for (i = k + 1; i <= k + n; i++) printf("%d ", u[i]);
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9 + 1e6;
const int UN = 1e9 + 1e7;
void wa() {
cout << "Incorrect sequence";
exit(0);
}
int main() {
int n, k;
cin >> n >> k;
int arr[n + 2 * k];
for (int i = 0; i < k; i++) arr[i] = -OO + i;
for (int i = n + k; i < n + 2 * k; i++) arr[i] = OO + i - n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s == "?")
arr[i + k] = UN;
else
arr[i + k] = atoi(s.c_str());
}
for (int i = 0; i < k; i++) {
int ln, fp;
ln = -1;
fp = -1;
for (int j = i; j < n + 2 * k; j += k) {
if (arr[j] != UN) {
if (arr[j] < 0)
ln = j;
else if (fp == -1)
fp = j;
}
}
if (ln > fp) wa();
int avail = arr[fp] - arr[ln] - 1;
int num = (fp - ln) / k - 1;
if (num > avail) wa();
int st = -(num / 2);
int en = num / 2;
if (num % 2 == 0) st++;
if (en > arr[fp] - 1) st = arr[fp] - 1 - num + 1, en = st + num - 1;
if (st < arr[ln] + 1) st = arr[ln] + 1, en = st + num - 1;
for (int j = ln + k; j < fp; j += k) arr[j] = st - 1 + (j - ln) / k;
int prev = arr[ln];
for (int j = ln; j >= 0; j -= k) {
if (arr[j] == UN) {
arr[j] = prev;
prev--;
} else if (arr[j] > prev) {
wa();
} else {
prev = arr[j] - 1;
}
}
prev = arr[fp];
for (int j = fp; j < n + 2 * k; j += k) {
if (arr[j] == UN) {
arr[j] = prev;
prev++;
} else if (arr[j] < prev) {
wa();
} else {
prev = arr[j] + 1;
}
}
}
for (int i = k; i < n + k; i++) {
printf("%d ", arr[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
string a[100001];
int ai[100001];
bool replace(int n, int k, int pos) {
int cnt = 0, i = pos;
while (i < n and a[i] == "?") {
cnt++;
a[i] = "x";
i += k;
}
int l, u;
pos >= k ? l = ai[pos - k] + 1 : l = -2000000000;
i < n ? u = ai[i] - cnt : u = 2000000000;
if (u < l) return false;
int m;
if (l >= -cnt / 2) {
m = l;
} else {
if (u <= -cnt / 2) {
m = u;
} else {
m = -cnt / 2;
}
}
for (int i = 0; i < cnt; i++) ai[pos + i * k] = m + i;
return true;
}
bool solve(int n, int k) {
for (int i = 0; i < n; i++) {
if (a[i] == "x") continue;
if (a[i] == "?") {
if (!replace(n, k, i)) return false;
}
}
for (int i = 0; i < n - k; i++) {
if (ai[i] >= ai[i + k]) return false;
}
return true;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] != "?") ai[i] = atoi(a[i].c_str());
}
if (solve(n, k)) {
for (int i = 0; i < n; i++) cout << ai[i] << " ";
} else {
cout << "Incorrect sequence";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long infLL = 0x3f3f3f3f3f3f3f3fLL;
const int maxn = 100000 + 5;
int n, k;
int a[maxn];
bool q[maxn];
bool solve() {
for (int x = 0; x < (k); ++x) {
int last = -inf - maxn;
for (int i = x; i < n; i += k) {
if (!q[i]) {
if (last >= a[i]) return false;
last = a[i];
continue;
}
int cnt = 1, j = i + k;
while (j < n && q[j]) ++cnt, j += k;
int now = (j < n ? a[j] : inf + maxn);
if (last + cnt >= now) return false;
if (now <= 0) {
last = now - cnt - 1;
} else if (last < 0) {
last = max(last, -cnt / 2 - 1);
last = min(last, now - cnt - 1);
}
for (int y = i; y < j; y += k) a[y] = ++last;
last = now;
i = j;
}
}
return true;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < (n); ++i) {
char s[16];
scanf("%s", s);
if (s[0] == '?')
q[i] = true;
else
sscanf(s, "%d", &a[i]);
}
if (!solve())
puts("Incorrect sequence");
else
for (int i = 0; i < (n); ++i) printf("%d%c", a[i], i < n - 1 ? ' ' : '\n');
return 0;
}
|
#include <bits/stdc++.h>
int nextInt(void) {
char ch;
int sign, x;
do {
ch = getchar();
} while (ch < '-');
if (ch == '-') {
sign = -1;
ch = getchar();
} else
sign = 1;
x = 0;
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return sign * x;
}
void printInt(int x) {
char ch[10];
int sign, cnt;
if (x < 0) {
putchar('-');
sign = -1;
} else
sign = 1;
cnt = 0;
do {
ch[cnt++] = '0' + x % 10 * sign;
x /= 10;
} while (x);
while (cnt--) putchar(ch[cnt]);
}
int a[100000];
int main(void) {
int i;
int n, k;
scanf("%d %d ", &n, &k);
for (i = 0; i < n; i++) {
int ch = getchar();
if (ch == '?') {
getchar();
a[i] = 1010000000;
} else {
ungetc(ch, stdin);
a[i] = nextInt();
}
}
for (i = 0; i < k; i++) {
int first, last;
first = i;
while (first <= n) {
int numQ, lFig, rFig;
for (last = first; last < n && a[last] == 1010000000; last += k)
;
numQ = (last - first) / k;
lFig = first - k >= 0 ? a[first - k] : -1010000000;
rFig = last < n ? a[last] : 1010000000;
if (rFig - lFig - 1 < numQ) {
puts("Incorrect sequence");
return 0;
} else {
int cnt;
int left = -(numQ / 2), right = left + numQ - 1;
if (!(lFig < left))
left = lFig + 1;
else if (!(right < rFig)) {
right = rFig - 1;
left = right - numQ + 1;
}
cnt = 0;
while (first < last) {
a[first] = left + cnt++;
first += k;
}
first += k;
}
}
}
for (i = 0; i < n; i++) {
printInt(a[i]);
putchar(' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string c[1000005];
int c1[100005];
vector<int> v;
int main() {
std::ios::sync_with_stdio(false);
int n, i, j, l, r, c2 = 0, val, val1, l1, r1, mid, k;
long long inf = (1000LL * 1000LL * 1000LL + 5) + 1000000LL;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> c[i];
if (c[i] != "?") {
if (c[i][0] != '-') {
for (j = 0; j < c[i].length(); j++) {
c1[i] += (c[i][j] - '0') * round(pow(10, c[i].length() - j - 1));
}
} else {
for (j = 1; j < c[i].length(); j++) {
c1[i] += (c[i][j] - '0') * round(pow(10, c[i].length() - j - 1));
}
c1[i] *= -1;
}
}
}
for (i = 0; i < k; i++) {
j = i;
c2 = 0;
v.clear();
while (j < n) {
if (c[j] != "?") {
if (j - k >= 0 && c[j - k] == "?") {
v.push_back(j - k);
}
c2 = 0;
}
if (c[j] == "?") {
if (c2 == 0) {
v.push_back(j);
}
c2++;
}
j += k;
}
j -= k;
if (c2 == 0 && c[j] == "?") {
v.push_back(j);
v.push_back(j);
} else {
if (c[j] == "?") {
v.push_back(j);
}
}
for (j = 0; j < v.size(); j++) {
if (v[j] - k < 0) {
l = -1 * inf;
} else {
l = c1[v[j] - k];
}
if (v[j + 1] + k > n - 1) {
r = inf;
} else {
r = c1[v[j + 1] + k];
}
if (r - l - 1 < (v[j + 1] - v[j]) / k + 1) {
cout << "Incorrect sequence" << endl;
return 0;
} else {
val = v[j + 1] - v[j];
val /= k;
val++;
val1 = val + 1;
val1 /= 2;
l1 = l + val1;
val -= val1 - 1;
r1 = r - val;
if (l1 <= 0 && r1 >= 0) {
mid = 0;
} else if (l1 > 0) {
mid = l1;
} else {
mid = r1;
}
l1 = v[j];
mid -= val1 - 1;
while (l1 <= v[j + 1]) {
c1[l1] = mid;
mid++;
l1 += k;
}
}
j++;
}
}
for (i = 0; i < k; i++) {
j = i;
while (j < n - k) {
if (c1[j] >= c1[j + k]) {
cout << "Incorrect sequence" << endl;
return 0;
}
j += k;
}
}
for (i = 0; i < n; i++) {
cout << c1[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
const int INF = 2e9;
int a[N];
int n, k;
bool used[N];
int StringToInt(string s) {
bool isPositive = true;
if (s[0] == '-') {
s.erase(s.begin());
isPositive = false;
}
int p = 1;
int ans = 0;
for (int i = 0; i < s.size(); ++i) ans = ans * 10 + s[i] - '0';
if (isPositive == false) ans *= -1;
return ans;
}
bool check() {
for (int i = 1; i <= k; ++i) {
for (int j = i + k; j <= n; j += k) {
if (a[j] <= a[j - k]) return false;
}
}
return true;
}
int main() {
scanf("%d%d\n", &n, &k);
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
if (s == "?") {
used[i] = true;
a[i] = -INF;
} else
a[i] = StringToInt(s);
}
a[0] = -INF;
for (int i = 1; i <= k; ++i) a[n + i] = INF;
for (int i = 1; i <= k; ++i) {
int p = 0;
int len = 0;
for (int j = i; j <= n + k; j += k) {
if (used[j] == true) {
len++;
continue;
}
if (a[p] < 0 && a[j] <= 0) {
for (int c = j - k; c > p; c -= k) a[c] = a[c + k] - 1;
} else if (a[p] >= 0 && a[j] > 0) {
for (int c = (p == 0 ? i : p + k); c < j; c += k) a[c] = a[c - k] + 1;
} else {
int l = 0, r = 0;
len--;
while (len > 0) {
bool flag = false;
if (l - 1 > a[p]) {
l--;
len--;
flag = true;
}
if (len > 0 && r + 1 < a[j]) {
r++;
len--;
flag = true;
}
if (flag == false) break;
}
for (int c = (p == 0 ? i : p + k); c < j; c += k) a[c] = l++;
}
p = j;
len = 0;
}
}
if (check() == false) {
cout << "Incorrect sequence" << endl;
return 0;
}
for (int i = 1; i <= n; ++i) cout << a[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
const int QM = INT_MAX;
const int INF = 2e9 + 7;
int n, k, p[N];
long long a[N], v[N];
int read() {
char ch = getchar();
while (!(ch == '-' || ch == '?' || isdigit(ch))) ch = getchar();
if (ch == '?') return QM;
int v = 0, f = 1;
if (ch == '-') f = -1;
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) {
v = v * 10 + ch - '0';
ch = getchar();
}
return f * v;
}
void solve() {
for (int i = (1); i < (k + 1); ++i) {
int t = 0;
p[t] = i - k;
v[t++] = -INF;
for (int j = i; j <= n; j += k)
if (a[j] != QM) {
p[t] = j;
v[t++] = a[j];
}
p[t] = i + ((n - i) / k + 1) * k;
v[t++] = INF;
for (int j = (0); j < (t - 1); ++j) {
int x = (p[j + 1] - p[j]) / k - 1;
if (v[j + 1] - v[j] - 1 < x) {
puts("Incorrect sequence");
return;
}
if (x == 0) continue;
long long L = v[j] + 1, R = v[j + 1] - x, S;
if (2 * R + x - 1 <= 0) {
S = R;
} else if (2 * L + x - 1 >= 0) {
S = L;
} else {
S = -((x - 1) / 2);
}
for (int w = p[j] + k; w < p[j + 1]; w += k, ++S) a[w] = S;
}
}
for (int i = (1); i < (n + 1); ++i) printf("%lld%c", a[i], " \n"[i == n]);
}
int main() {
scanf("%d%d", &n, &k);
for (int i = (1); i < (n + 1); ++i) a[i] = read();
solve();
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1677721600")
using namespace std;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double ee = exp(1.0);
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 10;
const double pi = acos(-1.0);
const long long iinf = 0x3f3f3f3f3f3f3f3f;
int readT() {
char c;
int ret = 0, flg = 0;
while (c = getchar(), (c < '0' || c > '9') && c != '-')
;
if (c == '-')
flg = 1;
else
ret = c ^ 48;
while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c ^ 48);
return flg ? -ret : ret;
}
long long readTL() {
char c;
int flg = 0;
long long ret = 0;
while (c = getchar(), (c < '0' || c > '9') && c != '-')
;
if (c == '-')
flg = 1;
else
ret = c ^ 48;
while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c ^ 48);
return flg ? -ret : ret;
}
char tmp[30];
int a[maxn];
int main() {
int n = readT();
int k = readT();
for (int i = (0); i <= (n - 1); i++) {
scanf("%s", tmp);
if (tmp[0] == '?') {
a[i] = inf;
} else {
bool sgn = false;
for (int j = (0); j <= (strlen(tmp) - 1); j++) {
if (tmp[j] == '-') {
sgn = true;
continue;
}
a[i] = a[i] * 10 + (tmp[j] - '0');
}
a[i] = sgn ? -a[i] : a[i];
}
}
for (int i = (n); i <= (n + k - 1); i++) {
a[i] = inf + 1;
}
for (int i = (0); i <= (k - 1); i++) {
int minn = -inf, cnt = 0;
for (int j = i; j < n + k; j += k) {
if (a[j] == inf) {
cnt++;
} else {
if (a[j] - minn <= cnt) {
puts("Incorrect sequence");
return 0;
}
int num =
((minn + 1) >
(((a[j] - cnt) < (-cnt / 2) ? (a[j] - cnt) : (-cnt / 2)))
? (minn + 1)
: (((a[j] - cnt) < (-cnt / 2) ? (a[j] - cnt) : (-cnt / 2))));
for (int t = (cnt); t >= (1); t--) {
int id = j - t * k;
a[id] = num++;
}
minn = a[j];
cnt = 0;
}
}
}
for (int i = (0); i <= (n - 1); i++) {
printf("%d ", a[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
int a[maxn], mark[maxn];
int n, k;
void TriFill(int l, int r, int len, int first) {
if (l - k >= 0 && a[l - k] >= first) return;
int last = first + len - 1;
if (r < n && a[r] <= last) return;
if (mark[l]) {
for (int i = l, val = first; i < r; i += k, val++) a[i] = val, mark[i] = 0;
} else {
long long pre = 0, cur = 0;
for (int i = l, val = first; i < r; i += k, val++) {
pre += abs(a[i]);
cur += abs(val);
}
if (cur < pre)
for (int i = l, val = first; i < r; i += k, val++) a[i] = val;
}
}
bool can() {
for (int i = 0; i < k; i++) {
int j = i;
while (j < n) {
if (mark[j]) {
int l = j + k, len = 1;
for (; l < n && mark[l]; l += k, len++)
;
TriFill(j, l, len, -len / 2);
if (j - k >= 0) TriFill(j, l, len, a[j - k] + 1);
if (l < n) TriFill(j, l, len, a[l] - len);
if (mark[j]) return false;
} else {
if (j - k >= 0 && a[j] <= a[j - k]) return false;
j += k;
}
}
}
return true;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
char element[15];
scanf("%s", element);
if (element[0] == '?')
mark[i] = 1;
else
sscanf(element, "%d", &a[i]);
}
if (can()) {
for (int i = 0; i < n; i++) printf("%d ", a[i]);
printf("\n");
} else
puts("Incorrect sequence");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int k, n, a[N];
long long brute(int neg, int pos, int st) {
long long ret = 0;
if (neg >= 0 && st <= a[neg]) return ((long long)9e18);
for (int j = neg + k; j < pos; j += k) {
ret += abs(st);
st++;
}
if (pos < n && st > a[pos]) ret = ((long long)9e18);
return ret;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> n >> k;
for (int i = 0, _i = (n); i < _i; ++i) {
cin >> s;
if (s[0] == '?') {
a[i] = ((int)2e9);
} else {
istringstream iss(s);
iss >> a[i];
}
}
int ans = 1;
for (int i = 0, _i = (k); i < _i; ++i) {
int neg = i - k, pos = i + k * ((n - i - 1) / k + 1);
for (int j = i; j < n; j += k) {
if (a[j] != ((int)2e9)) {
if (a[j] <= 0) neg = j;
if (a[j] >= 0) pos = min(pos, j);
}
}
for (int j = neg - k; j >= i; j -= k) {
if (a[j] == ((int)2e9)) {
a[j] = a[j + k] - 1;
} else if (a[j] >= a[j + k])
ans = 0;
}
for (int j = pos + k; j < n; j += k) {
if (a[j] == ((int)2e9)) {
a[j] = a[j - k] + 1;
} else if (a[j] <= a[j - k])
ans = 0;
}
int l = (pos - neg) / k - 1;
if (l < 0) continue;
set<pair<long long, int>> s;
s.insert(make_pair(brute(neg, pos, -l / 2), -l / 2));
if (neg >= 0) s.insert(make_pair(brute(neg, pos, a[neg] + 1), a[neg] + 1));
if (pos < n) s.insert(make_pair(brute(neg, pos, a[pos] - l), a[pos] - l));
long long st;
if ((*(s.begin())).first < ((int)2e9))
st = (*(s.begin())).second;
else
ans = 0;
for (int j = neg + k; j < pos; j += k) {
a[j] = st++;
}
}
if (!ans) {
cout << "Incorrect sequence";
} else {
for (int i = 0, _i = (n); i < _i; ++i) cout << a[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int StoI(string s) {
int ANS = 0;
int Sign = 0;
if (s[0] == '-')
Sign = 1;
else
ANS = s[0] - 48;
for (int i = 1; i < s.length(); ++i) ANS *= 10, ANS += s[i] - 48;
if (Sign)
return -ANS;
else
return ANS;
}
int a[100007], n, k;
bool mark[100007];
int main(void) {
while (~scanf("%d%d", &n, &k)) {
memset(mark, 0, sizeof(mark));
for (int i = 1; i <= n; ++i) {
string str;
cin >> str;
if (str[0] == '?')
mark[i] = 1;
else
a[i] = StoI(str);
}
int ERR = 0;
for (int start = 1; start <= k; ++start) {
int t = 1 + (n - start) / k;
int LowerBound = -1000100000, UpperBound;
for (int i = start; i <= n; i += k) {
if (!mark[i]) {
if (a[i] <= LowerBound) {
ERR = 1;
break;
} else {
LowerBound = a[i];
continue;
}
}
int L = i, R = i, cnt = 1;
while (R + k <= n && mark[R + k]) R += k, ++cnt;
if (R + k <= n)
UpperBound = a[R + k];
else
UpperBound = 1000100000;
if (UpperBound - LowerBound <= cnt) {
ERR = 1;
break;
} else {
if (UpperBound <= cnt / 2) {
for (int num = UpperBound - 1, j = R; j >= L; j -= k, num--) {
a[j] = num;
mark[j] = 0;
}
} else if (LowerBound >= -(cnt / 2)) {
for (int num = LowerBound + 1, j = L; j <= R; j += k, num++) {
a[j] = num;
mark[j] = 0;
}
} else if (UpperBound > cnt / 2 && cnt / 2 - LowerBound >= cnt) {
for (int num = cnt / 2, j = R; j >= L; j -= k, num--) {
a[j] = num;
mark[j] = 0;
}
} else if (LowerBound < -(cnt / 2) && UpperBound + cnt / 2 >= cnt) {
for (int num = -(cnt / 2), j = L; j <= R; j += k, num++) {
a[j] = num;
mark[j] = 0;
}
} else {
ERR = 2;
break;
}
}
}
if (ERR) break;
}
if (ERR) {
printf("Incorrect sequence\n");
} else {
for (int i = 1; i <= n; ++i) {
printf("%d", a[i]);
if (i == n)
printf("\n");
else
printf(" ");
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, A[100005], K;
const int inf = (int)1e9 + 300005 + 7;
bool gao(vector<int> &p) {
int m = (int)(p).size();
vector<int> pp = p;
for (int i = 0; i < m;) {
if (p[i] != inf)
++i;
else {
int j = i;
for (; j < m && p[j] == inf; ++j)
;
int l = -inf, r = inf;
if (i > 0) l = p[i - 1] + 1;
if (j < m) r = p[j] - 1;
if (j - i > r - l + 1) return 0;
if (r <= 0) {
for (int k = (int)(j - 1); k >= (int)(i); --k) p[k] = r--;
} else if (l >= 0) {
for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = l++;
} else {
int len = j - i;
if (len & 1) {
int a = len / 2;
if (abs(l) >= a && abs(r) >= a) {
a = -a;
for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = a++;
} else if (abs(l) < a) {
for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = l++;
} else if (abs(r) < a) {
for (int k = (int)(j - 1); k >= (int)(i); --k) p[k] = r--;
} else {
assert(0);
}
} else {
int a = len / 2 - 1, b = len / 2 - 1;
a = -a;
if (abs(l) >= abs(r))
--a;
else
++b;
if (abs(l) >= abs(a) && abs(r) >= b) {
for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = a++;
} else if (abs(l) < abs(a)) {
for (int k = (int)(i); k <= (int)(j - 1); ++k) p[k] = l++;
} else if (abs(r) < b) {
for (int k = (int)(j - 1); k >= (int)(i); --k) p[k] = r--;
} else {
assert(0);
}
}
}
i = j;
}
}
for (int i = 0; i < m - 1; ++i) {
if (p[i] >= p[i + 1]) {
return 0;
}
}
return 1;
}
int main() {
scanf("%d%d", &n, &K);
for (int i = 0; i < (int)(n); ++i) {
static char ss[100];
scanf("%s", ss);
if (ss[0] == '?')
A[i] = inf;
else
A[i] = atoi(ss);
}
vector<int> p;
for (int i = 0; i < K; ++i) {
p.clear();
for (int j = i; j < n; j += K) p.push_back(A[j]);
if (!gao(p)) return puts("Incorrect sequence") & 0;
for (int j = i, k = 0; j < n; j += K) A[j] = p[k++];
}
int s = 0;
for (int i = 0; i < (int)(n); ++i) printf("%d ", A[i]), s += abs(A[i]);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool nn[111111];
int mas[111111];
void bad() {
cout << "Incorrect sequence\n";
exit(0);
}
int main() {
ios::sync_with_stdio(0);
int n, k;
string s;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> s;
if (s == "?")
nn[i] = 1;
else
mas[i] = atoi(s.c_str());
}
for (int i = 0; i + k < n; ++i)
if (!nn[i] && !nn[i + k] && mas[i] >= mas[i + k]) bad();
for (int i = 0; i < n; ++i)
if (nn[i]) {
bool f1 = 0, f2 = 0;
if (i - k < 0)
f1 = 1;
else if (!nn[i - k])
f1 = 1;
if (i + k >= n)
f2 = 1;
else if (!nn[i + k])
f2 = 1;
if (f1 && f2) {
int l, r;
if (i - k < 0)
l = -1e9 - 1000000;
else
l = mas[i - k] + 1;
if (i + k >= n)
r = 1e9 + 1000000;
else
r = mas[i + k] - 1;
if (l <= r) {
if (l >= 0)
mas[i] = l;
else if (r <= 0)
mas[i] = r;
else
mas[i] = 0;
nn[i] = 0;
} else
bad();
}
}
for (int i = 0; i < n; ++i)
if (nn[i]) {
int l = -1e9 - 1000000;
int r = 1e9 + 1000000;
if (i - k >= 0) l = mas[i - k] + 1;
int p = i, cnt = 1;
nn[p] = 0;
while (p + k < n && nn[p + k]) {
p += k;
cnt++;
nn[p] = 0;
}
if (p + k < n) r = mas[p + k] - 1;
if (r - l + 1 < cnt) bad();
int d = max(l, -(cnt / 2));
if (d + cnt - 1 > r) d = r - cnt + 1;
for (int j = 0, p = i; j < cnt; ++j, p += k, d++) mas[p] = d;
}
for (int i = 0; i < n; ++i) cout << mas[i] << " \n"[i + 1 == n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[100010];
int N, K;
int q[100010];
char str[15];
void inc() {
printf("Incorrect sequence\n");
exit(0);
}
int main() {
int i;
scanf("%d%d", &N, &K);
for (i = 0; i < N; ++i) {
scanf("%s", str);
if (str[0] == '?') {
A[i] = 0;
q[i] = 1;
continue;
}
sscanf(str, "%d", &A[i]);
}
int k, p, st, en, n;
for (i = 0; i < K; ++i) {
p = i;
for (k = i; k < N; k += K) {
if (!q[k]) {
p = k + K;
continue;
}
if (k + K < N && q[K + k]) continue;
n = (k - p) / K + 1;
st = (p >= K ? A[p - K] : -(1e9) - n - 1);
en = (k + K < N ? A[k + K] : (1e9) + n + 1);
if (en - n <= st) inc();
if (st > 0) {
A[p] = st + 1;
} else if (en < 0) {
A[p] = en - n;
} else {
A[p] = max(-n / 2, st + 1);
A[p] = min(A[p], en - n);
}
for (p += K; p <= k; p += K) {
A[p] = A[p - K] + 1;
}
}
for (k = i + K; k < N; k += K) {
if (A[k - K] >= A[k]) inc();
}
}
for (i = 0; i < N; ++i) {
printf("%d ", A[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[1234567], k;
string s;
int rc(string s) {
int sum = 0;
if (s[0] == '-') {
for (int i = 1; i < s.length(); i++) sum = sum * 10 + s[i] - 48;
return -sum;
}
for (int i = 0; i < s.length(); i++) sum = sum * 10 + s[i] - 48;
return sum;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == '?')
a[i] = 1010000006;
else
a[i] = rc(s);
}
for (int i = n; i < n + k; i++) a[i] = 1010000006 + 1234567;
for (int i = 0; i < k; i++) {
int st = -1010000006;
int cnt = 0;
for (int j = i; j < n + k; j += k) {
if (a[j] == 1010000006)
cnt++;
else {
if (a[j] - st <= cnt) {
cout << "Incorrect sequence";
return 0;
}
int start = max(st + 1, min(a[j] - cnt, -cnt / 2));
for (int x = cnt; x > 0; x--, start++) a[j - x * k] = start;
st = a[j];
cnt = 0;
}
}
}
for (int i = 0; i < n; i++) cout << a[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[100005];
bool ok[100005];
bool us[100005];
int get(int L, int R, int c) {
if (R + 1 < c + L) return R + 1;
if (R >= c / 2 && -(c - 1) / 2 >= L) return c / 2;
if (R >= (c - 1) / 2 && -c / 2 >= L) return (c - 1) / 2;
if (abs(L) < abs(R))
return L + c - 1;
else
return R;
}
int main() {
scanf("%d %d", &n, &k);
char s[10];
for (int i = 0; i < n; i++) {
scanf("%s", &s);
if (s[0] != '?') {
ok[i] = true;
a[i] = atoi(s);
}
}
bool f;
int q;
for (int i = 0; i < n; i++) {
if (us[i]) continue;
f = false;
q = 0;
int l = -2e9;
int r = 2e9;
int L = i;
int t, c, j;
for (j = i; j < n; j += k) {
if (ok[j]) {
t = a[j] - 1;
c = (j - L) / k;
t = get(l, t, c);
if (t == a[j]) {
puts("Incorrect sequence");
return 0;
}
int id = j;
while (c--) {
id -= k;
a[id] = t--;
ok[id] = true;
}
l = a[j] + 1;
L = j + k;
}
us[j] = true;
}
c = (j - L) / k;
t = get(l, r, c);
int id = j;
while (c--) {
id -= k;
a[id] = t--;
ok[id] = true;
}
l = a[j] + 1;
L = j + k;
}
for (int i = 0; i < n; i++) printf("%d ", a[i]);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, i;
long long a[200003];
unsigned short q[200003];
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) (q[i] = !scanf("%I64d", &a[i])) ? getchar() : 0;
unsigned short incorrect = 0;
for (i = 0; i < k; i++) {
long long last1 = -0x100ffeea900dc0deL, last2, j1 = i - k, j2, a1, a2, ii;
while ((j1 += k) < n)
if (!q[j1]) {
last2 = last1;
last1 = a[j1];
if (last2 >= last1) {
incorrect = 1;
break;
}
}
if (incorrect) break;
j1 = i;
while (j1 < n - k) {
while (j1 < n && !q[j1]) j1 += k;
a1 = j1 < k ? -0x100ffeea900dc0deL : a[j1 - k];
j2 = j1;
while (j2 < n && q[j2]) j2 += k;
if (j2 <= j1) break;
a2 = j2 >= n ? 0x100ffeea900dc0deL : a[j2];
if (a2 - a1 - 1 < (j2 - j1) / k) {
incorrect = 1;
break;
}
if (a1 >= 0 && a2 >= 0) {
a[j1] = a1 + 1;
for (ii = j1 + k; ii < j2; ii += k) a[ii] = a[ii - k] + 1;
} else if (a1 <= 0 && a2 <= 0) {
a[j2 - k] = a2 - 1;
for (ii = j2 - k - k; ii >= j1; ii -= k) a[ii] = a[ii + k] - 1;
} else {
long long len = (j2 - j1) / k, begin = -len / 2;
if (begin <= a1)
begin = a1 + 1;
else if (begin > a2 - len)
begin = a2 - len;
a[j1] = begin;
for (ii = j1 + k; ii < j2; ii += k) a[ii] = a[ii - k] + 1;
}
j1 = j2;
}
if (incorrect) break;
}
if (incorrect)
printf("Incorrect sequence\n");
else {
for (i = 0; i < n; i++) printf("%I64d ", a[i]);
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[200005];
bool vis[200005];
int a[200005];
int n, m;
double p;
void doit() {
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; ++i) {
scanf("%s", s);
if (s[0] != '?') {
a[i] = atoi(s);
vis[i] = 1;
}
}
for (int i = 1; i <= m; ++i) {
a[n + i] = 1001000000;
vis[n + i] = 1;
}
n += m;
long long ans = 0;
for (int i = 1; i <= m; ++i) {
int last = -1001000000, ff, t = 0;
for (int j = i; j <= n; j += m)
if (vis[j]) {
if (a[j] - last <= t) {
printf("Incorrect sequence\n");
return;
}
if (!t) {
last = a[j];
continue;
}
if (last <= 0 && a[j] >= 0) {
if (last < 0 && a[j] > 0) t--;
if (!t) {
for (int k = ff; k < j; k += m) a[k] = 0;
last = a[j];
continue;
}
int k1 = max(0, last + 1), k2 = 0;
while (t) {
if (k2 + 1 < a[j]) k2++, t--;
if (!t) break;
if (k1 - 1 > last) k1--, t--;
}
last = k1 - 1;
for (int k = ff; k < j; k += m) a[k] = ++last;
last = a[j];
} else if (last > 0) {
for (int k = ff; k < j; k += m) a[k] = ++last;
last = a[j];
t = 0;
} else {
last = a[j];
for (int k = j - m; k >= ff; k -= m) a[k] = --last;
last = a[j];
t = 0;
}
} else {
t++;
if (t == 1) ff = j;
}
}
n -= m;
for (int i = 1; i <= n - 1; ++i) printf("%d ", a[i]);
printf("%d\n", a[n]);
}
int main() {
while (scanf("%d%d", &n, &m) != EOF) doit();
}
|
#include <bits/stdc++.h>
using namespace std;
int Q = 1001000001;
int s[201010];
int u[101010];
int mn[101010];
int mx[101010];
int n, k;
bool jee;
void mk() {
mn[0] = -Q - 1;
mx[u[0]] = Q + 1;
for (int i = 1; i < u[0]; ++i) {
if (u[i] != Q) {
if (u[i] <= mn[i - 1]) jee = 0;
mn[i] = u[i];
} else
mn[i] = mn[i - 1] + 1;
}
for (int i = u[0] - 1; i > 0; --i) {
if (u[i] != Q) {
if (u[i] >= mx[i + 1]) jee = 0;
mx[i] = u[i];
} else
mx[i] = mx[i + 1] - 1;
}
int a = 0;
for (int i = 1; i < u[0]; ++i) {
if (u[i] == Q) {
if (a == 0)
for (a = 1; u[i + a] == Q && i + a < u[0]; ++a)
;
if (mx[i] < mn[i]) jee = 0;
if (mx[i] == mn[i])
u[i] = mx[i];
else if (mn[i] > 0)
u[i] = mn[i];
else if (mx[i + a - 1] < 0)
u[i] = mx[i];
else {
u[i] = min(max(-a / 2, mn[i]), mx[i + a - 1] - a + 1);
for (int j = 1; j < a; ++j) mn[i + j] = u[i] + j;
}
--a;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
jee = 1;
for (int i = 0; i < 101010; ++i) s[i] = Q;
cin >> n >> k;
char c;
for (int i = 0; i < n; ++i) {
cin >> ws;
c = cin.peek();
if (c == '?')
cin >> c;
else
cin >> s[i];
}
for (int i = 0; i < k; ++i) {
for (int j = i; j < n; j += k) {
u[j / k + 1] = s[j];
u[0] = j / k + 2;
}
mk();
for (int j = i; j < n; j += k) {
s[j] = u[j / k + 1];
}
}
if (jee)
for (int i = 0; i < n; ++i) cout << s[i] << " ";
else
cout << "Incorrect sequence";
}
|
#include <bits/stdc++.h>
char str[2000010];
int arr[100010];
int dp1[100010], dp2[100010];
int n, k;
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
void gao() {
int i, j, kk, pos, left, right;
int start;
int number;
for (i = 0; i < n; i++) {
if (i - k >= 0) {
if (arr[i - k] != 2000000000)
dp1[i] = i - k;
else
dp1[i] = dp1[i - k];
} else
dp1[i] = -1;
}
for (i = n - 1; i >= 0; i--) {
if (i + k < n) {
if (arr[i + k] != 2000000000)
dp2[i] = i + k;
else
dp2[i] = dp2[i + k];
} else
dp2[i] = -1;
}
for (i = 0; i < n; i++)
if (arr[i] != 2000000000) {
pos = i, left = dp1[i], right = dp2[i];
if (left != -1) {
if (arr[i] < arr[left] + (pos - left) / k) goto IRR;
}
if (right != -1) {
if (arr[i] > arr[right] + (right - pos) / k) goto IRR;
}
}
for (kk = 0; kk < k; kk++) {
int left_num, right_num;
left = kk - k;
left_num = -2000000000;
for (i = kk; i < n; i += k)
if (arr[i] != 2000000000) {
right_num = arr[i];
number = (i - left) / k - 1;
if (number != 0) {
if (left_num >= 0) start = left_num + 1;
if (right_num <= 0)
start = right_num - number;
else {
start = max(left_num + 1, -(number - 1) / 2);
start = min(right_num - number, start);
}
}
for (j = left + k; j < i; j += k) {
arr[j] = start++;
}
left = i, left_num = arr[i];
}
right_num = 2000000000;
number = (i - left) / k - 1;
if (number != 0) {
if (left_num >= 0) start = left_num + 1;
if (right_num <= 0)
start = right_num - number;
else {
start = max(left_num + 1, -(number - 1) / 2);
start = min(right_num - number, start);
}
}
for (j = left + k; j < i; j += k) arr[j] = start++;
}
for (i = 0; i < n; i++) printf("%d ", arr[i]);
puts("");
return;
IRR:
puts("Incorrect sequence");
}
int main() {
int num, sign, i, idx;
while (~scanf("%d%d", &n, &k)) {
getchar();
gets(str);
idx = 0;
num = 0;
sign = 1;
for (i = 0; str[i]; i++) {
if (str[i] == '?')
num = 2000000000;
else if (str[i] == ' ') {
arr[idx++] = num * sign;
num = 0, sign = 1;
} else if (str[i] == '-') {
sign = -1;
} else {
num = num * 10 + str[i] - '0';
}
}
arr[idx++] = num * sign;
gao();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const float eps = 1e-8;
const long long lloo = 1e18;
const int oo = 2e9;
int a[200010], dau[200010];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n + k; i++) a[i] = oo;
for (int i = 0; i < n; i++) {
string x;
cin >> x;
if (x == "?")
dau[i] = 1;
else {
int l = 0;
if (x[0] == '-') l = 1;
a[i] = 0;
for (int j = l, _b = x.size() - 1; j <= _b; j++) {
a[i] = a[i] * 10 + x[j] - '0';
}
if (l == 1) a[i] = -a[i];
}
}
for (int i = 0, _b = k - 1; i <= _b; i++) {
int prev = i - k;
int val = -oo;
for (int x = i; x < n + k; x += k) {
if (dau[x] == 0) {
int len = (x - prev) / k - 2;
int l = -len / 2, r = len + l;
if (r >= a[x]) {
int vec = a[x] - 1 - r;
l += vec;
r += vec;
}
if (l <= val) {
int vec = val + 1 - l;
l += vec;
r += vec;
}
if (r >= a[x]) {
cout << "Incorrect sequence";
return 0;
}
for (int z = prev + k; z < x; z += k) a[z] = l++;
prev = x;
val = a[x];
}
}
}
for (int i = 0; i < n; i++) cout << a[i] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
typename T::value_type sum = 0;
for (int i = (0); i < (n); ++i) sum += v[i];
return sum;
}
struct Sync_stdio {
Sync_stdio() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
}
} _sync_stdio;
int main() {
const int INF = 2000000002;
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = (0); i < (n); ++i) {
string s;
stringstream ss;
cin >> s;
if (s == "?") {
v[i] = -INF;
continue;
}
ss << s;
int a;
ss >> a;
v[i] = a;
}
for (int i = (0); i < (k); ++i) {
vector<int> a;
int j = i;
while (j < n) {
a.push_back(v[j]);
j += k;
}
int x = -1;
int y = 0;
while (y < a.size()) {
while (y < a.size() && a[y] == -INF) {
++y;
}
if (y == x + 1) {
if (x != -1 && y != a.size()) {
if (a[x] >= a[y]) {
cout << "Incorrect sequence";
return 0;
}
}
} else if (x == -1 && y == a.size()) {
int start = -(y - 1) / 2;
for (int j = (x + 1); j < (y); ++j) {
a[j] = start;
++start;
}
} else if (x == -1) {
int start = min(a[y] - 1, (y - 1) / 2);
for (int j = (y - 1); j > (-1); --j) {
a[j] = start;
--start;
}
} else if (y == a.size()) {
int start = max(a[x] + 1, -(y - 1 - x - 1) / 2);
for (int j = (x + 1); j < (y); ++j) {
a[j] = start;
++start;
}
} else {
int len = y - x - 2;
if (a[y] - a[x] < len + 2) {
cout << "Incorrect sequence";
return 0;
}
int start = max(min(a[y] - 1, len / 2), a[x] + len + 1);
for (int j = (y - 1); j > (x); --j) {
a[j] = start;
--start;
}
}
x = y;
y = x + 1;
}
for (int j = (0); j < (a.size()); ++j) {
v[j * k + i] = a[j];
}
}
for (auto i : v) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s[100010];
long long tolol(string s) {
long long ans(0), b(1);
for (auto x : s) {
if (x == '-')
b *= -1;
else
ans = ans * 10 + b * (x - 48);
}
return ans;
}
string toString(long long a) {
if (a == 0) return "0";
string s, d;
if (a < 0) d = "-", a *= -1;
while (a) {
s = char(a % 10 + 48) + s;
a /= 10;
}
return d + s;
}
int main() {
ios_base::sync_with_stdio(0);
long long n, k, i, j, last, lasi, cur;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> s[i];
}
for (i = 1; i <= k; i++) {
last = -2000000000;
lasi = i - k;
for (j = i; j <= n; j += k) {
if (s[j] != "?") {
cur = tolol(s[j]);
if ((j - lasi) / k - 1 > cur - last - 1) {
cout << "Incorrect sequence\n";
return 0;
}
if (cur <= 0) {
for (long long q = j - k; q > lasi; q -= k)
cur--, s[q] = toString(cur);
} else if (last >= 0) {
for (long long q = lasi + k; q < j; q += k)
last++, s[q] = toString(last);
} else {
cur = min(cur - 1, ((j - lasi - k) / k) / 2);
if (cur - last - 1 >= (j - lasi) / k - 1)
for (long long q = j - k; q > lasi; q -= k)
s[q] = toString(cur), cur--;
else
for (long long q = lasi + k; q < j; q += k)
last++, s[q] = toString(last);
}
last = tolol(s[j]);
lasi = j;
}
}
if (lasi + k <= n) {
cur = 2000000000;
if (cur <= 0) {
for (long long q = j - k; q > lasi; q -= k) cur--, s[q] = toString(cur);
} else if (last >= 0) {
for (long long q = lasi + k; q < j; q += k)
last++, s[q] = toString(last);
} else {
cur = min(cur - 1, ((j - lasi - k) / k) / 2);
if (cur - last - 1 >= (j - lasi) / k - 1)
for (long long q = j - k; q > lasi; q -= k)
s[q] = toString(cur), cur--;
else
for (long long q = lasi + k; q < j; q += k)
last++, s[q] = toString(last);
}
}
}
for (i = 1; i <= n; i++) cout << s[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long r;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int maxn = 100010;
int n, k;
char s[20];
int a[maxn];
bool flag[maxn];
void solve() {
memset(a, 0, sizeof(a));
memset(flag, 0, sizeof(flag));
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%s", s);
if (s[0] == '?')
flag[i + 1] = 1;
else {
bool neg = false;
if (s[0] == '-') neg = true;
for (int j = neg; j < strlen(s); j++) a[i] = a[i] * 10 + s[j] - '0';
if (neg) a[i] *= -1;
}
}
for (int i = 0; i < k; i++) {
vector<int> pos;
vector<pair<int, int> > tmp;
tmp.push_back(make_pair(INT_MIN / 2, 0));
pos.push_back(0);
for (int j = i; j < n; j += k) {
if (!flag[j + 1]) {
pos.push_back(int((tmp).size()));
}
tmp.push_back(make_pair(a[j], j));
}
pos.push_back(int((tmp).size()));
tmp.push_back(make_pair(INT_MAX / 2, 0));
for (int j = 0; j < int((pos).size()) - 1; j++) {
int k = pos[j + 1] - pos[j] - 1;
int u = tmp[pos[j]].first + 1;
int v = tmp[pos[j + 1]].first - 1;
if (v - u + 1 < k) {
printf("Incorrect sequence");
return;
}
if (u >= 0) {
int cnt = 0;
for (int l = pos[j] + 1; l < pos[j + 1]; l++)
a[tmp[l].second] = u + (cnt++);
} else if (v <= 0) {
int cnt = 0;
for (int l = pos[j] + 1; l < pos[j + 1]; l++)
a[tmp[l].second] = v - k + (++cnt);
} else {
vector<int> w;
w.push_back(0);
for (int l = 1; l < k; l++) {
if (int((w).size()) == k) break;
if (l >= u && l <= v) w.push_back(l);
if (int((w).size()) == k) break;
if (-l >= u && -l <= v) w.push_back(-l);
}
sort(w.begin(), w.end());
int cnt = 0;
for (int l = pos[j] + 1; l < pos[j + 1]; l++)
a[tmp[l].second] = w[cnt++];
}
}
}
for (int i = 0; i < n - k; i++)
if (a[i] >= a[i + k]) {
printf("Incorrect sequence");
return;
}
for (int i = 0; i < n; i++) printf("%d ", a[i]);
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
const int inf = 2000000000;
int n, k, x[N];
char a[100];
int p = 0;
int ter() {
int r = 0, ver = 1;
if (a[p] == '-') {
++p;
ver = -1;
}
while (a[p] >= '0' && a[p] <= '9') r = r * 10 + a[p++] - '0';
return r * ver;
}
int gr[N], cs[N], cd[N], nrg, nrel[N], val1[N];
int main() {
int i;
cin >> n >> k;
for (i = 1; i <= n; ++i) {
cin >> a;
p = 0;
if (a[0] == '?')
x[i] = inf;
else
x[i] = ter();
}
for (i = 0; i < N; ++i) {
cs[i] = cd[i] = inf;
}
for (i = 1; i <= k; ++i) {
if (x[i] == inf) {
++nrg;
gr[i] = nrg;
cs[nrg] = -inf;
nrel[nrg] = 1;
}
}
for (i = k + 1; i <= n; ++i) {
if (x[i] != inf && x[i - k] != inf) {
if (x[i] <= x[i - k]) {
cout << "Incorrect sequence";
return 0;
}
continue;
}
if (x[i] == inf && x[i - k] != inf) {
++nrg;
gr[i] = nrg;
cs[nrg] = x[i - k];
nrel[nrg] = 1;
}
if (x[i] != inf && x[i - k] == inf) {
cd[gr[i - k]] = x[i];
}
if (x[i] == inf && x[i - k] == inf) {
gr[i] = gr[i - k];
nrel[gr[i]]++;
}
}
for (i = 1; i <= nrg; ++i) {
if (1LL * cd[i] - cs[i] - 1 < 1LL * nrel[i]) {
cout << "Incorrect sequence";
return 0;
}
if (cs[i] >= 0) {
val1[i] = cs[i] + 1;
continue;
}
if (cd[i] <= 0) {
val1[i] = cd[i] - nrel[i];
continue;
}
int aa = nrel[i] / 2;
if (cs[i] < -aa && cd[i] > aa) {
val1[i] = -aa;
continue;
}
if (cs[i] < -aa) val1[i] = cd[i] - nrel[i];
if (cd[i] > aa) val1[i] = cs[i] + 1;
}
for (i = 1; i <= n; ++i) {
if (x[i] == inf) x[i] = val1[gr[i]]++;
cout << x[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int mark[111111 << 2], num[4 * 111111], add;
char str[11];
int getnum(char str[]) {
int ret = 0, neg = -1, i = 1;
if (str[0] != '-') neg = 1, i = 0;
for (; str[i]; i++) {
ret = ret * 10 + str[i] - '0';
}
ret *= neg;
return ret;
}
void init() {
for (int i = 1; i <= add; i++) {
num[i] = -1010000000 + i;
num[add + n + i] = 1010000000 + i;
}
}
int main() {
scanf("%d%d", &n, &k);
add = k;
for (int i = 1; i <= n; i++) {
scanf("%s", str);
if (str[0] == '?') {
mark[i + add] = 1;
} else {
num[i + add] = getnum(str);
}
}
init();
int flag = 0;
for (int i = 1; i <= k; i++) {
if (flag) break;
int negid = -1, posid = -1;
int lastval = num[i];
for (int j = i + k; j <= n + 2 * add; j += k) {
if (mark[j]) continue;
if (num[j] <= lastval) {
flag = 1;
break;
}
lastval = num[j];
}
if (flag) break;
for (int j = i; j <= n + 2 * add; j += k) {
if (posid == -1 && !mark[j] && num[j] >= 0) {
posid = j;
break;
}
}
for (int j = posid; j >= 1; j -= k) {
if (negid == -1 && !mark[j] && num[j] < 0) {
negid = j;
break;
}
}
for (int j = posid + k; j <= n + 2 * add; j += k) {
int lastid = j - k;
if (!mark[j]) {
if (num[lastid] >= num[j]) flag = 1;
continue;
}
if (flag) break;
mark[j] = 0;
num[j] = num[lastid] + 1;
}
if (flag) break;
for (int j = negid - k; j >= 1; j -= k) {
int lastid = j + k;
if (!mark[j]) {
if (num[j] >= num[lastid]) flag = 1;
continue;
}
if (flag) break;
mark[j] = 0;
num[j] = num[lastid] - 1;
}
int midlen = (posid - negid) / k - 1;
if (midlen > num[posid] - num[negid]) {
flag = 1;
break;
}
int left = -((midlen - 1) / 2);
int right = (midlen) / 2;
if (num[posid] <= right) {
int dis = right - num[posid] + 1;
right -= dis;
left -= dis;
}
if (num[negid] >= left) {
int dis = num[negid] - left + 1;
right += dis;
left += dis;
}
for (int j = negid + k; j < posid; j += k) {
num[j] = left;
left += 1;
}
}
if (flag)
puts("Incorrect sequence");
else {
for (int i = k + 1; i <= k + n; i++) {
printf("%d ", num[i]);
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[100005], len;
char s[10000005];
struct el {
int val, poz;
} v[100005];
inline int Nr(int &poz) {
int x = 0, sign = 1;
if (s[poz] == '-') {
sign = -1;
++poz;
}
for (; poz <= len && s[poz] >= '0' && s[poz] <= '9';
x = x * 10 + s[poz++] - '0')
;
return x * sign;
}
int main() {
int poz = 1, i, prec, j, val, l;
cin >> n >> k;
cin.get();
cin.getline(s + 1, 10000000);
n = 0;
len = strlen(s + 1);
while (poz <= len) {
if (s[poz] == '?') {
a[++n] = 2000000001;
poz += 2;
} else {
a[++n] = Nr(poz);
++poz;
}
}
a[0] = -2000000001;
for (poz = 1; poz <= k; ++poz) {
l = 0;
for (i = poz; i <= n; i += k) {
el w;
w.poz = i;
w.val = a[i];
v[++l] = w;
}
v[0].val = -2000000001;
prec = 0;
for (i = 1; i <= l; ++i) {
if (v[i].val != 2000000001) {
if (1LL * v[i].val - v[prec].val - 1 < i - prec - 1) {
cout << "Incorrect sequence\n";
return 0;
}
if (v[prec].val >= 0)
for (j = prec + 1; j < i; ++j) a[v[j].poz] = v[prec].val + j - prec;
else {
if (i - 1 > prec) {
a[v[i - 1].poz] = min(((i - prec - 1) / 2), v[i].val - 1);
a[v[i - 1].poz] = max(a[v[i - 1].poz], v[prec].val + i - prec - 1);
}
for (j = i - 2; j > prec; --j) a[v[j].poz] = a[v[j + 1].poz] - 1;
}
prec = i;
}
}
if (v[l].val == 2000000001) {
if (prec + 1 <= l)
a[v[prec + 1].poz] = max(-(l - prec) / 2, v[prec].val + 1);
for (j = prec + 2; j <= l; ++j) a[v[j].poz] = a[v[j - 1].poz] + 1;
}
}
for (i = 1; i <= n; ++i) cout << a[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void scan(int &x) {
register int c = getchar();
x = 0;
int neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
if (neg) x = -x;
}
const int M = 100005;
int a[M];
vector<pair<long long, long long> > g[M];
bool vis[M];
int main() {
int n, k;
scanf("%d%d", &n, &k);
string s;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == '?')
a[i + 1] = -2e9;
else {
int e = 0, j = 0, flag = 1;
if (s[0] == '-') j++, flag = -1;
for (; j < (int)s.size(); j++) e = e * 10 + (s[j] - '0');
a[i + 1] = e * flag;
}
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
g[i].push_back(make_pair(-2e9 - 1, i - k));
int j = i;
for (; j <= n; j += k) {
if (a[j] != -2e9) g[i].push_back(make_pair(a[j], j));
vis[j] = 1;
}
g[i].push_back(make_pair(2e9 + 1, j));
}
}
bool flag = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < (int)g[i].size() - 1; j++) {
if (!(g[i][j + 1].first - g[i][j].first >=
(g[i][j + 1].second - g[i][j].second) / k)) {
flag = 1;
break;
}
}
if (flag == 1) break;
}
if (flag == 1) {
puts("Incorrect sequence\n");
return 0;
}
for (int i = 1; i <= n; i++) {
if (g[i].size() == 0) break;
for (int j = 0; j < (int)g[i].size() - 1; j++) {
int sz = ((g[i][j + 1].second - g[i][j].second) / k) - 1, st;
if (g[i][j].first < 0 && g[i][j + 1].first > 0) {
st = max(g[i][j + 1].first - sz, g[i][j].first + 1);
if (g[i][j].first < -sz / 2 && g[i][j + 1].first > sz / 2) st = -sz / 2;
}
if (g[i][j + 1].first <= 0) {
st = g[i][j + 1].first - sz;
}
if (g[i][j].first >= 0) {
st = g[i][j].first + 1;
}
for (int l = g[i][j].second + k; l < g[i][j + 1].second; l += k) {
a[l] = st++;
}
}
}
for (int i = 1; i <= n; i++) printf("%d ", a[i]);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, a[120000], i, j, kk, p[120000], e, lst, s, pl[120000];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
if (ch == '?') return 2e9 + 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
int main() {
cin >> n >> k;
p[0] = -2e9 - 2;
for (i = 1; i <= n; ++i) a[i] = read();
for (i = 1; i <= k; ++i) {
s = i;
e = 0;
lst = 0;
while (s <= n) {
p[++e] = a[s];
if (p[e] != 2e9 + 1) pl[e] = lst, lst = e;
s += k;
}
p[e + 1] = 2e9 + 2;
pl[e + 1] = lst;
for (j = 1; j <= e + 1; ++j) {
if (p[j] != 2e9 + 1) {
if (p[j] - p[pl[j]] < j - pl[j]) {
cout << "Incorrect sequence";
return 0;
}
if (p[j] >= 0 && p[pl[j]] >= 0) {
for (kk = pl[j] + 1; kk < j; ++kk) p[kk] = p[pl[j]] + kk - pl[j];
} else if (p[j] < 0 && p[pl[j]] < 0) {
for (kk = j - 1; kk > pl[j]; --kk) p[kk] = p[j] - j + kk;
} else {
int mid = (pl[j] + j) >> 1;
if (mid - pl[j] >= -p[pl[j]]) mid = pl[j] - p[pl[j]];
if (j - mid > p[j]) mid = j - p[j];
for (kk = j - 1; kk > pl[j]; --kk) p[kk] = kk - mid;
}
}
}
for (j = 1; j <= e; ++j)
if (p[j] <= p[j - 1] || p[j] > 2e9 || p[j] < -2e9) {
cout << "Incorrect sequence";
return 0;
} else
a[(j - 1) * k + i] = p[j];
}
for (i = 1; i <= n; ++i) printf("%lld ", a[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const string problemName = "";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
const int INF = (1LL << 30) - 1;
const long long int LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int MOD = (int)(1e9) + 7;
const int NMAX = 200000 + 5;
const int MMAX = 100000 + 5;
const int KMAX = 100000 + 5;
const int PMAX = 100000 + 5;
const int LMAX = 100000 + 5;
const int VMAX = 100000 + 5;
int N, K;
int A[NMAX];
int viz[NMAX];
void citeste_linia() {
int i, j, p, sign, num_start;
char c;
char line[11 * NMAX];
int line_len;
gets(line);
line_len = strlen(line);
line[line_len] = '\n';
for (i = j = 0; i <= line_len; i++) {
c = line[i];
if (c == '?') {
viz[++j] = 1;
num_start = 0;
} else if (c == '-' || ('0' <= c && c <= '9')) {
if (!num_start && c != '-') {
sign = 1;
num_start = 1;
p = c - '0';
} else if (!num_start && c == '-') {
sign = -1;
num_start = 1;
p = 0;
} else {
p = p * 10 + c - '0';
}
} else if (num_start) {
num_start = 0;
A[++j] = p * sign;
sign = p = 0;
}
}
}
int main() {
int i, j, k, p, first, last;
vector<int> V;
scanf("%d %d\n", &N, &K);
citeste_linia();
for (p = 1; p <= K; p++) {
first = -INF;
for (i = p; i <= N + K; i += K)
if (viz[i])
V.push_back(i);
else {
last = (i > N) ? INF : A[i];
if (last <= first) {
printf("Incorrect sequence\n");
return 0;
}
if (!V.empty()) {
if ((last - first - 1) < (int)(V.size())) {
printf("Incorrect sequence\n");
return 0;
}
if (first >= 0) {
for (j = 0; j < V.size(); j++) A[V[j]] = first + j + 1;
V.resize(0);
} else if (last <= 0) {
for (j = V.size() - 1; j >= 0; j--) A[V[j]] = last - (V.size() - j);
V.resize(0);
} else {
for (j = 0; j < V.size(); j++)
A[V[j]] = j - ((int)V.size() - 1) / 2;
while (A[V.back()] >= last || A[V[0]] <= first) {
if (A[V.back()] >= last) k = A[V.back()] - last + 1;
for (j = 0; j < V.size(); j++) A[V[j]] -= k;
if (A[V[0]] <= first) k = -(first - A[V[0]] + 1);
}
V.resize(0);
}
}
first = last;
}
}
for (i = 1; i <= N; i++) printf("%d ", A[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long qst = (1000LL * 1000LL * 1000LL + 11LL);
long long mn = -(qst * qst / 10), mx = (qst * qst / 10);
bool putNums(vector<pair<long long, long long> > &rng1,
vector<pair<long long, long long> > &rng2, vector<long long> &a,
long long first, long long k) {
long long n = (a.size() - 2);
for (long long j = 0; j < rng1.size(); j++) {
long long lf = rng1[j].first, rt = rng1[j].second;
long long xx = rng2[j].first, yy = rng2[j].second;
long long diff = rng2[j].second - rng2[j].first - 1;
if ((diff) > (a[rt] - a[lf] - 1)) return false;
if (a[rt] >= 0 && a[lf] >= 0) {
assert(lf > 0);
long long z = a[lf];
for (long long i = lf + k; i < rt; i += k) a[i] = ++z;
} else if (a[rt] <= 0 && a[lf] <= 0) {
assert(rt < (n + 1));
long long val = a[rt];
for (long long i = rt - k; i > lf; i -= k) a[i] = --val;
} else {
long long x;
if (abs(a[lf]) >= abs(a[rt])) {
x = diff >> 1;
x = min(x, abs(a[rt]));
if (x == abs(a[rt])) x--;
long long lst =
(rt == (n + 1)) ? (first + ((n - first) / k) * k) : (rt - k);
for (long long i = lst; i > lf; i -= k) a[i] = (x--);
} else {
x = diff >> 1;
x = min(x, abs(a[lf]));
long long val = -x;
if (x == abs(a[lf])) val++;
for (long long i = lf + (lf == 0 ? first : k); i < rt; i += k)
a[i] = val++;
}
}
}
return true;
}
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n + 2, 0);
a[0] = mn;
a[n + 1] = mx;
for (long long i = 0; i < (n); i++) {
string s;
cin >> s;
long long p;
if (s == "?")
p = qst;
else
p = stoll(s);
a[i + 1] = p;
}
for (long long i = 1; i <= k; i++) {
vector<long long> v;
vector<pair<long long, long long> > rng1, rng2;
v.push_back(0);
for (long long j = i; j <= n; j += k) {
long long z = a[*(v.end() - 1)];
if (z != qst && a[j] != qst && a[j] <= z) {
cout << "Incorrect sequence";
return 0;
}
v.push_back(j);
}
v.push_back(n + 1);
for (long long l = 1, r = 0; l < (v.size()); l++) {
while (a[v[++r]] == qst)
;
if (l != r)
rng1.push_back(pair<long long, long long>(v[l - 1], v[r])),
rng2.push_back(pair<long long, long long>(l - 1, r));
l = r;
}
if (!putNums(rng1, rng2, a, i, k)) {
cout << "Incorrect sequence";
return 0;
}
}
for (long long i = 1; i < n; i++) cout << a[i] << ' ';
cout << a[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const unsigned int INF = 2 * int(1e9) + 5;
const long long INFll = 1ll * INF * INF;
const int MOD = 1000000007;
vector<int> a, u;
void make(vector<int>& p) {
vector<int> b(p.size());
vector<int> u_(p.size());
for (int i = 0; i < p.size(); ++i) b[i] = a[p[i]], u_[i] = u[p[i]];
for (int i = 0; i < b.size(); ++i) {
if (u_[i]) {
int r = i;
while (r < b.size() && u_[r]) r++;
r--;
int lb = -INF;
int rb = INF;
if (r < b.size() - 1) rb = b[r + 1];
if (i) lb = b[i - 1];
int l = r - i + 1;
if (1ll * rb - lb - 1 < l) {
cout << "Incorrect sequence";
exit(0);
}
int L = -l / 2;
int R = L + l - 1;
if (R >= rb) R = rb - 1, L = R - l + 1;
if (L <= lb) L = lb + 1, R = L + l - 1;
for (int j = i; j <= r; ++j) b[j] = L++;
i = r;
}
}
for (int i = 1; i < b.size(); ++i)
if (b[i] <= b[i - 1]) {
cout << "Incorrect sequence";
exit(0);
}
for (int i = 0; i < b.size(); ++i) a[p[i]] = b[i];
}
int get(const string& s) {
bool f = 0;
if (s[0] == '-') f = 1;
int res = 0;
for (int i = f; i < s.size(); ++i) res = res * 10 + s[i] - '0';
if (f) res *= -1;
return res;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
a.resize(n);
u.resize(n);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
if (s == "?")
u[i] = 1;
else
a[i] = get(s);
}
for (int i = 0; i < k; ++i) {
int j = i;
vector<int> b;
while (j < n) b.push_back(j), j += k;
make(b);
}
for (int i = 0; i < n; ++i) cout << a[i] << " ";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.