solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long int inf = (long long int)1e18 + 10;
long long int m;
long long int a[3][1000006], c[3][102] = {{0}};
long long int d[102] = {0}, dp[102] = {0};
struct matrix {
vector<vector<long long int> > mat;
matrix() { mat.resize(m, vector<long long int>(m)); }
ma... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
struct edge {
int x, y, v;
} e[N];
int n, m, f[N];
bool cmp(edge a, edge b) { return a.v < b.v; }
int find(int x) {
if (f[x] == x)
return x;
else
return f[x] = find(f[x]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int c[120][120], ct[120], n;
int ccc[120], Ciel, Jiro, cnt;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", ct + i);
int p1 = ct[i] / 2 - 1, p2 = ct[i] - ct[i] / 2;
for (int j = 0; j < ct[i]; j++) {
scanf("%d", &c[i][j]);
... | 5 |
#include <iostream>
using namespace std;
int main(void)
{
int n;
while (cin >> n, n){
int x, y, h, w;
int ret = 0;
for (int i = 0; i < n; ++i)
{
cin >> x >> y >> h >> w;
int max_type = 0, sum = x + y + h;
if (sum <= 60) max_type = 1;
else if (sum <= 80) max_type = 2;
else if (sum <= 100) max_t... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& cout, vector<T> V) {
cout << "[ ";
for (auto v : V) cout << v << ' ';
return cout << ']';
}
template <class L, class R>
ostream& operator<<(ostream& cout, pair<L, R> P) {
return cout << '(' << P.first << ',' << P.secon... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int a;
cin >> a;
int b = 0;
int c[a];
for(int i=0;i<a;i++){
cin >> c[i];
}
for(int i=0;i<a;i++){
for(int j = i+1;j<a;j++){
for(int k = j+1;k<a;k++){
if(c[i]+c[j]>c[k]&&c[j]+c[k]>c[i]&&c[k]+c[i]>c[j]&&c[i]!=c[k]&&c[k]!=c[j]&... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string str;
int a,b;
while(cin>>str>>a>>b){
cout<<str<<" "<<a+b<<" "<<a*200+b*300<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long _gcd(long long x, long long y) { return (!y ? x : _gcd(y, x % y)); }
long long _lcm(long long x, long long y) { return x / _gcd(x, y) * y; }
int main() {
std::ios_base::sync_with_stdio(0);
int ar[4];
cin >> ar[0] >> ar[1] >> ar[2] >> ar[3];
int sum = (ar[0... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MAX_N = 1<<15;
vector<int> sq;
void make() {
for(int i = 0; i*i <= MAX_N; ++i) {
sq.push_back(i*i);
}
}
int solve(int n) {
int res = 0;
for(int i = 0; i < sq.size() && sq[i] <= n; ++i) {
for(int j = i; j < ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, mas[400000], k, m;
pair<int, int> p[100000];
int main() {
cin >> n;
for (int i = 1; i <= 2 * n; i++) cin >> mas[i];
for (int i = 1; i <= 2 * n; i++) {
if (p[mas[i]].first == 1) {
p[mas[i]].second = 1;
k--;
m = max(m, k);
}
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k, s, ar[1 << 20];
int dp[3][200][200 * 200];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> k >> s;
for (int i = 1; i <= n; i++) cin >> ar[i];
if (s > n * n / 2 + 10) s = n * n / 2 + 10;
for (int done = 0; done <= s; done++)
for (int pref = 0; ... | 4 |
#include <bits/stdc++.h>
long long int i, n, a[15], sum, ex, b[15];
int main() {
for (i = 1; i <= 14; i++) {
scanf("%lld", &a[i]);
}
for (i = 1; i <= 14; i++) {
ex = 0;
for (int j = 1; j <= 14; j++) {
b[j] = 0;
}
long long int u = a[i];
long long int g = a[i] / 14;
long long int ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int m, n, ans, ans2 = -1;
int main() {
cin >> m >> n;
if (n == 1) return cout << -1, 0;
if (m == n) return cout << 5, 0;
if (m - n + 1 <= n) ans2 = 11;
if (m > n) m -= n - 2, ans += 4;
while (1) {
if (m * 2 <= n) return cout << ans + 1, 0;
if (m < n) ret... | 6 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,K;
cin>>A>>B>>C>>K;
int Max=max(A,max(B,C));
int ans=A+B+C+Max*(pow(2,K)-1);
cout<<ans<<endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
using namespace std;
string bd[12];
void del(int y, int x) {
if (0 <= y && y < 12 && 0 <= x && x < 12 && bd[y][x] == '1') {
bd[y][x] = '0';
del(y-1, x);
del(y+1, x);
del(y, x-1);
del(y, x+1);
}
}
int main() {
while (cin >> bd[0]) {
for (int i=1; i<12; ++i) cin >> ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 2e9;
bool flag[N];
vector<pair<int, int> > e[N];
int del[N];
int ans[N];
bool multi, ok;
int delta;
void dfs1(int v) {
flag[v] = true;
for (auto x : e[v]) {
int u = x.first;
if (!flag[u]) {
del[u] = -del[v];
dfs1(u);
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10;
const int M = 1000000007;
const double PI = atan(1) * 4;
const int oo = 2100000000;
int n;
long long dp[N][8];
vector<vector<int> > v;
long long calc(int u, int st) {
if (u == n) return (st != 0b001) * -1e17;
long long &ret = dp[u][st];
if (... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, t;
scanf("%lld%lld", &n, &m);
if (n > m) t = n, n = m, m = t;
if (n == 1) {
printf("%lld\n", m / 6 * 6 + max((m % 6 - 3) * 2, (long long)0));
} else if (n == 2) {
if (m == 2) {
puts("0");
} else if (m == 3) {
pu... | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1005;
vector <int> g[N];
int x[N], w[N];
int dfs(int u) {
map <int, int> cnt;
cnt[x[u]] = 0;
for (auto & v : g[u]) {
if (! dfs(v)) return 0;
map <int, int> tmp;
for (auto & it : cnt) {
if... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
return a > 0 ? a : -a;
}
template <class T>
inline T gcd(T a, T b) {
return __gcd(a, b);
... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool f(vector<int> ar, int tmp) {
for (int a = 0; a < ar.size(); a++) {
if (ar[a] == tmp) {
return false;
}
}
return true;
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k, d;
cin >> n >> k >> d;
vector<int> ans(n,... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
cin >> num;
long long su = 0;
while (num--) {
string s;
cin >> s;
if (s[0] == 'I')
su += 20;
else if (s[0] == 'T')
su += 4;
else if (s[0] == 'C')
su += 6;
else if (s[0] == 'O')
su += 8;
else
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
char s[100000 + 10];
int len;
unsigned tree[400000 + 100];
inline unsigned mask(char c) { return 1U << unsigned(c - 'a'); }
inline int left(int root) { return root * 2; }
inline int right(int root) { return root * 2 + 1; }
void build(int root = 1, int ... | 4 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
long a, b;
long v[110] = {0}, v2[110] = {0};
scanf("%d", &n);
for (int i = 1; i <= n; i++){
scanf("%ld %ld", &a, &b);
v[a] += b;
v2[a] += b;
}
sort(v, v + n + 1);
reverse(v, v + n + 1);
for (int i = 1; i <= n; i++){
... | 0 |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int e[1048576],o[1048576];
int main(void)
{
REP(i,1048576) e[i]=1048576;
REP(i,1048576) o[i]=1048576;
e[0]=0;
o[0]=0;
REP(i... | 0 |
#include <bits/stdc++.h>
int main() {
int i, a, sum, h, ad;
scanf("%d", &a);
sum = 0;
h = 0;
ad = 0;
for (;;) {
ad++;
sum += ad;
if (a - sum >= 0) {
a -= sum;
h++;
} else
break;
}
printf("%d", h);
return 0;
}
| 1 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
string s;
cin>>s;
int i,j,k,ans=0,num;
vector<string>ss(4);
vector<int>si(4);
for(int i=0;i<s.size()-2;i++){
for(int j=i+1;j<s.size()-1;j++){
for(int k=j+1;k<s.size();k++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.writ... | 2 |
#include <bits/stdc++.h>
int main() {
long long *vet;
int q, i;
long long a, b, k;
scanf("%d", &q);
vet = (long long *)malloc(sizeof(long long) * q);
for (i = 0; i < q; i++) vet[i] = 0;
for (i = 0; i < q; i++) {
scanf("%lld %lld %lld", &a, &b, &k);
if (k % 2 == 0)
vet[i] = (k / 2) * (a - b);... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, maxs = 0;
cin >> s >> n;
vector<string> sf(n);
for (int i = 0; i < n; i++) {
cin >> sf[i];
sf[i] += "$";
sf[i] += s;
maxs = max(maxs, (int)sf[i].size());
}
int pi[n][maxs], ans[s.size()];
for (int j = 0; j < s.si... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int n, m;
cin >> n >> m;
int maks = 0;
for (int i = 0; i < n; i++) v.push_back(i + 1);
do {
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int x = 100;
for (int k = i; k <= j; k+... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
double x[60001], v[60001];
bool possible(double m) {
double l = -1e9, r = 1e9;
for (int i = 0; i < n; i++) {
l = max(l, x[i] - m * v[i]);
r = min(r, x[i] + m * v[i]);
}
return l <= r;
}
void solve() {
cin >> n;
for (int i = 0; i < n; i++) cin >> x... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int block_size = sizeof(uint32_t) * 8;
const uint32_t one = 1;
const size_t max_size = 3 * 100000000 + 1;
uint32_t pr[max_size / block_size + 1];
int main(void) {
int l, r;
cin >> l >> r;
for (int i = 3; i * i <= r; i += 2) {
if (!(pr[i / block_size] & (one ... | 3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, m;
cin >> n >> m;
long long a[n][m];
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
if (i == ... | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b) for (int i = a; i > b; --i)
#define REP(i, n) for (int i = 0; i < n; ++i)
const int kMaxN = 100000;
string s;
int... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
vector<int> hamming_numbers;
int m, n;
void print_vi(vector<int> vi)
{
rep(i, vi.size())
{
printf("%d ", vi[i]);
}
}
signed main()
{
rep(i,21) rep(j,13) rep(k,9)
{
int num = pow(2, i) * pow(3, j) * pow(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int ga[10][10];
int vis[4] = {0, 0, 0, 0};
int main() {
string ans;
char a, b, c;
cin >> a >> b >> c;
if (b == '>')
ga[a - 64][c - 64] = 1;
else
ga[c - 64][a - 64] = 1;
cin >> a >> b >> c;
if (b == '>')
ga[a - 64][c - 64] = 1;
else
ga[c - 64]... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int x, y;
scanf("%d%d", &x, &y);
v.push_back(make_pair(x, y));
}
v.push_back(make_pair(0, 0));
v.push_back(make_pair(-100005, 0)), v.push_back(make_pair(10... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int test;
cin >> test;
while (test--) {
int n;
cin >> n;
bool ok;
if (n > 30) {
cout << "YES" << endl;
int a = n - (6 + 10 + 14);
if (a == 6) {
cout << "6 10 15 " << n - (6 + 10 + 15) << endl;
} else if (a =... | 1 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;cin >> n;
string s;cin >> s;
if(s.size()>n){
s=s.substr(0,n)+"...";
}
cout << s;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int N,answer;
int table[100000+10],ans[100000+10];
signed main(){
cin >> N;
for(int i=0;i<N;i++){
int a,b;
cin >> a >> b;
a--,b--;
table[a]++;
table[b+1]--;
}
for(int i=1;i<=N;i++){
ans[i]+=ans[i-1]+tabl... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
typedef long long ll;
typedef pair<int, int> pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int ... | 3 |
#include <bits/stdc++.h>
int arr[100001];
int main() {
int n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%d", &arr[i]);
if (arr[n] == 1) {
printf("NO");
return 0;
}
if (arr[1] == 0) {
if (n == 2) {
printf("NO\n");
return 0;
}
printf("YES\n");
if (n == 1)
pr... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, q;
cin >> n;
p = 9 * n;
q = 8 * n;
cout << p << " " << q << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = (long long int)(1e9 + 7);
long long int test = 1;
vector<long long int> read(int n) {
vector<long long int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
return v;
}
void solve() {
long long int i, j, k, n, t, m, cnt = 0, ans = 0, sum = 0;... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
cout << x << endl;
exit(0);
}
const long long mod = 1e9 + 7;
const int maxn = 55;
const int maxr = 5500;
int n;
double R;
double f[maxn], s[maxn], p[maxn];
double dp[maxn][maxr];
void reset() {
for (int i = 0; i <= n; i++) {
f... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout.setf(ios_base::fixed);
cout.precision(28);
int n;
cin >> n;
cout << 0 << " " << 1 << endl;
string s;
cin >> s;
string l = s;
int lx = 0;
for (int i = 1; i ... | 3 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))
#define REP_R(i, n) for (int i = (n) - 1; (i) >= 0; -- (i))
#define ALL(x) begin(x), end(x)
using namespace std;
template <class T> inline void chmax(T & a, T const & b) { a = max(a, b); }
template <class Monoid>
struct segment_tree {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
long long int x = 2;
double d;
long long int p;
for (long long int i = 1; i <= n; i++) {
long long int B = i * (i + 1) * (i + 1) - x / i;
cout << B << "\n";
x = i * (i + 1);
}
}
| 1 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:134217728")
using namespace std;
const long long MOD = 1000000000 + 7;
const long long MAXN = 100000 + 100;
const long long MAGIC = 123123123;
const double PI = 4 * atan(1.);
const double EPS = 1E-7;
const int LOGN = 22;
struct cmp_for_set {
bool operator()(con... | 3 |
#include <bits/stdc++.h>
using namespace std;
double const eps = 1e-11;
double const pi = 3.1415926535;
long long const mod = 1e9 + 7;
int a[200100];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
int odd = 0, even = 0, temp_odd = 0, temp_even = 0;
cin >> n;
for (int i = 1; i <... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
inline long long toll(string s) {
long long v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline st... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
long long sump2[1000005], sump4[1000005];
long long zzpow(long long x, long long p) {
if (!p) return 1ll;
long long t = zzpow(x, p / 2);
if (p % 2) return t * t % mod * x % mod;
return t * t % mod;
}
long long prod3(long lon... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long F[10][100];
int total[10], putere[10][100], G[10][10], C[10], gr[10], D[10][1 << 8];
map<long long, int> M[10], now;
inline void descompune(long long n, const int &indice) {
for (int f = 2; 1LL * f * f <= n; ++f) {
if (n % f == 0) {
F[indice][++... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
namespace Magic {
long long got(long long x) {
long long z = 0;
while (x) {
z += x % 10;
x /= 10;
}
return z;
}
long long cal(long long x) { return x - got(x); }
void run() {
scanf("%lld%lld", &n, &k);
long long l = 0, r = n;
while (l <... | 3 |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("contest.in");
ofstream fout("contest.out");
const long long N = 2 * 1000 * 1000 * 1000 + 10, inf = 1000 * 1000 * 1000;
long long n, m, k, res = 0, s;
vector<long long> nn, mm;
int main() {
cin >> n >> m >> k;
if (n + m - 2 < k) {
cout << -1;
return... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
scanf("%d", &n);
string s, t;
cin >> s >> t;
vector<int> a;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) a.push_back(i);
}
if (a.size() > 2) {
printf("no\n");
return;
}
for (int i = 0; i < (int)a.size(); i++) {
fo... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int inf = 1061109567;
const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
double dp[205][205][405], p[205];
int a[205];
int main() {
int n, l, tmp;
cin >> n >> l >> tmp;
for (in... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INFINITE = INT_MAX;
const int MAXNUM = 100005;
int n, len, res;
int arr[2][100005], ans[100005], te[100005];
void forxunhuan(int le, int ri) {
for (int i = le; i <= ri; i++) ans[i] = i % res;
}
int main() {
memset(arr, 0, sizeof(arr));
memset(ans, 0, sizeof(... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
long long a, b, c, d, x, y;
cin >> a >> b >> x >> y >> c >> d;
string ret = "NO";
for (int i = 0; i < 4; ++i) {
long long xx = x - a;
long long yy = y - b;
if (xx == 0 && yy == 0)
ret = "YES";
else... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5 + 10;
const long long inf = 9e15 + 9;
long long res;
long long a[N], n;
long long dp[201][300];
long long go(long long idx, long long time) {
if (idx == n) {
return 0;
}
if (time > 300 && idx < n) {
return inf;
}
if (dp[idx][time] + 1... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int n, m;
int a[maxn][10];
int mask[maxn];
int valid[1024];
pair<int, int> ans;
void print(int x) {
for (int i = 7; i >= 0; i--) cout << ((x >> i) & 1);
puts("");
}
bool check(int x) {
memset(valid, -1, sizeof(valid));
memset(mask, 0, size... | 4 |
#include <bits/stdc++.h>
char f[2000000];
int func(int n) {
int i, j, k = 0;
while (n != 0) {
k *= 10;
k += n % 10;
n /= 10;
}
return k;
}
int main() {
int i, j, n, k, a;
memset(f, 0, sizeof(f));
scanf("%d", &n);
for (i = 2; i < 2000000; i++) {
if (f[i] == 0) {
for (j = 2; i * j < ... | 6 |
#include <bits/stdc++.h>
using namespace std;
string itosm(long long x) {
if (x == 0) return "0";
string ans = "";
while (x > 0) {
ans += ((x % 10) + '0');
x /= 10;
}
reverse(ans.begin(), ans.end());
return ans;
}
long long stoim(string str) {
long long ans = 0;
long long k = 1;
for (int i = s... | 2 |
#include <bits/stdc++.h>
const int mod = 1e9 + 7;
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string a;
cin >> n;
map<string, int> vals;
vals["Tetrahedron"] = 4;
vals["Cube"] = 6;
vals["Octahedron"] = 8;
vals["Dodecahedron"] = 12;
vals["Icosahedron"] = 20;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100010 * 2;
int arr[MaxN];
map<int, int> mp;
set<int> heap;
void add(int x) {
mp[x]++;
if (mp[x] == 1)
heap.insert(x);
else
heap.erase(x);
}
void del(int x) {
mp[x]--;
if (mp[x] == 0)
heap.erase(x);
else if (mp[x] == 1)
heap.inse... | 5 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N,K;
cin>>N>>K;
vector<int> A(N),B(N,1000000000);
for(int &i:A)
cin>>i;
B[0]=0;
for(int i=1;i<N;i++)
for(int j=1;j<=K;j++)
if(i-j>=0)
B[i]=min(B[i],B[i-j]+abs(A[i-j]-A[i]));
cout<<B[N-1]<<endl;
} | 0 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 1010;
int n;
LL x[maxn],y[maxn],u[maxn],v[maxn],bs[35];
void work() {
cin >> n;
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
LL sum = (x[0] + y[0]) % 2;
for (int i = 0; i < n; i++) if ((x[i] + y[i] - sum) % 2 != 0) {cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 200 * 1000 + 5;
const long long INF = 1000ll * 1000 * 1000 * 1000 * 1000 * 1000 + 5;
pair<int, int> pp[MAXM];
int x[MAXM], p[MAXM], nxt[MAXM];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d, n, m;
cin >> d >> n >> m;
for (int i =... | 3 |
#include <bits/stdc++.h>
using namespace std;
void read() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void solve() {
long long n, m;
cin >> n >> m;
vector<long long> v(n), vc;
for (auto &i : v) cin >> i;
vc = v;
sort(vc.begin() + (m - 1), vc.end());
if (vc[m - 1] != vc[n ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, r;
while (~scanf("%d%d%d", &a, &b, &r)) {
if (a >= 2 * r && b >= 2 * r)
printf("First\n");
else
printf("Second\n");
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
using ll = long long;
int n, m, p, a[N];
struct TNode {
int l, r;
vector<ll> f;
ll sum;
} t[N << 2];
inline int lc(int pos) { return pos << 1; }
inline int rc(int pos) { return pos << 1 | 1; }
void pushup(int pos) {
t[pos].sum = t[lc(pos)].sum... | 6 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> order[500000];
int main() {
int tc;
scanf("%d", &tc);
for (int i = 0; i < tc; i++) {
scanf("%d%d", &order[i].second, &order[i].first);
}
sort(order, order + tc);
int counter = 0, previousEnd = 0, startNow;
for (int i = 0; i < tc;... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, x;
cin >> n >> x;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int e = 0, o = 0, l = 0;
for (int i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
e++;
else
o++;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N, K;
int A[200005], P[200005];
vector<pair<int, int>> v;
int main() {
scanf("%d %d", &N, &K);
int negCnt = 0;
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
if (A[i] < 0) {
negCnt++;
}
}
if (negCnt > K) {
printf("%d\n", -1);
retu... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
long long t = 1;
cin >> t;
while (t--) {
long long n, a, b;
cin >> n >> a >> b;
b = min(b, 2 * a);
long long ans = (n / 2) * b + (n % 2 == 1 ? a : 0);
cout << ans << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
static const int MAX = 100000;
static const int INFTY = (1<<30);
class Edge {
public:
int t, w;
Edge(){}
Edge(int t, int w): t(t), w(w) {}
};
vector<Edge> G[MAX];
int n, d[MAX];
bool vis[MAX];
int cnt;
void bfs(int s){
for (int i = 0; i < n; i++) d[i] =INFTY;
qu... | 0 |
#include <bits/stdc++.h>
int n, m, i, j, eid, cur, e, l[5006], r[5006], u[5006], d[5006], L[5006],
R[5006], D[5006], U[5006], c, res, rc;
short id[5006][5006];
char s[5006][5006], t[5006];
int main() {
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) scanf("%s", s[i]);
for (i = eid = 0; i < n; i++)
for (j =... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int inft = 1000000009;
int n, a[1000005];
pair<int, int> ff(int x) {
int l = 0;
for (int r = 0; r < n; r++) {
while (l < n && a[l] + x < a[r]) l++;
if (a[l] + x == a[r]) return pair<int, int>(a[l], a[r]);
}
return pair<int, int>(-1, -1);
}
pair<int, in... | 2 |
#include <bits/stdc++.h>
using namespace std;
int ab(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
int main() {
int n;
int m;
int k;
cin >> n >> m >> k;
int ans = n * 10 + 10;
int a[n + 1];
for (int i = 1; i < n + 1; i++) cin >> a[i];
for (int i = 1; i < n + 1; i++) {
if ... | 1 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
const int MaxN = 100000, MaxS = 511;
const int Mod = 998244353, base = ((long long) 1e18) % Mod;
int N;
int Pw[MaxN + 5];
int Sg[3][MaxN + 5];
std::vector<int> Gr[3][MaxN + 5];
int Buc[3][MaxS + 5];
inline int add(int x, int y) { return (x +... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long inf = 1000000000000000000;
int main() {
long long n, m, a, b, v, q, x1, y1, x2, y2;
cin >> n >> m >> a >> b >> v;
long long sp[a], ep[b];
for (long long i = 0; i < a; i++) cin >> sp[i];
for (long long i = 0; i < b; i++) cin >> ep[i];
sort(sp, sp + a);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
cin >> str;
reverse(str.begin(), str.end());
cout << str << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int NM = 2e5;
int n, m;
long long a[NM], add[NM];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long ans = 0;
int dn = 0, cnt = 0;
for (int i = 0; i < n; i++) {
add[i % m] += a[i];
ans += add[i % m];
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1);
const int mod = 1000000009;
int c[4005], k = 1, re[4005], n, m, m1, len, root, size[1000], lr[1000],
f[1000][1000], a[1000], b[1000], hea[1000], nex[100000],
wen[100000], bo[1000], boo[1000], booo[1000], fac[1005], ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
int n, m;
cin >> n >> m;
int lt, lb, cr, cl;
lb = 0;
lt = n - 1;
cr = 0;
cl = m - 1;
char a[n][m];
for (long long int i = 0... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int x, y;
int w;
};
using LL = long long;
const int N = 510, M = N * N;
int n, m;
int x[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> x[i];
vector<edge> edges(m);
double res = 0.0;
for (int i = 0; i < m; i++) {
cin >> ed... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d, l, sum = 0, k;
cin >> a >> b >> c >> d;
if (a != c && b != d) {
if (abs(c - a) == abs(d - b)) {
cout << a << " " << d << " " << c << " " << b;
} else {
cout << "-1" << endl;
}
}
if (a == c && b != d) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
int DEG[1010100];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, s;
cin >> n >> s;
for (int i = (2); i <= (n); ++i) {
int u, v;
cin >> u >> v;
DEG[u]++;
DEG[v]++;
}
int cnt = 0;
for (int i = (1); i <= (n); +... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, x, cnt[100001], s[100001];
int main() {
cin >> n >> x;
for (int i = (1), _b = (n); i <= _b; ++i) {
int a;
cin >> a;
++cnt[a];
}
for (int i = (1), _b = (100000); i <= _b; ++i) s[i] = s[i - 1] + cnt[i];
int lo = 0, hi = 100000, mid;
while (lo < ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<pair<int, int> > G[100005];
int Colour[100005], Stack[100005], P[100005], top;
pair<int, int> E[100005];
bool bipartite = 1;
long long Res[100005], C[100005];
vector<int> Cycle;
int Level[100005];
bool Use[100005];
map<pair<int, int>, int> Map;
void Read() ... | 4 |
#define _CRT_SECURE_NO_WARNINGS
#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
int main(int argc, char **argv){
int n;
while (cin >> n && n != 0){
v... | 0 |
#include <bits/stdc++.h>
using namespace std;
int Up(int a, int b) { return (a + b - 1) / b; }
class Type {
public:
char ch;
int number;
int k;
int value;
Type() {}
Type(char _ch, int _number) : ch(_ch), number(_number), k(0) {}
friend bool operator<(const Type& a, const Type& b) {
return a.number < ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MXN = 105;
int N, M, arr[MXN][MXN];
vector<vector<int>> ans;
void process(vector<pair<int, int>> v2) {
vector<int> v;
for (int i = 0; i < 3; i++) {
v.push_back(v2[i].first);
v.push_back(v2[i].second);
}
ans.push_back(v);
for (int i = 0; i < 6; i ... | 1 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<string>
typedef long long LL;
using namespace std;
int main()
{
int N,Q;
scanf("%d %d",&N,&Q);
for(int i=0;i<Q;i++)
{
int len=0;
int v,w;
scanf("%d %d",&v,&w);
if(N!=1)
{
v--;
w--;
int flag=0;
while(v>0)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
ll ans = 0;
if (N % 2 == 0) {
for (int i = N-1; i >= N/2+1; i--) ans += 2*A[i];
ans += A[N/2];
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long fact[n + 1];
fact[0] = 1;
for (int i = 1; i <= n; i++) fact[i] = (fact[i - 1] * i) % m;
long long res = 0;
for (long long i = n; i; i--) {
res += (n - i + 1) * (n - i + 1) % m * (fact[i] * fact[n - i] % m);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m = 1000000007) {
if (b == 0) return 1;
if (b == 1) return a;
long long res = power(a, b / 2, m);
res = (res * res) % m;
if (b & 1) res = (res * a) % m;
return res;
}
long long modinv(long long a, long long m =... | 3 |
#include<cstdio>
#include<algorithm>
using namespace std;
#define ran 111
int n, m;
pair<int, int> v[ran], x[ran];
int cmp(pair<int, int> &a, pair<int, int> &b) {
if (a.second != b.second) return a.second < b.second;
return a.first < b.first;
}
void upd(long long &a, long long b) {
if (a==-1 || a>b) a = b;
}
int... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int LEN = 5e5 + 10;
char s[LEN], t[LEN];
int main() {
long long n, k, ans = 0, cur = 1;
scanf("%lld%lld", &n, &k);
scanf("%s", s);
scanf("%s", t);
if (k == 1) {
printf("%d\n", n);
} else {
for (int i = 0; i < n; i++) {
cur <<= 1;
if (s[... | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.