code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int n;
cin >> n;
string a, b;
cin >> a >> b;
for (int i = 0; i < n; i++) {
int f = 0;
for (int j = 0; i + j < n; j++) {
if (a[j + i] != b[j]) {
f = 1;
break;
}
}
if (!f) {
cout << n + i << '\n';
return;
}
}
cout << n + n << '\n';
}
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
string s;
cin >> s;
string t;
cin >> t;
int max_length = 0;
for (int i = 1; i <= N; i++){
if (s.substr(N - i, i) == t.substr(0, i)) max_length = i;
}
cout << 2 * N - max_length << endl;
}
| 1 |
// J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
string s, t;
cin >> s >> t;
cout << t << s << '\n';
}
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #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()
{
string s, t;
cin >> s >> t;
cout << t+s << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
using lint = long long;
template <class T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
bool solve(int N, std::vector<lint>& A) {
lint sum = std::accumulate(A.begin(), A.end(), 0LL);
// Nが偶数の場合、和の偶奇がそのまま勝敗になる
if (N % 2 == 0) return sum % 2 != 0;
// Nが奇数の場合も、和が偶数なら絶対勝てる
if (sum % 2 == 0) return true;
// 奇数を前に持っていく
std::sort(A.begin(), A.end(), [](int a, int b) { return a % 2 > b % 2; });
// 奇数が複数個ある、あるいは唯一の奇数が1(減らせない)なら負け
if (A[0] == 1 || (A[1] & 1) != 0) return false;
// そうでなければ、唯一の奇数を減らしてシミュレート
--A[0];
int g = accumulate(A.begin(), A.end(), 0LL, gcd<lint>); // 全体のgcdを取る
for (auto& a : A) a /= g;
return !solve(N, A);
}
int main() {
int N;
std::cin >> N;
std::vector<lint> A(N);
for (auto& a : A) std::cin >> a;
std::cout << (solve(N, A) ? "First" : "Second") << std::endl;
return 0;
}
| #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const long long MAXN=100005;
long long n;
long long a[MAXN];
long long gcd(long long a,long long b)
{
return b==0?a:gcd(b,a%b);
}
void pr(long long x)
{
if(x==1)
printf("First\n");
else
printf("Second\n");
exit(0);
}
void dfs(long long x)
{
long long s=0;
for(long long i=1;i<=n;i++)
s+=a[i]-1;
if(s&1)
pr(x^1);
long long cnt=0;
for(long long i=1;i<=n;i++)
if(a[i]&1)
cnt++;
for(long long i=1;i<=n;i++)
if(a[i]==1)
cnt=903;
if(cnt!=1)
pr(x);
for(long long i=1;i<=n;i++)
if(a[i]&1)
{
a[i]--;
break;
}
long long G=0;
for(long long i=1;i<=n;i++)
G=gcd(G,a[i]);
for(long long i=1;i<=n;i++)
a[i]/=G;
dfs(x^1);
}
int main()
{
scanf("%lld",&n);
for(long long i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
dfs(0);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
// vector<vector<uint64_t> > v(n+1, vector<uint64_t>(n+1, 0))
// v[n][k]に組み合わせ数が入る。
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
// 掛け算オーバーフロー判定
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
//素因数分解
void primeFactorization(uint64_t a, list<uint64_t> &factors){ //素因数分解を出力するプログラム
long i,sq;
if(a%2==0){ //偶数の場合
factors.push_back(2);
primeFactorization(a/2,factors); //2で割った値で再帰
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){ //3以上√a以下の奇数の場合
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors); //割れた値で再帰
return;
}
}
//偶数でも3以上√a以下の奇数の場合でも割り切れない場合
if(a!=1){ //aが1でないなら、a自身は素数
factors.push_back(a);
}
}
// フェルマーの小定理
// mod. m での a の逆元 a^{-1} を計算する
// (a/b)%m = a*movinv(b,m)%m
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
/*
//エラトステネスのふるい
int maxNum = 100000;
char isNotPrime[maxNum+1] = {};
isNotPrime[0]=isNotPrime[1]=1;
for(int i=2;i<maxNum;i++){
if(isNotPrime[i]==1) continue;
int num = i+i;
while(num<=maxNum){
isNotPrime[num]=1;
num += i;
}
}
*/
// 円周率
// M_PI
// #include <iomanip> // setprecisionを使用するのに必要
// cout << std::fixed << std::setprecision(15) << y << endl;
// 昇順
// priority_queue<int, vector<int>, greater<int> > queue;
// 降順ソート vector<int> v;
// sort(v.begin(),v.end(),greater<int>());
signed main() {
string s;
cin >> s;
int op = 0;
for(int i=0;i<=7;i++){
string equStr = "";
equStr += s[0];
int ans = s[0]-'0';
for(int j=0;j<3;j++){
if((i>>j)%2==0){
equStr += "+";
ans += s[j+1]-'0';
}
else{
equStr += "-";
ans -= s[j+1]-'0';
}
equStr += s[j+1];
}
if(ans==7){
cout << equStr << "=7" << endl;
return 0;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
bool prime[10001];
memset(prime,0,sizeof(prime));
for(int i=2;i<sqrt(10001);i++){
if(!prime[i])for(int j=i*2;j<10005;j+=i)prime[j]=1;
}
int n;
while(cin>>n,n){
for(int i=n;i>2;i--){
if(!prime[i]&&!prime[i-2]){
cout<<i-2<<" "<<i<<endl;
break;
}
}
}
} | 0 |
#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 dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
rep(i, h) rep(j, w) cin >> a[i][j];
vector<vector<int>> d(h, vector<int>(w, -1));
queue<P> que;
rep(i, h) rep(j, w) {
if (a[i][j] == '.') continue;
d[i][j] = 0;
que.push(make_pair(i, j));
}
while (que.size()) {
P p = que.front();
que.pop();
rep(i, 4) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
if (d[nx][ny] != -1) continue;
d[nx][ny] = d[p.first][p.second] + 1;
que.push(make_pair(nx, ny));
}
}
int ans = 0;
rep(i, h) rep(j, w) ans = max(ans, d[i][j]);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep01(i, n) for(int i = 0; i < (n) + 1; i++)
#define rep10(i, n) for(int i = 1; i < (n); i++)
#define rep11(i, n) for(int i = 1; i < (n) + 1; i++)
#define all(a) (a).begin(), (a).end()
typedef long long int ll;
typedef struct { int x; int y; } Pos;
using namespace std;
const int dx[] = { 1,-1,0,0 }, dy[] = { 0,0,1,-1 };
int time_ = 0;
int H, W;
bool cont = false;
vector<vector<char>> a;
queue<Pos> remq;
queue<Pos> nxtq;
int main() {
cin >> H >> W;
a = vector<vector<char>>(W + 1, vector<char>(H + 1));
rep11(y, H) rep11(x, W) {
cin >> a[x][y];
if (a[x][y] == '#') nxtq.push(Pos{ x, y });
}
while (0 < nxtq.size()) {
remq = queue<Pos>(nxtq);
nxtq = queue<Pos>();
cont = false;
while (0 < remq.size()) {
Pos ref = remq.front();
remq.pop();
rep(i, 4) {
Pos chk = Pos{ ref.x + dx[i], ref.y + dy[i] };
if (chk.x <= 0 || chk.x > W || chk.y <= 0 || chk.y > H) continue;
if (a[chk.x][chk.y] == '.') {
a[chk.x][chk.y] = '#';
nxtq.push(Pos{ chk.x, chk.y });
cont = true;
}
}
}
if (cont) time_++;
}
cout << time_ << endl;
return 0;
} | 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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll,ll>>
#define pll pair<ll,ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout<<setprecision(x)<<fixed;
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
// getline (std::cin,name);
ll MOD=1e9+7;
ll ceil1(ll n,ll x){return (n-1)/x+(n>0);}
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll m ,ll mod=MOD );
ll pow2(ll n,ll k);
ll modinv(ll n,ll mod=MOD){ return pow1(n,mod-2,mod);}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
if(a.ff != b.ff)return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N=(ll)2e5+11;
ll const LG=(ll)log2(N)+1;
void solve(){
ll i,j,k,l,n,m,x,y,z,r;
vll a(5);
n=5;
cin>>m;
ll tt=1e15;
for(i=0;i<5;i++){
cin>>a[i];
tt=min(tt,a[i]);
}
ll ans=0;
for(i=n-1;i>=0;i--){
if(a[i]==tt){
ans=ceil1(m,tt);
ans+=n-1;
}
}
cout<<ans<<endl;
}
int main(){
FS;
ll i,j,k,n,m,x,y,z,q;
q=1;
// cin>>q;
for(ll tc=1;tc<=q;tc++){
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n,ll m,ll mod){
if(m==0)return 1;
if(m%2==0)return pow1((n*n)%mod,m/2,mod);
return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}
ll pow2(ll n,ll k){
ll ans=1;
while(k>0){
if(k%2==1)ans=ans*n;
n=n*n;
k/=2;
}
return ans;
}
| #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> vec(5);
rep(i,5) cin >> vec.at(i);
sort(vec.begin(),vec.end());
ll ans = 0;
if (n % vec.at(0) > 0) ans++;
ans += n / vec.at(0) + 4;
cout << ans << endl;
}
| 1 |
#include<bits/stdc++.h>
typedef long long ll;
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
//
//
#define int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
case '4': return 4;
case '5': return 5;
case '6': return 6;
case '7': return 7;
case '8': return 8;
case '9': return 9;
default: return 0;
}
}
ll a,b,c,s,t,x,y,z;
ll A,B,C,S,T,X,Y,Z;
ll cnt;
long double pi=3.14159265358979323846;
string N,M;
unsigned long long D;
signed main(){
cin>>a;
vector<int> f(a);
REP(i,a) cin>>f[i];
for(x=0;x<a-2;x++){
for(y=x+1;y<a-1;y++){
for(z=y+1;z<a;z++) {
if(f[x]>f[y] && f[x]>f[z] && f[x]-f[y]-f[z]<0 && f[y]!=f[z]) cnt++;
else if(f[y]>f[x] && f[y]>f[z] && f[y]-f[x]-f[z]<0 && f[x]!=f[z]) cnt++;
else if(f[z]>f[y] && f[z]>f[x] && f[z]-f[y]-f[x]<0 && f[x]!=f[y]) cnt++;
}
}
}
cout<<cnt;
return 0;
}
| #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)
using namespace std;
static const ll INF = 1e15;
const ll mod = 1000000007;
int main() {
ll n;
cin >> n;
vector<vector<ll>> scores(n, vector<ll>(n));
rep(i, n) {
rep(j, n) {
cin >> scores[i][j];
}
}
vector<ll> dp(1LL << n, 0);
rep(i, 1LL << n) {
ll add = 0;
for (ll j = 0; j < n; j++) {
for (ll k = 0; k < j; k++) {
if (i & (1LL << j)) {
if (i & (1LL << k)) {
dp[i] += scores[j][k];
}
}
}
}
}
for (ll i = 0; i < 1LL << n;i++) {
ll u = dp[i];
for (ll j = i; j > 0; j = ((j-1) & i)) {
u = max(u, dp[j] + dp[(i ^ j)]);
}
dp[i] = u;
}
cout << dp[(1LL << n) - 1] << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C; cin >> A >> B >> C;
int a,b,c;
a = A.size();
b = B.size();
c = C.size();
char s,t,u,v;
s = A.at(a-1);
t = B.at(0);
u = B.at(b-1);
v = C.at(0);
if (s == t && v == u){
cout << "YES";
}
else cout << "NO";
} | #include <iostream>
#include <numeric>
using namespace std;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
int main() {
int N, K, M{}, D{}, A;
cin >> N >> K;
while (cin >> A) {
M = max(M, A);
if (D) D = gcd(D, A);
else D = A;
}
cout << (K <= M && (M - K) % D == 0 ? YES : NO) << endl;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << endl << endl;}
#define SHOW2d(v,i,j) {for(int a = 0;a < i;a++){for(int b = 0;b < j;b++)cout << v[a][b] << ' ';cout << endl;}cout << endl;}
#define ALL(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;
char f(char c,int n)
{
// cout << c << ' ';
REP(i,n)
{
if(c == 'a')
c = 'Z';
else if(c == 'A')
c = 'z';
else
c--;
}
// cout << c << endl;
return c;
}
int main()
{
int n;
while(cin >> n,n)
{
iv v;
REP(i,n)
{
int tmp;
cin >> tmp;
v.PB(tmp);
}
string str;
cin >> str;
REP(i,str.size())
{
str[i] = f(str[i],v[i%n]);
}
cout << str << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define maxn 1000100
#define mod 1000000007
using namespace std;
char a[maxn];
int n,q,k;
ll ans=0;
void sol(){
ans=0;
ll d=0,dm=0,m=0;
for(int i=0;i<n;i++){
if(i>=k){
if(a[i-k]=='D'){
dm-=m;
d--;
}
if(a[i-k]=='M') m--;
}
if(a[i]=='C') ans+=dm;
if(a[i]=='D') d++;
if(a[i]=='M') dm+=d,m++;
}
}
int main(){
scanf("%d",&n);
scanf("%s",a);
scanf("%d",&q);
while(q--){
scanf("%d",&k);
sol();
printf("%lld\n",ans);
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i<n; i++){
cin >> a[i];
}
for (int i = n-1; i>=1; i--){
cout << a[i] << " ";
}
cout <<a[0]<< endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int c;
cin >> c;
int *a = new int[c];
for (int cc = 0; cc < c; cc++) {
cin >> a[cc];
}
string str;
for (int cc = c - 1; cc >= 0; cc--) {
str += to_string(a[cc]) + " ";
}
str.erase(str.length() - 1);
cout << str << endl;
} | 1 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <stack>
#include <ctype.h>
#include <numeric>
#include <sstream>
#include <unistd.h>
#include <unordered_map>
#include <unordered_set>
#include <limits>
#include <random>
#include <chrono>
#include <iomanip>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
#define endl '\n'
#define debug(name) DEBUG(#name, (name))
template<typename T>
void DEBUG(string label, T value) {
cerr << "[" << label << " = " << value << "]\n";
}
void solve(){
int n;
cin >> n;
ll ans = (n/500) * 1000 + (n % 500) - n % 5;
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t;
t = 1;
/*cin >> t;*/
while(t--){
solve();
}
}
| #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace std;
int main()
{
int x;
cin >> x;
int ans = 0;
while (x > 4)
{
if (x - 500 >= 0)
{
x -= 500;
ans += 1000;
}
else
{
if (x - 5 >= 0)
{
x -= 5;
ans += 5;
}
}
}
cout << ans;
} | 1 |
//
// main.cpp
// Atcoder1
//
// Created by Hamske on 2020/09/17.
// Copyright © 2020 Author. All rights reserved.
//
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
//#define pb push_back
//#define mp make_pair
//
//#define F first
//#define S second
typedef long long ll;
#define rept(_i,iv,n,type) for(type _i=(type)(iv);_i<(type)(n);++_i)
//#define repi(_i,iv,n) rept(_i,iv,n,int)
//#define repl(_i,iv,n) rept(_i,iv,n,ll)
#define rept0(_i,n,type) rept(_i,0,n,type)
#define repi0(_i,n) rept(_i,0,n,int)
#define repl0(_i,n) rept(_i,0,n,ll)
//#define repst(_i,iv,n,type) for(type _i=iv;_i<=(type)(n);++_i)
//#define repsi1(_i,n) repst(_i,1,n,int)
#define REPT(_i,iv,_l,n,type) for(type _i=(type)(iv),_l=(type)(n);_i<_l;++_i)
//#define REPI(_i,iv,_l,n) REPT(_i,iv,_l,n,int)
//#define REPL(_i,iv,_l,n) REPT(_i,iv,_l,n,ll)
//
#define REPT0(_i,_l,n,type) REPT(_i,0,_l,n,type)
#define REPI0(_i,_l,n) REPT(_i,0,_l,n,int)
#define REPL0(_i,_l,n) REPT(_i,0,_l,n,ll)
//#define rrept(_i,x,e,type) for(type _i=((type)(x)-1);_i>=e;--_i)
//
//#define rrept0(_i,x,type) rrept(_i,x,0,type)
//
//#define RREPT(_i,x,_e,e,type) for(type _i=((type)(x)-1),_e=(type)(e);_i>=_e;--_i)
//
//#define RREPT0(_i,x,_e,type) RREPT(_i,x,_e,0,type)
//
//#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
//#define all(x) (x).begin(),(x).end()
#define REPV(v,_itr,_end) for(auto _itr=(v).begin(),_end=(v).end();_itr!=_end;++_itr)
#define REPVC(v,_itr,_end) for(auto _itr=(v).cbegin(),_end=(v).cend();_itr!=_end;++_itr)
#define td typedef
//#define tds(stl,type,name) typedef stl<type > name;
#define tdv(type,name) typedef vector<type > name;
typedef vector<bool> vb;
typedef vector<vb > vvb;
typedef vector<int> vi;
typedef vector<vi > vvi;
typedef vector<ll> vll;
//typedef vector<vll > vvll;
tdv(string, vs)
int main(int argc, const char * argv[]) {
int N;
cin>>N;
vi x(N),y(N),P(N);
double num=N;
repi0(i, N){
if(i!=0){
num*=i;
}
P[i]=i;
cin>>x[i]>>y[i];
}
double sum=0;
do{
double len=0;
repi0(i, N-1){
int dx=x[P[i]]-x[P[i+1]],dy=y[P[i]]-y[P[i+1]];
len+=sqrt(dx*dx+dy*dy);
}
sum+=len;
}while (next_permutation(P.begin(), P.end()));
cout<<fixed<<setprecision(10)<<sum/num<<endl;
return 0;
}
| #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
double len(int x1,int x2, int y1,int y2){
double res;
double x=x1-x2;
double y=y1-y2;
res=pow(x*x+y*y,0.5);
return res;
}
int main(){
int n;
cin>>n;
int x[n],y[n];
double ans=0;
for(int i=0;i<n;i++)cin>>x[i]>>y[i];
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
ans+=len(x[i],x[j],y[i],y[j])*2.0/n;
}
}
cout<<fixed<<setprecision(12)<<ans<<endl;
return 0;
} | 1 |
#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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
string s[410];
bool seen[410][410];
int h, w;
ll cnt_w, cnt_b;
void bfs(int sx, int sy){
queue<pair<int,int>> que;
que.push({sx,sy});
while(!que.empty()){
pair<int,int> p = que.front();
que.pop();
int x = p.first;
int y = p.second;
if (s[y][x] == '#') cnt_b++;
else if (s[y][x] == '.') cnt_w++;
rep(i, 4){
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || w <= nx || ny < 0 || h <= ny) continue;
else if (seen[ny][nx]) continue;
else if (s[ny][nx] != s[y][x]) {
seen[ny][nx] = true;
que.push({nx,ny});
}
}
}
}
int main(){
cin >> h >> w;
rep(i, h) cin >> s[i];
ll ans = 0;
rep(y, h) rep(x, w){
cnt_w = 0, cnt_b = 0;
if(seen[y][x]) continue;
seen[y][x] = true;
bfs(x, y);
ans += cnt_w * cnt_b;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<double> v(N);
for (int i = 0; i < N ; ++i)
cin >> v[i];
double roll = 0;
for (int i = 0; i < K; ++ i)
roll += 0.5 * (1. + v[i]);
double maxima = roll;
for (int i = 0; i < v.size() - K; ++i)
{
// cout << "subtract " << i << " " << v[i] << " add " << i + K << " " << v[i + K] << "\n";
roll = roll + 0.5 * (1 + v[i + K]) - 0.5 * (1 + v[i]);
maxima = max(maxima, roll);
}
printf("%.12f", maxima);
return 0;
}
| 0 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const ll MOD = 1e9 + 7;
int main(){
int N; cin>>N;
vector<int> A(N);
map<int,int> cnt;
rep(i,N){
cin>>A[i];
cnt[A[i]]++;
}
sort(all(A));
int ans = 0;
for(int i = N-1; i>= 0; --i){
if(cnt[A[i]] < 1)continue;
--cnt[A[i]];
int need = pow(2LL, (int)log2(A[i])+1) - A[i];
// printf("%d,%d\n", A[i], need);
if(cnt[need] > 0){
++ans;
--cnt[need];
}
}
cout<<ans<<endl;
}
// int main(){
// int N; cin>>N;
// vector<ll> A(N);
// map<ll,ll> hash;
// priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> Q;
// rep(i,N){cin>>A[i]; hash[A[i]]++;}
// rep(i,N){
// ll cand = 0;
// ll t = 2;
// while(t < 1000000100){
// if(hash.count(t - A[i]) == 1){
// if(A[i] == t-A[i]){
// if(hash[A[i]] >= 2){++cand;}
// }else{
// ++cand;
// }
// }
// t *= 2;
// }
// if(cand != 0){
// Q.push(make_pair(cand, i));
// }
// }
// // while(!Q.empty()){
// // cout<<Q.top().second<<" has "<<Q.top().first<<endl;
// // Q.pop();
// // }
// // return 0;
// ll ans = 0;
// while(!Q.empty()){
// ll e = A[Q.top().second];
// Q.pop();
// if(hash[e] <= 0)continue;
// ll t = 2;
// while(t < 1000000100){
// if(hash[t-e] > 0){
// ++ans;
// --hash[t-e];
// --hash[e];
// break;
// }
// t *= 2;
// }
// }
// cout<<ans<<endl;
// return 0;
// } | #include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<ll> c(100005);
for(int i=0;i<n;i++){
int d;
cin>>d;
c[d]++;
if(i==0&&d!=0){
cout<<0<<endl;
return 0;
}
}
ll ans=0;
if(c[0]==1) ans=1;
for(int i=1;i<n;i++){
for(int j=0;j<c[i];j++){
ans*=c[i-1];
ans%=998244353;
}
}
cout<<ans<<endl;
} | 0 |
#include <iostream>
#include <string>
using namespace std;
typedef struct{
string id;
long long sales;
} staff;
int main(void)
{
long long n;
while(cin>>n){
if(!n) break;
staff staff1[4001];
int pt = 0;
for(int i=0; i< n; i++){
string id;
cin >> id;
long long price;
int bnum;
cin >> price >> bnum;
int m=-1;
for(int j=0;j < i; j++){
if(id==staff1[j].id){
pt++;
m=j;
break;
}
}
if(m==-1){
staff1[i-pt].id = id;
staff1[i-pt].sales = price * bnum;
}else{
staff1[m].sales += price * bnum;
}
}
int count = 0;
for(int i=0; i < n-pt; i++){
if(staff1[i].sales >= 1000000){
count++;
cout << staff1[i].id << endl;
}
}
if(!count) cout << "NA" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
while(n != 0){
vector < pair<long long, long long> > v(n);
int order[n];
int num = 0;
for (int i = 0; i < n; ++i){
long long id, p, q;
cin >> id >> p >> q;
v[i] = make_pair(id, p * q);
order[i] = id;
}
sort(v.begin(), v.end());
int c = 1;
for (int i = 0; i < n - 1; ++i){
if(v[i].first != v[i+1].first){
c++;
}
}
vector < pair<long long, long long> > sum(c);
int k = 0;
for (int i = 0; i < c; ++i){
sum[i] = make_pair(0, 0);
}
long long s = 0;
for (int i = 0; i < n ; ++i){
s += v[i].second;
if(i < n - 1){
if(v[i].first != v[i+1].first){
sum[k] = make_pair(v[i].first, s);
s = 0;
k++;
}
}else{
sum[k] = make_pair(v[i].first, s);
}
}
int ids[c];
for (int i = 0; i < c; ++i){
if(sum[i].second >= 1000000){
ids[num] = sum[i].first;
num++;
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < num; j++){
if(order[i] == ids[j]){
cout << order[i] << endl;
ids[j] = -10000;
}
}
}
if(num == 0){
cout << "NA" << endl;
}
cin >> n;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vv = vector<vi>;
int main(){
int n;cin>>n;
vv faclist(19, vi (19, 0));
rep(i,n){
double a;cin>>a;
ll anum = a*1e9+0.5;
//llとして読み込み, 2と5の冪を計算
int fac2 = -9, fac5 = -9;
while( fac2<10 && anum%2 == 0 ){
fac2++;
anum /= 2;
}
while( fac5<10 && anum%5 == 0 ){
fac5++;
anum /= 5;
}
faclist[min(18,fac2+9)][min(18,fac5+9)]++;
}
//個数累積のリストを作る
vv acclist = faclist;
rep(i,19){
for(int j=17; j>=0; j--){
acclist[i][j] += acclist[i][j+1];
}
}
rep(j,19){
for(int i=17; i>=0; i--){
acclist[i][j] += acclist[i+1][j];
}
}
ll ans = 0;
rep(i,19)rep(j,19){
if(!faclist[i][j])continue;
if(i>8 && j>8)ans += faclist[i][j] * (acclist[18-i][18-j]-1);
else ans += faclist[i][j] * acclist[18-i][18-j];
}
cout << ans/2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define fir first
#define sec second
#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()
template <typename tp>
inline void read(tp& x) {
x = 0; char tmp; bool key = 0;
for (tmp = gc(); !isdigit(tmp); tmp = gc())
key = (tmp == '-');
for (; isdigit(tmp); tmp = gc())
x = (x << 3) + (x << 1) + (tmp ^ '0');
if (key) x = -x;
}
template <typename tp>
inline void ckmn(tp& x,tp y) {
x = x < y ? x : y;
}
template <typename tp>
inline void ckmx(tp& x,tp y) {
x = x < y ? y : x;
}
typedef double db;
const int N = 200010;
int n;
ll val[N];
int n2[N], n5[N], num[20][20];
int main() {
db tmp;
read(n);
rep (i, 1, n) {
scanf("%lf",&tmp);
val[i] = (ll)(tmp * 1e9 + 0.5);
}
rep (i, 1, n) {
while (val[i] % 2 == 0)
++ n2[i], val[i] /= 2;
while (val[i] % 5 == 0)
++ n5[i], val[i] /= 5;
}
ll ans = 0;
int mx2 = 0, mx5 = 0;
rep (i, 1, n) {
rep (a, 0, mx2) rep (b, 0, mx5) {
if (a + n2[i] >= 18 && b + n5[i] >= 18)
ans += num[a][b];
}
n2[i] = min(n2[i], 18);
n5[i] = min(n5[i], 18);
mx2 = max(n2[i], mx2);
mx5 = max(n5[i], mx5);
++ num[n2[i]][n5[i]];
}
cout << ans << endl;
return 0;
} | 1 |
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define ld double
#define inf 2001
#define infm inf*inf
#define mod ((ll)1e9+7)
#define INF (int)(1e9)
#define pi acos(-1)
#define rd(n) {n=0;char ch;int f=0;do{ch=getchar();if(ch=='-'){f=1;}}while(ch<'0'||ch>'9');while('0'<=ch&&ch<='9'){n=(n<<1)+(n<<3)+ch-48;ch=getchar();}if(f)n=-n;}
using namespace std;
ll getinv(ll x){
ll k=mod-2,ans=1;
while (k){
if (k&1){
ans=ans*x%mod;
}
x=x*x%mod;
k/=2;
}
return ans;
}
ll fact[infm],invf[infm];
void prework(int N){
fact[0]=1;
for (int i=1;i<=N;i++){
fact[i]=fact[i-1]*i%mod;
}
invf[N]=getinv(fact[N]);
for (int i=N-1;i>=0;i--){
invf[i]=invf[i+1]*(i+1)%mod;
}
return;
}
ll C(int x,int y){
return fact[x]*invf[y]%mod*invf[x-y]%mod;
}
ll cal(int x,int y){
return C(x+y,x);
}
int n,K;
int f[inf][inf];
int main(){
rd(n) rd(K)
if (K==1){
puts("1");
return 0;
}
prework(n*K);
f[0][0]=1;
for (int i=1;i<=n;i++){
ll sum=0;
for (int j=i;j>=1;j--){
sum=(sum+f[i-1][j-1])%mod;
f[i][j]=sum*cal((i-1)*K-j+1,K-2)%mod;
}
}
ll ans=0;
for (int i=0;i<=n;i++){
ans=(ans+f[n][i])%mod;
}
printf("%lld\n",ans*fact[n]%mod);
return 0;
}
| // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003;
template <typename T> inline bool chmin(T& x, const T& y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T> inline bool chmax(T& x, const T& y) {if (x < y) {x = y; return 1;} return 0;}
struct IOSET {IOSET() {cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10);}} ioset;
// Segment Tree
template <typename Operator>
struct SegmentTree {
Operator OP;
using NodeType = decltype(OP.NodeE);
int length;
vector<NodeType> node;
SegmentTree (int N) {
length = 1;
while (length < N) length <<= 1;
node.assign(length << 1, OP.NodeE);
}
SegmentTree (vector<NodeType> &vec) {
length = 1;
while (length < sz(vec)) length <<= 1;
node.assign(2 * length, OP.NodeE);
rep(i, sz(vec)) node[i + length] = vec[i];
for (int i = length - 1; i > 0; --i) node[i] = OP.func(node[(i << 1) + 0], node[(i << 1) + 1]);
}
void update(int idx, NodeType val) {
idx += length;
node[idx] = OP.change(node[idx], val);
while (idx >>= 1) node[idx] = OP.func(node[(idx << 1) + 0], node[(idx << 1) + 1]);
}
NodeType get(int l, int r) {
l += length;
r += length;
NodeType vl = OP.NodeE, vr = OP.NodeE;
while (r > l) {
if (l & 1) vl = OP.func(vl, node[l++]);
if (r & 1) vr = OP.func(node[--r], vr);
l >>= 1;
r >>= 1;
}
return OP.func(vl, vr);
}
};
struct RMQ {
using NodeType = pair<int, int>;
NodeType NodeE = pair<int, int>(-1, -1);
NodeType change(NodeType x, NodeType y) {return y;}
NodeType func(NodeType x, NodeType y) {return max(x, y);}
};
// Main
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) {cin >> a[i]; --a[i];}
int ans = 0;
if (a[0] != 0) {++ans; a[0] = 0;}
vector<vector<int>> g(n);
rep(i, 1, n) {g[a[i]].push_back(i);}
vector<int> d(n, 0);
auto dfs = [&](auto f, int v, int par) -> void {
for (int u: g[v]) {
if (u == par) continue;
d[u] = d[v] + 1;
f(f, u, v);
}
};
dfs(dfs, 0, -1);
SegmentTree<RMQ> st(n);
rep(i, n) st.update(i, pair<int, int>(d[i], i));
while (true) {
pair<int, int> p = st.get(0, n);
if (p.first <= k) break;
int now = p.second;
rep(i, k - 1) now = a[now];
d[now] = 1;
auto dfs2 = [&](auto f, int v, int par) -> void {
st.update(v, pair<int, int>(d[v], v));
for (int u: g[v]) {
if (u == par || d[u] == 1) continue;
d[u] = d[v] + 1;
f(f, u, v);
}
};
dfs2(dfs2, now, -1);
++ans;
}
cout << ans << "\n";
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(),a.end()),a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int,vector<int>,greater<int>>
#define PriP priority_queue<P<int,int>,vector<P<int,int>>,greater<P<int,int>>>
#define all(a) (a).begin(),(a).end()
#define ff first.first
#define fs first.second
signed main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
V<int> X(n);
fo(i,n){
cin >> X[i];
}
V<int> Y(m);
fo(i,m){
cin >> Y[i];
}
Sort(X);
Sort(Y);
int Max_x = X[n-1];
int Min_y = Y[0];
bool can = 0;
for(int i = x+1; i <= y; i++){
if(Max_x < i && Min_y >= i){
can = 1;
break;
}
}
if(can)
cout << "No War" << endl;
else
cout << "War" << endl;
}
| #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
}
| 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const ll MAX_N=1e5,MAX_X=1e5;
ll N,X,psm[MAX_N+2],inx[MAX_N+1];
typedef tuple<ll,ll,ll> TUP;
TUP blu[MAX_N+1];
ll tsm(ll i){
return get<1>(blu[i])*get<0>(blu[i])+get<2>(blu[i])*(X-get<0>(blu[i]));
}
ll ptsm(ll i,ll n){
return get<1>(blu[i])*min(n,get<0>(blu[i]))+get<2>(blu[i])*(n-min(n,get<0>(blu[i])));
}
bool C(ll x){
ll n=x/X,m=x%X;
ll sm=0;
REP(i,N+1){
ll tmp=psm[n];
if(i<n){
tmp-=tsm(i);
tmp+=ptsm(i,m);
tmp+=tsm(n);
}else{
tmp+=ptsm(i,m);
}
sm=max(sm,tmp);
}
REP(i,N)sm-=get<1>(blu[i])*get<0>(blu[i]);
return sm>=0;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>N>>X;
REP(i,N)cin>>get<0>(blu[i])>>get<1>(blu[i])>>get<2>(blu[i]);
blu[N]=make_tuple(0,0,0);
REP(i,N+1)inx[i]=i;
sort(blu,blu+N+1,[](TUP x,TUP y){
return get<1>(x)*get<0>(x)+get<2>(x)*(X-get<0>(x))
>get<1>(y)*get<0>(y)+get<2>(y)*(X-get<0>(y));
});
psm[0]=0;
REP(i,N+1){
psm[i+1]=psm[i]+tsm(i);
}
ll lb=-1,ub=N*X;
while(ub-lb>1){
ll m=(lb+ub)>>1;
if(C(m)){
ub=m;
}else{
lb=m;
}
}
cout<<ub<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repb(i, n) for (int i = (n-1); i >= 0; i--)
#define rea(i, a, b) for (int i = (a); i < (b); i++)
#define reab(i, a, b) for (int i = (a)-1; i >= (b); i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define PRINT(V) for (auto v:(V)) {cerr << v << " ";} cerr << endl
#define dump(x) cerr << #x << " : " << (x) << endl
#define dump2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define dump3(x, y, z) cerr << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y << ", " << z << ")" << endl
inline ll GCD(ll a, ll b){return b ? GCD(b, a % b) : a;}
const ll MOD = 1000000007;
const ll INF = 100000000000000000;
/* END OF TEMPLATE */
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vll b(n), l(n), u(n);
rep(i, n){
cin >> b[i] >> l[i] >> u[i];
}
vector<tuple<ll, ll, ll, ll>> vt;
ll val = 0;
rep(i, n){
vt.emplace_back(b[i]*l[i]+(x-b[i])*u[i], u[i], l[i], b[i]);
val -= l[i]*b[i];
}
sort(vt.rbegin(), vt.rend());
vll acc;
acc.emplace_back(0);
rep(i, n){
acc.emplace_back(*acc.rbegin()+get<0>(vt[i]));
}
// ans : 0 ~ nx
// binary search
// https://qiita.com/drken/items/97e37dd6143e33a64c8c
ll bsl = -1;
ll bsr = n*x;
while(bsr - bsl > 1){
// dump2(bsl, bsr);
ll mid = bsl + (bsr - bsl) / 2;
ll q = mid / x;
ll r = mid % x;
ll m = 0;
rep(i, q){
ll mt;
if(r > get<3>(vt[i])){
mt = get<2>(vt[i])*get<3>(vt[i]) + get<1>(vt[i])*(r-get<3>(vt[i]));
}else{
mt = get<2>(vt[i])*r;
}
// dump(mt);
m = max(m, acc[q+1] - get<0>(vt[i]) + mt);
}
rea(i, q, n){
ll mt;
if(r > get<3>(vt[i])){
mt = get<2>(vt[i])*get<3>(vt[i]) + get<1>(vt[i])*(r-get<3>(vt[i]));
}else{
mt = get<2>(vt[i])*r;
}
// dump(mt);
m = max(m, acc[q] + mt);
}
if(m + val >= 0){
bsr = mid;
}else{
bsl = mid;
}
}
cout << bsr << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void solve() {
int n, k, p;
cin >> n >> k;
vector <int> am;
vector <int> dig(10, 0);
for (int i = 0; i < k; ++i) {
int t;
cin >> t;
++dig[t];
}
bool flag = false;
int N = n;
while (!flag) {
n = N;
flag = true;
while (n > 0) {
if (dig[n % 10]) {
flag = false;
n = 0;
++N;
} else {
n /= 10;
}
}
}
cout << N;
}
int main() {
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define poly vector<ll>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
inline ll read(){
ll x=0;char ch=getchar();bool d=1;
for(;!isdigit(ch);ch=getchar()) if(ch=='-') d=0;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return d?x:-x;
}
inline void write(ll x){
if(x<0) x=-x,putchar('-');
if(x>=10) write(x/10);
putchar('0'+x%10);
}
inline void writeln(ll x){write(x);puts("");}
inline void writep(ll x){write(x);putchar(' ');}
inline ull rnd(){
return ((ull)rand()<<30^rand())<<4|rand()%4;
}
const int N=1e5+5;
int fa[N],m,ans;
poly v[N];
int dfs(int u,int dep){
int mx=dep;
for(auto k:v[u]){
mx=max(mx,dfs(k,dep+1));
}
if(fa[u]!=1&&mx-dep==m-1) return ans++,0;
return mx;
}
int main(){
int n=read();m=read();
For(i,1,n) fa[i]=read();
For(i,2,n) v[fa[i]].pb(i);
if(fa[1]!=1) ans=fa[1]=1;
dfs(1,0);cout<<ans;
} | 0 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
using ll = long long;
using namespace std;
ll mod=1e9+7;
int main() {
int h,w;
cin>>h>>w;
vector<vector<bool>>map(h,vector<bool>(w));
queue<pair<pair<int,int>,int>>todo;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
char c;
cin>>c;
if(c=='.'){
map[i][j]=true;
}else{
todo.push(pair<pair<int,int>,int>(pair<int,int>(i,j),0));
}
}
}
int ans=0;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
while(todo.empty()!=1){
ans++;
auto tmp=todo.front();
todo.pop();
int x=tmp.first.first,y=tmp.first.second;
int depth=tmp.second;
ans=depth;
for(int k=0;k<4;k++){
int nx=x+dx[k];
int ny=y+dy[k];
if(nx<0||nx>=h||ny<0||ny>=w)continue;
if(map[nx][ny]){
map[nx][ny]=false;
todo.push(pair<pair<int,int>,int>(pair<int,int>(nx,ny),depth+1));
}
}
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
using namespace std;
int n,k;
int d[10]={-1,-1,-1, -1, -1, -1, -1 ,-1,-1,-1};
bool check(int n){
bool flag=true;
int a;
for(int i=n;i!=0;i/=10){
a=i%10;
for(int j=0;j<10;j++){
if(a==d[j]) flag=false;
}
}
return flag;
}
int main(){
cin>>n>>k;
for(int i=0;i<k;i++){
cin>>d[i];
}
for(int i=n;i<100000;i++){
bool flag=false;
flag=check(i);
if(flag) {
cout << i << '\n';
break;
}
}
return 0;
}
| 0 |
#include<stdio.h>
int main()
{
int n,i,dig,flag=0;
scanf("%d",&n);
while(n!=0)
{
dig = n%10;
n = n/10;
if(dig==7)
flag++;
}
if(flag>0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
string n;
cin>>n;
bool a=true;
for(int i=0;i<3;i++){
if(n.at(i)=='7'){
a=false;
}
}
if(a){
cout<<"No"<<endl;
}
else{
cout<<"Yes"<<endl;
}
}
| 1 |
#include<bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
static const ULL M = 1000000007;
void Solve() {
UL N; cin >> N;
vector<ULL> F(N + 1); F[0] = 1;
for (UL i = 1; i <= N; i++) F[i] = F[i - 1] * i % M;
ULL X; cin >> X;
vector<ULL> S(N); rep(i, N) cin >> S[i];
sort(S.rbegin(), S.rend());
vector<ULL> dp(X + 1);
dp[X] = 1;
rep(i, N) {
UL t = N - i;
vector<ULL> buf(X + 1);
rep(j, X + 1) {
if (j < S[i]) buf[j] += dp[j] * t;
else {
buf[j % S[i]] += dp[j];
buf[j] += dp[j] * (t - 1);
}
}
rep(j, X + 1) dp[j] = buf[j] % M;
}
ULL ans = 0;
rep(i, X + 1) ans += dp[i] * i % M;
ans %= M;
cout << ans << endl;
}
Problem();
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
Problem::Problem() {
cout << fixed << setprecision(10);
} | #include<bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vi > vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
typedef long double ld;
// macros
#define rep(i, a, b) for(int i=a; i<b; i++)
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define tr(c, it) for(auto it=(c).begin(); it!=c.end(); it++)
#define PB push_back
#define MP make_pair
#define bitcount __builtin_popcount
#define watch(x) cerr<< (#x) << " is " << (x) <<"\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first<<32 | (p).second)
// template functions
template <typename T>
inline void printV(vector<T>& a) { rep(i, 0, sz(a)) { cout<<a[i]<<" "; } cout<<"\n"; }
template <typename T>
inline void printV(vector<T>& a, int n) { rep(i, 0, n) { cout<<a[i]<<" "; } cout<<"\n"; }
template <typename T>
inline void printVV(vector<vector<T>>& a)
{
rep(i, 0, sz(a)) {
printV(a[i]);
}
cout<<"\n";
}
template <typename T>
inline void clearVV(vector<vector<T>>& a)
{
for(auto& x:a) {
x.clear();
}
a.clear();
}
template <typename T>
inline void assignVV(vector<vector<T>> &a, T val)
{
for(int i=0; i<sz(a); i++) {
for(int j=0; j<sz(a[i]); j++) {
a[i][j]=val;
}
}
}
// random number generation
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// constants
const long double eps = LDBL_EPSILON;
const int inf = 5e8;
const int modn = 1e9+7;
const int MAX = 1e5;
inline int add(int a, int b)
{
int ret=((ll)a+b)%modn;
if(ret<0) {
ret=(ret+modn)%modn;
}
return ret;
}
inline int mul(int a, int b)
{
int ret=((ll)a*b)%modn;
if(ret<0) {
ret=(ret+modn)%modn;
}
return ret;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Your code here
int N, X;
cin>>N>>X;
vector<int> a(N+1);
for(int i=1; i<=N; i++) {
cin>>a[i];
}
sort(all(a));
vector<vector<int>> dp(N+1, vector<int>(X+1, -1));
function<int(int, int)> solve = [&](int n, int x)
{
if(n==1) {
return x%a[n];
}
int &memo = dp[n][x];
if(memo!=-1) return memo;
int ans = 0;
ans = add(ans, solve(n-1, x%a[n]));
ans = add(ans, mul(n-1, solve(n-1, x)));
return memo=ans;
};
int ans = solve(N, X);
cout<<ans<<"\n";
return 0;
}
| 1 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
//================================================
int a = 0, b = 0, c, d, n, k=0;
string s, t;
long long kaizyou(int x)
{
if (x == 1)
return 1;
else
return x * kaizyou(x - 1);
}
int main()
{
cin >> n >> k;
cout << n-k+1 << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
char ch[20];
int i=0;
while(cin >> ch[i]){
i++;
}
for(int j=i-1 ; j>=0 ; j--){
cout<<ch[j];
}
cout<<endl;
return 0;
} | 0 |
//{{{
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
#endif
// clang-format off
void _print() { cerr << "]\033[0m\n"; }
template <typename T> void __print(T x) { cerr << x; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#ifdef LOCAL
#define debug(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m["; _print(x)
#define debug_arr(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m" << (x) << "\033[0m\n"
#else
#define debug(x...)
#define debug_arr(x...)
#endif
// clang-format on
//}}}
const int N = 20;
const int mod = 1e9 + 7;
int n;
int a[N];
vector<pii> words[N];
bool is_h(int status, int idx) { return (status & (1 << idx)) > 0; }
bool check(int status)
{
for (int i = 0; i < n; i++)
{
// check ith person
bool is_honest = is_h(status, i);
if (is_honest == false) continue;
for (int j = 0; j < a[i]; j++)
{
int p = words[i][j].first;
int val = words[i][j].second;
bool is_p_h = is_h(status, p);
if (is_p_h != val) return false;
}
}
return true;
}
int main()
{
#ifdef LOCAL
freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
while (cin >> n)
{
for (int i = 0; i < n; ++i)
{
words[i].clear();
cin >> a[i];
for (int j = 0; j < a[i]; ++j)
{
int x, y;
cin >> x >> y;
x--;
words[i].push_back({x, y});
}
}
int ans = -1;
int lim = 1 << n;
for (int st = 0; st < lim; st++)
{
// if (__builtin_popcount(st) <= ans) continue;
// check
if (check(st))
{
ans = max(ans, __builtin_popcount(st));
}
}
// int v = __builtin_popcount(ans);
cout << ans << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 1000000007
#define mod 1000000007
#define MAX 100005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<int,int> pii;
vector<pii> V[MAX];
int pos[MAX],flg,visited[MAX];
void dfs(int u){
visited[u]=1;
for(auto v:V[u]){
if(v.second){
if(!pos[v.first]){
pos[v.first]=1;
dfs(v.first);
}
else if(pos[v.first]==1){
if(!visited[v.first])
dfs(v.first);
}
else flg=1;
}
else{
if(!pos[v.first]) pos[v.first]=2;
else if(pos[v.first]==1) flg=1;
}
}
}
int possible(int k,int n){
vector<int>vec;
for(int i=0;i<(n-k);i++) vec.pb(0);
for(int i=0;i<k;i++) vec.pb(1);
do{
flg=0;
for(int i=1;i<=n;i++){
visited[i]=0;
pos[i]=vec[i-1];
}
for(int i=1;i<=n;i++){
if(!visited[i] && vec[i-1]){
dfs(i);
}
}
if(!flg)
return 1;
}while(next_permutation(vec.begin(),vec.end()));
return 0;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
for(int i=0;i<n;i++){
int a;
cin>>a;
for(int j=0;j<a;j++){
int x,y;
cin>>x>>y;
V[i+1].pb(mp(x,y));
}
}
int lo,hi,mid;
lo=0;
hi=n;
while(hi>lo){
mid=(lo+hi+1)/2;
if(possible(mid,n)) lo=mid;
else hi=mid-1;
}
cout<<lo;
}
| 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h> //pow(x,y)=x^y 99999とかの場合+1するif文
#include <algorithm> //sort(a.begin(), a.end());reverse(a.begin(), a.end());
#include <ctime> //実行時間を測る
#define ll long long
#define vecvec(h, w, name) vector<vector<ll>> name(h, vector<ll>(w));
#define rep(init, i, n) for (ll i = init; i < (n); i++)
#define rev(s) reverse(s.begin(), s.end())
#define sor(v) sort(v.begin(), v.end()) //昇順
#define PI 3.14159265358979323846264338327950L
//コード自動整形 Shift + Option + F @vscode
//変数名一括置換 command+fn+f2 @vscode
using namespace std;
using vec = vector<ll>;
//function
ll facctorialMethod(ll k); //階乗を出力する
ll modpow(ll a, ll n, ll mod); // a^n mod を計算する
ll gcd(ll a, ll b); //最大公約数
ll lcm(ll a, ll b); //最小公倍数
//
//struct
// UnionFind
// coding: https://youtu.be/TdR816rqc3s?t=726
// comment: https://youtu.be/TdR816rqc3s?t=6822
struct UnionFind
{
vector<ll> d;
UnionFind(ll n = 0) : d(n, -1) {}
ll find(ll x)
{ //根っこを返す
if (d[x] < 0)
return x;
return d[x] = find(d[x]); //根っこの場所を貼り付ける
}
bool unite(ll x, ll y)
{ //くっつける操作、連結成分の情報整理 ABC177,157D参照
x = find(x);
y = find(y);
if (x == y)
return false;
if (d[x] > d[y])
swap(x, y); //dはマイナスをかけたサイズだからxの方がサイズ小さいようにする
d[x] += d[y];
d[y] = x;
return true;
}
//find(i)でi番目の属しているグループ番号を出力
bool same(ll x, ll y) { return find(x) == find(y); } //同じ集合に属しているかを判定
ll size(ll x) { return -d[find(x)]; } //あるID、xが所属するグループに所属するIDの数を得る ABC177,157D参照
};
//
/////main/////
int main()
{
int clock_on = 0; //提出時は0!!!!!!!!!!!!!!!!!
int time_clock = clock();
//
ll K;string S;
cin>>K>>S;
if(S.size()<=K){cout<<S<<endl;return 0;}
else{
cout<<S.substr(0,K)<<"..."<<endl;
}
//
if (clock_on == 1)
printf("Execution Time: %.4lf sec\n", 1.0 * (clock() - time_clock) / CLOCKS_PER_SEC);
return 0;
}
/////main/////
/////function/////
//階乗を出力する
ll facctorialMethod(ll k)
{
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
// a^n mod を計算する
ll modpow(ll a, ll n, ll mod)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
else
{
return gcd(b, a % b);
}
}
//最小公倍数
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
char arr[100];
cin >> k;
scanf("%s", arr);
if(strlen(arr) <=k){
printf("%s", arr);
}
else{
for(int i=0; i<k; ++i){
cout << arr[i];
}
cout << "...";
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
int n;
std::cin >> n;
std::vector<int> v(n), o(100001,0), e(100001,0);
rep(i,n){
std::cin >> v[i];
if(i%2) o[v[i]]++;
else e[v[i]]++;
}
auto io = std::distance(o.begin(),std::max_element(o.begin(),o.end()));
auto ie = std::distance(e.begin(),std::max_element(e.begin(),e.end()));
std::sort(o.begin(),o.end());
std::sort(e.begin(),e.end());
int ans = 0;
if(io==ie){ //最大の値が同じとき
ans = std::min(n-o[o.size()-1]-e[e.size()-2],n-o[o.size()-2]-e[e.size()-1]);
}else{ //最大の値が違うとき
ans = n - o.back() - e.back();
}
std::cout << ans << "\n";
return 0;
}
| #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define l first
#define r second
#define int long long
int n;
long long a[500000];
vector<long long> multi;
int upper_bit(long long c)
{
for (int i = 60; i >= 0; i--)
{
if (c & (1LL << i)) return i;
}
return -1;
}
signed main()
{
cin >> n;
long long x = 0;
for (int i = 0; i < n; i++) cin >> a[i], x ^= a[i];
for (int i = 0; i < n; i++) a[i] -= a[i] & x;
for (int i = 0; i < n; i++)
{
int kek = 0;
for (int j = 0; j < multi.size(); j++)
{
if (upper_bit(multi[j]) == upper_bit(a[i])) kek = 1;
}
if (kek)
{
long long cur = a[i];
for (int i = 0; i < multi.size(); i++)
{
if (upper_bit(cur) == upper_bit(multi[i]))
{
cur ^= multi[i];
if (cur == 0) break;
}
}
if (cur != 0)
{
multi.push_back(cur);
sort(multi.begin(), multi.end());
reverse(multi.begin(), multi.end());
}
}
else
{
multi.push_back(a[i]);
sort(multi.begin(), multi.end());
reverse(multi.begin(), multi.end());
}
}
sort(multi.begin(), multi.end());
reverse(multi.begin(), multi.end());
long long res = 0;
long long b = (1LL << 61);
for (int i = 0; i < multi.size(); i++)
{
//cout << multi[i] << "\n";
while (b > multi[i]) b /= 2;
if ((res & b) == 0) res ^= multi[i];
}
cout << x + 2 * res;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n >> x;
long long ans = 0, now = 0;
for(int i = 0; i < n; i++){
long long a;
cin >> a;
long long dis = max((long long)0, now + a - x);
ans += dis;
now = a - dis;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main(){
fast;
ll n,x,ans=0,diff=0;
cin>>n>>x;
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
for(ll i=1;i<n;i++)
if(arr[i]+arr[i-1]>x)
{
diff=arr[i-1]+arr[i]-x;
ans+=diff;
if(arr[i]-diff>=0)
arr[i]-=diff;
else
{
diff-=arr[i];
arr[i]=0;
if(arr[i-1]-diff>=0)
arr[i-1]-=diff;
else
arr[i-1]=0;
}
}
cout<<ans;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int dp[1<<15][15];
int g[15][15];
int dis[1<<15];
int n,m,ans=0x3f3f3f3f,sum;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;a--;b--;
g[a][b]=g[b][a]=c;
sum+=c;
}
for(int s=0;s<1<<n;s++){
for(int i=0;i<n;i++)if(s>>i&1){
for(int j=i+1;j<n;j++)if(s>>j&1){
dis[s]+=g[i][j];
}
}
}
memset(dp,0x3f,sizeof(dp));
dp[1][0]=sum;
for(int s=0;s<1<<n;s++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)if(!(s>>j&1)&&g[i][j]){
dp[s|(1<<j)][j]=min(dp[s|(1<<j)][j],dp[s][i]-g[i][j]);
}
int rs=(s^((1<<n)-1))|(1<<i);
for(int j=rs;j;j=rs&(j-1)){
dp[s|j][i]=min(dp[s|j][i],dp[s][i]-dis[j]);
}
}
}
for(int s=0;s<1<<n;s++){
ans=min(ans,dp[s][n-1]);
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
char ch=getchar(); int f=1,x=0;
while (ch<'0' || ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
while (ch>='0' && ch<='9') { x=x*10+ch-'0'; ch=getchar(); }
return f*x;
}
int n,m,a,b,c,sum,dis[17][17],v[1<<15],f[1<<15][17];
signed main()
{
n=read(); m=read();
const int N=1<<n;
for (int i=1;i<=m;i++)
{
a=read(); b=read();
sum+=dis[a][b]=dis[b][a]=read();
}
for (int i=1;i<N;i++)
{
for (int j=0;j<n;j++)
{
if (!(i>>j&1)) continue;
for (int k=0;k<j;k++)
{
if (!(i>>k&1)) continue;
v[i]+=dis[j+1][k+1];
}
}
}
memset(f,-1,sizeof(f));
f[1][1]=0;
for (int i=1;i<N;i++)
{
for (int j=0;j<n;j++)
{
if (!(i>>j&1) || !~f[i][j+1]) continue;
for (int k=0;k<n;k++)
{
if (i>>k&1 || !dis[j+1][k+1]) continue;
f[i|(1<<k)][k+1]=max(f[i|(1<<k)][k+1],f[i][j+1]+dis[j+1][k+1]);
}
int tot=((N-1)^i)|(1<<j);
for (int k=tot;k;k=(k-1)&tot)
{
if (!(k>>j&1)) continue;
f[i|k][j+1]=max(f[i|k][j+1],f[i][j+1]+v[k]);
}
}
}
return !printf("%d\n",sum-f[N-1][n]);
} | 1 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#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--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
void solve();
signed main()
{
#if DEBUG
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
/*================================*/
#if DEBUG
#define SIZE 1000
#else
#define SIZE 423450
#endif
int N,Q,K;
set<int> um[2][SIZE],dm[2][SIZE];
int BASE = SIZE/2;
struct Item2 {
int x,y;
char u;
};
vector<Item2> V;
set<int> ds[SIZE],ls[SIZE];
void solve() {
cin>>N;
int x,y;
char u;
REP(i,N) {
cin>>x>>y>>u;
if (u=='D') {
dm[0][y-x+BASE].insert(x);
dm[1][y+x].insert(x);
}
if (u=='U') {
um[0][y-x+BASE].insert(x);
um[1][y+x].insert(x);
}
V.push_back({x,y,u});
if (u=='D') ds[x].insert(y);
if (u=='L') ls[y].insert(x);
}
int ans = INT_MAX;
REP(i,N) {
auto p = V[i];
if (p.u=='R') {
{
auto s = &dm[0][p.y-p.x+BASE];
auto it = s->upper_bound(p.x);
if (it != s->end()) chmin(ans, (*it - p.x) * 10);
}
{
auto s = &um[1][p.y+p.x];
auto it = s->upper_bound(p.x);
if (it != s->end()) chmin(ans, (*it - p.x) * 10);
}
{
auto s = &ls[p.y];
auto it = s->upper_bound(p.x);
if (it != s->end()) {
chmin(ans, (*it - p.x) * 5);
}
}
}
if (p.u=='L') {
{
auto s = &um[0][p.y-p.x+BASE];
auto it = s->lower_bound(p.x);
if (it != s->begin()) chmin(ans, (p.x - *(--it))*10);
}
{
auto s = &dm[1][p.y+p.x];
auto it = s->lower_bound(p.x);
if (it != s->begin()) chmin(ans, (p.x - *(--it))*10);
}
}
if (p.u=='U') {
auto s = &ds[p.x];
auto it = s->upper_bound(p.y);
if (it != s->end()) {
chmin(ans, (*it - p.y)*5);
}
}
}
if (ans==INT_MAX) {
cout << "SAFE" << endl;
} else {
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define dump_4(x1, x2, x3, x4) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define dump_5(x1, x2, x3, x4, x5) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#define dump(...) \
CHOOSE((__VA_ARGS__, dump_5, dump_4, dump_3, dump_2, dump_1, ~))(__VA_ARGS__)
#define check(s) cerr << s << endl
#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 all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
using namespace std;
using ll = long long;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
const ll LINF = 2e18;
const int INF = 1e8;
int g(vector<pair<int, int>> a) {
sort(all(a));
int res = INF;
int py = -INF * 2;
for (int i = 1; i < sz(a); i++) {
if (a.at(i - 1).second == 0 && a.at(i).second != 0) {
res = min(res, a.at(i).first - a.at(i - 1).first);
}
}
return res;
}
int f(map<int, vector<pair<int, int>>>& mp) {
int res = INF;
for (auto p : mp) {
res = min(res, g(p.second));
}
return res;
}
void solve(ll N, std::vector<ll> X, std::vector<ll> Y, std::vector<char> U) {
vector<ll> dir(N); // URDL = 0123
rep(i, N) {
if (U.at(i) == 'U') dir.at(i) = 0;
if (U.at(i) == 'R') dir.at(i) = 1;
if (U.at(i) == 'D') dir.at(i) = 2;
if (U.at(i) == 'L') dir.at(i) = 3;
}
int ans = INF;
rep(ri, 4) {
{ // UD
map<int, vector<pair<int, int>>> mp;
rep(i, N) {
if (dir.at(i) != 0 && dir.at(i) != 2) continue;
mp[X.at(i)].emplace_back(Y.at(i), dir.at(i));
}
ans = min(ans, f(mp) * 5);
}
{ // UR
map<int, vector<pair<int, int>>> mp;
rep(i, N) {
if (dir.at(i) != 0 && dir.at(i) != 1) continue;
mp[X.at(i) + Y.at(i)].emplace_back(Y.at(i), dir.at(i));
}
ans = min(ans, f(mp) * 10);
}
// rotate
rep(i, N) {
int px = X.at(i), py = Y.at(i);
// 反時計に90度回転
X.at(i) = py;
Y.at(i) = -px;
dir.at(i) = (dir.at(i) + 1) % 4;
}
}
if (ans != INF) {
cout << ans << endl;
} else {
cout << "SAFE" << endl;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll N;
cin >> N;
std::vector<ll> X(N);
std::vector<ll> Y(N);
std::vector<char> U(N);
for (int i = 0; i < N; i++) {
cin >> X.at(i);
cin >> Y.at(i);
cin >> U.at(i);
}
solve(N, std::move(X), std::move(Y), std::move(U));
return 0;
}
| 1 |
/*G - Travelling Salesman Problem*/
/*F - PLUR @ EDC*/
/*A - Headphones */
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c;
int ans;
int maximo;
cin >> a >> b >> c;
ans = a + b + c;
maximo = max(a, b);
maximo = max(maximo, c);
ans -= maximo;
cout << ans;
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string A, B, C;
cin >> A >> B >> C;
bool ans = true;
if (A.at(A.size() - 1) != B.at(0)) ans = false;
if (B.at(B.size() - 1) != C.at(0)) ans = false;
if (ans) cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
template <typename T>
struct RUQ //calculateはminimum
{
int n;
const T ex = 1 << 30; //dat 初期値(minなので)
const T em = 1 << 30; //lazy 初期値(minなので)
vector<T> dat, lazy; //tree本体
RUQ(vector<T> v){
int x = 1;
int i;
n = v.size();
while(x < n) x <<= 1;
n = x;
dat.resize(2*n-1, ex);
lazy.resize(2*n-1, em);
for(i = 0;i < v.size();++i){
dat[i + n - 1] = v[i];
}
for(i = n-2;i >= 0;--i){
dat[i] = calculate(dat[2*i+1], dat[2*i+2]);
}
}
T calculate(T a, T b){
return min(a, b); //minで使う
}
void eval(int now){
if(lazy[now] == em) return;
if(now < n - 1){ //最小値なのでそのまま代入
lazy[2*now + 1] = lazy[now];
lazy[2*now + 2] = lazy[now];
}
dat[now] = lazy[now];
lazy[now] = em;
}
void update(int a, int b, T x, int now, int l, int r){
eval(now);
if(a <= l && r<= b){
lazy[now] = x; //上から書き換える。最小値なので代入する
eval(now);
}else if(a < r && l < b){
update(a, b, x, 2*now + 1, l, (l + r)/2);
update(a, b, x, 2*now + 2, (l + r)/2, r);
dat[now] = calculate(dat[2*now + 1], dat[2*now + 2]);
}
}
void update(int a, int b, T x){update(a, b, x, 0, 0, n);}
T query(int a, int b){return query_sub(a, b, 0, 0, n);}
T query_sub(int a, int b, int now, int l, int r){
eval(now);
if(r <= a || b <= l) return ex;
else if(a <= l && r <= b) return dat[now];
else{
T vl = query_sub(a, b, 2*now + 1, l, (l + r)/2);
T vr = query_sub(a, b, 2*now + 2, (l + r)/2, r);
return calculate(vl, vr);
}
}
inline T operator[](int a) { return query(a, a + 1); }
void print() {
for (int i = 0; i < 2 * n - 1; ++i) {
cout << (*this)[i];
if (i != n) cout << ",";
}
cout << endl;
}
};
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
int i;
int h,w;
cin >> h >> w;
vector<int> v(w, 0);
const int INF = 1e9;
set<int> st;
rep(i,w) st.insert(i);
RUQ<int> ruq(v);
rep(i,h){
int a,b;
cin >> a >> b;
--a; --b;
auto x = st.lower_bound(a);
auto y = st.upper_bound(b);
if(x == y){
ruq.update(a, b+1, INF);
int ans = ruq.query(0, w);
if(ans == INF) cout << -1 << endl;
else cout << ans + i + 1 << endl;
}else if(b+1 == w){
st.erase(x, y);
ruq.update(a, b+1, INF);
int ans = ruq.query(0, w);
if(ans == INF) cout << -1 << endl;
else cout << ans + i + 1 << endl;
}else{
auto it = prev(y);
int ind = *it;
st.erase(x, y);
st.insert(b+1);
int tmp = ruq.query(ind, ind+1) + (b + 1 - ind);
ruq.update(b+1, b+2, min(tmp, ruq.query(b+1, b+2)));
ruq.update(a, b+1, INF);
int ans = ruq.query(0, w);
if(ans == INF) cout << -1 << endl;
else cout << ans + i + 1 << endl;
}
}
return 0;
}
| #include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<climits>
#include<map>
#include<string>
#include<functional>
#include<iomanip>
#include<deque>
#include<random>
#include<set>
#include<bitset>
#include<cassert>
using namespace std;
typedef long long ll;
typedef double lldo;
#define mp make_pair
#define pub push_back
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define chmax(x,y) x = max(x,y)
ll gcd(ll a, ll b) { if (a % b == 0) { return b; } else return gcd(b, a % b); }
ll lcm(ll a, ll b) { if (a == 0) { return b; }return a / gcd(a, b) * b; }
template<class T>ll LBI(vector<T>& ar, T in) { return lower_bound(ar.begin(), ar.end(), in) - ar.begin(); }
template<class T>ll UBI(vector<T>& ar, T in) { return upper_bound(ar.begin(), ar.end(), in) - ar.begin(); }
ll h, w, a, b;
map<ll, ll> m;
multiset<ll> vals;
int main() {
cin >> h >> w;
rep(i, w) {
m[i] = i;
vals.insert(0);
}
rep(i, h) {
cin >> a >> b;
a--;
auto it = m.lower_bound(a);
ll mr = -1;
while (it != m.end() && it->first <= b) {
mr = it->second;
vals.erase(vals.find(it->first - it->second));
it = m.erase(it);
}
if (b == w)mr = -1;
if (mr != -1) {
m[b] = mr;
vals.insert(b - mr);
}
if (vals.size()) {
cout << *vals.begin() + i + 1 << endl;
}
else {
cout << -1 << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> v;
for(int i = 0; i < n+n; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
int ans = 0;
while(v.size() > 0) {
v.pop_back();
ans += v.back();
v.pop_back();
}
cout << ans << endl;
return 0;
}
| /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#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 <iomanip>
#include <limits>//setprecision
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
//#include <unordered_set> //unordered_set
#include <stack> // stack
#include <deque> // deque
#include <math.h>//pow,,,
#include <cmath>//abs,,,
#include <bitset> // bitset
//It is so troublesome that I include bits/stdc++.h !
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 10010010010010;
const long long MOD = 1000000007;
typedef pair<int,int> P;
//Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
//最下位ビット(*N)が1の時は単独でNをかける
if (M & 1) res = (res * N) % MOD;
return res %= MOD;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b ;
}
int main() {
int N;cin >> N;
vector<int> retu(N*2);
for(int i = 0;i<N*2;i++) cin >> retu.at(i);
sort(retu.begin(),retu.end());
int ans = 0;
for(int i = 0;i<N*2;i+=2){
ans += min(retu.at(i),retu.at(i+1));
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//GCD,LCM
ll gcd(ll a, ll b){ return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b){ return a/gcd(a,b)*b;}
int main()
{
string S;
int w;
cin>>S>>w;
for(int i=0;i<S.length();i++){
if(i%w==0){
cout<<S[i];
}
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 1000010
inline int read() {
int x=0;
char ch=getchar();
while (!isdigit(ch)) ch=getchar();
while (isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x;
}
int x[N];
char s[N],t[N];
int main() {
int n=read(),p=0;
scanf("%s%s",&s,&t);
for (int i=n-1,j=n,k=0,l=0;i>=0;i--) {
if (j>i && t[i]!=s[i]) j=i;
if (j<=i && t[i]!=s[j]) {
for (;j>=0 && t[i]!=s[j];j--);
if (j<0) return puts("-1"),0;
k++,l++,x[j+l]++,p=max(p,k);
}
k-=x[i+l],x[i+l]=0;
}
printf("%d\n",p);
return 0;
} | 0 |
// 去吧！皮卡丘! 把AC带回来！
// へ ／|
// /＼7 ∠＿/
// / │ ／ ／ AC AC AC AC
// │ Z ＿,＜ ／ /`ヽ AC AC AC AC
// │ ヽ / 〉 AC AC AC AC
// Y ` / / / AC AC AC AC
// 亻● . ● 〈 / / AC AC AC AC
// () へ | ＼〈 AC AC AC AC
// >- ._ ィ │ ／／ AC AC AC AC
// / へ / /＜| ＼＼ AC AC AC AC
// ヽ_/ (_／ │／／ AC AC AC AC
// 7 |／ AC AC AC AC
// ＞―r￣￣`-―＿/ AC AC AC AC
//**************************************Accepted*****************************************//
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define Unique(x) x.erase(unique(all(x)),x.end());
#define CIN_FILE "input.txt"
#define COUT_FILE "output.txt"
#define Pig (OO)
using namespace std;
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
const int Days[]={-1,31,28,31,30,31,30,31,31,30,31,30,31};
inline int read()
{
#define gc getchar
int ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
#undef gc
}
typedef long long ll;
int n,m;
vector<int> v[1010];
int vis[1010];
vector<int> path;
int indeg[1010],outdeg[1010];
bool edges[1010][1010];
bool OK()
{
memset(indeg,0,sizeof(indeg));
memset(outdeg,0,sizeof(outdeg));
for(int i=0;i<path.size();i++)for(int j=0;j<path.size();j++)
{
if(indeg[path[i]]>1||outdeg[path[j]]>1)return 0;
if(edges[path[i]][path[j]])indeg[path[i]]++,outdeg[path[j]]++;
}
for(int i=0;i<path.size();i++)if(indeg[path[i]]!=1||outdeg[path[i]]!=1)return 0;
return 1;
}
void pprint()
{
if(!OK())return;
cout<<path.size()<<endl;for(int i=0;i<path.size();i++)cout<<path[i]<<endl;
exit(0);
}
void DFS(int x)
{
path.pb(x);
vis[x]=2;
for(int i=0;i<v[x].size();i++)
{
if(vis[v[x][i]]==0)DFS(v[x][i]);
if(vis[v[x][i]]==2)pprint();
}
path.pop_back();
vis[x]=1;
}
int main(int argc, char const *argv[])
{
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
cin>>x>>y;
v[x].pb(y);
edges[x][y]=1;
}
for(int i=1;i<=n;i++)
{
memset(vis,0,sizeof(vis));
path.clear();
if(!vis[i])DFS(i);
}
cout<<-1;
//printf("Time used = %.12f",(double)(clock())/CLOCKS_PER_SEC);
return 0;
}
/* GOD BLESS */
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
const int n_max=1e3+10;
const int inf=INT_MAX/4;
vector<int> g[n_max];
vector<int> rg[n_max];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >>m;
rep(i,m){
int a,b;
cin >> a >> b;
--a;--b;
g[a].pb(b);
rg[b].pb(a);
}
int min_loop=inf;
int min_ind=-1;
{
rep(i,n){
vector<int> dp(n,inf);
queue<int> qu;
dp[i]=0;
qu.push(i);
while(!qu.empty()){
int v = qu.front();qu.pop();
for(auto nv:g[v]){
if(nv==i){
if(min_loop>dp[v]+1){
min_loop = dp[v]+1;
min_ind = i;
// cout << "minloop ind " << min_loop << " " << min_ind << endl;
}
}
if(dp[nv] > dp[v]+1){
dp[nv] = dp[v]+1;
qu.push(nv);
}
}
}
}
}
if(min_ind==-1){
cout << -1 << endl;
return 0;
}
else{
cout << min_loop << endl;
}
vector<int> dp(n,inf);
queue<int> qu;
dp[min_ind]=0;
qu.push(min_ind);
bool ok=true;
while(!qu.empty()){
int v = qu.front();qu.pop();
for(auto nv:g[v]){
if(nv==min_ind){
dp[min_ind]=dp[v]+1;
ok=false;
break;
}
if(dp[nv] > dp[v]+1){
dp[nv] = dp[v]+1;
qu.push(nv);
}
}
if(!ok) break;
}
// cout << "ind dp " << min_ind << endl;
// cout << dp[min_ind] << endl;
vector<int> ans;
ans.pb(min_ind);
while(ans.size()!=min_loop){
for(auto i:rg[min_ind]){
if(dp[i] == dp[min_ind]-1){
// cout << i << endl;
ans.pb(i);
min_ind = i;
break;
}
}
}
rep(i,min_loop){
cout << ans[i]+1 << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.end()) - arr.begin())
#define getbit(x, i) (((x) >> (i)) & 1)
template <typename T>
vector<T> readvector(size_t sz) {
vector<T> res(sz);
for (size_t i = 0; i < sz; ++i) {
cin >> res[i];
}
return res;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, " "));
return out;
}
int mylog(int n) {
return 63 - __builtin_clzll(n);
}
inline int binPow(int x, int deg, int mod) {
int ans = 1;
for (int i = sizeof(deg) * CHAR_BIT - 1; i >= 0; i--) {
ans *= ans;
ans %= mod;
if (getbit(deg, i)) ans *= x;
ans %= mod;
}
return ans;
}
/** Interface */
inline int readInt();
inline int readUInt();
inline void readWord(char *s);
inline int fast_readchar(); // you may use readchar() instead of it
inline void writeInt(int x);
inline void fast_writechar(int x); // you may use putchar() instead of it
inline void writeWord(const char *s);
inline void fast_flush();
// ====================== END ======================
const int MAXN = 2e6 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18;
void solve() {
int n;
cin >> n;
int cnt = 0;
int mn = 1e9;
for (auto e : readvector<int>(n)) {
cnt += e < mn;
mn = min(mn, e);
}
cout << cnt << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// t = readInt();
// cin >> t;
for (int i = 1; i <= t; ++i) {
// cout << "Case #" << i << ": ";
solve();
}
// fast_flush();
return 0;
}
/** Read */
static const int buf_size = 4096;
inline int fast_readchar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len) return -1;
return buf[pos++];
}
inline int readUInt() {
int c = fast_readchar(), x = 0;
while (c <= 32) c = fast_readchar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = fast_readchar();
return x;
}
inline int readInt() {
int s = 1, c = fast_readchar();
int x = 0;
while (c <= 32) c = fast_readchar();
if (c == '-') s = -1, c = fast_readchar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = fast_readchar();
return x * s;
}
inline void readWord(char *s) {
int c = fast_readchar();
while (c <= 32) c = fast_readchar();
while (c > 32) *s++ = c, c = fast_readchar();
*s = 0;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void fast_writechar(int x) {
if (write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
inline void fast_flush() {
if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
inline void writeInt(int x) {
if (x < 0) fast_writechar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n) s[n++] = '0' + x % 10, x /= 10;
while (n--) fast_writechar(s[n]);
}
inline void writeWord(const char *s) {
while (*s) fast_writechar(*s++);
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N;cin>>N;
int mini=N+1;
int ans=0;
for (int i = 0; i < N; i++){
int P;cin>>P;
if(P<=mini)ans++;
mini=min(mini,P);
}
cout<<ans<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int H, W;
const int di[] = {1, -1, 0, 0};
const int dj[] = {0, 0, 1, -1};
int main(void){
cin >> H >> W;
vector<vector<char>> m(H+2, vector<char>(W+2));
for(int i = 1; i <= H; i++){
for(int j = 1; j <= W; j++){
cin >> m[i][j];
}
}
bool ans = true;
for(int i = 1; i <= H; i++){
for(int j = 1; j <= W; j++){
if(m[i][j] == '#'){
if(m[i-1][j] == '.' && m[i+1][j] == '.' && m[i][j-1] == '.' && m[i][j+1] == '.') ans = false;
}
}
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
//UnionFind Template
struct UnionFind{ //構造体の定義
vector<int> d;
UnionFind(int n=0): d(n,-1) {} //コンストラクタ
int find(int x){
if(d[x]<0) return x;
return d[x]=find(d[x]);
}
bool unite(int x, int y){
x=find(x); y=find(y);
if(x==y) return false;
if(d[x]<d[y]) swap(x,y);//d[x] is smaller. Then, connect d[x] to d[y].
d[y]+=d[x];
d[x]=y;
return true;
}
bool same(int x, int y){
return find(x)==find(y);
}
int size(int x){
return -(d[find(x)]);
}
int rootsize(){
int cnt=0;
for(auto& v: d){
if(v<0) cnt++;
}
return cnt;
}
};
//How to use
//UnionFind uf(n); などと書けば使えるようになる.ufというobjectが生成される
//uf.unite(a,b);などで中の関数を使える
int main(){
int h,w; cin>>h>>w;
const vector<int> df={-1,1,w,-w};
vector<string> p(h);
rep(i,h) cin>>p[i];
UnionFind uf(h*w);
rep(i,h*w){
if(p[i/w][i%w]=='.') continue;
rep(j,4){
int a=i+df[j];
if(a<0 || a>=h*w || (a&w==0 && j==1) || (i%w==0 && j==0)) continue;
if(p[a/w][a%w]=='#') uf.unite(i,a);
}
}
bool ok=true;
rep(i,h*w){
if(uf.size(i)==1 && p[i/w][i%w]=='#') ok=false;
}
cout<<(ok? "Yes": "No")<<endl;
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int levenshtein(string a, string b) {
int alen = a.length(), blen = b.length();
int dp[alen+1][blen+1];
for (int i = 0; i <= alen; i++) dp[i][0] = i;
for (int j = 0; j <= blen; j++) dp[0][j] = j;
int l, m, r;
for (int i = 1; i <= alen; i++) {
for (int j = 1; j <= blen; j++) {
l = dp[i-1][j] + 1;
r = dp[i][j-1] + 1;
if (a[i-1] == b[j-1]) {
m = dp[i-1][j-1];
} else {
m = dp[i-1][j-1] + 1;
}
dp[i][j] = min(l, min(m, r));
}
}
return dp[alen][blen];
}
int main(void){
string s1, s2;
cin >> s1;
cin >> s2;
cout << levenshtein(s1, s2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount
#define INF INT_MAX/3
//#define N 2000
template<size_t N>
const bitset<N> operator+(const bitset<N>& lhs, const bitset<N>& rhs)
{
bitset<N> a(lhs), b(rhs), ret(lhs ^ rhs);
for (b = (a & b) << 1, a = ret; b.any(); b = (a & b) << 1, a = ret) ret ^= b;
return ret;
}
template<size_t N>
int edit_distance_bitset(const string& str1, const string& str2)
{
char s1[N] = { ' ' };
char s2[N] = { ' ' };
char *p1, *p2;
if (str1.size() >= str2.size()) { p1 = s1; p2 = s2; }
else { p1 = s2; p2 = s1; }
copy(str1.begin(), str1.end(), p1 + 1);
copy(str2.begin(), str2.end(), p2 + 1);
int m = strlen(s1);
int n = strlen(s2);
const bitset<N> ONE(1);
bitset<N> Peq[256];
bitset<N> Pv, Mv, Eq, Xv, Xh, Ph, Mh;
int Score = m;
for (int i = 0; i < m; i++) {
Peq[s1[i]] |= ONE << i;
Pv |= (ONE << i);
}
for (int j = 0; j < n; j++) {
Eq = Peq[s2[j]];
Xv = Eq | Mv;
Xh = (((Eq & Pv) + Pv) ^ Pv) | Eq;
Ph = Mv | ~(Xh | Pv);
Mh = Pv & Xh;
if ((Ph & (ONE << (m - 1))).any()) Score++;
else if ((Mh & (ONE << (m - 1))).any()) Score--;
Ph = Ph << 1 | ONE;
Pv = (Mh << 1) | ~(Xv | Ph);
Mv = Ph & Xv;
}
return Score;
}
int main(){
string a,b;
cin>>a>>b;
cout<<edit_distance_bitset<2000>(a,b)<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main(){
vector<string> s(3);
rep(i, 3) cin >> s[i];
int turn = 0;
while(true){
if(s[turn].empty()){
cout << char('A'+turn) << endl;
return 0;
}
int n_turn = s[turn][0] - 'a';
s[turn].erase(0, 1);
turn = n_turn;
}
return 0;
} | #define _GLIBCXX_DEBUG
#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>;
void solve()
{
int n, k;
cin >> n >> k;
int ans = 1;
rep(i, n)
{
ans = min(ans * 2, ans + k);
}
cout << ans << endl;
}
int main()
{
solve();
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
static const double pi = 3.141592653589793;
int main(){
ll N, M;
cin>>N>>M;
vector<ll> A(N);
map<ll, ll> B;
set<ll> Q;
B[0]=1;
ll Sum=0;
rep(i, N){
cin>>A[i];
Sum+=A[i];
Sum%=M;
Q.insert(Sum);
B[Sum]++;
}
ll Ans=0;
for (auto itr = Q.begin(); itr != Q.end(); ++itr) {
Ans+=B[*itr]*(B[*itr]-1)/2;
}
cout<<Ans<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define INF (1ll<<60)
#define mod 1000000007
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
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; }
vector<ll> sum;
void pre_process(vector<ll> &a,vector<ll> &s){//累積和のvector
ll n=(ll)a.size();
s.assign(n+1,0);
for(ll i=0;i<n;i++){
s[i+1]=s[i]+a[i];
}
}
ll query(ll i,ll j,vector<ll> &s){//区間[i,j]の和
return (s[j]-s[i]);
}
int main(){
ll n,m;cin>>n>>m;
vector<ll> a(n);
rep(i,n) cin>>a[i];
pre_process(a,sum);
vector<ll> cnt;
rep(i,n+1){
if(i==0) continue;
cnt.push_back(sum[i]%m);
}
sort(cnt.begin(),cnt.end());
cnt.push_back(-1ll);
ll num=1;
ll answer=0;
rep(i,cnt.size()-1){
if(cnt[i]==cnt[i+1]){
num++;
}else{
if(cnt[i]==0){
answer+=num*(num+1)/2;
}else{
answer+=(num-1)*num/2;
}
num=1;
}
}
cout<<answer<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> l(2*n);
for(int i=0; i<2*n; i++){
cin >> l[i];
}
sort(l.begin(),l.end());
long long int ans = 0;
for(int i=0; i<n; i++){
ans += l[2*i];
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int getResult(vector<int> &L, const int size){
sort(L.begin(), L.end());
int sum = 0;
for(int i = 0; i < size; i += 2){
sum += L[i];
}
return sum;
}
int main(){
int N;
cin >> N;
const int N2 = N * 2;
vector<int> L(N2);
for(int i = 0; i < N2; i++){
cin >> L[i];
}
int result = getResult(L, N2);
cout << result;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<P> G[1001][1001];
int dp[1001][1001];
vector<P> tp;
int dfs(int x,int y,int px=1000,int py=1000)
{
if(dp[x][y]!=0)return dp[x][y];
if(G[x][y].empty())return dp[x][y] = 1;
for(auto i:G[x][y])
{
dp[x][y] = max(dp[x][y],dfs(i.first,i.second,x,y)+1);
}
return dp[x][y];
}
int main()
{
int n;
cin >> n;
vector<vector<P>> input(n);
map<P,int> h;//入次数
for(int i = 0;i<n;i++)
{
for(int j = 0;j<n-1;j++)
{
int x=i;
int y;
cin >> y;
y--;
if(x>y)swap(x,y);
input[i].emplace_back(x,y);
}
}
for(int i = 0;i<n;i++)
{
for(int j =0;j<n-2;j++)
{
h[input[i][j+1]]++;
G[input[i][j].first][input[i][j].second].emplace_back(input[i][j+1]);
}
}
stack<P> S; //入次数がゼロの頂点
for(int i = 0;i<n;i++)
{
for(int j = i+1;j<n;j++)
{
if(h[P(i,j)]==0)
{
S.emplace(i,j);
}
}
}
while(S.size())
{
auto now = S.top();S.pop();
tp.push_back(now);
for(auto i:G[now.first][now.second])
{
h[i]--;
if(h[i]==0)S.emplace(i);
}
}
if(tp.size()!=n*(n-1)/2)
{
cout << -1 << endl;
return 0;
}
int ans = 0;
for(int i = 0;i<n;i++)
{
for(int j = i+1;j<n;j++)
{
ans = max(ans,dfs(i,j));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<queue<int>> a(n);
rep(i, n)
rep(j, n - 1)
{
int ipt;
cin >> ipt;
ipt--;
a[i].push(ipt);
}
set<pair<int, int>> s;
rep(i, n - 1)
{
int op = a[i].front();
if (i == a[op].front() && i < op)
s.emplace(i, op);
}
int ans = 0;
while (!s.empty())
{
ans++;
set<pair<int, int>> s2;
while (!s.empty())
{
auto p = *s.begin();
s.erase(s.begin());
a[p.first].pop();
a[p.second].pop();
if (!a[p.first].empty())
{
int op = a[p.first].front();
if (!a[op].empty() && p.first == a[op].front())
s2.emplace(min(p.first, op), max(p.first, op));
}
if (!a[p.second].empty())
{
int op = a[p.second].front();
if (!a[op].empty() && p.second == a[op].front())
s2.emplace(min(p.second, op), max(p.second, op));
}
}
s.swap(s2);
}
rep(i, n)
if (!a[i].empty())
{
puts("-1");
return 0;
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template<class T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int main() {
cin.tie(0)->sync_with_stdio(false);
ll a, b; cin >> a >> b;
ll n = gcd(a, b);
int res = 1;
for (ll i = 2; i * i < n; i++) {
if (n % i != 0) continue ;
res++;
while (n % i == 0)
n /= i;
}
if (n != 1) res++;
cout << res << '\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
// 素因数分解 O(√n)
// たとえば 60 = 2^2 x 3 x 5 だったら {(2, 2), (3, 1), (5, 1)} を返す
// 素因数の個数はlogn
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll p=2;p*p<=n;p++){
if(n%p!=0) continue;
int num=0; // 指数
while(n%p==0){
num++;
n/=p;
}
res.push_back({p,num});
}
if(n!=1) res.push_back({n,1});
return res;
}
int main(){
ll a,b;
cin>>a>>b;
ll g=gcd(a,b);
if(g==1){
cout<<1<<endl;
return 0;
}
auto pf=prime_factorize(g);
cout<<pf.size()+1<<endl;
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001
vi adj[2][N];
int vis[N];
int vit;
int wh[2][N];
void d1(int v){
vis[v] = vit;
wh[0][v] = vit;
FORR(i,adj[0][v]){
if(vis[i] != vit)
d1(i);
}
}
void d2(int v){
vis[v] = vit;
wh[1][v] = vit;
FORR(i,adj[1][v]){
if(vis[i] != vit)
d2(i);
}
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n,k,l;
sc(n,k,l);
int f,s;
while(k--){
sc(f,s);
--f,--s;
adj[0][f].pb(s);
adj[0][s].pb(f);
}
while(l--){
sc(f,s);
--f,--s;
adj[1][f].pb(s);
adj[1][s].pb(f);
}
FOR(i,0,n){
if(!vis[i]){
++vit;
d1(i);
}
}
memset(vis,0,n<<2);
FOR(i,0,n){
if(!vis[i]){
++vit;
d2(i);
}
}
map<pi,int> st;
FOR(i,0,n){
++st[mp(wh[0][i],wh[1][i])];
}
FOR(i,0,n){
cout << st[mp(wh[0][i],wh[1][i])] << ' ';
}
}
| #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
vector<int> pa, pb;
int find_roota(int x) {
if (pa[x] != x) pa[x] = find_roota(pa[x]);
return pa[x];
}
void unitea(int x, int y) {
int nx = find_roota(x);
int ny = find_roota(y);
if (nx == ny) return;
else if (nx > ny) pa[nx] = ny;
else pa[ny] = nx;
}
int find_rootb(int x) {
if (pb[x] != x) pb[x] = find_rootb(pb[x]);
return pb[x];
}
void uniteb(int x, int y) {
int nx = find_rootb(x);
int ny = find_rootb(y);
if (nx == ny) return;
else if (nx > ny) pb[nx] = ny;
else pb[ny] = nx;
}
int main() {
int n, k, l;
cin >> n >> k >> l;
pa = vector<int>(n);
pb = vector<int>(n);
for (int i = 0; i < n; i ++) pa[i] = pb[i]= i;
for (int i = 0; i < k; i ++) {
int x, y;
cin >> x >> y;
x --, y --;
unitea(pa[x], pa[y]);
}
for (int i = 0; i < l; i ++) {
int x, y;
cin >> x >> y;
x --, y --;
uniteb(pb[x], pb[y]);
}
for (int i = 0; i < n; i ++) {
find_roota(i);
find_rootb(i);
}
map<pair<int, int>, int> mp;
for (int i = 0; i < n; i ++) mp[make_pair(pa[i], pb[i])] ++;
for (int i = 0; i < n; i ++) {
if (i) cout << " ";
cout << mp[make_pair(pa[i], pb[i])];
}
cout << endl;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
bool isgood(vector<string> bd, int x, int y){
int cnt = 0;
//lateral direction
rep(i, 8)if(bd[x][i] == 'Q')cnt++;
if(cnt != 1)return false;
//longitudinal direction
cnt = 0;
rep(i, 8)if(bd[i][y] == 'Q')cnt++;
if(cnt != 1)return false;
// //diagonally upward
cnt = 0;
for(int i = 1; x+i < 8 && y+i < 8; ++i){
if(bd[x+i][y+i] == 'Q')return false;
}
for(int i = 1; x-i >= 0 && y-i >= 0; ++i){
if(bd[x-i][y-i] == 'Q')return false;
}
//diagonally downward
cnt = 0;
for(int i = 1; x+i < 8 && y-i >= 0; ++i){
if(bd[x+i][y-i] == 'Q')return false;
}
for(int i = 1; x-i >= 0 && y+i < 8; ++i){
if(bd[x-i][y+i] == 'Q')return false;
}
return true;
}
int main(){
ll k;
cin >> k;
vector<int> c(8, -1);
rep(i, k){
int r;
cin >> r;
cin >> c[r];
}
vector<ll> ary(8);
iota(ALL(ary), 0);
vector<string> board(8);
fill(ALL(board), "........");
do{
vector<string> board_cp = board;
vector<int> pos(8);
rep(i, 8){
if(c[i] < 0)pos[i] = ary[i];
else pos[i] = c[i];
board_cp[i][pos[i]] = 'Q';
}
bool isOk = true;
rep(i, 8){
isOk &= isgood(board_cp, i, pos[i]);
}
if(isOk){
board = board_cp;
break;
}
}while(next_permutation(ALL(ary)));
rep(i, 8){
rep(j, 8)cout << board[i][j];
cout << endl;
}
}
| #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>
using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T>inline bool chmax(T &a, T b){return (a < b ? a = b, true : false);}
template<typename T>inline bool chmin(T &a, T b){return (a > b ? a = b, true : false);}
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const long double EPS = 1e-9;
template<typename T>
class RangeUpdateQuery {
private:
vector<T> data, lazy;
vector<bool> valid, lazyFlag;
int sz;
void push(int k) {
if (this->lazyFlag[k]) {
this->valid[k] = true;
this->data[k] = this->lazy[k];
if (k * 2 + 2 < sz * 2 - 1) {
this->lazy[k * 2 + 1] = this->lazy[k * 2 + 2] = this->lazy[k];
this->lazyFlag[k * 2 + 1] = this->lazyFlag[k * 2 + 2] = true;
}
this->lazyFlag[k] = false;
}
}
void update(int l, int r, int L, int R, int k, T val) {
this->push(k);
if (L <= l && r <= R) {
this->lazy[k] = val;
this->lazyFlag[k] = true;
this->push(k);
} else if (r < L || R < l) {
return;
} else if (r - l > 1) {
const int mid = (l + r) / 2;
this->update(l, mid, L, R, k * 2 + 1, val);
this->update(mid, r, L, R, k * 2 + 2, val);
}
}
T query(int l, int r, int idx, int k) {
this->push(k);
if (r - l == 1) {
if (!valid[k]) {
throw exception();
}
return this->data[k];
} else if (l <= idx && idx <= r) {
const int mid = (l + r) / 2;
if (idx < mid) {
return this->query(l, mid, idx, k * 2 + 1);
} else {
return this->query(mid, r, idx, k * 2 + 2);
}
}
}
public:
RangeUpdateQuery(const int n) {
this->sz = 1;
while (this->sz < n) this->sz <<= 1;
this->data.resize(this->sz * 2 - 1);
this->lazy.resize(this->sz * 2 - 1);
this->valid.resize(this->sz * 2 - 1, false);
this->lazyFlag.resize(this->sz * 2 - 1, false);
}
void update(int l, int r, T val) {
this->update(0, sz, l, r, 0, val);
}
T query(int idx) {
return this->query(0, sz, idx, 0);
}
};
int main() {
int n, q;
cin >> n >> q;
RangeUpdateQuery<int> ruq(n);
while (q--) {
int num; cin >> num;
if (num) {
int idx; cin >> idx;
try {
cout << ruq.query(idx) << endl;
} catch (exception e) {
cout << (1ll << 31) - 1 << endl;
}
} else {
int s, t, x;
cin >> s >> t >> x;
ruq.update(s, t + 1, x);
}
}
} | 0 |
#include <bits/stdc++.h>
#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 1e6 + 10;
char S[N], T[N];
int n;
int delt[N];
int main(){
scanf("%d%s%s", &n, S + 1, T + 1);
bool flag = true;
For(i, 1, n) if(S[i] ^ T[i]){
flag = false;
break;
}
if(flag){
puts("0");
return 0;
}
int ans = 0, cnt = 0, d = 0;
int j = n;
Forr(i, n, 1){
cnt -= delt[i + d], delt[i + d] = 0;
ans = max(ans, cnt + 1);
//printf("%d %d %d\n", i, d, cnt);
if(T[i] == T[i - 1]) continue;
if(j > i) j = i;
while(j && S[j] != T[i]) --j;
if(!j){
puts("-1");
return 0;
}
++cnt, ++d;
delt[j - 1 + d]++;
}
printf("%d\n", ans);
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
/*
* coder :: ATUL_PANDEY_2608
* >>> INDIA <<<
*/
using namespace std;
using namespace __gnu_pbds;
// #define part ..
#define pb(a) push_back(a)
#define all(a) a.begin(),a.end()
#define mod 1000000007
//#define maxx 200006
#define ll long long
#define quick ios_base::sync_with_stdio(NULL),cin.tie(0);
#define listll vector< long long >
#define listi vector< int>
#define pii pair<int , int>
#define pll pair<long long , long long >
#define minheap priority_queue<long long , vector< long long >, greater<long long > >
#define rep(i,a,b) for(int i=a;i<b;i++)
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
template < class T > using oset = tree< T , null_type, less < T > , rb_tree_tag , tree_order_statistics_node_update > ;
// end of #define
// define globals ...
const int maxx = 2e5+26;
//write function from here ...
int Main(){
int n =3;
ll arr[n];
for(int i=0 ; i <n;i++)
cin>>arr[i];
sort(arr,arr+n);
int cnt =0 ;
for(int i=0;i<=1;i++)
{
if(arr[i]==arr[i+1])
cnt++;
}
if(cnt==1)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
}
int main(){
quick;
int t =1;
//cin>>t;
while(t-- )
Main();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) reps(i, 0, n)
#define REPS(i, a, b) reps(i, a, b)
#define REP(i, n) rep(i, n)
#define deps(i, a, b) for (int i = a; i >= b; --i)
#define dep(i, n) deps(i, n, 0)
#define DEPS(i, a, b) deps(i, a, b)
#define DEP(i, n) dep(i, n)
#define pf push_front
#define pb push_back
#define mp make_pair
#define fst first
#define FST fst
#define sec second
#define SEC sec
#define sz(obj) ((int)(obj).size())
#define all(v) (v).begin(), (v).end()
#define ALL(v) all(v)
const int INF = 999999999;
const int MOD = 1e9 + 7;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; std::cin >> x; return x;}
template <typename T>
void print(std::vector<T>& v, char c = ' ') {
REP(i, v.size()) {
if (i != 0) std::cout << c;
std::cout << v[i];
}
std::cout << endl;
}
template <typename T> void print(T x) { std::cout << x << '\n'; }
signed main()
{
vi v(4);
rep(i, 4) v[i] = in();
sort(all(v));
print(v[1] + v[2] + v[3] + max(in(), in()));
return (0);
} | #include<stdio.h>
#include<string.h>
int main(){
int r=0,a[4],b[2],i,s=100,nf;
scanf("%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&b[0],&b[1]);
for(i=0;i<4;i++){
if(s>=a[i]){
s=a[i];
nf=i;
}
}
for(i=0;i<4;i++){
if(i!=nf){
r+=a[i];
}
}
if(b[0]>b[1]){
r+=b[0];
}else{
r+=b[1];
}
printf("%d\n",r);
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
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);
sort(K,K+10);
int max1,max2;
max1=max2=0;
max1=W[9]+W[8]+W[7];
max2=K[9]+K[8]+K[7];
cout<<max1<<" "<<max2<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve()
{
int a,b;
cin>>a>>b;
return a*b;
}
int main()
{
int t;
t=1;
while(t--)
{
cout<<solve()<<'\n';
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
int len=0;
sort(a,a+n);
for(int i=n-1;i>=n-k;i--){
len+=a[i];
}
cout << len << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T>
inline void chmax(T& a, T b) {
a = std::max(a, b);
}
template <class T>
inline void chmin(T& a, T b) {
a = std::min(a, b);
}
#define mod (ll)(1e9 + 7)
// #define mod (998244353ll)
const long long INF = 1LL << 60;
struct UnionFind {
vector<int> parent;
vector<int> num_node;
UnionFind(int N) : parent(N), num_node(N, 1) {
for (int i = 0; i < N; i++) {
parent[i] = i;
}
}
// 根を求める
int root(int x) {
if (parent[x] == x) {
return x;
}
// 経路圧縮
parent[x] = root(parent[x]);
return parent[x];
}
// 同一判定
bool is_same(int x, int y) {
return this->root(x) == this->root(y);
}
// 併合
void unite(int x, int y) {
x = this->root(x);
y = this->root(y);
// すでに一緒ならなにもしない
if (x == y) {
return;
}
parent[x] = y;
num_node[y] += num_node[x];
}
// 同一グループのノード数
int size(int x) {
return num_node[root(x)];
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll h, w;
cin >> h >> w;
vs s(h);
rep(i, h) {
cin >> s[i];
}
ll n = h * w;
UnionFind uf(n);
vector<vb> visited(h, vb(w));
rep(i, n) {
ll y = i / w;
ll x = i % w;
if (visited[y][x]) {
continue;
}
queue<P> q;
q.push(make_pair(y, x));
while (!q.empty()) {
auto it = q.front();
q.pop();
ll v = it.first * w + it.second;
uf.unite(i, v);
ll y = it.first;
ll x = it.second;
if (y > 0) {
if (!visited[y - 1][x] && s[y - 1][x] != s[y][x]) {
q.push(make_pair(y - 1, x));
visited[y - 1][x] = true;
}
}
if (y < h - 1) {
if (!visited[y + 1][x] && s[y + 1][x] != s[y][x]) {
q.push(make_pair(y + 1, x));
visited[y + 1][x] = true;
}
}
if (x > 0) {
if (!visited[y][x - 1] && s[y][x - 1] != s[y][x]) {
q.push(make_pair(y, x - 1));
visited[y][x - 1] = true;
}
}
if (x < w - 1) {
if (!visited[y][x + 1] && s[y][x + 1] != s[y][x]) {
q.push(make_pair(y, x + 1));
visited[y][x + 1] = true;
}
}
}
}
vector<P> vp(n);
rep(i, n) {
ll y = i / w;
ll x = i % w;
if (s[y][x] == '.')
vp[uf.root(i)].first++;
else
vp[uf.root(i)].second++;
}
ll ans = 0;
rep(i, n) {
ans += vp[i].first * vp[i].second;
}
cout << ans << endl;
return 0;
}
| 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int A, B;
string S;
int check = 1;
cin >> A >> B >> S;
for (int i = 0; i < A; i++) {
if (S[i] < 48) check = 0;
}
if (S[A] != '-') check = 0;
for (int i = A + 1; i < B + A + 1; i++) {
if (S[i] < 48) check = 0;
}
if (check == 1) {
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 < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int a,b,k;cin>>a>>b>>k;
rep(i,k){
if(i%2==0){
if(a%2==1){
a--;
}
a/=2;
b+=a;
}
else {
if(b%2==1){
b--;
}
b/=2;
a+=b;
}
}
cout<<a<<" "<<b<<endl;
} | 0 |
#if 0
2019.12.30
朴素 dp 设 f[i][p][q] 表示前 i 次操作后当前棋子为 (p, q) 的最小代价。
事实上由于第 i 次操作后一定有一个棋子是 x[i] ，因此可以优化一维：
f[i][j] 表示前 i 次操作后当前棋子为 (j, x[i]) 的最小代价。
转移有两种：
1) f[i - 1][j] + |x[i - 1] - x[i]| -> f[i][j]
2) min(f[i - 1][k] + |x[i] - k|) -> f[i][x[i - 1]]
用线段树维护 f[~][j] ，第一种转移就是全局加，第二种是单点取 min 。
第二种转移可以把左边的绝对值拆开：
f[i - 1][k] - k + x[i] (k < x[i])
f[i - 1][k] (k = x[i])
f[i - 1][k] + k - x[i] (k > x[i])
线段树分别维护 f[~][j] - j, f[~][j], f[~][j] + j 即可。
#endif
#include <cstdio>
#include <algorithm>
#define debug(...) fprintf(stderr, __VA_ARGS__)
typedef long long ll;
struct {
inline operator int () { int x; return scanf("%d", &x), x; }
inline operator ll () { ll x; return scanf("%lld", &x), x; }
template<class T> inline void operator () (T &x) { x = *this; }
template<class T, class ...A> inline void operator () (T &x, A &...a)
{ x = *this; this -> operator ()(a...); }
} read;
const int maxn = 200005;
ll f[maxn << 2], fa[maxn << 2], fb[maxn << 2], tag;
void modify(int now, int L, int R, int p, ll x) {
f[now] = std::min(f[now], x);
fa[now] = std::min(fa[now], x + p);
fb[now] = std::min(fb[now], x - p);
if(L == R) return;
int M = (L + R) >> 1;
if(p <= M) modify(now << 1, L, M, p, x);
else modify(now << 1 | 1, M + 1, R, p, x);
}
void build(int now, int L, int R) {
f[now] = fa[now] = fb[now] = 1000000000000000000;
if(L == R) return;
int M = (L + R) >> 1;
build(now << 1, L, M);
build(now << 1 | 1, M + 1, R);
}
ll query(int now, int L, int R, int p) {
if(R < p) return p + fb[now];
if(L > p) return fa[now] - p;
if(L == R) return f[now];
int M = (L + R) >> 1;
return std::min(query(now << 1, L, M, p), query(now << 1 | 1, M + 1, R, p));
}
int main() {
int n = read, q = read, a = read, b = read;
build(1, 1, n);
modify(1, 1, n, a, 0);
/* modify(1, 1, n, b, 0); */
int last = b;
while(q --) {
int x = read;
ll qu = query(1, 1, n, x) + tag;
/* debug("qu = %lld\n", qu); */
tag += std::abs(x - last);
modify(1, 1, n, last, qu - tag);
last = x;
/* debug("tag=%lld\n", tag); */
}
printf("%lld\n", f[1] + tag);
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
printf("%3f",n*2*M_PI);
} | 0 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC return 0;
using namespace std;
string s;
int res;
int main() {
DAU
cin >> s;
s = '0' + s;
for (int i = (int)s.size() - 1; i > 0; --i) {
if (s[i] <= '4' || (s[i] == '5' && s[i-1] < '5'))
res += s[i] - '0';
else {
res += '9' + 1 - s[i];
++s[i-1];
}
}
res += s[0] - '0';
cout << res;
PLEC
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
s.at(3) = '8';
cout << s << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
//#include "toollib.h"
//#include "puzzle.h"
#define INT_MAX 2147483647
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#pragma warning (disable:4018)
#pragma warning (disable:4244)
#pragma warning (disable:4996)
using namespace std;
typedef long long int lint;
//***** Main Program *****
int main() {
int n, q;
cin >> n;
vector<int> S(n);
Loop(i, n) cin >> S[i];
cin >> q;
vector<int> T(q);
Loop(i, q) cin >> T[i];
int ret = 0;
Loop(i, q) {
Loop(j, n) {
if (S[j] == T[i]) {
ret++;
break;
}
}
}
cout << ret << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void init(vector<int>& v){
int n = 0;
int input;
cin >> n;
for(int i = 0; i < n; i++){
cin >> input;
v.push_back(input);
}
sort(v.begin(), v.end());
v.erase( unique(v.begin(), v.end()), v.end() );
}
int linearsearch(int key, vector<int> t, int count){
int i = 0;
t.push_back(key);
while(t[i]!=key){
i++;
}
if(t.size()-1!=i) return count+1;
else return count;
}
int main(int argc, char* argv[]){
vector<int> a, b;
int count = 0;
init(a);
init(b);
for (auto i : a) count = linearsearch(i, b, count);
cout << count << endl;
} | 1 |
#include <stdio.h>
int main(void){
int i;
scanf("%d", &i);
i = i*i*i;
printf("%d\n", i);
} | #include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[])
{
int n = 0, n2 = 0;
cin >> n;
//n = atoi(argv[1]);
if(n < 1 || n > 100) {
return 1;
}
n2 = pow(n, 3.0);
cout << n2 << endl;
}
| 1 |
///_________________________________ B I S M I L L A H I R R A H M A N I R R A H I M __________________________________________________
#include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typedef long long int ll;
typedef unsigned long long ull;
typedef double dd;
typedef string str;
#define vli vector<li>
#define vll vector<ll>
#define sli set<li>
#define sll set<ll>
#define pli pair<li, li>
#define pll pair<ll, ll>
#define vpi vector<pair<li, li>>
#define vpl vector<pair<ll, ll>>
#define mpl map<ll, ll>
#define test ll t; cin>>t; while(t--)
#define input(a,n) for(int i=0;i<n;i++) cin>>a[i];
#define lp(a, i, b) for(ll i=a; i<b; i++)
#define rlp(a, i, b) for(ll i=a; i>=b; i--)
#define sz(x) x.size()
#define len(z) z.begin(), z.end()
#define ci(x) cin>>x;
#define co(x) cout<<x nl
#define fix(x) fixed<<setprecision(x)
#define mem(z, l) memset(z, l, sizeof(z))
#define MP make_pair
#define pb push_back
#define F first
#define S second
#define nl <<endl
#define nll cout<<endl
#define sp <<" "<<
#define sl <<" "
#define cy cout<<"YES" nl
#define cn cout<<"NO" nl
#define rn return
#define good_bye return 0
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define input_txt() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
const ll MOD = 1e+7;
const double PI = 3.141592653589793238462643383279;
int dx[] = {0, 0, +1, -1, +1, +1, -1, -1};
int dy[] = {+1, -1, 0, 0, +1, -1, +1, -1};
//ll Pow(ll P, ll Q) { ll R=1; for(ll I=1; I<=Q; I++) R*=P; rn R; }
//ll fact(ll N) { ll M=1; for(ll I=1; I<=N; I++) M*=I; return M; }
//void dfs(ll K) { vis[K]=true; for(auto J: v[K]) { if(!vis[J]) dfs(J); } }
//void bfs(ll s) { queue<ll>q; q.push(s); while(!q.empty()) { ll u=q.front(); q.pop(); for(auto i : v[u]) if(lev[i]==-1) { lev[i]=lev[u]+1; q.push(i); } } }
//void sieve(ll MX) { S.pb(2); for(ll I=3; i<=MX; i+=2) { if(!vis[I]) { S.pb(I); for(ll J=I*I; j<=MX; J+=(2*I)) vis[J]=true; } } }
//bool isPrime(ll n) { if(n%2==0) rn false; for(ll i=3; i*i<=n; i+=2) { if(n%i==0) rn false; } rn true; }
///_____________________________________________ L E T ' S B E G I N __________________________________________________________________________
const int mX = 1e6+123;
ll n, l, i=0;
str s;
void case_i()
{
cin>>n>>s; l=sz(s);
while(i<min(l, n)) { cout<<s[i]; i++; }
if(l>n) cout<<"...";
nll;
}
int main()
{
// input_txt();
faster; // test
case_i();
good_bye;
}
// author : 5 A 1 F U D D 1 N 5 A 8 8 1 R
///|||||||||||||||||||||||||||||||||||||||||||||||||||||| E N D ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| #pragma region Macros
#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 < a) { a = b; return true; } return false; }
constexpr int dx[4] = {-1, 0, 0, 1}, dy[4] = {0, -1, 1, 0};
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
constexpr double EPS = 1e-10;
constexpr double PI = M_PI;
#pragma endregion
void solve() {
int a, b;
cin >> a >> b;
vector<string> res(100);
for (int i=0; i<100; i++) {
for (int j=0; j<100; j++) {
if (i < 50) res.at(i).push_back('.');
else res.at(i).push_back('#');
}
}
int x = 0, y = 0;
for (int i=0; i<b-1; i++) {
res.at(x).at(y) = '#';
y += 2;
if (y >= 100) {
x += 2;
y = 0;
}
}
x = 51, y = 0;
for (int i=0; i<a-1; i++) {
res.at(x).at(y) = '.';
y += 2;
if (y >= 100) {
x += 2;
y = 0;
}
}
cout << 100 << ' ' << 100 << '\n';
for (string s : res) cout << s << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
solve();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
long l, r;
cin>>l >>r;
long ans=2019;
for(long i=l+1;i<=r;i++){
for(long k=l;k<i;k++){
long a=(i*k)%2019;
ans=min(ans,a);
if(ans==0){
cout<<ans<<endl;
return 0;
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 510000;
// https://drken1215.hatenablog.com/entry/2018/06/08/210000
ll fac[MAX], finv[MAX], inv[MAX];
void combinationInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll combination(ll n, ll k) {
if (n < k) {
return 0;
} else if (n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<pair<ll, ll>> primeFactorize(ll n) {
vector<pair<ll, ll>> r;
for (int i = 2; i * i <= n; i++) {
if (n % i != 0) {
continue;
}
int ex = 0;
while (n % i == 0) {
ex++;
n /= i;
}
r.push_back({i, ex});
}
if (n > 1) {
r.push_back({n, 1});
}
return r;
}
int main() {
ll n, m;
cin >> n >> m;
auto res = primeFactorize(m);
ll v = 1;
combinationInit();
for (ll i = 0; i < res.size(); i++) {
v *= combination(res[i].second + n - 1, n - 1);
v %= MOD;
}
cout << v << endl;
}
| 0 |
# include <bits/stdc++.h>
# define ll long long
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
int main()
{
int N; cin >> N;
vector<ll> A(N); rep (i, N) cin >> A[i];
vector<ll> B(N); rep (i, N) cin >> B[i];
vector<ll> C(N); rep (i, N) cin >> C[i];
sort(A.begin(), A.end());
sort(B.begin(), B.end());
sort(C.begin(), C.end());
vector<ll> sums(N+1);
sums[0] = 0;
rep (i, N)
{
ll b = B[i];
auto c = upper_bound(C.begin(), C.end(), b);
sums[i+1] = sums[i] + distance(c, C.end());
}
ll cnt = 0;
rep (i, N)
{
ll a = A[i];
auto b = upper_bound(B.begin(), B.end(), a);
ll index = distance(B.begin(), b);
cnt += sums[N] - sums[index];
}
cout << cnt << endl;
return 0;
}
| #include<iostream>
using namespace std;
struct Dice{
int s[6];
void roll(char c){
int b;
if(c=='E'){
b=s[0];
s[0]=s[3];
s[3]=s[5];
s[5]=s[2];
s[2]=b;
}
if(c=='W'){
b=s[0];
s[0]=s[2];
s[2]=s[5];
s[5]=s[3];
s[3]=b;
}
if(c=='N'){
b=s[0];
s[0]=s[1];
s[1]=s[5];
s[5]=s[4];
s[4]=b;
}
if(c=='S'){
b=s[0];
s[0]=s[4];
s[4]=s[5];
s[5]=s[1];
s[1]=b;
}
}
int top() {
return s[0];
}
};
int main(){
Dice d;
for(int i=0;i<6;i++) cin >> d.s[i];
string s;cin >> s;
for(int i=0;i<s.size();i++) d.roll(s[i]);
cout << d.top() << endl;
return 0;
}
| 0 |
#pragma once
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#define rep(i,n) for(auto i=0;i<(n);i++)
#define all(vs) (vs).begin(),(vs).end()
#define roundup(A,B) (A)/(B)+((A)%(B)==0?0:1)
#define read(type,name) type name;cin>>name
using namespace std;
/*
予想と答えをすべて比較するのが最速。O(n)
*/
void A() {
string s, t;
cin >> s >> t;
int answer = 0;
rep(i, s.length()) {
if (s[i] == t[i])answer++;
}
cout << answer << endl;
}
/*
タップを使うごとにA-1ずつ増える。Bと1の距離をA-1で割った（切り上げ）のが答え。
A,Bの値によらないのでO(1)の解法である。
*/
void B() {
int A, B; cin >> A >> B;
cout << roundup(B-1, A-1) << endl;
}
/*
左から走査することで最大長を求めることができる。最大長を0で初期化し、
左端からスタートする。右に進める限り現在の長さをincrementし、進めなくなったところで最大長を更新する。
そして止まったところからリセットして再開する。これを繰り返すことで最大長を求めることができる。
計算量はO(n)、空間量はO(1)となる。
*/
void C() {
int n; cin >> n;
int length = 0, max_length = 0;
int prev = 0, current;
rep(i, n) {
cin >> current;
if (prev >= current) {
length++;
} else {
max_length = max(max_length, length);
length = 0;
}
prev = current;
}
max_length = max(max_length, length);
cout << max_length << endl;
}
/*
剰余を最大にするのは、MをM+1で割った場合であるから、
iに対して1つずれた順列を作れば最適である。配列の最後Nについては、
N+1を用意することはできないので、1で剰余を取る（必ず10になる）。
このやり方で和を求めた場合は、1からN-1までの和に等しいので(N-1)(N)/2となる。
->これが最大っていうのはどうわかるの?
*/
void D() {
read(int, n);
cout << n * (n - 1) / 2 << endl;
}
/*
総当たりで調べてO(N^2)を試してみよう
*/
struct Player {
queue<int> versus{};
bool available{ true };
bool matchable(int i) {
return available && versus.front() == i;
}
};
void E() {
read(int, n);
auto ps = vector<Player>(n);
rep(i, n) {
rep(j, n - 1) {
read(int, p);
ps[i].versus.push(p - 1);
}
}
int days = 0;
int remains = n;
while (true) {
bool matched = false;
rep(i, ps.size()) {
if (!ps[i].available||ps[i].versus.empty())continue;
auto v = ps[i].versus.front();
if (ps[v].matchable(i)) {
matched = true;
ps[i].versus.pop(); ps[i].available = false; if (ps[i].versus.empty()) remains--;
ps[v].versus.pop(); ps[v].available = false; if (ps[v].versus.empty()) remains--;
}
}
for (auto& p : ps)p.available = !p.versus.empty();
days++;
if (remains == 0) {
cout << days << endl;
return;
}
if (!matched) {
cout << -1 << endl;
return;
}
}
}
int main() {
E();
}
| #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define MOD (long long int)(998244353)
#define ll long long int
#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 REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
ll mpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
if(kaijo_memo.size() > n) return kaijo_memo[n];
if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
return gyaku_kaijo_memo[n];
}
ll nCr(ll n, ll r){
if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
if(n < r || r < 0) return 0;
ll ret = 1;
ret *= kaijo(n); ret %= MOD;
ret *= gyaku_kaijo(r); ret %= MOD;
ret *= gyaku_kaijo(n-r); ret %= MOD;
return ret;
}
vector<ll> G[(int)1e5+2];
bool checked[(int)1e5+2];
int color[(int)1e5+2];
bool saiki(int now, int col){
if(checked[now]){
return color[now] == col;
}
checked[now] = true;
color[now] = col;
rep(j, G[now].size()){
int next = G[now][j];
if(!saiki(next, (col+1) & 1)){
return false;
}
}
return true;
}
int main(void){
fast_io
cout<<fixed<<setprecision(15);
ll n,m;
cin>>n>>m;
rep(i,m){
ll a,b;cin>>a>>b;a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
if(!saiki(0, 0)){
cout<< n * (n-1) / 2 - m << endl;
return 0;
}
ll C0 = 0, C1 = 0;
rep(i,n){
if(color[i] == 0){
C0++;
}else{
C1++;
}
}
cout<< C0 * C1 - m <<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
int mx = -1000, mn = 1000;
rep(i, n){
int in;
cin >> in;
mx = max(mx, in);
}
rep(i, m){
int in;
cin >> in;
mn = min(mn, in);
}
bool f = false;
if(mx >= mn) f = true;
if(mn <= x || y < mn) f = true;
if(f == false) cout << "No ";
cout << "War" << endl;
return 0;
} | #include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
static char buf[20];
int len=0;
if(x<0)putchar('-'),x=-x;
for(;x;x/=10)buf[len++]=x%10+'0';
if(!len)putchar('0');
else while(len)putchar(buf[--len]);
}
inline void writesp(ll x){write(x); putchar(' ');}
inline void writeln(ll x){write(x); putchar('\n');}
int a[maxn];
int n,m;
int main()
{
n=read(); m=read();
if(m==1){
writeln(n);
if(n==1){
writeln(1);
writeln(n);
}
else{
writeln(2);
writesp(n-1); writeln(1);
}
return 0;
}
int cnt=0;
for(int i=1;i<=m;i++){
a[i]=read();
cnt+=(a[i]&1);
}
if(cnt>2){
puts("Impossible"); return 0;
}
int flag=0;
for(int i=1;i<=m;i++)
if(a[i]&1){
if(!flag)std::swap(a[1],a[i]),flag=1;
else std::swap(a[m],a[i]);
}
for(int i=1;i<=m;i++)
writesp(a[i]);
putchar('\n');
if(a[1]==1){
writeln(m-1);
for(int i=2;i<m;i++)
writesp(a[i]);
writeln(a[m]+1);
}
else{
writeln(m);
writesp(a[1]-1);
for(int i=2;i<m;i++)
writesp(a[i]);
writeln(a[m]+1);
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0, before;
cin >> before;
bool HasNoAns = (before > 0);
for (int i = 1; i < N; i++) {
int now;
cin >> now;
if (now == 0) {
before = now;
continue;
}
if (now == before + 1) ans++;
else {
if (now <= before) ans += now;
else HasNoAns = true;
}
before = now;
}
cout << (HasNoAns ? -1 : ans) << endl;
} | #include <iostream>
using namespace std;
int main(void) {
long a, n, min, max;
long sum = 0;
cin >> n;
cin >> a;
max = a;
min = a;
sum += a;
for(int i = 1; i < n; ++i) {
cin >> a;
if(a < min) {
min = a;
}
if(a > max) {
max = a;
}
sum += a;
}
cout << min << ' ' << max << ' ' << sum << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
ll n,x,t;
cin>>n>>x>>t;
if(n%x)
{
cout<<(n/x + 1)*t<<'\n';
}
else
{
cout<<(n/x)*t<<'\n';
}
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string>
#include <vector>
#include <cctype>
#include <cstdio>
#include <iomanip>
using namespace std;
string in, t;
double a, b, c, d;
int main(){
cin >> a >> c >> b >> d;
cout << fixed << setprecision(5) << sqrt(fabs(a - b)*fabs(a - b)*1.0 + fabs(c - d)*fabs(c - d)*1.0) << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
double a[n];
pair<int,int>p[n];
int fac[20][20]={};
for(int i=0;i<n;i++){
cin>>a[i];
long long x=(a[i]+0.0000000001)*1000000000;
int two=0,five=0;
while(x%2==0)two++,x/=2;
while(x%5==0)five++,x/=5;
two=min(18,two),five=min(18,five);
fac[two+1][five+1]++;
p[i]={18-two,18-five};
}
for(int i=0;i<20;i++)for(int j=0;j<19;j++)fac[i][j+1]+=fac[i][j];
for(int i=0;i<20;i++)for(int j=0;j<19;j++)fac[j+1][i]+=fac[j][i];
long long ans=0;
for(int i=0;i<n;i++){
int x=fac[19][19]-fac[p[i].first][19]-fac[19][p[i].second]+fac[p[i].first][p[i].second];
if(p[i].first<10 && p[i].second<10)x--;
ans+=x;
}
cout<<ans/2<<endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <map>
#include <utility>
using ll = long long ;
#define MAXN 200009
#define MAXL 29
std::map<std::pair<int,int>, int> bucket;
class Rat
{
private:
int cofp2,cofp5;
public:
Rat(){}
Rat(ll nn,ll dd)
{
ll tn = nn;
ll td = dd;
cofp2 = 0;
while( tn%2==0){
cofp2++;
tn/=2;
}
while(td%2==0){
cofp2--;
td/=2;
}
cofp5=0;
while(tn%5==0){
cofp5++;
tn/=5;
}
while(td%5==0){
cofp5--;
td/=5;
}
}
void output()
{
printf("2^{%d}*5^{%d}\n",cofp2,cofp5);
}
int getcofp2()
{
return cofp2;
}
int getcofp5()
{
return cofp5;
}
};
int main(void)
{
char theNumber[MAXL];
int N,i,j;
scanf("%d",&N);
Rat *a ;
for (i=0;i<N;i++){
scanf("%s",theNumber);
char* ret = strchr(theNumber,'.');
if (ret==NULL){
a = new Rat(atoi(theNumber),1);
} else {
int lenOfDen = strlen(&theNumber[ret-&theNumber[0]+1]);
ll den = pow(10,lenOfDen);
ll num = atoi(theNumber)*den
+atoi(&theNumber[ret-&theNumber[0]+1]);
a = new Rat(num,den);
}
bucket[std::make_pair(a->getcofp2(),a->getcofp5())] ++;
}
ll s=0;
for (auto it:bucket) {
int x1 = it.first.first;
int y1 = it.first.second;
int r1 = it.second;
for (auto it2:bucket) {
int x2 = it2.first.first;
int y2 = it2.first.second;
int r2 = it2.second;
if(x1+x2>=0 && y1+y2>=0)
{
if(it<it2){
s+=((ll)r1)*r2;
} else if (it==it2) {
s+=((ll)r1*(r1-1))/2;
}
}
}
}
printf("%lld\n",s);
return 0;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
#define int long long
int read(){
int s = 0,ne = 1; char c = getchar();
while(c < '0' || c > '9') ne = c == '-' ? -1 : 1, c = getchar();
while(c >= '0' && c <= '9') s = (s << 1) + (s << 3) + c - '0', c = getchar();
return s * ne;
}
int n, ai, sum = 0, mx = 0;
signed main(){
n = read(); for(int i = 1; i <= n; i++) ai = read(), mx = max(mx, ai), sum += mx - ai;
printf("%lld", sum);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int a[N];
int main(){
int n;cin>>n;
ll sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=1;i<n;i++){
if(a[i]<a[i-1])
sum+=a[i-1]-a[i],a[i]=a[i-1];
}
cout<<sum<<endl;
return 0;
} | 1 |
#include <stdio.h>
int main (){
char tanggal[20];
scanf("2017/01/%s",tanggal);
printf("2018/01/%s",tanggal);
return 0;
} | #include <stdio.h>
int main()
{
char op[11];
int ans[2];
scanf("%s", op);
for (int i = 8 ; i <= 9 ; i++){
ans[i-8] = op[i]-48;
}
printf("2018/01/%d%d", ans[0], ans[1]);
return 0;
}
| 1 |
#include<bits/stdc++.h>
const int N = 5005;
const long long inf = 1e18;
using namespace std;
typedef pair <int, int> ii;
vector <ii> mv;
int n, ans;
long long dp[N][N], Min[N];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++){
int x, y; cin >> x >> y;
x += y;
mv.push_back(ii(x, y));
}
sort(mv.begin(), mv.end());
for (int i = 0; i < N; i++) Min[i] = inf;
Min[0] = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j >= 1; j--){
if (mv[i-1].first - mv[i-1].second >= Min[j-1]) dp[i][j] = Min[j-1] + mv[i-1].second;
else dp[i][j] = inf;
Min[j] = min(Min[j], dp[i][j]);
if (dp[i][j] != inf) ans = max(ans, j);
}
}
cout << ans;
}
| #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, a[15], x[15][15], y[15][15];
int cnt(int i)
{
if (!i) return 0;
return (i & 1) + cnt(i >> 1);
}
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
for (int j = 0; j < a[i]; j++)
{
cin >> x[i][j] >> y[i][j];
}
}
int ans = 0;
for (int bit = 0; bit < (1 << n); bit++)
{
int ok = 1;
for (int i = 0; i < n; i++)
{
if ((bit >> i) & 1)
{
for (int j = 0; j < a[i]; j++)
{
if (((bit >> (x[i][j] - 1)) & 1) ^ y[i][j]) ok = 0;
}
}
}
if (ok) ans = max(ans, cnt(bit));
}
cout << ans << "\n";
} | 0 |
//Name: Space Coconut Crab
//Level: 2
//Category: 数学,探索
//Note:
/**
* zの範囲は0≦z≦E^(1/3)、yの範囲は0≦y≦E^(1/2)で表される。
* zとyが決まればxも一意に決まるので、zとyを全探索し、x,y,z≧0を満たすような組み合わせについてx+y+zの最小値を求めればよい。
*
* オーダーは O(E^(5/6))。
*/
#include <iostream>
#include <algorithm>
using namespace std;
bool solve(bool first) {
int E;
if(!(cin >> E)) return false;
if(!E) return false;
int ans = E;
for(int z = 0; z*z*z <= E; ++z) {
for(int y = 0; y*y <= E; ++y) {
const int x = E - z*z*z - y*y;
if(x >= 0) {
ans = min(ans, x+y+z);
}
}
}
cout << ans << endl;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(10);
bool first = true;
while(solve(first)) {
first = false;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
int solve2(int xy){
int y=0;
int ans=INF;
while(y*y<=xy){
ans=min(ans, y + xy-y*y);
y++;
}
return ans;
}
void solve(int e){
int z=0;
int ans=INF;
while(z*z*z<=e){
ans = min(ans, z+solve2(e-z*z*z));
z++;
}
cout << ans << endl;
}
int main(){
while(true){
int e;
scanf("%d", &e);
if(e==0) break;
solve(e);
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); i++)
const int MAX = 405;
char grid[MAX][MAX];
int visited[MAX][MAX];
int h, w;
bool inside(int x, int y)
{
return 0 <= x && x < h && 0 <= y && y < w;
}
bool check(int x, int y, int a, int b){
if (!inside(x + a, y + b))
return false;
return grid[x][y] != grid[x + a][y + b] && !visited[x + a][y + b];
}
int main()
{
cin >> h >> w;
loop(i, 0, h) loop(j, 0, w)
{
cin >> grid[i][j];
}
long long ans = 0;
loop(i, 0, h) loop(j, 0, w) {
if (visited[i][j]) continue;
queue<pair<int, int>> queue;
queue.emplace(make_pair(i, j));
visited[i][j] = 1;
long long black = 0;
long long white = 0;
while(queue.size()){
pair<int, int> p = queue.front();
queue.pop();
if (grid[p.first][p.second] == '#')
black += 1;
else
white += 1;
for (int a: {-1, 0, 1}){
for (int b: {-1, 0, 1}){
if(abs(a) == abs(b)) continue;
if(check(p.first, p.second, a, b)){
queue.emplace(make_pair(p.first + a, p.second + b));
visited[p.first + a][p.second + b] = 1;
}
}
}
}
ans += white * black;
}
cout << ans << "\n";
return 0;
} | // https://atcoder.jp/contests/aising2019/tasks/aising2019_c
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for(ll i = 0;i < n;i++)
#define all(i) i.begin(), i.end()
template<class T, class U> bool cmax(T& a, U b) { if (a<b) {a = b; return true;} else return false; }
template<class T, class U> bool cmin(T& a, U b) { if (a>b) {a = b; return true;} else return false; }
struct UnionFind {
struct Node {
ll parent;
ll size;
};
vector<Node> tree;
UnionFind(ll size) : tree(size) {
for (ll i = 0; i < size; i++) {
tree[i].parent = i;
tree[i].size = 1;
}
}
ll find(ll x) {
while (tree[x].parent != x) {
ll p = tree[x].parent;
tree[x].parent = tree[p].parent;
x = p;
}
return x;
}
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y) return;
if (tree[x].size < tree[y].size) swap(x, y);
tree[y].parent = x;
tree[x].size += tree[y].size;
}
bool same(ll x, ll y) {
return find(x) == find(y);
}
};
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vi dx = {0, 0, 1, -1};
vi dy = {1, -1, 0, 0};
UnionFind uf(h*w);
rep(i, h) rep(j, w) rep(k, 4) {
int ni = i+dx[k];
int nj = j+dy[k];
if (0 <= ni && ni < h && 0 <= nj && nj < w && s[i][j] != s[ni][nj]) {
uf.unite(i*w + j, ni*w + nj);
}
}
vector<ll> black(h*w, 0), white(h*w, 0);
rep(i, h) rep(j, w) {
if (s[i][j] == '#') black[uf.find(i*w + j)]++;
else white[uf.find(i*w + j)]++;
}
ll ans = 0;
rep(i, h*w) {
ans += black[i] * white[i];
}
cout << ans << endl;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void){
map<string, bool> memo;
string s;
int n, m;
cin >> n;
rep(i, n){
cin >> s;
memo[s] = 1;
}
cin >> m;
int cnt = 0;
rep(i, m){
cin >> s;
if(memo[s])cnt++;
}
FIN(cnt);
return 0;
}
int StrToInt(string s){
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i){
stringstream ss;
ss << i;
return ss.str();
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<pii> s(n),l(n);
rep(i,n){
int a,b;
cin >> a >> b;
s[i] = make_pair(b,a);
}
rep(i,n){
int c,d;
cin >> c >> d;
l[i] = make_pair(c,d);
}
sort(l.begin(),l.end());
int ans = 0;
rep(i,n){
sort(s.rbegin(),s.rend());
rep(j,s.size()){
if(s[j].second < l[i].first && s[j].first < l[i].second){
ans++;
s.erase(s.begin() + j);
break;
}
}
}
cout << ans << endl;
}
| 0 |
#include<stdio.h>
int main(void)
{
int a,b,c,d,e,x[101],X[101],cnt=0,i,j,flg[101],S,s,w=0;
scanf("%d",&a);
for(i=1;i<=a;i++){
x[i]=0;
X[i]=i;
flg[i]=0;
}
for(i=0;i<a*(a-1)/2;i++){
scanf("%d%d%d%d",&b,&c,&d,&e);
if(d>e){
x[b]+=3;
}
else if(e>d){
x[c]+=3;
}
else{
x[b]++;
x[c]++;
}
}
for(i=1;i<=a;i++){
s=-1;
S=0;
for(j=1;j<=a;j++){
if(flg[j]==0){
if(s<x[j]){
s=x[j];
S=j;
}
}
}
flg[S]=1;
if(w==s){
cnt++;
X[S]=i-cnt;
}
else{
cnt=0;
X[S]=i;
}
w=s;
}
for(i=1;i<=a;i++){
printf("%d\n",X[i]);
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int n;
const int INF = 1 << 29;
typedef pair<int,int> P;
vector<P> teams;
bool sortSecond(const P& p1, const P& p2)
{
if(p1.second != p2.second) return p1.second < p2.second;
if(p1.first != p2.first) return p1.first < p2.first;
return false;
}
int main(void)
{
while(cin >> n && n)
{
teams.resize(n);
for (int i = 0; i < n; i++)
{
teams[i] = P(0, i);
}
for (int i = 0, leags = n * (n - 1) / 2; i < leags; i++)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(c == d)
{
teams[a - 1].first++;
teams[b - 1].first++;
}
else if(c > d) teams[a - 1].first += 3;
else teams[b - 1].first += 3;
}
sort(teams.begin(), teams.end(), greater<P>());
int hikiwake = 0;
for (int i = 0; i < n; i++)
{
int tmp = teams[i].first;
teams[i].first = i + 1 - hikiwake;
if(i + 1 < n && tmp == teams[i + 1].first)
{
hikiwake++;
}
else hikiwake = 0;
}
sort(teams.begin(), teams.end(), sortSecond);
for (int i = 0; i < n; i++)
{
cout << teams[i].first << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N = 0;
cin >> N;
int cnt_w = 0, cnt_e = 0;
int ans = pow(10, 6);
vector<char> A(N);
vector<int> S_W(N, 0);
vector<int> S_E(N, 0);
rep(i, N){
cin >> A[i];
}
rep(i, N){
if (A[i]=='W'){
cnt_w++;
S_W[i] = cnt_w;
S_E[i] = cnt_e;
}
if (A[i]=='E'){
cnt_e++;
S_W[i] = cnt_w;
S_E[i] = cnt_e;
}
}
rep(i, N){
if (i==0) ans = min(ans, S_E[N-1] - S_E[i]);
if (i==N-1) ans = min(ans, S_W[N-1]);
else ans = min(ans, (S_W[i] + (S_E[N-1] - S_E[i])));
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
int LW = 0;
int LE = 0;
int RW = 0;
int RE = 0;
cin >> N >> S;
for (int i = 1;i<N;++i) {
if ('E' == S[i]) {
RE++;
}
else {
RW++;
}
}
int ans = 1e9;
for (int i = 0; i < N; ++i) {
ans = min(ans,LW+RE);
if ('E' == S[i]) {
LE++;
}
else {
LW++;
}
if (i != N-1) {
if ('E' == S[i + 1]) {
RE--;
}
else {
RW--;
}
}
}
cout <<ans << endl;
return 0;
} | 1 |
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
char sa[104], sb[104], sc[104], *s;
int ia, ib, ic, *i;
char winner;
int main() {
cin.getline(sa, 104);
cin.getline(sb, 104);
cin.getline(sc, 104);
s = sa;
i = &ia;
while (*i < strlen(s)) {
*i += 1;
if (s[(*i)-1] == 'a') {
s = sa;
i = &ia;
winner = 'A';
} else if (s[(*i)-1] == 'b') {
s = sb;
i = &ib;
winner = 'B';
} else if (s[(*i)-1] == 'c') {
s = sc;
i = ⁣
winner = 'C';
}
}
cout << winner;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define ins insert
#define fi first
#define se second
#define _max max_element
#define _min min_element
#define tc(T) int T; cin>>T; while(T--)
#define q(q) int q; cin>>q; while(q--)
#define pi 3.1415926535897932384626433832
const int pinf=((int)9e18);
const int ninf=((int)-9e18);
const int mod=1000000007;
using namespace std;
int32_t main()
{
fast_io();
//FILE *fptr1=freopen("in.txt","r",stdin);
//FILE *fptr2=freopen("out.txt","w",stdout);
int n,r;
cin>>n>>r;
if(n>=10)
{
cout<<r;
}
else
{
cout<<r+100*(10-n);
}
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
cin >> a;
int b;
b=a.size();
int c;
c=0;
int e[b];
while(c<b){
string d(a,c,1);
if(d=="J"){e[c]=1;}
if(d=="O"){e[c]=2;}
if(d=="I"){e[c]=3;}
c=c+1;}
int f;
f=0;
int g;
g=0;
int h;
int i;
c=0;
while(c<b){
h=0;
i=0;
if(e[c]==2){f=f+1;}
if(e[c]==3){if(f>g){if(c>2*f-1){if(c<b-f+1){while(h<f){if(e[c-f-1-h]!=1){i=1;} if(e[c+h]!=3){i=1;} h=h+1;} if(i==0){g=f;} f=0;}}}}
if(e[c]==1){f=0;}
c=c+1;
}
cout << g<<endl;
} |
#include <iostream>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <math.h>
#include <list>
#include <algorithm>
using namespace std;
int main(void){
//FILE* fp_in = freopen("data.txt", "r", stdin);
while( 1 ) {
int e;
cin >> e;
if( e == 0 ) break;
unsigned long long int ans = e;
for(long long int z = 0; z*z*z <= e; z++) {
for(long long int y = 0; z*z*z + y*y <= e; y++) {
long long int x = e - z*z*z - y*y;
if( x + y + z <= ans ) ans = x + y + z;
}
}
cout << ans << endl;
}
//while(1){}
return 0;
} | 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<iostream>
#include<ctime>
#include<cstdlib>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define rep(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int N=610;
bool vis[N][N];
int col[N][N];int f[N][N];
int sz[5];
vector<pair<int,int> > fob;
int n,m;
void dfs(int x,int y){
int i,dx,dy;
vis[x][y]=1;
rep(i,0,(int)fob.size()-1){
dx=x+fob[i].fi;
dy=y+fob[i].se;
if(0<=dx&&dx<2*n&&0<=dy&&dy<2*n&&!vis[dx][dy]){
col[dx][dy]=col[x][y]^1;
dfs(dx,dy);
}
}
}
void work(int D,int B){
register int i,j;
fob.clear();
memset(vis,0,sizeof(vis));
memset(col,0,sizeof(col));
rep(i,0,2*n-1) rep(j,0,2*n-1) if(i*i+j*j==D){
fob.pb(MP(i,j));
fob.pb(MP(-i,j));
fob.pb(MP(i,-j));
fob.pb(MP(-i,-j));
}
rep(i,0,2*n-1) rep(j,0,2*n-1) if(!vis[i][j]) dfs(i,j);
rep(i,0,2*n-1) rep(j,0,2*n-1) if(col[i][j]) f[i][j]^=B;
}
void print(int ty){
int cnt=0;
int i,j;
rep(i,0,2*n-1) rep(j,0,2*n-1) if(f[i][j]==ty){
cnt++;
printf("%d %d\n",i,j);
//cerr<<cnt<<endl;
if(cnt==n*n) return;
}
}
int main(){
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
//srand(20010102);
register int i,j;
int D;
scanf("%d",&n);
scanf("%d",&D);work(D,1);
scanf("%d",&D);work(D,2);
rep(i,0,2*n-1) rep(j,0,2*n-1) sz[f[i][j]]++;
rep(i,0,3) if(sz[i]>=n*n) {print(i);return 0;}
return 0;
}
| #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N = 605;
inline int input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
inline void chkmin(int &x, int y) { x = x < y ? x : y; }
template <class T> T sqr(T x) { return x * x; }
int n, m, D1, D2;
int ansx[N * N], ansy[N * N], tot;
bool col[N][N];
void work(int D) {
int tmp = 0;
while(D % 4 == 0) D >>= 2, ++tmp;
if (D % 4 == 3) return void();
if (D % 4 == 1) {
for (int x = 0; x <= n; ++x)
for (int y = 0; y <= n; ++y)
if (((x >> tmp) + (y >> tmp)) & 1) col[x][y] = true;
}
if (D % 4 == 2) {
for (int x = 0; x <= n; ++x)
for (int y = 0; y <= n; ++y)
if ((x >> tmp) & 1) col[x][y] = true;
}
}
int main() {
#ifdef local
freopen("in", "r", stdin);
freopen("out", "w", stdout);
// freopen("log", "w", stderr);
#endif
ios::sync_with_stdio(false);
cin >> n >> D1 >> D2;
m = n, n = n * 2 - 1;
work(D1), work(D2);
for (int x = 0; x <= n; ++x)
for (int y = 0; y <= n; ++y) {
if (!col[x][y]) ansx[++tot] = x, ansy[tot] = y;
if (tot == m * m) goto Get;
}
Get:;
for (int i = 1; i <= tot; ++i)
printf("%d %d\n", ansx[i], ansy[i]);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
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; }
ll mod= 1e9 + 7;
int main(){
int g;
cin >>g;
int a,b;
cin >>a >>b;
if(g==1){cout << "Hello World" << endl;}else{cout << a+b << endl;}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define drep(i,cc,n) for(int i=cc;i>n;--i)
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; }
const long long INF = 1LL <<60;
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
ll choose2(ll n){
return n*(n-1)/2;
}
int main(){
int n;
cin>>n;
if(n == 1) cout<<"Hello World"<<endl;
else{
int a,b;
cin>>a>>b;
cout<<a+b<<endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; } //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //最小公倍数
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
/*Graph t;
void dfs(int v, int pv=-1){
for(int vn: t[v]){
if (vn == pv) continue;
dfs(vn, v);
}
}*/
int main() {
ll n,k;
cin >> n >> k;
ll ma;
cin >> ma;
ll g=ma;
rep(i,n-1){
ll o;
cin >> o;
ma=max(o,ma);
g=gcd(g,o);
}
if(n==1){
if(ma==k)cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
}
else if(k%g==0&&ma>=k) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if(a%b==0)
{
return b;
}
else
{
return gcd(b, a%b);
}
}
int main()
{
int n, k;
bool ans = 0, ma = 0;
cin >> n >> k;
int A[100001];
for (int i = 0; i < n; ++i)
{
cin >> A[i];
if(A[i] == k)
{
ans = 1;
}
if(A[i] > k)
{
ma = 1;
}
}
sort(A, A+n);
bool ok = 0;
int g = gcd(A[1],A[0]);
for (int i = 1; i < n - 1; ++i)
{
g = gcd(g, A[i]);
}
ok = (k % g == 0);
if(ma && ok)
{
ans = 1;
}
cout << (ans?"POSSIBLE":"IMPOSSIBLE") << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
int n,x[101],y[101];
const double PI=acos(-1);
double k[101];
int main(){
scanf("%d",&n);
if(n==2){puts("0.5\n0.5");return 0;}
F(i,1,n) scanf("%d%d",x+i,y+i);
F(i,1,n){
int cnt=0;
F(j,1,n) if(j!=i){
k[++cnt]=atan2(x[j]-x[i],y[j]-y[i]);
}
std::sort(k+1,k+cnt+1);
double t;
t=k[1]-k[cnt]+PI+PI;
if(t>=PI) {printf("%.15lf\n",(t-PI)/(PI+PI)); continue;}
bool ok=0;
F(j,1,cnt-1){
t=k[j+1]-k[j];
if(t>=PI) {printf("%.15lf\n",(t-PI)/(PI+PI)); ok=1; break;}
} if(!ok) printf("%.15lf\n",0.);
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;
double cross(pair<double, double> a, pair<double, double> b, pair<double, double> c) {
pair<double, double> u = { a.first - c.first, a.second - c.second };
pair<double, double> v = { a.first - b.first ,a.second - b.second };
return u.first*v.second - u.second*v.first;
}
double abs(pair<double, double> a) {
return sqrt(a.first*a.first + a.second*a.second);
}
int main() {
int n; cin >> n;
if (n == 2) {
cout << 0.5 << endl;
cout << 0.5 << endl;
return 0;
}
vector<pair<pair<double, double>, int>> pi(n);
for (int i = 0; i < n; i++) cin >> pi[i].first.first >> pi[i].first.second, pi[i].second = i;
sort(pi.begin(), pi.end());
double lm = 1e9; int idx = 0;
vector<pair<pair<double, double>, int>> chi;
bool used[103] = {};
chi.push_back(pi[0]);
used[idx] = true;
for (int iter = 1; iter < n; iter++) {
const auto &pr = chi.back().first;
for (int i = 0; i < n; i++) {
if (used[i]) continue;
const auto &p = pi[i].first;
int sgn = 0;
bool flag = true;
for (int j = 0; j < n; j++) {
if (j == i) continue;
if (p.first == pr.first && p.second == pr.second) continue;
int s = cross(pr, p, pi[j].first) > 0 ? 1 : -1;
flag &= sgn == 0 || s == sgn;
sgn = s;
}
if (flag) {
if (chi.size() >= 2) {
const auto &pb = chi[chi.size() - 2].first;
double s = (pr.first - p.first)*(pb.second - p.second);
s -= (pb.first - p.first)*(pr.second - p.second);
s /= 2.;
s = abs(s);
if (s < 1e-8) {
chi.pop_back();
}
}
chi.push_back(pi[i]);
used[i] = true;
break;
}
}
}
if (chi.size() >= 3) {
const auto &pr = chi.back().first;
const auto &pb = chi[chi.size() - 2].first;
const auto &p = chi[0].first;
double s = (pr.first - p.first)*(pb.second - p.second);
s -= (pb.first - p.first)*(pr.second - p.second);
s /= 2.;
s = abs(s);
if (s < 1e-8) {
chi.pop_back();
}
}
vector<double> ans(n);
int m = chi.size();
if (m >= 3) {
for (int i = 0; i < m; i++) {
const auto &pr = chi[(i - 1 + m) % m].first;
const auto &pn = chi[(i + 1) % m].first;
const auto &p = chi[i].first;
pair<double, double> u = { p.first - pr.first, p.second - pr.second };
pair<double, double> v = { p.first - pn.first, p.second - pn.second };
double ang = acos((u.first*v.first + u.second*v.second) / abs(u) / abs(v));
double r = acos(-1) - ang;
ans[chi[i].second] = r / (2 * acos(-1));
}
}
else {
for (int i = 0; i < m; i++) {
ans[chi[i].second] = 0.5;
}
}
for (int i = 0; i < n; i++) printf("%.15f\n", ans[i]);
int b = 2 * 0.;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
map<ll,int> prf(ll n){
map<ll,int> ret;
for(ll i=2;i*i<=n;i++){
while(n%i==0){
ret[i]++;
n/=i;
}
}
if(n!=1){
ret[n]=1;
}
return ret;
}
int main(){cout<<fixed<<setprecision(10);
int n,h,w;
cin>>n>>h>>w;
n++;
cout<<(n-w)*(n-h)<<endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
ll n, h, w; cin >> n >> h >> w;
cout << (n-h+1) * (n-w+1) << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
const ll N=2e5+50;
vec l(N),r(N);
vec a(N);
ll cal(ll x) {
if(x<3) {
return 0;
}
return max({l[x-1],r[x-1],cal(x-2)+a[x]});
}
int main() {
ll n;
cin >> n;
for(ll i=1;i<=n;i++) cin >> a[i];
for(ll i=2;i<=n;i+=2) {
l[i]=l[i-2]+a[i-1];
r[i]=max(r[i-2],l[i-2])+a[i];
}
if(n%2) {
cout << cal(n) << endl;
}
else {
cout << max(l[n],r[n]) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[200005],dp[200005][3],ans=-0x3f3f3f3f3f3f3f3fll;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",a+i);
memset(dp,0xc0,sizeof(dp));
dp[0][1]=0;
for(int i=1;i<=n;i++)
for(int j=0;j<3;j++)
{
for(int k=i==1?1:2;k<=4;k++) if(i-k>=0)
for(int g=0;g<3;g++) if(i/2+j-(i-k)/2-g==1)
dp[i][j]=max(dp[i][j],dp[i-k][g]+a[i]);
if(i/2+j-1==n/2) ans=max(ans,dp[i][j]);
}
printf("%lld",ans);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
int a[100] = {0};
double sum;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
int minIndex = 0;
double avr = sum / n;
double minDist = abs(avr - a[0]);
for(int i = 1; i < n; i++){
if(minDist > abs(avr - a[i])){
minIndex = i;
minDist = abs(avr - a[i]);
}
}
cout << minIndex << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int md = 998244353;
inline int mul(int a, int b) {
return (long long) a * b % md;
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int maxd = *max_element(d.begin(), d.end());
vector<int> cnt(maxd + 1);
for (int i = 0; i < n; i++) {
cnt[d[i]]++;
}
if (d[0] != 0 || cnt[0] != 1) {
cout << 0 << '\n';
return 0;
}
for (int i = 1; i <= maxd; i++) {
if (cnt[i] == 0) {
cout << 0 << '\n';
return 0;
}
}
int ans = 1;
for (int i = 1; i <= maxd; i++) {
for (int j = 0; j < cnt[i]; j++) {
ans = mul(ans, cnt[i - 1]);
}
}
cout << ans << '\n';
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
int main() {
int n; cin >> n;
vector<ll> a(n); rep(i, n) cin >> a[i];
vector<ll> acum(n+1, 0);
rep(i, n) {
acum[i+1] = acum[i] + a[i];
}
int l = 1;
int r = 3;
ll ans = LINF;
for (int i = 2; i < n-1; i++) {
if (r <= i) r = i+1;
while (l+1 < i && abs(acum[l+1] - (acum[i] - acum[l+1])) <= abs(acum[l] - (acum[i] - acum[l]))) {
l++;
}
while (r+1 < n && abs(acum[r+1] - acum[i] - (acum[n] - acum[r+1])) <= abs(acum[r] - acum[i] - (acum[n] - acum[r]))) {
r++;
}
ll mn = min({acum[l], (acum[i] - acum[l]), acum[r] - acum[i], acum[n] - acum[r]});
ll mx = max({acum[l], (acum[i] - acum[l]), acum[r] - acum[i], acum[n] - acum[r]});
ans = min(ans, mx-mn);
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<string.h>
using namespace std;
int D[6];
void spin(char c)
{
if(c=='E'){
swap(D[0],D[3]);swap(D[3],D[5]);swap(D[5],D[2]);
}
else if(c=='W'){
swap(D[0],D[2]);swap(D[2],D[5]);swap(D[5],D[3]);
}
else if(c=='S'){
swap(D[0],D[1]);swap(D[0],D[4]);swap(D[4],D[5]);
}
else if(c=='N'){
swap(D[0],D[1]);swap(D[1],D[5]);swap(D[5],D[4]);
}
}
int main()
{
char M[101];
for(int i=0;i<6;i++)cin>>D[i];
cin>>M;
for(int i=0;i<strlen(M);i++)spin(M[i]);
cout<<D[0]<<endl;
return 0;
} | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
else if (n == 1) return p % m;
else if (n % 2 == 1) return p * pow_mod(p, n - 1, m) % m;
else {
ll tmp = pow_mod(p, n / 2, m);
return (tmp * tmp) % m;
}
}
ll gcd(ll x, ll y) {
if (y == 0) {
return x;
}
return gcd(y, x % y);
}
ll com_mod(ll n, ll k, ll m) {
if (k == 0) return 1;
else {
ll x = 1;
ll y = 1;
for (ll i = 0; i < k; i++) {
x = (x * (n - i)) % m;
y = (y * (i + 1)) % m;
}
ll res = (x * pow_mod(y, m - 2, m)) % m;
return res;
}
}
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a == b && b != c) || (b == c && c != a) || (c == a && a != b)) {
cout << "Yes" << endl;
}
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
for(int i=0;i<s.size();i++){
if(s[i+1]=='C'&&s[i]=='A'){
flag = true;
break;
}
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#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 <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
ll Max(ll(a), ll(b), ll(c)) {
return max(max(a, b), c);
}
ll Min(ll(a), ll(b), ll(c)) {
return min(min(a, b), c);
}
ll a[100009];
int main() {
set<ll> A;
vector<ll> B;
ll N;
cin >> N;
rep(i, N) {
ll a;
cin >> a;
if (A.count(a)) {
B.push_back(a);
A.erase(a);
}
else {
A.insert(a);
}
}
if (B.size() < 2) {
cout << 0 << endl;
return 0;
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
cout << B.at(0) * B.at(1) << endl;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=new type[n];
#define sl s1.length();
#define yes cout<< "YES"<<endl
#define no cout<< "NO"<<endl
#define all(v) (v).begin(),(v).end()
#define s(v) sort(v,v+n)
#define mt mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define read(a,n) for(int i=0;i<n;i++)cin>>a[i]
#define print(a,n) for(int i=0;i<n;i++)cout<<a[i]<<" "
#define for1(i,a,n) for(int i=0;i<n;i++)
#define rep(i, c) for(int i = 0; i < (int)c; i++)
#define set(x) cout<<fixed<<setprecision(x);
using namespace std;
//**********************************************DO IT NO****************************************************************
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",stdout);
#endif
ios_base :: sync_with_stdio(false);
cin.tie(NULL) ;
cout.tie(NULL);
}
int dp[101][1001],ans1=1e9,dp1[1000001];
int num[10];
int a[1000000];
int sum(int n)
{
int m,s=0;
while(n)
{
m=n%10;
s+=m;
n/=10;
}
return s;
}
signed main()
{
fastio();
int t=1;
//cin>>t;
while(t--)
{
int n;
cin>>n;
if(n%(sum(n))==0)
cout<<"Yes";
else
cout<<"No";
}
}
// 🍪 🍪 🍪
| 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<ll,ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const ll inf=1e18;
struct edge{
int to,cost;
};
class DIJ{
public:
vector<vector<edge> >G;
int n;
vi d;//distance
DIJ(int size){
n=size;
G=vector<vector<edge> >(n);
}
void add_edge(int a,int b,int c){
edge e={b,c},ee={a,c};
G[a].pb(e);
// G[b].pb(ee);
}
void dij(int s){
d=vi(n,inf);
d[s]=0;
priority_queue<pii>q;
q.push(pii(0,s));
while(!q.empty()){
pii p=q.top();
q.pop();
int pos=p.second,cost=-p.first;
if(cost>d[pos])continue;
rep(i,G[pos].size()){
edge e=G[pos][i];
int to=e.to;
int nowcost=cost+e.cost;
if(nowcost<d[to]){
d[to]=nowcost;
q.push(pii(-d[to],to));
}
}
}
}
};
int main(){
int n,m,s;
cin>>n>>m>>s;
DIJ dij(n);
while(m--){
int a,b,c;
cin>>a>>b>>c;
dij.add_edge(a,b,c);
}
dij.dij(s);
rep(i,n)if(dij.d[i]!=inf)cout<<dij.d[i]<<endl;
else cout<<"INF"<<endl;
} | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(int i = a; i < (int)(b); i++)
#define rep(i,b) range(i,0,b)
#define eb emplace_back
typedef long long ll;
#define int ll
auto const inf = numeric_limits<int>::max()/4;
using Weight = int;
using Capacity = int;
struct Edge {
int src, dst; Weight weight;
Edge(int s, int d, int w) : src(s), dst(d), weight(w) {}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;
pair<vector<Weight>, bool> spfa(const Graph &g, int s){
const Weight inf = numeric_limits<Weight>::max()/4;
const int n = g.size(); priority_queue<int> q;
vector<Weight> dist(n, inf); vector<int> inQ(n);
vector<int> count(n);
dist[s] = 0; q.emplace(s); inQ[s] = true; ++count[s];
bool negCycle = false;
for(int i = 0; q.size(); i++){
int v = q.top(); q.pop(); inQ[v] = false;
for(auto &e : g[v]){
if(dist[v] != inf && dist[e.dst] > dist[v] + e.weight){
dist[e.dst] = dist[v] + e.weight;
if(!inQ[e.dst]){
q.emplace(e.dst); inQ[e.dst] = true; ++count[e.dst];
if(count[e.dst] >= n){ negCycle = true; goto END; }
}
}
}
}
END:;
return make_pair(dist, !negCycle);
}
signed main(){
int V,E,r;
while(cin >> V >> E >> r){
Graph g(V);
rep(i,E){
int a,b,c;
cin >> a >> b >> c;
g[a].eb(a,b,c);
}
bool ok;
vector<Weight> dist;
tie(dist, ok) = spfa(g,r);
if(ok){
for(int i = 0; i < (int)dist.size(); i++){
if(dist[i] == inf) cout << "INF";
else cout << dist[i];
cout << endl;
}
} else {
cout << "NEGATIVE CYCLE" << endl;
}
}
} | 1 |
#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 ;
string s ;
cin >> s ;
set<int> b ;
for(int i = 0 ; i< n ; ++i)
{
if(s[i] == 'B')
b.insert(i);
}
int cnt = 0 ;
int v = b.size() ;
for(int i = 0; i < n ; ++i)
{
if(s[i] == 'R')
{
for(int j = 0; j < n ; ++j)
{
if(s[j] == 'G')
{
int d = abs(i-j) ;
int temp = 0 ;
if(b.find(i - d) != b.end())
temp++ ;
if(b.find(i + d) != b.end())
temp++ ;
if(b.find(j - d) != b.end())
temp++ ;
if(b.find(j + d) != b.end())
temp++ ;
if(d%2 == 0 && b.find(min(i,j) + d/2) != b.end())
temp++ ;
cnt += v - temp ;
}
}
}
}
cout << cnt ;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll n, ans = 0;
string s;
vector<int> r, g;
int b[4010], rn = 0, bn = 0, gn = 0;
for(int i = 0; i < 4010; i++) b[i] = 0;
cin >> n >> s;
for(int i = 0; i < n; i++){
if(s[i] == 'R') {r.push_back(i); rn++;}
else if(s[i] == 'G') {g.push_back(i); gn++;}
else {b[i]++; bn++;}
}
for(int i = 0; i < rn; i++){
for(int j = 0; j < gn; j++){
int minn = min(r[i], g[j]);
int maxn = max(r[i], g[j]);
int l = maxn - minn;
int l2 = minn + maxn;
int add = bn;
if(minn-l >= 0 && b[minn-l] > 0){
add--;
}
if(l%2==0 && b[l2/2] > 0){
add--;
}
if(maxn+l < n && b[maxn+l] > 0){
add--;
}
ans += add;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw "\n"
#define mod 1000000007
ll e[100000000];
int main(void)
{
CIN;
ll tc,l,k=0,sum=0,x=0,y,z=0,m=1,n=0,ans=0,cnt=0;
map<ll,bool>mp;
string s;
cin>>n>>k;
for(ll i=1;i<=k;i++){
cin>>x>>s;
if(s=="AC"){
if(!mp[x])sum++,cnt+=e[x],mp[x]=1;
}
else e[x]++;
}
cout<<sum<<" "<<cnt;
} | #include<iostream>
#include<vector>
int main() {
int vec=0;
int n;
int a=0;
int b=0;
int game_a, game_b;
std::vector<int>veca, vecb;
while (1) {
std::cin >> n;
if (n == 0)break;
else {
for (int i = 0; i < n; ++i) {
std::cin >> game_a>>game_b;
if (game_a == game_b) { a += game_a; b += game_b; }
else if (game_a > game_b)a += game_a + game_b;
else b += game_a + game_b;
}
veca.push_back(a); vecb.push_back(b); a = 0; b = 0;
}
}
for (int i = 0; i < veca.size(); ++i) {
std::cout << veca[i] <<" "<<vecb[i]<< std::endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, m;
cin >> n >> m;
vector<vector<int64_t>> a(n, vector<int64_t>(m));
for (auto i : irange(0L, n)) {
for (auto j : irange(0L, m)) {
cin >> a[i][m - j - 1];
--a[i][m - j - 1];
}
}
int64_t ans = n;
vector<bool> available(m, true);
for (auto _ : irange(0L, m)) {
vector<int64_t> c(m);
for (const auto& b :
a | transformed([](const auto& aa) { return aa.back(); })) {
++c[b];
}
auto b = max_element(c.begin(), c.end()) - c.begin();
available[b] = false;
ans = min(ans, c[b]);
for (auto&& aa : a) {
while (!aa.empty() && !available[aa.back()]) {
aa.pop_back();
}
}
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
const int N=305;
#define fi first
#define se second
typedef pair<int,int>P;
priority_queue<P>que;
int n,m,b[N],vi[N],cnt[N],a[N][N];
bool check(int mid){
while(!que.empty()) que.pop();
for(int i=1;i<=m;i++) b[i]=0;
for(int i=1;i<=n;i++) ++b[a[i][cnt[i]=1]];
for(int i=1;i<=m;i++) vi[i]=0,que.push(P(b[i],i));
while(!que.empty()){
P x=que.top(); que.pop();
if(vi[x.se]) continue;
if(x.fi<=mid) return true;
vi[x.se]=1;
for(int i=1;i<=n;i++){
if(a[i][cnt[i]]!=x.se) continue;
while(vi[a[i][cnt[i]]]&&cnt[i]<=m) ++cnt[i];
if(cnt[i]>m) return false;
que.push(P(++b[a[i][cnt[i]]],a[i][cnt[i]]));
}
}
return false;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d",&a[i][j]);
int l=1,r=n;
while(l<r){
int mid=(l+r)>>1;
if(check(mid)) r=mid;
else l=++mid;
}
printf("%d\n",l);
return 0;
}
| 1 |
#include<stdio.h>
#include<string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>57){f^=c==45,c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f?-x:x;
}
static inline void OUT(int a)
{
if(a<0)PUT('-'),a=-a;
int d[40],i=0;do{d[i++]=a%10;}while(a/=10);
while(i--){PUT(d[i]+48);}PUT('\n');
}
static inline int Min(int a,int b){return a<b?a:b;}
const int N=2e5+1,M=(N<<2),oo=(~0u>>2);
int n,m,mn[M],z[M],t[M],g[M],ql,qr,qx;
static inline void pu(int x){z[x]=z[x*2];t[x]=t[x*2+1];mn[x]=Min(mn[x*2],mn[x*2+1]);}
static inline void build(int x,int l,int r){if(l==r){z[x]=l;t[x]=l;return;}int m=(l+r)/2;build(x*2,l,m);build(x*2+1,m+1,r);pu(x);}
static inline void pt(int x,int w,int r){g[x]=w;t[x]=w;z[x]=w;if(w<=m){mn[x]=w-r;}else{mn[x]=oo;}}
static inline void upd(int x,int l,int r)
{
if(z[x]>qr||t[x]<ql){return;}if(z[x]>=ql&&t[x]<=qr){pt(x,qr+1,r);return;}
int m=(l+r)/2;if(g[x]){pt(x*2,g[x],m);pt(x*2+1,g[x],r);g[x]=0;}upd(x*2,l,m);upd(x*2+1,m+1,r);pu(x);
}
int main()
{
n=IN(),m=IN();build(1,1,m);
for(int i=0;i<n;i++){ql=IN(),qr=IN();upd(1,1,m);if(mn[1]>m){puts(""),puts("-1");}else{OUT(mn[1]+i+1);}}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend() //reverse
#define strall(v) (v).cbegin(),(v).cend() //const_itterator
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
const int INF = 1e9+5;
int main(){
int N;
cin>>N;
vector<pair<int,int>> A,B;
rep(i,N){
int x,y;cin>>x>>y;
A.push_back({y,x});
}
rep(i,N){
int x,y;cin>>x>>y;
B.push_back({x,y});
}
sort(all(A), greater<pair<int, int>>());
sort(all(B));
vector<bool> f(N, false);
//cの小さい順
rep(i,N){
int c = B[i].first;
int d = B[i].second;
//bの大きい順
rep(j,N){
int a = A[j].second;
int b = A[j].first;
if(f[j])continue;
if(a < c && b < d){
f[j] = true;
break;
}
}
}
int cnt =0;
rep(i,N){
if(f[i])cnt++;
}
cout<<cnt<<endl;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int fa[101000],n,k,ans,f[101000];
vector<int> e[101000];
void dfs(int x){
int mx=0;
for(int v:e[x]) dfs(v),mx=max(mx,f[v]+1);
if(x==1||fa[x]==1) return;
if(mx==k-1) ans++,f[x]=-1;
else f[x]=mx;
}
int main(){
read(n);read(k);
for(int i=1;i<=n;i++) read(fa[i]);
if(fa[1]!=1) fa[1]=1,ans=1;
for(int i=2;i<=n;i++) e[fa[i]].push_back(i);
dfs(1);
cout<<ans<<'\n';
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
int main(int argc, char **argv)
{
int V, E, r;
cin >> V >> E >> r;
vector<vector< pair<int, int>>> A(V);
for (int i = 0; i < E; i++) {
int s, t, d;
cin >> s >> t >> d;
A[s].push_back({t, d});
}
vector<int> d(V, INT_MAX);
d[r] = 0;
bool done = false;
while (!done) {
done = true;
for (int i = 0; i < V; i++) {
if (d[i] == INT_MAX)
continue;
for (auto n: A[i]) {
int m = d[i] + n.second;
if (m < d[n.first]) {
d[n.first] = m;
done = false;
}
}
}
}
for (int i = 0; i < V; i++) {
if (d[i] == INT_MAX)
cout << "INF";
else
cout << d[i];
cout << endl;
}
return 0;
} | 0 |
#include <stdio.h>
#include <string.h>
int main(){
int y;
char s[5];
scanf("%d/%s", &y, s);
printf("%d/%s", y+=1, s);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
char s[4]={};
cin>>s;
if(s[0]=='S'){
if(s[1]=='U'){
cout<<7<<endl;
}else{
cout<<1<<endl;
}
}else if(s[0]=='M'){
cout<<6<<endl;
}else if(s[0]=='W'){
cout<<4<<endl;
}else if(s[0]=='F'){
cout<<2<<endl;
}else if(s[0]=='T'){
if(s[1]=='U'){
cout<<5<<endl;
}else{
cout<<3<<endl;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
char arr[405][405];
bool vis[405][405];
int h, w;
int cb;
int cw;
bool f(int i, int j, int l, int m){
if(l<0 || l>=h || m<0 || m>=w){
return 0;
}
if(vis[l][m]==1){
return 0;
}
if(arr[i][j]==arr[l][m]){
return 0;
}
return 1;
}
void dfs(int i, int j){
vis[i][j]=1;
if(arr[i][j]=='#'){
cb++;
}
else{
cw++;
}
if(f(i, j, i+1, j)){
dfs(i+1, j);
}
if(f(i, j, i, j+1)){
dfs(i, j+1);
}
if(f(i, j, i-1, j)){
dfs(i-1, j);
}
if(f(i, j, i, j-1)){
dfs(i, j-1);
}
}
main() {
cin>>h>>w;
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin>>arr[i][j];
}
}
int ans=0;
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(vis[i][j]==0){
dfs(i, j);
ans+=(cb*cw);
cb=0;
cw=0;
}
}
}
cout<<ans;
return 0;
} | #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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main()
{
int H,W;
cin >> H >> W;
vector<string> A(H);
REP(i, H) cin >> A[i];
vector<vector<int>> dist(H,vector<int> (W,-1));
ll ans = 0;
REP(i,H){
REP(j,W){
if(A.at(i).at(j)=='#'&&dist[i][j]==-1){
ll cntblack = 1;
ll cntwhite = 0;
queue<P> que;
que.push(make_pair(i,j));
dist[i][j]=0;
while(!que.empty()){
int vy = que.front().first;
int vx = que.front().second;
que.pop();
REP(k,4){
int nvy = vy+dy[k];
int nvx = vx+dx[k];
if(nvy<0||nvy>H-1||nvx<0||nvx>W-1||dist[nvy][nvx]!=-1||(A[vy][vx]=='#'&&A[nvy][nvx]!='.')||(A[vy][vx]=='.'&&A[nvy][nvx]!='#')) continue;
dist[nvy][nvx]=0;
que.push(make_pair(nvy,nvx));
if(A[nvy][nvx]=='#'){
cntblack++;
}else{
cntwhite++;
}
}
}
ans+=cntblack*cntwhite;
}
}
}
cout << ans << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <utility>
#include <queue>
#define INF 1000000007
using namespace std;
typedef long long int ll;
int main(){
vector<int> dp(31,0);
dp[0]=1;
dp[1]=1;
dp[2]=2;
for (int i=3; i<31; i++) {
dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
}
for (;;) {
int n;
cin >> n;
if(n==0) break;
int ans = dp[n]/(10*365)+1;
cout << ans <<endl;
}
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
pair<int, int> mod(int a, int b){
int d = a/b;
int r = a%b;
if(r<0){
d++;
r = a-(d*b);
}
return make_pair(d, r);
}
int main(){
int32_t n;
int bits[32] = {0};
scanf("%d", &n);
if(n == 0){
cout << 0 << endl;
return 0;
}
int i=32;
while(n != 0){
pair<int, int> div = mod(n, -2);
n = div.first;
bits[--i] = div.second;
}
int prnt = false;
for(int i=0; i<32; i++){
if(!prnt && bits[i]) prnt = true;
if(prnt) cout << bits[i];
}
cout << endl;
}
| 0 |
#include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int n;
long long sum=3;
scanf("%d",&n);
if(n==1) sum=1;
else if(n==2) sum=2;
else
{
while(n>2)
{
if(n%3!=0&&n%5!=0)
sum+=n;
n--;
}
}
printf("%lld",sum);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
string A,B,C;
cin >> A >>B >>C;
ll ans =0;
for(int i=0;i<N;i++){
set<char> s;
s.insert(A[i]);
s.insert(B[i]);
s.insert(C[i]);
ans += (s.size()-1);
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[5], k, ans = 0;
for(int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
for(int i = 0; i < 5; i++)
for(int j = 0; j < 5; j++)
if(a[i] < a[j] && a[j] - a[i] > k)
ans++;
if(ans)cout << ":(";
else cout << "Yay!";
return 0;
} | #include <string>
#include <vector>
using namespace std;
vector<int> border(vector<int> S)
{
int n = (int)S.size();
vector<int> B(n+1);
B[0] = -1;
int j = -1;
for (int i=1; i<=n; i++)
{
while (j>=0 && S[i-1]!=S[j])
j = B[j];
j++;
B[i] = j;
}
return B;
}
// B = border(P)
vector<int> search(vector<int> T, vector<int> P, vector<int> B)
{
int n = (int)T.size();
int m = (int)P.size();
vector<int> A;
int j = 0;
for (int i=0; i+m<=n;)
{
if (j<m && T[i+j]==P[j])
{
j++;
if (j==m)
A.push_back(i);
}
else
{
i += j-B[j];
if (j>0)
j = B[j];
}
}
return A;
}
#include <iostream>
int main()
{
int N;
cin>>N;
vector<int> a(N), b(N);
for (int &t: a)
cin>>t;
for (int &t: b)
cin>>t;
vector<int> ax(N), bx(N);
for (int i=0; i<N; i++)
{
ax[i] = a[i]^a[(i+1)%N];
bx[i] = b[i]^b[(i+1)%N];
}
for (int i=0; i<N-1; i++)
ax.push_back(ax[i]);
vector<int> K = search(ax, bx, border(bx));
for (int k: K)
cout<<k<<" "<<(a[k]^b[0])<<endl;
}
| 0 |
#include<algorithm>
#include<chrono>
#include<climits>
#include<numeric>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<random>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<vector>
#include<cassert>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
using namespace std;
struct Debug{
int cnt = 0;
bool on = false;
char debug[10] = "debug";
template<class T>
Debug & operator<<(const T & v) {
if(on && cnt++ == 0) cerr << "debug: ";
if(on) cerr << v << ' ';
return *this;
}
Debug & operator<<(ostream&(*pManip)(ostream&)) {
if(on) cerr << (*pManip);
cnt = 0;
return *this;
}
} debug;
#define rep(i, a, b) for(auto i = (a); i < (b); i++)
#define rrep(i, a, b) for(auto i = (a); i > (b); i--)
#define all(v) (v).begin(), (v).end()
#define print(v) {if(debug.on){for(auto x : v) debug << x; debug << endl;}}
#define printn(v, n) {if(debug.on){for(int _i = 0; _i < n; _i++) debug << *(v + _i); debug << endl;}}
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
struct mint{
long long x;
long long mod = 998244353;
mint(): x(0) {}
mint(long long _x): x(_x) {}
operator long long() { return x; }
mint operator+(const mint & b) const { return (x + b.x) % mod; }
mint operator-(const mint & b) const { return (x - b.x + mod) % mod; }
mint operator*(const mint & b) const { return (x * b.x) % mod; }
template<class T>
mint operator^(T b) const {
if(!b) return 1;
mint tmp = (*this) ^ (b / 2);
return b % 2 ? tmp * tmp * (*this) : tmp * tmp;
}
mint inv() const {
static unordered_map<long long, long long> inv_dp;
if(inv_dp.count(x))
return inv_dp[x];
else if(inv_dp.size() < 100000)
return inv_dp[x] = (*this) ^ (mod - 2);
else return (*this) ^ (mod - 2);
}
mint operator/(const mint & b) const { return (*this) * b.inv(); }
};
// unordered_map<long long, long long> mint::inv_dp;
const int MAXN = 300 + 20, MAXM = 90000 + 20;
int n;
int a[MAXN];
mint dp[MAXM];
mint dp2[MAXM];
int main(int argc, char * argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
if(argc > 1 && !strcmp(argv[1], debug.debug)) debug.on = true;
cin >> n;
int tot = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
tot += a[i];
}
dp[0] = mint(2) ^ n;
dp2[0] = mint(1);
for(int i = 1; i <= n; i++) {
for(int j = tot; j >= 0; j--) {
if(j - a[i] >= 0) {
dp[j] = dp[j] + dp[j - a[i]] / mint(2);
dp2[j] = dp2[j] + dp2[j - a[i]];
}
}
debug << i << endl;
for(int i = 0; i < 10; i++)
debug << dp[i].x;
debug << endl;
}
mint res = 0;
for(int i = (tot + 1) / 2; i <= tot; i++) {
res = res + dp[i];
if(i * 2 == tot)
res = res - dp2[i];
debug << i << res.x << endl;
}
debug << (mint(3) ^ n).x << res.x << endl;
res = (mint(3) ^ n) - res * mint(3);
debug << res.x << (mint(3) ^ n).x << endl;
cout << res.x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using vi = vector<int>;
using pii = pair<int,int>;
#define ST first
#define ND second
#define PB push_back
const int nax = 301;
const int mod = 998244353;
int n,a[nax];
int dp[nax][nax*nax];
int ans,sum,sub;
int main() {
scanf("%d",&n);
for(int i=1; i<=n;i++) {
scanf("%d",&a[i]);
sum+=a[i];
}
ans=1;
for(int i=1; i<n;i++) {
ans=((LL)ans*3)%mod;
}
dp[0][0] = 1;
for(int i=1; i<=n;i++) {
for(int s=0; s<=sum; s++) {
dp[i][s] = (2*dp[i-1][s])%mod;
if(s-a[i]>=0) {
dp[i][s]= (dp[i][s]+dp[i-1][s-a[i]])%mod;
}
}
}
for(int i=1; i<=sum;i++) {
if(i>=(sum+1)/2) {
sub=(sub+dp[n][i])%mod;
}
}
dp[0][0] = 1;
for(int i=1; i<=n;i++) {
for(int s=0; s<=sum;s++) {
dp[i][s] = dp[i-1][s];
if(s-a[i]>=0) {
dp[i][s]= (dp[i][s]+dp[i-1][s-a[i]])%mod;
}
}
}
if(sum%2==0) {
sub=(sub-dp[n][sum/2]+mod)%mod;
}
int res = (((ans-sub)%mod)+mod)%mod;
res = ((LL)res*3)%mod;
printf("%d",res);
}
| 1 |
/*
* Project: AtCoder Beginners Contest 146 A - Can't Wait for Holiday /
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/08/07
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdio>
#include <cstring>
using namespace std;
char s[3];
void solve() {
const char *week[7] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
for (int i=0;i<7;i++) {
if (strcmp(s, week[i]) == 0) {
printf("%d\n", 7-i);
return;
}
}
}
int main() {
scanf("%s", s);
solve();
} | #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(){
string s;
cin >> s;
if(s == "SUN") cout << 7 << endl;
if(s == "MON") cout << 6 << endl;
if(s == "TUE") cout << 5 << endl;
if(s == "WED") cout << 4 << endl;
if(s == "THU") cout << 3 << endl;
if(s == "FRI") cout << 2 << endl;
if(s == "SAT") cout << 1 << endl;
} | 1 |
#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>
#include <list>
#include <ctime>
////
//#include <random>//
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
////定数
const int INF = (int)1e9 + 10;
const LL MOD = (LL)1e9 + 7;
const LL LINF = (LL)4e18 + 20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;
void chmax(LL& a, LL b) {
a = max(a, b);
}
//////////////
vector<LL> kai(200001);
vector<LL> kai_inv(200001);
LL powMod(LL num, LL n, LL mod = (LL)MOD) {//(num**n)%mod
num %= mod;//
if (n == 0) {
return (LL)1;
}
LL mul = num;
LL ans = (LL)1;
while (n) {
if (n & 1) {
ans = (ans * mul) % mod;
}
mul = (mul * mul) % mod;
n >>= 1;
}
return ans;
}
LL mod_inverse(LL num, LL mod = MOD) {
return powMod(num, MOD - 2, MOD);
}
LL nCk(LL N, LL k, LL mod = MOD) {
LL ans = 1;
if (k == 0 || k == N) {
return 1;
}
ans = (kai[N] * kai_inv[N - k]) % mod;
ans = (ans * kai_inv[k]) % mod;
return ans;
}
LL cal(LL H, LL W,LL K) {
LL ans = 0;
LL base = nCk(H * W - 2, K - 2);
base = (base * H) % MOD;
base = (base * H) % MOD;
for (LL i = 0; i < W; ++i) {
ans += i * (W - i);
ans %= MOD;
}
/*
for (int w1 = 0; w1 < W; ++w1) {
for (int w2 = w1; w2 < W; ++w2) {
ans += abs(w1 - w2);
ans %= MOD;
}
}
*/
ans = (ans * base) % MOD;
return ans;
}
void solve() {
LL N, M, K;
cin >> N >> M >> K;
kai[0] = 1; //kai_inv[0] = mod_inverse(1);
kai[1] = 1; kai_inv[1] = mod_inverse(1);
for (int i = 2; i <= 200000; ++i) {
kai[i] = (kai[i - 1] * i) % MOD;
kai_inv[i] = mod_inverse(kai[i]);
}
LL ans = (cal(N, M, K) + cal(M, N, K)) % MOD;
cout << ans << endl;
}
signed main(void) {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;//小数を10進数表示
cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別
solve();
}
| #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int fact(int n)
{
if(n==0)
return 1;
int ans=1;
for(int i=1;i<=n;i++)
ans*=i;
return ans;
}
int find(int n,int m)
{
int r=fact(n)/(fact(n-m));
return r;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int ans=1;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int mod=pow(10,9)+7;
map<int,int> mp;
mp[-1]=1;
for(int i=0;i<n;i++)
{
int x=arr[i];
int val=mp[x-1];
ans*=val;
ans%=mod;
mp[x]+=1;
if(x-1!=-1&&mp[x-1])
mp[x-1]-=1;
}
int r=0;
for(int i=0;i<n;i++)
{
if(arr[i]==0)
r++;
}
if(r<=3)
ans*=find(3,r);
else
ans=0;
ans%=mod;
cout<<ans<<endl;
return 0;
}
| 0 |
//Radhe Radhe
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
#define yes cout<<"Yes"<<'\n'
#define no cout<<"No"<<'\n'
using namespace std;
int main()
{
godspeed
ll i,j,k,l;
string s;
cin>>s;
if(s.size()%2)
return no,0;
bool ok=1,ishi=1;
for(i=0; i<s.length()-1; i+=2)
{
if(s[i]=='h'&&s[i+1]=='i');
else return no,0;
}
if(ishi)
return yes,0;
return 0;
}
|
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iterator>
#include <random>
#include <chrono>
#define forr(i,start,count) for (int i = (start); i < (start)+(count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) int i; cin >> i
#define readll(i) ll i; cin >> i
#define readdouble(i) double i; cin >> i
#define readstring(s) string s; cin >> s
typedef long long ll;
using namespace std;
int main() {
cout.precision(17);
ll modd = 1000 * 1000 * 1000 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(0, modd); // rand_gen(rng) gets the rand no
ll infinit = 10000000000000000;
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readstring(s);
string h;
forr(i,0,s.size()/2) {h=h+"hi";}
cout << (s == h ? "Yes" : "No") << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define f first
#define s second
#define endl '\n'
#define LL long long
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define debug(x) cerr << #x << " is " << x << endl;
using namespace std;
int const MAXN = 2e6 + 9;
int n, k;
int main(){
ios_base::sync_with_stdio (0),cin.tie(0);
cin >> n >> k;
LL ans = 0;
for (int i = 1; i <= n; i++){
if (i + k - 1<= n) ans++;
}
cout << ans;
}
| #include <bits/stdc++.h>
#define reps(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define rep(i, n) reps(i, 0, n - 1)
#define sper(i, s, n) for (int i = (s); i >= (int)(n); i--)
#define per(i, n) sper(i, n - 1, 0)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int n, k;
cin >> n >> k;
int ans = n - k + 1;
cout << ans << endl;
}
int main()
{
solve();
return 0;
} | 1 |
// #include "pch.h"
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <unordered_map>
#include <stack>
#include <random>
typedef long long ll;
typedef std::pair<int, int> Pii;
typedef std::pair<long long, long long> Pll;
typedef std::pair<double, double> Pdd;
#define rip(i, n, s) for (int i = (s);i < (int)( n ); i++)
#define all(a) a.begin(), a.end()
#define MM << " " <<
template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<typename T>
void vdeb(std::vector<T> &da) {
for (int i = 0;i < da.size();i++) {
if (i == da.size() - 1) std::cout << da[i];
else std::cout << da[i] << ' ';
}
std::cout << '\n';
}
template<typename T>
void vdeb(std::vector<std::vector<T>> &da) {
for (int i = 0;i < da.size();i++) {
std::cout << i << ' ';
vdeb(da[i]);
}
std::cout << '\n';
}
using namespace std;
int solve() {
int n; cin >> n;
vector<ll> da(n);
rip(i,n,0) cin >> da[i];
string s; cin >> s;
vector<ll> bases(0);
for(int i = n-1;i>-1;--i) {
ll now = da[i];
rip(j, bases.size(), 0) chmin(now, now^bases[j]);
if(s[i] == '0' && now > 0) bases.push_back(now);
else if(s[i] == '1' && now > 0) return true;
}
return false;
}
int main() {
int t; cin >> t;
vector<bool> ans(t);
rip(i,t,0) ans[i] = solve();
rip(i,t,0) cout << ans[i] << '\n';
} | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=205;
int T;
int n;
long long a[N];
char s[N];
struct Basis
{
static const int M=60;
long long d[N];
void clear()
{
memset(d,0,sizeof(d));
return;
}
void insert(long long t)
{
for(int i=M;i>=0;i--)
if(t&(1LL<<i))
{
if(d[i]) t^=d[i];
else
{
for(int j=0;j<i;j++)
if(t&(1LL<<j)) t^=d[j];
for(int j=i+1;j<=M;j++)
if(d[j]&(1LL<<i)) d[j]^=t;
d[i]=t;
break;
}
}
return;
}
bool find(long long t)
{
for(int i=M;i>=0;i--)
if(t&(1LL<<i))
{
if(d[i]) t^=d[i];
else return false;
}
return true;
}
}lb;
void solve()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
scanf("%s",s+1);
lb.clear();
for(int i=n;i>=1;i--)
if(s[i]=='1')
{
if(!lb.find(a[i]))
{
printf("1\n");
return;
}
}
else if(s[i]=='0') lb.insert(a[i]);
printf("0\n");
return;
}
int main()
{
scanf("%d",&T);
while(T--)
solve();
return 0;
} | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int k, x;
cin >> k >> x;
int l = x - (k-1);
int r = x + (k-1);
for(int i = l; i < r ; ++i){
cout << i << " ";
}
cout << r << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define EPS (1e-10)
#define equals(a, b) (fabs((a)-(b)) < EPS)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef pair<double,double> PD;
typedef pair<int,P> ed;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
string s;
int w;
cin >> s;
cin >> w;
string ans = "";
rep(i,sz(s)) {
if(i%w!=0) continue;
ans += s[i];
}
cout << ans << endl;
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.