Segcolt/CSES-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: Segcolt:2930b4452f9e2bcbd6d392c0fd828c953a60186b
Branches Tags
Segcolt:master
..
compare: Segcolt:654c2a8d7ccd7f84b009f9b45bed7fc7e16e19ae
Branches Tags
Segcolt:master

No commits in common. "2930b4452f9e2bcbd6d392c0fd828c953a60186b" and "654c2a8d7ccd7f84b009f9b45bed7fc7e16e19ae" have entirely different histories.
2930b4452f ... 654c2a8d7c

3 changed files with 0 additions and 309 deletions
Show Stats Expand all files Collapse all files

109
CSES Problem Set/Edit Distance.cpp
View File

@ -1,109 +0,0 @@
/* Problem URL: https://cses.fi/problemset/task/1639 */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
const ll inf = INT64_MAX >> 1;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
string a, b;
cin >> a >> b;
vvl dp(a.size() + 1, vl(b.size() + 1, inf));
dp[0][0] = 0;
for (size_t i = 0; i <= a.size(); i++) {
for (size_t j = 0; j <= b.size(); j++) {
if (i == 0 && j == 0) {
continue;
}
if (i == 0) {
rmin(dp[i][j], dp[i][j - 1] + 1);
continue;
}
if (j == 0) {
rmin(dp[i][j], dp[i - 1][j] + 1);
continue;
}
if (a[i - 1] == b[j - 1]) {
rmin(dp[i][j], dp[i - 1][j - 1]);
continue;
}
rmin(dp[i][j], min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + 1);
}
}
cout << dp[a.size()][b.size()] << '\n';
}

94
CSES Problem Set/Increasing Subsequence.cpp
View File

@ -1,94 +0,0 @@
/* Problem URL: https://cses.fi/problemset/task/1145 */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vl fds(n);
cin >> fds;
vl longest;
for (auto i : fds) {
auto itr = lower_bound(longest.begin(), longest.end(), i);
if (itr == longest.end()) {
longest.push_back(i);
} else {
*itr = i;
}
}
cout << longest.size() << '\n';
}

106
CSES Problem Set/Money Sums.cpp
View File

@ -1,106 +0,0 @@
/* Problem URL: https://cses.fi/problemset/task/1745 */
#include <bits/stdc++.h>
using namespace std;
#define V vector
#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;
template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
os << vec[0];
for (size_t i = 1; i < vec.size(); i++) {
os << ' ' << vec[i];
}
os << '\n';
return os;
}
template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
for (auto &i : vec) {
is >> i;
}
return is;
}
template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
for (auto &i : vec) {
os << i[0];
for (size_t j = 1; j < i.size(); j++) {
os << ' ' << i[j];
}
os << '\n';
}
return os;
}
template<class v>
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
for (auto &i : vec) {
for (auto &j : i) {
is >> j;
}
}
return is;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vi fds(n);
cin >> fds;
V<V<bool>> dp(n + 1, V<bool>((ll)1e5, false));
dp[0][0] = true;
for (size_t i = 1; i <= n; i++) {
for (size_t j = 0; j <= (ll)1e5; j++) {
dp[i][j] = dp[i - 1][j];
if (j >= fds[i - 1] && dp[i - 1][j - fds[i - 1]]) {
dp[i][j] = true;
}
}
}
queue<int> q;
for (size_t j = 1; j <= (ll)1e5; j++) {
if (dp[n][j]) {
q.push(j);
}
}
cout << q.size() << '\n';
while (!q.empty()) {
cout << q.front() << ' ';
q.pop();
}
cout << '\n';
}