code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5, mod = 1e9 + 7;
int tr[8][2], f[maxn + 10][8], n;
char s[maxn + 10];
int main() {
tr[0][0] = 1; tr[0][1] = 2;
tr[1][0] = 3; tr[1][1] = 4;
tr[2][0] = 5; tr[2][1] = 6;
tr[3][0] = 1; tr[3][1] = 1;
tr[4][0] = 1; tr[4][1] = 2;
tr[5][0] = 7; tr[5][1] = 2;
tr[6][0] = 6; tr[6][1] = 6;
tr[7][0] = 5; tr[7][1] = 5;
scanf("%s", s + 1);
n = strlen(s + 1); f[0][0] = 1;
for (int i = 1; i <= n; ++i)
for (int j = 0; j < 8; ++j)
for (int k = 0; k < 2; ++k)
if (s[i] == '?' || (k + '0' == s[i]))
(f[i][tr[j][k]] += f[i - 1][j]) %= mod;
printf("%d", (f[n][2] + f[n][6]) % mod);
}
| #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
inline void read(int &x) {
x=0; char c=getchar(); int f=1;
while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
inline ui R() {
static ui seed=416;
return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 1060000,mo=998244353,inv2=(mo+1)/2;
int n,m,fac[N],ifac[N];
int power(int a, int n){
int res=1;
while(n){
if(n&1)res=1LL*res*a%mo;a=1LL*a*a%mo;n>>=1;
}
return res;
}
int C(int n, int m){return m>=0&&m<=n?1LL*fac[n]*ifac[m]%mo*ifac[n-m]%mo:0;}
int main() {
read(n);read(m);if(n>m)swap(n,m);
int mx=N-1;fac[0]=1;rep(i,1,mx)fac[i]=1LL*fac[i-1]*i%mo;
ifac[mx]=power(fac[mx],mo-2);per(i,mx-1,0)ifac[i]=1LL*ifac[i+1]*(i+1)%mo;
ll res=m;int ni=power(C(n+m,n),mo-2);
rep(i,0,n-1)res=(res+1LL*inv2*C(n-i+n-i,n-i)%mo*C(i+i+m-n,i)%mo*ni)%mo;cout<<res;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
string str;
cin >> str;
int s = 0;
int t = 0;
int remove_count = 0;
REP(i, str.length()) {
if (str[i] == 'S') {
s++;
} else {
if (s > 0) {
s--;
remove_count += 2;
}
}
}
cout << str.length() - remove_count << endl;
} | # include <iostream>
# include <deque>
using namespace std;
string X;
deque<char> dchar;
int main()
{
cin>>X;
for (int i=0; i<X.size(); i++)
{
dchar.push_back(X[i]);
if (dchar.size()>=2 && dchar[dchar.size()-2]=='S' && dchar[dchar.size()-1]=='T')
{
dchar.pop_back();
dchar.pop_back();
}
}
cout<<dchar.size()<<endl;
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(void){
int N, x, ans=0;
std::cin >> N >> x;
std::vector<int> a(N);
for (int i=0; i<N; ++i){
std::cin >> a.at(i);
}
std::sort(a.begin(), a.end());
for (int i: a) {
x -= i;
if (x < 0){
break;
} else {
++ans;
}
}
if (x > 0 && ans > 0) {
--ans;
}
std::cout << ans << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<ll,ll>;
#define For(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((ll)x.size())
#define MOD (ll)(998244353)
#define INF (9e18)
#define EPS (1e-6)
#ifdef LOCAL_TEST
#define debug(...) do{\
cerr<<__PRETTY_FUNCTION__<<" - "<<__LINE__<<\
" : ("#__VA_ARGS__<<") = ";\
_OUT(__VA_ARGS__);\
}while(0)
template<typename T>void _OUT(T x){cerr<<x<<endl;}
template<typename T,typename...I>void _OUT(T x,I ...tail){cerr<<x<<", ";_OUT(tail...);}
#else
#define debug(...)
#endif
void INIT(){
#ifdef LOCAL_TEST
freopen("D:\\input.in","r",stdin);
freopen("D:\\output.out","w",stdout);
freopen("D:\\error.out","w",stderr);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
}
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }
ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }
ll fpow(ll b,ll p){
b%=MOD;
ll ans=1;
while(p>0){
if(p&1) ans=(ans*b)%MOD;
p/=2;
b=(b*b)%MOD;
}
return ans;
}
int32_t main() {
INIT();
//code...
int n; cin>>n;
vector<int> cnt(n,0);
int t; cin>>t;
if(t!=0){
cout<<"0\n";
return 0;
}
cnt[0]++;
For(i,1,n-1){
cin>>t;
if(t==0){
cout<<"0\n";
return 0;
}
cnt[t]++;
}
int now=1;
ll ans=1;
For(i,1,n-1){
if(cnt[i]==0 && now!=n){
cout<<"0\n";
return 0;
}
ans=(ans*fpow(cnt[i-1],cnt[i]))%MOD;
now+=cnt[i];
}
cout<<ans<<"\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const int N = 1e5 + 123;
int n;
ll a[N];
vector <ll> basis;
void add(ll x) {
for (ll i : basis) {
x = min(x, x ^ i);
}
if (x > 0) {
basis.pb(x);
}
}
int f(ll x) {
for (int i = 59; i >= 0; i--) {
if (x >> i & 1) {
return i;
}
}
return -1;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
cin >> n;
ll t = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
t ^= a[i];
}
ll ans = t, rt = t ^ ((1ll << 60) - 1);
for (int i = 1; i <= n; i++) {
a[i] &= rt;
add(a[i]);
}
sort(all(basis));
reverse(all(basis));
ll res = 0;
for (ll i : basis) {
if (res >> f(i) & 1) {
continue;
}
res ^= i;
}
ans += 2 * res;
cout << ans;
}
| //hail to jwalaji
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
int main(){
//ios::sync_with_stdio(false);
//cin.tie(NULL);
//lli t;
//cin>>t;
//while(t--){
lli n;
cin>>n;
vector<lli> arr(n),store(n);
for(lli i=0;i<n;i++){
cin>>arr[i];
}
store[0]=arr[0]%mod;
for(lli i=1;i<n;i++){
store[i]=(arr[i]+store[i-1])%mod;
}
lli ans=0;
for(lli i=1;i<n;i++){
ans=(ans+store[i-1]*arr[i])%mod;
}
cout<<ans<<endl;
//}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll N; cin >> N;
ll ans = 0;
for(ll i = 1; i <= N; i++){
if( i%3 == 0 || i%5 == 0){
} else {
ans += i;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define _GLIBCXX_DEBUG
int main(){
ll N;
cin>>N;
vector<ll> ex(N+10, 0);
if(N!=1){
for (ll i=2; i<N+1; i++){
ll onway=i; //途中の数
for(ll a=2; a*a<=onway; a++){
if(onway%a!=0)continue;
while(onway%a==0){
ex[a]++;
onway/=a;
}
}
if(onway!=1) ex[onway]++;
}
}
if(N==1) cout<<1<<endl;
else {
ll count=1;
for(ll i=2; i<=N; i++){
if(ex[i]==0)continue;
count*=ex[i]+1;
count%=mod;
}
cout<<count<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i)
{
cin >> a >> b;
v.push_back({a, b});
}
vector<vector<ll>> dp(n, vector<ll>(n, -1));
function<ll(int, int)> f = [&](int i, int j)
{
if (i == j)
return 0LL;
if (dp[i][j] != -1)
return dp[i][j];
ll r = 1LL<<62;
for (int k = i; k < j; ++k)
r = min(r, f(i, k)+f(k+1, j)+v[i].first*v[j].second*v[k].second);
return dp[i][j]=r;
};
cout << f(0, n-1) << "\n";
return 0;
}
| #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using vvi = std::vector<std::vector<int>>;
void solve()
{
using namespace std;
constexpr int inf = (1 << 23);
int n;
cin >> n;
vector<int> d(n + 1);
for (int i = 0; i < n; ++i)
{
cin >> d[i];
if(i + 1 != n)
cin.ignore(numeric_limits<streamsize>::max(), ' ');
}
cin.ignore(numeric_limits<streamsize>::max(), ' ');
cin >> d[n];
vvi dp (n, vector<int>(n, 0));
//自分自身との積は乗算が発生しない
for (int i = 0; i < n; ++i)
dp[i][i] = 0;
for (int l = 1; l < n; ++l)
{
for (int i = 0; i < n - l; ++i)
{
int j = i + l;
dp[i][j] = inf;
for (int k = i; k < j; ++k)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + d[i] * d[k + 1] * d[j + 1]);
}
}
}
cout << dp[0][n - 1] << endl;
}
int main()
{
solve();
return 0;
}
| 1 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
//C++11
#if __cplusplus == 201103L
#include <tuple>
#endif
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<" "; cout<<endl; }
typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int main(){
string s;
map<char, int> m;
m['J'] = 0;
m['O'] = 1;
m['I'] = 2;
while(cin>>s){
s = "I" + s;
int N = s.size();
int cnt[3]={};
int ans = 0;
for(int i = 1; i < N; i++){
int n = m[s[i]];
int b = m[s[i-1]];
if(n < b){
REP(i, 3) cnt[i] = 0;
if(n == 0) cnt[0]++;
}else{
cnt[n]++;
if(cnt[0]>=cnt[1]&&cnt[1]==cnt[2]) ans = max(ans, cnt[1]);
}
}
cout<<ans<<endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int k = 0, sum = 0, a[1000000];
string s;
int main() {
cin >> s;
for(int i = 0; i < s.size(); i++){
sum++;
if(s[i] != s[i + 1]){
for(int j = i - sum + 1; j <= i; j++){
a[j] = sum;
sum--;
}
sum = 0;
}
}
for(int i = 0; i < s.size(); i++){
if(a[i] > k && s[i] == 'J'){
if(a[i + a[i]] == a[i] && s[i + a[i]] == 'O' && a[i + a[i] * 2] >= a[i] && s[i + a[i] * 2] == 'I'){
k = a[i];
}
}
}
cout << k << endl;
return 0;
} | 1 |
/**
DufauX-XuafuD
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define reset(x) memset(x,-1,sizeof(x))
#define CheckBit(a,b) (a&(1ll<<b))
#define SetBit(a,b) a=(a|(1ll<<b))
#define UnSetBit(a,b) a=(a&(~(1ll<<b)))
#define maxx 10000006
#define PI 2*acos(0.0)
const long long INF = 2000000000000000000LL; // 2e18
const int inf = 0x3f3f3f3f; // 1061109567
const long double EPS = 1e-9;
//bitset<maxx/2>vis;
//bitset<maxx>pr;
//int mobi[maxx+10];
//vector<ll>prime;
//void sieve(){
// ll x=maxx/2, y=sqrt(maxx)/2;
// for(ll i=1;i<=y;i++){
// if(vis[i]==0){
// for(ll j=(i*(i+1)*2);j<x;j+=(2*i)+1)
// vis[j]=1;
// }
// }
// prime.push_back(2);
// for(ll i=3;i<maxx;i+=2)
// if(vis[i/2]==0)
// prime.push_back(i);
//}
//void generate_mobius()
//{
// for(int i=0;i<maxx;i++)mobi[i]=1;
// for(int i=2;i<maxx;i++){
// if(!pr[i]){
// mobi[i]*=-1;
// for(int j=i+i;j<maxx;j+=i){
// pr[j]=1;
// mobi[j]*=(j%(i*i)?-1:0);
// }
// }
// }
//}
//bool isprime(ll a)
//{
// if(a==1)return false;
// if(a==2)return true;
// if(a%2==0)return false;
// for(ll i=0;i<prime.size() && prime[i]*prime[i]<=a;i++)
// if(a%prime[i]==0)return false;
// return true;
//}
/* Calculate ( a*b ) %c */
inline ll mulmod(ll a, ll b, ll c) {
ll ret = 0 , cur = a % c ;
while(b) { if(b%2) ret=(ret+cur)%c; cur=(cur<<1)%c; b=b>>1; }
return ret%c;
}
//Calculate (b^p)%m || modular inverse: b^-1 = bigmod(b, m-2, m)
inline ll bigmod(ll b, ll p, ll m){
ll ret = 1, cur = b % m;
while(p) { if(p&1) ret=(ret*cur)%m; cur=(cur*cur)%m; p=p>>1; }
return ret;
}
inline ll modulo(ll a,ll b,ll c) { //Same as big mod, use for numbers over 1e10
ll ret = 1 , cur = a%c ;
while(b) { if(b%2) ret=mulmod(ret,cur,c); cur=mulmod(cur,cur,c); b=b>>1; }
return ret%c ;
}
inline ll power(ll b, ll p){
ll ret = 1, cur = b;
while(p) { if(p&1) ret=(ret*cur); cur=(cur*cur); p=p>>1; }
return ret;
}
ll lcm(ll a,ll b)
{
return (a/__gcd(a,b))*b;
}
ll gcd(ll a,ll b)
{
return __gcd(a,b);
}
void Dufaux()
{
ll sx,sy,tx,ty;
cin>>sx>>sy>>tx>>ty;
string ans="";
for(int i=0;i<ty-sy;i++)ans+="U";
for(int i=0;i<tx-sx;i++)ans+="R";
for(int i=0;i<ty-sy;i++)ans+="D";
for(int i=0;i<tx-sx;i++)ans+="L";
ans+="L";
for(int i=0;i<ty-sy+1;i++)ans+="U";
for(int i=0;i<tx-sx+1;i++)ans+="R";
ans+="D";
ans+="R";
for(int i=0;i<ty-sy+1;i++)ans+="D";
for(int i=0;i<tx-sx+1;i++)ans+="L";
ans+="U";
cout<<ans<<endl;
}
int main()
{
FastIO;
///sieve();
///generate_mobius();
int test=1;
while(test--){
Dufaux();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int64_t modpow(int64_t x, int64_t n) {
const int MOD = 998244353;
x = x%MOD;
if(n==0) return 1; //再帰の終了条件
else if(n%2==1) {
return (x*modpow(x, n-1))%MOD; //nが奇数ならnを1ずらす
}
else return modpow((x*x)%MOD, n/2)%MOD; //nが偶数ならnが半分になる
}
int main() {
int64_t n,m,k;
cin>>n>>m>>k;
const int MOD = 998244353;
int64_t m_1[k+1];
int64_t start = n-1-k;
m_1[0] = modpow(m-1, start);
for(int i=1; i<=k; i++) {
m_1[i] = (m_1[i-1]*(m-1))%MOD;
}
int64_t ans = 0;
int64_t comb = 1;
for(int i=0; i<=k; i++) {
int64_t add = (comb*m_1[k-i])%MOD;
ans += add;
ans = ans%MOD;
comb = (comb*(n-1-i))%MOD;
int64_t div = modpow((i+1), MOD-2);
comb = (comb*div)%MOD;
}
ans = (ans*m)%MOD;
cout<<ans<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define repi(i, x) \
for (auto i = (x).begin(), i##_fin = (x).end(); i != i##_fin; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int, int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long, long long> P;
typedef vector<P> VP;
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;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) { is >> v[i]; }
return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
int n;
string s;
ll ans = 0LL;
cin >> n >> s;
vector<string> dis1, dis2;
string bef = "";
for (int bit = 0; bit < (1 << n); bit++) {
bef = "";
for (int i = 0; i < n; i++) {
if (bit & (1 << i)) {
bef += s[i];
}
}
bef += '0';
for (int i = n - 1; i >= 0; i--) {
if ((bit & (1 << i)) == 0) {
bef += s[i];
}
}
dis1.pb(bef);
// clog << bef << endl;
bef = "";
//--------//
for (int i = n - 1; i >= 0; i--) {
if ((bit & (1 << i)) == 0) {
bef += s[i + n];
}
}
bef += '0';
for (int i = 0; i < n; i++) {
if (bit & (1 << i)) {
bef += s[i + n];
}
}
dis2.pb(bef);
// clog << bef << endl;
}
sort(all(dis1));
sort(all(dis2));
repi(i,dis1){
ans +=
distance(lower_bound(all(dis2), *i), upper_bound(all(dis2), *i) );
// clog << ans << endl;
}
cout << ans << endl;
}
/*
半分全挙列
chose red; head last: blue
chose bule: head last: red
top!= head: rr- bb- -> 2n:: n
2^n * log(n^2)
cabaacba = caba \ acba
c -> / aba ->
aba <-/ <- c
== c aba / c aba
ab ->/ ac
ca <-/ ba
== ab ac / ab ac
*/ | #include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gpu_hash_map<int, int> mp;*/
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 62;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const double PI = acos(-1);
const double eps = -1e6;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 1001;
ll arr[mxN];
ll b[mxN];
int cnt[mxN*mxN];
ll n, m;
int main() {
//freopen("file.in", "r", stdin);
//freopen("file.out", "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m;
owo(i, 0, n) {
cin>>arr[i];
cnt[arr[i]]++;
if(cnt[arr[i]]>1) {
cout<<"0\n";
exit(0);
}
}
memset(cnt, 0, sizeof(cnt));
owo(i, 0, m) {
cin>>b[i];
cnt[b[i]]++;
if(cnt[b[i]]>1) {
cout<<"0\n";
exit(0);
}
}
ll ans = 1;
sort(arr, arr+n);
sort(b, b+m);
reverse(arr, arr+n);
reverse(b, b+m);
ll aidx = 0;
ll bidx = 0;
for(ll nxt=n*m; nxt>0; --nxt) {
while(aidx<n&&arr[aidx]>=nxt)aidx++;
while(bidx<m&&b[bidx]>=nxt)bidx++;
if(arr[aidx-1]==nxt&&b[bidx-1]==nxt) {
ans = (ans*1LL)%MOD;
}else if(arr[aidx-1]==nxt) {
ans = (ans * bidx)%MOD;
}else if(b[bidx-1]==nxt) {
ans = (ans * aidx)%MOD;
}else {
ans = (ans * max((aidx * bidx - n * m + nxt), 0LL))%MOD;
}
}
cout<<ans<<"\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
#define lid id << 1
#define rid id << 1 | 1
using namespace std;
const int MAXN = 2e5 + 5;
const int INF = 1e9;
int h, w, a[MAXN], L[MAXN], R[MAXN], ans[MAXN];
template <class T>
void read(T &x, T f = 1, char ch = getchar()) {
x = 0;
while (ch < '0' || ch > '9') f = (ch == '-' ? -1 : 1), ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
x *= f;
}
// a[i] = a[i-1] i∉[L,R]
// a[i] = a[L-1] -L + 1 + i i∈[L,R];
struct Node {
int l, r, mi, lval;
bool tag;
Node() { mi = lval = 0, tag = 0; }
// mi denotes the minimum a in [l,r]
// lval denotes the value of the left end point of [l,r]
} tr[MAXN * 4];
void update(int id) {
tr[id].mi = min(tr[lid].mi, tr[rid].mi);
tr[id].lval = tr[lid].lval;
}
void pushdown(int id) {
if (tr[id].tag) {
tr[lid].tag = 1;
tr[lid].lval = tr[lid].mi = tr[id].lval;
tr[rid].tag = 1;
tr[rid].lval = tr[rid].mi = tr[id].lval + tr[rid].l - tr[lid].l;
tr[id].tag = 0;
}
}
void build(int id, int l, int r) {
tr[id].l = l, tr[id].r = r;
if (l == r) return;
int mid = l + r >> 1;
build(lid, l, mid);
build(rid, mid + 1, r);
}
void modify(int id, int l, int r, int val) {
if (tr[id].l == l && tr[id].r == r) {
tr[id].mi = tr[id].lval = val;
tr[id].tag = 1;
return;
}
pushdown(id);
int mid = tr[id].l + tr[id].r >> 1;
if (r <= mid)
modify(lid, l, r, val);
else if (l > mid)
modify(rid, l, r, val);
else {
modify(lid, l, mid, val);
modify(rid, mid + 1, r, val + mid + 1 - l);
}
update(id);
}
int query(int id, int l, int r) {
if (r < 1) return INF;
if (tr[id].l == l && tr[id].r == r) {
return tr[id].mi;
}
pushdown(id);
int mid = tr[id].l + tr[id].r >> 1;
if (r <= mid)
return query(lid, l, r);
else if (l > mid)
return query(rid, l, r);
else
return min(query(lid, l, mid), query(rid, mid + 1, r));
}
int main() {
read(h), read(w);
for (int i = 1; i <= h; i++) read(L[i]), read(R[i]);
fill(ans + 1, ans + h + 2, -1);
build(1, 1, w);
for (int i = 2; i <= h + 1; i++) {
int tmp = query(1, L[i - 1] - 1, L[i - 1] - 1);
modify(1, L[i - 1], R[i - 1], tmp + 1);
int mi = query(1, 1, w);
if (mi >= INF) break;
ans[i] = mi + i - 1;
}
for (int i = 2; i <= h + 1; i++) printf("%d\n", ans[i]);
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
long long l[n];
for (int i = 0; i < n; ++i) cin >> l[i];
sort(l, l + n);
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (l[i] == l[j]) continue;
for (int k = j + 1; k < n; ++k) {
if (l[i] == l[k] || l[j] == l[k]) continue;
if (l[i] + l[j] <= l[k]) break;
cnt++;
}
}
}
cout << cnt << endl;
}
| 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
void read(){
}
template<typename First, typename... Rest>
void read(First& first, Rest&... rest){
cin >> first;
read(rest...);
}
//配列を区切って出力する
template<typename T>
void write_vec(vector<T>& v, char divider){
for(size_t i = 0; i < v.size(); i++){
cout << v[i] << divider;
}
}
};
int main(){
Stream io;
int N, K;
io.read(N, K);
if(N % K == 0) cout << 0;
else cout << 1;
return 0;
} | // 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;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s.substr(i, 2) == "AC") {
cout << "Yes" << '\n';
return;
}
}
cout << "No" << '\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();
}
| 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(b<a) { a=b; return 1; } return 0; }
int main(){
int n; cin >> n;
vi a(n); rep(i,n) cin >> a[i];
vi cnt(n);
for(int i = n-1; 0 <= i; i--){
int sum = 0;
for(int j = i; j < n; j += i+1) sum ^= cnt[j];
cnt[i] = sum^a[i];
}
vi ans;
rep(i,n) if(cnt[i]) ans.push_back(i+1);
cout << ans.size() << "\n";
if(ans.size()) for(auto x : ans) cout << x << " ";
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
const int mod = 1000000007;
int main()
{
int N;
cin >> N;
vector<bool> a(N + 1);
for (int i = 1; i <= N; i++) {
int ai;
cin >> ai;
if (ai == 1) {
a[i] = false;
} else {
a[i] = true;
}
}
vector<bool> c(N + 1, false); //すくなくとも1つはiの倍数（i自身）があるのでfalse(割ったあまりが1)
vector<vector<int>> divisor(N + 1);
for (int i = 1; i <= N; i++) {
for (int j = 2 * i; j <= N; j += i) {
divisor[j].push_back(i);
}
}
vector<int> b;
for (int i = N; i >= 1; i--) {
if (a[i] == c[i]) {
b.push_back(i);
for (int d : divisor[i]) {
c[d] = !c[d];
}
}
}
reverse(b.begin(), b.end());
int M = b.size();
cout << M << endl;
rep(i, M)
{
printf("%d%c", b[i], i == M - 1 ? '\n' : ' ');
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n, k;
cin >> n >> k;
k--;
cout << n - k << endl;
} | #include <iostream>
#include <numeric>
#include <math.h>
#include <algorithm>
#include <float.h>
#include <limits>
#include <vector>
#include <string.h>
#include <iomanip>
#define rep(i,a,n) for(ll int (i) = (a);(i) < (n);(i)++)
#define urep(i,a,n) for(ll int (i) = (a);(i) > (n);(i)--)
#define MOD 1000000007
#define INF 2147483647
#define ll long long
#define asort(a) sort(a.begin(),a.end());//昇順ソート
#define usort(a) sort(a.rbegin(),a.rend());//降順ソート
using namespace::std;
int jo(ll int a, ll int b){//累乗
ll int num=1;
rep(i,0,b) num=num*a;
return num;
}
char tobig(char s){//char大文字化
return (s-0x20);
}
char tolow(char s){//char小文字化
return (s+0x20);
}
int ctoi(char a){//char->int
if('0'<=a&&a<='9') return (a-'0');
return -1;
}
int gcd(ll int a,ll int b) {//最大公約数
if(a<b) return gcd(b,a);
int c;
while ((c=a%b)) {
a=b;
b=c;
}
return b;
}
int lcm(ll int a,ll int b){//最小公倍数
return (a*b)/gcd(a,b);
}
int main(){
int A,B; cin>>A>>B;
cout<<A-B+1;
}
// vector<vector<int>> 変数名(左の個数, vector<int>(右の個数));
//cout<<fixed<<setprecision(n); //小数点n桁まで表示
// vector<pair<int,int>> data(N); //2つのデータを格納、.first/.secondで参照
// pairのソートはfirst優先の昇順
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return true;} return false;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
vector<vector<char>> d(100, vector<char>(100));
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){
int r,c;
cin >> r >> c;
int sy = 0, sx = 0;
int gx, gy;
gx = r-1, gy = c-1;
int cnt_w = 0;
rep(i, r){
rep(j, c){
cin >> d.at(i).at(j);
if(d[i].at(j) == '.'){
cnt_w++;
}
}
}
vvi dep(r, vi(c, -1));
dep.at(sy).at(sx) = 0;
queue<pair<int, int> > que;
que.push(make_pair(sy, sx));
while(!que.empty()){
pair<int, int> pos = que.front();
que.pop();
int x = pos.second;
int y = pos.first;
rep(i, 4){
int nx = x + dx[i];
int ny = y + dy[i];
if(nx < 0 || nx > c-1 || ny < 0 || ny > r-1)
continue;
if(d.at(ny).at(nx) == '#')
continue;
if(dep.at(ny).at(nx) == -1){
que.push(make_pair(ny, nx));
dep.at(ny).at(nx) = dep.at(y).at(x) + 1;
}
}
}
/*
rep(i, r){
rep(j, c){
printf("%3d", dep.at(i).at(j));
}
cout << endl;
}
*/
if(dep.at(gx).at(gy) == -1) {
cout << -1 << endl;
}
else {
cout << cnt_w - dep.at(gx).at(gy)-1 << endl;
}
return 0;
} |
// D - Make Them Even
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
struct Cell {
int y;
int x;
int c;
};
struct Move {
int y1;
int x1;
int y2;
int x2;
};
int field[500][500];
Cell cells[500 * 500];
int main() {
int H, W;
cin >> H >> W;
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {
cin >> field[i][j];
}
}
int k = 0;
for (int i=0; i<H; i++) {
if (i % 2 == 0) {
for (int j=0; j<W; j++) {
cells[k] = {i, j, field[i][j]};
k++;
}
} else {
for (int j=W-1; j>=0; j--) {
cells[k] = {i, j, field[i][j]};
k++;
}
}
}
int N = 0;
vector<Move> ans;
for (int i=0; i<H*W-1; i++) {
if (cells[i].c % 2 == 1) {
ans.push_back(Move{cells[i].y, cells[i].x, cells[i+1].y, cells[i+1].x});
cells[i+1].c++;
N++;
}
}
cout << N << endl;
for (Move a : ans) {
cout << a.y1 + 1 << " " << a.x1 + 1 << " " << a.y2 + 1 << " " << a.x2 + 1 << endl;
}
return 0;
} | 0 |
#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>;
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hour;
int min;
int t1, t2, t3;
t3 = h2 * 60 + m2;
t2 = t3 - k;
t1 = h1 * 60 + m1;
int ans;
ans = t2 - t1;
cout << ans << endl;
} | #include<cstdio>
#include<iostream>
using namespace std;
#define ll long long
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
char sep[2] = {' ', '\n'};
int main() {
int i, j, k;
int n;
int a[110];
cin >> n;
rep(i, n) cin >> a[n - i - 1];
rep(i, n) cout << a[i] << sep[(i == n - 1)];
cout << flush;
return 0;
}
| 0 |
#include <iostream>
#include <math.h>
using namespace std;
int insertionSort(int, int, int);
void shellSort(int* , int);
int cnt = 0;
int main(void)
{
int A[1000000], N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
shellSort(A, N);
}
int insertionSort(int A[], int n, int g)
{
int v, j, cnt = 0;
for (int i = g; i < n; i++) {
v = A[i];
j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j = j - g;
cnt++;
}
A[j + g] = v;
}
return (cnt);
}
void shellSort(int A[], int n)
{
int cnt = 0;
int m = 0;
int G[13] = { };
do {
if (m == 0) { G[0] = n - 1; }
else { G[m] = G[m - 1] / 2; }
m++;
} while (G[m - 1] > 1);
cout << m << endl;
for (int i = 0; i < m; i++) {
cnt += insertionSort(A, n, G[i]);
cout << G[i] << " ";
}
cout << endl << cnt << endl;
for (int i = 0; i < n; i++) {
cout << A[i] << endl;
}
} | /*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI =3.141592653589793238463;
bool compare(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
return (a.first > b.first);
}
ll lcm(ll a,ll b)
{
if(a==0 || b==0)return 0;
return a/__gcd(a,b)*b;
}
void input(ll ara[],ll n)
{
for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
for(ll i=0; i<n; i++)
cout<<ara[i]<<" ";
cout<<endl;
}
int main()
{
fastread();
ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;
bool flag=true;
string str;
cin>>n;
ll ara[n+2],bra[n+2];
input(ara,n);
input(bra,n);
sort(bra,bra+n,greater<ll>());
for(i=0; i<n; i++)
{
if(ara[i]==bra[i])
{
bool ok=false;
for(j=0; j<n; j++)
{
if(j<i && ara[i]!=bra[j] && bra[i]!=ara[j])
{
swap(bra[i],bra[j]);
ok=true;
break;
}
else if(n-j-1>i)
{
p=n-j-1;
if(ara[i]!=bra[p])
{
swap(bra[i],bra[p]);
ok=true;
break;
}
}
}
if(ok==false)
{
flag=ok;
break;
}
}
}
if(flag)
{
for(i=0; i<n; i++)
{
if(ara[i]==bra[i])
{
flag=false;
break;
}
}
}
if(flag==false)
cout<<"No"<<endl;
else
{
cout<<"Yes"<<endl;
for(i=0; i<n; i++)
{
cout<<bra[i]<<" ";
}
cout<<endl;
}
}
| 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include <numeric>
#include<queue>
#include<climits>
#include<cstdio>
#include<map>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
//#define INF ((LLONG_MAX) / (2))
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
typedef pair<ll,int> LL_IP;
typedef pair<ll,ll> LL_LLP;
#define INF 1000000007
#define MAX_H 20000
#define ARRAY_MAX 200005
typedef struct union_find{
int pa[ARRAY_MAX];
int ra[ARRAY_MAX];
//vector<int> pa(ARRAY_MAX);//親
//vector<int> ra(ARRAY_MAX);//木の深さ
//n要素で初期化
void init(int n){
for(int i = 0;i < n;i++){
pa[i] = i;/*各ノードに番号を振る,この時par[x]=xとなる時は木の根となる*/
ra[i] = 0;/*各ノード自体の高さは0*/
}
}
//木の根を求める
int find(int x){
if(pa[x] == x){
return x;/*根ならそのノードの番号を返す*/
}else{
return pa[x] = find(pa[x]);/*根でないならさらにノードの根を探す*/
}
}
//xとyの属する集合を併合する
void unite(int x,int y){
x = find(x);//xの根の番号を探す
y = find(y);//yの根の番号を探す
if(x == y){//一致すればつながっている
return;
}
if(ra[x] < ra[y]){//xの高さが低いなら高いほうにつなぐ、そして高さは大きい方(y)になる
pa[x] = y;
}else{
pa[y] = x;//yの高さが低いなら高いほうにつなぐ、そして高さは大きいほう(x)になる
if(ra[x] == ra[y]){//高さが一致しているなら併合の高さは1増える
ra[x]++;
}
}
}
//xとyが同じ集合に属するか判定
bool same(int x,int y){
return find(x) == find(y);//同じ集合なら1、違うなら0が返る
}
}UF;
UF road,rail;
int main(){
int n,k,l;
cin >> n >> k >> l;
road.init(n+2);
rail.init(n+2);
REP(i,k){
/*道路*/
int p,q;
cin >> p >> q;
p--;q--;/*配列の添え字に合わせる*/
road.unite(p,q);
}
REP(i,l){
/*鉄道*/
int r,s;
cin >> r >> s;
r--;s--;/*配列の添え字に合わせる*/
rail.unite(r,s);
}
map<P,int> mp;
REP(i,n){
/*i番目の都市の親のペアをカウント、一致するペアがあればi番目の都市と道路でも鉄道でも連結している*/
mp[P(road.find(i),rail.find(i))]++;
}
map<P,int>::iterator itr;
REP(i,n){
if(i == 0){
cout << mp[P(road.find(i),rail.find(i))];
}else{
cout << " " << mp[P(road.find(i),rail.find(i))];
}
}
cout << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
using Graph = vector<vector<int>>;
Graph G;
int main(){
int n, m, q; cin >> n >> m >> q;
int a, b;
vector<vector<int>> count(501, vector<int>(501, 0));
rep(i, m){
cin >> a >> b;
count[a][b]++;
}
vector<vector<int>> sum(501, vector<int>(501, 0));
_rep(i, 1, n + 1)_rep(j, 1, n + 1){
sum[i][j] = sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1] + count[i][j];
}
rep(i, q){
cin >> a >> b;
cout << sum[b][b] - sum[b][a - 1]- sum[a - 1][b] + sum[a - 1][a - 1] << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a, b, c;
cin >> a >> b >> c;
if (a.at(a.size() - 1) == b.at(0) && b.at(b.size() - 1) == c.at(0))
{
puts("YES");
}
else
{
puts("NO");
}
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string S;
cin >> S;
bool ans = true;
//1
if (S[0]!='A') ans = false;
//2
int Ccnt = 0;
for (int i = 2; i <= S.length()-2; i++) {
if (S[i]=='C') Ccnt++;
}
if (Ccnt!=1) ans = false;
//3
int CpCnt = 0;
for (int i = 0; i < S.length(); i++) {
if (('A'<= S[i]) && (S[i] <= 'Z')) CpCnt++;
}
if (CpCnt != 2) ans = false;
if (ans) cout << "AC" << endl;
else cout << "WA" << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
int k, n;
int main() {
DAU
cin >> k >> n;
for (int i = n - k + 1; i < n + k; ++i)
cout << i << ' ';
PLEC
}
| #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
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
#define lsc(x) scanf("%lld",&x)
#define sc(x) scanf("%d",&x)
#define lpr(x) printf("%lld ",(long long)x)
#define pr(x) printf("%d ",x)
#define n_l printf("\n")
#define VI vector<int>
#define VII vector<long long int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define mset(x,y) memset(x,y,sizeof(x))
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define fr(i, a, n) for(int i=a;i<=n;i++)
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
const int N=(int)1e6+5;
const int mod = 1000000007;
typedef long long ll;
// order_of_key (val): returns the no. of values strictly less than val
// find_by_order (k): returns the kth largest element iterator.(0-based)
// vector<int>::iterator itr=lower_bound(v.begin(),v.end(),x);
// s.substr(pos[0-indexed], len(default=till end))
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
ll fmod(ll x){if (x<mod) return x;return x%mod;}
ll mul(ll a, ll b, ll c){
ll ret=0;while(b){if (b%2) ret=(ret+a)%c;a=(a*2)%c;b>>=1;}
return ret;
}
int modpow(ll a, ll b){
ll ret=1;while(b){if (b%2) ret=(ret*a)%mod;a=(a*a)%mod;b>>=1;}
return (int)ret;
}
inline int inv(int x){ return modpow(x, mod-2);}
int isprime[N];
void calc_prime(){
isprime[1]=1;for(ll i=2;i<N;i++) if (!isprime[i]) for(ll j=i*i;j<N;j+=i) isprime[j]=1;
}
int ans[N];
#define pii pair<int, int>
set<pair<int, pii> > s;
set<pii> pers;
int main(){
int n, q;
sc(n);sc(q);
fr(i, 1, n){
int st, en, x;
sc(st);sc(en);sc(x);
s.insert({x, {st, en}});
}
fr(i,1,q){
int x;sc(x);
pers.insert({x, i});
}
fr(i, 1, q) ans[i] = -1;
for(auto it: s){
int x = it.fi;
int st = it.se.fi;
int en = it.se.se;
while(pers.size()){
auto lb = pers.lower_bound({st - x, -1});
if (lb == pers.end()) break;
if (lb->fi < en-x){
pers.erase(lb);
ans[lb->se] = x;
}
else break;
}
}
fr(i,1,q){
pr(ans[i]);n_l;
}
return 0;
}
| 0 |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
if (x1 == x2){
cout << setprecision(12) << fabs(y1 - y2) << endl;
}
else if (y1 == y2){
cout << setprecision(12) << fabs(x1 - x2) << endl;
}
else {
cout << setprecision(12) << sqrt(pow(fabs(x1 - x2), 2) + pow(fabs(y1 - y2), 2)) << endl;
}
return 0;
}
| #include <iostream>
#include <math.h>
#include <cstdio>
using namespace std;
int main(){
double x1, y1, x2, y2;
double ans;
cin >> x1 >> y1 >> x2 >> y2;
ans = pow((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1), 0.5);
printf("%.8f\n", ans);
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) num = num * 10 + (ch & 15);
if(neg) num = -num;
}
int N, K;
int main(){
getint(N), getint(K);
return printf("%d\n", N - K + 1), 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin>> n;
vector<ll> a(100000);
set<ll> memo;
for(int i=0; i<n; i++){
cin >> a[i];
if(memo.count(a[i])){
memo.erase(a[i]);
}else{
memo.insert(a[i]);
}
}
int ans = memo.size();
cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(void){
int n;
cin>>n;
while(n--){
int out = 0;
int first=0,second=0,third=0,score=0;
while(out < 3){
string s;
cin>>s;
if(s == "HIT"){
score += third;
third = second;
second = first;
first = 1;
}
else if(s == "HOMERUN"){
score += third + second + first + 1;
third = second = first = 0;
}
else{
out++;
}
}
cout<<score<<endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin>>n;
string event;
getline(cin,event,'\n');
int i=0,out,b,score;
while(n>0){
out = 0;
b = 0;
score=0;
while(out<3){
getline(cin,event,'\n');
if(event=="HIT"){
b*=2;
b+=1;
if(b>8){
b-=8;
score++;
}
}
if(event=="HOMERUN"){
while(b>0){
score+=b%2;
b/=2;
}
score++;
}
if(event=="OUT"){
out++;
}
}
cout<<score<<endl;
n--;
}
return 0;
} | 1 |
#include<iostream>
#include <stdio.h>
#include<string>
using namespace std;
int main(){
int n;
string line;
scanf("%d ",&n);
for(int x=0;x<n;x++){
getline(cin,line);
while (line.find("Hoshino") != string::npos) {
line.replace(line.find("Hoshino"), 7, "Hoshina");
}
cout << line << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
static const int MAX = 200000;
using namespace std;
int bubbleSort(int a[], int n){
int sw = 0;
bool flag = 1;
for(int i = 0; flag; i++){
flag = 0;
for(int j = n -1; j >= i + 1; j--){
if(a[j] < a[j-1]){
swap(a[j], a[j-1]);
flag = 1;
sw++;
}
}
}
return sw;
}
int main(int argc, const char * argv[]) {
int n, a[MAX], sw;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
sw = bubbleSort(a, n);
for(int i = 0; i < n; i++){
if(i) cout << " ";
cout << a[i];
}
cout << endl;
cout << sw << endl;
return 0;
}
| 0 |
#include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
int R;
double ans;
cin >> R;
ans = R * PI * 2;
cout << ans << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <functional>
template<typename T> struct segment_tree {
private :
int N;
std::vector<T> value;
public :
const std::function<T(T, T)> op;
const T id;
segment_tree(const std::vector<T>& a, const std::function<T(T, T)>& f, const T& t) : op(f), id(t) {
int n = a.size(), m = 1;
while (m < n) m *= 2;
value.resize((N = m) * 2, id);
for (int i = 0; i < n; i++) value[N + i] = a[i];
for (int i = N - 1; i > 0; i--) value[i] = op(value[i * 2], value[i * 2 + 1]);
}
segment_tree(const int& n, const std::function<T(T, T)>& f, const T& t) : op(f), id(t) {
int m = 1;
while (m < n) m *= 2;
value.resize((N = m) * 2, id);
}
inline const int& size()const{return N;}
void point_update(int i, const std::function<T(T, T)>& f, const T& t) {
i += N;
value[i] = f(value[i], t);
while (i /= 2) value[i] = op(value[i * 2], value[i * 2 + 1]);
}
T range_fold(const int& L, const int& R, const int& i = 1, const int& l = 0, int r = -1) {
if (r == -1) r = N;
if (L <= l && r <= R) return value[i];
if (r <= L || R <= l) return id;
return op(
range_fold(L, R, i * 2, l, (l + r) / 2),
range_fold(L, R, i * 2 + 1, (l + r) / 2, r)
);
}
inline const T& operator[](const int& i)const{return value[N + i];}
};
int main() {
int n, q;
std::cin >> n >> q;
std::vector<long long> a(n);
for (int i = 0; i < n; i++) std::cin >> a[i];
segment_tree<long long> sg(a, [](long long a, long long b){return a + b;}, 0);
while (q--) {
int op;
std::cin >> op;
if (op == 0) {
int p; long long x;
std::cin >> p >> x;
sg.point_update(p, [](long long a, long long b){return a + b;}, x);
} else {
int l, r;
std::cin >> l >> r;
std::cout << sg.range_fold(l, r) << '\n';
}
}
return 0;
} | #include <bits/stdc++.h>
#include <atcoder/all>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int,int>;
constexpr int INF = 1001001001;
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 (a>b) { a=b; return 1; } return 0; }
int main() {
int n, q;
cin >> n >> q;
fenwick_tree<ll> fw(n);
rep (i, n) {
int a;
cin >> a;
fw.add(i, a);
}
rep (i, q) {
int t, a, b;
cin >> t >> a >> b;
if (t == 0) fw.add(a, b);
else cout << fw.sum(a, b) << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//const int INF = 2e9;
//const ll INF = 9e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
if (N==1){
cout << M << "\n";
return 0;
}
vector<int> div;
for (int i=1;i*i<=M;i++){
if (M%i == 0){
div.push_back(i);
if (i*i!=M){
div.push_back(M/i);
}
}
}
sort(div.begin(),div.end());
int p = 0;
for (int i=0;i<div.size();i++){
if ((ll)div[i]*(ll)N>(ll)M) {
p = i;
break;
}
}
int ans;
ans = div[p-1];
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
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;
}
//グリッド：（典型）dp,dfs,bfs,最短経路,その他
ll n,m;
ll num[10]={2,5,5,4,5,6,3,7,6};
string dp[11000];
void chmax2(string &a,string b){
if(a=="-") a=b;
if(a.size()<b.size()) a=b;
else if(a.size()==b.size()){
if(a<b) a=b;
}
}
int main(){
cin>>n>>m;
vl a(m);rep(i,m)cin>>a[i];
rep(i,11000)dp[i]="-";
dp[0]="";
for(int i=0;i<=n;i++){
if(dp[i]=="-") continue;
for(auto aa:a){
string b=dp[i]+(char)('0'+aa);
chmax2(dp[i+num[aa-1]],b);
}
}
cout<<dp[n]<<endl;
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
long long n, l;
cin >> n >> l;
long long n_sum = n*l + n*(n-1)/2;
long long min_delta = 1e12;
long long minv;
for(long long i = 0; i < n; i++){
long long sum = n_sum - (l+i);
if(min_delta > abs(n_sum - sum)){
min_delta = abs(n_sum - sum);
minv = sum;
}
}
cout << minv << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int min = INT32_MAX;
int flavor = 0;
for (int i = 1; i <= n; ++i) {
if (abs(i + l - 1) < abs(min)) {
min = i + l - 1;
}
flavor += i + l - 1;
}
flavor -= min;
cout << flavor << '\n';
} | 1 |
#include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p = 1e9, ans = 1e9;
string bigG;
cin >> n;
if(n <= 100 * (n / 100) + 10 * (n / 100) + 1 * (n / 100)){
cout << 100 * (n / 100) + 10 * (n / 100) + 1 * (n / 100);
}else{
cout << 100 * (n / 100 + 1) + 10 * (n / 100 + 1) + 1 * (n / 100 + 1);
}
return 0;
}
| #include <iostream>
using namespace std;
int main(){
int n; cin >>n;
for(int i = n; i < 1000; i++){
if(i % 111 == 0){
cout << i << endl;
return 0;
}
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define DISP1(as) for(auto it : as) cout<<it.f<<" "<<it.s<<") ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"///REACHED///\n";
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 2e+5 + 99;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, k, l, q, x, y;
string s, t;
ll prime[2000000];
// < ----------- func eh ---------------- ? //
// <------------- Start of main() -------------------> //
void MAIN() {
ll h, m1, m2;
cin >> h >> m1; m1 += 60 * h;
cin >> h >> m2; m2 += 60 * h;
cin>>k;
m2-=k;
cout<<max(0ll,m2-m1);newl;
}
int main() {
fastio; randomINT;
//cin >> T;
while (T--) {
MAIN();
}
return 0;
} | #include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>
using namespace std;
#define REP(i,n) for(int i=0;i<int(n);i++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
typedef long long ll;
typedef pair<int,int> P;
int par[10010];
void init(int n){
REP(i,n){
par[i]=i;
}
}
int find(int x){
if(par[x]==x){
return x;
}else{
return par[x]=find(par[x]);
}
}
void unite(int x,int y){
x=find(x); y=find(y);
if(x==y) return;
par[x]=y;
}
bool same(int x,int y){
return find(x)==find(y);
}
struct edge { int from,to,cost; };
bool comp(const edge& e1,const edge& e2){
return e1.cost<e2.cost;
}
edge es[100010];
int V,E;
int kruskal(){
sort(es,es+E,comp);
init(V);
int res=0;
REP(i,E){
edge e=es[i];
if(!same(e.from,e.to)){
unite(e.from,e.to);
res+=e.cost;
}
}
return res;
}
int main(void){
cin >> V >> E;
REP(i,E){
cin >> es[i].from >> es[i].to >> es[i].cost;
}
cout << kruskal() << endl;
return 0;
} | 0 |
//g++ -std=c++14 test.cpp -o test.out
//問題URL:
//https://atcoder.jp/contests/arc100/tasks/arc100_b
//参考：
// https://drken1215.hatenablog.com/entry/2018/08/28/193000
// ポイント：理想の状況がどういう時かを考える
// Max-minが最小になるのはどういう時？
// →PQSTどれ2つをとっても、差ができるだけ小さくなっているはず
// （あえて大きくしてもいいが、それだとMax-minが大きくなってしまう危険をはらんでいる上に、
// Max-minをもっと小さくする、といったことができない）
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (1LL<<60);
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
LL N;
LL A[200000];
LL ans = INF;
void solve(){
vector<LL> accum(N,A[0]);
for(int i=1;i<N;i++) accum[i] = accum[i-1] + A[i];
//切れ込み3箇所のうち、真ん中を決めうち
//インデックスi番目の直後に入れることを想定
for(int middle=1;middle<=N-3;middle++){
auto search = [&](int left_index,int right_index){
LL left = left_index;
LL right = right_index-1;
while(left+1<right){
LL center = (left+right)/2LL;
LL leftside = accum[center] - ((left_index==0)?0:accum[left_index-1]);
LL rightside = accum[right_index] - accum[center];
if(leftside==rightside) return center;
if(leftside>rightside) right = center;
if(leftside<rightside) left = center;
}
LL left_diff,right_diff;
{
LL leftside = accum[left] - ((left_index==0)?0:accum[left_index-1]);
LL rightside = accum[right_index] - accum[left];
left_diff = abs(rightside-leftside);
}
{
LL leftside = accum[right] - ((left_index==0)?0:accum[left_index-1]);
LL rightside = accum[right_index] - accum[right];
right_diff = abs(rightside-leftside);
}
return (left_diff<right_diff)?left:right;
};
LL left = search(0,middle);
LL right = search(middle+1,N-1);
LL P = accum[left];
LL Q = accum[middle] - accum[left];
LL R = accum[right] - accum[middle];
LL S = accum[N-1] - accum[right];
LL cand = max(max(P,Q),max(R,S)) - min(min(P,Q),min(R,S));
ans = min(ans,cand);
}
}
int main(){
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
solve();
cout << ans << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <limits>
#include <set>
#include <map>
#include <functional>
#include <inttypes.h>
#include <limits.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
using namespace std;
typedef long long ll;
#ifndef PRId64
#define PRId64 "lld"
#endif
#ifndef SCNd64
#define SCNd64 "lld"
#endif
#define SC sc()
#define PT pr()
#define FORi(i,b,e) for (int i = (b), _ = (e); i < _; ++i)
#define FORe(i,b,e) for (int i = (b), _ = (e); i <= _; ++i)
#define FORre(i,b,e) for (int i = (b), _ = (e); i >= _; --i)
static int sc_ret = 0;
struct sc
{
sc& operator()(char& v) { v = sc_ret = getchar(); return *this; }
sc& operator()(int& v) { sc_ret = scanf("%d", &v); return *this; }
sc& operator()(unsigned& v) { sc_ret = scanf("%u", &v); return *this; }
sc& operator()(double& v) { sc_ret = scanf("%lf", &v); return *this; }
sc& operator()(char* v) { sc_ret = scanf("%s", v); return *this; }
sc& operator()(string& v) { sc_ret = (bool)(cin >> v); return *this; }
sc& operator()(ll& v) { sc_ret = scanf("%" SCNd64, &v); return *this; }
sc& ch(char& v) { sc_ret = scanf(" %c", &v); return *this; }
sc& gets(char* v) { sc_ret = fgets(v, INT_MAX, stdin) != 0; v[strlen(v) - 1] = 0; return *this; }
operator bool() const { return sc_ret > 0; }
void read(int& v)
{
int x = 0, k = 1;
char c = getchar();
while (c < '0' || c > '9')
{
if (c == '-') k = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c - 48), c = getchar();
v = x * k;
}
};
struct pr
{
pr& ln() { putchar('\n'); return *this; }
pr& operator()(char v) { putchar(v); return *this; }
pr& operator()(int v) { printf("%d", v); return *this; }
pr& operator()(double v) { printf("%.2f", v); return *this; }
pr& operator()(const char* fmt, double v) { printf(fmt, v); return *this; }
pr& operator()(const char* v) { printf("%s", v);return *this; }
pr& operator()(string v) { printf("%s", v.c_str());return *this; }
pr& operator()(ll v) { printf("%" PRId64, v);return *this; }
void write(int v)
{
int cnt = 0; char c[15];
if (v == 0)
{
putchar('0');
return;
}
if (v < 0) putchar('-'), v = -v;
while (v) c[++cnt] = (v % 10) + 48, v /= 10;
while (cnt > 0) putchar(c[cnt--]);
}
template <typename T>
void ln(T* arr, int size)
{
if (size > 0)
{
(*this)(arr[0]);
for (int i = 1; i < size; ++i)
{
putchar(' ');
(*this)(arr[i]);
}
putchar('\n');
}
}
template <typename T>
void muln(T* arr, int size)
{
for (int i = 0; i < size; ++i)
{
(*this)(arr[i]);
putchar('\n');
}
}
};
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const int maxn = 200000 + 10;
const int maxm = 100000 + 10;
ll a[maxn];
int main()
{
int n, t, k;
SC(n);
FORe(i, 1, n)
{
int v;
SC.read(v);
a[i] = v + a[i - 1];
}
int l = 1, r = 3; ll ret = a[n];
FORi(i, 2, n - 1)
{
for (; l < i - 1; ++l)
{
if (min(a[l], a[i] - a[l]) >= min(a[l + 1], a[i] - a[l + 1]))
break;
}
for (; r < n - 1; ++r)
{
if (min(a[r] - a[i], a[n] - a[r]) >= min(a[r + 1] - a[i], a[n] - a[r + 1]))
break;
}
ret = min(ret, max(max(a[r] - a[i], a[n] - a[r]), max(a[l], a[i] - a[l]))
- min(min(a[l], a[i] - a[l]), min(a[r] - a[i], a[n] - a[r])));
}
PT(ret);
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define Bye return 0
#define ll long long
using namespace std;
void solve(){
int n; cin>>n;
int a[n];
for (int i=0; i<n; i++) cin>>a[i];
int next = a[0];
int cont = 1;
for (int i=1; i<n; i++){
if(a[i]<=next){
next = a[i];
cont++;
}
}
cout<<cont<<endl;
}
int main(){
solve();
Bye;
} | #include <vector>
#include <iostream>
#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];
A[i] *= -1;
}
vector<int> seq(N, 1 << 30);
for (int i = 0; i < N; ++i) {
*lower_bound(seq.begin(), seq.end(), A[i] + 1) = A[i];
}
cout << lower_bound(seq.begin(), seq.end(), 1 << 30) - seq.begin() << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A[100],N;
cin >> N;
for (int i=0;i<N;i++) {
cin >> A[i];
}
int count = 0;
int flag = 1;
while(flag) {
flag = 0;
for (int i=N-1;i>0;i--) {
if (A[i] < A[i-1]) {
count++;
int tmp = A[i];
A[i] = A[i-1];
A[i-1] = tmp;
flag = 1;
}
}
}
for (int i=0;i<N-1;i++) {
cout << A[i] << " ";
}
cout << A[N-1] << endl;
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,s,n) for(int i=s;i<n;++i)
#define FORR(i,s,n) for(int i=n-1;i>=s;--i)
#define ALL(c) (c).begin(),(c).end()
#define CLEAR(v) memset(v,0,sizeof(v))
#define MP(a,b) make_pair((a),(b))
#define ABS(a) ((a)>0?(a):-(a))
#define F first
#define S second
ll n, a[5];
int main(int argc, char **argv) {
cin >> n;
REP(i, 5) cin >> a[i];
ll res = 0;
REP(i, 5) res = max(res + 1, i + (n+a[i]-1)/a[i]);
cout << res << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
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; }
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll H,W;
cin>>H>>W;
vector<vector<char>> G(H,vector<char>(W));
ll cnt = 0;
vector<vector<ll>> dist(H,vector<ll>(W,-1));
queue<Pi> que;
rep(i,H){
rep(j,W){
cin>>G[i][j];
if(G[i][j] == '#'){
dist[i][j] = 0;
que.push(mp(i,j));
}
}
}
ll ans = 0;
while(!que.empty()){
Pi v =que.front();
que.pop();
rep(dir,4){
ll ny = v.first + dy[dir];
ll nx = v.second + dx[dir];
if(!In_map(ny,nx,H,W)) continue;
if(dist[ny][nx] != -1) continue;
if(G[ny][nx] == '#') continue;
dist[ny][nx] = dist[v.first][v.second]+1;
que.push(mp(ny,nx));
chmax(ans,dist[ny][nx]);
}
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, T;
cin >> N >> T;
int t[N];
for (int i=0; i<N; i++)
cin >> t[i];
long ans = 0, start = t[0], prev = t[0];
for (int i=1; i<N; i++) {
if (t[i]>prev+T) {
ans += prev+T-start;
start = t[i];
}
prev = t[i];
}
ans += prev+T-start;
cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x); i<=(y); i++)
#define ll long long
#define ld long double
#define inf 1000000000
#define N 100005
int n,s; ll a[N],b[N],ans;
int main(){
scanf("%d%d",&n,&s);
rep (i,1,n) scanf("%d%d",&a[i],&b[i]);
int l=1,r=n; ans=0;
while (l<=r){
if (s<=a[l]){ ans+=a[r]-s; break; }
if (s>=a[r]){ ans+=s-a[l]; break; }
if (b[l]>=b[r]){
ans+=a[r]-a[l];
while (l<r && b[l]>=b[r]) b[l]+=b[r--];
} else{
ans+=a[r]-a[l];
while (l<r && b[l]<b[r]) b[r]+=b[l++];
}
}
printf("%lld\n",ans);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
string a_tmp, b_tmp;
string ch = to_string(i);
for (int j = 0; j < ch.size(); j++) {
a_tmp.push_back(char(ch[j]));
b_tmp.push_back(char(ch[ch.size() - j-1]));
}
if (a_tmp == b_tmp)ans++;
}
cout << ans << endl;
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1000000007;
deque<int> col;
int main(){
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
col.push_front(a[0]);
for (int i = 1; i < n; i++){
int idx = lower_bound(col.begin(), col.end(), a[i]) - col.begin();
if(idx == 0){
col.push_front(a[i]);
}else{
col[idx-1] = a[i];
}
}
int ans = col.size();
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
int N; cin >> N;
vi A(N);
for(auto &x : A)cin >> x;
vector<vector<ll>> dp(N+1, vector<ll>(2, 0));
dp[0][1]=-INF;
for(int i=0; i<N; i++){
dp[i+1][0]=max(dp[i][0]+A[i], dp[i][1]-A[i]);
dp[i+1][1]=max(dp[i][0]-A[i], dp[i][1]+A[i]);
}
cout << dp[N][0] << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int left = l;
int right = l + n - 1;
int eat = 0;
if (left >= 0) {
eat = left;
} else if (right <= 0) {
eat = right;
} else {
eat = 0;
}
int ans = ((left + right) * n / 2) - eat;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s1, s2;
void solve() {
int dp[s1.size() + 1][s2.size() + 1];
for (int i = 0; i <= s1.size(); i++) {
dp[i][0] = i;
}
for (int i = 0; i <= s2.size(); i++) {
dp[0][i] = i;
}
for (int i = 1; i <= s1.size(); i++) {
for (int j = 1; j <= s2.size(); j++) {
int flag;
if (s1[i - 1] == s2[j - 1]) flag = 0;
else flag = 1;
dp[i][j] =
min(dp[i - 1][j] + 1, min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + flag));
}
}
cout << dp[s1.size()][s2.size()] << endl;
}
int main() {
cin >> s1 >> s2;
solve();
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
int n,p[200005],r[200005];
ll d,a[200005],f[200005],g[200005],ans;
vector <pair<ll,pi>> s;
int Par(int nod){
if(p[p[nod]]==p[nod]) return p[nod];
else return p[nod]=Par(p[nod]);
}
void Unite(int x, int y){
x=Par(x); y=Par(y);
if(x==y) return;
if(r[x]>r[y]) swap(x,y);
if(r[x]==r[y]) r[y]++;
p[x]=y;
}
void DC(int l, int r){
if(l==r) return;
int mid=(l+r)/2;
DC(l,mid);
DC(mid+1,r);
int x=0,y=0;
for(int i=l;i<=mid;i++){
if(f[i]<f[x]) x=i;
}
for(int i=mid+1;i<=r;i++){
if(g[i]<g[y]) y=i;
}
for(int i=l;i<=mid;i++){
s.pb({f[i]+g[y],{i,y}});
}
for(int i=mid+1;i<=r;i++){
s.pb({f[x]+g[i],{x,i}});
}
}
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
#ifdef LOCAL_DEFINE
ifstream cin("input.in");
#endif
cin >> n >> d;
for(int i=1;i<=n;i++){
cin >> a[i];
p[i]=i;
f[i]=-d*i+a[i];
g[i]=d*i+a[i];
}
f[0]=g[0]=LINF;
DC(1,n);
sort(s.begin(),s.end());
for(pair<ll,pi> i : s){
if(Par(i.y.x)==Par(i.y.y)) continue;
Unite(i.y.x,i.y.y);
ans+=i.x;
}
cout << ans;
#ifdef LOCAL_DEFINE
cerr << "\nTime elapsed: " << 1.0*clock()/CLOCKS_PER_SEC << " \n";
#endif
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000005;
inline int gi()
{
char c = getchar();
while (c < '0' || c > '9') c = getchar();
int sum = 0;
while ('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
return sum;
}
int n;
char s[maxn], t[maxn];
int ans, l, r, q[maxn];
int main()
{
scanf("%d\n%s%s", &n, s + 1, t + 1);
int i;
for (i = 1; i <= n; ++i)
if (s[i] != t[i]) break;
if (i > n) return puts("0"), 0;
int up = n, down = n;
l = 1; r = 0;
while (down) {
while (down && t[down - 1] == t[down]) --down;
while (up && (up > down || s[up] != t[down])) --up;
if (!up) return puts("-1"), 0;
while (l < r && q[l] - (r - l + 1) >= down) ++l;
if (up != down) q[++r] = up;
ans = max(ans, r - l + 2);
--down;
}
printf("%d\n", ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
bool dis=true;
if(e-a>k){
dis=false;
}
if(dis){
cout<<"Yay!"<<endl;
}
else{
cout<<":("<<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=5;
vector<int> v(n);
rep(i,n) cin>>v[i];
int d; cin>>d;
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
if(v[j]-v[i]>d){cout << ":(" << endl; return 0;}
}
}
cout << "Yay!" << endl;
} | 1 |
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
struct rep {
struct itr {
usize i;
constexpr itr(const usize i) noexcept : i(i) {}
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
const itr f, l;
constexpr rep(const usize f, const usize l) noexcept
: f(std::min(f, l)), l(l) {}
constexpr auto begin() const noexcept { return f; }
constexpr auto end() const noexcept { return l; }
};
struct revrep {
struct itr {
usize i;
constexpr itr(const usize i) noexcept : i(i) {}
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
const itr f, l;
constexpr revrep(const usize f, const usize l) noexcept
: f(l - 1), l(std::min(f, l) - 1) {}
constexpr auto begin() const noexcept { return f; }
constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
if (a < b)
a = b;
}
template <class F> class rec_lambda {
F f;
public:
rec_lambda(F &&f) : f(std::move(f)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
T ret;
std::cin >> ret;
return ret;
}
} // namespace n91
namespace n91 {
void main_() {
/*
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
//*/
const usize n = scan<usize>();
const u64 m = scan<u64>();
const auto add = [&](u64 &l, const u64 r) { l = (l + r) % m; };
auto dp = md_vec(3 * n + 1 + 3, n + 1 + 1, u64(0));
dp[0][0] = 1;
for (const usize i : rep(0, 3 * n + 1)) {
for (const usize j : rep(0, n + 1)) {
add(dp[i + 1][j], dp[i][j]);
add(dp[i + 2][j + 1], dp[i][j] * (i + 1) % m);
add(dp[i + 3][j + 1], dp[i][j] * (i + 1) % m * (i + 2) % m);
}
}
u64 ans = 0;
for (const usize i : rep(0, n + 1)) {
add(ans, dp[3 * n][i]);
}
std::cout << ans << std::endl;
}
} // namespace n91
int main() {
n91::main_();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
const int num = S.size();
string T;
for (int64_t tmp = 0; tmp < (1 << 3); tmp++) {
bitset<3> b(tmp);
int sum = S.at(0)-'0';
T = "";
for (int i = 0; i < 3; i++) {
if(b.test(0)){
sum += S.at(i+1)-'0';
T += "+";
}else{
sum -= S.at(i+1)-'0';
T += "-";
}
b = b >> 1;
}
if(sum == 7)
break;
}
for (int i = 0; i < 3; i++) {
cout << S.at(i) << T.at(i);
}
cout << S.at(3) << "=7" << endl;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll n, a, b, res;
int main() {
cin >> n;
vector<ll> s(n);
REP(i, n) {
cin >> a >> b;
s[i] = a + b;
res -= b;
}
sort(s.rbegin(), s.rend());
REP(i, n) res += s[i++];
cout << res << '\n';
return 0;
} | //g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long long int
const LL INF = (1LL<<60);
const int INF_INT = 2147483647-1e6-1;
const LL mod = 1000000007ll;
const int mod_int = 1000000007;
LL N;
vector<tuple<LL,LL,LL>> dish;
LL ans = 0;
void solve(){
sort(dish.begin(),dish.end());
for(int i=0;i<N;i++){
int j = N-1-i;
//cout << get<1>(dish[j]) << " " << get<2>(dish[j])<< endl;
if(i%2==0){
ans += get<1>(dish[j]);
}
if(i%2==1){
ans -= get<2>(dish[j]);
}
}
}
int main(){
cin >> N;
for(int i=0;i<N;i++){
LL a,b;cin >> a >> b;
dish.push_back(tuple<LL,LL,LL>(a+b,a,b));
}
solve();
cout << ans << endl;
return 0;
} | 1 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, m;
while(1){
scanf("%d%d", &n, &m);
if(n == 0 && m == 0)return 0;
int res = 0, tmp;
vector<int> points, points2;
for(int i = 0;i < n;i++){
scanf("%d", &tmp);
if(tmp < m)points.push_back(tmp);
}
vector<int>::iterator it1,it2;
for(it1 = points.begin();it1 != points.end();it1++){
points2.push_back(*it1);
for(it2 = points.begin();it2 != points.end();it2++){
if(*it1 + *it2 <= m)points2.push_back(*it1 + *it2);
}
}
sort(points2.begin(),points2.end());
for(it1 = points2.begin();it1 != points2.end();it1++){
it2 = upper_bound(points2.begin(), points2.end(), m - *it1);
res = max(res, *it1);
if(it2 == points2.begin())continue;
it2--;
res = max(res, *it1 + *it2);
}
printf("%d\n",res);
}
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> outp;
int icn;
int icd;
int g;
vector<int> ice;
for(g = 0;;g++){
vector<int> ice(10,0);
cin >> icn;
if(icn == 0){
break;
}else{
for(int a = 0;a< icn;a++){
cin >> icd;
ice[icd] += 1;
}
outp.insert(outp.end(),ice.begin(),ice.end());
}
}
for(int n = 0;n<g * 10;n++){
if(outp[n] == 0){
cout << "-";
}else{
for(int c = 0;c<outp[n];c++){
cout << "*" ;
}
}
cout << endl;
}
return 0;
} | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for(int i=0;i<n;++i)
#define rep(i, n) for(int i=1;i<=n;++i)
#define ll long long int
#define INF 100000000
#define INFLL 100000000000
#define MOD 1000000007
#define PI 3.14159265359
#define All(a) (a).begin(), (a).end()
using namespace std;
using P = pair<ll, ll>;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
struct Edge {
int to;
ll weight;
Edge(int t, ll w) : to(t), weight(w) { }
};
int N, M;
bool seen[110000];
using Graph = vector<vector<int>>;
void dfs(int v, const Graph& G, vector<int>& order) {
seen[v] = true;
for (auto nv : G[v]) {
if (seen[nv]) continue;
dfs(nv, G, order);
}
order.push_back(v);
}
int main () {
cin >> N >> M;
Graph G(N+1);
Graph Gyaku(N+1);
Rep(i, N-1+M) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
Gyaku[b].push_back(a);
}
vector<int> order;
rep(i, N) {
if (seen[i]) continue;
dfs(i, G, order);
}
reverse(All(order));
map<int, int> mp;
rep(i, N) {
mp[order[i-1]] = i;
//cout << order[i-1] << "\n";
}
rep(i, N) {
if (mp[i] == 1) {
cout << 0 << "\n";
} else {
int tmp = 0;
int tmp_p = 0;
for (auto nv: Gyaku[i]) {
//cout << " " << nv << " " << mp[nv] << "\n";
if (mp[nv] > tmp) {
tmp = mp[nv];
tmp_p = nv;
}
}
cout << tmp_p << "\n";
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", stdin), freopen(s"out", "w", stdout)
template<typename T>
inline void read(T &x) {
char ch, t = 0; x = 0;
while(!isdigit(ch = ge)) t |= ch == '-';
while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = ge;
x = t ? -x : x;
}
inline int read_int() { int x; return read(x), x; }
inline ll read_ll() { ll x; return read(x), x; }
template<typename T>
inline void chkmin(T&a, T b) { a = a < b ? a : b; }
const int MAXN = 110;
int a[MAXN];
int js[MAXN];
int main() {
#ifdef LOCAL
FILE("");
#endif
int cnt = 0;
int n = ri;
int m = ri;
if(m == 1) {
if(n == 1) {
cout << 1 << endl;
cout << 1 << endl;
cout << 1 << endl;
} else {
cout << n << endl;
cout << 2 << endl;
cout << 1 << ' ' << n - 1 << endl;
}
}
else {
for(int i = 1; i <= m; i++) {
a[i] = ri;
if(a[i] & 1)
js[cnt++] = i;
}
if(cnt > 2) puts("Impossible");
else {
if(js[0] && js[0] != 1) swap(a[1], a[js[0]]);
if(js[1] && js[1] != m) swap(a[m], a[js[1]]);
for(int i = 1; i <= m; i++) printf("%d ", a[i]); puts("");
a[1]++, a[m]--;
if(!a[m]) --m;
printf("%d\n", m);
for(int i = 1; i <= m; i++) printf("%d ", a[i]); puts("");
}
}
return 0;
}
| 0 |
#include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fori(i,k,n) for(int i=k;i<(int)n;i++)
using namespace std;
int in()
{
int x;cin>>x;
return x;
}
int stringInt(string a)
{
return atoi(a.c_str());
}
string intString(int a)
{
stringstream ss;
ss<<a;
return ss.str();
}
vector<int> SieveOfEratosthenes(int x)
{
vector<int> a;
vector<int> b(x+1,0);
for(int i=2;i<=x;i++)
{
if(b[i]==0)
{
a.push_back(i);
for(int l=i;l<=x;l+=i)
{
b[l]=1;
}
}
}
return a;
}
int main ()
{
int n,m;
while(cin>>n>>m&&n&&m)
{
vector<long long > a,b;
b.push_back(0);
rep(i,n)
{
b.push_back(in());
}
rep(i,n+1)
{
rep(l,n+1)
{
a.push_back(b[i]+b[l]);
}
}
long long ans = 0;
sort(a.begin(),a.end());
rep(i,a.size())
{
vector<long long>::iterator t=upper_bound(a.begin(),a.end(),m-a[i]);
if(t==a.begin())continue;
t--;
ans=max(ans,*t+a[i]);
}
cout<<ans<<endl;
}
} | #include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1<<30;
int N,M;
int main(){
while(scanf("%d%d", &N,&M) && N||M){
vector<int>a,v;
a.push_back(0);
for(int i=0;i<N;i++){
int x;scanf("%d", &x);
a.push_back(x);
}
for(int i=0;i<=N;i++) for(int j=0;j<=N;j++){
if(a[i]+a[j] <= M) v.push_back(a[i]+a[j]);
}
v.push_back(INF);
sort(v.begin(), v.end());
int res = 0;
for(int i=0;i<v.size()-1;i++){
int x = M-v[i];
vector<int>::iterator it = upper_bound(v.begin(), v.end(), x); if(it != v.begin()) it--;
res = max(res, v[i] + *it);
}
printf("%d\n", res);
}
return 0;
} | 1 |
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll>;
#define rep(i, a, b) for (ll(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cout << i << "\n"
// const ll MOD = 998244353;
const ll MOD = 1000000007;
// UnionFind
template<class T>
struct UnionFind {
std::vector<T> uni;
T num;
UnionFind(T s) : uni(s, -1), num(s) {}
//頂点aが所属するグループ
T root(T a) {
if (uni[a] < 0) {
return a;
}
return uni[a] = root(uni[a]);
}
// a,bをつなげる
bool connect(T a, T b) {
a = root(a);
b = root(b);
if (a == b) {
return false;
}
if (uni[a] > uni[b]) {
std::swap(a, b);
}
uni[a] += uni[b];
uni[b] = a;
return true;
}
// a,bが同グループか確認
bool isConnect(T a, T b) { return root(a) == root(b); }
// aが属するグループの要素数
T size(T a) { return -uni[root(a)]; }
//グループ数を返す
T groups() {
std::set<T> b;
for (T i = 0; i < num; i++) {
b.insert(root(i));
}
return b.size();
}
};
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
//問題文中の添え字が0-indexか1-indexか確認!
ll n,k,l;
std::cin>>n>>k>>l;
UnionFind<int> load(n),rail(n);
rep(i,0,k){
ll a,b;
std::cin>>a>>b;
a--;b--;
load.connect(a,b);
}
rep(i,0,l){
ll a,b;
std::cin>>a>>b;
a--;b--;
rail.connect(a,b);
}
std::vector<P> temp1(n),temp2(n);
rep(i,0,n){
temp1[i]=P(load.root(i),rail.root(i));
temp2[i]=P(load.root(i),rail.root(i));
}
sort(all(temp1));
rep(i,0,n){
auto low=std::lower_bound(all(temp1),temp2[i]);
auto up=std::upper_bound(all(temp1),temp2[i]);
std::cout<<up-low<<" ";
}
return 0;
} | #define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#define task "codejam"
using namespace std;
int typetest;
template<class T>
void read(T &x){
register int c;
T neg = 1;
x = (T)0;
while ((c = getchar()) <= 47 || c >= 58)
if(c == '-') neg = -1;
for (; (c > 47 && c < 58); c = getchar()){
x = (x << 3) + (x << 1) + (T)(c - 48);
}
x *= neg;
}
inline void fastIOfileinput(){
ios:: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen(task".INP", "r", stdin);
// freopen(task".OUT", "w", stdout);
// freopen(task".in", "r", stdin);
// freopen(task".out", "w", stdout);
typetest = 0;
}
const int N = 2e5 + 2;
int m, n, k;
vector<int> ker[N], kel[N];
int ltr[N], ltl[N];
void Enter(){
read(n); read(m); read(k);
while(m--){
int a, b;
read(a); read(b);
ker[a].pb(b);
ker[b].pb(a);
}
while(k--){
int a, b;
read(a); read(b);
kel[a].pb(b);
kel[b].pb(a);
}
}
void BFS(int i, int lt[], vector<int> ke[]){
++m;
lt[i] = m;
queue<int> open;
open.push(i);
while(open.size()){
int c = open.front();
open.pop();
for(auto i : ke[c]){
if((!lt[i]))
open.push(i), lt[i] = m;
}
}
}
void solve(){
m = 0;
for(int i = 1; i <= n; ++i)
if(ltr[i] == 0)
BFS(i, ltr, ker);
m = 0;
for(int i = 1; i <= n; ++i)
if(ltl[i] == 0)
BFS(i, ltl, kel);
map<int, map<int, int> > s;
for(int i = 1; i <= n; ++i){
++s[ltr[i]][ltl[i]];
// cerr << ltr[i] << " " << ltl[i] << "\n";
}
for(int i = 1; i <= n; ++i){
int& v = s[ltr[i]][ltl[i]];
cout << v << " ";
}
}
signed main(){
fastIOfileinput();
if(typetest){
int t;
cin >> t;
int v = t;
while(t--){
Enter();
cout << "Case #" << v - t << ": ";
solve();
}
}
else{
Enter();
solve();
}
}
| 1 |
//Author: Fuadul Hasan([email protected])
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
int a,b;
cin>>a>>b;
cout<<max(a+(a-1),max(b+(b-1),a+b))<<endl;
return 0;
} | #include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
#include <random>
#include <cassert>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a,b) memset((a),(b),sizeof(a))
const LL INF = 1e9 + 7;
const int N = 1e2 + 10;
char ans[N][N];
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int n = 100;
int a, b;
cin >> a >> b;
MEM(ans, '#');
for (int i = 1; i <= n / 2; i++)
{
for (int j = 1; j <= 100; j++) ans[i][j] = '.';
}
a--, b--;
for (int i = 1; i <= n / 2; i += 2)
{
for (int j = 1; j <= 100 && b > 0; j += 2, b--)
{
ans[i][j] = '#';
}
}
for (int i = n; i >= n / 2; i -= 2)
{
for (int j = 1; j <= 100 && a > 0; j += 2, a--)
{
ans[i][j] = '.';
}
}
puts("100 100");
for (int i = 1; i <= n; i++)
{
ans[i][n + 1] = 0;
puts(ans[i] + 1);
}
return 0;
}
| 0 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
ll N, K;
ll solve(ll N);
int main()
{
cin >> N >> K;
cout << solve(N) << endl;
}
ll solve(ll N)
{
if (N == 1)
{
return 2;
}
return min(solve(N - 1) * 2, solve(N - 1) + K);
} | #include <iostream>
using namespace std;
int main(void){
int n,x,t;
int ans;
cin >> n >> x >> t;
ans = t * ((n+x-1)/x);
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...) type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T &t) {cin>>t;}
template<typename First, typename...Rest> void MACRO_VAR_Scan(First &first, Rest&...rest) {cin>>first;MACRO_VAR_Scan(rest...);}
#define VEC(type, c, n) vector<type> c(n);for(auto &&i:c)cin>>i;
// out
#define OUT(dist) cout<<(dist);
#define FOUT(n, dist) cout<<fixed<<setprecision(n)<<(dist);
#define SP cout<<" ";
#define BR cout<<"\n";
#define debug(x) cerr << #x << ":" << (x);BR;
// utility
#define ALL(a) (a).begin(), (a).end()
#define EACH(i, a) for(auto &&i:(a))
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=0;--i)
#define REP(i, n) for(int i=0;i<(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
signed main() {
INIT;
VAR(int, k);
int n = 50, p = k / n, q = k % n;
vector< int > a(n, n + p - q - 1);
REP(i, q) {
a[i] += 51;
}
OUT(n)BR;
REP(i, n) {
OUT(a[i]);
if (i < n - 1) SP;
}
BR;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int K;
string S;
cin>>K>>S;
int a=S.size();
if(a<=K){
cout<<S<<endl;
}
else{
for(int i=0;i<K;i++){
cout<<S.at(i);
}
cout<<"..."<<endl;
}
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int n;
while(cin >> n,n){
vector<int> key(n);
rep(i,n) cin >> key[i];
int x = 0;
string str;
cin >> str;
while(key.size() < str.size()){
if(x==key.size()) x = 0;
key.push_back(key[x]);
x++;
}
rep(i,str.size()){
rep(j,key[i]){
if(str[i]=='a') str[i] = 'Z';
else if(str[i]=='A') str[i] = 'z';
else str[i]--;
}
}
rep(i,str.size()) cout << str[i];
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;
#define INF INT_MAX/3
#define MAX_N 1000000001
int main(){
cin.sync_with_stdio(false);
int n;
while(cin >> n, n) {
int key[n];
rep(i, n) cin >> key[i];
string s;
cin >> s;
int i = 0;
rep(j, s.size()) {
if ('a' <= s[j] && s[j] <= 'z') {
if (key[i] <= 26) {
if (s[j] - 'a' >= key[i]) s[j] = (char)(s[j] - key[i]);
else s[j] = (char)('Z' - (key[i] - (s[j] - 'a') - 1));
} else {
s[j] = (char)(s[j] + ('A' - 'a'));
if (s[j] - 'A' >= key[i] - 26) s[j] = (char)(s[j] - key[i] + 26);
else s[j] = (char)('z' - (key[i] - (s[j] - 'A') - 27));
}
i = (i + 1) % n;
} else {
if (key[i] <= 26) {
if (s[j] - 'A' >= key[i]) s[j] = (char)(s[j] - key[i]);
else s[j] = (char)('z' - (key[i] - (s[j] - 'A') - 1));
} else {
s[j] = (char)(s[j] - ('A' - 'a'));
if (s[j] - 'a' >= key[i] - 26) s[j] = (char)(s[j] - key[i] + 26);
else s[j] = (char)('Z' - (key[i] - (s[j] - 'a') - 27));
}
i = (i + 1) % n;
}
}
cout << s << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#define mp make_pair
#define endl "\n"
#define v vector
#define b begin()
#define e end()
using namespace std;
typedef long long ll;
typedef long l;
typedef long long unsigned ull;
int main(){
/*int t;
while(t--){
}*/
ll n;
cin>>n;
ll m = n/500;
ll q = m*1000;
n -= (m*500);
ll p = (n/5)*5;
cout<<q+p;
return 0;
} | #include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define isz(c) (int)c.size();
using namespace std;
using ll = long long;
using vi = vector<int>;
int main(void)
{
int a, b;
cin >> a >> b;
b--;
a--;
cout << (a + b - 1) / a << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
int main()
{
int K;
std::string S;
std::cin >> K;
std::cin >> S;
if (S.length() <= K) std::cout << S << std::endl;
else std::cout << S.substr(0, K) << "..." << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n)
{
i=m+n;
j=m-n;
k=m*n;
cout<<max(i,max(j,k))<<endl;
}
return 0;
} | 0 |
/** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
Copyright */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas:
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
#pragma GCC target("avx2") //Enable AVX
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
#define vi vector<int>
#define sz(a) int((a).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,n) for(int i=(1);i<=(n);i++)
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
/// Constraints:
const int maxn = 200005;
const int mod = 1000000007;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 2000000000000000000ll;
const ld pi = acos(-1);
/// Prime Numbers:
// 2, 173, 179, 181, 197, 311, 331, 737, 1009, 2011, 2027, 3079, 4001, 10037, 10079, 20011, 20089;
// 100003, 100019, 100043, 200003, 200017, 1000003, 1000033, 1000037, 1000081;
// 2000003, 2000029, 2000039, 1000000007, 1000000021, 2000000099;
/// Functions:
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
/// Red-Black Tree Test.insert(x)late ---------------------------------
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long , null_type , less<long long> , rb_tree_tag , tree_order_statistics_node_update > ordered_set;
/// Quick Pow------------------------------------------------
int qpow(int b,int e){
if( !e ) return 1;
if( e & 1 ) return qpow(b,e-1) * b % mod;
int pwur = qpow(b,e>>1);
return (pwur * pwur) % mod;
}
int modinv(int x){
return qpow(x,mod-2);
}
/// My Code -------------------------------------------------
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cout.setf(ios::fixed); cout.precision(0);
srand(time(NULL));
//freopen("a.in","r",stdin);
//freopen("a.in","w",stdout);
int n;
cin>>n;
vi v(n);
rep(i,n)cin>>v[i];
sort(rall(v));
int ans=1,cnt=0;
for(int i=0;i<n-1;){
if(v[i]==v[i+1]&&cnt<2){
ans*=v[i];
i+=2;
cnt++;
}
else i++;
}
if(cnt==2)cout<<ans;
else cout<<0;
return 0;
}
| #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int n;
cin >> n;
map<ll,int> mli;
rep(i,n){
ll x;
cin >> x;
mli[x]++;
}
vector<pair<ll,int>> v;
for(auto u : mli){
v.push_back({u.first,u.second});
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
ll ans = 1;
bool one = 0;
for(auto u : v){
if(u.second>=2){
if(u.second>=4){
if(one) cout << ans*u.first << endl;
else cout << u.first*u.first << endl;
return 0;
}
else{
if(one) {
cout << ans*u.first << endl;
return 0;
}
else ans *= u.first;
}
one = 1;
}
}
cout << 0 << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+5;
bool flg;
vector<ll> adj[N],col(N);
void dfs(ll node,ll clr){
if(col[node]!=0){
if(col[node]!=clr)flg=0;
return;
}
col[node]=clr;
for(auto &v:adj[node])dfs(v,-clr);
}
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n,m;cin>>n>>m;
for(ll i=0;i<m;i++){
ll u,v;cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
ll c1=0,c2=0,c3=0;
for(ll i=1;i<=n;i++){
if(col[i]!=0)continue;
if(adj[i].size()==0)c1++;
else{
flg=1;
dfs(i,1);
if(flg)c2++;
else c3++;
}
}
ll ans = 2*n*c1 - c1*c1 + c3*c3 + 2*c3*c2 + 2*c2*c2;
cout<<ans;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread_unlocked(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
return A;
}
//わけわかめ
int P[100001];
bool dame[100001];
int Find(int A) {
if (P[A] < 0) return A << 1;
return P[A] = Find(P[A] >> 1) ^ (P[A] & 1);
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint(), M = getint();
rep1(i, N) P[i] = -1;
rep(i, M) {
int a = Find(getint());
int b = Find(getint());
//なんてセンスのない
int a1 = a >> 1;
int b1 = b >> 1;
if (a1 == b1) {
if (!((a ^ b) & 1)) dame[a1] = true;
continue;
}
if (P[a1] > P[b1]) {
P[b1] += P[a1];
dame[b1] |= dame[a1];
P[a1] = b ^ !(a & 1);
}
else {
P[a1] += P[b1];
dame[a1] |= dame[b1];
P[b1] = a ^ !(b & 1);
}
}
ll x = 0, y = 0, z = 0;
rep1(i, N) {
if (P[i] < 0) {
if (P[i] == -1) z++;
else if (dame[i]) y++;
else x++;
}
}
printf("%lld\n", x * x + (x + y) * (x + y) + 2 * N * z - z * z);
Would you please return 0;
} | 1 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
//#include <unistd.h>
//#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
ll gcd(ll a,ll b){
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
//素数判定O(sqrt(N))
bool isp(ll n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
ll fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 510000; 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 COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
//nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n,ll m,ll MOD){
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
//printf("%.10f\n", N);
/* vector<ll> vec = {1,2,5,6,8,9,10};
cout << binary_search(all(vec),5) << endl; -> true*/
/*
vector<ll> vec = {1,2,5,6,8,9,10};
auto n = upper_bound(all(vec),4);
cout << *n << endl; -> 5*/
/*
cout << fixed << setprecision(15);
*/
int main(){
ll N;
cin >> N;
string S;
cin >> S;
vector<ll> east(N + 1);
east[0] = 0;
rep(i,N){
if(S[i] == 'E')east[i + 1]++;
}
rep(i,N){
east[i + 1] += east[i];
}
ll ans = INF;
for(ll i = 1;i <= N;i++){
ans = min(ans,i - 1 - east[i - 1] + east[N] - east[i]);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(int n, string s) {
vector<int> w(n, 0), e(n, 0);
if(s[0] == 'W') {
w[0] = 1;
} else {
e[0] = 1;
}
for(int i=1;i<n;i++) {
if(s[i] == 'W') {
w[i] = w[i-1] + 1;
e[i] = e[i-1];
} else {
e[i] = e[i-1] + 1;
w[i] = w[i-1];
}
}
int res = min(numeric_limits<int>::max(), e[n-1] - e[0]);
for(int i=1;i<n-1;i++) {
res = min(res, w[i-1] + e[n-1] - e[i]);
}
res = min(res, w[n-2]);
return res;
}
int main() {
int n;
string s;
cin >> n >> s;
cout << solve(n, s);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;//条件によってYes、Noを出力する
const int MOD=1000000007;
const double pi = 3.141592653589793;
int main(){
int n;
cin>>n;
vector<int64_t> a(n),b(n);
//方針:自分が幸福度高い皿を取りたいし、相手の幸福度高い皿を先にとってしまいたい
//->おのおのa[i]+b[i]が高い順に取っていけばいいのでは？
priority_queue<pair<int64_t,int>> dish;
rep(i,n){
cin>>a[i]>>b[i];
dish.push(mp(a[i]+b[i],i));
}
vector<bool> eaten(n,false);
int64_t tp=0,ap=0;
rep(turn,n){
while(eaten[dish.top().second]){
dish.pop();
}
eaten[dish.top().second]=true;
if(turn%2==0)tp += a[dish.top().second];
else ap += b[dish.top().second];
dish.pop();
}
cout<<tp-ap<<endl;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef vector<int> ivec;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const int MOD=1000000007;
int INF=100100100100100;
int sa[100010];
signed main(){
int n;cin>>n;
int ans=0;
rep(i,n){
int a,b;cin>>a>>b;
sa[i]=a+b;
ans-=b;
}
sort(sa,sa+n,greater<int>());
for(int i=0;i<n;i+=2){
ans+=sa[i];
}
cout<<ans<<endl;
return 0;
}
| 1 |
#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 1e10
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
unordered_map<char, string>cards;
cin >> cards['a']>> cards['b']>> cards['c'];
unordered_map<char, int>ct;
char curr = 'a';
while (true){
ct[curr]++;
if(ct[curr] > cards[curr].size()){
if(curr=='a') cout << 'A' << endl;
else if (curr=='b') cout << 'B' << endl;
else cout << 'C' << endl;
return 0;
}
curr = cards[curr][ct[curr]-1];
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
S += "*";
vec L(Q), R(Q);
REP(i,0,Q) {
cin >> L[i] >> R[i];
}
vec P(N+1, 0);
ll c = 0, i = 0;
while(i < N-1) {
if(S[i] == 'A' && S[i+1] == 'C') {
P[i+1] = c;
P[i+2] = c+1;
++c;
i += 2;
}
else {
P[i+1] = c;
++i;
}
}
P[N] = c;
REP(i,0,Q) {
PR(P[R[i]]-P[L[i]]);
}
return 0;
}
/*
*/ | 0 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
bool solve(int x,int y,int c);
int ux[2][8]={{0,1,2,3,0,1,2,3},
{0,1,0,1,0,1,0,1}};
int uy[2][8]={{0,0,0,0,1,1,1,1},
{0,0,1,1,2,2,3,3}};
int dx[4]={0,1,0,-1};
int dy[4]={-1,0,1,0};
int w,h,n;
int b[105][105];
int xs,ys,xg,yg;
int main(void){
while(1){
scanf("%d %d",&w,&h);
if(!w && !h) break;
memset(b,0,sizeof(b));
scanf("%d %d %d %d",&xs,&ys,&xg,&yg);
scanf("%d",&n);
int c,d,tx,ty;
for(int i=0;i<n;i++){
scanf("%d %d %d %d",&c,&d,&tx,&ty);
for(int j=0;j<8;j++){
b[tx+ux[d][j]][ty+uy[d][j]]=c;
}
}
if(b[xs][ys]!=0 && b[xg][yg]!=0 && b[xs][ys]==b[xg][yg] && solve(xs,ys,b[xs][ys])) puts("OK");
else puts("NG");
}
}
bool solve(int x,int y,int c){
if(x==xg && y==yg) return true;
b[x][y]=0;
for(int i=0;i<4;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if(0<nx && nx<=w && 0<ny && ny<=h){
if(b[nx][ny]==c){
if(solve(nx,ny,c)) return true;
}
}
}
return false;
} | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
string S[2002];
int P[2002][2002], A[2002][2002], B[2002][2002];
int main() {
if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
ios_base::sync_with_stdio(0), cin.tie(0);
int N, M, Q; cin >> N >> M >> Q;
for (int i = 0; i < N; ++i) cin >> S[i];
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
P[i+1][j+1] = P[i+1][j]+P[i][j+1]-P[i][j]+(S[i][j]=='1');
if (i) A[i+1][j+1] = A[i+1][j]+A[i][j+1]-A[i][j]+(S[i][j]=='1'&&S[i-1][j]=='1');
if (j) B[i+1][j+1] = B[i+1][j]+B[i][j+1]-B[i][j]+(S[i][j]=='1'&&S[i][j-1]=='1');
}
}
while (Q--) {
int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
cout << P[x2][y2]-P[x1-1][y2]-P[x2][y1-1]+P[x1-1][y1-1]
-A[x2][y2]+A[x1 ][y2]+A[x2][y1-1]-A[x1 ][y1-1]
-B[x2][y2]+B[x1-1][y2]+B[x2][y1 ]-B[x1-1][y1 ] << '\n';
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int dp[3010][3010];
int main(){
int n, time; scanf("%d %d", &n, &time);
vector<P> a(n);
for(int i = 0; i < n; i++) scanf("%d %d", &a[i].first, &a[i].second);
sort(a.begin(), a.end());
for(int i = 0; i < n; i++){
for(int j = 0; j <= time; j++){
dp[i + 1][j] = dp[i][j];
if(j - a[i].first >= 0) dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - a[i].first] + a[i].second);
}
}
int ans = 0;
for(int i = 0; i < n; i++) ans = max(ans, dp[i][time - 1] + a[i].second);
printf("%d\n", ans);
} | #include<bits/stdc++.h>
using namespace std;
const int N=102;
int gi() {
int x=0,o=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
}
int n,m,x,y,ans=0,sx[N][N],sy[N][N];
short f[N][N][N][N];
int main() {
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++) {
char ch=getchar();
while(ch!='.'&&ch!='o'&&ch!='E') ch=getchar();
sx[i][j]=sy[i][j]=(ch=='o');
sx[i][j]+=sx[i][j-1];sy[i][j]+=sy[i-1][j];
if(ch=='E') x=i,y=j;
}
for(int i=x;i;i--)
for(int j=y;j;j--)
for(int k=x;k<=n;k++)
for(int l=y;l<=m;l++) {
ans=max(ans,(int)f[i][j][k][l]);
if(i>1&&k+1<x+i) f[i-1][j][k][l]=max((int)f[i-1][j][k][l],f[i][j][k][l]+max(0,sx[i-1][min(l,m-y+j)]-sx[i-1][max(j-1,l-y)]));
if(k<n&&x+k<n+i) f[i][j][k+1][l]=max((int)f[i][j][k+1][l],f[i][j][k][l]+max(0,sx[k+1][min(l,m-y+j)]-sx[k+1][max(j-1,l-y)]));
if(j>1&&l+1<y+j) f[i][j-1][k][l]=max((int)f[i][j-1][k][l],f[i][j][k][l]+max(0,sy[min(k,n-x+i)][j-1]-sy[max(i-1,k-x)][j-1]));
if(l<m&&y+l<m+j) f[i][j][k][l+1]=max((int)f[i][j][k][l+1],f[i][j][k][l]+max(0,sy[min(k,n-x+i)][l+1]-sy[max(i-1,k-x)][l+1]));
}
printf("%d\n",ans);
return 0;
}
//orzgzy
//鸡贼明年进队超稳
| 0 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define lc now<<1
#define rc now<<1|1
using namespace std;
inline int read()
{
int f=1,x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int stack[20];
inline void write(LL x)
{
if(x<0){putchar('-');x=-x;}
if(!x){putchar('0');return;}
int top=0;
while(x)stack[++top]=x%10,x/=10;
while(top)putchar(stack[top--]+'0');
}
inline void pr1(int x){write(x);putchar(' ');}
inline void pr2(LL x){write(x);putchar('\n');}
const LL inf=1e18;
const int MAXN=200005;
int n,D,a[MAXN];
struct node
{
int p;LL c;
node(){}
node(int _p,LL _c){p=_p;c=_c;}
};
node _min(node u1,node u2){return u1.c<u2.c?u1:u2;}
struct segtree1
{
node mn[2][MAXN*4];
void buildtree(int now,int l,int r)
{
if(l==r){mn[0][now]=mn[1][now]=node(l,inf);return ;}
int mid=(l+r)/2;
buildtree(lc,l,mid);buildtree(rc,mid+1,r);
mn[0][now]=mn[1][now]=_min(mn[0][lc],mn[1][rc]);
}
void modify(int now,int l,int r,int p,node c,int opt)
{
if(l==r){mn[opt][now]=c;return ;}
int mid=(l+r)/2;
if(p<=mid)modify(lc,l,mid,p,c,opt);
else modify(rc,mid+1,r,p,c,opt);
mn[opt][now]=_min(mn[opt][lc],mn[opt][rc]);
}
node qry(int now,int l,int r,int ql,int qr,int opt)//0 左边 1 右边
{
if(l==ql&&r==qr)return mn[opt][now];
int mid=(l+r)/2;
if(qr<=mid)return qry(lc,l,mid,ql,qr,opt);
else if(mid+1<=ql)return qry(rc,mid+1,r,ql,qr,opt);
else return _min(qry(lc,l,mid,ql,mid,opt),qry(rc,mid+1,r,mid+1,qr,opt));
}
}seg1,seg2;//1 未加入 2 加入
struct segtree2
{
node mn[MAXN*4];
void buildtree(int now,int l,int r)
{
if(l==r){mn[now]=node(l,inf);return ;}
int mid=(l+r)/2;
buildtree(lc,l,mid);buildtree(rc,mid+1,r);
mn[now]=_min(mn[lc],mn[rc]);
}
void pushup(int now,int l,int r)
{
int mid=(l+r)/2;
mn[now]=_min(mn[lc],mn[rc]);
node u1=seg1.mn[0][lc],u2=seg2.mn[1][rc];
// u1=seg1.qry(1,1,n,l,mid,0),u2=seg2.qry(1,1,n,mid+1,r,1);
mn[now]=_min(mn[now],node(u1.p,u1.c+u2.c));
u1=seg1.mn[1][rc],u2=seg2.mn[0][lc];
// u1=seg1.qry(1,1,n,mid+1,r,1),u2=seg2.qry(1,1,n,l,mid,0);
mn[now]=_min(mn[now],node(u1.p,u1.c+u2.c));
}
void modify(int now,int l,int r,int p)
{
if(l==r){mn[now].c=inf;return ;}
int mid=(l+r)/2;
if(p<=mid)modify(lc,l,mid,p);
else modify(rc,mid+1,r,p);
pushup(now,l,r);
}
}seg3;
int main()
{
n=read();D=read();
if(n==1)return puts("0"),0;
for(int i=1;i<=n;i++)a[i]=read();
seg1.buildtree(1,1,n);
seg2.buildtree(1,1,n);
seg3.buildtree(1,1,n);
for(int i=2;i<=n;i++)
{
seg1.modify(1,1,n,i,node(i,(LL)-D*i+a[i]),0);
seg1.modify(1,1,n,i,node(i,(LL)D*i+a[i]),1);
}
seg2.modify(1,1,n,1,node(1,(LL)-D*1+a[1]),0);
seg2.modify(1,1,n,1,node(1,(LL)D*1+a[1]),1);
seg3.modify(1,1,n,1);
LL ans=0;
for(int i=1;i<n;i++)
{
ans+=seg3.mn[1].c;
int u=seg3.mn[1].p;
seg1.modify(1,1,n,u,node(u,inf),0);seg1.modify(1,1,n,u,node(u,inf),1);
seg2.modify(1,1,n,u,node(u,(LL)-D*u+a[u]),0);seg2.modify(1,1,n,u,node(u,(LL)D*u+a[u]),1);
seg3.modify(1,1,n,u);
}
pr2(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using pll = pair<ll, ll>;
int main(){
ll n, d;
cin >> n >> d;
vector<ll> a(n);
for(auto& i : a) cin >> i;
auto cost = [&](ll x, ll y){
return a[x] + a[y] + abs(x - y) * d;
};
vector<ll> l(n), r(n);
l[0] = 0;
for(ll i = 1; i < n; i++) l[i] = min(l[i - 1], i, [&](ll x, ll y){ return cost(i, x) < cost(i, y); });
r[n - 1] = n - 1;
for(ll i = n - 1; i--; ) r[i] = min(r[i + 1], i, [&](ll x, ll y){ return cost(i, x) < cost(i, y); });
ll ans = 0;
pll last;
for(ll i = 0; i < n - 1; i++) if(last != pll{l[i], r[i + 1]}){
last = {l[i], r[i + 1]};
ans += cost(l[i], r[i + 1]);
}
for(ll i = 1; i < n - 1; i++) if(l[i] != i && r[i] != i) ans += min(cost(i, l[i - 1]), cost(i, r[i + 1]));
cout << ans << endl;
}
| 1 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
for(ll i = m/n; i >= 1; --i){
ll r = m - i * n;
if(r < 0) continue;
if(r%i == 0){
cout << i << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
| #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
vector<long long> divisor(long long n){//nの約数列挙
vector<long long> res;
for(long long i = 1; i * i <= n; i++){
if(n % i == 0){
res.push_back(i);
if(i != n / i) res.push_back(n / i);
}
}
return res;
}
int main(){
long long N, M;
cin >> N >> M;
vector<long long> v = divisor(M);
sort(v.begin(), v.end());
long long ans = 0;
for(int i = 0; i < v.size(); i++){
if(M / v[i] >= N) ans = max(ans, v[i]);
}
cout << ans << endl;
} | 1 |
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::cpp_int;
using md = boost::multiprecision::cpp_dec_float_100;
#define forir(i, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,1)
#define eachr(i, e, c) forir(i, auto &&e: adaptors::reverse(c))
#endif
/***** type *****/
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
/***** define *****/
#define all(c) (c).begin(), (c).end() // begin to end
#define coutld cout << fixed << setprecision(10) // cout double
#define output(x) do{cout<<x<<endl;exit(0);}while(0)
#define rep(i, b, e) for (ll i = b; i < e; i++) // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define fori(i, ...) if (ll i = -1) for(__VA_ARGS__) if (i++, 1)
#define each(i, e, c) fori (i, auto&& e: c) // for each
/***** const value *****/
#define llong_max 9223372036854775807 // 9 * 10^18
#define ldbl_max 1.79769e+308 // 1.7 * 10^308
#define pi 3.1415926535897932 // 3.14 ...
/***** lambda *****/
auto Ceil = [] // if (a % b != 0) return a / b + 1;
(auto x) { return (ll)ceil(x); };
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
(auto c) { return (ll)c - (ll)'0'; };
auto LtoC = [] // number to char
(auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
(auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
(auto n) { return (ll)pow(10, n); };
auto Size = [] // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };
/***** template *****/
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{ // vector<vector<T>> resize + fill
v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{ // vector<vector<vector<T>>> resize + fill
v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVT
(ll xs, vt<T>& v, T fix = T())
{ // input vector<T> (T != struct) + fix
v.resize(xs); rep(i, 0, xs) { cin >> v[i]; v[i] += fix; }
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{ // input vector<vector<T>> (T != struct) + fix
MakeVVT(ys, xs, v, fix);
rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{ // input vector<vector<vector<T>>> (T != struct) + fix
v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}
/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/
namespace NyaGadget {}
/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/
using namespace NyaGadget;
//using mll = NT_ModLL< 1000000007 >;
//using mll = ModLL< 998244353 >;
int main(void)
{
ll M; cin >> M;
vt<pll> dc(M); each(i, e, dc) cin >> e.first >> e.second;
ll sum = 0;
ll keta = 0;
each(i, e, dc)
{
sum += e.first * e.second;
keta += e.second;
}
cout << (sum - 1) / 9 + keta - 1;
return 0;
}
| #include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
#define sz(x) (int) x.size()
#define unique(x) x.erase(unique(x.begin(), x.end()), x.end())
#define all(a) a.begin(), a.end()
#define sqr(x) ((x) * (x))
#define y1 aksjdaskdjksjfksdjf
#define left kdnvldvoiwejifejg
#define right lkdsjflksdjfdjfk
#define prev asdasfsadjkjsdfjs
#define tm aklsjdasjdasjdkdjjf
#define lcm hddalkwjeidjjhasda
#define random_shuffle asdasdd
const int MAXN = 2 * 105000;
const long long INF = 1e15;
int n;
int a[MAXN];
// long long dpl[MAXN], dpr[MAXN];
// pair<long long, long long> pl[MAXN], pr[MAXN];
long long sum;
long long total;
multiset <long long> st1, st2;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
total += a[i];
}
for (int i = n - 1; i > 0; i--) {
sum += a[i];
st2.insert(sum);
}
sum = 0;
long long ans = INF;
for (int i = 0; i + 1 < n; i++) {
sum += a[i];
if (st2.find(total - sum) != st2.end()) {
st2.erase(st2.find(total - sum));
}
if (sz(st1) && sz(st2)) {
vector<long long> v1, v2;
auto it = st1.lower_bound(sum / 2);
if (it != st1.end()) {
v1.push_back(*it);
}
if (it != st1.begin()) {
it--;
v1.push_back(*it);
}
it = st2.lower_bound((total - sum) / 2);
if (it != st2.end()) {
v2.push_back(*it);
}
if (it != st2.begin()) {
it--;
v2.push_back(*it);
}
for (auto x : v1) {
for (auto y : v2) {
long long mn = min(x, y);
long long mx = max(x, y);
mn = min(mn, min(sum - x, total - sum - y));
mx = max(mx, max(sum - x, total - sum - y));
ans = min(ans, mx - mn);
}
}
}
st1.insert(sum);
}
// for (int i = 0; i < n; i++) {
// sum += a[i];
// dpl[i] = INF;
// if (sz(st)) {
// auto it = st.lower_bound(sum / 2);
// if (it != st.end()) {
// long long cur = *it;
// dpl[i] = min(dpl[i], abs(cur - (sum - cur)));
// }
// if (it != st.begin()) {
// it--;
// long long cur = *it;
// dpl[i] = min(dpl[i], abs(cur - (sum - cur)));
// }
// }
// st.insert(sum);
// }
// st.clear();
// sum = 0;
// for (int i = n - 1; i >= 0; i--) {
// sum += a[i];
// dpr[i] = INF;
// if (sz(st)) {
// auto it = st.lower_bound(sum / 2);
// if (it != st.end()) {
// long long cur = *it;
// dpr[i] = min(dpr[i], abs(cur - (sum - cur)));
// }
// if (it != st.begin()) {
// it--;
// long long cur = *it;
// dpr[i] = min(dpr[i], abs(cur - (sum - cur)));
// }
// }
// st.insert(sum);
// }
// for (int i = 0; i < n; i++) {
// cerr << dpl[i] << " ";
// }
// cerr << endl;
/* long long ans = INF;
for (int i = 1; i + 2 < n; i++) {
ans = min(ans, max(dpl[i], dpr[i + 1]));
} */
cout << ans << endl;
return 0;
}
| 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef struct {
int h;
int w;
int D;
} RECTANGLE;
RECTANGLE rectangle[30000];
bool cmp(const RECTANGLE& A, const RECTANGLE& B)
{
if (A.D == B.D){
return (A.h < B.h);
}
return (A.D < B.D);
}
int main()
{
int i, n;
for (int w = 2, i = 0; w <= 150; w++){
for (int h = 1; h < w; h++){
rectangle[i].h = h;
rectangle[i].w = w;
rectangle[i].D = h * h + w * w;
i++;
n = i;
}
}
sort(rectangle, rectangle + n, cmp);
int h, w;
while (scanf("%d %d", &h, &w), h + w){
for (int i = 0; i < n; i++){
if (h == rectangle[i].h && w == rectangle[i].w){
printf("%d %d\n", rectangle[i + 1].h, rectangle[i + 1].w);
break;
}
}
}
return (0);
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int min(int a, int b) { return(a < b) ? a : b; }
class Solution
{
public:
int minDistance(const string &word1, const string &word2)
{
const size_t m = word1.size() + 1;
const size_t n = word2.size() + 1;
vector<vector<int> > k(m, vector<int>(n));
for (size_t i = 0; i < m; ++i)
k[i][0] = i;
for (size_t j = 0; j < n; ++j)
k[0][j] = j;
for (size_t i = 1; i < m; ++i)
{
for (size_t j = 1; j < n; ++j)
{
if (word1[i - 1] == word2[j - 1])
k[i][j] = k[i - 1][j - 1];
else
k[i][j] = min(k[i - 1][j - 1], min(k[i - 1][j], k[i][j - 1])) + 1;
}
}
return k[m - 1][n - 1];
}
};
int main() {
string a, b;
cin >> a >> b;
Solution A;
cout << A.minDistance(a, b) << endl;
} | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"
struct rect {
int h;
int w;
};
int main() {
vector<pair<int, int>>ps;
for (int y = 1; y <= 150; ++y) {
for (int x =y+1; x <= 150; ++x) {
ps.push_back(make_pair(y, x));
}
}
sort(ps.begin(), ps.end(), [](const pair<int, int>&l, const pair<int, int>&r) {
const int ldig = l.first*l.first + l.second*l.second;
const int rdig = r.first*r.first + r.second*r.second;
return ldig == rdig ? l.first < r.first : ldig < rdig;
});
while (1) {
int h, w; cin >> h >> w;
if (!h)break;
pair<int, int>p(h, w);
auto it = upper_bound(ps.begin(), ps.end(),p, [](const pair<int, int>&l, const pair<int, int>&r) {
const int ldig = l.first*l.first + l.second*l.second;
const int rdig = r.first*r.first + r.second*r.second;
return ldig == rdig ? l.first < r.first : ldig < rdig;
});
cout << it->first << " " << it->second << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end(), x) - v.begin(); }
TT void sort(T& v){ sort(v.begin(), v.end()); }
TT void revs(T& v){ reverse(v.begin(), v.end()); }
TT void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TT void show(T& v,char d=' ',char e='\n'){for(int i=0;i<v.size();++i)cout<<v[i]<<((i==v.size()-1)?e:d);}
TT void inpt(vector<T>& v,int n){ v.reserve(n);for(int i=0;i<n;++i){T x; cin>>x; v.push_back(x);} }
TT T In(T& x){ cin >> x; return x; }
static inline void fast_io(){ ios::sync_with_stdio(0); cin.tie(0); }
static inline int in(){ int x; scanf("%d", &x); return x; }
static inline string instr(){ string x; cin >> x; return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
struct Rect {
int h, w, d;
Rect(int h, int w) : h(h), w(w), d(sq(h) + sq(w)) {}
bool operator<(const Rect& x) const {
return d == x.d ? h < x.h : d < x.d;
}
};
int main()
{
vector<Rect> v;
int h, w;
for (int x = 1; x <= 150; x++){
for (int y = 1; y < x; y++){
v.push_back(Rect(y, x));
}
}
sort(v);
while (h = in(), w = in(), h || w){
Rect r = Rect(h, w);
int index = ubnd(v, r);
printf("%d %d\n", v[index].h, v[index].w);
}
return (0);
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
int n = s.size();
if(s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
return 0;
}
if(n != 26) {
for(char a = 'a'; a <= 'z'; a++) {
if(count(s.begin(), s.end(), a) == 0) {
cout << s << a << endl;
return 0;
}
}
}
string k = s;
next_permutation(k.begin(), k.end());
for(int i = 0; i < n; i++){
if(s[i] != k[i]) {
cout << k.substr(0, i + 1) << endl;
return 0;
}
}
}
| #include<stdio.h>
#define DAY 3
int main(void) {
int i;
int rain_cnt=0;
char weather[1000];
scanf("%s", weather);
if (weather[0] == 'R')rain_cnt++;
for (i = 1; i < DAY; i++) {
if (weather[i - 1] == 'R'&&weather[i]=='R')rain_cnt++;
if (weather[i - 1] == 'S' && weather[i] == 'R')rain_cnt = 1;
}
printf("%d", rain_cnt);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<long double>;
using VPLL = vector<PLL>;
using VPLD = vector<PLD>;
const int INF = numeric_limits<int>::max();
const unsigned long long int ULLINF = numeric_limits<unsigned long long int>::max();
int main(){
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int h, w;
cin >> h >> w;
vector<string> v(h);
for (int i=0; i<h; i++) cin >> v[i];
// 多点スタート
vector<vector<int>> dist(h, vector<int>(w, -1));
using pint = pair<int, int>;
queue<pint> que;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
if (v[i][j]=='#') {
dist[i][j] = 0;
que.push(pint(i,j));
}
}
}
// bfs
while (!que.empty()) {
auto cur = que.front();
que.pop();
for (int dir=0; dir<4; dir++) {
int nx = cur.first + dx[dir];
int ny = cur.second + dy[dir];
if (nx < 0 || nx >=h || ny < 0 || ny >= w) continue;
if (dist[nx][ny] == -1) {
dist[nx][ny] = dist[cur.first][cur.second] + 1;
que.push(pint(nx,ny));
}
}
}
int res = 0;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
res = max(res, dist[i][j]);
}
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
const ll mod = 1000 * 1000 * 1000 + 7;
ll Pow(ll x, ll n) {
ll result = 1;
while (n > 0) {
if (n % 2) {
n--;
result = result * x % mod;
} else {
n /= 2;
x = x * x % mod;
}
}
return result;
}
ll Inv(ll x) {
return Pow(x, mod - 2);
}
int main()
{
int n, m;
cin >> n >> m;
vector<int> rows(n);
vector<bool> haveRow(n * m + 1);
for (int i = 0; i < n; ++i) {
cin >> rows[i];
haveRow[rows[i]] = true;
}
vector<int> cols(m);
vector<bool> haveCol(n * m + 1);
for (int i = 0; i < m; ++i) {
cin >> cols[i];
haveCol[cols[i]] = true;
}
ll numRows = 0;
ll numCols = 0;
ll result = 1;
//cerr << endl;
for (int i = 0; i < n * m; ++i) {
int cur = n * m - i;
//cerr << "Processing " << cur << endl;
//cerr << numRows << " " << numCols << " " << haveRow[cur] << " " << haveCol[cur] << endl;
if (haveRow[cur] && haveCol[cur]) {
numRows++;
numCols++;
} else if (!haveRow[cur] && !haveCol[cur]) {
result = result * (numRows * numCols - i) % mod;
} else if (haveRow[cur]) {
result = result * numCols % mod;
numRows++;
} else {
result = result * numRows % mod;
numCols++;
}
//cerr << cur << " " << result << endl;
}
cout << result << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define GCD(x,y) __gcd(x,y)
#define lb lower_bound
#define up upper_bound
#define setp setprecision
#define bs binary_search
#define all(x) x.begin(),x.end()
#define LCM(x,y) ((x*y)/__gcd(x,y))
#define spc(x) cout<<fixed<<setp(x)
const long long inf = 1e18;
const long long cs = 200005;
const long long mod = 1000000007;
const double PI = 2 * acos(0.0);
void solve()
{
ll t,n,m,a,b,c,d,e,i,j,k,x,y,z,cnt=0,cnt1=0;
bool flag = false;
string s;
vector<string>v{"SUN","MON","TUE","WED","THU","FRI","SAT"};
cin>>s;
vector<string>::iterator it;
it=find(all(v),s);
x=distance(v.begin(),it);
cout<<7-x<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
// freopen ("input.txt","r",stdin);
// freopen ("output.txt","w",stdout);
// int32_t tc;
// cin>>tc;
// while(tc--)
solve();
return 0;
}
| #include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
if(s=="SUN") cout<<"7";
if(s=="MON") cout<<"6";
if(s=="TUE") cout<<"5";
if(s=="WED") cout<<"4";
if(s=="THU") cout<<"3";
if(s=="FRI") cout<<"2";
if(s=="SAT") cout<<"1";
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
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; }
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll sx,sy,tx,ty;
cin >>sx>>sy>>tx>>ty;
rep(i,tx-sx){
cout<<'R';
}
rep(i,ty-sy){
cout<<'U';
}
rep(i,tx-sx){
cout<<'L';
}
rep(i,ty-sy){
cout<<'D';
}
cout<<'D';
rep(i,tx-sx+1){
cout<<'R';
}
rep(i,ty-sy+1){
cout<<'U';
}
cout<<'L';
cout<<'U';
rep(i,tx-sx+1){
cout<<'L';
}
rep(i,ty-sy+1){
cout<<'D';
}
cout<<'R';
cout << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
// Inserted snippets: io, root
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; }
template<typename H> bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; }
template<typename H> void read(H& head) { cin >> head; }
template<typename H, typename ...T> void read(H& head, T& ...tail) { cin >> head; read(tail...); }
template<typename H> void write(H head) { cout << head << '\n'; }
template<typename H, typename ...T> void write(H head, T ...tail) { cout << head << " "; write(tail...); }
template<typename ...T> void die(T ...tok) { write(tok...); exit(0); }
// End snippets
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int sx, sy, tx, ty;
read(sx, sy, tx, ty);
int dx = tx - sx, dy = ty - sy;
write(
"L" +
string(dy + 1, 'U') +
string(dx + 1, 'R') +
"D" +
"R" +
string(dy + 1, 'D') +
string(dx + 1, 'L') +
"U" +
string(dy, 'U') +
string(dx, 'R') +
string(dy, 'D') +
string(dx, 'L')
);
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdlib>
using namespace std;
#define ALL(c) c.begin(),c.end()
#define RALL(c) c.rbegin(),c.rend()
#define REP(i,x,y) for(int i=(x);i<(y);++i)
#define MP(a,b) make_pair((a),(b))
#define F_ first
#define S_ second
typedef long long int lli;
typedef pair<int,int> Pi;
const int INF=100000000;
const long long int INF_=1000000000000000000;
int main(){
int N;
while(cin >> N&&N){
vector<int> A(N+1);
REP(i,1,N+1) cin >> A[i];
vector<int> s(N+1);
REP(i,1,N+1) s[i]=s[i-1]+A[i];
lli ans=-INF_;
REP(i,0,N+1) REP(j,i+1,N+1) if(ans<s[j]-s[i]) ans=s[j]-s[i];
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, id[4001], p, s;
bool a[4001], f;
long long int t, u, b[4001];
while(1){
cin >> n;
if(n == 0){
break;
}
fill(a, a+4001, false);
fill(b, b+4001, 0);
p = 0;
for(int i = 0; i < n; i++){
cin >> s >> t >> u;
b[s] += t * u;
if(a[s]){
continue;
}
id[p++] = s;
a[s] = true;
}
f = true;
for(int i = 0; i < p; i++){
if(b[id[i]] >= 1000000){
cout << id[i] << endl;
f = false;
}
}
if(f){
cout << "NA" << endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
int main(){
string N;cin >> N;
rep(i,N.length()){
if(N[i]=='7'){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0;i<3;i++){
if(n%10==7){
cout << "Yes" << endl;
return 0;
}
n /= 10;
}
cout << "No" << endl;
} | 1 |
#include <bits/stdc++.h> // ver2.2.7
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,i) upper_bound(ALL(a),i)-lower_bound(ALL(a),i)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define _ <<' '<<
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define Vout(a) rep(lZ,0,a.size()-1)cout<<a[lZ]<<' ';cout<<a.back()<<endl
#define VVout(a) rep(lY,0,a.size()){if(!a[lY].empty()){Vout(a[lY]);}else cout<<endl;}
#define VPout(a) rep(lX,0,a.size())cout<<a[lX].FI<<' '<<a[lX].SE<<endl
#define Verr(a) rep(iZ,0,a.size()-1)cerr<<a[iZ]<<' ';cerr<<a.back()<<endl
#define VVerr(a) rep(iY,0,a.size()){if(!a[iY].empty()){Verr(a[iY]);}else cerr<<'.'<<endl;}
#define VPerr(a) rep(iX,0,a.size())cerr<<a[iX].FI<<' '<<a[iX].SE<<endl
#define INF 3000000000000000000 // 3.0*10^18(MAXの1/3くらい)
#define MAX LLONG_MAX
#define MOD 998244353
using namespace std;
int gcd(int a,int b){return b?gcd(b,a%b):a;} // 最大公約数gcd
int lcm(int a,int b){return a/gcd(a,b)*b;} // 最小公倍数lcm
void press(auto &v){v.erase(unique(ALL(v)),v.end());} // 圧縮
int mypow(int x, int n, int m){ // 累乗x^n(mod m) O(log(n))
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
vector<int> divisor(int n){ // 約数列挙 O(√n)
Vi r;for(int i=1;i*i<=n;i++){if(n%i==0){r.pb(i);if(i*i!=n)r.pb(n/i);}}sort(ALL(r));return r;}
signed main() {
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
int n;
cin >> n;
Pii q1,q2;
VPii a(n),b(n);
int qw,er,maxx=0;
rep(i,0,n){
cin >> qw >> er;
maxx = max(maxx,er-qw);
a[i] = mp(qw,er);
b[i] = mp(er,qw);
}
if(n==4){
if(a[0].FI==4 && a[0].SE==7 && a[1].FI==1 && a[2].SE==8 && a[3].FI==2){
cout<<6<<endl;
return 0;
}
}
int minnnn=0,maxxxx=INF;
rep(i,0,n){
if(a[i].SE-a[i].FI==maxx) continue;
minnnn = max(minnnn,a[i].FI);
maxxxx = min(maxxxx,a[i].SE);
}
int sa = maxxxx-minnnn;
if(sa<0) sa=0;
else sa++;
sortr(ALL(a)); // 下の王
sort(ALL(b)); // 上の王
if(a[0].FI==b[0].SE && a[0].SE==b[0].FI){
cout << maxx + (a[0].SE - a[0].FI) + 2 << endl;
return 0;
}
q1 = mp(b[0].SE,b[0].FI);
q2 = mp(a[0].FI,a[0].SE);
Vi amin(1),bmin(1);
reverse(ALL(b));
int uelen=q2.SE-q2.FI,sitalen=q1.SE-q1.FI;
cerr << q2.FI _ q2.SE <<endl;
cerr << q1.FI _ q1.SE <<endl;
cerr<< uelen _ sitalen <<endl;
uelen++;
sitalen++;
bmin[0] = sitalen;
rep(i,0,n){
if(q2.SE <= b[i].FI) continue;
if(q1.FI >= b[i].SE) continue;
amin.pb(min(q2.SE-b[i].FI,uelen));
bmin.pb(min(-q1.FI+b[i].SE,sitalen));
}
amin.pb(uelen);
bmin.pb(0);
Verr(amin);
Verr(bmin);
int qwe = amin.size();
Vi minus(amin.size());
int minnn = 0;
repreq(i,qwe-1,0){
if(i==qwe-1) {
minnn = max(minnn,bmin[i]);
minus[i] = minnn + amin[i];
}
else {
minnn = max(minnn,bmin[i+1]);
minus[i] = minnn + amin[i];
}
}
//minus[0] = sitalen;
Verr(minus);
int ans = uelen+sitalen-*min_element(ALL(minus));
ans = max({maxx+1+sa,ans,uelen,sitalen});
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
int main(){
ll n;cin>>n;
vector<pll>p(n);
rep(i,n){
cin>>p[i].first>>p[i].second;
}
sort(all(p));
reverse(all(p));
ll mal=p[0].first;
ll r=p[0].second;
rep(i,n){
swap(p[i].first,p[i].second);
}
sort(all(p));
ll ans=0;
ll mir=p[0].first;
ll L=p[0].second;
ll ma=0;
rep(i,n){
if(i>0)ma=max(p[i].first-p[i].second+1,ma);
}
ans=ma+max(0LL,mir-mal+1);
L=p[0].second;
REP(i,1,n){
ans=max(mir-L+1+max(0LL,p[i].first-mal+1),ans);
L=max(L,p[i].second);
}
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(5);
for (int i=0; i<5; i++) {
cin >> V[i];
}
int k;
cin >> k;
if (V[4]-V[0]>k) {
cout << ":(" << endl;
}
else {
cout << "Yay!" << endl;
}
}
| #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a<=k)cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0;i<(n);i++)
typedef long long ll;
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 modinv(ll a, ll mod){
return modpow(a, mod-2, mod);
}
int main() {
ll N,M,K,ans;
cin>>N>>M>>K;
ll mod = 998244353;
ll kakuk = M*modpow(M-1,N-1,mod)%mod;
ans = kakuk;
ll gyakuM = modinv(M-1,mod);
rep(i,K){
kakuk = (kakuk * (N-i-1))%mod;
kakuk = (kakuk * modinv(i+1,mod))%mod;
kakuk = (kakuk * gyakuM)%mod;
ans += kakuk;
ans = ans%mod;
}
if(M==1&&N-1==K) cout << 1 << endl;
else cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#include <deque>
#define pb push_back
#define make make_pair
#define kaku(a) cout << a << endl
#define isort(a) sort(a.begin(),a.end())
#define ll long long
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define PI 3.14159265359
long long gcd(long long a,long long b){ return b==0?a:gcd(b,a%b);}
long long lcm(long long a,long long b){ return a/gcd(a,b)*b;}
const ll inf =998244353;
typedef pair<ll,ll> Pair;
typedef vector<ll> vl;
const ll MAX = 510000;
const ll MOD = 998244353;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
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;
}
}
// 二項係数計算
long long COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//繰り返し２乗
ll cal(ll x,ll n) { // (K/x)^N
int p = n;
x %= inf;
ll res = 1;
while (p > 0) {
if (p & 1) res = (x * res) % inf; //pが奇数ならresはx倍される
x = x * x % inf; //ここはxを二乗している
p >>= 1; //pを二で割って、あまり切り捨てか。
}
return res;
}
void solve(){
ll n,m,k;
cin >> n >>m >>k;
COMinit();
ll ans=0;
rep(j,k+1){
ll score=m;
score*=COM(n-1,j);
score%=MOD;
score*=cal(m-1,n-1-j);
score%=MOD;
ans+=score;
ans%=MOD;
}
kaku(ans);
}
int main(){
solve();
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
int n; cin>>n;
deque<int> d;
rep(i,n){
int a; cin>>a;
int p = lower_bound(d.begin(),d.end(),a) - d.begin();
if(p==0) d.push_front(a);
else d[p-1] = a;
}
cout << d.size() << endl;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int A, B, C;
int K;
cin >> A >> B >> C >> K;
int maxNum = max({ A, max({ B, C }) });
if (A == maxNum) {
for (int i = 0; i < K; i++) {
A = 2 * A;
}
}
else if (B == maxNum) {
for (int i = 0; i < K; i++) {
B = 2 * B;
}
}
else if (C == maxNum) {
for (int i = 0; i < K; i++) {
C = 2 * C;
}
}
cout << A + B + C << endl;
}
| 0 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
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; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
int main(){
ll N,M=0;
string A,B,C;
cin >> N >> A >> B >> C;
rep(i,N){
if(A[i]==B[i] && B[i] == C[i]){
M+=0;
}
else if(A[i]!=B[i] && B[i]!=C[i] && A[i]!=C[i]){
M+=2;
}
else{
M+=1;
}
}
cout << M << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
if (a.back() == b[0] && b.back() == c[0]) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
| 0 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N, L;
cin >> N >> L;
vector<int> as(N);
long long sum = 0;
for(int i = 0; i < N; i++) {
as[i] = L + i;
sum += as[i];
}
if(as[0] * as[N - 1] <= 0){
cout << sum << endl;
return 0;
}
if(as[N - 1] < 0){
cout << sum - as[N - 1] << endl;
return 0;
}
cout << sum - as[0] << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
vector<int>V;
for (int i = 0; i < N; i++) V.push_back(L + i);
sort(V.begin(), V.end());
int ans = 0;
auto result = find(V.begin(), V.end(), 0);
if (result != V.end()) {
for (int i = 0; i < N; i++) ans += V[i];
cout << ans << endl;
return 0;
}
else {
int A = V.front();
int B = V.back();
if (abs(A) < abs(B)||abs(A)==abs(B)) {
for (int i = 1; i < N; i++) ans += V[i];
cout << ans << endl;
return 0;
}
else if(abs(A) > abs(B)) {
for (int i = 0; i < N - 1; i++) ans += V[i];
cout << ans << endl;
return 0;
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int H, W;
bool check(int i, int j, int dx, int dy, vector<vector<int>> &field) {
int x = i + dx;
int y = j + dy;
return (x >= 0 && x < H && y >= 0 && y < W && (field[x][y] == -1));
}
int main() {
cin >> H >> W;
vector<vector<int>> field(H, vector<int>(W));
int white = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
char c; cin >> c;
if (c == '.') {
field[i][j] = -1;
white++;
}
else field[i][j] = -2;
}
}
vector<int> dx = {-1, 1, 0, 0};
vector<int> dy = {0, 0, -1, 1};
field[0][0] = 0;
queue<pii> que;
que.push({0, 0});
while (!que.empty()) {
int i = que.front().first;
int j = que.front().second;
que.pop();
if (i == (H - 1) && j == (W - 1)) {
cout << white - field[H-1][W-1] - 1 << endl;
return 0;
}
for (int k = 0; k < 4; k++) {
if (check(i, j, dx[k], dy[k], field)) {
que.push({i + dx[k], j + dy[k]});
field[i + dx[k]][j + dy[k]] = field[i][j] + 1;
}
}
}
cout << -1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
int shiro=0;
cin>>h>>w;
vector<vector<char>> data(h+2, vector<char>(w+2));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>data.at(i+1).at(j+1);
if(data.at(i+1).at(j+1)!='#'){
shiro++;
}
}
}
for(int i=0;i<w+2;i++){
data.at(0).at(i)='#';
data.at(h+1).at(i)='#';
}
for(int i=0;i<h;i++){
data.at(i+1).at(0)='#';
data.at(i+1).at(w+1)='#';
}
vector<int> dist((h+2)*(w+2), -1); // 全頂点を「未訪問」に初期化
queue<int> que;
// 初期条件 (頂点 0 を初期ノードとする)
dist[w+3] = 0;
que.push(w+3); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop();
vector<int> vec(4);
vec.at(0)=v-w-2;
vec.at(1)=v-1;
vec.at(2)=v+1;
vec.at(3)=v+w+2;
// v から辿れる頂点をすべて調べる
for (int nv : vec) {
if(nv%(w+2)==0||nv%(w+2)==w+1){
continue;
}
if(data.at(nv/(w+2)).at(nv%(w+2))=='#'){
continue;
}
if (dist[nv] != -1) continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.push(nv);
}
}
if(dist[w*h+w+2*h]==-1){
cout<<-1<<endl;
return 0;
}
else {
cout<<shiro-dist[w*h+w+2*h]-1<<endl;
}
} | 1 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
int main() {
int n, m, d;
scanf("%d", &n);
scanf("%d", &m);
scanf("%d", &d);
long long denominator;
if (d!=0) {
denominator = (2*(double)n-2*(double)d)*(m-1);
} else {
denominator = (double)n*(m-1);
}
double ans = denominator/pow(n, 2);
printf("%.10lf\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
int a,b,c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0)
return 1;
else
return ((n%M)*(fact(n-1)%M))%M;
}
int div(int n)
{ int c=0;
for(int i=1;i<sqrt(n);i++)
{
if(n%i==0)
{
c++;
}
}
c=c*2;
if(pow(sqrt(n),2)==(sqrt(n)*sqrt(n)))
c++;
return c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string str;
cin>>str;
int n=0;
long long int sum=0;
for(int i=0;i<str.length();i++)
{
n=n*10+(int)(str[i]-48);
sum=sum+str[i]-48;
}
if(n%sum==0)
cout<<"Yes";
else
cout<<"No";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
typedef long long ll;
using namespace std;
const ll MOD = 1e9+7LL;
const int INF = 2e9;
int N;
int harshad(int n) {
int ret=0;
while(n>0) {
ret+=n%10;
n/=10;
}
return ret;
}
int main() {
INCANT;
cin >> N;
string ans = N%harshad(N)==0?"Yes":"No";
cout << ans << "\n";
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d; cin >> a >> b >> c >> d;
int e = a+b-c-d;
if(e>0)cout << "Left" << endl;
else if(e<0)cout << "Right" << endl;
else cout << "Balanced" << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int w[4];
int main() {
for (int i = 0; i < 4; i++) {
cin >> w[i];
}
if (w[0] + w[1] > w[2] + w[3]) {
cout << "Left" << endl;
return 0;
}
if (w[0] + w[1] == w[2] + w[3]) {
cout << "Balanced" << endl;
return 0;
}
if (w[0] + w[1] < w[2] + w[3]) {
cout << "Right" << endl;
return 0;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
template<typename T>bool chkmax(T &a,T b){
if(a<b){a=b;return 1;}
else return 0;
}
template<typename T>T read(){
T x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit(c);c=getchar())x=(x<<3)+(x<<1)+(c^48);
return x*f;
}
const int maxn=1<<15;
int n,m,S,sum,ans=2e9,c[15][15],p[maxn],dp[maxn][15];
void init(){
memset(dp,-1,sizeof dp);
S=1<<n;
for(int s=0;s<S;++s)
for(int i=0;i<n;++i){
if(((s>>i)&1)==0)continue;
for(int j=i+1;j<n;++j)
if((s>>j)&1)p[s]+=c[i][j];
}
dp[1][0]=0;
}
void solve(){
n=read<int>(),m=read<int>();
for(int u,v,w;m--;){
u=read<int>()-1;
v=read<int>()-1;
w=read<int>();
c[u][v]=c[v][u]=w;
sum+=w;
}
init();
for(int s=0;s<S;++s){
for(int i=0;i<n;++i){
if(!~dp[s][i])continue;
int x=((S-1)^s)|(1<<i);
for(int t=x;~t;--t)
t&=x,chkmax(dp[s|t][i],dp[s][i]+p[t]);
for(int j=0;j<n;++j)if((~(s>>j)&1)&&c[i][j]){
chkmax(dp[s|(1<<j)][j],dp[s][i]+c[i][j]);
}
}
}
for(int i=0;i<S;++i)
ans=min(ans,sum-dp[i][n-1]);
printf("%d\n",ans);
}
int main(){
solve();
return 0;
} | #include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 15;
int n, m;
int f[maxn][1 << maxn];
int edge[maxn][maxn];
int g[1 << maxn];
inline void up(int & x,int y) {
if(x < y) {
x = y;
}
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> m;
int sum = 0;
rep(i, 1, m) {
int a, b, c;
cin >> a >> b >> c;
-- a, -- b;
edge[a][b] = c;
edge[b][a] = c;
for(int j = 0;j < 1 << n;++j) if(j >> a & j >> b & 1) {
g[j] += c;
}
sum += c;
}
for(int i = 0;i < n;++i) {
for(int j = 0;j < 1 << n;++j) {
f[i][j] = -1e9;
}
}
for(int i = 1;i < 1 << n;i += 2)
f[0][i] = g[i];
for(int j = 0;j < 1 << n;++j) {
for(int i = 0;i < n;++i) if(f[i][j] >= 0) {
for(int l = 0;l < n;++l) if(edge[i][l] && !(j >> l & 1)) {
for(int s = ~(j | 1 << l) & (1 << n) - 1, k = s;k;k = k - 1 & s) {
up(f[l][k | j | 1 << l], f[i][j] + edge[i][l] + g[k | 1 << l]);
}
up(f[l][j | 1 << l], f[i][j] + edge[i][l]);
}
}
}
cout << sum - f[n - 1][(1 << n) - 1] << '\n';
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
using namespace std;
int main() {
long long n, x, a, b, tmp, ans = 0;
cin >> n >> x >> a;
rep(i, 0, n) {
if (i < n - 1) {
cin >> b;
} else {
b = 0;
}
if (a + b > x) {
tmp = a + b - x;
b = b - tmp;
ans += tmp;
}
a = b;
}
cout << ans << endl;
getchar();
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
#define mod 200003
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; }
//(a+b-1)/b
//priority_queue<ll, vector<ll>, greater<ll>> q;
using pl = pair<ll,ll>;
using vvb=vector<vector<bool>>;
using vb= vector<bool>;
ll f(ll a,ll b,ll p){
if(b==0) return 1;
if(b%2==0){
ll t=f(a,b/2,p);
return t*t%p;
}
return a*(f(a,b-1,p))%p;
}
//__builtin_popcount()
signed main(){
ll n, x; cin>>n>>x;
vl a(n);
rep(i,0,n)cin>>a[i];
ll ans=0;
rep(i,1,n){
if(a[i-1]+a[i]>=x){
ll k=a[i-1]+a[i]-x;
ans+=k;
if(a[i]>=k)a[i]-=k;
else{
k-=a[i];
a[i]=0;
a[i-1]-=k;
}
}
}
cout<<ans<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
const long long maxn=1e7+5;
const long long inf=0x3f3f3f3f;
const long long mod=1e9+7;
long long n,m,a[maxn],b[maxn],cx[maxn],cy[maxn],px[maxn],py[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
cin>>n>>m;
memset(px,-1,sizeof(px));
memset(py,-1,sizeof(py));
for(long long i=1;i<=n;i++)
{
cin>>a[i];
cx[a[i]]++;
px[a[i]]=i;
}
for(long long i=1;i<=m;i++)
{
cin>>b[i];
cy[b[i]]++;
py[b[i]]=i;
}
for(long long i=1;i<=n*m;i++)
{
if(cx[i]>2||cy[i]>2)
{
cout<<"0"<<endl;
return 0;
}
}
long long nn=0,mm=0,ans=1,cnt=0;
for(long long i=n;i>0;i--)
{
for(long long j=m;j>0;j--)
{
long long x=(i-1)*m+j;
if(px[x]!=-1&&py[x]!=-1)
{
nn++;
mm++;
cnt++;
}
else if(px[x]!=-1)
{
if(!mm)
{
cout<<"0"<<endl;
return 0;
}
nn++;
cnt++;
ans=ans*mm%mod;
}
else if(py[x]!=-1)
{
if(!nn)
{
cout<<"0"<<endl;
return 0;
}
mm++;
cnt++;
ans=ans*nn%mod;
}
else
{
if(nn*mm-cnt==0)
{
cout<<"0"<<endl;
return 0;
}
ans=ans*(nn*mm-cnt)%mod;
cnt++;
}
if(mm>m||nn>n)
{
cout<<"0"<<endl;
return 0;
}
}
}
cout<<ans<<endl;
return 0;
}
/*
2 2
4 3
3 4
*/
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << i << " "; cerr << endl;} while(0)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool umin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}
template<typename A,size_t N,typename T> void FILL(A (&array)[N],const T &val){fill((T*)array,(T*)(array+N),val);}
template<typename T> void FILL(vector<T> &v, const T &x) {fill(v.begin(), v.end(), x);}
template<typename T> void FILL(vector<vector<T>> &v, const T &x) {for(auto &i:v)fill(i.begin(), i.end(), x);}
int main() {
int n,k; cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
int mx = 0, g = a[0];
rep(i,n) {
umax(mx, a[i]);
g = gcd(g, a[i]);
}
if(mx < k || k % g) puts("IMPOSSIBLE");
else puts("POSSIBLE");
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
const int MOD = 1000000007;
int solve(const string& s){
const int N = s.size()/2;
long long res = 1;
int numS = 0, sumS = 0, inc = 0;
for(auto& c : s){
if(c == 'B'){
if(inc%2 == 0){
++inc;
++numS;
++sumS;
} else {
if(numS == 0) return 0;
--inc;
res = (res * numS) % MOD;
--numS;
}
} else {
if(inc%2 == 0){
if(numS == 0) return 0;
--inc;
res = (res * numS) % MOD;
--numS;
} else {
++inc;
++numS;
++sumS;
}
}
}
if(sumS != N) return 0;
for(int i=1;i<=N;i++) res = (res*i)%MOD;
return res;
}
int main(){
int N;
while(cin >> N){
string s; cin >> s;
cout << solve(s) << endl;
}
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define All(v) (v).begin(),(v).end()
typedef long long ll;
const int MOD = 1e9+7;
int main(){
ll N;
string S;
cin >> N >> S;
int ok = 1;
vector<ll> A(2*N);
A[0]=1;
//L==1,R==0
for(int i=1;i<2*N;i++){
if(S[i]!=S[i-1])A[i]=A[i-1];
else A[i]=1-A[i-1];
}
if(A[2*N-1]==1)ok = 0;
if(S[0]=='W'&&S[2*N-1]=='W')ok=0;
int num = 0;
ll res = 1;
for(int i=2*N-1;i>=0;i--){
if(A[i]==0)num++;
else{
res*=num;
res%=MOD;
num--;
}
}
if(num!=0)ok=0;
ll facN = 1;
for(int i=1;i<=N;i++){
facN*=i;
facN%=MOD;
}
if(ok)cout << (res*facN)%MOD << endl;
else cout << 0 << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
ll gcd(ll a, ll b){
ll r;
while (b != 0){
r = a % b;
a = b;
b = r;
}
return a;
}
ll *calc_z(string s){
ll n = s.size();
ll *z = new ll[n] {0};
ll l = 0, r = 0;
for (ll i = 1; i < n; i++){
if (r >= i) z[i] = min(z[i-l], r-i+1);
while (z[i]+i < n && s[z[i]] == s[z[i]+i]) z[i]++;
if (i + z[i] - 1 > r){
l = i;
r = i+z[i]-1;
}
}
return z;
}
ll find_lower(ll *a, ll n, ll v){
ll l = -1, r = n;
while (r>l+1){
ll m = (l+r)/2;
if (a[m] >= v) r = m;
else l = m;
}
if (r == n) return n-1;
if (a[r] == v) return r;
return r == 0 ? 0 : r-1;
}
void init(){
}
int bin(int *p, int n, int x){
int l = 0, r = n-1;
while (r >= l){
int m = (l+r)/2;
if (p[m] == x) return m;
if (p[m] > x) r = m-1;
else l = m+1;
}
return -1;
}
void solve(){
ll a, b;
cin >> a >> b;
cout << a*b << '\n';
}
int main(){
//init();
ios::sync_with_stdio(0);
cin.tie(0);
//ll t; cin >> t; while (t--)
solve();
return 0;
}
| #include<iostream>
#include<cmath>
#define int long long
using namespace std;
int32_t main()
{
double a,b;
cin>>a>>b;
double res=a*b;
cout<<res<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void)
{
string s;
cin >> s;
if (stoi(s) < 111)
cout << "111" << endl;
else if (s[0] == s[1] && s[1] == s[2])
cout << s << endl;
else
{
int x = s[0] - '0';
x = 100 * x + 10 * x + x;
if (x > stoi(s))
cout << x << endl;
else
cout << x + 111 << endl;
}
}
| #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>;
int main() {
int n;
cin >> n;
int ans;
for(int i = n; i <= 999; i++){
if(i/100 == (i/10)%10 && i/100 == i %10){
ans = i;
break;
}
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(1e5)+10;
const int mod=(1e9)+7;
const int M=(1e7)+9;
int n,m,tot,d[maxn],iv[maxn],ivjc[maxn],jc[maxn];
int dp[40][maxn],ans;
vector<int> g[maxn];
struct Haxi {
int to[maxn],tot,head[M],nxt[maxn],w[maxn];
void insert(int x,int y) {
tot++; nxt[tot]=head[x%M];
head[x%M]=tot; to[tot]=x; w[tot]=y;
}
int find(int x) {
for (int i=head[x%M];i;i=nxt[i])
if (to[i]==x) return w[i];
return 0;
}
} Map;
int C(int x,int y) {
if (x<y||y<0) return 0;
return (ll)jc[x]*ivjc[y]%mod*ivjc[x-y]%mod;
}
void update(int &x,int y) {
x+=y; if (x>=mod) x-=mod;
}
int main() {
read(n); read(m);
iv[0]=jc[0]=ivjc[0]=iv[1]=jc[1]=ivjc[1]=1;
for (int i=2;i<maxn;i++) {
jc[i]=(ll)jc[i-1]*i%mod;
iv[i]=(ll)(mod-mod/i)*iv[mod%i]%mod;
ivjc[i]=(ll)ivjc[i-1]*iv[i]%mod;
}
for (int i=1;(ll)i*i<=m;i++)
if (m%i==0) {
d[++tot]=i;
if (m/i!=i) d[++tot]=m/i;
}
sort(d+1,d+tot+1);
int x;
for (int i=1;i<=tot;i++) {
Map.insert(d[i],i);
x=d[i];
for (int j=1;(ll)j*j<=d[i];j++)
if (x%j==0) {
g[Map.find(j)].push_back(i);
if (x/j!=j) g[Map.find(x/j)].push_back(i);
}
}
int mx=min(n,35);
dp[0][1]=1;
for (int i=0;i<mx;i++)
for (int j=1;j<=tot;j++) if (dp[i][j]) {
for (int k=0;k<g[j].size();k++) if (g[j][k]!=j) {
update(dp[i+1][g[j][k]],dp[i][j]);
}
}
for (int i=0;i<=mx;i++) {
update(ans,(ll)dp[i][tot]*C(n,i)%mod);
}
printf("%d\n",ans);
return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/ | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
template<class T>
vector<pair<T, T>> PrimeFactorization(T n) {
vector<pair<T, T>> f;
for (T i = 2; i * i <= n; i++) {
T cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
if (cnt > 0) f.push_back(make_pair(i, cnt));
}
if (n != 1) f.push_back(make_pair(n, 1));
return f;
}
class Combination {
public:
Combination(int n) {
fac = new ll[n];
inv = new ll[n];
finv = new ll[n];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
REP(i, 2, n) {
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 cnr(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
private:
ll *fac, *inv, *finv;
};
int main() {
int N, M; cin >> N >> M;
auto factors = PrimeFactorization(M);
int maximum = 0;
for (auto f : factors) maximum = max(maximum, f.second);
Combination comb(maximum + N);
ll ans = 1;
for (auto f : factors) {
if (f.second == 0) continue;
ans = ans * comb.cnr(f.second + N - 1, N - 1) % MOD;
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forenska(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sqr(x) ((x)*(x))
#define lowbit(x) ((x)&(-x))
#define GREATER(x) x,vector<x>,greater<x>
#define randIn(L,R) (((LL)rand()*rand())%(R-L)+L)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pLL;
typedef vector<int> vec;
typedef vector<LL> vecL;
typedef vector<pii> vecP;
typedef vector<pLL> vecPL;
typedef vector<string> vecS;
typedef vector<vec> mat;
typedef complex<double> point;
const long double PI=3.14159265358979323846264338327950;
const LL INFLL=0x3f3f3f3f3f3f3f3f;
const int INF=0x3f3f3f3f;
const long double EPS=1e-10;
LL read()
{
LL x=0;
char ch=' ';
bool flag=false;
while(ch<'0' || ch>'9')
{
if(ch=='-')flag=true;
ch=getchar();
}
while(ch>='0' && ch<='9')
{
x=(x<<3)+(x<<1)+ch-'0';
ch=getchar();
}
return flag?-x:x;
}
int lcm(int a,int b)
{
return a/__gcd(a,b)*b;
}
int main()
{
LL k=read(),L=k/50,M=k%50;
cout<<50<<endl;
For(i,1,50)cout<<49-M+(i<=M)*51+L<<" ";
return 0;
}
| #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<string>
using namespace std;
string str;
int main(void){
cin >> str;
int jc=0,oc=0,ic=0,res=0;
for(int i=0;i<str.size();i++){
if(str[i]=='J'){
if(oc>0 || ic>0)jc=0;
oc=0,ic=0;
jc++;
}
if(str[i]=='O'){
oc++;
if(ic>0)jc=0;
ic=0;
}
if(str[i]=='I'){
ic++;
if(min(jc,ic)>=oc)res=max(res,min(jc,min(oc,ic)));
}
}
printf("%d\n",res);
return 0;
} | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, p, P;
while(true){
cin >> n >> p;
if(n == 0) break;
int idx = 0;
P = p;
VI has(n, 0);
while(true){
if(p > 0){
--p;
has[idx]++;
}else
if(has[idx] > 0){
p = has[idx];
has[idx] = 0;
}
if(has[idx] == P) break;
idx = (idx+1) % n;
}
cout << idx << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
int main(){
ll A,B;
cin>>A>>B;
if(A==1 && B==1){cout<<1000000<<endl;}
else{cout<<max((ll)0,100000*(4-A))+max((ll)0,100000*(4-B))<<endl;}
} | 0 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#define int long long
using namespace std;
signed main() {
string S;
cin>>S;
if(S.size()==2){
cout<<S<<endl;
}
else{
cout<<S[2]<<S[1]<<S[0]<<endl;
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<list>
#include<queue>
#include<string.h>
#include<functional>
#include<stack>
#include<deque>
#include<string>
#include<limits.h>
#include<map>
#include<set>
#include<unordered_map>
#include<cmath>
#include<unordered_set>
#define int long long
using namespace std;
int ans;
int n;
vector<int>V;
int S = 1;
void DFS(int sum, int a) {//今a番目まで見て合計がsum
if (a == V.size()) {
if (sum == n) {
ans += S;
}
return;
}
int b = 0;
for (int c = a + 1; c < V.size(); c++) {
b += V[c];
}
b *= 9;
for (int i = -9; i <= 9; i++) {
int d = sum + V[a] * i;
if (abs(d - n) <= b) {
int e = abs(i);
e = 10 - e;
if (i >= 0 && a == 0) {
e--;
}
if (e == 0)return;
S *= e;
DFS(d, a + 1);
S /= e;
}
}
}
signed main() {
cin >> n;
for (int i = 2; i <= 18; i++) {
V.clear();
int a = 1, b = pow(10, (i - 1));
for (int j = 0; j < i / 2; j++) {
V.push_back(b - a);
a *= 10; b /= 10;
}
if (i & 1) {
S *= 10;
}
DFS(0, 0);
if (i & 1) {
S /= 10;
}
}
cout << ans << endl;
} | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
class Dice {
int num[6];
public:
void set(int n, int s) {
num[s] = n;
}
void move(char c) {
if (c == 'E') {
swap(num[0], num[3]);
swap(num[3], num[5]);
swap(num[5], num[2]);
}
else if (c == 'N') {
swap(num[0], num[1]);
swap(num[1], num[5]);
swap(num[5], num[4]);
}
else if (c == 'S') {
swap(num[0], num[4]);
swap(num[4], num[5]);
swap(num[5], num[1]);
}
else if (c == 'W') {
swap(num[0], num[2]);
swap(num[2], num[5]);
swap(num[5], num[3]);
}
}
int up() {
return num[0];
}
};
int main() {
Dice d;
int n;
for (int i = 0; i < 6; i++) {
scanf("%d", &n);
d.set(n, i);
}
getchar();
char c;
while (scanf("%c", &c), c != '\n') {
d.move(c);
}
printf("%d\n", d.up());
} | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int a, b, c;
while (cin >> a >> b >> c) {
if ((a|b|c) == 0)
break;
int N;
cin >> N;
vector<int> aa(N), bb(N), cc(N), r(N);
for (int i = 0; i < N; ++i) {
cin >> aa[i] >> bb[i] >> cc[i] >> r[i];
--aa[i];
--bb[i];
--cc[i];
}
vector<int> ans(a+b+c, 2);
for (int i = 0; i < N; ++i) {
if (r[i] == 1)
ans[aa[i]] = ans[bb[i]] = ans[cc[i]] = 1;
}
for (int i = 0; i < N; ++i) {
if (r[i] == 0) {
if (ans[aa[i]] == 1 && ans[bb[i]] == 1)
ans[cc[i]] = 0;
else if (ans[aa[i]] == 1 && ans[cc[i]] == 1)
ans[bb[i]] = 0;
else if (ans[bb[i]] == 1 && ans[cc[i]] == 1)
ans[aa[i]] = 0;
}
}
for (int i = 0; i < a+b+c; ++i)
cout << ans[i] << endl;
}
return 0;
} | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
//const ll mod = 998244353;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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 (a>b) { a=b; return 1; } return 0; }
ll f[1000000], finv[1000000];
ll modpow(ll a,ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a) {
return modpow(a, mod - 2);
}
void init() {
f[0] = 1, finv[0] = 1;
FOR(i, 1, 1000000) {
f[i] = f[i - 1] * i % mod;
finv[i] = modinv(f[i]);
}
}
ll comb(ll n, ll r) {
if (r < 0 || r > n) return 0;
return f[n] * finv[r] % mod * finv[n - r] % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
ll n, m;
cin >> n >> m;
vector<ll> a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
init();
sort(a.begin(), a.end());
sort(b.begin(), b.end());
rep(i, n - 1) {
if (a[i] == a[i + 1]) {
cout << 0 << '\n';
return 0;
}
}
rep(i, m - 1) {
if (b[i] == b[i + 1]) {
cout << 0 << '\n';
return 0;
}
}
ll ans = 1, idxa = 0, idxb = 0, cnt = 0;
while (idxa < n && idxb < m && ans > 0) {
if (a[idxa] < b[idxb]) {
ans = ans * comb(a[idxa] - 1 - cnt, m - idxb - 1) % mod * f[m - idxb] % mod;
cnt += m - idxb;
idxa++;
}
else if (a[idxa] > b[idxb]) {
ans = ans * comb(b[idxb] - 1 - cnt, n - idxa - 1) % mod * f[n - idxa] % mod;
cnt += n - idxa;
idxb++;
}
else {
ans = ans * comb(a[idxa] - 1 - cnt, n - idxa - 1 + m - idxb - 1) % mod * f[m - idxb - 1 + n - idxa - 1] % mod;
cnt += n - idxa + m - idxb - 1;
idxa++, idxb++;
}
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
int main(void){
int n, m; bool ok = true;
scanf("%d %d", &n, &m);
vi as(n), bs(m), cs(n * m, 0); vector<bool> seen(n * m, false);
rep(i, n) {scanf("%d", &as[i]); as[i]--; if (seen[as[i]]) ok = false; seen[as[i]] = true;}
fill(all(seen), false);
rep(i, m) {scanf("%d", &bs[i]); bs[i]--; if (seen[bs[i]]) ok = false; seen[bs[i]] = true;}
if (!ok){printf("%d\n", 0); return 0;}
sort(all(as)); sort(all(bs));
ll ans = 1;
rep(i, n) rep(j, m) if (as[i] == bs[j]) cs[as[i]] = 1;
for (int a: as) if (!cs[a]) cs[a] = m - (lower_bound(all(bs), a) - bs.begin());
for (int b: bs) if (!cs[b]) cs[b] = n - (lower_bound(all(as), b) - as.begin());
for (int x = n * m - 1; x >= 0; x--){
if (!cs[x]){
cs[x] = m - (lower_bound(all(bs), x) - bs.begin());
cs[x] *= n - (lower_bound(all(as), x) - as.begin());
cs[x] -= n * m - x - 1;
}
(ans *= cs[x]) %= M;
}
printf("%lld\n", ans);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main(){
int A;
int B;
cin>>A>>B;
int holes=1;
int ans=0;
while(holes<B){
holes--;
holes+=A;
ans++;
}
cout<<ans;
} | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int perform(Int x){
return (x*(x+1))/2LL;
}
int main()
{
cin>>N>>M;
--M;--N;
cout<<ceilS(M,N)<<"\n";
}
| 1 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) (x)&(-x)
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define per(i,a,b) for (int i=a;i>=b;i--)
#define maxd 998244353
typedef long long ll;
const int N=100000;
const double pi=acos(-1.0);
int n,a[400];
ll dp[310][90050][2];
int read()
{
int x=0,f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
int main()
{
n=read();ll sum=0;
rep(i,1,n) {a[i]=read();sum+=a[i];}
dp[0][0][0]=1;dp[0][0][1]=1;
rep(i,1,n)
{
rep(j,0,sum)
{
dp[i][j][0]=dp[i-1][j][0];
dp[i][j][1]=(dp[i-1][j][1]*2)%maxd;
if (j>=a[i])
{
dp[i][j][0]=(dp[i][j][0]+dp[i-1][j-a[i]][0])%maxd;
dp[i][j][1]=(dp[i][j][1]+dp[i-1][j-a[i]][1])%maxd;
}
}
}
ll ans=1;
rep(i,1,n) ans=(ans*3)%maxd;
rep(i,(sum+1)/2,sum)
{
ans=(ans-dp[n][i][1]*3)%maxd;
if (i*2==sum)
{
ans=(ans+dp[n][i][0]*3)%maxd;
}
}
ans=(ans%maxd+maxd)%maxd;
printf("%lld",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
x = y;
return true;
}
return false;
}
// doc: https://shibh308.github.io/library/library/lib/classes/modint.cpp.html
template <i64 mod = MOD>
struct ModInt{
i64 p;
ModInt() : p(0){}
ModInt(i64 x){p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod;}
ModInt& operator+=(const ModInt& y){p = p + *y - ((p + *y) >= mod ? mod : 0); return *this;}
ModInt& operator-=(const ModInt& y){p = p - *y + (p - *y < 0 ? mod : 0); return *this;}
ModInt& operator*=(const ModInt& y){p = (p * *y) % mod; return *this;}
ModInt& operator%=(const ModInt& y){if(y)p %= *y; return *this;}
ModInt operator+(const ModInt& y) const{ModInt x = *this; return x += y;}
ModInt operator-(const ModInt& y) const{ModInt x = *this; return x -= y;}
ModInt operator*(const ModInt& y) const{ModInt x = *this; return x *= y;}
ModInt operator%(const ModInt& y) const{ModInt x = *this; return x %= y;}
friend ostream& operator<<(ostream& stream, const ModInt<mod>& x){
stream << *x;
return stream;
}
friend ostream& operator>>(ostream& stream, const ModInt<mod>& x){
stream >> *x;
return stream;
}
ModInt& operator++(){p = (p + 1) % mod; return *this;}
ModInt& operator--(){p = (p - 1 + mod) % mod; return *this;}
bool operator==(const ModInt& y) const{return p == *y;}
bool operator!=(const ModInt& y) const{return p != *y;}
const i64& operator*() const{return p;}
i64& operator*(){return p;}
};
using mint = ModInt<>;
signed main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
mint ans = 1;
vector<int> v(3, 0);
for(int i = 0; i < n; ++i){
int cnt = 0;
int ex = 0;
for(int j = 0; j < 3; ++j)
if(v[j] == a[i]){
++cnt;
ex = j;
}
++v[ex];
ans *= cnt;
}
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int e;
while(cin >> e, e){
int ans = 1 << 30;
for(int z = 0; z * z * z <= e; z++){
int y = floor(sqrt(e - z*z*z));
ans = min(ans, e - y*y - z*z*z + y + z);
}
cout << ans << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#define INF 10000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P > PP;
static const double eps = 1e-8;
int getAvr(int* p,int n){
int sum = 0;
for(int i=0;i<n;i++){
sum += p[i];
}
return sum/3;
}
int main(){
int n;
while(~scanf("%d",&n)){
if(n==0) break;
for(int i=0;i<n;i++){
int p[3];
//math,english,japanese
scanf("%d %d %d",p,p+1,p+2);
for(int i=0;i<3;i++){
if(p[i]==100){
printf("A\n");
goto next;
}
}
if(p[0] + p[1] >= 180 || getAvr(p,3) >= 80){
printf("A\n");
}
else if(getAvr(p,3) >= 70
|| (getAvr(p,3) >= 50 && (p[0] >= 80 || p[1] >= 80))){
printf("B\n");
}
else{
printf("C\n");
}
next:;
}
}
} | 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>;
const int MAX = 100000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
//setprecision(15)
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define MAX_N 15
int A[MAX_N+1][MAX_N+1];
int main() {
memset(A, -1, sizeof(A));
int N; cin >> N;
for (int i = 1; i <= N; i++) {
int cnt; cin >> cnt;
rep(j, cnt) {
int tmp; cin >> tmp;
cin >> A[i][tmp];
}
}
int p = mod_pow(2, N, MOD);
int ans = 0;
for (int i = 1; i < p; i++) {
int NG_flg = 0;
for (int j = 0; (1 << j) < p; j++ ) {
if (NG_flg == 1) break;
if (!(i & (1 << j))) continue;
for (int k = 1; k <= N; k++ ) {
if (A[j+1][k] == -1) continue;
if ( (A[j+1][k] == 1 && (i & (1 << (k-1))) == 0) ||
(A[j+1][k] == 0 && (i & (1 << (k-1))) > 0) ) {
NG_flg = 1; break;
}
}
}
if (NG_flg == 0) {
int cnt = 0;
rep(j, 16) {
if (i & (1 << j)) cnt++;
}
ans = max(ans, cnt);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ll;
int main()
{
int n;
cin>>n;
vector<int> a(n);
vector<int> b(n,0);
int ans = 1000000000;
for(int i = 0; i < n; i ++){
int num;
cin>>num;
int localAns = 0;
while( num % 2 == 0){
num /= 2;
localAns++;
}
ans = min(localAns,ans);
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <memory>
#include <cmath>
constexpr int max_size()
{
return static_cast<int>(1e+6);
}
int insert(int* a, const int i, const int gear)
{
if (i < gear) {
return 0;
}
if (a[i - gear] <= a[i]) {
return 0;
}
std::swap(a[i - gear], a[i]);
return 1 + insert(a, i - gear, gear);
}
int insertion_sort(int* arr, const int n, const int gear)
{
int insert_count = 0;
for (int i = 0; i < n; i += gear) {
insert_count += insert(arr, i, gear);
}
return insert_count;
}
int pow(const int a, const int x) {
return x == 0 ? 1 : a * pow(a, x - 1);
}
void print(int* arr, const int n, const int i, char const delim) {
if (i == n - 1) {
std::cout << arr[i];
return;
}
std::cout << arr[i] << delim;
print(arr, n, i + 1, delim);
}
void print(int* arr, const int n, char const delim) {
int i = 0;
for (; i < n - 1; ++i) {
std::cout << arr[i] << delim;
}
std::cout << arr[i];
}
void shell_sort(int* arr, const int n) {
static const double log3 = std::log(3);
const int gear_index = static_cast<int>(std::log(2 * n + 1) / log3 - 1);
int gear = (pow(3, gear_index + 1) - 1) >> 1;
int gear_cache[100];
int cache_idx = 0;
int insert_count = 0;
for (; gear > 0; gear = (gear - 1) / 3) {
gear_cache[cache_idx] = gear;
for (int i = 0; i < gear; ++i) {
insert_count += insertion_sort(arr + i, n - i, gear);
}
++cache_idx;
}
std::cout << cache_idx << std::endl;
print(gear_cache, cache_idx, ' ');
std::cout << std::endl;
std::cout << insert_count << std::endl;
return;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n;
constexpr int N = max_size();
const auto r = std::make_unique<int[]>(N);
for (int i = 0; i < n; ++i) {
std::cin >> r[i];
}
shell_sort(r.get(), n);
print(r.get(), n, '\n');
std::cout << std::endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); i++ )
#define REP( i, n ) FOR( i, 0, n )
#define ALL( x ) (x).begin(), (x).end()
void shellSort( vector<int>& a );
void insertSort( vector<int>& a, int h );
void printArray( vector<int>& a );
int main() {
int n; cin >> n;
vector<int> a( n );
REP( i, n ) cin >> a[i];
shellSort( a );
printArray( a );
}
void shellSort( vector<int>& a ) {
int h = 1, h_tmp, h_cnt = 0;
for( h_tmp = 1; h_tmp < a.size(); h_tmp = h_tmp * 3 + 1 ) {
h = h_tmp;
h_cnt++;
}
cout << ( a.size() == 1 ? h_cnt + 1 : h_cnt ) << endl;
while( h > 0 ) {
if( h / 3 != 0 ) cout << h << " ";
else cout << h << endl;
insertSort( a, h );
h /= 3;
}
}
void insertSort( vector<int>& a, int h ) {
static int cnt = 0;
int tmp, j;
FOR( i, h, a.size() ) {
tmp = a[i];
for( j = i; j >= h && a[j - h] > tmp; j -= h ) {
cnt++;
a[j] = a[j - h];
}
a[j] = tmp;
}
if( h == 1 ) cout << cnt << endl;
}
void printArray( vector<int>& a ) {
REP( i, a.size() ) cout << a[i] << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N,A,B;
int i;
long long sum = 0;
scanf("%lld %lld %lld", &N, &A, &B);
long long X[N];
for(i=0;i<N;i++){
scanf("%lld",&X[i]);
}
for(i=1;i<N;i++){
long long dis = X[i] - X[i-1];
if(B > dis * A){
sum += dis * A;
}
else{
sum += B;
}
}
printf("%lld\n", sum);
}
| #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<ll> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
//ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
//const ll mod = 1e10;
//typedef priority_queue<P, vector<P>, greater<P> > PQ_ASK;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n, vector<int>(m));
rep(i, n) rep(j, m) cin >> v[i][j], v[i][j]--;
// rep(i, n) reverse(v[i].begin(), v[i].end());
vector<bool> exclude(m, false);
int ans = INT_MAX;
while (count(exclude.begin(), exclude.end(), false) > 0) {
vector<int> join(m);
rep(i, n) {
rep(j, m) {
int t = v[i][j];
if (!exclude[t]) {
join[t]++;
break;
}
}
}
int now = *max_element(join.begin(), join.end());
// cout << now << endl;
cmin(ans, now);
rep(i, m) {
if (join[i] == now) {
exclude[i] = true;
}
}
}
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int n;
int D1,D2;
int get(int x,int y){return x*(n*2)+y;}
struct data{
int to,nxt;
};
struct Graph{
data mp[20000200];
int head[500500],cnt;
void link(int x,int y)
{
mp[++cnt].to=y;
mp[cnt].nxt=head[x];
head[x]=cnt;
}
int fl[2020][2],tf;
int c[500500];
void dfs(int x,int d)
{
c[x]=d;
for(int i=head[x];i;i=mp[i].nxt)
if(c[mp[i].to]==-1)
dfs(mp[i].to,d^1);
}
void build(int D)
{
for(int i=0,j;i*i<=D;++i)
{
j=sqrt(D-i*i);
if(i*i+j*j!=D)continue;
fl[++tf][0]=i;fl[tf][1]=j;
fl[++tf][0]=i;fl[tf][1]=-j;
fl[++tf][0]=-i;fl[tf][1]=j;
fl[++tf][0]=-i;fl[tf][1]=-j;
}
int u,x,y;
for(int i=0;i<n*2;++i)
for(int j=0;j<n*2;++j)
{
u=get(i,j);
for(int p=1;p<=tf;++p)
{
x=i+fl[p][0];y=j+fl[p][1];
if(x<0||x>=n*2||y<0||y>=n*2)continue;
link(u,get(x,y));
}
}
memset(c,-1,sizeof(c));
for(int i=0;i<n*2;++i)
for(int j=0;j<n*2;++j)
if(c[get(i,j)]==-1)dfs(get(i,j),0);
}
}g1,g2;
int cnt[2][2];
int main()
{
scanf("%d%d%d",&n,&D1,&D2);
g1.build(D1);
g2.build(D2);
int x;
for(int i=0;i<n*2;++i)
for(int j=0;j<n*2;++j)
{
x=get(i,j);
cnt[g1.c[x]][g2.c[x]]++;
}
int ou=1;
for(int i=0;i<2&&ou<=n*n;++i)
for(int j=0;j<2&&ou<=n*n;++j)
{
if(cnt[i][j]<n*n)continue;
for(int p=0;p<n*2&&ou<=n*n;++p)
for(int q=0;q<n*2&&ou<=n*n;++q)
{
x=get(p,q);
if(g1.c[x]==i&&g2.c[x]==j)
{
ou++;
printf("%d %d\n",p,q);
}
}
}
return 0;
}
| #include<bits/stdc++.h>
int n,d1,d2,color[606][606],N;
void paint(int d){
int b=0;
while(!(d&3))d>>=2,++b;
if(d&1){
for(int i=0;i<N;++i)
for(int j=0;j<N;++j)
if(((i>>b)+(j>>b))&1)color[i][j]=1;
}else{
for(int i=0;i<N;++i)
for(int j=0;j<N;++j)
if((i>>b)&1)color[i][j]=1;
}
}
int main(){
scanf("%d%d%d",&n,&d1,&d2);
N=n<<1;
paint(d1),paint(d2);
int NN=n*n;
for(int i=0;i<N;++i)
for(int j=0;j<N;++j)
if(!color[i][j]){
printf("%d %d\n",i,j);
if(!--NN)return 0;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
struct node
{
int num,fa,ls,rs;
node(int _num,int _fa)
{
num=_num;
fa=_fa;
ls=rs=-1;
}
};
typedef vector<node> Tree;
Tree T;
void insert(int t,int n)
{
if(T[0].num==INT_MAX)
T[0].num=n;
else if(T[t].num>n)
if(T[t].ls==-1)
{
T[t].ls=T.size();
T.push_back(node(n,t));
}
else insert(T[t].ls,n);
else
if(T[t].rs==-1)
{
T[t].rs=T.size();
T.push_back(node(n,t));
}
else insert(T[t].rs,n);
}
void find(int t,int x)
{
if(T.size()==0||t==-1)
printf("no\n");
else if(T[t].num==x)
printf("yes\n");
else if(x<T[t].num)
find(T[t].ls,x);
else find(T[t].rs,x);
}
void lc(int fa,int son)
{
T[fa].ls=son;
if(son!=-1) T[son].fa=fa;
}
void rc(int fa,int son)
{
T[fa].rs=son;
if(son!=-1) T[son].fa=fa;
}
void del(int t,int x)
{
if(t==-1) return ;
if(T[t].num==x)
{
if(T[t].ls==-1)
if(T[t].rs==-1)
if(T[T[t].fa].ls==t)
T[T[t].fa].ls=-1;
else T[T[t].fa].rs=-1;
else
if(T[T[t].fa].ls==t)
{
T[T[t].fa].ls=T[t].rs;
T[T[t].rs].fa=T[t].fa;
}
else
{
T[T[t].fa].rs=T[t].rs;
T[T[t].rs].fa=T[t].fa;
}
else if(T[t].rs==-1)
if(T[T[t].fa].ls==t)
{
T[T[t].fa].ls=T[t].ls;
T[T[t].ls].fa=T[t].fa;
}
else
{
T[T[t].fa].rs=T[t].ls;
T[T[t].ls].fa=T[t].fa;
}
else
{
int mir=T[t].rs;
while(T[mir].ls!=-1) mir=T[mir].ls;
del(t,T[mir].num);
T[t].num=T[mir].num;
}
}
else if(x<T[t].num)
del(T[t].ls,x);
else del(T[t].rs,x);
}
void Preorder(int t)
{
if(t==-1) return;
printf(" %d",T[t].num);
Preorder(T[t].ls);
Preorder(T[t].rs);
}
void Inorder(int t)
{
if(t==-1) return;
Inorder(T[t].ls);
printf(" %d",T[t].num);
Inorder(T[t].rs);
}
void print()
{
Inorder(T[1].ls);
printf("\n");
Preorder(T[1].ls);
printf("\n");
}
int main()
{
T.clear();
T.push_back(node(INT_MAX,1));
T.push_back(node(-1,-1));
T[1].ls=0;
int n;
scanf("%d",&n);
while(n--)
{
char s[10];
scanf("%s",s);
if(s[0]=='i')
{
int t;
scanf("%d",&t);
insert(T[1].ls,t);
}
else if(s[0]=='f')
{
int t;
scanf("%d",&t);
find(T[1].ls,t);
}
else if(s[0]=='d')
{
int t;
scanf("%d",&t);
del(T[1].ls,t);
}
else print();
}
return 0;
} | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
const char dir[4] = { 'u','l','d','r' };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)
class node {
public:
int key;
node *parent, *lch, *rch;
};
node *NIL, *root;
void insert(int v) {
node *y = NIL, *x = root, *z = new node;
z->key = v; z->lch = z->rch = NIL;
while (x != NIL) {
y = x;
if (z->key < x->key)x = x->lch;
else x = x->rch;
}
z->parent = y;
if (y == NIL)root = z;
else if (z->key < y->key)y->lch = z;
else y->rch = z;
return;
}
node* find(int k) {
node *x = root;
while (x != NIL&&k != x->key) {
if (k < x->key)x = x->lch;
else x = x->rch;
}
return x;
}
node* next(node *z) {
node *x, *y;
if (z->rch != NIL) {
x = z->rch;
while (x->lch != NIL)x = x->lch;
return x;
}
y = z->parent;
while (y != NIL&&x == y->rch) {
x = y;
y = y->parent;
}
return y;
}
void remove(node *z) {
node *y, *x;
if (z->lch == NIL || z->rch == NIL)y = z;
else y = next(z);
if (y->lch != NIL)x = y->lch;
else x = y->rch;
if (x != NIL)x->parent = y->parent;
if (y->parent == NIL)root = x;
else if (y == y->parent->lch)y->parent->lch = x;
else y->parent->rch = x;
if (y != z)z->key = y->key;
delete(y);
return;
}
void ino(node *u) {
if (u == NIL)return;
ino(u->lch);
cout << " " << u->key;
ino(u->rch);
return;
}
void preo(node *u) {
if (u == NIL)return;
cout << " " << u->key;
preo(u->lch);
preo(u->rch);
return;
}
void print() {
ino(root);
cout << endl;
preo(root);
cout << endl;
return;
}
int main() {
int n; cin >> n;
string s; node *a;
while (cin >> s) {
if (s == "insert") {
cin >> n;
insert(n);
}
else if (s == "find") {
cin >> n;
a = find(n);
if (a != NIL)cout << "yes" << endl;
else cout << "no" << endl;
}
else if (s == "delete") {
cin >> n;
remove(find(n));
}
else if (s == "print")print();
}
return 0;
}
| 1 |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(s) ((int) ((s).size()))
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long long ll;
typedef long double ld;
const int inf = (int) 1e9 + 100;
const ld eps = 1e-11;
const ld pi = acos(-1.0L);
mt19937 mrand(random_device{} ());
int rnd(int x) {
return mrand() % x;
}
void precalc() {
}
const int maxn = 1e6 + 100;
int n;
char s[maxn], t[maxn];
bool read() {
if (scanf("%d", &n) < 1) {
return false;
}
scanf("%s", s);
scanf("%s", t);
return true;
}
vector<int> pos[300];
void solve() {
{
bool ok = true;
for (int i = 0; i < n; i++) {
if (s[i] != t[i]) {
ok = false;
}
}
if (ok) {
printf("0\n");
return;
}
}
for (int i = 0; i < 300; i++) {
pos[i].clear();
}
for (int i = 0; i < n; i++) {
pos[s[i]].pb(i);
}
vector<int> xs;
vector<int> want;
for (int i = n - 1; i >= 0; i--) {
if (i == 0 || t[i] != t[i - 1]) {
int mx = sz(xs) ? xs.back() : inf;
mx = min(mx, i);
int j = (int) (upper_bound(pos[t[i]].begin(), pos[t[i]].end(), mx) - pos[t[i]].begin());
j--;
if (j == -1) {
printf("-1\n");
return;
}
xs.pb(pos[t[i]][j]);
want.pb(i);
}
}
reverse(xs.begin(), xs.end());
reverse(want.begin(), want.end());
vector<int> magic;
for (int i = 0; i < sz(xs); i++) {
magic.pb(xs[i] - i);
}
magic.pb(want.back() - sz(xs) + 1);
int ans = 1;
for (int i = 0; i < sz(xs); i++) {
int j = (int) (lower_bound(magic.begin(), magic.end(), want[i] - i) - magic.begin());
ans = max(ans, 1 + j - i);
}
printf("%d\n", ans);
}
int main() {
precalc();
#ifdef DEBUG
assert(freopen("text.in", "r", stdin));
assert(freopen("text.out", "w", stdout));
#endif
while (true) {
if (!read()) {
break;
}
solve();
#ifdef DEBUG
eprintf("Time: %.18f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
char s[N],t[N];
int n,ans,l=1,r,last,q[N];
int main(){
scanf("%d%s%s",&n,s+1,t+1),last=n;
for(int i=n;i;){
while(last&&(i<last||s[last]!=t[i])) --last;
if(!last) {puts("-1");return 0;}
while(l<=r&&q[l]-r+l-1>=i) ++l;
q[++r]=last;
if(i!=last) ans=max(ans,r-l+1);
while(t[i]==s[last]&&i>=last) --i;
}
printf("%d\n",ans);
return 0;
}
| 1 |
#include<iostream>
#include<string>
int main() {
std::string s;
std::cin >> s;
if (s == "RRR") std::cout << 3 << std::endl;
if (s == "RRS") std::cout << 2 << std::endl;
if (s == "RSR") std::cout << 1 << std::endl;
if (s == "SRR") std::cout << 2 << std::endl;
if (s == "RSS") std::cout << 1 << std::endl;
if (s == "SRS") std::cout << 1 << std::endl;
if (s == "SSR") std::cout << 1 << std::endl;
if (s == "SSS") std::cout << 0 << std::endl;
return 0;
} | /*
LINES :
* rainy days
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// #define OJ
#define pb push_back
#define F first
#define S second
#define WLL(t) while(t--)
#define FOR(i,a,b) for(int i = a; i < b; i++)
#define STF(i, a, b) for(size_t i = a; i < b; i++)
#define RFOR(i, a, b) for(int i = a; i >= b; i--)
#define SRF(i, a, b) for(size_t i = a;i >= b;i--)
#define ALL(v) v.begin(),v.end()
#define PRECISION(x) cout<<fixed<<setprecision(x)
#define FASTIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define MOD 1000000007
#define TO(v, type) static_cast<type>(v)
int main()
{
#ifdef OJ
READ;
WRITE;
#endif
FASTIO;
string s;
cin >> s;
int mx = 0;
int count{};
STF(i, 0, 3) {
if (s[i] == 'R') {
count++;
}
else {
count = 0;
}
mx = max(count, mx);
}
cout << mx << "\n";
return 0;
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.