code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
... | //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#define all(c) (c).begin(), (c).end()
#define length(x) (int)(x).size()
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(){
lli a,b,c;
cin>>a>>b>>c;
if(c%2==0){
if(abs(a)>abs(b))
cout<<">";
else if(abs(a)==abs(b))
cout<<"=";
else if(abs(a)<abs(b))
cout<<"<";
}
else{
if(a>b)
... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define FastIO cin.sync_with_stdio(false), cin.tie(nullptr)
#define pb push_back
#define fs first
#define sc second
#define mkp make_pair
#define endl '\n'
// IO
#define multitest signed __T; cin >> __T; while(__T--)
template<typename T>
void _read(T&... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse4,fma")
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using f32 = double;
using f64 = long double;
using u8 = unsigned char;
using u16 = unsigned short;
using u32 = unsigned int;
using u64 = unsigned ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define f(i,j,n) for(int i = j; i <= n; i++)
#define r(i,n,j) for(int i = n; i >= j; i--)
#define all(container) container.begin() , container.en... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+10;
struct BIT{
int n,tr[N];
void init(int _n){
n=_n;
memset(tr,0,sizeof tr);
}
void add(int x,int v){
for(int i=x;i<=n;i+=i&-i)
tr[i]+=v;
}
int sum(int x){
int ans=0;
for(int i=x;i;i-=i&-i)
ans+=tr[i];
return ans... |
#include<iostream>
#include<vector>
#include<math.h>
#include<algorithm>
#include<stack>
#include<list>
#include<queue>
#include<set>
#include<string>
#include<string.h>
#include <sstream>
#include<map>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#define... | /**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pi (3.141592653589)
#define pb push_back
#define mp make_pair
#define INF 1000000000000000000
#define MOD 1000000007
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define pll pair<ll , ll>
#define ff first
#d... | #include<bits/stdc++.h>
using namespace std;
int H,W,A,B;
int tatami[16][16];
int dfs(int y,int x){
//cout<<x<<","<<y<<endl;
if(y>=H){
if(A==0&&B==0) return 1;
return 0;
}
int nx=x+1;
int ny=y;
if(nx>=W){
nx=0;
ny++;
}
int ans=0;
if(tatami[y][x]==1)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vt vector
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
const int64_t MOD = 1000000007;
// 🚩
// 20201204 0... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
const long long INFLL = 1e18;
using ll = long long;
int main(){
int h, w;
cin >> h >> w;
const int MAX = 2000;
char s[MAX][MAX];
for(int i = 0; i < h; i++) {
for(int j = 0; j < w; j++){
cin >> s[i][j];
... |
#include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n;
ll ans = 0;
cin >> n;
if (n >= 1000) {
ans += n - 999;
}
if (n >= 1000000) {
ans += n - 999999;
}
if (n >= 1000000000) {
ans += n - 999999999;
}
if (n >= 1000000000000) {
ans += n - 999999999999;
}
if (n >= 100... |
#include <bits/stdc++.h>
//#include <atcoder/modint>
#define inc(i, n) for (int i = 0; i < (n); i++)
#define incs(i, s, n) for (int i = (s); i < (n); i++)
//#define yes printf("Yes\n")
//#define no printf("No\n")
using namespace std;
//using mint = atcoder::modint998244353;
//using pii = pair<int, int>;F
us... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<typename T>
T pown(T b, ll e) {
if(e == 0) return 1;
T p = pown(b, e / 2);
if(e % 2 == 0) return p * p;
return p * p * b;
}
template<const int mod>
struct Intmod {
ll a;
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define ll int64_t
#define ld long double
#define nl cout<<"\n"
... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... |
/*********************************************************************************\
* _________ _ _ ________ _ _ __ ________ *
* |___ ___|| | | || ______|| | | | / \ | ____ | *
* | | | | | || |______ | |_____| | / /\ \ | |____| |... | // -- //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5+228;
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll q;
cin >> q;
while(q--){
ll n;
cin >> n;
ll u = n&-n;
ll l = 1, e=0;
while(l<u){
l<<... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll ans = 0;
ll nc = 0;
ll sum = 0;
ll m = 0;
for (int i = 1; i <= n; i++) {
su... | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se sec... |
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define pb push_back
#define ... | #include<bits/stdc++.h>
#define rep(i, n) for (Int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(Int i=(n)-1;i>=0;i--)
#define FOR(i,a,b) for(Int i=a;i<=Int(b);i++)
#define __MAGIC__ ios::sync_with_stdio(false);cin.tie(nullptr);
//#include <atcoder/all>
//using namespace atcoder;
typedef long long Int;
const long lon... |
/*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<long long>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvc = ... |
#include<iostream>
using namespace std;
int N_MAX = 10001;
int main()
{
int n,m,i,a,s=0;
bool b[N_MAX];
cin >> n;
fill(b,b+N_MAX,0);
b[6]=1;
b[10]=1;
b[15]=1;
n-=3;
for(i=2;n>0&&i*6<=10000;i++,n--)
b[i*6]=1;
for(i=2;n>0&&i*10<=10000;i++)
if(!b[i*10]){
b[i*10]=1;
n--;
}
for(... | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <cstring>
#include <istream>
#include <algorithm>
#include <map>
#include <cmath>
#include <unordered_map>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
b = c;
}
if (b == 0)return a;
else return g... |
#include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
#ifndef ONLINE_JUDGE
#define local true;
#endif
const ll MOD ... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < ll(n); ++i)
typedef int64_t lint;
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using lb = long double;
#define FOR(i, a... |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
#include <bitset>
// #include <atcoder/all>
#include <fstream>
#include <random>
#include ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
#ifndef DEBUG
#define cerr while(false) cerr
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_n... | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tsc=1;
//cin>>tsc;
while(tsc--){
int t,n;
cin>>t>>n;
int a=(n*... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=1e6+5;
int main() {
ll t,n;cin>>t>>n;n--;
ll need=n%t+1,start=100*(n/t)+1,last=((100+t)*(start-1)/100);
for(;need;) {
ll now=((100+t)*start/100);
if(now!=last+1) need--;
sta... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define INFF (pow(2,64))
#define def (200007)
#define MOD (1000000007)
typedef int64_t intt;
typedef vector<int> veci;
typedef ... |
#include <iostream>
#include <queue>
using namespace std;
const int DIR_X[2] = {-1, 0};
const int DIR_Y[2] = {0, -1};
int h, w;
int a[2001][2001];
pair<int,int> ans[2001][2001];
bool used[2001][2001];
void calc() {
queue<pair<int, pair<int,int>>> que;
int start = 1;
if ((w+h-2) % 2 != 0) {
star... | //#include <iostream>
//#include <vector>
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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>
using namespace std;
#define FOR(i,l,r) for(size_t i=(l); i<(r); i++)
#define REP(i,n) FOR(i,0,n)
#define endl "\n"
#define debug(x) cout<<x<<endl;
typedef long long ll;
static const ll INF = 1ll<<60;
int main(){
int N,S,D;
cin>>N>>S>>D;
vector<int> X(N),Y(N);
REP(i,N) cin>>X[... | #include <iostream>
using namespace std;
int n;
string s , t;
int a[500010] , cnt;
int main()
{
ios::sync_with_stdio(false);
cin >> n >> s >> t;
for(int i = 0; i < n; i++)
if(s[i] == '1')
a[++cnt] = i;
int temp = 1;
long long ans = 0;
for(int i = 0; i < n; i++)
if(t[i] == '1')
{
while(a[temp] < i &... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int j=6;
if(n==3)
{
cout<<"6 10 15";
return 0;
}
for(int i=0;i<n;i++)
{
cout<<j<<' ';
j++;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector <int> ans;
for(int i = 1; i <= 10000; i++)
if(i%6 == 0 || i%10 == 0 || i%15 == 0)
ans.push_back(i);
swap(ans[2] ,ans[3]);
int n;
scanf("%d",&n);
for(int i = 0; i < n; i++)
printf("%d ",ans[i]);
pri... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... | #include <bits/stdc++.h>
#define fi first
#define se second
#define lc (x << 1)
#define rc (x << 1 | 1)
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define vi vec... |
//
// Created by whq on 2021/2/21.
//
#include <bits/stdc++.h>
#define uset unordered_set
#define umap unordered_map
#define debug cout<<"ok"<<endl
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvb... | #include <bits/stdc++.h>
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 200010, mod = 1e9 + 7;
ll dp[N][20], k, num[N];
char s[N];
ll dfs(int pos, bool limit, bool lead, int cnt, ll state){
if(!pos) return cnt == k;
if(cnt > k) return 0;
if(!limit && !lead && ~dp[pos][cnt]) return dp[pos][cnt];
ll ans =... | //CODE YOUR WAY ;) -->>
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
#define Loopi for(ll i=0;i<n;i++)
#define Loopj for(ll j=0;j<m;j++)
#define LoopLR(l,r) for(ll i=l;i<=r;i++)
#define pb push_back
#define Umap unordered_map<ll,ll> M
#define Omap map<int,int> M;
#define... |
#include<bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define pi acos(-1.0)
#define mod 1000000007
#define test int t; cin>>t ;while(t--)
typedef long long ll;
using namespace std;
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
... | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int sx, sy, gx, gy;
double res, slope;
cin >> sx >> sy >> gx >> gy;
// gのy座標を反転
gy = -gy;
// グラフの傾きの逆数 * -1
slope = -(double)(sx - gx) / (double)(sy - gy);
res = (double)sx + (double)sy * slope;
cout << fixed <... |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int Solve(int n, string s)
{
string t = "";
for (int i = 0; i < n; ++i)
{
t += s[i];
if (3 <= t.size())
{
if (t.substr(t.size() - 3, 3) == "fox")
{
for (int i = 0; i < 3; ++i) t.pop_back();
... | #include <iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int a[N];
int b[N];
int c[N];
int k=0;
for(int i=0;i<N;i++)
{
cin>>a[i];
}
for(int i=0;i<N;i++)
{
cin>>b[i];
}
for(int i=0;i<N;i++)
{
c[k]=a[i]*b[i];
k++;
}
... |
#include <bits/stdc++.h>
const int N = 2010;
const int INF = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
int t;
int n, m;
char a[N][N];
long long dp[N][N];
long long pre[N][N][3]; // 0: left 1: up 2: diagonal
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", a[i] + 1);
}
dp[1... | #include <bits/stdc++.h>
using namespace std;
const int inf = numeric_limits<int> :: max() / 2;
class dsu {
private:
vector<int> par;
public:
dsu(int N) : par(N) {
iota(par.begin(), par.end(), 0);
}
int find(int x) {
return x == par[x] ? x : par[x] = find(par[x]);
}
... |
/*
More power comes with more responsibilities.
_.-;;-._.-;;
'-..-'| || |
'-..-'|_.-;;-._|
'-..-'| || |
'-..-'|_.-''-._|
*/
#define SUP ios::sync_with_stdio(0); cin.tie(0);
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i=1; i < (int)(n); i++)
#define rrep(i, n) for (int i=((int)(n)-1); i>=0; i--)
#define rreps(i, n) for (int i=((int)(n)-1); i>0; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using name... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i =0;i<n;++i)
#define reps(i,s,n) for(int i =s;i<n;++i)
using namespace std;
using P = pair<int, int>;
using ll = long long;
//0-indexed
template<class T, T (*op)(T,T), T(*e)()>
class segtree
{
private:
int n;
vector<T> v;
public:
segtree(int n_)
{
... | #include<bits/stdc++.h>
#define ll long long int
#define deb1(x) cout<<#x<<" :: "<<x<<"\n";
#define deb2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define deb3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
ll mod=1e9+7;
using namespace std;
ll a[1000000],seg[2*1000000];
ll make(... |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
struct BIT {
int N;
VI dat;
BIT(int N):N(N){
dat.r... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
template<class T> inline bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
using ll = long long;
int x;
int main () {
cin.tie(0); ios::sync_wi... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define REP(i, a, b) for (ll i = a; i <= b; i++)
#define REP_REV(i, a, b) for (ll i = a; i >= b; i--)
#define debug(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(),... |
//https://atcoder.jp/contests/abc183/tasks/abc183_d
//D - Water Heater
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+4;
long long nums[MAXN];
int main() {
#if 1
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#endif
int n,w;
cin>>n>>w;
for (int i=1; i<=n; i++) {
... | # include <bits/stdc++.h>
using namespace std;
# define fori(i,n) for(int i=0;i<n;i++)
# define forl(i,n) for (ll i=0;i<n;i++)
# define pb push_back
# define mp make_pair
# define X first
# define Y second
# define all(v) ... |
#include <bits/stdc++.h>
#define inc(l,i,r) for (int i=l;i<=r;i++)
#define dec(r,i,l) for (int i=r;i>=l;i--)
#define SIZE(V) ((int) V.size())
#define pb push_back
#define fi first
#define se second
// #define mp make_pair
#define ___ putchar(10);
#define cnt(x) __builtin_popcount(x)
#define show(x) cout << #x << " = " ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n;
ci... |
#include<bits/stdc++.h>
#define int long long
#define uc getchar()
#define ph putchar
#define R register
#define CN const
#define rint R int
#define cint CN int
#define ps ph(' ')
#define pe ph('\n')
using namespace std;
cint inf=1e9+7;
cint mix=1e6+5;
inline int in();
inline void out(rint x);
int n=in(),ans;
struct no... | #include <bits/stdc++.h>
using namespace std;
const int N = 200200;
int n, v[N*2], a[N], b[N];
priority_queue<int,vector<int>,greater<int> > Q;
int main() {
scanf("%d",&n);
for (int i=1;i<=n*2;i++) scanf("%d",v+i);
for (int i=1;i<=n;i++) {
a[i] = max(v[n+1-i],v[n+i]);
b[i] = min(v[n+1-i],... |
#include <bits/stdc++.h>
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(V) V.begin(), V.end()
#define L_B lower_bound
#define U_B upper_bound
#define pb push_back
using namespace std;
template<class T, class T1> int chkmin(T &x, const T1 &y) { return x > y ? x = y, 1 : 0; }
template<class T, class T1> in... | #include<iostream>
#include<cstdio>
#define N 110
using namespace std;
int abs(int x)
{
return x<0?-x:x;
}
char s[N];
int a[N],b[N],c[N];
int main()
{
int n,k=999999999;
scanf("%d",&n);
scanf("%s",s+1);
scanf("%d",&a[1]);
for(int i=2;i<=n+1;++i)
{
scanf("%d",a+i);
k=min(abs(a[i]-a[i-1]),k);
// printf("%d\n"... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #include <bits/stdc++.h>
using namespace std;
#define long long
#define INF 1e18
// #define lc 2*node+1
// #define rc 2*node+2
const int mod = 1e9 + 7;
const int maxN = 2e5;
int n, q;
struct Query {
int a, b, i;
};
bool cmp(Query a, Query b) {
return a.a < b.a;
}
vector<int> adj[maxN];
Query queries[maxN]... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n, q;
int temp1,temp2,temp3;
vector<int> t, a, b;
string s, front, back;
cin >> n;
cin >> s;
front = s.substr(0, n);
back = s.substr(n, n);
cin >> q;
f... | // Problem: D - Message from Aliens
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#p... |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include <iostream>
#include <vector>
//#include <string>
#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
/... |
#include <iostream>
using namespace std;
size_t f(size_t L, size_t N) // a + b = L and 1 <= a, b, <= L の組の数
{
if (L <= N + 1)
{
return (L - 1); // (1, L-1) .. (L-1, 1)
}
else if (2 * N < L)
{
return 0;
}
else
{
return (2 * N - L + 1); // (L-N, N) .. (N, ... | #include <algorithm>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <string>
#include <vector>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S == "Y") {
for_each(T.begin(), T.end(), [](char& c) { c = toupper(c); });
cout << T << endl;
} else {
cout << T << en... |
#include <iostream>
#include <vector>
#include <unordered_set>
#include <utility>
using namespace std;
int main() {
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<bool> light(h * w, false), block(h * w, false);
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
light.at(a * w ... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int n;
int p[200005];
vector<int> adj[200005];
int q;
pair<pair<int,int>,int> qq[200005];
int dep[200005];
bool vis[200005];
map<int,int> cnt[200005];
int ans[200005];
int dfs(int u) {
if (dep[u] != 0) return dep[u];
else ret... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ll long long
#define dbwt(x) std::cout... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <math.h>
#include <sstream>
#include <iomanip>
#include <numeric>
#define REP(i, n, s) for (int i = (s); i < (int)(n); i++)
#define REP0(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
#define ll long long
#define ALL(a) (a).... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll x, y, a, b;
int main()
{
ll ans = 0;
cin>>x>>y>>a>>b;
while (1) {
if ((1.0 * a - 1) >= (1.0 * b / x))break;
x = a * x;
if (x >= y)break;
ans ++;
}
ll cnt = max((ll)0, (y - x - 1)) / b;
printf("%lld\n", ans + cnt);
return 0;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #define _USE_MA_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#inc... |
//#pragma GCC target("avx2")
//#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
type... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <sstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define F first
#define S second
#define pb push_back
#define ld long double
#define pll pair<long lon... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
int arr[n];
int j = 0;
for(int i=0; i<2*n; i++)
{
cin >> s[j] >> arr[j];
j++;
}
int maxi = arr[0];
int m;
for(int i=0; i<n; i++)
{
if(arr[i] >= maxi)
{
m = i;
maxi = ar... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <functional>
#include <set>
#include <math.h>
#include <iomanip>
// int max: 2 x 10^9, long long max: 9 x 10^18
using namespace std;
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < n; ++i)
void Main(){
ll n;
cin >> n;
set<ll> ve;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vecto... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
#define mod 1000000007
#define INF 1e18
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pll pair<ll,ll>
#define plll pair<ll,pair<ll,ll>>
// pb,mp,F,S,MOD,INF should not be used as vari... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define out(x) cout << x << '\n'
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define ... | #include<bits/stdc++.h>
#define rep(i,a,b) for(register int i=a;i<=b;i++)
#define req(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
int n,m,l[200010],r[200010];
int main()
{
cin>>n>>m;
if (m==0)
{
rep(i,1,n) printf("%d %d\n",i*3-2,i*3-1);
return 0;
}
if (n-abs(m)<2||m<0) return printf("-1\n"),0;
... |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n;
ll sol... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD_17 = 1e9 + 7;
const int INF = 1e9 + 1001010;
const double PI = 3.14159265358979;
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
int main(){
int n; string s; cin >> n >> s;
int q; cin... |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include <bits/stdc++.h>
using namespace std;
const int kN = 1e5 + 10;
int n;
vector<int> g[kN];
int a[kN], cnt[kN];
vector<int> ans;
void Dfs(int u, int fa = 0) {
if(!cnt[a[u]]) ans.push_back(u);
cnt[a[u]]++;
for(int v : g[u]) if(v != fa) Dfs(v, u);
cnt[a[u]]--;
}
int main() {
scanf("%d", &n);
for(int i ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define imie(x) cerr << #x << " = " << x << '\n';
#else
#define imie(x)
#endif
void debug(vector<int> v) {
cerr << "[";
int n = (int)v.size();
for(int i = 0; i < n; i++) {
cerr << v[i] << (i == n-1 ? "" : ", ")... | #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 pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll X,Y,ans,LCM;
ll x,y,p,q,i,j;
void Gcd(ll A,ll B,ll &gcd)
{
if(B){Gcd(B,A%B,gcd);ll t=X;X=Y;Y=t-(A/B)*Y;}
else {gcd=A;X=1,Y=0;}
}
ll f(ll a,ll b,ll mod)
{
ll k=0;
while(b)
{
if(b&1) k=(k+a)%mod;
a=(a+a)%mod;
b... | #include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_Y... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#de... |
#include <iostream>
using namespace std;
int main()
{
int x, y;
bool m[3] = { 0, 0, 0 };
cin >> x >> y;
m[x] = m[y] = true;
if(x == y) cout << x << '\n';
else {
for(int i = 0; i < 3; ++i) {
if(!m[i]) {
cout << i << '\n';
break;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int T;
cin >> T;
rep(i, T){
long long N;
cin >> N;
if (N%2 == 0){
if (N%4 == 0) cout << "Even" << endl;
else cout << "Same" << endl;
}
else cout << "Odd" << endl;
}
} |
#include <bits/stdc++.h>
#define int unsigned long long
using namespace std;
int x, y, a, b;
signed main() {
cin >> x >> y >> a >> b;
int cnt = 0;
while(x < y) {
if(x*a - x < b) x = x*a, cnt++;
else {
int k = (y-x)/b;
cnt += k;
x += k*b;
if(x < y) { x += b; cnt++; }
break;
}
}
cout << cnt-... | #include<bits/stdc++.h>
using namespace std;
/***typededfs***/
typedef long long ll;
typedef long double ldb;
/***defines***/
#define M1 1000000007
#define M2 998244353
#define F first
#define S second
#define pb push_back
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define forz(i,n... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,counter=0;
cin >> H >> W;
vector<string> S(H);
for(int i=0;i<H;i++){
cin >> S[i];
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(j != W-1){
if(S[i].at(j) == '.' && S[i].at(j+1) == ... | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr int MAX = 1510;
int board[MAX][MAX]; //+1:light bulb, 0:normal cell -1:block
bool rl[MAX][MAX], rr[MAX][MAX], cl[MAX][MAX], cr[M... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
const int maxn=2e5+10;
struct Node{
int x;
int y;
friend bool operator < (const Node &a,const Node &b){
return a.x<b.x;
}
}a[maxn];
vector<int> ve[maxn];
vector<int> bj[maxn];
map<int,int> mp;
int main(){
int n,k;
scanf... |
#include<bits/stdc++.h>
#define input freopen("input.txt", "r", stdin)
#define output freopen("output.txt", "w", stdout)
#define sc(a) scanf("%lld",&a)
#define pr(a) printf("%lld\n",a)
#define ll long long
#define vll vector<ll>
#define pb push_back
#define srt(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.be... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s, ans = "Yes";
cin >> s;
for (int i = 0; i < s.size(); i++)
{
if (i % 2 == 0)
{
if (s.at(i) <= 'Z')
ans = "No";
}
else
{
if (s.at(i) > 'Z')
ans = "No";
}
}
cout << ans << endl;
} |
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define fo(i,n) for(int i... | // author : lynmisakura
// Last Modified: 2020-10-04T12:59:37
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0;i < n;i++)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define dup(x,y) (x + y - 1) / (y)
#define all(x) (x).begin(),(x).end()
template<class T> bool chmax(T... |
#include <iostream>
#include <iomanip>
#include<vector>
#include <algorithm>
#include <queue>
#include<string>
#include <map>
#include <cmath>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <utility>
#include <set>
#include <bitset>
typedef long long ll;
typedef long double ld;
#define PI ... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
using namespace std;
const int mo=1e9+7;
template<typename _T>
void read(_T &x){
_T f=1;x=0;char s=getchar();
while('0'>s||s>'9'){if(s=='-')f=-1;s=getchar();}
while('0'<=s&&s<='9'... |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<string> f(int n){
if(n == 1) return vector<string>{"AB"};
vector<string> ans = f(n - 1);
int sz = ans.size();
for(int t = 0; t < sz; ++t){
ans[t] = ans[t] + ans[t];
string s = ans[t];
int siz = s.size... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head;... |
#include <bits/stdc++.h>
#include <unordered_set>
#define f(i, a, b) for (int i = a; i < b; i++)
#define rf(i, a, b) for (int i = a; i > b; i--)
#define lf(i, a, b) for (long long i = a; i < b; i++)
#define sq(a) (a)*(a)
#define cube(a) (a)*(a)*(a)
#define pb push_back
#define ppb pop_back
#define LB lower_bound
#defi... | //
// _oo0oo_
// o8888888o
// 88" . "88
// (| -_- |)
// 0\ = /0
// ___/`---'\___
// .' \\| |// '.
// / \\||| : |||// \
// / _||||| -:- ||||... |
#include <set>
#include <cstdio>
using namespace std;
#define maxn 200005
#define int long long
set < pair < int, int > > st;
set < pair < int, int > > :: iterator it;
int n;
int t[maxn];
int lowbit( int x ) {
return x & ( -x );
}
void add( int x, int val ) {
for( int i = x;i <= n;i += lowbit( i ) ) t[i] += val;
}
... | #include <bits/stdc++.h>
typedef long long i64;
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using namespace std;
const int xn = 2e5;
int n, a[xn], b[xn], p[xn], c[xn];
map<int, queue<i... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+3;
int num[N];
vector<pair<int,int> > adj[N];
void dfs(int u, int p){
for(auto it : adj[u]){
if(num[it.first] != -1){
continue;
}
if(num[u] == it.second){
num[it.first] = (it.second == 1 ? 2 : 1);
}else{
num[it.first] = it.second;
}
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int n, m;
cin >> n >> m;
vector< int > a(m+1), b(m+1), c(n+1), dir(m+1, 0);
for(int i=1;i<=m;i++) cin >> a[i] >> b[i];
for(int i=1;i<=n;i++) cin >> c[i];
for(int i=1;i<=m;i++){
if(c[a[i]] > c... |
#include <iostream>
using namespace std;
int n ;
int main()
{
cin >> n;
if (n%2==0) {
cout << "White" << endl;
} else {
cout << "Black" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define sz(x) (int)(x).size()
#define dup(x,y) ((x+y-1)/y)
#define dame0 { puts("0"); return 0;}
#define dame1 { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define outa cout << ans << endl
#define out(x) c... |
/**
* AtCoder Beginner Contest
**/
// >>> ngng628's library
// >>> includes
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <unordered_ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<int> v;
for(int i = 0;i < N;i++){
int a;cin >> a;
v.push_back(a);
}
int ma = 0;
int ans = -1;
for(int i = 2;i <= 1000;i++){
int cnt = 0;
for(auto a ... |
#include<bits/stdc++.h>
#define rei register int
#define pb push_back
using namespace std;
const int maxn = 100010;
int n;
int dp[maxn],g[maxn],sz[maxn];
vector<int>ver[maxn];
void dfs(int x){ g[x] = sz[x] = 1; int cnt = 0;
for(rei i = 0;i < ver[x].size();++i) dfs(ver[x][i]);
for(rei i = 0;i < ver[x].size();++i) cnt... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> a(10010);
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
int x = a[i];
for (int j = i; j < n; j++) {
x = min(x, a[j]);
ans = max(ans, x * (j - i + 1));
... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll h[100005],s[5000005],w[5000005];
int n,p;
int main()
{
while (scanf ("%d",&n)!=EOF)
{
if (n==0) return 0;
memset(h,0,sizeof(h));
memset(s,0,sizeof(h));
for (int i=1;i<=n;i++)
... |
#include <stdio.h>
int main()
{
int n;
scanf("%d", &n);
if (n*108/100 > 206)
{
printf(":(");
}
else if (n*108/100 == 206){
printf("so-so");
}
else printf("Yay!");
return 0;
} | #include <bits/stdc++.h>
int main(){
int n;
scanf("%d",&n);
printf("%d",n-1);
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... | #include <bits/stdc++.h>
using namespace std;
int si,sj,mx = 0;
int t[55][55],p[55][55];
int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
bool used[2505];
string base = "RDLU";
string fans = "";
void input() {
cin >> si >> sj;
for(int i = 0; i < 50; i++) {
for(int j = 0; j < 50; j++) {
cin ... |
#include<bits/stdc++.h>
#define endl ("\n")
#define int long long
#define read(a,n) rep(i,0,n){cin>>a[i];}
#define print(a,n) rep(i,0,n) cout<<a[i]<<" ";
#define yy cout<<"Yes"<<endl;
#define nn cout<<"No"<<endl;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define ff first
#define ss second
#define mod 1000000007
u... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(v) v.begin(), v.end()
using P = pair<int,int>;
constexpr int inf = numeric_limits<int>::max() / 2;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n, m; cin >> n >> m;
vector<int> w(n); rep(i,n) cin >> w[i];
ve... |
// #pragma GCC optimize(2)
// #pragma GCC optimize(3)
// #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#... | //#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
using namespace std ;
#define int int64_t //be careful about this
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int... |
#include <bits/stdc++.h>
using namespace std;
struct SegmentTree{
int N;
vector<int> tree;
SegmentTree(vector<int>& v) {
int sz = v.size();
N = 1;
while(N < sz) N *= 2;
tree = vector<int>(2 * N, 0);
for(int i = 0;i < sz;++i) tree[N + i] = v[i];
}
void update(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
const int maxn=200000+10;
ll tree[maxn],n,a[maxn],b[maxn],c[maxn];
int lowbit(int i) {return i&-i;}
ll ask(int x)
{
int res=0;
for(int i=x;i;i-= lowbit(i)) res+=tree[i];
return res;
}
void modify(int x,int val)
{
... |
#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define per(i,a,b) for(register int i=(a);i>=(b);i--)
using namespace std;
const int N=59;
inline long long read() {
register long long x=0, f=1; register char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1; ... | #include <bits/stdc++.h>
using namespace std;
clock_t start=clock();
int main()
{
int N,M;
cin>>N>>M;
vector<string> s(M);
string answer[N][N];
for(int i=0;i<M;i++) cin>>s[i];
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
answer[i][j]=".";
}
}
int num=0;
for(int i=0;i<N;i++){
for(int j... |
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
typedef long long ll;
const ll maxn = 1e3 + 10;
ll n, i, j, k, a, b;
ll vis[maxn];
ll ans[maxn];
ll cnt = 0;
ll arr[maxn];
int main() {
scanf("%lld", &n);
i = 0;
b = 0;
while (n) {... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <string>
#include <list>
using namespace std;
long long min(long long int a,long long int b){
if(a>b){
return b;
}else{
return a;
}
}
l... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 998244353
int binary_expo(int a,int b)
{
int res=1;
while(b>0)
{
if(b&1>0)
{
res=(((res%M)*(a%M))%M);
}
b=b>>1;
a=(((a%M)*(a%M))%M);
}
return res;
}
int inv(int a,int b)
... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <tuple>
#define ll long long
#define MAX 1000000007
#define mod % 998244353
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
vector<ll> beki;
int main(){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
int main() {
ll n; int k;
std::cin >> n >> k;
for (int i=0; i<k; i++) {
std::string ns = std::to_string(n... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | //g++ 7.4.0
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAXN 1005
vector<pair<ll,char>> adj[MAXN];
map<pair<ll,ll>,ll> vis;
map<pair<ll,ll>,ll> edge;
map<pair<ll,ll>,ll> dis;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N,M; cin... |
#include"bits/stdc++.h"
using namespace std;
#define int long long
int n,m,c[21];
vector<int> g[21];
int dfs(int cur){
if(cur==n+1)return 1;
if(g[cur].empty())return dfs(cur+1)*3;
int ret=0;
for(int i=1;i<=3;i++){
int d=0;
for(int v:g[cur]){
if(c[v]==i){d=1;break;}
}
if(d)continue;
c[cur]=i;
ret+=dfs... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=105;
int a[maxn][maxn];
int b[maxn][maxn];
int cn[maxn];
bool used[maxn];
int cnt;
void dfs(int x)
{
++cnt;
used[x]=true;
for(int i=0;i<maxn;++i)
{
if(b[x][i] && !used[i])
{
dfs(i);
}
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include "bits/stdc++.h"
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define FI first
#define SE second
#define maxn 100000
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define ll long long
#define ar array
const ll mxN=2e5;
const int mod=1e9+7;
const ll INF=1e18;
#define what_is(x) cerr << #x << " is " << x << endl;
ll a,b,n,k,m,x,y,h,l,r,t;
void solve(){
cin>>n;
string s[n];
map<string,int> mp;
for(int i... |
#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define int long long
int read(){
int w=0,f=1;
char c=' ';
while(c<'0'||c>'9')c=getchar(),f=c=='-'?-1:f;
while(c>='0'&&c<='9')w=w*10+c-48,c=getchar();
return w*f;
}
int n,a[N];
bool vis[N];
signed main(){
n=read();
a[1]=1;
for(int i=2;i<=n;i++){
vi... | #include <bits/stdc++.h>
#include <cmath>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<long long,long long>;
//ll INF = 1e18;
//int INF = 1e9;
//printf("%.10f\n",ans);
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
... |
// Atcoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<itera... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#defin... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a = (i * 2 + 0) % n;
int b = (i * 2 + 1) % n;
... | #include<bits/stdc++.h>
using namespace std;
#define fastio() ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define ll long long int
#define loop(i,k,n) for(i=k; i<n; i++)
#define rloop(i,n,k) for(i = n-1; i >= k; i--)
#define trv(x,a) for(auto& x:a)
#define all(x) x.begin(),x.end()
#define between(v,x,y) v.begi... |
//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define all(v) v.begin(),v.end()
#define ff first
#define s... | #include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
constexpr int inf = 1<<28;
constexpr char newl = '\n';
template<class T>std::istream&operator>>(std::istream... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
const ll N = 100000000;
string S[3];
string T;
ll mp[N];
ll g(string S){
ll ret = 0;
for(int i = 0; i<S.size(); i++){
ret*=10;
ret+=mp[S[i]];
}
return ret;
}
bool f(vector<int> v){
for(int i = 0; i<T.size(); i++){
... | #include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
int main(){
string S1,S2,S3; cin>>S1>>S2>>S3;
set<char> se;
for(auto c:S1) se.insert(c);
for(auto c:S2) se.insert(c);
for(auto c:S3) se.insert(c);
if (se.size() > 10){
... |
#include<cstdio>
#include<iostream>
int n,bj,q;
char c[400005];
int read()
{
int s=0;
char c=getchar();
while(c<'0'||c>'9') c=getchar();
while(c>='0'&&c<='9') s=s*10+c-'0',c=getchar();
return s;
}
int main()
{
scanf("%d",&n);
getchar();
for(int i=1;i<=2*n;i++)
c[i]=getchar();
scanf("%d",&q);
for(int i=1,az,x... | #include <iostream>
#include <climits>
#include <cmath>
using namespace std;
int main(){
int n;
cin>>n;
char s[2*n];
cin>>s;
int q;
cin>>q;
int count=0;
for(int i=0;i<q;i++){
int t,a,b;
cin>>t>>a>>b;
if(t==1){
a--;
b--;
if(count%2!=0){
if(a>=n && b>=n){
swap(s[a-n]... |
#include <bits/stdc++.h>
using namespace std;
#define dbg(v) cout << __LINE__ << ": " << #v << " = " << v << endl
const int N = 2e3 + 5;
const int M = 1e9 + 7;
char str[N];
int add (int a, int b) {
return (a + b < M) ? (a + b) : (a + b - M);
}
int main() {
int h, w;
scanf("%d %d", &h, &w);
vector <... | #include <bits/stdc++.h>
using namespace std;
#define flush cout.flush
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll, ll>;
const ll INF = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-9;
const ld PI = acos(-1);
int main() {
ios::... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std::chrono;
using namespace std;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define loo... | #include <iostream>
using namespace std;
int n ;
struct pr
{
int x, y ;
}
v[100005];
int main()
{
int s = 0 ;
cin >> n ;
for (int i = 1 ; i <= n ; i ++)
cin >> v[i].x ;
for (int i = 1 ; i <= n ; i ++)
cin >> v[i].y ;
for (int i = 1 ; i <= n ; i ++)
s = s + (v[i... |
#include <bits/stdc++.h>
using namespace std;using ll=long long;
using vl=vector<ll>;using vi=vector<int>;
using vs=vector<string>;using vc=vector<char>;
using vvl=vector<vl>;using pl=pair<ll,ll>;
using vvc=vector<vc>;using vd=vector<double>;
using vpl=vector<pl>;using vb=vector<bool>;
#define rep(i,r) for(ll i=0;i<(r)... | #include <bits/stdc++.h>
using namespace std;
//#define MULTITEST
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i ... |
#include<bits/stdc++.h>
#define ll long long
using namespace std ;
int main()
{
ll n , i , j ; cin>>n ;
ll a[n] ;
for(i=0;i<n;i++){
cin>> a[i] ;
}
ll stt=0 , st=0 , s=0 ;
for(i=0;i<n;i++){
stt+= i*a[i]*a[i] - 2*s* a[i]+st ;
s+=a[i] ;
st+= a[i]*a[i] ;
}
co... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e5+3;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
template <typename T>
... |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#de... | #include<bits/stdc++.h>
//#include <atcoder/all>
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())
using namespace std;
//using namespace atc... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200010, mod = 1000000007;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
struct Seg{
int tot,s[maxn*1... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define inf 1e17
vector<vector<int>> grid;
int n, m;
int dp[2005][2005];
int helper(int r, int c){
if(r == n-1 && c == m-1)
retur... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define INF 1000000000000000000
#define pb push_back
#define vl vector<ll>
#define vi vector<int>
#define sz(a) (ll)a.size()
#define all(v) v.begin(), v.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch()... | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline ll read()
{
ll f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
ll C[100][100];
int mai... |
#include <bits/stdc++.h>
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rrepi(i,a,b) for(int i=((int)(b)-1);i>=(a);--i)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) rrepi(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(x) memset(x,0,sizeof(x))
#define MINUS(x) ... | #include<bits/stdc++.h>
using namespace std;
const int N = 100005;
const int K = 20;
int n, m, k, a[K], dis[K][N], dp[K][1 << K];
vector<int> adj[N];
void bfs(int idx)
{
queue<int> q;
q.push(a[idx]);
for (int i = 1; i <= n; ++i)
dis[idx][i] = -1;
dis[idx][a[idx]] = 0;
while (!q.empty())
... |
// #Sazaの1日1AC
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
const long long INF=9e18;
const double PI=3.14159265358979323846;
//マクロ
//型エイリアス
using ll = long long;
using P=pair<long long, long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long lo... | #pragma GCC optimize("Ofast")
/*#pragma GCC target("avx,avx2,fma")
#pragma GCC target ("sse4")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std:... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.