text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100001] = {0}, flag = 0, c1 = 0, c2 = 2e9, v = 0;
while ((scanf("%d,", &n)) != EOF) a[n] = 1;
for (int i = 1; i <= 1001; i++) {
if (a[i] == 0 && c2 == 2e9) {
c1 = 0;
c2 = 2e9;
} else if (a[i] == 0 && c2 != 2e9) {
cout << '-' << c2;
v = 1;
c2 = 2e9;
c1 = 0;
} else if (a[i] == 1 && c1 == 0) {
c1 = 1;
if (v == 0)
cout << i, v = 1;
else
cout << ',' << i;
} else if (a[i] == 1 && c1 == 1) {
c2 = i;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int eprintf(const char* format, ...) { return 0; }
char buf[4096];
int main() {
while (scanf("%s", buf) >= 1) {
vector<bool> was(1000 + 2, false);
int cid = 0;
for (int i = 0;; i++) {
if (buf[i] < '0' || buf[i] > '9') {
was[cid] = true;
cid = 0;
} else
cid = cid * 10 + buf[i] - '0';
if (!buf[i]) break;
}
int prevst = -1;
bool first = true;
for (int i = 0; i <= 1000 + 1; i++) {
if (was[i]) {
if (prevst < 0) {
prevst = i;
}
} else if (prevst >= 0) {
if (!first) printf(",");
first = false;
if (i - 1 == prevst)
printf("%d", i - 1);
else
printf("%d-%d", prevst, i - 1);
prevst = -1;
}
}
printf("\n");
break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
set<int> final;
string pal;
string aux = "";
getline(cin, pal);
for (int i = 0; i < pal.size(); i++) {
if (pal[i] != ',') {
aux = aux + pal[i];
} else {
int var = atoi(aux.c_str());
final.insert(var);
aux = "";
}
}
int var = atoi(aux.c_str());
final.insert(var);
bool uno = true;
int cont = 0;
int numneroUno;
int ante = 0;
for (auto it = final.begin(); it != final.end(); it++) {
if (uno) {
uno = false;
cout << *it;
ante = *it;
numneroUno = *it;
cont++;
} else {
if ((*it - ante == 1)) {
ante = *it;
cont++;
} else {
if (cont >= 1) {
it--;
if (numneroUno != *it) {
cout << "-" << *it;
}
it++;
cont = 0;
}
cout << "," << *it;
ante = *it;
}
}
}
if (cont > 1) {
auto iter = final.end();
iter++;
int ultimo = *iter;
if (ante == *iter) {
cout << "-" << ultimo;
} else {
for (int i = 0; i < cont; i++) {
iter--;
}
cout << "," << *iter << "-" << ultimo;
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
if (s[i] == ',') s[i] = ' ';
stringstream ss;
ss << s;
int x;
set<int> se;
while (ss >> x) se.insert(x);
vector<int> vec(se.begin(), se.end());
for (int i = 0; i < vec.size(); i++) {
if (i) cout << ",";
int j = i + 1;
while (j < vec.size() && vec[j] == vec[j - 1] + 1) j++;
if (j - i == 1)
cout << vec[i];
else
cout << vec[i] << "-" << vec[j - 1];
i = j - 1;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, t1, ans[1005], cnt;
bool used[1005];
char ch;
int main() {
scanf("%d%c", &t1, &ch);
while (ch == ',') {
used[t1] = true;
scanf("%d%c", &t1, &ch);
}
used[t1] = true;
for (int i = 1; i <= 1000; ++i) {
if (used[i]) {
for (int j = i; used[j]; ++j) {
ans[i] = j;
used[j] = false;
}
}
}
cnt = 0;
for (int i = 1; i <= 1000; ++i) {
if (ans[i]) {
++cnt;
if (cnt != 1) printf(",");
if (ans[i] == i)
printf("%d", i);
else
printf("%d-%d", i, ans[i]);
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
static char s[1024], good[1000 + 1], *t, cc[1048576], *p = cc;
int k, l, r, first;
scanf("%s", s);
k = 0;
for (t = strtok(s, ","); t != NULL; t = strtok(NULL, ",")) good[atoi(t)] = 1;
first = 1;
for (l = 1; l <= 1000; l = r) {
while (l <= 1000 && !good[l]) l++;
r = l + 1;
while (r <= 1000 && good[r]) r++;
if (l <= 1000) {
if (!first) p += sprintf(p, ",");
first = 0;
p += sprintf(p, "%d", l);
if (l < r - 1) p += sprintf(p, "-%d", r - 1);
}
}
printf("%s\n", cc);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[505];
bool fv[1005];
int ln, m;
int main() {
cin >> s;
ln = strlen(s);
for (int i = 0; i < ln; ++i) {
int act = atoi(s + i);
m = max(m, act);
fv[act] = true;
while (s[i] >= '0' && s[i] <= '9') {
++i;
}
}
for (int i = 1; i <= m; ++i) {
if (!fv[i]) {
continue;
}
int st = i;
int dr = i;
while (fv[dr]) {
++dr;
}
--dr;
if (st == dr) {
cout << st;
} else {
cout << st << '-' << dr;
}
if (dr != m) {
cout << ',';
}
i = dr;
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, i, j, k;
set<long long> st;
while (scanf("%lld,", &k) != EOF) {
st.insert(k);
}
vector<long long> v;
for (auto it = st.begin(); it != st.end(); ++it) {
v.push_back(*it);
}
cout << v[0];
long long p = 0;
for (long long i = 1; i <= v.size() - 1; i++) {
long long f = 0;
if (v[i] - 1 == v[i - 1] && p == 0) {
cout << "-";
p = 1;
} else if (v[i] - 1 != v[i - 1]) {
cout << "," << v[i];
f = 1;
}
if (v[i] - 1 == v[i - 1] && p == 1 &&
(v[i] + 1 != v[i + 1] || i == v.size() - 1)) {
cout << v[i];
p = 0;
} else if (v[i] - 1 != v[i - 1] && p == 0 && f == 0 &&
(v[i] + 1 == v[i + 1] || i == v.size() - 1)) {
cout << "," << v[i];
p = 0;
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool f[1010];
int l[1010], r[1010];
int main() {
memset(f, 0, sizeof(f));
int a;
char ch;
scanf("%d%c", &a, &ch);
while (ch == ',') {
f[a] = true;
scanf("%d%c", &a, &ch);
}
f[a] = true;
int tot = 0;
for (int i = 1; i <= 1000; ++i)
if (f[i]) {
if (i > 1 && f[i - 1])
r[tot - 1] = i;
else {
l[tot] = r[tot] = i;
++tot;
}
}
for (int i = 0; i < tot - 1; ++i)
if (l[i] < r[i])
printf("%d-%d,", l[i], r[i]);
else
printf("%d,", l[i]);
if (l[tot - 1] < r[tot - 1])
printf("%d-%d\n", l[tot - 1], r[tot - 1]);
else
printf("%d\n", l[tot - 1]);
}
|
#include <bits/stdc++.h>
bool m[1001];
int r[101];
int l[101];
int p = 0;
int main() {
int a;
while (scanf("%d,", &a) != EOF) {
m[a] = true;
}
int j = 0;
while (true) {
if (m[j]) {
r[p] = l[p] = j;
break;
}
j++;
}
for (int i = j + 1; i < 1001; i++) {
if (m[i]) {
if (r[p] + 1 == i)
r[p] = i;
else {
p++;
r[p] = l[p] = i;
}
}
}
for (j = 0; j < p; j++) {
if (r[j] == l[j])
printf("%d,", r[j]);
else
printf("%d-%d,", l[j], r[j]);
}
if (r[p] == l[p])
printf("%d", r[p]);
else
printf("%d-%d", l[p], r[p]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> v;
map<string, int> m;
stringstream s_stream(s);
while (s_stream.good()) {
string substr;
getline(s_stream, substr, ',');
m[substr]++;
if (m[substr] == 1) {
v.push_back(stoi(substr));
}
}
sort(v.begin(), v.end());
int n = v.size();
int j;
for (int i = 0; i < n; i++) {
int a = v[i];
int b = v[i];
int flg = 0;
for (j = i + 1; j < n; j++) {
if (v[j] - v[j - 1] > 1) {
b = v[j - 1];
flg = 1;
break;
}
}
if (flg == 0 || b == v[n - 1] || a == v[n - 1]) {
if (a != v[n - 1]) {
cout << a << "-" << v[n - 1];
exit(0);
} else {
cout << a;
exit(0);
}
}
if (a != b)
cout << a << "-" << b << ",";
else
cout << a << ",";
i = j - 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T input(std::istream &is) {
T value;
is >> value;
return value;
}
template <class Function>
void repeat(std::size_t n, Function f) {
while (n--) f();
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::string line;
getline(cin, line);
replace(line.begin(), line.end(), ',', ' ');
std::vector<bool> pages(1050);
{
std::istringstream iss(line);
unsigned page;
while (iss >> page) pages[page] = true;
}
auto first = find(pages.begin(), pages.end(), true);
bool is_first = true;
while (first != pages.end()) {
const auto last = find(first, pages.end(), false);
const auto left = first - pages.begin();
const auto right = last - pages.begin() - 1;
if (is_first) {
is_first = false;
} else {
cout << ',';
}
if (left == right)
cout << left;
else
cout << left << '-' << right;
first = find(last, pages.end(), true);
}
cout << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> s;
string x;
void f() {
ios::sync_with_stdio(false);
stringstream str;
for (int i = 0; i < x.length(); i++) {
if (x[i] == ',') {
str << " ";
} else {
str << x[i];
}
}
int a;
while (str >> a) {
s.insert(a);
}
}
int main() {
ios::sync_with_stdio(false);
cin >> x;
f();
int cnt = 1;
bool flag = 1;
set<int>::iterator start = s.begin();
for (set<int>::iterator it = s.begin(); it != s.end(); it++) {
if (it == s.begin()) continue;
set<int>::iterator last = (--it);
it++;
if ((*it) != (*last) + 1) {
if (cnt == 1) {
cout << (flag ? "" : ",") << *start;
} else {
cout << (flag ? "" : ",") << *start << "-" << *last;
}
cnt = 1;
start = it;
flag = 0;
} else {
cnt++;
}
}
if (cnt == 0) {
return 0;
}
if (cnt == 1) {
cout << (flag ? "" : ",") << *start << endl;
} else {
set<int>::iterator k = s.end();
cout << (flag ? "" : ",") << *start << "-" << *(--k) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool p[1005];
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
int n = 0;
bool f = 0;
while (isdigit(s[i]) && i < s.size()) {
f = 1;
n = n * 10 + s[i] - '0';
i++;
}
if (f) i--;
p[n] = 1;
}
bool f = 1;
for (int i = 1; i <= 1000; i++)
if (p[i]) {
if (!f) cout << ",";
f = 0;
int a = i, b = i;
while (p[++i]) b++;
i--;
if (a == b)
cout << a;
else
cout << a << "-" << b;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool a[1000] = {0};
vector<int> v;
int main() {
int d;
int dp[1001] = {};
while (scanf("%d,", &d) == 1) {
if (dp[d] != 1) {
dp[d] = 1;
v.push_back(d);
}
}
int f = 0;
for (int i = 1; i <= 1000; i++) {
while (dp[i] == 0 && i <= 1000) {
i++;
}
if (i > 1000) {
break;
}
if (i < 1000 && f == 1) {
cout << ",";
}
int st = i;
int cnt = -1;
while (dp[i] >= 1 && i <= 1000) {
f = 1;
i++;
cnt++;
}
cout << st;
if (cnt > 0) {
cout << "-" << st + cnt;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int v[1001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
int x = 0;
while (isdigit(s[i])) {
x *= 10;
x += s[i] - '0';
i++;
}
v[x] = 1;
}
int l = 0, r = 0, k = 0;
for (int i = 1; i <= 1000;) {
l = r = 0;
while (i <= 1000 && !v[i]) i++;
if (v[i]) l = r = i;
while (i <= 1000 && v[i]) {
r = i;
i++;
}
if (l) {
if (k) cout << ',';
k = 1;
if (l != r)
cout << l << '-' << r;
else
cout << l;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int nextInt() {
int res = 0;
char c = getchar();
if (c == -1) {
return -1;
}
while (c < '0' || c > '9') {
c = getchar();
}
while (c >= '0' && c <= '9') {
res = res * 10 + c - '0';
c = getchar();
}
return res;
}
int main() {
int x = 1, n, i;
set<int> mn;
vector<int> a;
while ((x = nextInt()) && x != -1) {
mn.insert(x);
}
a.assign(mn.begin(), mn.end());
n = a.size();
int k, g;
for (i = 0; i < n; i++) {
g = i + 1;
while (g < n && a[g] == a[g - 1] + 1) {
g++;
}
g--;
cout << a[i];
if (g - i > 0) {
cout << '-' << a[g];
i += g - i;
}
if (i < n - 1) {
cout << ',';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100010];
int b[100010];
while (scanf("%d", &a[0]) != EOF) {
getchar();
int n = 1;
while (scanf("%d", &a[n]) != EOF) {
n++;
getchar();
}
sort(a, a + n);
a[n] = 9999999;
int h = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
b[h++] = a[i];
} else if (a[i] != a[i - 1]) {
b[h++] = a[i];
}
}
b[h] = 99999;
int p = b[0];
int q = b[0];
int flag = 0;
int ff = 0;
for (int i = 1; i <= h; i++) {
if (b[i] == b[i - 1] + 1) {
p = b[i];
} else if (b[i] != b[i - 1] + 1) {
ff = 1;
if (flag == 1) {
printf(",");
}
flag = 1;
if (p == q) {
printf("%d", p);
} else {
printf("%d-%d", q, p);
}
p = b[i];
q = b[i];
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
auto splitBy = [](const string& s, char delim) {
vector<string> ret;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
ret.push_back(item);
}
return ret;
};
vector<string> splitted = splitBy(s, ',');
int MAX = 1001;
vector<bool> a(MAX + 1);
for (const string& page : splitted) {
a[stoi(page)] = true;
}
vector<pair<int, int>> ret;
int p = 0;
while (p <= MAX) {
if (a[p]) {
int from = p;
int to = from;
while (a[to]) {
++to;
}
ret.emplace_back(from, to - 1);
p = to;
} else {
++p;
}
}
for (int i = 0; i < ret.size(); ++i) {
int from = ret[i].first;
int to = ret[i].second;
cout << from;
if (to != from) {
cout << '-' << to;
}
if (i != ret.size() - 1) {
cout << ',';
}
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const* argv[]) {
vector<int> v;
int n;
char c;
while (true) {
scanf("%d", &n);
v.push_back(n);
if (scanf("%c", &c) == EOF || c != ',') break;
}
sort(v.begin(), v.end());
bool first = true;
int minR = v[0];
int maxR = v[0];
for (int i = 1; i < v.size(); ++i) {
if (v[i] == v[i - 1]) continue;
if (v[i] == v[i - 1] + 1)
maxR++;
else {
if (!first) printf(",");
first = false;
if (minR != maxR)
printf("%d-%d", minR, maxR);
else
printf("%d", minR);
minR = maxR = v[i];
}
}
if (!first) printf(",");
if (minR != maxR)
printf("%d-%d", minR, maxR);
else
printf("%d", minR);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
char c;
int tmp = 0;
int k = 0;
while (cin >> c) {
if (c != ',') {
tmp += c - '0';
tmp *= 10;
} else {
tmp /= 10;
a[k++] = tmp;
tmp = 0;
}
}
a[k++] = tmp / 10;
sort(a, a + k);
int l, r;
l = r = a[0];
for (int i = 1; i < k; i++) {
if (a[i] == r) {
continue;
} else if (a[i] == r + 1) {
r++;
} else {
cout << l;
if (r != l) {
cout << "-" << r;
}
cout << ",";
l = r = a[i];
}
}
cout << l;
if (r != l) {
cout << "-" << r;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int maxx = 0;
int n = s.length();
bool d[2001];
memset(d, false, sizeof(d));
string tmp = "";
for (int i = 0; i < n; i++)
if (s[i] != ',') {
tmp += s[i];
maxx = max(maxx, stoi(tmp));
} else {
int x = stoi(tmp);
maxx = max(x, maxx);
if (!d[x]) d[x] = true;
tmp = "";
}
d[stoi(tmp)] = true;
int t = 0;
bool f = false;
while (t <= maxx) {
if (!d[t]) {
t++;
continue;
}
int cnt = t;
while (d[cnt]) cnt++;
if (cnt > t + 1) {
if (f) cout << ',';
cout << t << "-" << cnt - 1;
t = cnt;
f = true;
continue;
} else {
if (f) cout << ',';
cout << cnt - 1;
t++;
f = true;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
vector<int> v;
cin >> a;
v.push_back(a);
while (scanf(",%d", &a)) {
v.push_back(a);
}
int tap = 0, b = 0;
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
tap++;
if (i != v.size() - 1 && v[i] != v[i + 1] - 1 && v[i] != v[i + 1]) {
if (tap == 1) {
cout << v[i];
b = i + 1;
tap = 0;
if (i != v.size() - 1)
cout << ",";
else
cout << "\n";
} else {
if (v[b] == v[i])
cout << v[i];
else
cout << v[b] << "-" << v[i];
b = i + 1;
tap = 0;
if (i != v.size() - 1)
cout << ",";
else
cout << "\n";
}
} else if (i == v.size() - 1) {
if (v[b] == v[i])
cout << v[i];
else
cout << v[b] << '-' << v[i];
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 * 1e9;
const long long limit = 1 * 1e18;
const int mod = 1e9 + 7;
const int MOD = 1e9 + 711;
const int MOD2 = 1e9 + 933;
const int MOD3 = 1e9 + 993;
const int maxn = 1e5 + 100;
int main() {
cout.tie(0);
cin.tie(0);
ios_base::sync_with_stdio(0);
string s;
cin >> s;
vector<int> a(1002);
bool is = false;
for (int i = 0; i < s.size(); ++i) {
if (i == 44 || i == 45 || i == 46) {
i += 0;
}
string c;
while (i < s.size() && s[i] != ',') {
c += s[i++];
}
int t = 0;
for (int j = 0; j < c.size(); ++j) {
t *= 10;
t += (c[j] - '0');
}
a[t] = 1;
}
int l, r;
vector<pair<int, int>> ans;
for (int i = 1; i <= 1001; ++i) {
if (a[i]) {
if (!is) {
is = true;
l = r = i;
} else {
r = i;
}
} else {
if (is) {
is = false;
ans.push_back(make_pair(l, r));
}
}
}
for (int i = 0; i < ans.size(); ++i) {
if (ans[i].first == ans[i].second) {
cout << ans[i].first;
} else {
cout << ans[i].first << '-' << ans[i].second;
}
if (i != ans.size() - 1) {
cout << ',';
}
}
cerr << "\n\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = (int)2e9;
const double eps = 1e-9;
int daysInMonths[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int di[] = {-1, 0, 1, 0};
int dj[] = {0, 1, 0, -1};
int arr[1002], maxi = -1;
void Gen(string s) {
int res = 0;
for (int i = (0); i < ((int)s.size()); i++) {
if (s[i] != ',') {
res *= 10;
res += (s[i] - '0');
} else if (s[i] == ',') {
arr[res]++;
if (res > maxi) maxi = res;
res = 0;
}
}
arr[res]++;
if (res > maxi) maxi = res;
}
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
Gen(s);
for (int i = (1); i < (1001); i++) {
if (arr[i] != 0) {
int last_non_zero = i, j;
for (j = i;; j++) {
if (arr[j] != 0)
last_non_zero = j;
else
break;
}
if (i == last_non_zero)
cout << last_non_zero;
else
cout << i << "-" << last_non_zero;
if (maxi != last_non_zero) cout << ",";
i = last_non_zero;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[1050];
int ans1, ans2;
int main() {
int i, n;
int flag = 1;
int a;
char b;
while (scanf("%d", &a) != EOF) {
A[a] = 1;
if (scanf("%c", &b) == EOF) break;
}
for (i = 1; i <= 1001; i++) {
if (A[i]) {
if (ans1 == 0)
ans1 = i;
else
ans2 = i;
} else {
if (ans1 && ans2) {
if (flag) {
printf("%d-%d", ans1, ans2);
flag = 0;
} else {
printf(",%d-%d", ans1, ans2);
}
ans1 = ans2 = 0;
} else if (ans1 && ans2 == 0) {
if (flag) {
printf("%d", ans1);
flag = 0;
} else {
printf(",%d", ans1);
}
ans1 = 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int hash[1002] = {0};
int t = 0;
string s;
cin >> s;
s += ',';
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',') {
hash[t] = 1;
t = 0;
} else {
t = t * 10 + (s[i] - '0');
}
}
int p = 0, q = 0, start = 1;
for (int i = 1; i < 1002; i++) {
if (hash[i] == 0 && p > 0) {
q++;
if (q > 1) cout << ',';
if ((i - start) == 1) {
cout << start;
} else {
cout << start << '-' << i - 1;
}
p = 0;
} else if (hash[i] == 1) {
p++;
if (p == 1) {
start = i;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3fffffff;
const int N = 1005;
struct node {
int l, r;
};
vector<node> ans;
bool used[N];
int main() {
int i, j, k;
int n;
while (1) {
cin >> n;
used[n] = 1;
if (getchar() == '\n') break;
}
i = 1;
while (i <= 1000) {
while (!used[i]) i++;
if (i > 1000) break;
j = i;
while (used[j]) j++;
node now;
now.l = i, now.r = j - 1;
i = j;
ans.push_back(now);
}
int size = ans.size();
for (i = 0; i < size; i++) {
node now = ans[i];
if (now.l == now.r)
cout << now.l;
else
cout << now.l << "-" << now.r;
if (i != size - 1) cout << ",";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int f[1001], i, a, x, n;
char c;
int main() {
cin >> x;
f[x] = 1;
while (!cin.eof()) {
cin >> c;
cin >> x;
f[x] = 1;
}
for (i = 1000; i >= 0; i--)
if (f[i] == 1) {
n = i;
break;
}
i = 1;
while (i <= n) {
while (f[i] == 0 && i <= n) i++;
a = i;
while (f[i] == 1 && i <= n) i++;
if ((i - a) == 1) {
cout << a;
if (a != n) cout << ',';
} else {
cout << a;
cout << '-';
cout << i - 1;
if ((i - 1) != n) cout << ',';
}
}
}
|
#include <bits/stdc++.h>
char s[11111];
int len;
int v[1111];
int main() {
scanf("%s", s);
len = strlen(s);
s[len] = ',';
int cur = 0;
for (int i = 0; i <= len; i++)
if (s[i] == ',') {
v[cur] = true;
cur = 0;
} else
cur = cur * 10 + s[i] - '0';
bool st = true;
for (int i = 1; i <= 1000; i++)
if (v[i]) {
if (!st) printf(",");
st = false;
printf("%d", i);
int bak = i;
while (v[i]) i++;
i--;
if (bak < i) printf("-%d", i);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long hash[2005] = {0};
long x;
long i;
long flag = 0;
do {
scanf("%ld", &x);
hash[x] = 1;
} while (scanf(",") != EOF);
for (i = 1; i <= 1001; i++)
if (hash[i - 1] == 0 && hash[i] == 1) {
if (flag) printf(",");
if (hash[i + 1] == 0) {
printf("%ld", i);
flag = 1;
continue;
}
printf("%ld-", i);
for (; hash[i]; i++)
;
printf("%ld", i - 1);
flag = 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char in[1000005];
set<int> num;
int main() {
gets(in);
int len = strlen(in), now = 0;
for (int i = 0; i < len; ++i) {
if (isdigit(in[i]))
now = now * 10 + in[i] - '0';
else if (now != 0) {
num.insert(now);
now = 0;
}
}
if (now != 0) num.insert(now);
vector<int> v(num.begin(), num.end());
vector<pair<int, int> > ans;
int start = -1, last;
for (int i = 0; i < v.size(); ++i) {
if (start == -1) {
start = last = v[i];
} else if (v[i] == last + 1)
last = v[i];
else {
ans.push_back(pair<int, int>(start, last));
start = last = v[i];
}
}
if (start != -1) ans.push_back(pair<int, int>(start, last));
for (int i = 0; i < ans.size(); ++i) {
if (i > 0) printf(",");
if (ans[i].first == ans[i].second)
printf("%d", ans[i].first);
else
printf("%d-%d", ans[i].first, ans[i].second);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char str[100100];
cin.getline(str, 100100);
set<int> n;
char* k = strtok(str, ",");
while (k != NULL) {
int i = atoi(k);
n.insert(i);
k = strtok(NULL, ",");
}
set<int>::iterator it;
int* mas = new int[n.size()];
int j;
for (j = 0, it = n.begin(); j < n.size(), it != n.end(); j++, it++) {
mas[j] = *it;
}
int beg, end;
for (int j = 0; j < n.size(); j++) {
if (j < n.size() - 1) {
if ((mas[j + 1] - mas[j]) == 1) {
beg = mas[j];
while (((mas[j + 1] - mas[j]) == 1) && (j < n.size())) {
j++;
}
end = mas[j];
cout << beg << "-" << end;
} else if ((mas[j + 1] - mas[j]) > 1)
cout << mas[j];
if (j != n.size() - 1) cout << ",";
} else
cout << mas[j];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10000];
int main() {
int n;
fflush(stdin);
for (int i = 0;; i++) {
int tmp = scanf("%d,", &a[i]);
if (tmp != 1) {
n = i;
break;
}
}
sort(a, a + n);
n = unique(a, a + n) - a;
for (int i = 0; i < n;) {
int j = i;
for (; j < n && (i == j || a[j] == a[j - 1] + 1); j++)
;
if (i == j - 1) {
if (j == n)
printf("%d", a[i]);
else
printf("%d,", a[i]);
} else {
if (j == n)
printf("%d-%d", a[i], a[j - 1]);
else
printf("%d-%d,", a[i], a[j - 1]);
}
i = j;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void IOS() {
ios::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
}
const int MOD = 1e9 + 7;
const int mx = 1e5 + 5;
int i, j, k;
bool ar[1005];
int main() {
IOS();
string s;
int x;
cin >> s;
for ((i) = 0; (i) < (int)(s.length()); (i)++)
if (s[i] == ',') s[i] = ' ';
istringstream z(s);
while (z >> x) ar[x] = true;
int L = 2000000000;
bool output = false;
for ((i) = 0; (i) < (int)(1005); (i)++) {
if (!ar[i] && L != 2000000000) {
int R = i - 1;
if (output) printf(",");
printf("%d", L);
if (L != R) printf("-%d", R);
L = 2000000000;
output = true;
}
if (ar[i]) L = min(L, i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a[1005] = {0}, f = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
int num = 0;
while (s[i] != ',' && s[i]) {
num = (num * 10) + (s[i] - '0');
i++;
}
a[num]++;
}
for (int i = 0; i < 1003; i++) {
if (a[i]) {
if (f) cout << ",";
f++;
cout << i;
int j = i;
while (a[j + 1]) {
j++;
}
if (j != i) cout << "-" << j;
i = j;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, len, tot, sum;
int f[1100], a[1100];
int main() {
cin >> s;
len = s.size();
for (int i = 0; i < len; i++) {
if (s[i] != ',')
tot = tot * 10 + int(s[i] - '0');
else {
if (!f[tot]) {
a[++n] = tot;
f[tot] = 1;
}
tot = 0;
}
if (i == len - 1) {
if (!f[tot]) {
a[++n] = tot;
f[tot] = 1;
}
tot = 0;
}
}
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
int total = 0, begin = a[i];
while (a[i] == begin + total && i <= n) {
i++;
total++;
}
i--;
if (total + begin != a[i]) total--;
if (total == 0) {
if (!sum)
cout << a[i];
else
cout << ',' << a[i];
} else {
if (!sum)
cout << begin << '-' << begin + total;
else
cout << ',' << begin << '-' << begin + total;
}
sum++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int br;
set<int> nak;
vector<pair<int, int> > ispis;
int main() {
while (scanf("%d,", &br) != EOF) nak.insert(br);
int i, j;
vector<int> sol(nak.begin(), nak.end());
sol.push_back(sol[sol.size() - 1]);
for (i = 0; i < sol.size() - 1;) {
int poc = sol[i], kra = sol[i];
for (j = i; j < sol.size() - 1; ++j) {
if (sol[j] + 1 != sol[j + 1]) break;
}
i = j + 1;
kra = sol[j];
ispis.push_back(make_pair(poc, kra));
}
for (i = 0; i < ispis.size() - 1; ++i) {
if (ispis[i].first == ispis[i].second)
printf("%d,", ispis[i].first);
else
printf("%d-%d,", ispis[i].first, ispis[i].second);
}
if (ispis[i].first == ispis[i].second)
printf("%d\n", ispis[i].first);
else
printf("%d-%d\n", ispis[i].first, ispis[i].second);
cin.get();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = ((int)1e9);
int main() {
string s, t;
cin >> s;
set<int> se;
for (int i = 0; i < s.size(); i++) {
t = "";
for (; s[i] != ',' && i < s.size(); t += s[i], i++)
;
se.insert(atoi(t.c_str()));
}
vector<int> v((se).begin(), (se).end());
deque<deque<int> > groups(1001);
int j = 0;
for (int i = 0; i < v.size(); i++) {
if (i != 0 && v[i - 1] + 1 != v[i]) j++;
groups[j].push_back(v[i]);
}
for (long long i = 0; i < (j + 1); i++) {
if (groups[i].size() == 1)
cout << groups[i][0];
else {
cout << groups[i].front() << "-" << groups[i].back();
}
if (i != j) cout << ",";
}
}
|
#include <bits/stdc++.h>
char arr[109991] = {NULL};
int a[1001] = {NULL};
int cnt = 1;
void input();
void sort();
void process();
void process2();
int main(void) {
input();
process();
sort();
process2();
return 0;
}
void input() { scanf("%s", arr); }
void sort() {
int i;
int j;
int temp = 0;
for (i = 1; i <= cnt; i++) {
for (j = 1; j <= cnt; j++) {
if (a[i] < a[j]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
}
void process() {
int i;
for (i = 0; i < strlen(arr); i++) {
if (arr[i] == ',') {
cnt++;
} else {
a[cnt] = (a[cnt] * 10) + (arr[i] - '0');
}
}
}
void process2() {
int i;
int t = 0;
int sw = 0;
for (i = 1; i <= cnt; i++) {
if (a[i] != a[i + 1]) {
if (a[i + 1] - 1 == a[i]) {
if (sw == 0) {
printf("%d-", a[i]);
sw = 1;
}
} else {
printf("%d", a[i]);
sw = 0;
if (i < cnt) {
printf(",");
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110], n = 0, res[1010], ch = 0, k = 0;
string s;
int main() {
cin >> s;
memset(a, 0, sizeof a);
memset(res, 0, sizeof res);
for (int i = 0; i < (int)s.length(); ++i)
if (s[i] != ',') {
a[n] *= 10;
a[n] += (int)(s[i] - '0');
} else
++n;
++n;
for (int i = 0; i < n; ++i) res[a[i]] = 1;
for (int i = 0; i < 1010; ++i) {
if (res[i] == 1)
++ch;
else {
if (k > 0 && ch) cout << ',';
if (ch && k == 0) ++k;
if (ch == 1)
cout << i - 1;
else if (ch)
cout << i - ch << '-' << i - 1;
ch = 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int nax = 1e6 + 10;
vector<int> tree(4 * nax);
long long i, j, x, y, k;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s, ans;
cin >> s;
vector<long long> a;
for (i = 0; i < s.length();) {
string a1;
while (s[i] != ',' && i < s.length()) {
a1 += s[i];
i++;
}
i++;
long long x;
stringstream geek(a1);
geek >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
vector<long long>::iterator it;
it = unique(a.begin(), a.begin() + a.size());
a.resize(distance(a.begin(), it));
for (i = 0; i < a.size();) {
long long p = a[i];
while (a[i + 1] == a[i] + 1 && i < a.size()) {
i++;
}
long long q = a[i];
ans += to_string(p);
if (q != p) {
ans += '-';
ans += to_string(q);
}
if (i != a.size() - 1) ans += ',';
i++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[102];
bool flag;
inline void init() {
register char t = getchar();
register int x = 0;
while (t != '\n' && t != EOF) {
if (t == ',')
a[++n] = x, x = 0;
else
x = x * 10 + t - 48;
t = getchar();
}
a[++n] = x;
}
int main() {
init();
sort(a + 1, a + n + 1);
n = unique(a + 1, a + n + 1) - a - 1;
for (register int i = 1; i <= n; i++) {
register int j = i;
if (flag)
printf(",");
else
flag = 1;
if (a[i + 1] == a[i] + 1) {
while (a[j + 1] == a[j] + 1 && j < n) j++;
if (a[i] == a[j])
printf("%d", a[i]);
else
printf("%d-%d", a[i], a[j]);
} else {
while (a[j + 1] == a[j] - 1 && j < n) j++;
if (a[i] == a[j])
printf("%d", a[i]);
else
printf("%d-%d", a[j], a[i]);
}
i = j;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1.e18 + 2;
const long long mod = 1000000007;
const int MAXN = 300005;
using namespace std;
map<pair<string, string>, long long> M;
bool check(string &a, string &b) {
if (b == "-1") return true;
if (a.length() > b.length())
return true;
else if (a.length() == b.length()) {
for (int i = 0; i < a.length(); ++i)
if (a[i] > b[i])
return true;
else if (b[i] > a[i])
return false;
}
return false;
}
long long f(string s, string pre) {
if (M[{s, pre}]) return M[{s, pre}];
if (s[0] == '0') return 0;
if (s.length() == 0) return 1;
M[{s, pre}] = 1;
for (int i = 1; i <= s.length() / 2; ++i) {
string a = s.substr(0, i), b = s.substr(i);
if (!check(a, pre) || !check(b, a)) continue;
M[{s, pre}] += f(b, a);
M[{s, pre}] %= mod;
}
return M[{s, pre}];
}
int arr[1001];
int main() {
int n;
bool flag = true;
while (scanf("%d,", &n) != EOF) arr[n] = 1;
for (int i = 1, j = 1; i < 1001; i = ++j)
if (arr[i]) {
for (j = i; arr[j]; j++)
;
--j;
if (flag)
flag = false;
else
printf(",");
if (i == j)
printf("%d", i);
else
printf("%d-%d", i, j);
}
return printf("\n"), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int foo[1010];
int pusnum(string bon) {
char str[10];
int i;
for (i = 0; bon[i]; i++) str[i] = bon[i];
str[i] = '\0';
return atoi(str);
}
int main() {
int temp, mx = -1;
string bar, str = "";
cin >> bar;
bar = bar + " ";
for (int i = 0; bar[i]; i++) {
if (bar[i] == ',' || bar[i] == ' ') {
temp = pusnum(str);
foo[temp] = 1;
str = "";
if (temp > mx) mx = temp;
} else
str = str + bar[i];
}
int f = 1;
for (int i = 1; i <= mx + 3; i++) {
if (foo[i] == 1) {
if (foo[i + 1] == 1 and f) {
printf("%d", i);
int j = i;
while (foo[j] == 1) j++;
if ((j - 1) != mx)
printf("-%d,", j - 1);
else
printf("-%d", j - 1);
f = 0;
} else if (f) {
if (i != mx)
printf("%d,", i);
else
printf("%d", i);
}
} else
f = 1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int ff, tt;
};
char str[222];
int a[105];
vector<node> v;
set<int> ss;
int main() {
cin >> str;
int i, j;
int tm = 0;
int cnt = 0;
for (i = 0; str[i]; i++) {
if (str[i] == ',') {
ss.insert(tm);
tm = 0;
continue;
}
tm = tm * 10 + str[i] - '0';
}
ss.insert(tm);
v.clear();
set<int>::iterator it;
j = 0;
for (it = ss.begin(); it != ss.end(); it++) {
a[j++] = *(it);
}
int s = 0, t;
node tmp;
for (i = 1; i < j; i++) {
if (a[i] - a[i - 1] != 1) {
tmp.ff = s;
tmp.tt = i - 1;
v.push_back(tmp);
s = i;
}
}
tmp.ff = s;
tmp.tt = j - 1;
v.push_back(tmp);
if (v[0].ff == v[0].tt) {
cout << a[v[0].ff];
} else if (v[0].ff != v[0].tt) {
cout << a[v[0].ff] << "-" << a[v[0].tt];
}
for (i = 1; i < v.size(); i++) {
if (v[i].ff == v[i].tt) {
cout << "," << a[v[i].ff];
} else if (v[i].ff != v[i].tt) {
cout << "," << a[v[i].ff] << "-" << a[v[i].tt];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char *opos, OutFile[65536], DIP[20];
FILE *pfile;
inline void InitFASTIO() { opos = OutFile; }
inline void FlushFASTIO() { fwrite(OutFile, opos - OutFile, 1, stdout); }
inline void fps(int &x) {
register int c = getchar();
x = 0;
for (; (c < 48 || c > 57); c = getchar())
;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
}
inline void fs(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();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg) x = -x;
}
inline void fl(long long 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();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg) x = -x;
}
inline void pi(int x, int flag = 1) {
int y, dig = 0;
if (x < 0) {
*opos++ = '-';
x = -x;
};
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
while (x || !dig) {
y = x / 10;
DIP[dig++] = x - ((y << 3) + (y << 1)) + '0';
x = y;
}
while (dig--) {
*opos++ = DIP[dig];
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
*opos++ = flag ? '\n' : ' ';
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
inline void pll(long long int x, int flag = 1) {
long long int y, dig = 0;
if (x < 0) {
*opos++ = '-';
x = -x;
};
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
while (x || !dig) {
y = x / 10;
DIP[dig++] = x - ((y << 3) + (y << 1)) + '0';
x = y;
}
while (dig--) {
*opos++ = DIP[dig];
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
*opos++ = flag ? '\n' : ' ';
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
inline void ps(char *str, int flag = 1) {
int len = strlen(str);
for (int i = 0; i < len; i++) {
*opos++ = str[i];
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
*opos++ = flag ? '\n' : ' ';
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
inline void pws(int flag = 1) {
*opos++ = flag ? '\n' : ' ';
if (opos - OutFile == (sizeof(OutFile) - 1)) {
FlushFASTIO();
InitFASTIO();
}
}
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
void sieve(vector<int> &prime, int size) {
prime[0] = 1;
prime[1] = 1;
for (long long i = 2; i <= size; i++) {
if (!prime[i]) {
prime[i] = i;
for (long long j = i; j * i <= size; j++) {
if (!prime[j * i]) prime[j * i] = i;
}
}
}
}
int toInt(char xx) { return xx - '0'; }
char toChar(int xx) { return xx + '0'; }
bool isDigit(char xx) { return ('0' <= xx && xx <= '9'); }
bool isCharacter(char xx) {
return (('a' <= xx && xx <= 'z') || ('A' <= xx && xx <= 'Z'));
}
bool isUpper(char xx) { return ('A' <= xx && xx <= 'Z'); }
bool isLower(char xx) { return ('a' <= xx && xx <= 'z'); }
bool isPalin(string x) {
int len = x.length();
for (long long i = 0; i < len / 2; i++) {
if (x[i] != x[len - 1 - i]) return false;
}
return true;
}
void swapInt(int &x, int &y) {
x = x ^ y;
y = x ^ y;
x = x ^ y;
}
string tolowerStr(string x) {
string ret = "";
for (long long i = 0; i < x.length(); i++) {
ret.push_back(tolower(x[i]));
}
return ret;
}
string toupperStr(string x) {
string ret = "";
for (long long i = 0; i < x.length(); i++) {
ret.push_back(toupper(x[i]));
}
return ret;
}
void toCharArray(char *dest, string source) { strcpy(dest, source.c_str()); }
void split(vector<string> &s, string g, char c) {
for (long long i = 0; i < g.length(); i++)
if (g[i] == c) g[i] = ' ';
stringstream in(g);
for (string t; in >> t;) s.push_back(t);
}
void splitint(vector<int> &s, string g, char c) {
for (long long i = 0; i < g.length(); i++)
if (g[i] == c) g[i] = ' ';
stringstream in(g);
for (int t; in >> t;) s.push_back(t);
}
int main() {
InitFASTIO();
int uui;
string s;
cin >> s;
vector<int> vi;
splitint(vi, s, ',');
int n = vi.size();
sort(vi.begin(), vi.end());
cout << vi[0];
int count = 0;
for (long long i = 1; i < n; i++) {
if (vi[i] > vi[i - 1] + 1) {
if (count == 0)
cout << ',' << vi[i];
else {
cout << '-' << vi[i - 1] << ',' << vi[i];
count = 0;
}
} else if (count && i == n - 1) {
cout << '-' << vi[i];
} else if (vi[i] == vi[i - 1] + 1)
count = 1;
}
FlushFASTIO();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> split(string s) {
set<int> ret;
int cur = 0, n = s.size();
for (int i = 0; i < n; ++i) {
if (s[i] == ',') {
ret.insert(cur);
cur = 0;
continue;
}
cur = cur * 10 + s[i] - '0';
}
if (cur != 0) ret.insert(cur);
return ret;
}
int main() {
string s;
cin >> s;
set<int> st = split(s);
int curStart = -1, curEnd = -1, prev = -1;
vector<pair<int, int>> v;
for (int x : st) {
if (curStart == -1) {
curStart = curEnd = prev = x;
continue;
}
if (x == prev + 1) {
++curEnd;
++prev;
} else {
v.push_back({curStart, curEnd});
curStart = curEnd = prev = x;
continue;
}
}
if (curStart != -1) v.push_back({curStart, curEnd});
int n = v.size();
for (int i = 0; i < n; ++i) {
pair<int, int> x = v[i];
if (x.first == x.second)
cout << x.first;
else
cout << x.first << '-' << x.second;
cout << ",\n"[i + 1 == n];
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int MAXN = 2e3 + 5;
const int INF = 200000000;
const double EPS = 1e-6;
string a;
int wton(int l, int r) {
int num(0);
int p = r - l + 1;
while (p) {
num += ((a[l] - '0') * pow(10, p - 1));
p--;
l++;
}
return num;
}
void solve() {
set<int> puk;
vector<int> num;
cin >> a;
int l = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] == ',') {
puk.insert(wton(l, i - 1));
l = i + 1;
}
}
puk.insert(wton(l, a.size() - 1));
set<int>::iterator it = puk.begin();
for (; it != puk.end(); it++) num.push_back(*it);
cout << num[0];
for (int i = 1; i < num.size(); i++) {
if (num[i] - num[i - 1] <= 1 && num[i + 1] - num[i] > 1)
cout << "-" << num[i];
else if (i == num.size() - 1 && num[i] - num[i - 1] > 1) {
cout << "," << num[i];
} else if (num[i] - num[i - 1] > 1 && num[i + 1] - num[i] <= 1)
cout << "," << num[i];
else if (i == num.size() - 1 && num[i] - num[i - 1] <= 1) {
cout << "-" << num[i];
} else if (num[i] - num[i - 1] > 1 && num[i + 1] - num[i] > 1)
cout << "," << num[i];
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<double, long long int> a, pair<double, long long int> b) {
if (a.first > b.first)
return true;
else if (a.first == b.first) {
if (a.second < b.second) return true;
}
return false;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return (a / gcd(a, b)) * b;
}
bool isPowerOfTwo(int n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
void solve() {
set<long long int> s;
long long int n = 0;
string str;
cin >> str;
for (auto it : str) {
if (it != ',')
n = n * 10 + (it - '0');
else {
s.insert(n);
n = 0;
}
}
s.insert(n);
vector<long long int> v;
for (auto it : s) v.push_back(it);
vector<long long int> temp;
temp.push_back(v[0]);
for (long long int i = 1; i < v.size(); i++) {
if (v[i] - v[i - 1] == 1)
temp.push_back(v[i]);
else {
if (temp.size() == 1)
cout << temp[0] << ',';
else
cout << temp[0] << '-' << temp[temp.size() - 1] << ',';
temp.erase(temp.begin(), temp.end());
temp.push_back(v[i]);
}
}
if (temp.size() != 0) {
if (temp.size() == 1)
cout << temp[0];
else
cout << temp[0] << '-' << temp[temp.size() - 1];
temp.erase(temp.begin(), temp.end());
}
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char _inBuf[32768];
int _ip = 0, _il = 0;
bool _ioError = false;
inline char nc() {
if (_ip == _il) {
_il = fread(_inBuf, 1, 32768, stdin);
_ip = 0;
if (_il == 0) {
_ioError = true;
return -1;
}
}
return _inBuf[_ip++];
}
inline int ni() {
char ch = nc();
for (; ch == ' ' || ch == '\t' || ch == '\n'; ch = nc())
;
if (_ioError) return -1;
int sign = 1;
if (ch == '-') {
sign = -1;
ch = nc();
}
int res = 0;
for (; ch >= '0' && ch <= '9'; ch = nc()) {
res = ((res << 3) + (res << 1));
res += ch - '0';
}
return sign * res;
}
inline long long nl() {
char ch = nc();
for (; ch == ' ' || ch == '\t' || ch == '\n'; ch = nc())
;
if (_ioError) return -1;
long long sign = 1;
if (ch == '-') {
sign = -1;
ch = nc();
}
long long res = 0;
for (; ch >= '0' && ch <= '9'; ch = nc()) {
res = ((res << 3) + (res << 1));
res += ch - '0';
}
return sign * res;
}
inline int ns(char* s) {
char* os = s;
char ch = nc();
for (; ch == ' ' || ch == '\t' || ch == '\n'; ch = nc())
;
if (_ioError) return 0;
for (; ch != ' ' && ch != '\t' && ch != '\n' && !_ioError; ch = nc()) {
*s++ = ch;
}
*s = '\0';
return s - os;
}
char _outBuf[32768];
int _op = 0;
inline void out(char ch) {
if (_op == 32768) {
fwrite(_outBuf, 1, 32768, stdout);
_op = 0;
}
_outBuf[_op++] = ch;
}
inline void out(int v) {
static char s[10];
if (v == 0) {
out('0');
return;
}
if (v < 0) {
out('-');
v = -v;
}
int sp = 0;
while (v > 0) {
s[sp++] = v % 10 + '0';
v /= 10;
}
while (--sp >= 0) out(s[sp]);
}
inline void out(long long v) {
static char s[20];
if (v == 0) {
out('0');
return;
}
if (v < 0) {
out('-');
v = -v;
}
int sp = 0;
while (v > 0) {
s[sp++] = v % 10 + '0';
v /= 10;
}
while (--sp >= 0) out(s[sp]);
}
inline void out(const char* s) {
for (; *s != '\0'; s++) out(*s);
}
inline void _flush() {
if (_op > 0) {
fwrite(_outBuf, 1, _op, stdout);
_op = 0;
}
}
void solve();
int main() {
solve();
_flush();
return 0;
}
int a[100];
void solve() {
int cnt = 0;
char s[10];
for (;;) {
int v;
scanf("%d", &v);
a[cnt++] = v;
if (getc(stdin) == -1) break;
}
sort(a, a + cnt);
cnt = unique(a, a + cnt) - a;
for (int i = 0; i < cnt;) {
if (i != 0) printf(",");
int j = i;
for (; j < cnt - 1 && a[j] + 1 == a[j + 1]; j++)
;
if (j - i == 0) {
printf("%d", a[i]);
++i;
} else {
printf("%d-%d", a[i], a[j]);
i = j + 1;
}
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> w(1007);
int sttoi(string a) {
int k = 0, i = 1;
while (a.length()) {
k += (a[a.length() - 1] - '0') * i;
i *= 10;
a.pop_back();
}
return k;
}
string itos(int a) {
string b = "";
while (a) {
b += a % 10 + '0';
a /= 10;
}
reverse(b.begin(), b.end());
return b;
}
vector<int> uniqvint(vector<int> v) {
sort(v.begin(), v.end());
std::vector<int>::iterator it;
it = std::unique(v.begin(), v.end());
v.resize(std::distance(v.begin(), it));
return v;
}
vector<string> uniqvstr(vector<string> v) {
sort(v.begin(), v.end());
std::vector<string>::iterator it;
it = std::unique(v.begin(), v.end());
v.resize(std::distance(v.begin(), it));
return v;
}
int main() {
string s;
cin >> s;
vector<string> l(s.length());
for (int i = 0, j = 0; i < s.length(); i++)
if (s[i] == ',') {
j++;
} else {
l[j] += s[i];
}
uniqvstr(l);
vector<int> v(0);
for (int i = 0; i < l.size(); i++) {
v.push_back(sttoi(l[i]));
}
for (int i = 0; i < v.size(); i++) {
w[v[i]] = v[i];
}
string p = "";
for (int i = 1; i < w.size() - 1; i++) {
if (w[i - 1] == 0 && w[i] != 0 && w[i + 1] != 0) {
p += (itos(w[i])), p += '-';
} else if (w[i + 1] == 0 && w[i] != 0 && w[i - 1] != 0) {
p += (itos(w[i])), p += ',';
} else if (w[i - 1] == 0 && w[i] != 0 && w[i + 1] == 0) {
p += (itos(w[i])), p += ',';
}
}
for (int i = 0; i < p.length() - 1; i++) {
cout << p[i];
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<bool> have(1001, false);
vector<int> nums;
bool firsttime = true;
int n = 0, cur = 0, i;
string str;
cin >> str;
for (i = 0; i < str.size(); i++) {
if (str[i] == ',') {
if (!have[cur]) {
have[cur] = true;
nums.push_back(cur);
}
cur = 0;
} else {
cur = cur * 10 + (int)str[i] - (int)'0';
}
}
if (!have[cur]) {
have[cur] = true;
nums.push_back(cur);
}
sort(nums.begin(), nums.end());
int st, fn;
st = nums[0];
fn = st;
for (i = 1; i < nums.size(); i++) {
if (nums[i] == fn + 1) {
fn++;
} else {
if (fn == st) {
if (!firsttime) {
cout << "," << st;
} else {
cout << st;
}
firsttime = false;
} else {
if (!firsttime) {
cout << "," << st << "-" << fn;
} else {
cout << st << "-" << fn;
}
firsttime = false;
}
st = nums[i];
fn = st;
}
}
if (fn == st) {
if (!firsttime) {
cout << "," << st;
} else {
cout << st;
}
firsttime = false;
} else {
if (!firsttime) {
cout << "," << st << "-" << fn;
} else {
cout << st << "-" << fn;
}
firsttime = false;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1010];
char s[1010];
int main() {
int i, n = 0, x = 0;
scanf("%s", s);
for (i = 0; s[i]; i++) {
if (s[i] == ',')
a[++n] = x, x = 0;
else
x = x * 10 + s[i] - '0';
}
a[++n] = x;
sort(a + 1, a + n + 1);
int l = a[1], r = a[1], flag = 0;
for (i = 2; i <= n; i++) {
if (a[i] == r) continue;
if (a[i] == r + 1)
r = a[i];
else {
if (flag == 0)
flag = 1;
else
printf(",");
if (l == r)
printf("%d", l);
else
printf("%d-%d", l, r);
l = a[i];
r = a[i];
}
}
if (flag == 0)
flag = 1;
else
printf(",");
if (l == r)
printf("%d", l);
else
printf("%d-%d", l, r);
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
bool mk[1001] = {false};
int avl[101] = {0};
string pstr;
int main() {
int r = 0;
cin >> pstr;
for (int i = 0; i < pstr.size(); ++i) {
int n = 0;
while (i < pstr.size() && pstr[i] != ',') n = n * 10 + (pstr[i] - '0'), ++i;
if (!mk[n]) avl[r++] = n, mk[n] = true;
}
sort(avl, avl + r);
bool mk = false;
for (int i = 0; i < r; ++i) {
if (i == 0) {
printf("%d", avl[0]);
continue;
}
if (avl[i] - 1 == avl[i - 1]) {
if (!mk) {
mk = true;
}
} else {
if (mk) printf("-%d", avl[i - 1]), mk = false;
printf(",%d", avl[i]);
}
}
if (mk) printf("-%d", avl[r - 1]);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char a[1005];
int i, b[5006] = {0}, shu = 0, d, ans = 1;
gets(a);
d = strlen(a);
a[-1] = 'p';
for (i = d - 1; i >= -1; i--) {
if (a[i] >= '0' && a[i] <= '9') {
shu += ans * (a[i] - '0');
ans *= 10;
} else {
b[shu]++;
shu = 0;
ans = 1;
}
}
int left, right[5005] = {0}, m = 1;
for (i = 1; i < 5005; i++) {
if (b[i] != 0 && b[i - 1] == 0) left = i;
if (b[i] == 0 && b[i - 1] != 0) {
right[m++] = i - 1;
if (left != right[m - 1]) {
if (right[m - 2] == 0)
printf("%d-%d", left, right[m - 1]);
else
printf(",%d-%d", left, right[m - 1]);
} else {
if (right[m - 2] == 0)
printf("%d", left);
else
printf(",%d", left);
}
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> Num;
void Convert(string s) {
stringstream ss;
int n;
string w = "";
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] != ',') {
w += s[i];
if (i == (int)s.size() - 1) {
ss << w;
ss >> n;
ss.clear();
Num.push_back(n);
w = "";
}
} else {
ss << w;
ss >> n;
ss.clear();
Num.push_back(n);
w = "";
}
}
}
void Sort(vector<int>& a, int n) {
int i = n / 2, k, t;
while (i) {
for (int j = i; j < n; j++) {
k = j;
t = a[j];
while (k >= i && t < a[k - i]) a[k] = a[k - i], k -= i;
a[k] = t;
}
i /= 2;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
string s;
cin >> s;
Convert(s);
set<int> st;
vector<int> v;
Sort(Num, (int)Num.size());
for (int i = 0; i < (int)Num.size(); i++) st.insert(Num[i]);
set<int>::iterator it;
for (it = st.begin(); it != st.end(); it++) v.push_back(*it);
int a, b;
bool ok = 0;
for (int i = 0; i < (int)v.size(); i++) {
if (v[i + 1] - v[i] == 1 && i + 1 != (int)v.size()) {
a = v[i];
b = v[i + 1];
for (int j = i + 1; j < (int)v.size(); j++) {
if (v[j] - v[j - 1] == 1) {
b = v[j];
if (j == (int)v.size() - 1) i = j;
} else {
i = j - 1;
break;
}
}
if (ok) cout << ',';
cout << a << '-' << b;
ok = 1;
} else {
if (ok) cout << ',';
cout << v[i];
ok = 1;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100010];
int main() {
char c[10];
int a[128];
int i = 0;
int j = 0;
cin >> str;
int k = 0;
memset(c, 0, sizeof(c));
while (str[i] != '\0') {
if (str[i] != ',') {
c[j++] = str[i++];
} else {
sscanf(c, "%d", &a[k++]);
j = 0;
i++;
memset(c, 0, sizeof(c));
}
}
sscanf(c, "%d", &a[k]);
int n = k;
sort(a, a + n + 1);
vector<int> seq;
int l = a[0], r = a[0];
for (int i = 1; i <= n; i++) {
if (a[i] - a[i - 1] > 1) {
seq.push_back(l);
seq.push_back(r);
r = a[i];
l = a[i];
} else {
r = a[i];
}
}
seq.push_back(l);
seq.push_back(r);
for (int i = 0; i <= seq.size() - 2;) {
if (seq[i] == seq[i + 1]) {
printf("%d", seq[i]);
if (i + 4 <= seq.size()) {
printf(",");
}
} else {
printf("%d-%d", seq[i], seq[i + 1]);
if (i + 4 <= seq.size()) {
printf(",");
}
}
i += 2;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1004];
int main() {
int n;
string s;
cin >> s;
int x = 0;
int mx = -1;
for (int i = 0; i < s.size(); i++) {
if (s[i] != ',')
x = x * 10 + (s[i] - '0');
else {
a[x] = 1;
mx = max(x, mx);
x = 0;
}
}
a[x] = 1;
mx = max(x, mx);
int start = -1, en = 0;
for (int i = 1; i < 1004; i++) {
if (a[i] == 1 && start == -1) start = i;
if (a[i] == 1 && a[i + 1] == 0 && start == i) {
if (start != mx)
cout << start << ",";
else
cout << start;
} else if (a[i] == 1 && a[i + 1] == 0 && start != i) {
if (start != mx && i != mx)
cout << start << "-" << i << ",";
else
cout << start << "-" << i;
start = -1;
} else if (a[i] == 0)
start = -1;
}
return 0;
}
|
#include <bits/stdc++.h>
int a[1005];
int main() {
int x, i, j;
while (scanf("%d%*c", &x) != EOF) a[x] = 1;
bool flag = false;
for (i = j = 1; i < 1001; i = ++j)
if (a[i]) {
for (j = i; a[j]; ++j)
;
--j;
if (!flag)
flag = true;
else
printf(",");
if (i == j)
printf("%d", i);
else
printf("%d-%d", i, j);
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int ara[2000], cnt = 0;
int a, k = 0;
char c;
int main() {
while (c != '\n') {
cin >> a;
c = getchar();
ara[a] = 1;
}
while (k <= 1000) {
if (ara[k] != 0) {
if (cnt)
cout << ',';
else
cnt = 1;
cout << k;
int ans = k;
while (ara[k + 1] != 0) k++;
if (k != ans) cout << '-' << k;
}
k++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void openfile() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int main() {
string s;
cin >> s;
s += ',';
stringstream second(s);
int x;
char c;
set<int> S;
while (second >> x >> c) S.insert(x);
vector<int> v((S).begin(), (S).end());
cout << v[0];
bool ok = false;
for (int i = 1; i < v.size(); i++) {
if (v[i] == v[i - 1] + 1) {
if (!ok) cout << "-";
ok = true;
} else {
if (ok) cout << v[i - 1];
cout << "," << v[i];
ok = false;
}
}
if (ok) cout << v.back();
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[111], i = 1, s, n;
char q;
int main() {
cin >> a[1];
while (cin >> q >> a[++i])
;
i--;
sort(a + 1, a + i + 1);
s = a[1];
for (int j = 2; j <= i; j++) {
if (a[j] != a[j - 1] + 1 && a[j] != a[j - 1]) {
cout << a[j - 1] << ",";
s = a[j];
}
if (a[j - 1] == s && a[j] == a[j - 1] + 1) cout << a[j - 1] << "-";
}
cout << a[i];
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[1005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
long long ln = s.length(), lq = -1;
long long x = 0, st = 0, e;
for (long long i = 0; i < (long long)ln; i++) {
if (s[i] == ',') {
lq = i;
e = i - 1;
long long k = 1, num = 0;
while (e >= st) {
num += ((long long)(s[e] - '0')) * k;
k *= 10;
e--;
}
arr[x++] = num;
st = i + 1;
}
}
if (lq == -1) {
long long num1 = 0;
long long k1 = 1;
for (long long j = (ln - 1); j >= (long long)0; j--) {
num1 += (long long)(s[j] - '0') * k1;
k1 *= 10;
}
cout << num1 << endl;
return 0;
}
if (lq != -1) {
long long num = 0, k = 1;
for (long long j = (ln - 1); j >= (long long)lq + 1; j--) {
num += (long long)(s[j] - '0') * k;
k *= 10;
}
arr[x++] = num;
}
sort(arr, arr + x);
cout << arr[0];
bool h = false;
long long ans = arr[0];
for (long long i = (1); i < (long long)x; i++) {
if (arr[i] == arr[i - 1]) continue;
if (arr[i] - 1 == arr[i - 1]) {
h = true;
} else {
ans = arr[i];
if (h) {
cout << "-" << arr[i - 1] << "," << arr[i];
h = false;
} else {
cout << "," << arr[i];
}
}
}
if (arr[x - 1] != ans) cout << "-" << arr[x - 1];
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int INP, AM, REACHEOF;
const int BUFSIZE = (1 << 12) + 17;
char BUF[BUFSIZE + 1], *inp = BUF;
bool need[1011];
char s[100111];
int main() {
while (gets(s)) {
for (int i = 0, _a = (strlen(s)); i < _a; i++)
if (s[i] == ',') s[i] = ' ';
istringstream ss(s);
memset(need, false, sizeof need);
int u;
while (ss >> u) need[u] = true;
int i = 1;
vector<pair<int, int> > res;
while (i <= 1000) {
if (!need[i]) {
++i;
} else {
int j = i;
while (need[j + 1]) ++j;
res.push_back(make_pair(i, j));
i = j + 1;
}
}
for (int i = 0, _a = (res.size() - 1); i < _a; i++) {
if (res[i].first == res[i].second)
printf("%d,", res[i].first);
else
printf("%d-%d,", res[i].first, res[i].second);
}
i = res.size() - 1;
if (res[i].first == res[i].second)
printf("%d\n", res[i].first);
else
printf("%d-%d\n", res[i].first, res[i].second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[110] = {0};
int i, n = 0;
string s;
int st;
cin >> s;
s += ',';
int num = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] == ',') {
a[n] = num;
num = 0;
n++;
} else {
num *= 10;
num += s[i] - '0';
}
}
sort(a, a + n);
a[n] = 1000000;
st = a[0];
bool flag = false;
for (i = 1; i <= n; i++) {
if (a[i] - a[i - 1] > 1) {
if (flag) cout << ',';
flag = true;
if (st == a[i - 1])
cout << st;
else
cout << st << '-' << a[i - 1];
st = a[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool a[41][41];
long long d[41][41][41][41];
long long cld[41][41][41][41];
int cldh[41][41][41][41];
int lines_x[41][41];
int lines_y[41][41];
void print(int w, int e, int n, int m) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
printf("%d ", d[w][e][i][j]);
}
printf("\n");
}
}
int main() {
int n, m, q;
scanf("%d %d %d\n", &n, &m, &q);
char ch;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
scanf("%c", &(ch));
a[i][j] = ch == '0';
}
scanf("%c", &(ch));
}
for (int i = 0; i < n; ++i) {
lines_x[i][0] = a[i][0] ? 1 : 0;
for (int j = 1; j < m; ++j) {
if (!a[i][j])
lines_x[i][j] = 0;
else
lines_x[i][j] = lines_x[i][j - 1] + 1;
}
}
for (int j = 0; j < m; ++j) {
lines_y[0][j] = a[0][j] ? 1 : 0;
for (int i = 1; i < n; ++i) {
if (!a[i][j])
lines_y[i][j] = 0;
else
lines_y[i][j] = lines_y[i - 1][j] + 1;
}
}
for (int h = 0; h < n; ++h) {
for (int w = 0; w < m; ++w) {
for (int i = n - h - 1; i >= 0; --i) {
for (int j = m - w - 1; j >= 0; --j) {
if (h == 0 && w == 0) {
d[i][j][h][w] = a[i][j];
cld[i][j][h][w] = a[i][j];
cldh[i][j][h][w] = a[i][j];
} else {
long long c1 = h > 0 ? d[i][j][h - 1][w] : 0;
long long c2 = w > 0 ? d[i][j][h][w - 1] : 0;
long long c3 = w > 0 && h > 0 ? d[i][j][h - 1][w - 1] : 0;
if (!a[i + h][j + w]) {
d[i][j][h][w] = c1 + c2 - c3;
cld[i][j][h][w] = 0;
} else {
long long cy = max(min(lines_y[i + h][j + w] - 1, h), 0) + 1;
long long c4 = cy;
if (w > 0) {
if (cy < cldh[i][j][h][w - 1]) {
c4 += cld[i + h - cy + 1][j][cy - 1][w - 1];
} else
c4 += cld[i][j][h][w - 1];
}
cldh[i][j][h][w] = cy;
cld[i][j][h][w] = c4;
d[i][j][h][w] = c1 + c2 - c3 + c4;
}
}
}
}
}
}
int x1, y1, x2, y2;
for (int t = 0; t < q; ++t) {
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
x1 -= 1, y1 -= 1, x2 -= 1, y2 -= 1;
printf("%I64d\n", d[x1][y1][x2 - x1][y2 - y1]);
}
return 0;
}
|
#include <bits/stdc++.h>
int dp[50][50][50][50];
int sum[50][50];
char str[50][50];
int n, m, q;
int val(int a, int b, int c, int d) {
int ans = 0;
ans += sum[c][d];
if (a > 0) ans -= sum[a - 1][d];
if (b > 0) ans -= sum[c][b - 1];
if (a > 0 && b > 0) ans += sum[a - 1][b - 1];
return ans;
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 0; i < n; i++) {
scanf("%s", str[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
sum[i][j] = (str[i][j] == '1');
if (i) sum[i][j] += sum[i - 1][j];
if (j) sum[i][j] += sum[i][j - 1];
if (i && j) sum[i][j] -= sum[i - 1][j - 1];
}
}
for (int i = n - 1; i >= 0; i--) {
for (int j = m - 1; j >= 0; j--) {
for (int ii = i; ii < n; ii++) {
for (int jj = j; jj < m; jj++) {
int cnt = 0;
for (int iii = i; iii <= ii; iii++) {
for (int jjj = j; jjj <= jj; jjj++) {
if (val(iii, jjj, ii, jj) == 0) {
cnt++;
}
}
}
if (ii > i) cnt += dp[i][j][ii - 1][jj];
if (jj > j) cnt += dp[i][j][ii][jj - 1];
if (ii > i && jj > j) cnt -= dp[i][j][ii - 1][jj - 1];
dp[i][j][ii][jj] = cnt;
}
}
}
}
for (int i = 0; i < q; i++) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d\n", dp[a - 1][b - 1][c - 1][d - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 45;
int n, m, q;
int sum[MAXN][MAXN], f[MAXN][MAXN][MAXN][MAXN];
int get_sum(int i, int j, int ii, int jj) {
return sum[ii][jj] - sum[i - 1][jj] - sum[ii][j - 1] + sum[i - 1][j - 1];
}
void calcF(int f[MAXN][MAXN]) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + f[i][j];
}
int ans[MAXN][MAXN][MAXN][MAXN];
int t[MAXN][MAXN];
string s[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m >> q;
for (int i = 0; i < n; i++) cin >> s[i];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) sum[i][j] = s[i - 1][j - 1] - '0';
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + sum[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int ii = i; ii <= n; ii++)
for (int jj = j; jj <= m; jj++) {
int x = get_sum(i, j, ii, jj);
if (x == 0) f[i][j][ii][jj]++;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) calcF(f[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
memset(t, 0, sizeof(t));
for (int ii = n; ii > 0; ii--)
for (int jj = m; jj > 0; jj--) {
t[ii][jj] = t[ii + 1][jj] + t[ii][jj + 1] - t[ii + 1][jj + 1] +
f[ii][jj][i][j];
ans[ii][jj][i][j] = t[ii][jj];
}
}
while (q--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << ans[a][b][c][d] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int dp[42][42][42][42];
int acc[42][42], arr[42][42];
int beut[42][42][42][42];
int sx[] = {-1, 0, -1};
int sy[] = {0, -1, -1};
int solve(int i1, int j1, int i2, int j2) {
if (i2 < i1 || j2 < j1) return 0;
int &ret = dp[i1][j1][i2][j2];
if (ret != -1) return ret;
ret = 0;
ret += beut[i1][j1][i2][j2];
for (int i = 0; i < 2; i++) ret += solve(i1, j1, i2 + sx[i], j2 + sy[i]);
ret -= solve(i1, j1, i2 + sx[2], j2 + sy[2]);
return ret;
}
int main() {
cin >> n >> m >> q;
n++;
m++;
string s;
for (int i = 1; i < n; i++) {
cin >> s;
for (int j = 1; j < m; j++) {
arr[i][j] = s[j - 1] - '0';
}
}
for (int i = 1; i < n; i++)
for (int j = 1; j < m; j++) {
acc[i][j] = acc[i - 1][j] + acc[i][j - 1] - acc[i - 1][j - 1] + arr[i][j];
}
for (int i1 = 1; i1 < n; i1++)
for (int i2 = i1; i2 < n; i2++)
for (int j1 = 1; j1 < m; j1++)
for (int j2 = j1; j2 < m; j2++) {
int sum = acc[i2][j2] + acc[i1 - 1][j1 - 1] - acc[i2][j1 - 1] -
acc[i1 - 1][j2];
if (sum == 0) {
beut[i1][j1][i2][j2] = 1;
}
}
memset(dp, -1, sizeof dp);
int a2, a1, b1, b2;
for (int i = 0; i < q; i++) {
cin >> a1 >> b1 >> a2 >> b2;
long long ret = 0;
for (int i = a1; i <= a2; i++)
for (int j = b1; j <= b2; j++) ret += solve(i, j, a2, b2);
cout << ret << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int row[55][55];
char a[55][55];
int dp[55][55][55][55];
int main() {
int n, m, q;
while (~scanf("%d%d%d", &n, &m, &q)) {
for (int i = 1; i <= n; i++) {
scanf("%s", a[i] + 1);
}
memset(dp, 0, sizeof(dp));
memset(row, 0, sizeof(row));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] == '0')
row[i][j] = row[i][j - 1] + 1;
else
row[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = i; k <= n; k++) {
for (int l = j; l <= m; l++) {
dp[i][j][k][l] = dp[i][j][k][l - 1] + dp[i][j][k - 1][l] -
dp[i][j][k - 1][l - 1];
int r = l - j + 1;
for (int z = k; z >= i; z--) {
r = min(r, row[z][l]);
dp[i][j][k][l] += r;
}
}
}
}
}
while (q--) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d\n", dp[a][b][c][d]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
char s[50][50];
long long sub[50][50];
long long dat[50][50][50][50];
long long f[50][50][50][50];
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
sub[i][j] = sub[i - 1][j] + sub[i][j - 1] - sub[i - 1][j - 1];
if (s[i][j] == '1') sub[i][j]++;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int a = i; a <= n; a++)
for (int b = j; b <= m; b++) {
int val =
sub[a][b] - sub[i - 1][b] - sub[a][j - 1] + sub[i - 1][j - 1];
if (val == 0) dat[i][j][a][b]++;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int a = 1; a <= n; a++)
for (int b = 1; b <= m; b++) {
f[i][j][a][b] =
f[i - 1][j][a][b] + f[i][j - 1][a][b] + f[i][j][a - 1][b] +
f[i][j][a][b - 1] - f[i - 1][j - 1][a][b] -
f[i - 1][j][a - 1][b] - f[i - 1][j][a][b - 1] -
f[i][j - 1][a - 1][b] - f[i][j - 1][a][b - 1] -
f[i][j][a - 1][b - 1] + f[i][j - 1][a - 1][b - 1] +
f[i - 1][j][a - 1][b - 1] + f[i - 1][j - 1][a][b - 1] +
f[i - 1][j - 1][a - 1][b] - f[i - 1][j - 1][a - 1][b - 1] +
dat[i][j][a][b];
}
while (q--) {
int i, j, a, b;
cin >> i >> j >> a >> b;
i--;
j--;
cout << f[a][b][a][b] - f[i][b][a][b] - f[a][j][a][b] - f[a][b][i][b] -
f[a][b][a][j] + f[i][j][a][b] + f[i][b][i][b] + f[i][b][a][j] +
f[a][j][i][b] + f[a][j][a][j] + f[a][b][i][j] - f[a][j][i][j] -
f[i][b][i][j] - f[i][j][a][j] - f[i][j][i][b] + f[i][j][i][j]
<< endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int st[1000000], n, m, q, a, b, c, d, h[100], ans, sum;
char map[100][100];
int main() {
scanf("%d%d%d\n", &n, &m, &q);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) scanf("%c", &map[i][j]);
scanf("\n");
}
while (q--) {
scanf("%d%d%d%d\n", &a, &b, &c, &d);
for (int i = 1; i <= m; ++i) h[i] = 0;
ans = 0;
for (int i = a, cnt; i <= c; ++i) {
sum = cnt = 0;
st[++cnt] = b - 1;
for (int j = b; j <= d; ++j) {
if (map[i][j] == '1')
h[j] = 0;
else
++h[j];
while (cnt && h[st[cnt]] >= h[j]) {
sum -= h[st[cnt]] * (st[cnt] - st[cnt - 1]);
--cnt;
}
st[++cnt] = j;
sum += h[j] * (st[cnt] - st[cnt - 1]);
ans += sum;
}
}
printf("%d\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 0.0000001;
const double PI = acos(-1);
const long long INFLL = 0x7FFFFFFFFFFFFFFF;
const int INF = 0x7FFFFFFF;
template <typename T>
inline void next(T &num) {
char c;
num = 0;
do {
c = getchar_unlocked();
} while (c != EOF && c == ' ' && c == '\n' && c == '\t');
int sign = (c == '-' ? -1 : 1);
if (c != '-') num += (c - '0');
while ((c = getchar_unlocked()) != EOF && c != '\n' && c != '\t' &&
c != ' ') {
num *= 10;
num += (c - '0');
}
num *= sign;
}
inline string getstr() {
string str;
char k;
while ((k = getchar_unlocked()) == ' ' || k == '\n') {
k = getchar_unlocked();
if (k == ' ' || k == '\n')
continue;
else
break;
}
str.push_back(k);
while ((k = getchar_unlocked()) != EOF && k != '\n' && k != '\t' &&
k != '\v' && k != '\0' && k != ' ')
str.push_back(k);
return str;
}
int h[45][45][45][45], x[45][45], n, m, q;
int main() {
cin >> n >> m >> q;
for (int i = int(1), _b = int(n); i <= _b; i++) {
getchar_unlocked();
for (int j = int(1), _b = int(m); j <= _b; j++)
x[i][j] = (getchar_unlocked() - '0') + x[i - 1][j] + x[i][j - 1] -
x[i - 1][j - 1];
}
for (int a = int(1), _b = int(n); a <= _b; a++)
for (int b = int(1), _b = int(m); b <= _b; b++)
for (int c = int(a), _b = int(n); c <= _b; c++)
for (int d = int(b), _b = int(m); d <= _b; d++) {
int sum = x[c][d] + x[a - 1][b - 1] - x[c][b - 1] - x[a - 1][d];
h[a][b][c][d] = (sum == 0);
}
for (int a = int(n), _b = int(1); a >= _b; a--)
for (int b = int(1), _b = int(m); b <= _b; b++)
for (int c = int(a), _b = int(n); c <= _b; c++)
for (int d = int(b), _b = int(m); d <= _b; d++)
h[a][b][c][d] += h[a + 1][b][c][d];
for (int a = int(1), _b = int(n); a <= _b; a++)
for (int b = int(m), _b = int(1); b >= _b; b--)
for (int c = int(a), _b = int(n); c <= _b; c++)
for (int d = int(b), _b = int(m); d <= _b; d++)
h[a][b][c][d] += h[a][b + 1][c][d];
for (int a = int(1), _b = int(n); a <= _b; a++)
for (int b = int(1), _b = int(m); b <= _b; b++)
for (int c = int(a), _b = int(n); c <= _b; c++)
for (int d = int(b), _b = int(m); d <= _b; d++)
h[a][b][c][d] += h[a][b][c - 1][d];
for (int a = int(1), _b = int(n); a <= _b; a++)
for (int b = int(1), _b = int(m); b <= _b; b++)
for (int c = int(a), _b = int(n); c <= _b; c++)
for (int d = int(b), _b = int(m); d <= _b; d++)
h[a][b][c][d] += h[a][b][c][d - 1];
while (q--) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d\n", h[a][b][c][d]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int *mem, *rl, n, m;
char mp[41][41];
int right_left(int r, int c, int rmin, int cmin) {
int index = (rmin - 1) * m * n * m + (cmin - 1) * n * m + (r - 1) * m + c - 1;
if (rl[index] != -1)
return rl[index];
else {
int len = r - rmin + 1, *tw = new int[len], ans = 0, mini;
memset(tw, 0, len * 4);
for (int i = 0; i < len; i++) {
int j = 0;
while (mp[r - i][c - j] == '0' && j <= c - cmin) {
tw[i]++;
j++;
}
}
mini = tw[0];
for (int i = 0; i < len; i++) {
if (mini > tw[i]) mini = tw[i];
ans += mini;
}
delete[] tw;
return rl[index] = ans;
}
}
int f(int a, int b, int c, int d) {
int index = (a - 1) * m * n * m + (b - 1) * n * m + (c - 1) * m + d - 1;
if (mem[index] != -1)
return mem[index];
else {
int ans = 0;
for (int row = a; row <= c; row++)
for (int col = b; col <= d; col++) ans += right_left(row, col, a, b);
return mem[index] = ans;
}
}
int main() {
int cas, a, b, c, d;
for (int i = 0; i < 41; i++) mp[i][0] = mp[0][i] = '1';
while (cin >> n >> m >> cas) {
mem = new int[n * m * n * m];
rl = new int[n * m * n * m];
memset(mem, -1, n * m * n * m * 4);
memset(rl, -1, n * m * n * m * 4);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> mp[i][j];
while (cas--) {
cin >> a >> b >> c >> d;
(cout << f(a, b, c, d) << endl);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[41][41];
int ans[41][41][41][41];
int up[41][41];
int main() {
int n, m, q;
cin >> n >> m >> q;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char x;
cin >> x;
a[i][j] = x - '0';
if (a[i][j] == 1)
up[i][j] = 0;
else
up[i][j] = up[i - 1][j] + 1;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int i1 = i; i1 <= n; i1++) {
for (int j1 = j; j1 <= m; j1++) {
ans[i][j][i1][j1] = ans[i][j][i1][j1 - 1] + ans[i][j][i1 - 1][j1] -
ans[i][j][i1 - 1][j1 - 1];
if (a[i1][j1] == 1) continue;
int mx = i1 - i + 1;
for (int jj = j1; jj >= j; jj--) {
mx = min(mx, up[i1][jj]);
ans[i][j][i1][j1] += mx;
}
}
}
}
}
while (q--) {
int x, y, x1, y1;
cin >> x >> y >> x1 >> y1;
cout << ans[x][y][x1][y1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const double EPS = 1e-8;
const int INF = 0x3fffffff;
const int MX = 41;
int g_m, g_n, g_k;
int in[MX][MX];
int sum[MX][MX];
int dp[MX][MX][MX][MX];
bool input() {
cin >> g_m >> g_n >> g_k;
if (cin.eof()) return false;
for (int i = 1; i <= g_m; ++i) {
for (int j = 1; j <= g_n; ++j) {
scanf("%1d", &in[i][j]);
sum[i][j] = sum[i][j - 1];
if (in[i][j] == 1)
sum[i][j] = 0;
else
++sum[i][j];
}
}
return true;
}
void solve() {
int x_1, y_1, x_2, y_2;
for (x_1 = 1; x_1 <= g_m; ++x_1) {
for (y_1 = 1; y_1 <= g_n; ++y_1) {
for (x_2 = x_1; x_2 <= g_m; ++x_2) {
for (y_2 = y_1; y_2 <= g_n; ++y_2) {
dp[x_1][y_1][x_2][y_2] = dp[x_1][y_1][x_2][y_2 - 1] +
dp[x_1][y_1][x_2 - 1][y_2] -
dp[x_1][y_1][x_2 - 1][y_2 - 1];
int n = y_2 - y_1 + 1;
for (int x_t = x_2; x_t >= x_1; --x_t) {
n = min(n, sum[x_t][y_2]);
dp[x_1][y_1][x_2][y_2] += n;
}
}
}
}
}
for (int i = 0; i < g_k; ++i) {
scanf("%d%d%d%d", &x_1, &y_1, &x_2, &y_2);
printf("%d\n", dp[x_1][y_1][x_2][y_2]);
}
}
int main() {
while (input()) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
int f[45][45][45][45], up[45][45];
char ch[45][45];
int main() {
int n, m, cao;
cin >> n >> m >> cao;
memset(up, 0, sizeof(up));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> ch[i][j];
if (ch[i][j] == '0')
up[i][j] = up[i - 1][j] + 1;
else
up[i][j] = 0;
}
memset(f, 0, sizeof(f));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int k = i; k <= n; k++)
for (int l = j; l <= m; l++) {
f[i][j][k][l] =
f[i][j][k - 1][l] + f[i][j][k][l - 1] - f[i][j][k - 1][l - 1];
int minn = min(k - i + 1, up[k][l]);
for (int o = l; o >= j; o--) {
if (up[k][o] < minn) minn = up[k][o];
if (minn == 0) break;
f[i][j][k][l] += minn;
}
}
while (cao--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << f[a][b][c][d] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int sum[41][41];
int dp[40][40][40][40];
int dfs(int x1, int y1, int x2, int y2) {
int l, r, m, x, y, ans = 0;
if (dp[x1][y1][x2][y2] != -1) return dp[x1][y1][x2][y2];
if (sum[x2 + 1][y2 + 1] - sum[x2 + 1][y1] - sum[x1][y2 + 1] + sum[x1][y1] ==
0) {
x = x2 - x1 + 1;
y = y2 - y1 + 1;
return dp[x1][y1][x2][y2] = x * (x + 1) / 2 * y * (y + 1) / 2;
}
l = x1 - 1, r = x2 + 1, m = (l + r) / 2;
while (r - l > 1) {
if (sum[m][y2 + 1] - sum[m][y1] - sum[x1][y2 + 1] + sum[x1][y1] > 0) {
r = m;
m = (l + r) / 2;
} else {
l = m;
m = (l + r) / 2;
}
}
x = r;
l = y1 - 1;
r = y2 + 1, m = (l + r) / 2;
while (r - l > 1) {
if (sum[x][m] - sum[x][y1] - sum[x1][m] + sum[x1][y1] > 0) {
r = m;
m = (l + r) / 2;
} else {
l = m;
m = (l + r) / 2;
}
}
y = r;
x--;
y--;
if (x1 <= x - 1) ans += dfs(x1, y1, x - 1, y2);
if (x2 >= x + 1) ans += dfs(x + 1, y1, x2, y2);
if (y1 <= y - 1) ans += dfs(x1, y1, x2, y - 1);
if (y2 >= y + 1) ans += dfs(x1, y + 1, x2, y2);
if (x1 <= x - 1 && y1 <= y - 1) ans -= dfs(x1, y1, x - 1, y - 1);
if (x1 <= x - 1 && y2 >= y + 1) ans -= dfs(x1, y + 1, x - 1, y2);
if (x2 >= x + 1 && y1 <= y - 1) ans -= dfs(x + 1, y1, x2, y - 1);
if (x2 >= x + 1 && y2 >= y + 1) ans -= dfs(x + 1, y + 1, x2, y2);
return dp[x1][y1][x2][y2] = ans;
}
int main() {
int n, m, q, i, j, k, l;
int a[40][40];
scanf("%d %d %d", &n, &m, &q);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%1d", &a[i][j]);
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
for (k = 0; k < n; k++) {
for (l = 0; l < m; l++) {
dp[i][j][k][l] = -1;
}
}
}
}
for (i = 0; i < q; i++) {
int x1, y1, x2, y2;
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
x1--;
y1--;
x2--;
y2--;
printf("%d\n", dfs(x1, y1, x2, y2));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long dp[45][45][45][45];
char a[45][45];
long long sum[45][45];
inline long long Sum(int x1, int y1, int x2, int y2) {
return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
}
long long Rect(long long x, long long y) {
long long Cx = x * (x - 1) / 2;
long long Cy = y * (y - 1) / 2;
return Cx * Cy + x * Cy + y * Cx + x * y;
}
void One(int x1, int y1, int x2, int y2, int &x, int &y) {
x = x1, y = y1;
while (Sum(x1, y1, x, y2) == 0) x++;
while (a[x][y] == '0') y++;
}
long long f(int x1, int y1, int x2, int y2) {
if (x2 < x1 || y2 < y1) return 0;
if (dp[x1][y1][x2][y2] != -1) return dp[x1][y1][x2][y2];
long long ans = 0;
if (Sum(x1, y1, x2, y2) == 0)
ans = Rect(x2 - x1 + 1, y2 - y1 + 1);
else {
int x, y;
One(x1, y1, x2, y2, x, y);
ans = f(x1, y1, x - 1, y2) + f(x1, y1, x2, y - 1) + f(x + 1, y1, x2, y2) +
f(x1, y + 1, x2, y2);
ans -= f(x1, y1, x - 1, y - 1) + f(x + 1, y1, x2, y - 1) +
f(x1, y + 1, x - 1, y2) + f(x + 1, y + 1, x2, y2);
}
dp[x1][y1][x2][y2] = ans;
return ans;
}
int main() {
int n, m, q;
cin >> n >> m >> q;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> a[j][i];
sum[j][i] = sum[j - 1][i] + sum[j][i - 1] - sum[j - 1][i - 1];
if (a[j][i] == '1') sum[j][i]++;
}
int b, c, d, e;
while (q--) {
scanf("%d", &b);
scanf("%d", &c);
scanf("%d", &d);
scanf("%d", &e);
int ans = f(c, b, e, d);
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 42;
long long dp[N][N][N][N], g[N][N], m, n, a[N][N], q, mn, a1, a2, a3, a4;
char w;
int main() {
cin >> n >> m >> q;
for (long long i = 1; i < n + 1; i++) {
for (long long j = 1; j < m + 1; j++) {
cin >> w;
a[i][j] = (w == '1');
}
}
for (long long x = 1; x < n + 1; x++) {
for (long long y = 1; y < m + 1; y++)
g[x][y] = (g[x - 1][y] + (a[x][y] == 0)) * (a[x][y] == 0);
}
for (long long x = 1; x < n + 1; x++) {
for (long long y = 1; y < m + 1; y++) {
for (long long i = 1; i < x + 1; i++) {
for (long long j = 1; j < y + 1; j++) {
dp[i][j][x][y] =
dp[i][j][x][y - 1] + dp[i][j][x - 1][y] - dp[i][j][x - 1][y - 1];
mn = x - i + 1;
for (long long p = y; p >= j; p--) {
mn = min(mn, g[x][p]);
;
dp[i][j][x][y] += mn;
}
}
}
}
}
for (long long i = 0; i < q; i++) {
cin >> a1 >> a2 >> a3 >> a4;
cout << dp[a1][a2][a3][a4] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[42][42][42][42];
int aux[42][42][42][42];
int aux2[42][42];
int n, m, q;
string s[50];
map<long long, int> mapka;
int ans(int x, int y, int w, int h, int W, int H) {
return cnt[x + w - 1][y + h - 1][W - w + 1][H - h + 1] -
cnt[x + w - 1][y - 1][W - w + 1][H - h + 1] -
cnt[x - 1][y + h - 1][W - w + 1][H - h + 1] +
cnt[x - 1][y - 1][W - w + 1][H - h + 1];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> q;
for (int i = 0; i < n; ++i) cin >> s[i];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
aux2[i][j] = aux2[i - 1][j] + aux2[i][j - 1] - aux2[i - 1][j - 1] +
(s[i - 1][j - 1] - '0');
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
for (int w = i; w < n; ++w)
for (int h = j; h < m; ++h) {
if ((aux2[w + 1][h + 1] - aux2[w + 1][j] - aux2[i][h + 1] +
aux2[i][j]) == 0)
aux[i + 1][j + 1][w - i + 1][h - j + 1]++;
}
for (int w = 1; w <= n; ++w)
for (int h = 1; h <= m; ++h) {
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
cnt[i][j][w][h] = cnt[i - 1][j][w][h] + cnt[i][j - 1][w][h] -
cnt[i - 1][j - 1][w][h] + aux[i][j][w][h];
}
while (q--) {
int x, y, z, t;
cin >> x >> y >> z >> t;
int nn = z - x + 1;
int mm = t - y + 1;
long long k = x * 1000000000000000l + y * 1000000000l + z * 100000l + t;
if (mapka.find(k) == mapka.end()) {
int res = 0;
for (int i = 1; i <= nn; ++i)
for (int j = 1; j <= mm; ++j) res += ans(x, y, i, j, nn, mm);
cout << res << "\n";
mapka[k] = res;
} else
cout << mapka[k] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int grid[45][45];
int numrec[45][45][45][45];
int main() {
int n, m, q;
cin >> n >> m >> q;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
for (int j = 1; j <= m; j++) grid[i][j] = s[j - 1] - '0';
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
grid[i][j] += grid[i - 1][j] + grid[i][j - 1] - grid[i - 1][j - 1];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int x = i; x > 0; x--)
for (int y = j; y > 0; y--) {
if (grid[i][j] + grid[x - 1][y - 1] ==
grid[x - 1][j] + grid[i][y - 1])
numrec[x][y][i][j]++;
numrec[x][y][i][j] += numrec[x + 1][y][i][j] +
numrec[x][y + 1][i][j] -
numrec[x + 1][y + 1][i][j];
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int x = i; x <= n; x++)
for (int y = j; y <= m; y++)
numrec[i][j][x][y] += numrec[i][j][x - 1][y] +
numrec[i][j][x][y - 1] -
numrec[i][j][x - 1][y - 1];
for (int i = 0; i < q; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << numrec[a][b][c][d] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char grid[50][50];
int H[50];
int stk[50];
int main() {
int n, m, q;
scanf("%d %d %d", &n, &m, &q);
for (int i = (int)(0); i < (int)(n); i++) scanf("%s", grid[i]);
while (q--) {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int ans = 0;
memset(H, 0, sizeof H);
a--;
b--;
for (int i = (int)(a); i < (int)(c); i++) {
int N = 1;
for (int j = (int)(b); j < (int)(d); j++) {
H[N]++;
if (grid[i][j] == '1') H[N] = 0;
N++;
}
H[0] = 0;
H[N++] = 0;
int top = 0;
for (int i = (int)(0); i < (int)(N); i++) {
while (top > 1 && H[stk[top - 1]] >= H[i]) {
top--;
int h = H[stk[top]];
int le = stk[top - 1];
int ri = i;
int w1 = stk[top] - le;
int w2 = ri - stk[top];
int plus = h * w1 * w2;
ans += plus;
}
stk[top++] = i;
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
int dp[45][45][45][45];
char A[45][45];
int T[45][45];
int MIN(int x, int y) { return x > y ? y : x; }
int main() {
int N, M, Q;
while (scanf("%d%d%d", &N, &M, &Q) != EOF) {
int i, j, k, l, p;
getchar();
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) scanf("%c", &A[i][j]);
getchar();
}
memset(T, 0, sizeof(T));
for (i = 1; i <= N; i++)
for (j = 1; j <= M; j++)
if (A[i][j] == '1')
T[i][j] = 0;
else
T[i][j] = T[i][j - 1] + 1;
memset(dp, 0, sizeof(dp));
for (i = 1; i <= N; i++)
for (j = 1; j <= M; j++)
for (k = i; k <= N; k++)
for (l = j; l <= M; l++) {
int tmp = dp[i][j][k][l - 1] + dp[i][j][k - 1][l] -
dp[i][j][k - 1][l - 1];
if (A[k][l] == '0') {
int L = MIN(T[k][l], l - j + 1);
for (p = 1; p <= k - i + 1; p++) {
if (A[k - p + 1][l] == '1') break;
L = MIN(L, T[k - p + 1][l]);
tmp += L;
}
}
dp[i][j][k][l] = tmp;
}
for (i = 1; i <= Q; i++) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d\n", dp[a][b][c][d]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[42][42];
long long int f[42][42];
long long int ans[42][42][42][42];
int main() {
long long int n, m, i, j, p, q, x, y, b, k, l, w, u, v, flag, z;
cin >> n >> m >> q;
char s[43];
char c;
for (i = 1; i <= n; i++) {
scanf("%s", s);
for (j = 1; j <= m; j++) {
c = s[j - 1];
if (c == '1')
z = 1;
else
z = 0;
a[i][j] = z;
f[i][j] = f[i][j - 1] + z;
}
}
for (j = 1; j <= m; j++) {
for (i = 1; i <= n; i++) {
f[i][j] = f[i][j] + f[i - 1][j];
}
}
for (l = 0; l <= n - 1; l++) {
for (w = 0; w <= m - 1; w++) {
for (u = 1; u <= n; u++) {
v = u + l;
if (v > n) break;
for (x = 1; x <= m; x++) {
y = x + w;
if (y > m) break;
if (x == y && u == v) {
z = a[u][x];
if (z == 1)
z = 0;
else
z = 1;
ans[u][v][x][y] = z;
} else if (u == v) {
flag = f[v][y] - f[v][x - 1] - f[u - 1][y] + f[u - 1][x - 1];
if (flag == 0)
flag = 1;
else
flag = 0;
ans[u][v][x][y] = flag + ans[u][v][x + 1][y] + ans[u][v][x][y - 1] -
ans[u][v][x + 1][y - 1];
} else if (x == y) {
flag = f[v][y] - f[v][x - 1] - f[u - 1][y] + f[u - 1][x - 1];
if (flag == 0)
flag = 1;
else
flag = 0;
ans[u][v][x][y] = flag + ans[u + 1][v][x][y] + ans[u][v - 1][x][y] -
ans[u + 1][v - 1][x][y];
} else {
flag = f[v][y] - f[v][x - 1] - f[u - 1][y] + f[u - 1][x - 1];
if (flag == 0)
flag = 1;
else
flag = 0;
ans[u][v][x][y] = flag + ans[u + 1][v][x][y] + ans[u][v - 1][x][y] +
ans[u][v][x + 1][y] + ans[u][v][x][y - 1];
ans[u][v][x][y] = ans[u][v][x][y] - ans[u][v][x + 1][y - 1] -
ans[u][v - 1][x][y - 1] -
ans[u][v - 1][x + 1][y] -
ans[u + 1][v - 1][x][y] -
ans[u + 1][v][x + 1][y] - ans[u + 1][v][x][y - 1];
ans[u][v][x][y] = ans[u][v][x][y] + ans[u][v - 1][x + 1][y - 1] +
ans[u + 1][v][x + 1][y - 1] +
ans[u + 1][v - 1][x][y - 1] +
ans[u + 1][v - 1][x + 1][y];
ans[u][v][x][y] = ans[u][v][x][y] - ans[u + 1][v - 1][x + 1][y - 1];
}
}
}
}
}
for (i = 1; i <= q; i++) {
scanf("%I64d%I64d%I64d%I64d", &u, &v, &x, &y);
printf("%I64d\n", ans[u][x][v][y]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000 * 1000 * 1000 + 7;
const int MXN = 50;
int n, m, q;
int dp[MXN][MXN][MXN][MXN];
int lt[MXN][MXN];
char a[MXN][MXN];
string t;
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n; i++) {
cin >> t;
for (int j = 1; j <= m; j++) a[i][j] = t[j - 1];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
lt[i][j] = lt[i][j - 1];
if (a[i][j] == '1') lt[i][j] = j;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = i; k <= n; k++) {
for (int l = j; l <= m; l++) {
dp[i][j][k][l] =
dp[i][j][k - 1][l] + dp[i][j][k][l - 1] - dp[i][j][k - 1][l - 1];
int cur = j - 1;
for (int q = k; q >= i; q--) {
if (a[q][l] == '1') break;
cur = max(cur, lt[q][l]);
dp[i][j][k][l] += l - cur;
}
}
}
}
}
while (q--) {
int x, y, z, q;
scanf("%d%d%d%d", &x, &y, &z, &q);
printf("%d\n", dp[x][y][z][q]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check[41][41];
int above[41][41];
int dp[41][41][41][41];
int main() {
int n, m, q, s1, s2, s3, s4;
char s[42];
scanf("%d %d %d", &n, &m, &q);
for (int i = 1; i <= n; i++) {
scanf("%s", s + 1);
for (int j = 1; j <= m; j++)
if (s[j] == '0') check[i][j] = 1, above[i][j] = above[i - 1][j] + 1;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int k = i; k <= n; k++)
for (int l = j; l <= m; l++) {
dp[i][j][k][l] =
dp[i][j][k - 1][l] + dp[i][j][k][l - 1] - dp[i][j][k - 1][l - 1];
int temp = min(k - i + 1, above[k][l]);
for (int p = l; p >= j; p--) {
temp = min(temp, above[k][p]);
if (temp == 0)
break;
else
dp[i][j][k][l] += temp;
}
}
for (int i = 0; i < q; i++)
scanf("%d %d %d %d", &s1, &s2, &s3, &s4),
printf("%d\n", dp[s1][s2][s3][s4]);
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
using namespace std;
inline long long in() {
long long x;
scanf("%lld", &x);
return x;
}
long long n, m, q;
long long dp[42][42][42][42], pre[42][42];
char a[41][41];
inline long long t(long long i) { return i ? -1 : 0; }
bool ok(long long a, long long b, long long c, long long d) {
return (pre[c][d] - pre[a - 1][d] - pre[c][b - 1] + pre[a - 1][b - 1]) == 0;
}
int32_t main() {
n = in();
m = in();
q = in();
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) cin >> a[i][j];
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) {
pre[i][j] = (a[i - 1][j - 1] - '0') + pre[i - 1][j] + pre[i][j - 1] -
pre[i - 1][j - 1];
}
for (long long i = n; i >= 1; i--)
for (long long j = m; j >= 1; j--)
for (long long k = i; k <= n; k++)
for (long long l = j; l <= m; l++) {
long long &r = dp[i][j][k][l];
r = ok(i, j, k, l);
for (long long mask = 1; mask < 16; mask++) {
r += ((__builtin_popcountll(mask) & 1) ? 1 : -1) *
dp[i - t(mask & 1)][j - t(mask & 2)][k + t(mask & 4)]
[l + t(mask & 8)];
}
}
long long a, b, c, d;
while (q--) {
a = in();
b = in();
c = in();
d = in();
cout << dp[a][b][c][d] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline char skipwhitespace() {
char ch = getchar();
while (ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t') ch = getchar();
return ch;
}
void gi(int &x) {
register int c = getchar();
x = 0;
int sn = 1;
for (; (c < 48 || c > 57); c = getchar())
if (c == '-') sn = -1;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
x *= sn;
}
void gii(long long int &x) {
register long long int c = getchar();
x = 0;
long long int sn = 1;
for (; (c < 48 || c > 57); c = getchar())
if (c == '-') sn = -1;
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
x *= sn;
}
void wi(int n) {
int sign = n >= 0 ? 1 : -1;
n = n > 0 ? n : -n;
char buf[10];
int i = 9;
if (!n) buf[i--] = 48;
while (n) {
buf[i--] = n % 10 + 48;
n /= 10;
}
if (sign < 0) printf("%c", '-');
while (++i < 10) printf("%c", buf[i]);
}
void wii(long long int n) {
long long int sign = n >= 0 ? 1 : -1;
n = n > 0 ? n : -n;
char buf[25];
long long int i = 24;
if (!n) buf[i--] = 48;
while (n) {
buf[i--] = n % 10 + 48;
n /= 10;
}
if (sign < 0) printf("%c", '-');
while (++i < 25) printf("%c", buf[i]);
}
int gs(char *s) {
char ch = skipwhitespace();
int n = 0;
while ((ch != '\n' && ch != ' ' && ch != '\t')) {
s[n++] = ch;
ch = getchar();
}
s[n] = 0;
return n;
}
void ws(char *s) {
char *p = s;
while (*p) {
printf("%c", *p);
p++;
}
}
char c;
int a[50][50], ans[50][50][50][50], cnt[50][50];
int main() {
int n, m, q;
gi(n);
gi(m);
gi(q);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
char c;
scanf(" %c", &c);
a[i][j] = c == '1';
}
for (int i1 = 0; i1 < n; i1++)
for (int j1 = 0; j1 < m; j1++) {
for (int i2 = i1; i2 <= n - 1; i2++)
for (int j2 = j1; j2 <= m - 1; j2++) {
int sum = 0;
if (i2 == i1) {
if (!a[i2][j2])
cnt[i2][j2] = 1;
else
cnt[i2][j2] = 0;
for (int k1 = j1; k1 <= j2; k1++) {
for (int k2 = k1; k2 <= j2; k2++)
if (!a[i2][k2])
sum++;
else
break;
}
ans[i1][j1][i2][j2] = sum;
} else {
if (!a[i2][j2])
cnt[i2][j2] = cnt[i2 - 1][j2] + 1;
else
cnt[i2][j2] = 0;
for (int k1 = j1; k1 <= j2; k1++) {
int x = numeric_limits<int>::max();
for (int k2 = k1; k2 <= j2; k2++) {
x = min(x, cnt[i2][k2]);
if (x == 0) break;
sum += x;
}
}
ans[i1][j1][i2][j2] = sum + ans[i1][j1][i2 - 1][j2];
}
}
}
while (q--) {
int i1, j1, i2, j2;
gi(i1);
gi(j1);
gi(i2);
gi(j2);
i1--;
j1--;
i2--;
j2--;
wi(ans[i1][j1][i2][j2]);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 40 + 10;
int n, m, q;
int sum[maxN][maxN], a[maxN][maxN];
int dp[maxN][maxN][maxN][maxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> q;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
char c;
cin >> c;
a[i][j] = c - '0';
if (a[i][j] == 0)
sum[i][j] = sum[i][j - 1] + 1;
else
sum[i][j] = 0;
}
for (int x1 = 1; x1 <= n; x1++) {
for (int y1 = 1; y1 <= m; y1++) {
for (int x2 = x1; x2 <= n; x2++) {
for (int y2 = y1; y2 <= m; y2++) {
dp[x1][y1][x2][y2] = dp[x1][y1][x2 - 1][y2] + dp[x1][y1][x2][y2 - 1] -
dp[x1][y1][x2 - 1][y2 - 1];
int mn = y2 - y1 + 1;
for (int i = x2; i >= x1; i--) {
if (sum[i][y2] < mn) mn = sum[i][y2];
dp[x1][y1][x2][y2] += mn;
}
}
}
}
}
for (int que = 0; que < q; que++) {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << dp[x1][y1][x2][y2] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[1001][1001], sum[1001][1001], dp[45][45][45][45];
int main() {
long long int i, j, k, l, n, m, q, ni, nj, nk, nl, mask, sign;
string s;
cin >> n >> m >> q;
for (i = 1; i <= n; i++) {
cin >> s;
s = " " + s;
for (j = 1; j <= m; j++) a[i][j] = s[j] - '0';
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
}
for (i = n; i >= 1; i--) {
for (j = m; j >= 1; j--) {
for (k = i; k <= n; k++) {
for (l = j; l <= m; l++) {
if (sum[k][l] - sum[k][j - 1] - sum[i - 1][l] + sum[i - 1][j - 1] ==
0)
dp[i][j][k][l]++;
for (mask = 1; mask < (1 << 4); mask++) {
if ((__builtin_popcount(mask)) % 2) {
sign = 1;
ni = i;
nj = j;
nk = k;
nl = l;
if (mask & (1 << 0)) ni = i + 1;
if (mask & (1 << 1)) nj = j + 1;
if (mask & (1 << 2)) nk = k - 1;
if (mask & (1 << 3)) nl = l - 1;
dp[i][j][k][l] += sign * dp[ni][nj][nk][nl];
} else {
sign = -1;
ni = i;
nj = j;
nk = k;
nl = l;
if (mask & (1 << 0)) ni = i + 1;
if (mask & (1 << 1)) nj = j + 1;
if (mask & (1 << 2)) nk = k - 1;
if (mask & (1 << 3)) nl = l - 1;
dp[i][j][k][l] += sign * dp[ni][nj][nk][nl];
}
}
}
}
}
}
while (q--) {
cin >> i >> j >> k >> l;
cout << dp[i][j][k][l] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string matr[40];
int dp[41][41][41][41];
int main() {
string str;
int m, n, q, t, u, v, j, sum, x1, y1, x2, y2, y, min;
int arr[42];
cin >> m >> n >> q;
for (int i = 0; i < m; i++) {
cin >> matr[i];
}
for (int j = 1; j <= 40; j++)
for (int i = 0; i <= 40; i++) {
dp[1][j][i][0] = 0;
dp[j][1][0][i] = 0;
}
for (int sz2 = 2; sz2 <= m + n; sz2++)
for (int x = 1; x <= m && x <= sz2; x++) {
y = sz2 - x;
if (y > n) continue;
for (int sz = sz2; sz <= m + n; sz++) {
for (int i = x; i <= m && i <= sz - 1; i++) {
j = sz - i;
if (j > n || j < y) continue;
if (matr[i - 1][j - 1] == '1')
sum = 0;
else {
sum = 0;
min = y - 1;
for (u = i - 1; u >= x - 1; u--) {
if (matr[u][j - 1] != '0') break;
for (v = j - 2; v >= min && v >= y - 1; v--) {
if (matr[u][v] != '0') break;
}
min = v + 1;
sum += (j - 1 - v);
}
}
dp[x][y][i][j] = dp[x][y][i][j - 1] + dp[x][y][i - 1][j] -
dp[x][y][i - 1][j - 1] + sum;
}
}
}
while (q--) {
cin >> x1 >> y1 >> x2 >> y2;
cout << dp[x1][y1][x2][y2] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 43;
long long dp[N][N][N][N];
void solve() {
long long n, m, q;
cin >> n >> m >> q;
long long pre[n + 2][m + 2];
memset(pre, 0, sizeof pre);
for (long long i = 1; i <= n; ++i) {
string s;
cin >> s;
for (long long j = 1; j <= m; ++j) {
if (s[j - 1] == '0') pre[i][j] = pre[i - 1][j] + 1;
}
}
for (long long i = 1; i <= n; ++i) {
for (long long j = 1; j <= m; ++j) {
for (long long k = i; k <= n; ++k) {
for (long long l = j; l <= m; ++l) {
if (i != k) dp[i][j][k][l] += dp[i][j][k - 1][l];
if (j != l) dp[i][j][k][l] += dp[i][j][k][l - 1];
if (i != k && l != j) dp[i][j][k][l] -= dp[i][j][k - 1][l - 1];
long long mx = k - i + 1;
for (long long x = l; x >= j; --x) {
mx = min(mx, pre[k][x]);
dp[i][j][k][l] += mx;
if (mx == 0) break;
}
}
}
}
};
while (q--) {
long long a, b, c, d;
cin >> a >> b >> c >> d;
cout << dp[a][b][c][d] << '\n';
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
;
long long t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int dp[42][42][42][42];
int acc[42][42], arr[42][42];
int beut[42][42][42][42];
int sx[] = {-1, 0, -1};
int sy[] = {0, -1, -1};
int solve(int i1, int j1, int i2, int j2) {
if (i2 < i1 || j2 < j1) return 0;
int &ret = dp[i1][j1][i2][j2];
if (ret != -1) return ret;
ret = 0;
ret += beut[i1][j1][i2][j2];
int arr[5] = {0};
for (int mask = 1; mask < 16; mask++) {
int c = 0;
int a = mask;
int ind = 0;
while (a) {
if (a % 2 == 1) {
arr[ind++] = 1;
c++;
} else {
arr[ind++] = 0;
}
a /= 2;
}
int B = solve(i1 + arr[0], j1 + arr[1], i2 - arr[2], j2 - arr[3]);
if (c % 2)
ret += B;
else
ret -= B;
}
return ret;
}
int main() {
cin >> n >> m >> q;
n++;
m++;
string s;
for (int i = 1; i < n; i++) {
cin >> s;
for (int j = 1; j < m; j++) {
arr[i][j] = s[j - 1] - '0';
}
}
for (int i = 1; i < n; i++)
for (int j = 1; j < m; j++) {
acc[i][j] = acc[i - 1][j] + acc[i][j - 1] - acc[i - 1][j - 1] + arr[i][j];
}
for (int i1 = 1; i1 < n; i1++)
for (int i2 = i1; i2 < n; i2++)
for (int j1 = 1; j1 < m; j1++)
for (int j2 = j1; j2 < m; j2++) {
int sum = acc[i2][j2] + acc[i1 - 1][j1 - 1] - acc[i2][j1 - 1] -
acc[i1 - 1][j2];
if (sum == 0) {
beut[i1][j1][i2][j2] = 1;
}
}
memset(dp, -1, sizeof dp);
int a2, a1, b1, b2;
for (int i = 0; i < q; i++) {
cin >> a1 >> b1 >> a2 >> b2;
int ret = solve(a1, b1, a2, b2);
cout << ret << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, q;
const long long N = 42;
vector<string> mmap(N);
long long sum[N][N], sum1[N][N][N][N], sum2[N][N][N][N];
long long getsum(long long x1, long long y1, long long x2, long long y2) {
return sum[x2 + 1][y2 + 1] - sum[x2 + 1][y1] - sum[x1][y2 + 1] + sum[x1][y1];
}
signed main() {
cin >> n >> m >> q;
for (long long i = 0; i < n; ++i) {
cin >> mmap[i];
}
memset(sum, 0, sizeof(sum));
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
sum[i + 1][j + 1] =
sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (mmap[i][j] - '0');
}
}
memset(sum1, 0, sizeof(sum1));
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
for (long long u = i; u >= 0; --u) {
for (long long v = j; v >= 0; --v) {
sum1[i][j][u][v] = getsum(u, v, i, j) == 0;
if (u < i) {
sum1[i][j][u][v] += sum1[i][j][u + 1][v];
}
if (v < j) {
sum1[i][j][u][v] += sum1[i][j][u][v + 1];
}
if (u < i && v < j) {
sum1[i][j][u][v] -= sum1[i][j][u + 1][v + 1];
}
}
}
}
}
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
for (long long u = i; u < n; ++u) {
for (long long v = j; v < m; ++v) {
sum2[i][j][u][v] = sum1[u][v][i][j];
if (u > i) {
sum2[i][j][u][v] += sum2[i][j][u - 1][v];
}
if (v > j) {
sum2[i][j][u][v] += sum2[i][j][u][v - 1];
}
if (u > i && v > j) {
sum2[i][j][u][v] -= sum2[i][j][u - 1][v - 1];
}
}
}
}
}
while (q--) {
long long i, j, u, v;
cin >> i >> j >> u >> v;
--i, --j, --u, --v;
cout << sum2[i][j][u][v] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int size = 47;
int sum[size][size];
int good[size][size][size][size];
int dp[size][size][size][size];
int source[size][size];
int main() {
int n, m, qs;
cin >> n >> m >> qs;
for (int i = 1; i < n + 1; ++i) {
for (int j = 1; j < m + 1; ++j) {
char c;
cin >> c;
source[i][j] = (c - '0');
}
}
for (int i = 1; i < n + 1; ++i) {
for (int j = 1; j < m + 1; ++j) {
sum[i][j] =
sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + source[i][j];
}
}
for (int i = 1; i < n + 1; ++i) {
for (int j = 1; j < m + 1; ++j) {
for (int q = i; q < n + 1; ++q) {
for (int w = j; w < m + 1; ++w) {
int curr =
sum[q][w] - sum[q][j - 1] - sum[i - 1][w] + sum[i - 1][j - 1];
good[i][j][q][w] = (curr == 0);
}
}
}
}
for (int i = 1; i < n + 1; ++i) {
for (int j = 1; j < m + 1; ++j) {
for (int q = i; q < n + 1; ++q) {
for (int w = j; w < m + 1; ++w) {
dp[i][j][q][w] = dp[i][j][q - 1][w] + dp[i][j][q][w - 1] -
dp[i][j][q - 1][w - 1] + good[i][j][q][w];
}
}
}
}
for (int q = n; q > 0; --q) {
for (int w = m; w > 0; --w) {
for (int i = q; i > 0; --i) {
for (int j = w; j > 0; --j) {
dp[i][j][q][w] = dp[i][j][q][w] + dp[i + 1][j][q][w] +
dp[i][j + 1][q][w] - dp[i + 1][j + 1][q][w];
}
}
}
}
for (int i = 0; i < qs; ++i) {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << dp[a][b][c][d] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c[45][45];
char c1[45][45];
int vis[45][45];
int dp[45][45][45][45];
int main() {
int n, m, q;
while (~scanf("%d %d %d", &n, &m, &q)) {
memset(vis, 0, sizeof(vis));
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++) scanf("%s", c1[i]);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) c[i][j] = c1[i][j] - '0';
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (c[i][j] == 0) {
vis[i][j] = vis[i][j - 1] + 1;
} else {
vis[i][j] = 0;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
for (int i1 = i; i1 < n; i1++) {
for (int j1 = j; j1 < m; j1++) {
int n1 = 0;
int m1 = 0;
if (c[i1][j1] == 1) {
if (i1 - 1 >= 0) dp[i][j][i1][j1] += dp[i][j][i1 - 1][j1];
if (j1 - 1 >= 0) dp[i][j][i1][j1] += dp[i][j][i1][j1 - 1];
if (i1 - 1 >= 0 && j1 - 1 >= 0)
dp[i][j][i1][j1] -= dp[i][j][i1 - 1][j1 - 1];
} else {
if (i1 - 1 >= 0) dp[i][j][i1][j1] += dp[i][j][i1 - 1][j1];
if (j1 - 1 >= 0) dp[i][j][i1][j1] += dp[i][j][i1][j1 - 1];
if (i1 - 1 >= 0 && j1 - 1 >= 0)
dp[i][j][i1][j1] -= dp[i][j][i1 - 1][j1 - 1];
int sum = 0;
int r = j1 - j + 1;
for (int k = i1; k >= i; k--) {
r = min(r, vis[k][j1]);
sum += r;
}
dp[i][j][i1][j1] += sum;
}
}
}
}
}
int x1, y1, x2, y2;
for (int i = 0; i < q; i++) {
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
printf("%d\n", dp[x1 - 1][y1 - 1][x2 - 1][y2 - 1]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
char mp[41][42];
int pfsum[41][41], cnt[41][41][41][41], dp[41][41][41][41];
bool isempty[41][41][41][41];
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n; ++i) {
scanf("%s", mp[i] + 1);
for (int j = 1; j <= m; ++j)
pfsum[i][j] = pfsum[i][j - 1] + (mp[i][j] == '1' ? 1 : 0);
}
for (int x1 = 1; x1 <= n; ++x1)
for (int y1 = 1; y1 <= m; ++y1)
for (int x2 = x1; x2 <= n; ++x2)
for (int y2 = y1; y2 <= m; ++y2) {
bool f = true;
for (int i = x1; i <= x2; ++i)
if (pfsum[i][y2] != pfsum[i][y1 - 1]) f = false;
isempty[x1][y1][x2][y2] = f;
}
for (int sizx = 1; sizx <= n; ++sizx)
for (int sizy = 1; sizy <= m; ++sizy)
for (int x = sizx; x <= n; ++x)
for (int y = sizy; y <= m; ++y) {
cnt[sizx][sizy][x][y] = cnt[sizx][sizy][x - 1][y];
for (int i = sizy; i <= y; ++i)
if (isempty[x - sizx + 1][i - sizy + 1][x][i])
++cnt[sizx][sizy][x][y];
}
memset(dp, -1, sizeof(dp));
while (q--) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
if (dp[a][b][c][d] != -1) {
printf("%d\n", dp[a][b][c][d]);
continue;
}
int ans = 0;
for (int sizx = 1; sizx <= c - a + 1; ++sizx)
for (int sizy = 1; sizy <= d - b + 1; ++sizy) {
int ta = a + sizx - 1, tb = b + sizy - 1;
ans += cnt[sizx][sizy][c][d] - cnt[sizx][sizy][ta - 1][d] -
cnt[sizx][sizy][c][tb - 1] + cnt[sizx][sizy][ta - 1][tb - 1];
}
dp[a][b][c][d] = ans;
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
const int MX = 41;
int dp[MX][MX][MX][MX], mapa[MX][MX], row[MX][MX];
int N, M, Q, a, b, c, d, e, r;
int main() {
scanf("%d%d%d", &N, &M, &Q);
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++) {
scanf("%1d", &mapa[i][j]);
row[i][j] = row[i][j - 1];
if (mapa[i][j])
row[i][j] = 0;
else
row[i][j]++;
}
for (a = 1; a <= N; a++)
for (b = 1; b <= M; b++)
for (c = a; c <= N; c++)
for (d = b; d <= M; d++) {
dp[a][b][c][d] =
dp[a][b][c - 1][d] + dp[a][b][c][d - 1] - dp[a][b][c - 1][d - 1];
r = d - b + 1;
for (e = c; e >= a && r; e--) {
r = (r < row[e][d]) ? r : row[e][d];
dp[a][b][c][d] += r;
}
}
while (Q--) {
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d\n", dp[a][b][c][d]);
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.