solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
class SuffixArrayBuilder {
int n, gap;
string s;
vector<int> pos;
public:
SuffixArrayBuilder(string &s) : s(s) {}
bool operator()(int i, int j) {
if (pos[i] != pos[j]) return pos[i] < pos[j];
i += gap;
j += gap;
return ((i < n && j < n) ? pos[i] ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
int c1 = 0, c0 = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
c1++;
else
c0++;
}
int mi;
mi = min(c1, c0);
if (mi % 2 == 0)
co... | 2 |
#include <bits/stdc++.h>
template <typename T>
bool ckmax(T& a, T b) {
return a < b ? a = b, 1 : 0;
}
template <typename T>
bool ckmin(T& a, T b) {
return b < a ? a = b, 1 : 0;
}
const int MN = 80;
int N, RK, T, dp[MN][MN], ans;
bool u[MN], pr[MN][MN];
struct minion {
public:
int a, b, id;
void in() { scanf("%... | 6 |
#include <iostream>
#include <queue>
using namespace std;
int k,dist[100010];
bool used[100010];
deque<int> q;
inline void add_front(int x,int d)
{
if(d<dist[x])
{
dist[x]=d;
q.push_front(x);
}
}
inline void add_back(int x,int d)
{
if(d<dist[x])
{
dist[x]=d;
q.push_back(x);
}
}
int main()
{
cin>>k;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
double k, a, b;
cin >> k >> a >> b;
cin >> s;
int n = s.size();
if (n / k < a || n / k > b) {
cout << "No solution";
return 0;
}
int p = n / k;
int d = n % p;
if (p == 1) d = n - k;
int i = 0;
int cou = 0;
int c = 0;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
const int N = 2e5 + 10;
int vis[2010];
int a[N];
int main() {
int n, m, q, k;
cin >> q;
while (q--) {
cin >> n;
if (n & 1 || n == 2) {
if (n == 1)
cout << "FastestFinge... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int inf = 1e9;
int d[maxn], fa[maxn];
int n, k;
char s[maxn];
vector<int> vec[maxn];
int get(int x) {
if (x == fa[x]) return x;
return fa[x] = get(fa[x]);
}
void merge(int x, int y) {
int fx = get(x), fy = get(y);
if (fx != fy) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int vet[100111], k, cor[100111];
vector<int> tile[1001];
int main() {
int t, n, a, b, c, d;
scanf("%d", &t);
for (int i = 0; i < t; ++i) {
scanf("%d %d", &n, &k);
for (int j = 0; j < n; ++j) {
scanf("%d %d %d %d", &a, &b, &c, &d);
tile[j].clear();
... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct Pos {
int row, col;
bool operator<(const Pos& p) const {
if (row != p.row) return row < p.row;
return col < p.col;
}
};
int R, C, K;
vector<Pos> P;
int dr[] = {-1, 0, 0, 1};
int dc[] = {0, -1, 1, 0};
vector<int> row_IDs[10004];
vector<int> col_IDs[10004... | 4 |
#include <bits/stdc++.h>
using namespace std;
unsigned long long int power(unsigned long long int x, long int y) {
unsigned long long int res = 1;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
int main() {
long int n;
cin >> n;
long long int arr[n];
map... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, m;
char ch[20][120];
int l[20], r[20], visit[20], dp[20][2];
int main() {
scanf("%d%d", &n, &m);
memset(visit, 0, sizeof visit);
memset(r, 0, sizeof r);
memset(l, 0, sizeof l);
for (int i = n; i >= 1; i--) {
scanf("%s", ch[i]... | 2 |
#include <bits/stdc++.h>
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int MOD = mod - 1;
const int inf = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-10;
using namespace std;
pair<int, int> a[10005];
set<pair<int, int> > s;
void dfs(int l, int r) {
int mid = (l + r) >> 1;
int x = a[mid].... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int i = 0;
int cnt = 0;
int cnt1 = 0;
int cnt3 = 0;
for (i = 0; i < n; i++) {
if (s[i] == 'R') {
cnt++;
} else if (s[i] == 'U') {
cnt1++;
}
if ((s[i] == s[i + 1]) && cnt == cnt1) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T __in() {
T v;
cin >> v;
return v;
}
vector<pair<int, int> > edge[1010];
int l, r;
int vis[1010], kas;
void dfs(int u) {
if (vis[u] == kas) return;
vis[u] = kas;
for (__typeof(((int)edge[u].size())) i = 0; i < (((int)edge[u].size()));
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
priority_queue<long long int> pq;
long long int ans = 0;
for (int i = 0; i < n; i++) {
pq.push(a[i]);
if (pq.top() > a[i]) {
ans = ans + pq.top()... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
int n, m, u;
unordered_set<int> adj[N];
bool isConnected(int i, int j) { return adj[i].count(j) || adj[j].count(i); }
void connect(int i, int j) {
if (!i || !j || isConnected(i, j)) return;
adj[i].insert(j);
--m;
}
bool solve() {
if (m < n - ... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool get_int(T &ex) {
char t = getchar();
bool neg = false;
ex = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-') neg = true, t = getchar();
if (t == EOF) return false;
for (; t <= '9' && t >= '0'... | 5 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j;
int p,n;
while(cin>>p>>n&&(p||n)){
int nmn=n,dmn=1,nmx=1,dmx=n;
for(i=1;i<n+1;i++){
for(j=max(1,(int)(sqrt(p)*i)-1);j<min(n+1,(int)(sqrt(p)*i)+2);j++)... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long p = 1e9 + 7;
long long t, n, dp[1005][1005][3][3], rp[1005], ans;
char s[1005];
stack<long long> st;
void dfs(long long l, long long r) {
if (r == l + 1) {
dp[l][r][0][1] = dp[l][r][1][0] = dp[l][r][2][0] = dp[l][r][0][2] = 1;
return;
}
if (rp[... | 4 |
#include <bits/stdc++.h>
const int Inf = 1e9;
long long LINF = (long long)1e18 + 1e17;
const long long mod = 1e9 + 7;
using namespace std;
int use[2000001], a[101];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
memset(use, 0, sizeof(use));
int n;
cin >> n;... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream("input.txt");
ofstream("output.txt");
int a, b, n;
cin >> a >> b;
n = a + b + 1;
int ans = n - a;
for (int i = ans; i <= n; i++) cout << i << " ";
ans = n - a - 1;
for (int i = ans; i > 0; i--) cout << i << " ";
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
cin >> n;
vector<int> ad(n);
rep(i,n){
int a,b,c;
cin >> a >> b >> c;
int ans=0;
ans+=195*(a-1);
ans+=5*((a-1)/3);
if(a%3==0){
ans+=20*(b-1)+c-1;
}
else{
ans+=20*(... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int N = 1e6 + 5;
char a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int _;
cin >> _;
while (_--) {
int n;
cin >> n >> (a + 1);
long long len = strlen(a + 1);
int f = 1;
for (i... | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
struct train {
long long x, id;
};
bool operator<(const train& a, const train& b) {
if (a.x == b.x) return a.id < b.id;
return a.x < b.x;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long n, h, m, k;
cin... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n, x, m[110];
cin >> n >> x;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> m[i];
sum += m[i];
}
sort(m, m + n);
x -= sum;
cout << n + x / m[0] << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
float Euclidean(long long x1, long long x2, long long y1, long long y2) {
return sqrt(p... | 3 |
#include <cstdio>
int main(){
char c;
while(scanf("%c",&c)!= EOF){
if(c >= 'a' && c <= 'z'){
c = c-32;
}else if(c >= 'A' && c<='Z'){
c = c+32;
}
printf("%c", c);
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q;
cin >> q;
for (long long i = 1; i <= 1e6; i++) {
long long c = i;
if (c / 2 + 1 == q) {
cout << c << " " << 2 << endl;
cout << 1 << " " << 2 << endl;
break;
}
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
pair<int, vector<string> > process(string str) {
vector<string> ret;
string s = "";
for (int i = 3; i < str.size(); i++) {
if (str[i] == '\\') {
ret.push_back(s);
s = "";
} else {
s += str[i];
}
}
ret.push_back(s);
return {str[0] - ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 11) + 5;
const long long INF = 2e18;
const long long MOD = 998244353;
void resize(vector<int> &v) {
v.resize(unique(v.begin(), v.end()) - v.begin());
}
void solve() {
int n;
long long T;
cin >> n >> T;
long long ans = 0;
long long a[n + 4];
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, k, m, q, z;
const int MXN = 1e5 + 5;
int who[MXN];
set<pair<int, int> > S;
int C[MXN];
int main() {
scanf("%d", &n);
vector<pair<int, pair<int, int> > > events;
for (int i = 1; i <= (n); i++) {
scanf("%d%d", &a, &b);
events.push_back(make_pa... | 3 |
#include <bits/stdc++.h>
int a[1212][1212];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int all_s = 0;
bool is_gone[1212][1212][4];
int ans = 0;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
void dfs(int x, int y, int dir, int go) {
int i;
bool f = 0;
for (i = 0; i < 4; i++) {
if (is_... | 5 |
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
struct Double {
double d;
explicit Double(double x) : d(x) {}
};
ostream& operator<<(ostream& os, const Double x) {
os << fixed << setprecision(20) << ... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long int k, a, b;
int main() {
cin >> k >> a >> b;
long long int ans = 0;
if (b < 0) {
a = -a;
b = -b;
swap(a, b);
}
if (b >= 0) {
ans = b / k;
if (a <= 0) {
a = -a;
ans += a / k + 1;
} else {
a--;
ans -= a / k;... | 1 |
#include <bits/stdc++.h>
using namespace std;
int t, n, nO2, a, b;
void f(int v, int p, vector<int>& sz, const vector<vector<int> >& graph,
vector<int>& centroids) {
bool isCent = true;
for (int u : graph[v])
if (u != p) {
f(u, v, sz, graph, centroids);
sz[v] += sz[u];
if (sz[u] > nO2) ... | 3 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
bool block[6][110][110];
bool visit[110][110];
int main(){
int w, h;
int xs, ys, xg, yg;
int n, c, d, x, y;
while(scanf("%d%d%d%d%d%d%d", &w, &h, &xs, &ys, &xg, &yg, &n) == 7){
memset(block, 0, sizeof block);
memset(visit, 0, sizeof vi... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int dp[26][26];
memset(dp, -1, sizeof dp);
char king[11];
for (int i = 0; i < n; i++) {
scanf("%s", king);
int m = strlen(king);
char st = king[0] - 'a';
char ed = king[m - 1] - 'a';
for (int j = 0; j < 26... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long a[301][301];
long long dp[301][301];
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) a[i][j] = 1000000000ll * 50000ll;
long long x, y, cost;
for (int i = 1; i <= m; i++) {
cin >> x >> y >> c... | 4 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long t = 1;
cin >> t;
while (t--) {
long long n, i, j;
string s, a, b;
cin >> n >> s;
a = b = "";
bool flag = true;
;
a += '1', b += '1';
fo... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int i;
for (i = 0; i < n; ++i) cin >> arr[i];
int count = 0;
i = 0;
for (i = 0; i < n; ++i) {
if (arr[i] <= k)
count++;
else
break;
}
if (i == n) {
cout << count;
return 0;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5000 + 5;
const int BASE = 2333;
unsigned long long fac[N], f[2][N];
char s[N];
pair<int, int> pos[N];
unsigned long long get_hash(int id, int l, int r) {
if (l - 2 < 0) return f[id][r];
return f[id][r] - f[id][l - 2] * fac[(r - l) / 2 + 1];
}
int K, sum[3... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
char mp[N][N];
int dp[N][N][N][N];
int solve(int x, int y, int u, int v) {
int &w = dp[x][y][u][v];
if (w != -1) return w;
w = max(y - x + 1, v - u + 1);
for (int i = x; i < y; i++)
w = min(w, solve(x, i, u, v) + solve(i + 1, y, u, v));
for (... | 6 |
#include <bits/stdc++.h>
using namespace std;
void Not_Stable() {
long long n, m, k;
cin >> n >> m >> k;
long long val = ((n - 1) * (n - 2)) / 2 + 1;
if (m < n - 1 || m > val) {
cout << "-1";
return;
}
long long v = k;
if (v != 1) {
for (long long i = 1; i <= n; i++) {
if (i != v) cout <... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int a[110];
map<int, int> mp;
int main() {
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
mp.clear(), v.clear();
int maxx = 0;
int n, k, x;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (mp.... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, total;
int s[110], c[110][110];
pair<int, int> a[110];
bool chosen[110];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", s + i);
for (int j = 1; j <= s[i]; j++) {
scanf("%d", c[i] + j);
total += c[i][j];
}
a[i]... | 3 |
#include <bits/stdc++.h>
int main() {
int n, ans = 0;
int z;
scanf("%d", &n);
for (int i = 1; i * i <= n * n / 2; i++) {
for (int j = i; i * i + j * j <= n * n; j++) {
z = i * i + j * j;
if (sqrt(z) - (int)sqrt(z) < 1e-7) {
ans++;
}
}
}
printf("%d\n", ans);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct S {
int a, b;
S() {}
S(int _a, int _b) {
a = _a;
b = _b;
}
const bool operator<(const S &o) const { return a < o.a; }
};
priority_queue<int, vector<int>, greater<int>> mpq;
inline void showAll(vector<int> &v, int NL_or_space) {
for (int &here : v)... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct block {
int x, y, z;
};
const int MN = 5 * 1000 * 100 + 10;
const int inf = 1 << 30;
block arr[MN];
int mx[MN], n;
bool byX(block a, block b) { return a.x > b.x; }
bool byY(block a, block b) { return a.y > b.y; }
inline void upd(int v, int val) {
while (v < n) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long... | 1 |
#include <bits/stdc++.h>
using namespace std;
long int a[5001], b[5001];
long long ans[5001];
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] -= i;
b[i] = a[i];
}
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
ans[... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
long long int ans = 0;
cin >> n >> k;
long long int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
string s;
cin >> s;
for (int i = 0, j = 0; i < n; i = j) {
while (j < n && s[i] == s[j]) j++;
sort(a + i, a + j);
reverse(a ... | 3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:536870912")
#pragma warning(disable : 4996)
using namespace std;
const int N = 3e5 + 100;
vector<int> v[N];
int sz[N], col[N], cs[N], rb[N];
long long int ans[N], sum[N];
bool used[N];
int z = 1;
pair<int, int> dfs(int node, int anc) {
used[node] = 1;
pair<in... | 3 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
unordered_map<long long, long long> a;
long long tt;
for (long long i = 0; i < n; i++) {
cin >> tt;
a[tt]++;
}
cout << a[0] << ' ';
map<long long, l... | 5 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
unordered_multimap<string, string> mp;
set<string> st;
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
string t;
cin >> t;
long long k;
cin >> k;
st.insert(t);
for (long long j = 0; j < k; j++) {
string l;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int prev = 987654321;
int sum = 0;
for(int i = 0;i<n-1;i++){
int t, a;
cin>>t;
a = min(t, prev);
sum += a;
prev = t;
}
cout<<sum + prev;
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
string s;
long mod=1e9+7,dp[3333][3333];
int n;
int main()
{
cin>>n>>s;
dp[0][0]=1;
for(int i=1;i<n;i++)
{
if(s[i-1]=='<')
{
long now=0;
for(int j=1;j<=i;j++)
{
now=(now+dp[i-1][j-1])%mod;
dp[i][j]=now;
}
}
else
{
long now=... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> num(n);
vector<bool> sl(1000, false);
vector<int> sna;
for (int i = 0; i < n; i++) {
cin >> num[i];
}
for (int i = n - 1; i >= 0; i--) {
if (sl[num[i]] == false) {
sna.push_back(num[i]);
sl[num[i]... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v, v_copy;
int main() {
int n, x, counter = 0;
cin >> n;
for (int test = 1; test <= n; test++) {
cin >> x;
int a;
bool t = true;
for (int i = 1; i <= x; i++) {
cin >> a;
if (a != i && t) {
counter++;
}
t = (a... | 3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long N = 3e5+5, M =1e15, OO = 0x3f3f3f3f;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
ll t;
ll n, k;
ll a[N], tmpp[N];
ll dis[N];
void solve()
{
priority_queue<pair<ll, ll>> pq;
for(int i=0; i<n; ++i) pq.push({-dis[i], i})... | 5 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const long long LINF = 2e16;
const int magic = 348;
const int MOD = 313;
const double eps = 1e-10;
const double pi = acos(-1);
inline int getint() {
bool f;
char ch;
int res;
while (!isdigit(ch = getchar()) && ch != '-') {
}
if (ch == '-')
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, p, q;
cin >> n;
cout << (n / 2) * ((n + 1) / 2) << endl;
for (i = 1; i <= n / 2; i++) {
for (j = n / 2 + 1; j <= n; j++) cout << i << " " << j << endl;
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string str;
bool flag = 0;
cin >> str;
for (int i = 0; i < str.length(); i++) {
if (str[i] == '?') {
if (i == 0)
str[i] = (str[i + 1] == 'a') ? 'b' : 'a';
else if (i == str.len... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long dp[5005];
int tag[5005],s[5005];
int main()
{
int t;
scanf("%d",&t);
while (t--)
{
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%d",&tag[i]);
for (int i=1;i<=n;i++)
scanf("%d",&s[i]);
for (int i=1;i<=n;i++)
{
dp[i]=0;
for (int j=i... | 4 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int a[n-1];
for(int i =0;i<n-1;i++)
a[i] = abs(s[i]-s[i+1]);
int cnt[3];
memset(cnt,0,sizeof(cnt));
for(int i =0;i<n-1;i++)
cnt[a[i]]++;
int to_check = 1;
if(cnt[1]==0){
to_check = 2;
for(int i =0;i<n-1;i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int SHIFT = 101;
const int LEN = 203;
const int D[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const char S[5] = "RULD";
int n;
int tx[410], ty[410];
queue<int> dir;
bool mat[LEN + 10][LEN + 10];
int ax, ay, bx, by;
int dist[LEN + 10][LEN + 10];
pair<int, int> from[LEN... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str = "";
cin >> str;
for (int i = 0; i < str.size();) {
if (str[i] == '-') {
if (str[i + 1] == '.')
cout << 1;
else if (str[i + 1] == '-')
cout << 2;
i += 2;
} else {
cout << 0;
i++;
}
}
... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N; cin >> N;
int K; cin >> K;
double ans = 0;
for(int i = 0 ; i < N ; i++){
double H = 1;
while((i+1)*H < K) H *= 2;
H = 1 / H;
ans += H;
}
printf("%.12f", ans / N);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int cnt[2];
vector<int> arr[100];
int arr_index[210];
int main() {
int n, num, i, j, last = 2, k = 0;
cin >> n;
for (i = 0; i < 2 * n; i++) {
cin >> num;
arr[num].push_back(i);
}
for (i = 10; i <= 99; i++) {
if (arr[i].size() == 1) {
arr_index[ar... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000 + 10, MAXM = 400000 + 10;
int n, m, to[MAXM], nex[MAXM], beg[MAXN], fa[MAXN], dfn[MAXN], temp[MAXM],
e = 1, vis[MAXM], cnt;
struct node {
int x, y, z;
};
queue<node> Ans;
inline void read(int &x) {
int data = 0, w = 1;
char ch = 0;
while ... | 6 |
#include <bits/stdc++.h>
using namespace std;
string firsts = "23456789TJQKA";
string seconds = "CDHS";
int n, m;
string a[55][55];
vector<pair<string, string>> cur, ans;
vector<pair<int, int>> wh;
bool go(int x, int y) {
if (y == m) {
y = 0;
++x;
}
if (x == n) {
vector<pair<int, int>> goods;
for ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
int n, cas, x, y, ans, vis[N], cnt[N];
int main() {
cin >> n;
for(int i = 1; i <= n; ++i)
cnt[i] = 1;
vis[1] = 1;
for(cin >> cas; cas--; ) {
scanf("%d%d", &x, &y);
vis[y] |= vis[x];
--cnt[x], ++cnt[y];
if(!cnt[x]) vis[x] = 0;
}
for... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
void print(vector<int> &A, int n){
for(int i=0; i<n; i++){
cout<<A[i]<<" ";
}
cout<<endl;
}
int32_t main(){
int t;
cin>>t;
while(t--){
string s;
cin>>s;
int right=30, left=30;
int n =... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, l, k;
double probs[200];
int bags[200];
double dp[201][410][201];
double solve(int index, int currCapacity, int wonTours) {
if (index == n) {
if (wonTours >= l) {
if (currCapacity >= 0)
return 1.0;
else
return 0.0;
} else {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool chkmin(long long &x, long long y) { return x > y ? x = y, 1 : 0; }
bool chkmax(long long &x, long long y) { return x < y ? x = y, 1 : 0; }
int readint() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = ge... | 6 |
#include<bits/stdc++.h>
using namespace std;
double ans,f[305][305][35];
int n,C,L[9],id[9],i,j,k,mx,z;
int main(){
scanf("%d%d",&n,&C);mx=C*n;
for(i=1;i<=n;++i)scanf("%d",L+i),id[i]=i;
sort(L+1,L+n+1);
do{
memset(f,0,sizeof f);f[0][L[n]*n][0]=1;
for(i=0;i<mx;++i)for(j=i;j<=mx;++j)for(k=0;k<1<<n-1;++k)if(f[i][j... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++){
cin >> A[i];
}
vector<int> S(N + 1, 0);
for (int i = 0; i < N; i++){
S[i + 1] = (S[i] + A[i]) % M;
}
map<int, int> cnt;
long long ans = 0;
for (int i = 0; i <= ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const double eps = 1e-9;
long long X, Y;
long long dx, dy;
string cmd;
int mx[] = {0, 0, -1, 1};
int my[] = {1, -1, 0, 0};
pair<long long, long long> rax, ray;
int main() {
cin >> X >> Y;
cin >> cmd;
if (X == 0 && Y == 0) {
cout << "Yes"... | 1 |
#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr int INF = INT32_MAX;
constexpr int MAXN = 2e6 + 10;
constexpr double eps = 1e-8;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
using Vec = vector<int>;
template <class T>
void Min(T &a, T b) {
if (b < a)... | 2 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
struct P{
int tx,ty;
int kx,ky;
int cost;
P(int _tx, int _ty, int _kx, int _ky, int _cost) : tx(_tx), ty(_ty), kx(_kx), ky(_ky), cost(_cost) {};
};
int hx,hy,rx,ry;
int X... | 0 |
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int n;
scanf("%d",&n);
vector<int> x(1<<n),r(1<<n),m(1<<n);
for(auto &e:x)scanf("%d",&e);
for(int i=0;i<1<<n;i++){
for(int j=i;j<1<<n;j=(j+1)|i){
r[j]=max(r[j],x[i]+m[j]);
m[j]=max(m[j],x[i]);
}
}
for(int i=1;i<1... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int INF = 10000000000000;
long long int a, b, x, y;
long long int gcd(long long int a, long long int b) {
long long int r = a % b;
while (r) {
a = b;
b = r;
r = a % b;
}
return b;
}
void input() {
cin >> a >> b >> x >> y;
long long int tmp_... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, n, p, k;
cin >> n >> p >> k;
bool f = 0;
if (p - k > 1) cout << "<< ";
for (i = p - k; i < p; i++) {
if (p - k <= 0 && f == 0) {
if (p > 1) {
i = 1;
f = 1;
cout << i << " ";
continue;
} e... | 1 |
#include <bits/stdc++.h>
using namespace std;
int const MAX = 2e5 + 41;
int const ADD = 1;
int const DEL = 2;
int const ASK = 3;
int gcd(int a, int b) { return (a ? gcd(b % a, a) : b); }
struct Point {
int x, y;
Point(){};
Point(int x, int y) : x(x), y(y){};
bool operator<(const Point &a) const {
if (x != a... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int min=10000000;
for(int i=0;i<N;i++){
int a,b=0;
cin >> a;
while(a%2==0){
a=a/2;
b++;
}
if(b<min)min=b;
}
cout << min;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100001;
const int MOD = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const long long LINF = 1ll * 1000000 * 1000000 * 1000000;
void solve() {
int n;
cin >> n;
int x;
cin >> x;
;
int a[MAX_N] = {0};
int b[MAX_N] = {0};
vector<... | 2 |
#include <bits/stdc++.h>
static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;
template <class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<int> A(n), B(n);
for (auto &&i : A) ... | 4 |
#include <bits/stdc++.h>
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
using namespace std;
void sol() {
int n, first;
cin >> n >> first;
int ce = 0, co = 0;
for (int(i) = (0);... | 1 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
string s;
cin >> s;
set<char> a;
for (int i = 0; i < n; i++) {
a.insert(s[i]);
}
char ch ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10, LG = 22;
int n;
string s;
int seg[MAXN * 4], dp[MAXN], lcp[MAXN][LG], rnk[MAXN][LG], res;
vector<pair<pair<int, int>, int> > vec;
int LCP(int i1, int i2) {
if (i1 > i2) swap(i1, i2);
int ans = 0;
for (int b = LG - 1; b >= 0; b--) {
if (i... | 6 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const double PI = atan2(1, 0) * 2;
const double TAU = atan2(1, 0) * 4;
const int MAXN = 200005;
const int MAXT = 400005;
struct bit {
int tree[MAXT];
void add(int x, int v) {
x += 2;
for (int i = x; i < MAXT; i += i & -i) tree[i] += v;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long cnt[3] = {0};
long long solve();
int main() {
while(1) {
bool allzero = 1;
for(int i = 0; i < 3; ++i) cnt[i] = 0;
for(int i = 0; i < 6; ++i) {
long long a;
cin >> a;
if(a != 0) allzero = 0;
cnt[i % 3] += a;
}
if(all... | 0 |
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(
(unsigned)chrono::system_clock::now().time_since_epoch().count());
const long double PI = acosl(-1);
vector<pair<int, long long int>> info;
int xorGaussian(vector<long long int>& rows, long long int XOR) {
int r = 0, n = (int)rows.size();
info.resize... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q, n;
cin >> q;
for (long long i = 1; i <= q; i++) {
cin >> n;
int kq;
if (n == 2) {
kq = 2;
} else if (n % 2 == 0) {
kq = 0;
} else {
kq = 1;
}
cout << kq << "\n";
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int testCases;
cin >> testCases;
while (testCases--) {
int a, b;
cin >> a >> b;
if (a == b)
cout << 0 << endl;
else if (a > b && ((a - b) % 2 == 0) || b > a && ((b - a) % 2 != 0))
cout << 1 << endl;
else
cout << 2 << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> occ[27];
int mem[27][5001][27], p[27][5001];
int main() {
string second;
cin >> second;
int n = second.size();
for (int i = 0; i < n; i++) occ[second[i] - 'a'].push_back(i);
double ans = 0;
for (int i = 0; i < 27; i++) {
for (int j : occ[i]) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 1e6 + 4;
const int LIM = 6e5 + 3;
std::vector<int> adj[LIM + 3];
pair<int, int> a[LIM + 3];
bool vis[LIM + 3];
void dfs(int u) {
vis[u] = 1;
for (auto v : adj[u])
if (!vis[v]) dfs(v);
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {... | 4 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
const double PI = acos(-1.0);
const long long MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
int n;
long long k;
int num[105];
int judge(long long x) {
long long ans = 0;
for (int i = 1; i <= n; i++) ans ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n, x, s = 0, ans1 = 0, ans2 = 0;
cin >> n >> x;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const int N = 2e5 + 10;
int main() {
int n;
cin >> n;
int a[6] = {n >> 5 & 1, n >> 4 & 1, n >> 3 & 1,
n >> 2 & 1, n >> 1 & 1, n & 1};
int b[6] = {a[0], a[5], a[3], a[2], a[4], a[1]};
int ans = 0;
for (int i = 0; i < 6... | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.