code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | #include <bits/stdc++.h>
using namespace std;
//#define INF 1145141919810893364
#define REP(i,n) for(int i=0;i<(n);++i)
std::vector<int> bipartite(std::vector<std::pair<int,int>> edge){
int M = edge.size();
if(M==0)return {};
int N = 0;
for(int i=0;i<M;i++){
N=std::max(N,edge[i].first+1);
... | 0 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B;
scanf("%d%d", &A, &B);
printf("%d\n", (A == B) ? (A + B) : (2 * max(A, B) - 1));
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define per(i,n) for(int i=n-1;i>=0;--i)
#define sc1(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d %d",&a,&b)
#define sc3(a,b,c) scanf("%d %d %d",&a,&b,&c)
int main(){
int mod=1000000007;
int n,a,ans=0;
sc1(n);
int... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e+9
#define MAX_V 2505
struct edge {
int to;
int cost;
};
using P = pair<int, int>;
int V;
vector<edge> G[MAX_V];
int d[MAX_V];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P> > que;
fill(d, d+V, INF);
d[s] = 0;
que.push(P(0, s))... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int N;
char s[4002];
int r[4002],g[4002],b[4002];
long long int ans = 0;
int main(){
scanf("%d",&N);
scanf("%s",&s[1]);
//printf("%d\n",N);
//printf("%s\n",&s[1]);
for(int i=N-1;i>0;i--){
r[i] = r[i+1];
g[i] = g[... | 0 |
//include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout... | #include <cstdio>
#include <algorithm>
using namespace std;
const char *solve(){
int c[20] = {};
int a;
for(int i = 0; i < 5; ++i){
if(scanf("%d,", &a) == EOF){ return 0; }
++c[a];
}
c[14] = c[1];
int mc = 0, ms = 0, p = 0;
for(int i = 1; i < 14; ++i){
mc = max(mc, c[i]);
if(c[i] > 1){ ++p; }
int s =... | 1 |
#define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#defin... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=100000;
const db pi=acos(-1.0);
#define low... | 1 |
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using s64 = int64_t;
constexpr s64 INF = 1'010'000'000'000'000'000LL;
template<typename T, typename U>
bool chmin(T& xmin, const U& x)
{
if(x < xmin) {
xmin = x;
return true;
}
else {
return false;
... | /**
* All Pairs Shortest Paths (全点間最短パス)
*
* O(|E||V| + |V|^2 log|V|)
*/
/**
* Feasible Potential
*
* O(|E||V|)
*/
#include <vector>
#include <algorithm>
using namespace std;
using Int = long long;
struct edge{
int to;
Int cost;
};
vector<Int> Potential(const vector<vector<edge>>& G){
vector<... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functio... | 0 |
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
... | #include <bits/stdc++.h>
#include<cmath>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<... | 1 |
#include <cstdio>
#include <cstring>
#include <utility>
using namespace std;
int main() {
char str[21];
scanf("%s",str);
int length = strlen(str);
for(int i=0;i<length/2;++i) {
swap(str[i],str[(length-1)-i]);
}
puts(str);
return 0;
} | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#defin... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,h,w; scanf("%d%d%d",&n,&h,&w);
printf("%d\n",(n-h+1)*(n-w+1));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,w,h;
cin>>n>>h>>w;
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(n-i+1>=h&&n-j+1>=w)
cnt++;
}
}
cout<<cnt<<endl;
return 0;
} | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n,q;
vector<int> S,T;
cin >> n;
for(int i=0;i<n;i++) {
int s;
cin >> s;
S.push_back(s);
}
cin >> q;
for(int i=0;i<q;i++) {
int t;
cin >> t;
T.push_back(t);
}
// O(n^2)
int C = 0;
for(int t_itr=0;... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | 0 |
#include<bits/stdc++.h>
#define re register
#define max(a,b) ((a)>(b)?(a):(b))
const int maxn=305;
char S[maxn];
int dp[2][maxn][maxn],n,m,o,ans;
int main() {
scanf("%s",S+1);n=strlen(S+1);scanf("%d",&m);
for(re int p=0;p<=m;++p,o^=1) {
for(re int i=1;i<=n;i++) dp[o^1][i][i]=1;
for(re int l=2;l<=n;++l)
for(re... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
int dp[MAXN][MAXN][MAXN];
int main()
{
string s;
cin >> s;
int k;
cin >> k;
for(int sz = 1; sz <= s.size(); sz++){
for(int l = 0; l < s.size() - sz + 1; l++){
int r = l + sz - 1;
for(int j = 0; j <... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
static const int SIZE = 101;
static const long long int INF = 1e18;
long long int d[SIZE][SIZE] = { 0 };
void solve()
{
for (int i = 0; i < SIZE; ++i)
{
for (int j = 0; j < SIZE; ++j)
{
d[i][j] = INF;
}
d[i][i] = 0;
}
int V, E;
cin >> V >> ... | #include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d... | 1 |
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char **argv){
int **array;
int n;
while(1){
scanf("%d", &n);
if(n == 0){
break;
}
array = (int **)calloc(n+1, sizeof(int));
for(int i = 0; i <= n; i++){
array[i] = (int *)calloc(n+1, sizeof(int));
}
for(int i = 0; i < n; i++){
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, tmp0 = 0, tmp1 = 0;
int tmp2 = 0, tmp3, out1 = 0, out2 = 0;
int a[100];
scanf("%d", &n);
while (n) {
for (tmp3=0;tmp3<100;tmp3++) a[tmp3] = 0;
tmp0 = 0, out2 = 0;
while (tmp0 < n) {
tmp1 = 0... | 1 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int l, r, i, j, ans;
scanf("... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define re register
#define ull unsigned ll
using namespace std;
inline int read(){
int s=0,t=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')t=-1;ch=getchar();}
while(ch>='0'&&ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*t;
}
const int N=41;
const int ... | #include <bits/stdc++.h>
using namespace std;
using Int = int_fast64_t;
constexpr Int mod = 1e9+7;
Int n, x, y, z;
vector<vector<Int>> dp;
bool ok(Int w){
Int c = 0;
for(Int j=0; (w>>j)>0; ++j)
if((w>>j) & 1){
if(j+1 == z) c += 4;
if(j+1 == z+y) c += 2;
if(j+1 == z+y+x) c += 1;
}
return c != 7;
}
int... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); ++ i)
#define rrp(i,a,b) for (int i = (a); i >= (b); -- i)
#define gc() getchar()
#define fir first
#define sec second
typedef pair<int,int> pii;
typedef double db;
typedef long long ll;
template <typename tp>
inline void read(... | #include <iostream>
#include <algorithm>
#include <utility>
#include <fstream>
#include <iomanip>
#include <complex>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#define IO ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a[3];
for (int i = 0; i < 3; ++i)
{
cin >> a[i];
}
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
} | #include <iostream>
using namespace std;
int main(){
string ss;
int num[128];
num['M'] = 1000;
num['D'] = 500;
num['C'] = 100;
num['L'] = 50;
num['X'] = 10;
num['V'] = 5;
num['I'] = 1;
while( cin >> ss ){
int answer = 0;
string::iterator it = ss.begin();
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e18
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1;... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000002
int main(){
int N,M;
cin>>N>>M;
vector<map<int,vector<int>>> E(N);
for(int i=0;i<M;i++){
int p,q,c;
scanf("%d %d %d",&p,&q,&c);
p--;q--;
E[p]... | #include<bits/stdc++.h>
using namespace std;
#define f1(a,b,c) for(int c=a;c<=b;c++)
#define f2(a,b,c) for(int c=a;c>=b;c--)
#define f3(a,b,c) for(int c=a;c;c=b)
#define so1(a,n) sort(a+1,a+n+1,mycmp);
#define so2(a,n) sort(a+1,a+n+1);
#define ll long long
#define itn int
#define ubt int
#define pii pair<int,int>
#def... | 1 |
#include<iostream>
using namespace std;
int InsertionSort(int* a, int n, int g)
{
int tmp, j, count = 0;
for (int i = g; i < n; i++)
{
tmp = a[i];
for (j = i - g; j >= 0 && a[j] > tmp; j -= g)
{
a[j + g] = a[j];
count++;
}
a[j + g] = tmp;
}
return count;
}
int ShellSort(int* a, int n)
{
int m,... | #include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
void insertionSort(int A[], const int n, const int g, int *cnt)
{
for( int i = g; i < n; ++i ){
int tmp = A[i];
int j = i - g;
while( -1 < j && tmp < A[j] ){
//cout << A[j+g] << "<-->" << A[j] << endl;... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;cin>>s;
auto pos = s.find("AC");
if(pos!=string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef vector<vector<char>> matrix;
typedef long long ll;
int N;
matrix ans;
matrix make_m(int n) {
matrix m(n, vector<char>(n, '.'));
if (n == 3) {
m[0][0] = m[0][1] = 'a';
m[1][2] = m[2][2] ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
if(s.size() == 2) cout << s << endl;
else {
reverse(s.begin(), s.end());
cout <... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector... | 0 |
#include <stdio.h>
int main(){
int h,w,n;
scanf("%d", &h);
scanf("%d", &w);
scanf("%d", &n);
int ans = 0, count = 0;
while (n > ans){
if(w >= h){
ans += w;
count++;
}else if(h>w){
ans += h;
count++;
}
}
printf("%d\... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX... | 1 |
#include <bits/stdc++.h>
typedef long double ll;
#define fr(i,a,b) for(long long i=a; i<b; i++)
#define rf(i,a,b) for(ll i=a; i>=b; i--)
typedef std::vector<long long > vi ;
#define F first
#define S second
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define PB push_back
... | #include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
int W[10], K[10];
for (int i = 0; i < 10; i++) {
cin >> W[i];
}
for (int i = 0; i < 10; i++) {
cin >> K[i];
}
sort(W, W+10, greater<int>());
sort(K, K+10, greater<int>());
c... | 0 |
#include <iostream>
#include <vector>
int main()
{
int n;
std::cin >> n;
std::vector<std::vector<int>> memo(60, std::vector<int> (25));
for (int i = 0; i < n; ++i)
{
long double a;
std::cin >> a;
long long b = (long long) (a * 1e9 + 0.5);
int count2 = 0, count5 = 0;
... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
cin >> ... | 1 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
const int maxn=205;
ll a[maxn],p[maxn];
char s[maxn];
int n,m;
void solve(){
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
scanf("%s",s+1);
if(s[n]=='1') prin... | 1 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define debug(x) (cout << # x ": " << x << endl)
#define ll long long int
#define repeat(n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
int main() {
int n;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<int> L;
for (int i = 0; i < 2 * N; ++i)
{
int temp;
cin >> temp;
L.push_back(temp);
}
int ans = 0;
sort(L.begin(), L.end());
for (int i = 0; i < 2 * N; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef struct{
int x,y,id;
} ii;
typedef tuple<int,ii,ii> t;
int dist(ii a,ii b){
return min(abs(a.x-b.x),abs(a.y-b.y));
}
vector<int> up;
int fp(int u){
if(up[u]<0) return u;
else return up[u] = fp(up[u]);
}
void unite(int u,int v){
int x = fp(u... | 1 |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | #include <iostream>
using namespace std;
int main ()
{
int N;
while (cin >> N, N) {
int n1, n2;
int a = 0, b = 0;
for (int i = 0; i < N; i++) {
cin >> n1 >> n2;
if (n1 > n2) a += n1 + n2;
else if (n1 < n2) b += n1 + n2;
else {
a +... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){//aとbの最大公約数を返す
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){//aとbの最小公倍数を返す
return a*b/gcd(a,b);
}
ll pow(ll x,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
int alp[27];
for (int i = 0; i < 26; i++) {
alp[i] = 0;
}
alp[26] = 1;
cin >> s;
if (s == "zyxwvutsrqponmlkjihgfedcba") {
puts("-1");
} else {
string ans = "";
for (int i = 0; i < (int)s.size(); ... | 1 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200000;
int n,m,a[N+9];
int cnt[N+9];
bool Get_a(){
for (int i=1;i<=n;++i) cnt[i]=0;
for (int i=1;i<=n;++i){
int l=max(i-a[i],1),r=min(i+a[i],n);
++cnt[l];--cnt[r+1];
}
for (int i=1;i<=n;++i) a[i]=cnt[i]+=cnt[i-1];
for (int i... | 0 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }... | //#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitse... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,k,L[100];
cin >> n >> k;
for(int i = 0; i < n; i++)
cin >> L[i];
sort(L,L+n);
int sum = 0;
for(int i = n-1; i >= n-k; i--)
sum += L[i];
cout << sum <... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define vll vector<ll>
#define ld long double
#define pll pair<ll,ll>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#d... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int* mallocint(int si)
{
return (int*) malloc(si * sizeof(int));
}
int* _minn;
int* _total;
bool compare(int i1, int i2)
{
if( _minn[i1] != _minn[i2] ) return _minn[i1] > _minn[i2];
return _total[i1] > _total[i2];
}
bool comparen(int i1, ... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
long long Min,Max,sum=0,n,m;
scanf("%lld%lld",&n,&Max);
Min=sum=Max;
for(int i=1;i<n;i++){
scanf("%lld",&m);
if(m>Max) Max=m;
if(m<Min) Min=m;
sum+=m;
}
printf("%lld %lld %lld\n",Min,Max,sum);
return 0;
}
| #include<iostream>
using namespace std;
#include<stdio.h>
int main(){
int n;
scanf("%d\n", &n);
int i = 0;
int x, min, max;
long sum;
min = 1000000;
max = - 1000000;
sum = 0;
while (i <= n){
if(i == n){
printf("%d %d %ld\n", min, max, sum);
break;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int primes[] = {3, 13, 23, 43, 53, 73, 83, 103, 113, 163, 173, 193, 223, ... | // 2020-08-26 16:05:35
// clang-format off
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = ... | 1 |
// God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | #include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
//#include <cmath>
#include <unordered_map>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/unordered_set.hpp>... | 0 |
# include <iostream>
using namespace std;
int gcd(int a, int b){
return (b==0) ? a : gcd(b, a%b);
}
int main(){
int n, k;
cin >> n >> k;
int g = 0, m = 0;
for(int i=0; i<n; i++){
int x;
cin >> x;
g = gcd(x, g);
m = max(x, m);
}
if(k <= m && k % g == 0) cout << "POSSIBLE";
else cou... | #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long int ll;
int main()
{
int N,M;
scanf("%d %d",&N,&M);
int ans=1;
for(int i=1;i<=min(100000,M);i++)
{
i... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int mod_pow(int n, int e, int mod){
int ans = 1;
n = n % mod;
while(e != 0){
if(e % 2 == 1){
ans = (ans * n) % mod;
}
e /= 2;
n = (n * n) % mod;
}
return ans;
}
int mod_inv(int n, int mo... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(void)
{
int n, m;
while (cin >> n >> m, n || m){
vector <int> p(n + 1);
for (int i = 0; i < n; i++){
scanf("%d", &p[i]);
}
p[n] = 0;
n++;
vector <int> sum(n * n);
int cnt = 0;
for (int i =... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
inline int rd() {
char ch=getchar(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-1; ch=getchar();}
while(isdigit(ch)) {i=(i<<1)+(i<<3)+ch-'0'; ch=getchar();}
return i*f;
}
const int N=2e5+50;
const LL INF=0x3f3f3f3f3f3f3f3f;
int n,q... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T>
using Graph = vector<vecto... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
ll MOD=1000000007;
int inf=1000000000;
ll INF=10000000000000000;
int main(){
int n;
ll x;
cin >> n >> x;
vector<ll> b(n),l(n),u(n);
vector<pair<ll,ll>> a(n);
... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | 1 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
usin... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N, X, T, time;
cin >> N >> X >> T;
time = N/X;
if (N%X != 0) time += 1;
cout << time*T << endl;
}
| #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int A[3], K;... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | //#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x)... | 1 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size()) //size() unsigned -> int
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)ret... | #include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
ll n;
cin >> n;
vector<ll>a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
ll x = 0,y = 0;
ll index = 0;
for... | 1 |
//kruskal tree
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 100000
int parent[M],a[M],b[M];
pair<int,int>node[M];
int root(int a){return parent[a]==a?a:parent[a]=root(parent[a]);}
int unite(int a,int b){
int x=root(a),y=root(b);
if(x==y)return 0;
parent[x]=y;
return 1;
}
int main(){
int i,... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct edge{
int from,to,weight;
};
bool asc(const edge &e,const edge &f){
return e.weight < f.weight;
}
int init(vector<int> &U){
for (int i=0;i<U.size();i++){
U[i]=i;
}
}
int root(vector<int> &U,int x){
if(x==U[x]... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define MAX(a,b) ((a)>(b)?(a):(b))
int main()
{
int N;
long long M;
cin >> N >> M;
while(N!=0 && M!=0) {
vector<long long> p;
long long ans=0;
for(int i=0; i<N; ++i) {
long long tem... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int m,nmin,nmax,ans=0,max=0,p[200]={};
cin>>m>>nmin>>nmax;
if(m+nmin+nmax==0)break;
for(int i=0;i<m;i++)cin>>p[i];
for(int i=nmin;i<=nmax;i++)
if(p[i-1]-p[i]>=max){
max=p[i-1]-p[i];
ans=i;
}
cout<<ans<<endl;
}
ret... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int m;
cin >> m;
ll total = 0;
ll cnt = ... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<int,int>;
using graph = vector<vector<int>>;
const int dx[... | 1 |
#include <iostream>
#include <queue>
#define INF 1000000000
#define NV 100000
using namespace std;
class edge
{
public:
int t;
int d;
edge *nextedge;
edge(int,int);
};
edge::edge(int tt,int dd)
{
t=tt;
d=dd;
nextedge=NULL;
}
class vertice
{
public:
edge *firstedge;
void create_edge(int,int);
};
... | #include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#define INF 100000000
#define ll long long
using namespace std;
class Bit{
private:
ll *par, *rk, size;
public:
Bit(ll size){
par = new ll[size];
rk = new ll[size];
for(ll i = 0; i < size; i++){
par[i] = i;... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2*a-1 << "\n";
}
else if (b > a) {
cout << 2*b-1 << "\n";
}
else {
cout << a + b << "\n";
}
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a,b,ans=0;
cin>>a>>b;
for(int i=0;i<2;i++)
{
if(a>=b)
{
ans+=a;
a--;
}
else if(b>a)
{
ans+=b;
b--;
}
}
cout<<ans;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll R[400009];
string s;
cin >> s;
ll n = s.size();
map<char, int>mp;
for (int i = 0; i < n; i++) {
mp[s[i]]++;
}
ll ans = n*(n-1)/2;
for (auto& p : mp) {
ll v = p.second;
ans -=... | #include<bits/stdc++.h>
#define mo 1000000007
#define pi 3.1415926535898
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
... | 0 |
/**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M... | #include<bits/stdc++.h>
using namespace std;
vector < int > v;
bool check(int n, int m, int mid){
int x=(m-mid);
long long int y=(n-1)*1LL*mid;
return (x>=y && x%mid==0);
///return (m/mid>=n && m%mid==0);
}
int cal(int n, int m){
int ans=0;
for(int i=1; i*i<=m; i++){
if(m%i==0){
... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
if(a < 1200) cout << "ABC\n";
else if(a < 2800) cout << "ARC\n";
else cout << "AGC\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
#define ABC 001
#define ... | 1 |
#include <cstdlib>
#include <string>
#include <iostream>
#include <sstream>
using namespace std;
int main()
{
string str[2];
for (int i = 0; i < 2; i++)
{
getline(cin, str[i]);
// cout << "Input: " << str[i] << endl;
}
str[1] += ' ';
int num = atoi(str[0].c_str());
// cout... | #include<cstdio>
#include<algorithm>
#define Rint register int
using namespace std;
typedef long long LL;
const int N = 200003;
int n;
LL ans, d, a[N], f[N], g[N];
int main(){
scanf("%d%lld", &n, &d);
for(Rint i = 1;i <= n;i ++){
scanf("%lld", a + i);
ans += a[i];
}
f[1] = a[1];
for(Rint i = 2;i <= n;i ++) f[i... | 0 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
double distance(double, double, double, double);
int main(){
double x1 ,y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(12);
cout << distance(x1, y1, x2, y2) << endl;
}
double distance(double x1, double y1, do... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
C=max((A+B),(A-B));
cout << max(C,(A*B)) << endl;
}
| 0 |
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<iterator>//集合演算(積集合,和集合,差集合など)
#include<map>//map(辞書)
#include<numer... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll P = 998244353;
ll f(ll b, ll n) {if (n <= 0) return 1; auto p = f(b, n / 2); return p * p % P * (n % 2 ? b : 1) % P;}
ll ms[200001];
int main()
{int N, M, K, ans = 0; cin >> N >> M >> K;
ms[0] = 1; for (int r = 1; r <= K; ++r) ms[r] = ms[r... | 1 |
#include <iostream>
using namespace std;
int main()
{
string S;
cin>>S;
char a=S[0]=='R';
char b=S[1]=='R';
char c=S[2]=='R';
if(a&b&c)
{
cout<<"3";
}
else if(a&b||b&c)
{
cout<<"2";
}
else if(a|b|c)
{
cout<<"1";
}
el... | #include <bits/stdc++.h>
using namespace std;
int n;
char x[5];
int main() {
scanf("%s", x);
int ans = 0, cur = 0;
for (int i = 0; x[i]; i++)
if (x[i] == 'R')
ans = max(ans, ++cur);
else
cur = 0;
printf("%d\n", ans);
}
| 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll n,m,k;
ll poww(ll x,ll k)
{
ll base=x,ans=1;
while(k)
{
if(k&1)ans=ans*base%mod;
base=base*base%mod;
k>>=1;
}
return ans;
}
ll nok(ll x)
{
ll ans=1;
for(int i=1;i<=x;i++)ans=ans*i%mod;
return ans;
}
int main()
{
ll a... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using nam... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long h,w;cin>>h>>w;
long b=0;
vector<string>S(h);for(long i=0;i<h;i++){
cin>>S[i];
for(char c:S[i])if(c=='#')b++;
}
vector<long>D(w*h,-1);D[0]=0;
queue<long>q;q.push(0);
while(q.size()){
long f=q.front();q.pop();
if(f/w-1>=0&&D[f-w]=... | /**
* created: 25.07.2020 06:24:27
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s);... | 1 |
// Abu Hurayra (HurayraIIT)
// IIT, Jahangirnagar University
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <math.h>
#include <stdio.h>
#include <string.h>
using nam... | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <iostream>
#include <bitset>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <list>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
using namespace s... | 1 |
#include<bits/stdc++.h>
#include<atcoder/all>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) REP(i,0,(n))
using namespace std;
using namespace atcoder;
using ll = long long;
int main() {
int N, Q, a, b, c;
cin >> N >> Q;
fenwick_tree<ll> fw(N);
rep(i, N) {
cin >> a;
fw.add... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | 1 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
char a[105][105];
int f[2][105][105][105],line[105][105],list[105][105],n,m;
void upd(int &x,int w){
x=(x<w)?w:x;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%s",a[i]+1);
int x,y;
for(int i=1;i<=n;i++... | #include <iostream>
#include <vector>
using namespace std;
void solve()
{
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<int> B(M);
for(int i = 0; i < N; ++i)
{
cin >> A[i];
}
for(int i = 0; i < M; ++i)
{
cin >> B[i];
}
vector<int> point(N);
int max = 0;
for(int i = 0; i < M; ++i)
{
for(int j =... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<tuple>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef unsigned long long i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) ... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
bool is_integer(double x){
return std::floor(x) == x;
}
int main(){
ll n; cin >> n;
while(true){
if(is_integer(sqrt(n))){
p... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll n;
cin >> n;
ll ans = 0;
ans += n/11*2;
if(n%11 != 0) ans += (n%11-1)/6 + 1;
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <regex>
using namespace std;
int main() {
string input;
cin >> input;
regex pattern("^A[a-z]+C[a-z]+$");
if (regex_match(input, pattern))
{
cout << "AC" << endl;
}
else
{
cout << "WA" << endl;
}
return 0;
}
| #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
bool b=true;
int cnt=0,x;
if(s[0]!='A') b=false;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C'){
cnt++;
... | 1 |
#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <stack>
#include <queue>
#include <list>
const long long int INF = 6000000000;
const int MOD = (int)1e9 + 7;
using ll = long long;
using namespace std;
typedef pair<int,int> P;
struct edge{
int... | #include<stdio.h>
int GCD(int a, int b) {
int A, B, buff;
// A >= B
if (b > a) {
A = b; B = a;
}
else { A = a; B = b; }
while (A%B) {
buff = B;
B = A % B;
A = buff;
}
return B;
}
int main() {
int N, a, b, c;
int G;
int GC[1000000];
scanf("%d", &N);
if (!(N - 2)) {
scanf("%d %d", &a, &b);
G ... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 100001
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef... | #include <iostream>
using namespace std;
template<class T> bool chmax(T &a, T b) {
if (a < b) a = b; return true;
return false;
}
void solve(long long A, long long B){
long long ans = -1000001;
chmax(ans, A + B);
chmax(ans, A - B);
chmax(ans, A * B);
cout << ans << '\n';
}
int main(){
... | 0 |
#include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n,... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define ld long double
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 2e5 + 10... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
char s[300020];
int t[8][2];
int n,f[300020][8];
inline void pre(){
t[0][0]=2;t[0][1]=1;
t[1][0]=3;t[1][1]=5;
t[2][0]=4;t[2][1]=7;
t[3][0]=6;t[3][1]=1;
t[4][0]=2;t[4][1]=2;
t[5][0]=5;t[5][1]=5;
t[6][0]=3;t[6][1]=3;
t[7][0]=2;t[7][1]=1;
}
int... | //%std
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N = 300003, mod = 1e9 + 7;
void upd (int&a, int b) { a = (a + b) % mod; }
char s[N];
int n, dp[N][3][3];
int main ()
{
// freopen ("x.in", "r", stdin);
scanf("%s", s + 1);
n = strlen(s + 1);
dp[0][0][0] = ... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
#define repeat(i,n) for (int i = 0; i < (n); ++i)
#define repeat_from(i,m,n) for (int i = m; i < (n); ++i)
#define MAX_S 1000
int dp[2][MAX_S+1];
int main() {
string s1, s2;
getline(cin, s1);
getline(cin, s2);
int *cur = dp[0]; repeat (i,s... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
#define IOI 101
#define IOIOIOIOI 101010101
int dp[10 * IOI][10 * IOI];
string s, t;
int main() {
for (int i = 0; i < 10 * IOI; i++) {
for (int j = 0; j < 10 * IOI; j++) {
dp[i][j] = IOIOIOIOI;
}
}
cin >... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mul[2] = {233, 19260817};
const int mod[2] = {998244353, 1000000007};
#define pb push_back
int n;
vector <int> a, b, na, nb, pw[2], hsh[2];
int get(int l, int r, int k) {return (hsh[k][r] + mod[k] - 1LL * pw[k][r - l] * hsh[k][l] % mod[k]) % mod[k];}
int main(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 1 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using gp_queue=priority_queue<T, deque<T>, less<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
E... | #include<iostream>
#include<queue>
#include<vector>
#include<functional>
using namespace std;
typedef pair<int,int> P; //現在コスト、島の番号
int n,k;
int cost[101][101];
int Dijkstra(int left,int get){
int done[101] = {0}; //確定後のコストを格納
int mincost[101];
for(int i = 0;i < 101;i++)
mincost[i] = 500000000;
priority_queue<P,... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#pragma region Debug
template <typename T>
void view(const std::vector<T> &v)
{
for (const auto &e : v)
{
std::cout << e << " ";
}
... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define d... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <unordere... | #include <bits/stdc++.h>
using namespace std;
int main()
{int i, c{}; string A, B, C; cin >> i >> A >> B >> C;
while (i--) c += set<char>{A[i], B[i], C[i]}.size() - 1;
cout << c;} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int dp[88][88][14000];
int main(){
int h, w;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w)), b(h, vector<int>(... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | 1 |
#include<iostream>
int main(){
int N;
std::cin>>N;
long int* A=new long int[N];
long sum=0;
for(int i=0;i<N;i++){
std::cin>>A[i];
sum+=A[i];
sum%=1000000007;
}
long ans=0;
for(int i=0;i<N;i++){
sum-=A[i];
if(sum<0){
sum+=1000000007;
}
ans+=sum*A[i];
ans%=1000000007;
}
std::cout<<ans;
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
t... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q,z,y=0;
cin>>q;
z=q;
while(z>0){
y+=z%10;
z/=10;
}
if(q%y==0) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N ; cin >> N ;
int P ;
int a,b,c,d,e,f,g,h ;
a = N % 10 ;
b = (N / 10) % 10 ;
c = (N / 100) % 10 ;
d = (N / 1000) % 10 ;
e = (N / 10000) % 10 ;
f = (N / 100000) % 10 ;
g = (N / 1000000) % 10 ;
h = (N / 10000000) % 10 ;
if ( N % (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, count;
cin >> N;
count = 0;
vector<int> vec(N);
for(int i = 0; i < N; i++){
cin >> vec.at(i);
}
for(int i = 0; i < N; i++){
for(int j = 0; j < i; j++){
for(int k = 0; k < j; k++){
if... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x,y) for(ll i=x;i<=y;i++)
#define imin INT_MIN
#define imax INT_MAX
int mod =1e9+7;
//~ vector<bool> cats;
//~ ll ans;
//~ ll n,m;
//~ void dfs(vector<vector<int>>& graph,int s,int consCats,int parent){
//~ if(consCats>m) return;
//~ if... | 1 |
#include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, q, inf=2e9, cnt;
vector<int> par ;
vector<pair<int,pair<int,int> > > v;
map<int,int> id ;
int tree[3000006];
void update(int node, int s, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
int N, Q;
cin >> N >> Q;
int Si, Ti, Xi, Di;
vector<array<int, 3>> stx(N);
for(int i=0;i<N;i++){
cin >> Si >> Ti >> Xi;
auto l = Si-Xi;
auto r = Ti-Xi;
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
class LinearSearch {
public:
int n, q;
vector< int > S, T;
LinearSearch() {}
void solve() {
int ans = 0;
for (int i = 0; i < q; ++i) {
int tar = T[i];
for (int j = 0; j < n; ++j) {
if (S[j] == tar) {
++ans;
break;
}
}
}
... | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n,q,ans=0,chk=0;
scanf("%d",&n);
vector<int> s(n);
for(auto&e:s){
scanf("%d",&e);
}
sort(s.begin(),s.end());
scanf("%d",&q);
vector<... | 1 |
#include<bits/stdc++.h>
using namespace std;
int64_t mod=1e9+7;
int main(){
int64_t h,w,k,i,j;
vector<int64_t> f(9);
cin>>h>>w>>k;
vector<vector<int64_t>> t(w+1,vector<int64_t>(w+1)),c(h+1,vector<int64_t>(w+1));
f.at(0)=1;
f.at(1)=1;
for(i=2;i<=8;i++) f.at(i)=f.at(i-1)+f.at(i-2);
for(i=1;i<=w;i++){
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(2 * n);
for (int i = 0; i < (n << 1); i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 2];
for (int i = 1; i < n + 1; i++) cin >> a[i];
a[0] = 0, a[n + 1] = 0;
ll s = 0;
rep(i, n + 1) s += abs(a[i + 1] - a[i]);
for (in... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1001001001;
const ll mod = 1000000007;
ll dp[105][11];
int main(){
int h, w, k; cin >> h >> w >> k;
dp[0][1] = 1;
for(int i = 1; i <= h; i++){
for(int l = 1; l <= w; l++){
ll a = 0, b = 0, c = 0;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int mod = 1e9+7;
const int N = 123;
long long p[N];
int H, W, K;
long long dp[N][8]... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define N 100000
#define pb push_back
int n, k, len, a[N + 5], d[N + 5], vis[N + 5], ans;
vector<int> G[N + 5];
struct Cmp {
bool operator () (const int &a, const int &b) const {
return d[a] < d[b];
}
};
priority_queue<int, vector<int>, Cmp> pq;
void dfs1(int u) {
... | ////////////////////////////////////////////
/// ///
/// Template ver. 1 rapel ///
/// Fear is Temporary, Regret is Forever ///
/// Must Try and Get AC ///
/// ///
////////////////////////////////////////////
#incl... | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int h,w,a,b,fac[200006],ans=0,inv_fac[200006];
int binpow(int x,int y){
if(y==0) return 1;
else{
long long tmp=binpow(x,y/2);
if(y%2==1) return ((tmp*tmp)%mod*x)%mod;
else return (tmp*tmp)%mod;
}
}
int C(int k,int n) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
long long n,q;
cin >> n >> q;
long long s[n],t[n],x[n],d[q];
pair<long long, int> p[n];
for(int i=0;i<n;i++){
cin >> s[i] >> t[i] >> x[i];
p[i]=make_pair(x[i], i);
}
sort(p, p+n);
vector<pair<long long, int> > vec;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct ppp{ll l,r,v,tag;}tree[4000005];
struct ttt{ll s,t,x;}b[200005];
bool cmp(ttt l,ttt r){return l.x>r.x;}
ll p[200005];
set<ll> k;
vector<ll> a;
void push(ll i){
tree[i*2].tag=tree[i].tag;
tree[i*2+1].tag=tree[i].tag;
tree[i*2].v=... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int main() {
int n,m,q;cin>>n>>m>>q;
int a[n][n];
rep(i,n)rep(j,n)a[i][j]=0;
int tmp_r,tmp_l;
rep(i,m){
cin>>tmp_l>>tmp_r;
--tmp_l,--tmp... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=1e6+10;
const int mod=1e9+7;
const double pi=3.1415926535;
int w[3005],v[3005];
int dp[3005][3005][2];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,t;
cin... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const long long INF = 2e18;
const long long MOD = 1e9+7;
#define sx(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i,n) for (int i = 0... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define ... | 0 |
#include <bits/stdc++.h>
int main(void) {
int n;
int q;
int S[16384];
int T[512];
std::cin >> n;
for(int i = 0; i < n; ++i) {
std::cin >> S[i];
}
std::cin >> q;
for(int i = 0; i < q; ++i) {
std::cin >> T[i];
}
int ans = 0;
for(int i = 0; i < q; ++i) {
int num = T[i];
for(in... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
const int mxN = 1e9 + 7;
char s[100005];
long long dp[100005][13];
int minimum_Color(vector<int> a, int n) {
multiset<int> last;
for (int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s1,s2;
cin>>s1>>s2;
cout<<s2+s1<<endl;
} | #include<stdio.h>
int main(){
int A,B,C;
scanf ("%d",&A);
scanf ("%d",&B);
scanf ("%d",&C);
if (A==B && A==C && B==A && B==C && C==A && C==B){
printf ("No\n");
}else if (A==B||A==C||B==A||B==C||C==A||C==B){
printf("Yes\n");
}else {
printf ("No\n");
}
}
| 0 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <limits.h>
#include <string>
#include <string.h>
#include <sstream>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
int nu... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s; cin>>s;
int x=stoi(s);
int y=x*x*x;
cout<<to_string(y)<<endl;
} | 1 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>
#include <tuple>... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
string str;
cin >> n;
cin >> str;
vector<int> vW(n+1,0),vE(n+1,0);
for(int i=0;i<n;i++){
vW[i+1]+=vW[i];
if(str[i]=='W') vW[i+1]++;
vE[i+1]+=vE[i];
if(str[i]=='E') vE[i+1]++;
}
int ans=999999999;
int now;
for(int ... | 0 |
#include <iostream>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a+b < c+d) cout << "Right";
else if(a+b > c+d) cout << "Left";
else cout << "Balanced";
cout << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(){
int l[10];
int v[2];
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", &l[0], &l[1],
&l[2], &l[3], &l[4], &l[5], &l[6], &l[7], &l[8], &l[9], &v[0], &v[1]) != EOF){
double sum = 0.0;
int i;
for(i=0; i<10; ++i) sum ... | 0 |
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
struct side{
int n;
int m;
int l;
};
side sides[100000];
void mergesort(int l,int r){
if(l==r)return;
side temp;
if(l==r-1){
if(sides[l].l>sides[r].l){
temp=sides[l];
sides[l]=sides[r];
... | #include <algorithm>
#include <iostream>
#include <vector>
struct Edge {
int start;
int target;
int weight;
};
class UnionFind {
std::vector<int> m_nodes;
public:
UnionFind(size_t size) : m_nodes(size) {
for (size_t i = 0; i < size; i++)
m_nodes[i] = i;
}
int find(int index) {
int ret = m_nodes[index]... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e17... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int) 5e5 + 55;
int fen[N];
void upd(int x, int y) {
while (x < N) {
fen[x] += y;
x |= (x + 1);
}
}
int get(int x) {
int res = 0;
while (x >= 0) {
res += fen[x];
x = (x & (x + 1)) - 1;
}
return res;
}
int res[N];
vector<pair<i... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, m, siz, num;
int w[N], cnt[N], belong[N];
int now, ans[N];
struct query{
int l, r, id;
}q[N];
//bool cmp(query a, query b)
//{
// return (belong[a.l] ^ belong[b.l]) ? belong[a.l] < belong[b.l] : ((belong[a.l] & 1) ? a.r < b.r : a.r > b.r... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.