code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include "bits/stdc++.h"
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()
#define chmin(a,b) a=min(a,b);
#define chmax(a,b) a=max(a,b);
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;
string S[2009];
int H,W,ans;
int hig[2009];
bool ck(int i,int j){
return (1^(S[i][j]==S[i][j-1])^(S[i-1][j]==S[i-1][j-1]));
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>H>>W;
rep(i,H) cin>>S[i];
ans=max(H,W);
FOR(i,1,H){
stack<pii> stc;
stc.push({0,0});
FOR(j,1,W){
if(ck(i,j)) hig[j]++;
else hig[j]=0;
int h=stc.top().first;
int w=stc.top().second;
int ww=0;
while(h>hig[j]){
ww+=w;
chmax(ans,(h+1)*(ww+1));
stc.pop();
h=stc.top().first;
w=stc.top().second;
}
if(h<hig[j]){
stc.push({hig[j],1+ww});
}else{
stc.top().second+=1+ww;
}
}
int ww=0;
while(!stc.empty()){
int h=stc.top().first;
int w=stc.top().second;
ww+=w;
chmax(ans,(h+1)*(ww+1));
stc.pop();
}
}
cout1(ans)
} | #include<bits/stdc++.h>
#define ll int
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace :: std;
const ll maxn=2010;
char jad[maxn][maxn];
ll ava[maxn];
ll l[maxn];
ll r[maxn];
ll finds(ll n){
stack<ll> stk;
for(ll i=0;i<n;i++){
while(!stk.empty() && ava[stk.top()]>=ava[i]){
stk.pop();
}
if(stk.empty()){
l[i]=-1;
}else{
l[i]=stk.top();
}
stk.push(i);
}
while(!stk.empty()){
stk.pop();
}
for(ll i=n-1;i>=0;i--){
while(!stk.empty() && ava[stk.top()]>=ava[i]){
stk.pop();
}
if(stk.empty()){
r[i]=n;
}else{
r[i]=stk.top();
}
stk.push(i);
}
ll ans=0;
for(ll i=0;i<n;i++){
ans=max(ans,(ava[i]+1)*(r[i]-l[i]));
}
return ans;
}
bool good(ll i,ll j){
int t=0;
if(jad[i][j]=='#'){
t^=1;
}
if(jad[i+1][j]=='#'){
t^=1;
}
if(jad[i][j+1]=='#'){
t^=1;
}
if(jad[i+1][j+1]=='#'){
t^=1;
}
if(t&1){
return 0;
}
return 1;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll w,h;
cin>>w>>h;
for(ll i=0;i<w;i++){
for(ll j=0;j<h;j++){
cin>>jad[i][j];
}
}
ll ans=w;
for(ll i=0;i<w-1;i++){
for(ll j=0;j<h-1;j++){
if(good(i,j)){
ava[j]++;
}else{
ava[j]=0;
}
}
ans=max(ans,finds(h-1));
}
cout<<ans;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
set<int> s;
s.insert(a);
s.insert(b);
s.insert(c);
if(s.size()==2){cout<<"Yes";}
else cout<<"No";
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <math.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
const int INF=1e9;
const ll MX = 1e18;
const int MOD=INF+7;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
int main() {
vi a(3);
map<int,int> mp;
rep(i,3) {
cin>>a[i];
mp[a[i]]++;
}
bool ja=true;
for(auto x:mp){
if(x.second==2)ja=false;
}
if(ja) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | 1 |
// writer: w33z8kqrqk8zzzx33
#include <bits/stdc++.h>
using namespace std;
// begin fast read template by CYJian (source: https://www.luogu.com.cn/paste/i11c3ppx)
namespace io {
const int __SIZE = (1 << 21) + 1;
char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, _eof;
#define Gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
inline void flush () { fwrite (obuf, 1, oS - obuf, stdout), oS = obuf; }
inline void gc (char &x) { x = Gc(); }
inline void pc (char x) { *oS ++ = x; if (oS == oT) flush (); }
inline void pstr (const char *s) { int __len = strlen(s); for (__f = 0; __f < __len; ++__f) pc (s[__f]); }
inline void gstr (char *s) { for(__c = Gc(); __c < 32 || __c > 126 || __c == ' ';) __c = Gc();
for(; __c > 31 && __c < 127 && __c != ' '; ++s, __c = Gc()) *s = __c; *s = 0; }
template <class I> inline bool gi (I &x) { _eof = 0;
for (__f = 1, __c = Gc(); (__c < '0' || __c > '9') && !_eof; __c = Gc()) { if (__c == '-') __f = -1; _eof |= __c == EOF; }
for (x = 0; __c <= '9' && __c >= '0' && !_eof; __c = Gc()) x = x * 10 + (__c & 15), _eof |= __c == EOF; x *= __f; return !_eof; }
template <class I> inline void print (I x) { if (!x) pc ('0'); if (x < 0) pc ('-'), x = -x;
while (x) qu[++ qr] = x % 10 + '0', x /= 10; while (qr) pc (qu[qr --]); }
struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
} using io::pc; using io::gc; using io::pstr; using io::gstr; using io::gi; using io::print;
// end fast read template by CYJian
#define iter(i, a, b) for(int i=(a); i<(b); i++)
#define rep(i, a) iter(i, 0, a)
#define rep1(i, a) iter(i, 1, (a)+1)
#define log(a) cerr<<"\033[32m[DEBUG] "<<#a<<'='<<(a)<<" @ line "<<__LINE__<<"\033[0m"<<endl
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using ll=long long;
using pii=pair<int, int>;
//#define int ll
const int MOD = 1000000007;
uint8_t can[30][200005];
int p2;
int a[200005], b[200005];
int n;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0);
gi(n);
p2 = 1; rep(i, n-1) p2 = 2*p2%MOD;
rep(i, n) gi(a[i]);
rep(i, n) gi(b[i]);
rep(l, 30) {
int bv = 0;
rep(i, n) bv = (bv*2+(bool)(b[i]&(1<<l)))%MOD;
rep(x, 2) {
int av = 0;
rep(i, n) av = (av*2+(x^(bool)(a[i]&(1<<l))))%MOD;
rep(k, n) {
if(av == bv) can[l][k]=(x+1);
av = (av+MOD-p2*(x^(bool)(a[k]&(1<<l))))%MOD;
av = (av*2+(x^(bool)(a[k]&(1<<l))))%MOD;
}
}
}
rep(k, n) {
int x = 0;
rep(l, 30) {
if(!can[l][k]) { x = -1; break; }
x |= ((can[l][k]-1)<<l);
}
if(x != -1) print(k), pc(' '), print(x), pc('\n');
}
}
| #include <string>
#include <vector>
using namespace std;
vector<int> border(vector<int> S)
{
int n = (int)S.size();
vector<int> B(n+1);
B[0] = -1;
int j = -1;
for (int i=1; i<=n; i++)
{
while (j>=0 && S[i-1]!=S[j])
j = B[j];
j++;
B[i] = j;
}
return B;
}
// B = border(P)
vector<int> search(vector<int> T, vector<int> P, vector<int> B)
{
int n = (int)T.size();
int m = (int)P.size();
vector<int> A;
int j = 0;
for (int i=0; i+m<=n;)
{
if (j<m && T[i+j]==P[j])
{
j++;
if (j==m)
A.push_back(i);
}
else
{
i += j-B[j];
if (j>0)
j = B[j];
}
}
return A;
}
#include <iostream>
int main()
{
int N;
cin>>N;
vector<int> a(N), b(N);
for (int &t: a)
cin>>t;
for (int &t: b)
cin>>t;
vector<int> ax(N), bx(N);
for (int i=0; i<N; i++)
{
ax[i] = a[i]^a[(i+1)%N];
bx[i] = b[i]^b[(i+1)%N];
}
for (int i=0; i<N-1; i++)
ax.push_back(ax[i]);
vector<int> K = search(ax, bx, border(bx));
for (int k: K)
cout<<k<<" "<<(a[k]^b[0])<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
string s;
cin >> s;
int n = s.size();
forn(i, 0, n) {
if (i+1 < n && s[i] == s[i+1]) {
cout << i+1 << " " << i+2 << endl;
return 0;
}
if (i+2 < n && s[i] == s[i+2]) {
cout << i+1 << " " << i+3 << endl;
return 0;
}
}
cout << "-1 -1\n";
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
char str[3];
int rain=1,sun=0;
cin>>str;
int len = strlen(str);
for(int i = 0;i<len;i++)
{
if(str[i]=='R' && str[i+1]=='R')
{
rain++;
}
if(str[i]=='S')
{
sun++;
}
}
if(rain>1)
{
cout<<rain<<endl;
}
else if(sun==len)
{
cout<<0<<endl;
}
else
{
cout<<rain<<endl;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
template<class T>
void debug(T head){
if(DEBUG){
cout<<head<<endl;
}
}
template <class Head, class... Body>
void debug(Head head, Body... body){
if(DEBUG){
cout<<head<<" ";
debug(body...);
}
}
/////
void answer(ll sx, ll sy, ll tx, ll ty){
for(int i=sy; i<ty; ++i){
cout<<"U";
}
for(int i=sx; i<tx; ++i){
cout<<"R";
}
for(int i=sy; i<ty; ++i){
cout<<"D";
}
for(int i=sx; i<tx; ++i){
cout<<"L";
}
cout<<"L";
for(int i=sy; i<ty+1; ++i){
cout<<"U";
}
for(int i=sx; i<tx+1; ++i){
cout<<"R";
}
cout<<"D";
cout<<"R";
for(int i=sy; i<ty+1; ++i){
cout<<"D";
}
for(int i=sx; i<tx+1; ++i){
cout<<"L";
}
cout<<"U";
cout<<endl;
return;
}
/////
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(0);
cout.precision(16);
ll sx, sy, tx, ty;
cin>>sx>>sy>>tx>>ty;
answer(sx, sy, tx, ty);
return 0;
}
| //#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;
}
| 0 |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int x[N];
LL w[N];
int S, n;
int main() {
scanf("%d%d", &n, &S);
For(i, 1, n) scanf("%d%lld", &x[i], &w[i]);
int l = 1, r = n, nxt = 0;
LL ans = 0;
while (x[l] < S && x[r] > S) {
if (w[l] >= w[r]) {
w[l] += w[r];
if (nxt != l) ans += x[r] - x[l];
--r, nxt = l;
} else {
w[r] += w[l];
if (nxt != r) ans += x[r] - x[l];
++l, nxt = r;
}
}
if (x[l] < S) ans += S - x[l];
else ans += x[r] - S;
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define PRF first
#define PRS second
#define INIT(ar,val) memset ( ar, val, sizeof ( ar ) )
#define lp(loop,start,end) for ( int loop = start; loop < end; ++loop )
#define lpd(loop,start,end) for ( int loop = start; loop > end; --loop )
#define lpi(loop,start,end) for ( int loop = start; loop <= end; ++loop )
#define lpdi(loop,start,end) for ( int loop = start; loop >= end; --loop )
#define qmax(a,b) (((a)>(b))?(a):(b))
#define qmin(a,b) (((a)<(b))?(a):(b))
#define qabs(a) (((a)>=0)?(a):(-(a)))
const int INF = 0x3fffffff;
const int SINF = 0x7fffffff;
const long long LINF = 0x3fffffffffffffff;
const long long SLINF = 0x7fffffffffffffff;
const int MAXN = 100007;
int n, S;
int p[MAXN];
int a[MAXN];
int ord[MAXN];
int m[2], sx[2][MAXN], sa[2][MAXN];
void init ();
void input ();
void work ();
int main()
{
init();
input();
work();
}
void init ()
{
// Init Everything Here
ios::sync_with_stdio ( false );
}
void input ()
{
// input method
scanf ( "%d%d", &n, &S );
lpi ( i, 1, n ) scanf ( "%d%d", &p[i], &a[i] );
}
void work ()
{
// main work
lpi ( i, 1, n ){
if ( p[i] < S ){
++m[0];
sx[0][m[0]] = i, sa[0][m[0]] = a[i];
}else break;
}
lpd ( i, n, 0 ){
if ( p[i] > S ){
++m[1];
sx[1][m[1]] = i, sa[1][m[1]] = a[i];
}
}
if ( !m[0] || !m[1] ){
cout << ( qmax ( S - p[1], 0 ) + qmax ( p[n] - S, 0 ) ) << endl;
return;
}
// lp ( t, 0, 2 ){
// cerr << t << " : " << endl;
// lpi ( i, 1, m[t] ) cerr << sx[t][i] << " " << sa[t][i] << endl;
// }
int ns = 0, np[2] = { 1, 1 }, ka = 0;
LL ca = sa[1][1];
while ( np[0] <= m[0] && np[1] <= m[1] ){
if ( sa[ns][np[ns]] > ca || ( sa[ns][np[ns]] == ca && ns == 0 ) ){
ord[++ka] = sx[ns^1][np[ns^1]++];
ca += sa[ns][np[ns]];
ns ^= 1;
}else{
ord[++ka] = sx[ns][np[ns]];
ca += sa[ns][np[ns]++];
}
}
ord[++ka] = sx[ns^1][np[ns^1]];
// lpi ( i, 1, ka ) cerr << ord[i] << " "; cerr << endl;
LL ans = 0;
int cp = S;
lpd ( i, ka, 0 ){
ans += qabs ( cp - p[ord[i]] );
cp = p[ord[i]];
}
cout << ans << endl;
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
#define task "tst"
using namespace std;
const ll N = 300 + 9;
const ll inf = 1e6 + 7;
typedef pair<ll,ll> LL;
ll t,n,a[N],i,j;
string s;
bool chk(){
vector<ll> v;
v.push_back(0);
for (i = n;i >= 1;i--){
ll p = a[i];
for (auto j : v) p = min(p,p^j);
if (p){
if (s[i] == '1') return true;
v.push_back(p);
}
}
return false;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
//freopen(task".out", "w", stdout);
}
cin>>t;
while(t--){
cin>>n;
for (i = 1;i <= n;i++) cin>>a[i];
cin>>s; s = " " + s;
cout<<chk()<<"\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
//constexpr long long MOD = 998244353LL;
using ld=long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, rev;
long double cap;
Edge(ll _to, long double _cap, ll _rev) {
to = _to; cap = _cap; rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph& G, ll from, ll to, long double cap, bool revFlag, long double revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve(){
ll n;
cin>>n;
vec<ll> a(n);
REP(i,n) cin>>a[i];
ll sum=0;
REP(i,n) sum^=a[i];
for(auto &i:a) i&=~sum;//偶数のbitだけかんがえる
vec<ll> base;
for(auto &i:a){
for(auto b:base){
chmin(i,i^b);
}
if(i) base.push_back(i);
}
sort(all(base),greater<ll>());
ll A=0;
for(auto b:base) chmax(A, A^b);//奇数のみの集合を作る
ll B=sum^A;
cout<<A+B<<en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
//ll t;cin>>t;REP(i,t) solve();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF=1e18;
struct Node
{
long long h,p,su;
};
Node N[5005];
bool cmp(Node a,Node b)
{
if(a.su==b.su)
{
return a.h<b.h;
}
return a.su<b.su;
}
long long dp[5005];
int ans;
int main() {
int n;
scanf("%d", &n);
for(int i=0;i<n;i++)
{
scanf("%lld %lld",&N[i].h,&N[i].p);
N[i].su=N[i].h+N[i].p;
}
sort(N,N+n,cmp);
for(int i=1;i<=n;i++)
{
dp[i]=INF;
}
for(int i=0;i<n;i++)
{
for(int j=i;j>=0;j--)
{
if(dp[j]!=INF&&dp[j]<=N[i].h)
{
dp[j+1]=min(dp[j+1],dp[j]+N[i].p);
}
}
}
ans=0;
for(int i=0;i<=n;i++)
{
if(dp[i]!=INF)
{
ans=max(ans,i);
}
else
{
break;
}
}
printf("%d\n",ans);
return 0;
} | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
#include <cctype>
#include <cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll> ;
using vs = vector<string>;
using vb = vector<bool>;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define PI 3.1415926535
#define rep(i, k, n) for(ll i = k; i < n; i++)
vector<vector<char>> maze; //迷路を表す文字列
vvll cnt; //何回目の操作後に黒になったか
ll INF = 10000000000;
ll r, c;
ll dy[4] = {0, 1, 0, -1};
ll dx[4] = {1, 0, -1, 0};
void bfs(){
queue<pll> que;
//黒の位置をキューに入れる
rep(i, 0, r){
rep(j, 0, c){
if(maze[i][j] == '#'){que.push(pll(i, j)); cnt[i][j] = 0;}
}
}
//キューが空になるまでループ
while(que.size()){
//キューの先頭を取り出す
pll p = que.front();
que.pop();
//移動四方向ループ
rep(i, 0, 4){
//移動後の点(nx,ny)
ll ny = p.first + dy[i];
ll nx = p.second + dx[i];
//移動可能か、すでに訪れているか判定
if(ny >= 0 && ny < r && nx >= 0 && nx < c && cnt[ny][nx] == INF && maze[ny][nx] != '#'){
//移動できるならキューに入れ、その点をpの距離＋１にする
que.push(pll(ny, nx));
cnt[ny][nx] = cnt[p.first][p.second] + 1;
}
}
}
return;
}
int main(){
cin >> r >> c;
maze = vector<vector<char>> (r,vector<char>(c));
cnt = vvll (r,vll(c,INF));
ll ans = 0;
rep(i, 0, r){
rep(j, 0, c){
cin >> maze[i][j];
}
}
bfs();
rep(i, 0, r){
rep(j, 0, c){
if(cnt[i][j] > ans){ans = cnt[i][j];}
}
}
cout << ans << endl;
}
| 0 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define cerr if(false) cerr
#define show(...) cerr << #__VA_ARGS__ << " = ",debug(__VA_ARGS__);
using namespace std;
using ll = long long;
using pii = pair<int,int>;
template<typename T, typename S>
ostream &operator<<(ostream &os,pair<T,S>a){
os << '(' << a.first << ',' << a.second << ')';
return os;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> v){
for(auto x:v)os << x << ' ';
return os;
}
void debug(){cerr << '\n';}
template<typename H, typename... T>
void debug(H a, T... b){
cerr << a;
if(sizeof...(b))cerr << ", ";
debug(b...);
}
vector<int> inv(const vector<int> &perm){
vector<int> res(perm.size());
rep(i,perm.size()){
res[perm[i]] = i;
}
return res;
}
vector<int> product(const vector<int> &a, const vector<int> &b){
vector<int> res(a.size());
rep(i,a.size()){
res[i] = a[b[i]];
}
return res;
}
vector<int> power(const vector<int> &a, ll p){
auto res = a;
auto temp = a;
p--;
for(int i = 0; i < 60; i++){
if(p >> i & 1){
res = product(res, temp);
}
temp = product(temp, temp);
}
return res;
}
ll x[100005];
ll dx[100005];
ll a[100005];
vector<int>b;
signed main(){
int n;
cin >> n;
rep(i,n){
cin >> x[i];
}
rep(i,n-1){
dx[i] = x[i+1] - x[i];
// show(dx[i]);
}
int m;
ll k;
cin >> m >> k;
rep(i,n-1){
b.push_back(i);
}
rep(i,m){
cin >> a[i];
a[i]--;
swap(b[a[i]-1],b[a[i]]);
}
rep(i,n-1){
// show(b[i]);
}
auto c = power(b,k);
ll ans = x[0];
rep(i,n){
cout << ans << endl;
if(i!=n-1){
ans += dx[c[i]];
}
}
} | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
vector<int> get_bits(int mask) {
vector<int> bb;
while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
reverse(all(bb));
return bb;
}
int get_mask(vector<int> v) {
int mask = 0;
for(int x : v) { mask ^= (1 << x); }
return mask;
}
template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r){
uniform_int_distribution<ll> uid(l, r);
return uid(rng);
}
void sc() {}
template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// #ifndef LOCAL
// string to_string(__int128 x) {
// string s = "";
// bool neg = 0;
// if(x < 0) { s += "-"; neg = 1; x = -x; }
// if(!x) s += '0';
// while(x) {
// int rem = x % 10;
// s += to_string(rem);
// x /= 10;
// }
// reverse(s.begin() + neg, s.end());
// return s;
// }
// #endif
const int mod = 1e9 + 7; // 998244353;
int pwr(int a,ll b) {
int ans = 1;
while(b) {
if(b & 1) ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
/*
Lookout for overflows!!
Check array sizes!!
Clear before test cases!!
Use the correct modulo!!
Check for corner cases!!
Are you forgetting something?!
Read problem statement carefully!!!
*/
const int N = 1e5 + 5;
ll x[N], p[N], a[N], b[N];
int n;
void go(ll k) {
if(k == 1) {
fr(i, 1, n - 1) {
a[i] = p[i];
}
return;
}
if(k & 1) {
go(k - 1);
fr(i, 1, n - 1) {
b[i] = a[p[i]];
}
fr(i, 1, n - 1) {
a[i] = b[i];
}
return;
}
else {
go(k / 2);
fr(i, 1, n - 1) {
b[i] = a[a[i]];
}
fr(i, 1, n - 1) {
a[i] = b[i];
}
return;
}
}
void solve() {
sc(n);
fr(i, 1, n) {
sc(x[i]);
p[i] = i;
}
int m;
ll k;
sc(m, k);
fr(i, 1, m) {
int pos;
sc(pos);
swap(p[pos], p[pos - 1]);
}
go(k);
cout << x[1] << endl;
ll xx = x[1];
fr(i, 1, n - 1) {
xx += x[a[i] + 1] - x[a[i]];
cout << xx << endl;
}
}
int main() {
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for(int tt = 1; tt <= t; tt++) {
solve();
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;
int main(){
char s[105];
while(scanf("%s",s)!=EOF){
int len,n[105]={},ans=0;
len=strlen(s);
rep(i,0,len){
if(s[i]=='I') n[i]=1;
else if(s[i]=='V') n[i]=5;
else if(s[i]=='X') n[i]=10;
else if(s[i]=='L') n[i]=50;
else if(s[i]=='C') n[i]=100;
else if(s[i]=='D') n[i]=500;
else if(s[i]=='M') n[i]=1000;
}
rep(i,0,len-1){
if(n[i]<n[i+1]) ans-=n[i];
else ans+=n[i];
}
ans+=n[len-1];
cout<<ans<<endl;
}
} | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int hyou[102];
for (int i = 0; i < 102; i++) {
hyou[i] = i*i*i;
}
int e;
while (cin >> e) {
if (e == 0) {
break;
}
int a, b, c;
for (int i = 1; ; i++) {
if (hyou[i] > e) {
c = i-1;
break;
}
}
for (int i = 1; ;i++) {
if (i*i > e-hyou[c]) {
b = i-1;
break;
}
}
for (int i = 1; ;i++) {
if (i > e-hyou[c]-b*b) {
a = i-1;
break;
}
}
int MIN = a+b+c;
for (int i = c-1; i >= 0; i--) {
for (int j = b+1; ; j++) {
if (j*j > e-hyou[i]) {
b = j-1;
break;
}
}
int q = e-hyou[i]-b*b;
MIN = min(MIN, b+q+i);
}
cout << MIN << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
int main(){
int n = 5,k;
int a[n];
for(int i=0;i<5;i++)
cin>>a[i];
cin>>k;
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
if(a[j] - a[i] > k){
cout<<":("<<endl;
return 0; }
}
}
cout<<"Yay!"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c,d,e,k;
cin >> a >> b >> c >> d >> e >> k;
if(e-a>k) cout << ":(" << "\n";
else cout << "Yay!" << "\n";
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main()
{
int d;
while (cin >> d) {
int sum = 0;
for (int i = d; i <= 600 - d; i += d) {
sum += (d*i*i);
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
using namespace std;
typedef long long ll;
static vector<int> P={2};
template<class T>
T next_prime(T x){
int size=P.size();
if(x<P[size-1]){
int begin=0,end=size;
while(end-begin>1){
int c=(begin+end)/2;
if(x<P[c]){
end=c;
}else{
begin=c;
}
}
return P[begin];
}
T res=P[size-1];
while(true){
res++;
bool prime=true;
for(int i=0;i<size;i++){
if(P[i]<=sqrt((double)res)){
if(res%P[i]==0){
prime=false;
break;
}
}else{
break;
}
}
if(prime){
P.push_back(res);
size++;
if(res>x){
break;
}
}
}
return res;
}
template<class T>
bool prime(T x){
if(x==next_prime(x-1)) return true;
return false;
}
int N;
vector<int> a;
int main(){
cin>>N;
int prev=1;
while(N!=0){
int p=next_prime(prev);
if(p%10==1){
a.push_back(p);
N--;
}
prev=p;
}
repr(e,a) cout<<e<<' ';
cout<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
//const int mod=998244353;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main() {
int n,x;cin >>n>>x;
vector<int>a(n);
for (int i = 0; i < n; ++i) {
cin >>a[i];
}
sort(all(a));
ll sum=0;
int ans=0;
for (int i = 0; i < n; ++i) {
sum+=a[i];
if(sum<=x){
ans++;
}
}
if(sum<x){
ans--;
}
cout <<ans <<endl;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N, K;
vector<long long> x;
long long calcTime(int i, int k){
if(k <= 1) return 0;
long long rt = (1L<<61), lt = (1L<<61);
int Rk = N - i - 1; //x[i]より右にある本数
int Lk = i; //x[i]より左にある本数
//右に行ってから左へ
for(int j = K - i - 1; j <= Rk; j++){
if(i + j >= N || j < 0) continue;
long long t = x[i + j] - x[i]; //右の端までの時間
t *= 2; //x[i]まで戻ってくる
t += x[i] - x[i - (K - j - 1)];//左の端まで
if(t < rt) rt = t;
}
//左に行ってから右へ
for(int j = K- N + i; j <= Lk; j++){
if(i < j || j < 0) continue;;
long long t = x[i] - x[i - j]; //左の端までの時間
t *= 2; //x[i]まで戻ってくる
t += x[i + (K - j - 1)] - x[i];//右の端まで
if(t < lt) lt = t;
}
return (long long) min(rt, lt);
}
int main(int argc, char* argv[]){
cin >> N >> K;
for(int i=1; i<=N; i++){
long long u;
cin >> u;
x.push_back(u);
}
//入力はソート済だが念のためソートする
sort(x.begin(), x.end());
long long ans = 0;
if(x[0] >= 0){
ans = (long long)abs(x[K-1]);
printf("%lld\n", ans);
return 0;
}
else if(x[N-1] <= 0){
ans = (long long)abs(x[N-K]);
printf("%lld\n", ans);
return 0;
}
int a, b;
for(int i=0; i<N; i++){
if(x[i] > 0){ break; }
a = i;
}
for(int i=N-1; i>=0; i--){
if(x[i] < 0){ break; }
b = i;
}
long long ans_a = abs(x[a]) + calcTime(a, K);
long long ans_b = abs(x[b]) + calcTime(b, K);
ans = min( ans_a, ans_b);
printf("%lld\n", ans);
return 0;
} | 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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 <fstream>
#include <complex>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
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
//--------------------------------------------
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
const double EPS = 1e-12;
const double INF = 1e12;
int main(){
int N,M;
while(cin>>N>>M){
int d[501][501];
REP(i,501)REP(j,501)d[i][j]=1000000;
if(N==0&&M==0)break;
REP(i,M){
int a,b;
cin>>a>>b;
a--;b--;
d[a][b]=1;d[b][a]=1;
}
REP(k,N){
REP(i,N){
REP(j,N)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
int res=0;
FOR(i,1,N)if(d[0][i]<=2)res++;
cout<<res<<endl;
}
return 0;
} | #include <iostream>
#include <queue>
using namespace std;
int main(){
while(1){
queue<int> Q;
int n,m,a[10000][2],b,i,j,k;
bool c[500]={};
cin >> n >> m;
if(n==0&&m==0){
return 0;
}
for(j=0, i=0;i<m;i++){
cin >> a[i][0] >> a[i][1];
if(a[i][0]==1){
c[a[i][1]-1]=true;
Q.push(a[i][1]);
}else if(a[i][1]==1){
c[a[i][0]-1]=true;
Q.push(a[i][0]);
}
}
for(;Q.size()!=0;){
b=Q.front();
Q.pop();
for(j=0;j<m;j++){
if(b==a[j][0]){
c[a[j][1]-1]=true;
}
if(b==a[j][1]){
c[a[j][0]-1]=true;
}
}
}
int count=0;
for(i=0;i<500;i++){
if(c[i]==true){
count++;
}
}
cout << count-1 << "\n";
}
}
| 1 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
string n;
cin >> n;
int len = n.size();
vector<ll> tmp(2);
vector<vector<ll>> bill(len, tmp);
bill[0][0] = n[len-1] - '0';
bill[0][1] = 10 - (n[len-1] - '0');
rep2(i, 1, len){
int x = n[len - 1 - i] - '0';
bill[i][0] = min(bill[i - 1][0] + x, bill[i-1][1] + x + 1);
bill[i][1] = min(bill[i-1][0] + 10 - x, bill[i-1][1] + 9 - x);
}
cout << min(bill[len-1][0], bill[len-1][1]+1) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
wGraph InputWGraph(ll N,ll M){
wGraph G(N);
for (int i = 0; i < M; ++i) {
ll a,b,c;
cin >> a >> b >> c;
a--;b--;
G[a].push_back(make_pair(b,c));
G[b].push_back(make_pair(a,c));
}
return G;
}
wGraph InputDWGraph(ll N, ll M){
wGraph G(N);
for (int i = 0; i < M; ++i) {
ll a,b,c;
cin >> a >> b >> c;
a--;b--;
G[a].push_back(make_pair(b,c));
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputGraph(wGraph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j].first <<"/" << G[i][j].second << ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
string N;
cin >> N;
ll digit = N.size();
vector<vector<ll>>memo(2);
for (int yi = 0; yi < 2; ++yi) {
memo[yi] = vector<ll>(digit);
for (int xi = 0; xi < digit; ++xi) {
memo[yi][xi] = (1ll << 50);
}
}
ll first = N[0] - '0';
memo[0][0] = min(11 - first,first);
memo[1][0] = min(11 - first - 1,first + 1);
for (int i = 1; i < digit; ++i) {
ll num = N[i] - '0';
memo[0][i] = min(memo[0][i-1] + num,memo[1][i-1] + (10 - num));
memo[1][i] = min(memo[0][i-1] + num + 1,memo[1][i-1] + (10 - num - 1));
}
cout << (memo[0][digit-1]) << endl;
}
| 1 |
#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int&
#define I inline
#define W while
#define N 100000
#define LL long long
using namespace std;
int n,m,v,p,a[N+5];LL s[N+5];
I bool cmp(CI x,CI y) {return x>y;}//从大到小排序
int main()
{
RI i;for(scanf("%d%d%d%d",&n,&m,&v,&p),i=1;i<=n;++i) scanf("%d",a+i);
for(sort(a+1,a+n+1,cmp),i=1;i<=n;++i) s[i]=s[i-1]+a[i];//排序后求前缀和
for(i=n;i>p;--i) if(a[i]+m>=a[p])//枚举答案，首先要使得加上m后大于等于第p个数
if(1LL*max(v-p-(n-i),0)*m<=1LL*(a[i]+m)*(i-p)-(s[i-1]-s[p-1])) break;//用1去填平中间的坑
return printf("%d",i),0;//输出答案（若始终没break则最后i恰好等于p）
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
o<<"{";
for(const T& v:vc) o<<v<<",";
o<<"}";
return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
os<<t<<" ~ ";
dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {"; \
for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif
int main(){
cin.tie(0);
ios::sync_with_stdio(false); //DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
ll N,M,K,P; cin >> N >> M >> K >> P;
V<ll> A(N); rep(i,N) cin >> A[i];
sort(all(A),greater<ll>());
auto can = [&](int i){
if(i<P) return true;
ll t = A[i]+M;
ll f = 0;
for(int j=P-1;j<N;j++) if(j != i){
if(t < A[j]) return false;
f += min(t-A[j],M);
}
return f >= M*(K-P);
};
int lb = -1, ub = N;
while(ub-lb>1){
int m = (lb+ub)/2;
if(can(m)) lb = m;
else ub = m;
}
cout << lb+1 << endl;
}
| 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e9+7;
int main(){
ll x,y;
cin >> x >> y;
if(x<=y){
if(x<0 && y>0 && abs(y)>=abs(x)){
cout << 1+y+x << endl;
}
else if(x<0 && y>0 && abs(y)<abs(x)){
cout << 1-y-x << endl;
}
else{
cout << y-x << endl;
}
}
else{
if(x>0 && y>=0){
cout << min(1LL+x+y,2LL+x-y) << endl;
}
else if(x>0 && y<0 && abs(x)>=abs(y)){
cout << 1+x+y << endl;
}
else if(x>0 && y<0 && abs(x)<abs(y)){
cout << 1-x-y << endl;
}
else if(x==0){
cout << 1-y << endl;
}
else{
cout << 2+x-y << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
int a, b;
cin >> a >> b;
cout << a - b + 1 << endl;
} | 0 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size() == 2) {
cout << s << endl;
}
else if(s.size() == 3) {
for(int i = 2; i > -1; i--) {
cout << s[i];
}
cout << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
int main() {
std::vector<int> arr;
int len, num = 0;
std::cin >> len;
for(int i = 0; i < len; i++) {
std::cin >> num;
arr.push_back(num);
}
for(int i = len-1; i >= 0; i--) {
std::cout << arr[i];
if(i != 0) std::cout << " ";
}
std::cout << std::endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int w,h,sy,sx,gx,gy,n;
int color;
int c,d,x,y;
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
int maps[105][105];
int mem[105][105];
int dfs(int nowx,int nowy);
main(){
while(1){
cin>>w>>h;
if(w==0&&h==0)break;
cin>>sx>>sy>>gx>>gy;
cin>>n;
memset(maps,0,sizeof(maps));
memset(mem,0,sizeof(maps));
for(int i=0;i<n;i++){
cin>>c>>d>>x>>y;
for(int i=0;i<4;i++){
if(d==0){
maps[y][x+i]=c;
maps[y+1][x+i]=c;
}
else{
maps[y+i][x]=c;
maps[y+i][x+1]=c;
}
}
}
/*
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cout<<maps[i][j]<<" ";
}
cout<<endl;
}
*/
color=maps[sy][sx];
if(dfs(sx,sy)==1){
cout<<"OK"<<endl;
}
else{
cout<<"NG"<<endl;
}
}
}
int dfs(int nowx,int nowy){
int check=0;
if(nowx==gx&&nowy==gy){
return 1;
}
else{
for(int i=0;i<4;i++){
if(nowx+dx[i]>=1&&nowx+dx[i]<=w&&nowy+dy[i]>=1&&nowy+dy[i]<=h&&maps[nowy+dy[i]][nowx+dx[i]]==color&&mem[nowy+dy[i]][nowx+dx[i]]==0){
mem[nowy+dy[i]][nowx+dx[i]]=1;
check=max(dfs(nowx+dx[i],nowy+dy[i]),check);
}
}
return check;
}
}
| #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
struct edge{int to, cost;};
const int MAX_M = 2e5 + 5, INF = 1e5;
int N, M, d[MAX_M * 3];
vector<edge> G[MAX_M * 3];
map<P, int> f;
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P>> pq;
fill(d, d+MAX_M*3, INF); d[s] = 0;
pq.push(P(0, s));
while(pq.size()){
P p = pq.top(); pq.pop();
int v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[v]+e.cost<d[e.to]){
d[e.to] = d[v] + e.cost;
pq.push(P(d[e.to], e.to));
}
}
}
}
int main(){
cin >> N >> M;
f[P(1, 0)] = 0; f[P(N, 0)] = 1;
int cnt = 2;
for(int i=0;i<M;i++){
int p, q, c; cin >> p >> q >> c;
auto it1 = f.find(P(p, c)), it2 = f.find(P(q, c));
if(it1 == f.end()) f[P(p, c)] = cnt++;
if(it2 == f.end()) f[P(q, c)] = cnt++;
edge e1; e1.to = f[P(q, c)]; e1.cost = 0;
edge e2; e2.to = f[P(p, c)]; e2.cost = 0;
G[f[P(p, c)]].push_back(e1); G[f[P(q, c)]].push_back(e2);
auto it3 = f.find(P(p, 0)), it4 = f.find(P(q, 0));
if(it3 == f.end()) f[P(p, 0)] = cnt++;
if(it4 == f.end()) f[P(q, 0)] = cnt++;
edge e3; e3.to = f[P(p, 0)]; e3.cost = 0;
edge e4; e4.to = f[P(q, 0)]; e4.cost = 0;
G[f[P(p, c)]].push_back(e3); G[f[P(q, c)]].push_back(e4);
edge e5; e5.to = f[P(p, c)]; e5.cost = 1;
edge e6; e6.to = f[P(q, c)]; e6.cost = 1;
G[f[P(p, 0)]].push_back(e5); G[f[P(q, 0)]].push_back(e6);
}
dijkstra(f[P(1, 0)]);
if(d[f[P(N, 0)]] == INF) cout << -1 << endl;
else cout << d[f[P(N, 0)]] << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<vector<pair<int, bool>>> shougen(n);
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
for (int j = 0; j < a.at(i); j++) {
int x;
bool y;
cin >> x >> y;
shougen.at(i).push_back(make_pair(x, y));
}
}
int cnt_max = 0;
for (int i = 0; i < (1 << n); i++) {
bitset<15> s(i);
bool flag = true;
for (int j = 0; j < n; j++) {
if (s.test(j)) {
for (int k = 0; k < a.at(j); k++) {
if (s.test(shougen.at(j).at(k).first - 1) !=
shougen.at(j).at(k).second) {
flag = false;
break;
}
}
if (flag == false) {
break;
}
}
}
if (flag == true) {
cnt_max = (cnt_max > (int)s.count()) ? cnt_max : (int)s.count();
}
}
cout << cnt_max << endl;
return 0;
} | //----------------------Shanu Garg here---------------------
//-------------Search on youtube : Shanu Garg---------------
//-Studying at National Institute of Technology Delhi(NITD)-
//---------------------From Delhi, India--------------------
#include<bits/stdc++.h>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define memset(a,first,last,val) fs(i,first,last,1) a[i]=val
#define nl cout<<"\n";
#define chk(x) cout<<#x<<x<<" ", nl
#define ll long long int
#define ull unsigned long long int
#define vi vector<int>
#define vvi vector<vi>
#define pr pair<ll, ll>
#define vii vector<pair<int, int>>
#define vll vector<pr>
#define vl vector<ll>
#define m(a,b) map<a, b>
#define mid(a,b) ((a+b)/2)
#define pb push_back
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
vl vb;
int N;
class triplet{ll f, s, t;};
vl in(ll n){
vl ar;
ll x;
f(i,n)
cin>>ar[i];
return ar;
}
vll in_pr(ll n){
vll ar;
ll x,y;
f(i,n)
{cin>>x>>y;
ar[i]={x,y};
}return ar;
}
void out(vl v, char ch='\0'){
fl(i,v)
cout<<i<<ch;
}
void printArray(vector<int> arr, int n)
{
ll num=0;
for (int i = 0; i < n; i++)
num*=10, num+=i;
if(n==N)
vb.pb(num);
}
int printfactorialof(int n){
if(n<=1)
return 1;
return n*printfactorialof(n-1);
}
void solve(){
ll a,b;
cin>>a>>b;
if(a+b <= 16){
if(a<=8 && b<=8)
cout<<"Yay!",nl
else
{
cout<<":(",nl
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
//#include <tuple>
constexpr long long mod = static_cast<long long>(1e9 + 7);
using Edges = std::vector<std::vector<int>>;
void dfs1(int i, const Edges& edges, std::vector<int>& ans, std::vector<bool>& memo) {
memo[i] = true;
for(auto v: edges[i]) {
if(!memo[v]) dfs1(v, edges, ans, memo);
}
ans.push_back(i);
}
void dfs2(int i, const Edges& redges, std::vector<int>& ans, int cnt) {
ans[i] = cnt;
for(auto v: redges[i]) {
if(ans[v] < 0) dfs2(v, redges, ans, cnt);
}
}
int main() {
int V, E;
std::cin >> V >> E;
Edges edges(V);
Edges redges(V);
while(E--){
int s, t;
std::cin >> s >> t;
edges[s].push_back(t);
redges[t].push_back(s);
}
std::vector<bool> memo(V, false);
std::vector<int> topoSorted;
topoSorted.reserve(V);
for(int i = 0; i < V; ++i) {
if(!memo[i])dfs1(i, edges, topoSorted, memo);
}
std::vector<int> ans(V, -1);
int cnt = 0;
for(auto itr = rbegin(topoSorted); itr != rend(topoSorted); ++itr) {
if(ans[*itr] < 0) dfs2(*itr, redges, ans, cnt++);
}
int Q;
std::cin >> Q;
while(Q--) {
int u, v;
std::cin >> u >> v;
std::cout << (ans[u] == ans[v]) << '\n';
}
std::cout << std::flush;
return 0;
}
| #include <string.h>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <map>
#include <vector>
using namespace std;
const int MAXV = 10010;
struct Edge {
int u;
int v;
Edge(int u, int v): u(u), v(v) {}
};
int v, e, source = 0, dfs_clock = 0, scc_count = 0;
vector<int> g[MAXV];
int pre[MAXV] = {0};
int low[MAXV] = {0};
map<int, int> scc_v_to_no;
vector<int> scc_no_to_v[MAXV];
stack<int> s;
void DFS(int u) {
int child_num = 0;
++dfs_clock;
pre[u] = dfs_clock;
low[u] = dfs_clock;
s.push(u);
for (int v: g[u]) {
if (!pre[v]) {
DFS(v);
low[u] = min(low[u], low[v]);
} else if (scc_v_to_no.find(v) == scc_v_to_no.end()) {
low[u] = min(low[u], pre[v]);
}
}
if (low[u] == pre[u]) {
while (1) {
auto x = s.top();
s.pop();
scc_v_to_no.emplace(x, scc_count);
scc_no_to_v[scc_count].push_back(x);
if (x == u) {
++scc_count;
break;
}
}
}
}
void SCC() {
for (int i = 0; i < v ; ++i) {
if (!pre[i]) {
DFS(i);
}
}
}
int main() {
scanf("%d %d", &v, &e);
for (int i = 0; i < e; ++i) {
int s, t;
scanf("%d %d", &s, &t);
g[s].push_back(t);
}
SCC();
int q;
scanf("%d\n", &q);
for (size_t i = 0; i < q; i++) {
int a, b;
scanf("%d %d", &a, &b);
printf("%d\n", scc_v_to_no.at(a) == scc_v_to_no.at(b));
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
bool f = 0;
int count = 0;
while(1){
for (int i = 0; i < N; i++){
if(A[i] % 2 == 0){
A[i] = A[i] / 2;
}else{
f= 1;
}
}
if(f == 1)
break;
count++;
}
cout << count << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define input freopen("input.txt","r",stdin)
#define output freopen("output.txt","w",stdout)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define siii(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pi(a) printf("%d",a)
#define spc printf(" ")
#define bl printf("\n")
#define here(a) printf("#### %d ####",a)
#define pii pair<int,int>
#define fr(i,n) for(int i=0;i<n;i++)
#define case(num) printf("Case %d:",num)
#define inf 1000000050
#define MAX 10010
#define MOD 1000000007
vector<int>edge;
vector<vector<int> >triangle;
void npr(vector<int>v, int p){
if(v.size()==3){
triangle.push_back(v);
//for(int i=0;i<v.size();i++) cout<<v[i]<<" ";
//cout<<endl;
return;
}
if(p>=edge.size()) return;
npr(v,p+1);
v.push_back(edge[p]);
npr(v,p+1);
v.pop_back();
}
int main(){
//input;
//output;
int n,tmp;
cin>>n;
for(int i=0;i<n;i++){
cin>>tmp;
edge.push_back(tmp);
}
vector<int>v;
npr(v,0);
int a,b,c;
int cnt = 0;
for(int i=0;i<triangle.size();i++){
sort(triangle[i].begin(),triangle[i].end());
a = triangle[i][0];
b = triangle[i][1];
c = triangle[i][2];
if(a!=b && a!=c && b!=c){
if(a+b>c) cnt++;
}
}
cout<<cnt<<endl;
return 0;
}
/**
*/
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll K, X;
cin >> K >> X;
rep2(i, X - K + 1, X + K) cout << i << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,i,n;
cin>>a>>b;
n=((a*2)-1)/2;
for(i=0;i<n;i++)
{
a--;
cout<<b-a<<" ";
}
cout<<b<<" ";
a=0;
for(i=n+1;i<2*n+1;i++)
{
a++;
cout<<b+a<<" ";
}
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using lint = long long;
using namespace std;
struct Sub {
lint b, l, r;
Sub(int b = 0, int l = 0, int r = 0) : b(b), l(l), r(r) {}
};
int main() {
lint N, X;
cin >> N >> X;
vector<Sub> subs(N);
for (auto& s : subs) {
cin >> s.b >> s.l >> s.r;
}
sort(subs.begin(), subs.end(), [&](Sub a, Sub b) {
return a.r * (X - a.b) + a.l * a.b > b.r * (X - b.b) + b.l * b.b;
});
// 勉強時間で二分探索
lint ok = N * X, ng = -1;
while (ok - ng > 1) {
lint mid = (ok + ng) / 2;
lint score = 0; // 先頭からmid/X科目だけX点を取り、他は0点
for (int i = 0; i < N; ++i) {
if (i < mid / X) {
score += subs[i].r * (X - subs[i].b);
} else {
score -= subs[i].l * subs[i].b;
}
}
lint R = mid % X;
bool judge = (score >= 0);
int n = mid / X;
if (R > 0) {
for (int r = 0; r < N; ++r) {
lint nscore = score;
if (r < n) {
// r番目を消してn番目を追加
nscore -= subs[r].r * (X - subs[r].b) + subs[r].l * subs[r].b;
nscore += subs[r].l * min(subs[r].b, R) + subs[r].r * max(0LL, R - subs[r].b);
nscore += subs[n].r * (X - subs[n].b) + subs[n].l * subs[n].b;
} else {
// r番目を追加する
nscore += subs[r].l * min(subs[r].b, R) + subs[r].r * max(0LL, R - subs[r].b);
}
if (nscore >= 0) judge = true;
}
}
(judge ? ok : ng) = mid;
}
cout << ok << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i)
#define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i)
typedef long long ll;
template<typename T>inline bool chkmin(T &x,T y){return (y<x)?(x=y,1):0;}
template<typename T>inline bool chkmax(T &x,T y){return (y>x)?(x=y,1):0;}
inline int read(){
int x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') f=-1,c=getchar();
x=c^'0';
while((c=getchar())>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0');
return x*f;
}
inline ll readll(){
ll x;
char c;
int f=1;
while((c=getchar())!='-' && (c>'9' || c<'0'));
if(c=='-') f=-1,c=getchar();
x=c^'0';
while((c=getchar())>='0' && c<='9') x=(x<<1ll)+(x<<3ll)+(c^'0');
return x*f;
}
const int maxn=1e5+10;
int id[maxn],b[maxn],l[maxn],r[maxn];
ll v[maxn];
inline bool cmp(const int A,const int B){
return v[A]>v[B];
}
int main(){
int n=read(),lim=read();
ll tot=0;
REP(i,1,n){
b[i]=read(),l[i]=read(),r[i]=read(),id[i]=i;
v[i]=(ll)l[i]*b[i]+(ll)r[i]*(lim-b[i]);
tot-=(ll)l[i]*b[i];
}
sort(id+1,id+n+1,cmp);
ll sum=0,ans=1e18;
ll val=0;
REP(i,1,n){
int u=id[i];
val=v[u];
if(tot+v[u]>=0) break;
tot+=v[u];
sum+=lim;
}
REP(i,1,n) if(tot+v[i]>=0){
if(v[i]>val) tot+=val-v[i];
if(tot+(ll)l[i]*b[i]>=0){
chkmin(ans,b[i]-(tot+(ll)l[i]*b[i])/l[i]);
}
else{
chkmin(ans,lim-(tot+v[i])/r[i]);
}
if(v[i]>val) tot-=val-v[i];
}
printf("%lld\n",ans+sum);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define endl "\n"
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define ROF(i, a, n) for (ll i = a; i >= n; i--)
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x,val,sizeof(x))
#define dline cout<<"///REACHED///\n";
typedef long long ll;
const ll MOD = 1e+9+7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MAXN = 4e+5+7;
// 6
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b;
cin>>a>>b;
if(((16-(2*min(a,b))+1)/2+min(a,b))>= max(a,b)){
cout<<"Yay!";
}
else{
cout<<":(";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (X < 9 && Y <9){
cout << "Yay!" << endl;
return 0;
}
cout << ":(" << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF 1000000001
int U,V;
int dist_toU;
struct node{
vector<int> to;
int dist;
bool path_toU;
node(){
dist=0;
path_toU=false;
}
};
void dfs1(int v, int p, vector<node> &nodes){
for (int i = 0; i < nodes[v].to.size(); i++){
int v_to=nodes[v].to[i];
if(v_to==p)continue;
nodes[v_to].dist=nodes[v].dist+1;
if(v_to==U){
nodes[v_to].path_toU=true;
dist_toU=nodes[v_to].dist;
}
dfs1(v_to, v, nodes);
if(nodes[v_to].path_toU)nodes[v].path_toU=true;
}
for (int i = 0; i < nodes[v].to.size(); i++){
int v_to=nodes[v].to[i];
if(v_to==p)continue;
nodes[v].dist=max(nodes[v].dist,nodes[v_to].dist);
}
}
int main() {
int N;
cin>>N;
cin>>U>>V;U--;V--;
vector<node> nodes(N);
for (int i = 0; i < N-1; i++){
int A,B;
cin>>A>>B;A--;B--;
nodes[A].to.push_back(B);
nodes[B].to.push_back(A);
}
dist_toU=0;
dfs1(V,-1,nodes);
int move=dist_toU/2+1;
int ans=0;
int v=V,p=-1;
while(move>0){
for(int v_to:nodes[v].to){
if(v_to==p)continue;
if(nodes[v_to].path_toU){
p=v;
v=v_to;
ans=nodes[v].dist-1;
break;
}
}
move--;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=1e6+10;
const int mod=1e9+7;
const double pi=3.1415926535;
int w[3005],v[3005];
int dp[3005][2];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,t;
cin>>n>>t;
for(int i=1;i<=n;i++)
{
cin>>w[i]>>v[i];
}
for(int i=1;i<=n;i++)
{
for(int j=t-1;j>=0;j--)
{
for(int x=1;x>=0;x--)
{
if(x==0)
{
if(j>=w[i])
{
dp[j][x]=max(dp[j][x],dp[j-w[i]][x]+v[i]);
}
}
else
{
dp[j][x]=max(dp[j][x],dp[j][0]+v[i]);
if(j>=w[i])
{
dp[j][x]=max(dp[j][x],dp[j-w[i]][x]+v[i]);
}
}
}
}
}
cout<<dp[t-1][1]<<'\n';
}
| 0 |
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
#define DEBUG5(var0, var1, var2, var3, var4) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG4(var1,var2,var3,var4); }
#define DEBUG6(var0, var1, var2, var3, var4, var5) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG5(var1,var2,var3,var4,var5);}
typedef long long ll;
#define MAX_V 100100
int V;
vector <pair <int,ll> > edge[MAX_V];
vector <pair <int,ll> > Redge[MAX_V];
vector <int> vs;
bool used[MAX_V];
int cmp[MAX_V];
void reverse_edge(){
rep2(i,1,V+1){//1-indexedにしてます
rep(j,sz(edge[i])){
Redge[edge[i][j].fir].pb(mp(i,edge[i][j].sec));
}
}
}
void dfs(int now){
used[now] = true;
rep(i,sz(edge[now])){
if(!used[edge[now][i].fir]){
dfs(edge[now][i].fir);
}
}
vs.pb(now);
}
void rdfs(int now,int k){
used[now] = true;
cmp[now] = k;
rep(i,sz(Redge[now])){
if(!used[Redge[now][i].fir]){
rdfs(Redge[now][i].fir,k);
}
}
}
int scc(){
memset(used,0,sizeof(used));
vs.clear();
rep2(v,1,V+1){//1-indexed
if(!used[v]){
dfs(v);
}
}
memset(used,0,sizeof(used));
reverse_edge();
int k = 0;
for(int i = sz(vs)-1;i >= 0;i--){
if(!used[vs[i]]){
k += 1;
rdfs(vs[i],k);
}
}
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> V;
int E;
cin >> E;
rep(i,E){
int x,y;
cin >> x >> y;
x += 1;
y += 1;
edge[x].pb(mp(y,1));
}
scc();
int Q;
cin >> Q;
rep(i,Q){
int x,y;
cin >> x >> y;
x += 1;
y += 1;
if(cmp[x] == cmp[y]){
cout << 1 << endl;
}else{
cout << 0 << endl;
}
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX_N = 10000;
const int V = 10000;
vector<int> G[MAX_N];
vector<int> rG[MAX_N];
vector<int> vs; //??°?????????????????????
bool used[MAX_N]; //?????§????????????????????????
int cmp[MAX_N]; //?±????????????£????????????????????????????????????
void add_edge(int from,int to)
{
G[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v)
{
used[v] = true;
for(int i=0;i<G[v].size();i++){
if(!used[G[v][i]]){
dfs(G[v][i]);
}
}
vs.push_back(v);
}
void rdfs(int v,int k)
{
used[v] = true;
cmp[v] = k;
for(int i=0;i<rG[v].size();i++){
if(!used[rG[v][i]]){
rdfs(rG[v][i],k);
}
}
}
int scc() //?????£??????????????°?????????
{
memset(used,0,sizeof(used));
vs.clear();
for(int v=0;v<V;v++){
if(!used[v]){
dfs(v);
}
}
memset(used,0,sizeof(used));
int k=0;
for(int i=vs.size()-1;i>=0;i--){
if(!used[vs[i]]){
rdfs(vs[i],k++);
}
}
return k;
}
int main()
{
int n,m,from,to,k,l,u,v;
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> from >> to;
add_edge(from,to);
}
k = scc();
cin >> l;
for(int i=0;i<l;i++){
cin >> u >> v;
printf("%d\n",(cmp[u] == cmp[v]));
}
} | 1 |
#include <cstdio>
#include <vector>
#include <tuple>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int N, Q;
scanf("%d %d", &N, &Q);
vector<tuple<int, int, int>> event;
for(int i = 0; i < N; i++) {
int s, t, x;
scanf("%d %d %d", &s, &t, &x);
event.push_back(make_tuple(s-x, 1, x));
event.push_back(make_tuple(t-x, -1, x));
}
vector<int> D(Q);
for(int i = 0; i < Q; i++) scanf("%d", &D[i]);
sort(event.begin(), event.end());
multiset<int> st;
int k = 0; //何番目のイベントまで処理したか
for(int i = 0; i < Q; i++) {
while(k < event.size() && get<0>(event[k]) <= D[i]) {
if(get<1>(event[k]) == 1) {
st.insert(get<2>(event[k]));
} else {
auto it = st.find(get<2>(event[k]));
if(it != st.end()) st.erase(it); //1つだけ削除
}
k++;
}
if(st.empty()) printf("-1\n");
else printf("%d\n", *st.begin());
}
return 0;
} | #include <cstdio> //{{{
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#define ALL(c) (c).begin(), (c).end()
#define DUMP(x) std::cerr << #x << ':' << x << '\n';
typedef long long ll;
// clang-format off
template<typename T,typename U>inline bool chmax(T&x,U a){if(x>=a)return 0;x=a;return 1;}
template<typename T,typename U>inline bool chmin(T&x,U a){if(x<=a)return 0;x=a;return 1;}
inline int in(){int x;scanf("%d", &x);return x;}
// clang-format on
// }}}
//{{{ graph.hpp
#ifndef INCLUDE_GRAPH_HPP
#define INCLUDE_GRAPH_HPP
#include <vector>
#include <climits>
namespace orliv {
namespace graph {
struct Edge {
typedef int weight_type;
static constexpr weight_type INF =
std::numeric_limits<weight_type>::max() - 100;
int from, to;
weight_type w;
Edge(int from, int to, weight_type w = 1) : from(from), to(to), w(w) {}
bool operator<(const Edge& rhs) const {
if (w != rhs.w) return w > rhs.w;
if (from != rhs.from) return from < rhs.from;
return to < rhs.to;
}
};
typedef Edge::weight_type Weight;
typedef std::vector<Edge> Edges;
typedef std::vector<Weight> Weights;
typedef std::vector<int> Path;
}
typedef std::vector<graph::Edges> Graph;
}
#endif
//}}}
//{{{ prim.cc
#ifndef INCLUDE_GRAPH_HPP
#include "graph.hpp"
#endif
#include <queue>
namespace orliv {
namespace graph {
Edges prim(const Graph& g, int s = 0) {
const int V = g.size();
Edges spanning_tree;
spanning_tree.reserve(V - 1);
std::vector<bool> visited(V, false);
std::priority_queue<Edge> pq;
for (pq.emplace(-2, s, 0); !pq.empty();) {
auto e = pq.top();
pq.pop();
if (visited[e.to]) continue;
visited[e.to] = true;
if (e.from >= 0) spanning_tree.emplace_back(e);
for (const auto& f : g[e.to]) pq.emplace(f);
}
return std::move(spanning_tree);
}
}
}
//}}}
using namespace std;
int main() {
int V = in(), E = in();
orliv::Graph g(V);
for (int i = 0; i < E; i++) {
int s = in(), t = in(), w = in();
g[s].emplace_back(s, t, w);
g[t].emplace_back(t, s, w);
}
auto es = orliv::graph::prim(g);
ll tot = 0;
for (const auto& e : es) {
tot += e.w;
}
cout << tot << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
vector<ll> L(N,0);
vector<ll> R(N,0);
ll recL=0;ll MaxL=0;
for(ll i=0;i<N;i++){
cin>>L[i]>>R[i];
if(MaxL<L[i]){
MaxL=L[i];
recL=i;
}
;}
if(N==2){
cout<<R[0]+R[1]-L[0]-L[1]+2<<endl;return 0;
}
vector<P> pq(0);
for(ll i=0;i<N;i++){
if(i!=recL)pq.push_back(P(R[i],L[i]))
;}
sort(pq.begin(), pq.end());
vector<ll> lmax(N-1,0);
ll q=0;
for(ll i=0;i<N-1;i++){
q=max(q,pq[i].second);
lmax[i]=q
;}
//L[recL]が最大
//最終的にrecL側のRの選考基準をｒとする
//Rがpq[r]以上は仲間
ll ans=0;
//pq[0]が敵の時かつ仲間いるとき
for(ll r=1;r<=N-2;r++){
ans=max(ans,max(min(pq[r].first,R[recL])-MaxL+1,0LL)+max(pq[0].first-lmax[r-1]+1,0LL));
;}
//全員敵
ans=max(ans,max(pq[0].first-lmax[N-2]+1,0LL)+R[recL]-MaxL+1);
//pq[0]が味方の時;
ll ans2=0;
ans2+=max(0LL,min(pq[0].first,R[recL])-MaxL+1);//味方
ll check;
for(ll i=0;i<N;i++){
if(L[i]==pq[0].second&&R[i]==pq[0].first&&i!=recL){check=i;break;}
;}
priority_queue<ll> vec;
for(ll i=0;i<N;i++){
if(i!=recL&&i!=check){
vec.push(R[i]-L[i]+1);
}
;}
ans2+=vec.top();
ans=max(ans,ans2);
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)(j);i <= (int)(k);i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define fix cout<<fixed<<setprecision(20);
const int maxn=(int)2e6+5;
vector<int> E[maxn];
int vis[maxn],ind[maxn],dis[maxn];
int reach[maxn];//longest can reach
inline int id(int x,int y){
if(x>y)swap(x,y);
//x--,y--;
return x+1000*y;
}
int ans=-1;
int dfs(int x){
//debug(x);
if(vis[x]==2)return dis[x];
vis[x]=1;
for(auto v:E[x]){
if(vis[v]==1)return -1;
//dis[v]=dis[x]+1;ans=max(ans,dis[v]);
int ret=dfs(v);
if(ret==-1)return -1;
dis[x]=max(dis[x],ret+1);//每个节点存最大值。
}
//debug(dis[x]);debug(x);
vis[x]=2;
return dis[x];
}
int main(){
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;cin>>n;
rep(i,1,n){
int last=0;
rep(j,1,n)if(i!=j){
int x;scanf("%d",&x);
if(last==0){last=id(i,x);continue;}
E[last].push_back(id(i,x));ind[id(i,x)]++;
last=id(i,x);
}
}
rep(i,1,n)rep(j,1,i-1)if(ind[id(i,j)]==0){
// memset(vis,0,sizeof(vis));
E[0].push_back(id(i,j));
/* dis[id(i,j)]=1;
if(dfs(id(i,j))==0){cout<<-1<<endl;return 0;};
//debug("--"); */
}
dis[0]=-1;
int ans=dfs(0);
cout<<ans<<endl;
}
/*
建DAG，判环
topo 可判环（无法进入队列的点），但无法找最长路径
两种环
一种是链环，用
一种是纯环，
3
2 3
1 3
1 2
12-13
12-23
13-23
4
2 3 4
1 3 4
4 1 2
3 1 2
12-13
13-14
12-23
23-24
34-13
13-23
34-14
14-24
queue<int> Q;
rep(i,1,n)rep(j,1,i-1)if(ind[id(i,j)]==0)Q.push(id(i,j)),vis[id(i,j)]=1;
while(!Q.empty()){
int cur=Q.front();Q.pop();
debug(cur);debug(vis[cur]);
for(auto v:E[cur]){
if(vis[v]){continue;}
//if(vis[v]==1){cout<<-1<<endl;return 0;}
ind[v]--;
if(ind[v]==0)Q.push(v),vis[v]=vis[cur]+1,ans=max(ans,vis[v]);
}
}
// rep(i,1,n)rep(j,1,n)if(i!=j)debug(vis[id(i,j)]),debug(i),debug(j);
*/ | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 1e9 + 7;
struct ad_set
{
int tag;
deque<int> que;
void subt(int x)
{
tag += x;
}
void push_front(int x)
{
que.push_front(x + tag);
}
void push_back(int x)
{
que.push_back(x + tag);
}
int back()
{
return que.back() - tag;
}
void pop_back()
{
que.pop_back();
}
int size()
{
return que.size();
}
}tre;
int n;
char s[1000005], t[1000005];
int term[1000005], dest[1000005];
vector<int> occ[26];
int main()
{
scanf("%d%s%s", &n, s, t);
rep(i, n) {
s[i] -= 'a';
t[i] -= 'a';
}
rep(i, n) occ[s[i]].push_back(i);
int maxt = n - 1;
for(int i = n - 1; i >= 0; i --) {
maxt = min(maxt, i);
vector<int>::iterator pos = upper_bound(occ[t[i]].begin(), occ[t[i]].end(), maxt);
if(pos == occ[t[i]].begin()) {
printf("-1\n");
return 0;
}
else maxt = term[i] = *(-- pos);
}
rep(i, n) dest[i] = -1;
term[n] = -1;
for(int i = n - 1; i >= 0; i --)
if(term[i] != term[i + 1]) dest[term[i]] = i;
int ans = 0;
for(int i = n - 1; i >= 0; i --) {
if(dest[i] == -1) continue;
tre.subt(1);
tre.push_front(i);
while(tre.size() > 0 && tre.back() >= dest[i]) tre.pop_back();
tre.push_back(dest[i]);
ans = max(ans, tre.size());
}
printf("%d\n", ans - 1);
return 0;
} | #include<bits/stdc++.h>
constexpr auto MAXN = 1000000+500;
std::string s,t;
std::queue<int> que;
signed main(void)
{
int len,down,up; size_t ans = 0;
std::cin>>len>>s>>t;
if(s == t){ puts("0"); return 0; }
down = up = len-1;
while(down >= 0){
while(down && t[down-1]==t[down]) --down;
while(up>=0 && (up>down || s[up]!=t[down])) --up;
if(up < 0){ puts("-1"); return 0; }
while(!que.empty() && que.front()-que.size() >= down) que.pop();
if(up != down) que.push(up);
ans = std::max(ans,que.size()+1);
--down;
}
std::cout<<ans<<std::endl;
return 0;
}
| 1 |
#include <stdio.h>
void dividing(int pm, int pe, int pj);
int main(void)
{
int students_number;
int pm[10000], pe[10000], pj[10000];
scanf("%d", &students_number);
while (1) {
if (students_number == 0) {
break;
} else {
for (int i = 0; i < students_number; ++i) {
scanf("%d %d %d", &pm[i], &pe[i], &pj[i]);
}
for (int i = 0; i < students_number; ++i) {
dividing(pm[i], pe[i], pj[i]);
}
scanf("%d", &students_number);
}
}
return 0;
}
void dividing(int pm, int pe, int pj)
{
char rank;
if (pm == 100 || pe == 100 || pj == 100) {
rank = 'A';
} else if (pm + pe >= 90 * 2) {
rank = 'A';
} else if (pm + pe + pj >= 80 * 3) {
rank = 'A';
} else if (pm + pe + pj >= 70 * 3) {
rank = 'B';
} else if (pm + pe + pj >= 50 * 3 && (pm >= 80 || pe >= 80)) {
rank = 'B';
} else {
rank = 'C';
}
printf("%c\n", rank);
} | #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;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>>;
using GraphEdge = vector<vector<int>>;
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 gcd(int a, int b){if (a%b == 0){return(b);}else{return(gcd(b, a%b));}}
int lcm(int a, int b){return a * b / gcd(a, b);}
int main(){
int N;cin >> N;
if(N==2){
int a,b;cin >> a >> b;
cout << a + b << endl;
}else{
puts("Hello World");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
for (int i = sy; i < ty; i++) cout << 'U';
for (int i = sx; i < tx; i++) cout << 'R';
for (int i = sy; i < ty; i++) cout << 'D';
for (int i = sx; i < tx; i++) cout << 'L';
cout << 'L';
for (int i = sy; i <= ty; i++) cout << 'U';
for (int i = sx; i <= tx; i++) cout << 'R';
cout << 'D';
cout << 'R';
for (int i = sy; i <= ty; i++) cout << 'D';
for (int i = sx; i <= tx; i++) cout << 'L';
cout << 'U';
cout << '\n';
}
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) solve();
}
| #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int 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+="D";
for(int i=0; i<tx-sx+1;i++){
ans+="R";
}
for(int i=0; i<ty-sy+1; i++){
ans+="U";
}
ans+="L";
ans+="U";
for(int i=0; i<tx-sx+1; i++){
ans+="L";
}
for(int i=0; i<ty-sy+1; i++){
ans+="D";
}
ans+="R";
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
bool check(string x, string y) {
int a = x.size()-1;
return x[a] == y[0];
}
int main() {
string a, b, c;
cin >> a >> b >> c;
if(check(a, b) && check(b, c)) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
| #include <stdio.h>
#include <string.h>
int main (){
char a[100];
char b[100];
char c[100];
scanf("%s %s %s", a, b, c);
int A = strlen(a);
int B = strlen (b);
for (int i = 0; i < 10; i++){
if ( a[A - 1] == b[0] && b[B - 1]== c[0]){
puts ("YES");
break;
}
else{
puts ("NO");
break;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<double> ps(n + 1);
ps[0] = 0;
double t;
for (int i = 0; i < n; ++i) {
cin >> t;
ps[i + 1] = (t + 1) / 2 + ps[i];
}
double result = 0;
for (int i = k; i <= n; ++i) {
result = max(result, ps[i] - ps[i - k]);
}
cout << std::fixed << std::setprecision(10) << result << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin>>n>>k;
vector<int> p(n);
rep(i, n) cin>>p[i];
vector<int> ki2(n);
rep(i, n) ki2[i]=(p[i]+1);
int sum=0;
rep(i, k) sum+=ki2[i];
int mx=0;
for(int i=0; i+k-1<n; i++){
mx=max(mx, sum);
if(i+k<n) sum+= -ki2[i] +ki2[i+k];
}
double ans=(double)mx/2;
cout<<std::setprecision(15)<<ans<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int r, g;
cin >> r;
cin >> g;
cout << g - r + g << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// ここにプログラムを追記
int rating, next_rating, performance;
cin >> rating >> next_rating;
performance = 2 * next_rating - rating;
cout << performance << endl;
} | 1 |
/**
* @FileName a.cpp
* @Author kanpurin
* @Created 2020.08.21 02:11:21
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;cin >> n;
vector<ll> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
n++;
int l;cin >> l;
x.push_back(x[x.size()-1] + l);
vector<int> next(n);
for (int i = 0; i < n; i++) {
auto t = upper_bound(x.begin(), x.end(), x[i] + l);
t--;
next[i] = t - x.begin();
}
vector<vector<int>> doubling(32,vector<int>(n));
for (int i = 0; i < n; i++) {
doubling[0][i] = next[i];
}
for (int i = 1; i < 32; i++) {
for (int j = 0; j < n; j++) {
doubling[i][j] = doubling[i-1][doubling[i-1][j]];
}
}
int q;cin >> q;
while(q--) {
int a,b;cin >> a >> b;
a--;b--;
if (b < a) swap(a,b);
int ans = 0;
for (int i = 31; i >= 0; i--) {
if (doubling[i][a] <= b) {
a = doubling[i][a];
ans += (1 << i);
}
}
if (a != b) ans++;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<string> S(n);
vector<vector<pair<int, int>>> v(4);
int sum = 0;
rep(i, n) {
cin >> S[i];
int cnt=0, mn=0;
for(char c: S[i]) {
cnt += (c=='(' ? 1 : -1);
mn = min(cnt, mn);
}
sum += cnt;
if(mn == 0 && cnt >= 0) {
v[0].push_back({mn, cnt});
} else if(mn < 0 && cnt >= 0) {
v[1].push_back({mn, cnt});
} else if(mn == cnt && cnt <= 0) {
v[2].push_back({mn, cnt});
} else {
v[3].push_back({mn, cnt});
}
}
auto no = [&]() {
cout << "No" << "\n";
exit(0);
};
if(sum != 0) no();
sum = 0;
for(auto p: v[0]) {
sum += p.second;
}
sort(all(v[1]), greater<pair<int, int>>());
for(auto p: v[1]) {
if(sum + p.first < 0) no();
sum += p.second;
}
sum = 0;
for(auto p: v[2]) {
sum += -p.second;
}
sort(all(v[3]), [&](pair<int, int> p1, pair<int, int> p2) {
if(p1.first == p2.first) {
return p1.second < p2.second;
}
return p1.first-p1.second > p2.first-p2.second;
});
for(auto p: v[3]) {
if(sum + p.first-p.second < 0) no();
sum += -p.second;
}
cout << "Yes" << "\n";
return 0;
}
| 0 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
#define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
#define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 2e3+10;
LL dp1[SIZE][SIZE],dp2[SIZE][SIZE];
void pre(){
dp1[0][0]=1;
REPP(i,1,SIZE){
LL now=0;
REP(j,SIZE){
ADD(now,dp1[i-1][j]);
dp1[i][j]=now;
}
}
dp2[0][0]=1;
REPP(i,1,SIZE){
LL now=0;
REP(j,SIZE){
ADD(now,dp2[i-1][j]*2);
dp2[i][j]=now-dp2[i-1][j];
if(dp2[i][j]<0)dp2[i][j]+=MOD;
}
}
}
int main(){
MOD=998244353;
pre();
int K,N;
R(K,N);
VL res;
FOR(i,2,K+1){
int n2=(i-1)/2;
int n1=K-n2*2-(1-i%2);
LL me=0;
if(i&1){
FOR(k,0,N)ADD(me,dp1[n1][k]*dp2[n2][N-k]);
}
else{
FOR(k,0,N)ADD(me,dp1[n1][k]*dp2[n2][N-k]);
FOR(k,0,N-1)ADD(me,dp1[n1][k]*dp2[n2][N-1-k]);
}
res.PB(me);
}
for(int i=SZ(res)-2;i>=0;i--)res.PB(res[i]);
for(auto x:res)W(x);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, int> lli;
const int Maxn = 100005;
const int Maxm = 524288;
int n, x;
int b[Maxn], l[Maxn], u[Maxn];
lli seq[Maxn];
ll cur;
ll st[Maxm], cnt[Maxm];
ll res;
ll Get(int ind, int y)
{
if (y <= b[ind]) return ll(l[ind]) * y;
return ll(y - b[ind]) * u[ind] + ll(l[ind]) * b[ind];
}
void Union(int v)
{
st[v] = st[2 * v] + st[2 * v + 1];
cnt[v] = cnt[2 * v] + cnt[2 * v + 1];
}
void Create(int v, int l, int r)
{
if (l == r) { st[v] = seq[l].first; cnt[v] = 1; }
else {
int m = l + r >> 1;
Create(2 * v, l, m);
Create(2 * v + 1, m + 1, r);
Union(v);
}
}
void Update(int v, int l, int r, int x, bool add)
{
if (l == r)
if (add) { st[v] = seq[l].first; cnt[v] = 1; }
else st[v] = cnt[v] = 0;
else {
int m = l + r >> 1;
if (x <= m) Update(2 * v, l, m, x, add);
else Update(2 * v + 1, m + 1, r, x, add);
Union(v);
}
}
lli Get(int v, int l, int r, ll val)
{
if (val >= 0) return lli(0, 0);
else if (l == r) return lli(st[v], cnt[v]);
else {
lli res = lli(0, 0);
int m = l + r >> 1;
if (val + st[2 * v + 1] >= 0)
return Get(2 * v + 1, m + 1, r, val);
else {
res = lli(st[2 * v + 1], cnt[2 * v + 1]);
lli got = Get(2 * v, l, m, val + st[2 * v + 1]);
res.first += got.first; res.second += got.second;
return res;
}
}
}
int main()
{
scanf("%d %d", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &b[i], &l[i], &u[i]);
cur -= ll(b[i]) * l[i];
seq[i] = lli(ll(b[i]) * l[i] + ll(x - b[i]) * u[i], i);
}
res = ll(n) * x;
sort(seq, seq + n);
Create(1, 0, n - 1);
for (int i = 0; i < n; i++) {
Update(1, 0, n - 1, i, false);
lli got = Get(1, 0, n - 1, cur + seq[i].first);
int lef = 0, rig = x;
while (lef <= rig) {
int mid = lef + rig >> 1;
if (cur + got.first + Get(seq[i].second, mid) >= 0)
rig = mid - 1;
else lef = mid + 1;
}
res = min(res, ll(x) * got.second + ll(rig + 1));
Update(1, 0, n - 1, i, true);
}
cout << res << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int N;
const int MAX_E=100;
int label[MAX_E];
priority_queue<int,vector<pair<int,pair<int,int> > >,greater<pair<int,pair<int,int> > > > pq;
int main(){
cin>>N;
REP(i,N)
label[i]=i;
REP(i,N){
REP(j,N){
int a;cin>>a;
if(a>=0&&i>j){
pq.push(make_pair(a,make_pair(i,j)));
}
}
}
int size=0;
while(!pq.empty()){
int cost=pq.top().first;
pair<int,int> e=pq.top().second;
//printf("%d,%d,%d\n",cost,e.first,e.second);
pq.pop();
if(label[e.first]!=label[e.second]){
int tmp=label[e.second];
size+=cost;
REP(i,N){
if(label[i]==tmp)
label[i]=label[e.first];
//printf("%d ",label[i]);
}
//printf("\n");
}
}
printf("%d\n",size);
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
using namespace std;
class MCMult
{
public:
vector<vector<int>> mat;
int solve();
};
int MCMult::solve()
{
int ms = mat.size();
vector<vector<int>> dp(ms, vector<int>(ms, 0));
for ( auto i = 0; i < ms - 1; ++i )
dp[i][i+1] = mat[i][0] * mat[i][1] * mat[i+1][1];
for ( auto k = 2; k < ms; ++k )
{
for ( auto i = 0; i + k < ms; ++i )
{
int ret = dp[i+1][i+k] + mat[i][0] * mat[i][1] * mat[i+k][1];
ret = min( ret, dp[i][i+k-1] + mat[i+k][0] * mat[i+k][1] * mat[i][0]);
for ( auto j = i + 1; j < i + k - 1; ++j )
{
ret = min( ret, dp[i][j] + dp[j+1][i+k] + mat[i][0] * mat[j][1] * mat[i+k][1]);
}
dp[i][i+k] = ret;
}
}
cout << dp[0][ms-1] << endl;
return 0;
}
int main()
{
int n;
cin >> n;
MCMult m;
for ( int i = 0; i < n; ++i )
{
int x;
vector<int> v;
cin >> x;
v.push_back( x );
cin >> x;
v.push_back( x );
m.mat.push_back( v );
}
m.solve();
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
#define endl "\n"
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll N,T;
string S;
cin >> T;
for(ll i=0;i<T;++i){
cin >> N;
vector<ll> A(N,0);
for(ll i=0;i<N;++i)cin>>A[i];
cin >> S;
vector<ll> nl={0};
bool ans=1;
for(ll j=N-1;j>=0;--j){
if(S[j]=='0'){
ll x=A[j];
for(auto p: nl)chmin(x,x^p);
for(auto p: nl)chmin(p,x^p);
if(x)nl.emplace_back(x);
}
else{
ll x=A[j];
for(auto p: nl)chmin(x,x^p);
if(x){ans=0;break;}
}
}
if(ans)prt(0)
else prt(1)
}
return 0;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=es[i].nxt,d=es[i].d)
using namespace std;
#define Pr(f,...) fprintf(stderr,f,##__VA_ARGS__),fflush(stderr)
typedef long long ll;
template<typename T>
void read(T &x){
x=0;
char c;
for(c=getchar();!isdigit(c);c=getchar());
for(;isdigit(c);c=getchar())x=x*10+c-'0';
}
const int N=205,P=1e9+7,L=62;
int mul(int a,int b){ return 1ll*a*b%P; }
//int add(int a,int b){ a+=b; return a>=P?a-P:a; }
int sub(int a,int b){ a-=b; return a<0?a+P:a; }
int gcd(int a,int b){ return !b?a:gcd(b,a%b); }
int n,T;
ll a[N],pr[L+2],bk[L+2],ans;
char s[N];
void add(ll *b,ll x){
dec(i,L,0){
if((x>>i)&1){
if(b[i])x^=b[i];
else {b[i]=x; break; }
}
}
}
bool test(ll *b,ll x){
dec(i,L,0)if((x>>i)&1){
x^=b[i];
}
return x==0;
}
bool equal(ll *b1,ll *b2){
dec(i,L,0)if(b1[i]){
if(!test(b2,b1[i]))return false;
}
return true;
}
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
freopen("d.in","r",stdin);
#endif
read(T);
while(T--){
read(n);
rep(i,1,n)read(a[i]);
scanf("%s",s+1);
ans=0;
mem(bk,0);
dec(i,n,1){
if(s[i]=='0')add(bk,a[i]);
else ans|=!test(bk,a[i]);
}
cout<<ans<<endl;
}
return 0;
}
| 1 |
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> Vint;
#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
signed main(void){
int i, j, k;
for(int testcase = 0;testcase >= 0;testcase++){
int2(n, m);
int a[n], cnt[n];
scn(n, a);
rep(i, n)cnt[i] = 0;
rep(i, m){
int(b);
rep(j, n)if(b >= a[j]){
cnt[j]++; break;
}
}
int ma = 0;
rep1(i, n)if(cnt[ma] < cnt[i])ma = i;
pri(ma + 1);
/*/
//*/ break;
}
return 0;
} | #include<iostream>
using namespace std ;
int main()
{
int n ;
int a ,b ,c ,d ;
cin >> n ;
int t[ 101 ] = { 0 } ;
for( int i = 0 ; i < n * ( n - 1 ) / 2 ; i++ )
{
cin >> a >> b >> c >> d ;
if( c == d )
{
t[ a ]++ ;
t[ b ]++ ;
continue ;
}
t[ c > d ? a : b ] += 3 ;
}
for( int i = 1 ; i <= n ; i++ )
{
int juni = 1 ;
for( int j = 1 ; j <= n ; j++ )
{
if( i == j )
continue ;
if( t[ i ] < t[ j ] )
{
juni++ ;
}
}
cout << juni << endl ;
}
return 0 ;
} | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <vector>
#include <functional>
using namespace std;
int main() {
while( true ) {
int n, m;
cin >> n >> m;
if ( n == 0 && m == 0 ) break;
vector<int> xs( n );
for ( int i = 0; i < n; i++ ) {
cin >> xs[ i ];
}
sort( xs.begin(), xs.end(), greater<int>() );
int sum = 0;
for ( int i = 0; i < n; i++ ) {
sum += ( (i + 1) % m == 0 ? 0 : xs[ i ] );
}
cout << sum << endl;
}
} | #include <cstdio>
int main(){
int n, p;
int x[50];
while(scanf("%d%d", &n, &p)){
if(n == 0 && p == 0) break;
for(int i = 0; i < n; i++) x[i] = 0;
int t = 0;
int q = p;
while(true){
if(p > 0){
x[t]++;
if(x[t] == q){
printf("%d\n", t);
break;
}
p--;
} else{
p += x[t];
x[t] = 0;
}
t++;
t %= n;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD
double dot(P a,P b){return real(conj(a)*b);};
double cross(P a,P b){return imag(conj(a)*b);};
int main(){
int n;
while(~scanf("%d",&n)){
if(n==0)break;
ll cur;
cin>>cur;
ll mx = cur;
while(--n){
ll x;
cin>>x;
cur = max(x,cur+x);
mx = max(mx,cur);
}
cout<<mx<<endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <vector>
//#define PI 3.141592653589
using namespace std;
int main()
{
int n;
int seisuu[5000];
int wa = 0;
int wa_max = -100001;
while (1)
{
wa_max = -100001;
cin >> n;
if (n == 0) break;
for (int i=0; i<n; i++)
{
cin >> seisuu[i];
}
for (int i=0; i<n; i++)
{
for (int j=i; j<n; j++)
{
wa += seisuu[j];
wa_max = max(wa_max, wa);
}
wa = 0;
}
cout << wa_max << endl;
/*
for (int i=0; i<n; i++)
{
cout << seisuu[i] << " ";
}
*/
}
return 0;
} | 1 |
#include <stdio.h>
int n, m, l, g, e;
int a[15], b[15];
int x[15][15], y[15][15];
int ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
for (int j = 0; j < a[i]; j++) {
scanf("%d%d", x[i] + j, y[i] + j);
x[i][j]--;
}
}
m = 1;
for (int i = 0; i < n; i++) {
m *= 2;
}
for (int i = 0; i < m; i++) {
l = i;
g = 1;
e = 0;
for (int j = 0; j < n; j++) {
b[j] = l % 2;
l /= 2;
e += b[j];
}
for (int j = 0; j < n; j++) {
if (b[j]) {
for (int k = 0; k < a[j]; k++) {
if (b[x[j][k]] != y[j][k]) {
g = 0;
}
}
}
}
if (g) {
if (ans < e)ans = e;
}
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<vector<pair<ll,ll>>> vec(N,vector<pair<ll,ll>>(0));
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
for(ll j=0;j<A;j++) {
ll x,y;
cin>>x>>y;
vec[x-1].push_back(make_pair(i+1,y));
}
}
ll ans=0;
for(ll tmp=0;tmp<(1<<N);tmp++) {
bitset<15> S(tmp);
bool a=true;
for(ll i=0;i<N;i++) {
ll k;
if(S.test(i)) {
k=1;
}
else {
k=0;
}
for(auto x:vec[i]) {
if(S.test(x.first-1)) {
if(x.second!=k) {
a=false;
}
}
}
}
if(a) {
ll sum=S.count();
ans=max(ans,sum);
}
}
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define P pair<int, int>
const int mod = 1e9+7;
inline int add(int a, int b) { int res = a + b; if(res >= mod) res -= mod; return res; }
inline int sub(int a, int b) { int res = a - b; if(res < 0) res += mod; return res;}
inline int mul(int a, int b) { return (a * b)%mod; }
int modpow(int a, int b) {
int ans = 1;
while(b) {
if(b%2) ans = mul(ans, a);
b /= 2; a = mul(a, a);
} return ans;
}
const int N = 1e5+5;
vector<P> g[N];
int n;
bool cmp1(pair<int, P> a, pair<int, P> b) {
return a.second.first < b.second.first;
}
bool cmp2(pair<int, P> a, pair<int, P> b) {
return a.second.second < b.second.second;
}
int MST() {
priority_queue<P, vector<P>, greater<P>> q;
int cost = 0;
q.push({0, 0});
bool mark[N]; memset(mark, 0, sizeof mark);
while(!q.empty()) {
P tp = q.top(); q.pop();
int cur = tp.second;
if(mark[cur]) continue;
cost += tp.first;
mark[cur] = 1;
for(auto ne : g[cur]) {
int node = ne.second;
if(mark[node] == false) q.push(ne);
}
}
return cost;
}
void solve() {
cin >> n;
pair<int, P> a[n];
for(int i=0; i<n; i++) {
P p; cin >> p.first >> p.second;
a[i] = make_pair(i, p);
}
sort(a, a+n, cmp1);
for(int i=1; i<n; i++) {
int d = a[i].second.first - a[i-1].second.first;
int u = a[i-1].first, v = a[i].first;
g[v].push_back({d, u});
g[u].push_back({d, v});
}
sort(a, a+n, cmp2);
for(int i=1; i<n; i++) {
int d = a[i].second.second - a[i-1].second.second;
int u = a[i-1].first, v = a[i].first;
g[u].push_back({d, v});
g[v].push_back({d, u});
}
cout << MST() << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(12);
int T = 1;
//cin >> T;
while(T--) {
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
inline void read(long long &x) {
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
inline void write(long long x) {
static const long long maxlen = 100;
static char s[maxlen];
if (x < 0) { putchar('-'); x = -x;}
if (!x) { putchar('0'); return; }
long long len = 0; for (; x; x /= 10) s[len++] = x % 10 + '0';
for (long long i = len - 1; i >= 0; --i) putchar(s[i]);
}
inline void read(int &x){
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
const long long MAXN =1001000;
long long n;
struct kt{
long long x,y;
long long id;
}a[ MAXN ];
long long fa[ MAXN ];
struct edge{
long long x,y,val;
}E[ MAXN*2 ];
bool cmp_x(kt A,kt B){
return A.x<B.x;
}
bool cmp_y(kt A,kt B){
return A.y<B.y;
}
bool cmp_e(edge A,edge B){
return A.val<B.val;
}
long long get_fa(long long x){
return (fa[x]==x)?(x):(fa[x]=get_fa(fa[x]));
}
int main(){
read(n);
for (long long i=1;i<=n;i++)
{
a[i].id=i;
read(a[i].x);read(a[i].y);
}
sort(a+1,a+n+1,cmp_x);
long long cnt=0;
for (long long i=1;i<n;i++)
{
++cnt;
E[cnt].x=a[i].id;
E[cnt].y=a[i+1].id;
E[cnt].val=a[i+1].x-a[i].x;
}
sort(a+1,a+n+1,cmp_y);
for (long long i=1;i<n;i++)
{
++cnt;
E[cnt].x=a[i].id;
E[cnt].y=a[i+1].id;
E[cnt].val=a[i+1].y-a[i].y;
}
for (long long i=1;i<=n;i++)
fa[i]=i;
sort(E+1,E+cnt+1,cmp_e);
long long ans=0;
for (long long i=1;i<=cnt;i++)
{
long long a=E[i].x,b=E[i].y;
long long x=get_fa(a),y=get_fa(b);
if ( x!=y )
{
ans+=E[i].val;
fa[x]=y;
}
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
const int N = 108;
int n;
int a[N], b[N];
int main() {
int i, mid;
scanf("%*d%d", &n);
for (i = 0; i < n; ++i) scanf("%d", a + i);
if (n == 1) return *a == 1 ? puts("1\n1\n1") : printf("%d\n2\n1 %d\n", *a, *a - 1), 0;
mid = std::partition(a, a + n, [] (const int x) -> bool {return x % 2;}) - a;
if (mid > 2) return puts("Impossible"), 0;
a[n] = *a;
for (i = 1; i <= n; ++i) printf("%d%c", a[i], i == n ? 10 : 32);
memcpy(b + 1, a + 1, n << 2), ++b[1], --b[n], n -= !b[n];
printf("%d\n", n);
for (i = 1; i <= n; ++i) printf("%d%c", b[i], i == n ? 10 : 32);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
void read(pp& x){ scanf("%d%d",&x.first, &x.second); }
void read(pll& x){ scanf("%lld%lld",&x.first, &x.second); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define sz(x) (int)(x).size()
int n, m;
vector<int> ao, ae;
void Answer(vector<int> A, vector<int> B){
vector<int> br;
for(int x:B) if(x) br.pb(x);
for(int x:A) printf("%d ", x); putchar(10);
printf("%d\n", sz(br));
for(int x:br) printf("%d ", x);
exit(0);
}
int main()
{
read(n, m);
rep(i, m){
int x; read(x);
if(x&1) ao.pb(x); else ae.pb(x);
}
if(ao.size() > 2u){
puts("Impossible"); return 0;
}
if(ao.size() == 0u){
if(ae.size() == 1u){
Answer(ae, {1, ae[0]-1});
} else {
vector<int> bt = ae;
bt[0]--; bt.back()++;
Answer(ae, bt);
}
} else if(ao.size() == 1u){
if(ae.size() == 0u){
Answer(ao, {1, ao[0]-1});
} else {
vector<int> a;
a.pb(ao[0]); a.insert(a.end(), all(ae));
vector<int> bt = a;
bt[0]--; bt.back()++;
Answer(a, bt);
}
} else if(ao.size() == 2u){
vector<int> a;
a.pb(ao[0]); a.insert(a.end(), all(ae)); a.pb(ao[1]);
vector<int> bt = a;
bt[0]--; bt.back()++;
Answer(a, bt);
}
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<ll> A(N),S(N+1);
for(int i=0;i<N;i++){
cin >> A[i];
S[i+1] = S[i]+A[i];
}
ll ans = 1e18;
auto sum = [&](int l,int r){
return S[r]-S[l];
};
int l = 1,r = 3;
for(int i=1;i<N;i++){
while(true){
ll s1 = abs(sum(l,0)-sum(i,l));
ll s2 = abs(sum(l+1,0)-sum(i,l+1));
if(s1>s2) l++;
else break;
}
while(true){
ll s1 = abs(sum(N,r)-sum(r,i));
ll s2 = abs(sum(N,r+1)-sum(r+1,i));
if(s1>s2) r++;
else break;
}
ll ma = max({sum(l,0),sum(i,l),sum(r,i),sum(N,r)});
ll mi = min({sum(l,0),sum(i,l),sum(r,i),sum(N,r)});
ans = min(ans,ma-mi);
}
cout << ans << endl;
} | #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>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
using vii = vector < ii >;
using vli = vector < li >;
using vpll = vector < pll >;
using vi3 = vector < i3 >;
using vlii = vector < lii >;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7;
const double eps = 1e-9 , PI = acos(-1);
int n , m;
void solve(int testCase){
double d , t , s;
scanf("%lf %lf %lf" , &d , &t , &s);
if(s * t >= d) {
printf("Yes\n");
}
else {
printf("No\n");
}
}
main(){
int t = 1;
// scanf("%d" , &t);
for(int testCase = 1 ; testCase <= t ; testCase ++){
solve(testCase);
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define repr(i, n, m) for (int i = (int)(n) - 1; i >= (int)(m); i--)
using namespace std;
using ll = int64_t;
const int MOD = 1000000007; // 10^9+7
int main() {
double n, m, d;
cin >> n >> m >> d;
double ans;
if (d == 0) {
ans = (m - 1) / n;
} else {
ans = 2 * (n - d) * (m - 1) / (n * n);
}
cout << fixed << setprecision(10) << ans << endl;
}
| 0 |
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
// 回文チェック関数
bool Pal(string a)
{
int size = a.length();
rep(i, size / 2) if (a[i] != a[size - i - 1]) return false;
return true;
}
int main()
{
int a, b, count = 0;
cin >> a >> b;
for (int i = a; i < b + 1; i++) if (Pal(to_string(i))) count++;
cout << count << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
//vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main()
{
int a, b, ma;
cin >> a >> b;
ma = max(a + b, a - b);
ma = max(ma, a * b);
cout << ma << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<double>; using vvd = vector<vd>;
#define REP(i,n) for(auto i = 0 * n; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define FOR(i,s,e) for (ll i = s; i < (ll)e; i++)
#define TEN(x) ((ll)1e##x)
class UnionFind {
typedef size_t U;
vector<int32_t> v;
public:
UnionFind(U n) : v(n, -1) {}
U find(U x) { return v[x] < 0 ? x : (v[x] = find((U)v[x])); }
bool same(U x, U y) { return find(x) == find(y); }
U size(U x) { return (U)-v[find(x)]; }
void unite(U x, U y) {
x = find(x); y = find(y);
if (x != y) {
if (-v[x] < -v[y]) swap(x, y);
v[x] += v[y];
v[y] = x;
}
}
};
struct Edge{ uint32_t to, id; };
typedef vector<vector<Edge>> Graph;
template<class T> struct Kruskal{
typedef uint32_t U;
template<class V> Kruskal(U n, const V & u, const V & v, const vector<T> & w) : g(n) {
vector<U> es(w.size());
iota(es.begin(), es.end(), 0);
sort(es.begin(), es.end(), [&](U i, U j) { return w[i] < w[j]; });
UnionFind uf(n);
for (U i : es) {
if (!uf.same(u[i], v[i])) {
uf.unite(u[i], v[i]); cost += w[i];
g[u[i]].push_back({ (U)v[i], i }); g[v[i]].push_back({ (U)u[i], i });
}
}
}
Graph g; T cost = 0;
};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(50);
ll n; cin >> n;
vl u, v, w;
REP(i, n) REP(j, n) {
ll x; cin >> x;
if (x != -1) {
u.push_back(i);
v.push_back(j);
w.push_back(x);
}
}
Kruskal<ll> mst(n, u, v, w);
cout << mst.cost << endl;
} | #include<bits/stdc++.h>
#define inf 10000000
using namespace std;
int main(){
int n,d[101][101],a[101],ans=0,c[101]={};
cin>>n;
for(int i=0;i<n;i++)a[i]=inf;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
cin>>d[i][j];
if(d[i][j]==-1)d[i][j]=inf;
}
a[0]=0;
int s=0;
while(1){
c[s]=1;
ans+=a[s];
int mn=inf,ns=-1;
for(int i=0;i<n;i++)
a[i]=min(a[i],d[s][i]);
for(int i=0;i<n;i++)
if(!c[i]&&a[i]<mn)ns=i,mn=a[i];
if(ns==-1)break;
s=ns;
}
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T> void operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) cin >> e; }
typedef long long ll;
int const inf = 1<<29;
int main() {
int M, N[2];
for(; cin >> M >> N[0] >> N[1] && M;) {
vector<int> vs(M); cin >> vs;
int maxgap = 0;
int maxnum = -1;
REP(num, N[0], N[1] + 1) {
if(maxgap <= vs[num - 1] - vs[num]) {
maxgap = vs[num - 1] - vs[num];
maxnum = num;
}
}
cout << maxnum << endl;
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOREQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPEQ(i, n) FOREQ(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
template <typename T> inline int size(const T& x) { return x.size(); }
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max, m | n_min | n_max) {
vector<int> P(m);
REP(i, m) cin >> P[i];
int max_gap = 0, ans = -1;
FOR(i, n_min-1, n_max) {
int gap = P[i] - P[i+1];
if (gap >= max_gap) {
max_gap = gap;
ans = i+1;
}
}
cout << ans << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
#define ABC 001
#define ARC 010
#define AGC 100
int main(void){
int r;
cin >> r;
int frag = AGC;
if(r < 1200){
frag |= ABC;
frag |= ARC;
}else if( r < 2800){
frag |= ARC;
}
if(frag & ABC)cout << "ABC" << endl;
else if(frag & ARC)cout << "ARC" << endl;
else cout << "AGC" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int r; cin >> r;
if(r < 1200){
cout << "ABC" << endl;
return 0;
}
else if(r < 2800){
cout << "ARC" << endl;
return 0;
}
else{
cout << "AGC" << endl;
return 0;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int table[2][100005] = {0};
for(int i=0; i<n; i++){
int v; cin >> v;
table[i%2][v]++;
}
vector<pair<int, int>> ruia, ruib;
for(int i=0; i<1e5+5; i++){
if(table[0][i]) ruia.push_back({table[0][i], i});
if(table[1][i]) ruib.push_back({table[1][i], i});
}
sort(ruia.rbegin(), ruia.rend());
sort(ruib.rbegin(), ruib.rend());
long ans = 0;
if(ruia[0].second == ruib[0].second){
if(ruia.size() == 1 && ruib.size() == 1)
ans = n / 2;
else if(ruia.size() == 1)
ans = n/2 - ruib[1].first;
else if(ruib.size() == 1)
ans = n/2 - ruia[1].first;
else
ans = min(n/2-ruib[0].first+n/2-ruia[1].first, n/2-ruia[0].first+n/2-ruib[1].first);
}else{
ans = n/2-ruia[0].first + n/2-ruib[0].first;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
#define int ll
const ll MOD = 998244353;
ll cal(int a, int r){
int p = 1;
rep(i,r){
p*=a;
p%=MOD;
}
return p;
}
main(){
int n;
cin>>n;
map<int,int> mp;
int bottom=0;
bool corner=0;
rep(i,n){
int d;
cin>>d;
if(i==0 && d!=0) corner=1;
if(i!=0 && d==0) corner=1;
mp[d]++;
bottom=max(bottom,d);
}
if(corner) cout<<0<<endl;
else{
ll ans=1;
for(int i = 1; i <= bottom; i++){
if(mp[i]==0){
cout<<0<<endl;
return 0;
}
ans *= cal(mp[i-1],mp[i]);
ans%=MOD;
}
cout<<ans<<endl;
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int n, p, ans;
long long sum[100005], top, d, m, v, a[100005];
bool cmp(int a, int b) { return a > b; }
int main() {
cin>>n>>m>>v>>p;
v = n - v;
top = v*m;
for(int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + n + 1, cmp);
for(int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + a[i];
ans = p;
for(int i = p + 1; i <= n; i++) {
d = sum[i - 1] - sum[p - 1] - a[i]*(long long)(i - p);
if(d > top) continue;
if(a[p] - a[i] > m) continue;
ans++;
}
cout<<ans<<endl;
}
| #include <vector>
#include <iostream>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int n, bit[262145];
vector<int> a, b;
void add(int i, int x)
{
while (i <= n)
{
bit[i] += x; i += i & -i;
}
}
int sum(int i)
{
int ret = 0;
while (i > 0)
{
ret += bit[i]; i -= i & -i;
}
return ret;
}
int sum(int l, int r)
{
return sum(r - 1) - sum(l - 1);
}
int main()
{
scanf("%d", &n);
a.resize(n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
b = a; sort(b.begin(), b.end());
long long ret = 0;
for (int i = 0; i < n; i++)
{
int ptr = lower_bound(b.begin(), b.end(), a[i]) - b.begin(); add(ptr + 1, 1);
ret += sum(ptr + 2, n + 1);
}
printf("%lld\n", ret);
return 0;
} | 0 |
#include <iostream>
#include <vector>
std::vector<int> BIT;//その位置までの良い石の数の区間和
std::vector<int> color;
std::vector<int> right;//色番号ごとの良い石の場所
int RegionSum(int l,int r);
int getSum(int r);
void addBIT(int idx,int value);
int main(){
int N,Q;
std::cin >> N >> Q;
BIT.resize(N+1,0);
color.resize(N+1,0);
right.resize(N+1,-1);
for(int i=1;i<=N;i++){
std::cin >> color[i];
}
std::vector<std::vector<int>> QueryL_(N+1);
std::vector<std::vector<int>> QueryID(N+1);
for(int i=0;i<Q;i++){
int l,r;
std::cin >> l >> r;
QueryID[r].push_back(i);
QueryL_[r].push_back(l);
}
std::vector<int> ans(Q);
//BITの更新と答えの取得。BITは左から順番にi番目を更新していき更新するごとにiを右端とするクエリの答えを取得する
for(int i=1;i<=N;i++){
//BITの更新
if(right[color[i]] != -1)
addBIT(right[color[i]],-1);//すでにcolor[i]の良い石がある場合は前回までの良い石の位置までのBITを1減らす
right[color[i]] = i;
addBIT(i,1);
//クエリごとの答えの取得
for(int j=0;j<QueryL_[i].size();j++){
ans[QueryID[i][j]] = RegionSum(QueryL_[i][j],i);//QueryL_[i][j]:区間右側をiとするクエリ集合のj番目のクエリのl
}
}
for(int i=0;i<Q;i++){
std::cout << ans[i] << std::endl;
}
return 0;
}
int RegionSum(int l,int r){
return getSum(r) - getSum(l-1);
}
int getSum(int r){
int Sum=0;
for(int i=r;i>0;i-=i&(-i)){
Sum += BIT[i];
}
return Sum;
}
void addBIT(int idx,int value){
for(int i=idx;i<=BIT.size()-1;i+=i&(-i)){
BIT[i] += value;
}
return;
} | #include<bits/stdc++.h>
using namespace std;
#define N 15
int n,m,sum,d[N][1<<N],e[1<<N],f[1<<N][N];
void upd(int &x,int y){x=max(x,y);}
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
n=read();m=read();
for (int i=1;i<=m;i++){
int x=read()-1,y=read()-1;
d[x][1<<y]=d[y][1<<x]=read();
sum+=d[x][1<<y];
}
for (int i=0;i<n;i++)
for (int j=1;j<(1<<n);j++)
d[i][j]=d[i][j&-j]+d[i][j-(j&-j)];
for (int i=0;i<(1<<n);i++)
for (int j=0;j<n;j++)
if (i&(1<<j))
e[i]=e[i-(1<<j)]+d[j][i-(1<<j)];
memset(f,0x80,sizeof(f));f[1][0]=0;
for (int i=1;i<(1<<n);i++)
for (int j=0;j<n;j++)
if (f[i][j]!=-1){
for (int k=0;k<n;k++)
if ((i&(1<<k))==0&&d[j][1<<k])
upd(f[i+(1<<k)][k],f[i][j]+d[j][1<<k]);
for (int s=(1<<n)-1-i,k=s;k;k=(k-1)&s)
upd(f[i+k][j],f[i][j]+e[k+(1<<j)]);
}
printf("%d\n",sum-f[(1<<n)-1][n-1]);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n,k;
cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n,greater<int>());
int result{};
for(int i=0;i<k;i++)
result += arr[i];
cout<<result;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k,x; cin>>k>>x; k--;
for(int i=x-k;i<=x+k;i++) cout<<i<<" ";
} | 0 |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const int N = 2e6 + 5;
struct ed{
int to, nxt;
}e[N << 1];
int head[N], tot = 1;
void add(int u, int v){
e[tot].to = v, e[tot].nxt = head[u], head[u] = tot++;
}
int n, s, t, dep[N], mx[N], fa[N], ans, tp;
void dfs(int x, int last){
fa[x] = last;
dep[x] = dep[last] + 1;
mx[x] = dep[x];
for (int i = head[x]; i; i = e[i].nxt){
int v = e[i].to;
if (v == last) continue;
dfs(v, x);
mx[x] = max(mx[x], mx[v]);
}
}
int main()
{
scanf("%d%d%d", &n, &s, &t);
for (int i = 0; i < n - 1; i++){
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
dfs(t, 0);
t = 1;
ans = (dep[s] - dep[t]) >> 1;
while (true){
if (dep[s] <= t) break;
if ((dep[s] - dep[t]) & 1)
ans = max(ans, mx[s] - t - 1 + tp);
else
ans = max(ans, mx[s] - t - 1 + tp);
s = fa[s];
t++;
tp++;
}
printf("%d\n", ans);
} | #pragma GCC optimize("O3")
//#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#define io_init cin.tie(0);ios::sync_with_stdio(0);cout<<setprecision(20)
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
int N;
cin >> N;
vector<vector<pair<int, int>>> person(N, vector<pair<int, int>>());
for (int i = 0; i < N; i++) {
int A;
cin >> A;
for (int j = 0; j < A; j++) {
int x, y;
cin >> x >> y;
x--;
person[i].push_back({ x,y });
}
}
int ans = 0;
//bitが立っている人が正直
for (int i = 0; i < (1 << N); i++) {
bool flag = true;
int cnt = 0;
for (int j = 0; j < N; j++) {
if ((i & (1 << j)) == 0)continue;
cnt++;
for (int k = 0; k < person[j].size(); k++) {
if (((i & (1 << person[j][k].first)) != 0) != person[j][k].second)flag = false;
}
}
if (flag)ans = max(ans, cnt);
}
cout << ans << endl;
} | 0 |
#include<iostream>
using namespace std;
bool search(int);
int q,T[500];
int main(){
int n,S[10000],counter=0;
cin >>n;
for(int i=0 ; i < n ; i++)cin >>S[i];
cin >>q;
for(int i=0 ; i < q ; i++)cin >>T[i];
for(int i=0 ; i < n ; i++)counter+=search(S[i]);
cout <<counter<<endl;
return 0;
}
bool search(int s){
for(int i=0 ; i < q ; i++){
if( s == T[i] ){
T[i]=-1;
return 1;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin>>H>>W;
queue<int>A;
queue<int>B;
int ans=0;
vector<vector<char>>C(H+2,vector<char>(W+2,'#'));
for(int i=1;i<=H;i++){
string S;cin>>S;
for(int j=1;j<=W;j++){C[i][j]=S.at(j-1);if(C[i][j]=='#'){ans++;}}
}
A.push(1);
B.push(1);
vector<vector<bool>>Z(H,vector<bool>(W,false));
Z[0][0]=true;
int count=1;
for(int i=2;;i++){
int z=count;
count=0;
for(int j=0;j<z;j++){
if(C[A.front()+1][B.front()]=='.'&&!Z[A.front()][B.front()-1]){count++;Z[A.front()][B.front()-1]=true;A.push(A.front()+1);B.push(B.front());if(A.front()+1==H&&B.front()==W){cout<<H*W-ans-i<<endl;return 0;}}
if(C[A.front()-1][B.front()]=='.'&&!Z[A.front()-2][B.front()-1]){count++;Z[A.front()-2][B.front()-1]=true;A.push(A.front()-1);B.push(B.front());if(A.front()-1==H&&B.front()==W){cout<<H*W-ans-i<<endl;return 0;}}
if(C[A.front()][B.front()+1]=='.'&&!Z[A.front()-1][B.front()]){count++;Z[A.front()-1][B.front()]=true;A.push(A.front());B.push(B.front()+1);if(A.front()==H&&B.front()+1==W){cout<<H*W-ans-i<<endl;return 0;}}
if(C[A.front()][B.front()-1]=='.'&&!Z[A.front()-1][B.front()-2]){count++;Z[A.front()-1][B.front()-2]=true;A.push(A.front());B.push(B.front()-1);if(A.front()==H&&B.front()-1==W){cout<<H*W-ans-i<<endl;return 0;}}
A.pop();B.pop();
}
if(count==0){cout<<-1<<endl; return 0;}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 99999;
int main(){
int n,array[100][100];
cin>>n;
for(int i=0; i<n; i++){
fill(array[i],array[i]+n,INF);
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
int tmp;
cin>>tmp;
if(tmp!=-1) array[i][j]=tmp;
}
}
int ans=INF;
for(int k=0; k<n; k++){
bool flag[100];
fill(flag,flag+n,false);
flag[k]=true;
int tmp=0;
while(1){
int u=-1,minv=INF;
for(int i=0; i<n; i++){
if(!flag[i]) continue;
for(int j=0; j<n; j++){
if(!flag[j] && array[i][j]<=minv){
minv = array[i][j];
u = j;
}
}
}
if(minv==INF){
break;
}else{
tmp += minv;
flag[u]=true;
}
}
ans = min(ans,tmp);
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ar[n];
int count=0;
for(int i=0;i<n;i++){
cin>>ar[i];
}
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
for(int k=j+1;k<n;k++){
if(ar[i]+ar[j]>ar[k] && ar[i]+ar[k]>ar[j] && ar[j]+ar[k]>ar[i] && ar[i]!=ar[j] && ar[j]!=ar[k] && ar[i]!=ar[k]){
count++;
}
}
}
}
cout<<count;
return 0;
} | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
#include<climits>
#include<stack>
#include<queue>
#include<cmath>
#define int long long
#define INF 100000000000
#define EPS 0.0000000001
using namespace std;
signed main() {
int n, m;
int a[1010], b[1010];
int ans[1010] = { 0 };
int vote = -1;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (a[j] <= b[i]) {
ans[j]++;
//cout << j + 1 << endl;
break;
}
}
}
int temp = 0;
for (int i = 0; i < n; i++) {
//for (int j = 0; j < n; j++) {
//cout << ans[i] << " " << endl;
if (temp < ans[i]) {
//cout << "[" << i << "]" << endl;
temp = ans[i];
vote = i;
}
//}
}
cout << vote + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#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 range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 24;
int main(void){
for(int n, m; cin >> n >> m;){
vi a(n); for(auto && aa : a) cin >> aa;
vi b(m); for(auto && bb : b) cin >> bb;
vi v(n);
for(int bb : b){
rep(i, n){
if(a[i] <= bb){
v[i]++;
break;
}
}
}
cout << max_element(all(v)) - v.begin() + 1 << endl;
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
//#define int long long
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
typedef complex<ld> com;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n, m, q;
cin >> n >> m >> q;
vector<string> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> sum(n + 1, vector<int>(m + 1));
vector<vector<int>> sum2(n + 1, vector<int>(m + 1));
vector<vector<int>> sum3(n + 1, vector<int>(m + 1));
rep(i, n) {
rep(j, m) {
sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j];
sum2[i + 1][j + 1] = sum2[i + 1][j] + sum2[i][j + 1] - sum2[i][j];
sum3[i + 1][j + 1] = sum3[i + 1][j] + sum3[i][j + 1] - sum3[i][j];
if (a[i][j] == '1') sum[i + 1][j + 1]++;
if (i != 0 && a[i - 1][j] == '1'&&a[i][j] == '1') sum2[i + 1][j + 1]++;
if (j != 0 && a[i][j - 1] == '1'&&a[i][j] == '1') sum3[i + 1][j + 1]++;
}
}
rep(_, q) {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
x1--; y1--;
int ans = sum[x1][y1] + sum[x2][y2] - sum[x1][y2] - sum[x2][y1];
ans -= sum2[x1 + 1][y1] + sum2[x2][y2] - sum2[x1 + 1][y2] - sum2[x2][y1];
ans -= sum3[x1][y1 + 1] + sum3[x2][y2] - sum3[x1][y2] - sum3[x2][y1 + 1];
cout << ans << '\n';
}
} | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
UL S[2001][2001] = {};
UL J1[2001][2001] = {};
UL J2[2001][2001] = {};
void Query() {
UL y1, y2, x1, x2; cin >> y1 >> x1 >> y2>> x2;
y1--; x1--;
UL mass = S[x2][y2] + S[x1][y1] - S[x1][y2] - S[x2][y1];
UL J1s = J1[x2][y2] + J1[x1 + 1][y1] - J1[x1 + 1][y2] - J1[x2][y1];
UL J2s = J2[x2][y2] + J2[x1][y1 + 1] - J2[x1][y2] - J2[x2][y1 + 1];
cout << (mass - J1s - J2s) << endl;
}
void Solve() {
UL H, W; cin >> H >> W;
UL Q; cin >> Q;
rep(y, H) rep(x, W) {
char c; cin >> c;
S[x + 1][y + 1] = (c - '0');
}
rep(y, H) rep(x, W) if (S[x][y + 1] && S[x + 1][y + 1]) J1[x + 1][y + 1] = 1;
rep(y, H) rep(x, W) if (S[x + 1][y] && S[x + 1][y + 1]) J2[x + 1][y + 1] = 1;
rep(y, H) rep(x, W) S[x + 1][y + 1] += S[x][y + 1];
rep(y, H) rep(x, W) S[x + 1][y + 1] += S[x + 1][y];
rep(y, H) rep(x, W) J1[x + 1][y + 1] += J1[x][y + 1];
rep(y, H) rep(x, W) J1[x + 1][y + 1] += J1[x + 1][y];
rep(y, H) rep(x, W) J2[x + 1][y + 1] += J2[x][y + 1];
rep(y, H) rep(x, W) J2[x + 1][y + 1] += J2[x + 1][y];
rep(i, Q) Query();
}
Problem();
};
int main() {
unique_ptr<Problem> p(new Problem());
p->Solve();
return 0;
}
Problem::Problem() {
cout << fixed << setprecision(10);
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x,y,z;
while(cin>>x>>y>>z)
{
cout<<z<<' '<<x<<' '<<y<<' '<<endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
void abc_160a();
void abc_161a();
int main()
{
//abc_160a();
abc_161a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a = b;
b = tmp;
}
void abc_161a()
{
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z << "\n";
}
| 1 |
#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()
int n;
vector <long long> L;
void solve(){
sort(all(L));
int ans = 0;
for(int i=0; i<=n-3; i++){
for(int j=i+1; j<=n-2; j++){
for(int k=j+1; k<=n-1; k++){
if(L[i] != L[j] && L[j] != L[k]){
if(L[k] < L[i] + L[j]){
ans ++;
}
}
}
}
}
cout << ans << endl;
}
int main(){
cin >> n;
rep(i,n){
int l;
cin >> l;
L.push_back(l);
}
solve();
}
| #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> a(N+1,0);
for(int i = 1;i < N + 1;i++){
cin >> a.at(i);
}
vector<bool> b(N + 1,false);
long long M = 0;
for(long long i = N;i >= 1;i--){
long long c = 0;
for(long long j = 2*i;j <= N;j+= i){
c += b.at(j);
}
b.at(i) = (c % 2 != a.at(i));
M += b.at(i);
}
cout << M << endl;
for(int i = 1;i < N + 1;i++){
if(b.at(i)){
cout << i << " ";
}
}
cout << endl;
}
/*
int main(){
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N+1);
for(int i = 0;i < N;i++){
cin >> a.at(i);
b.at(i) = 0;
}
b.at(N+1) = 0;
int M = 0;
/*for(int i = N - 1;i >= 0;i--){
int count = 0;
for(int j = i;j < N;j++){
count += b.at(j);
}
if(count%2 != a.at(i)){
b.at(i) = abs(a.at(i) - count);
M ++;
}
}
for(int i = N - 1;i >= 0;i--){
int count = 0;
for(int j = 2*i;j <= N;j+=i){
count += b.at(j);
}
if(count%2 != a.at(i)){
b.at(i) = abs(a.at(i) - count);
M ++;
}
}
cout << M << endl;
if(M != 0){
for(int i = 0;i < N;i++){
if(b.at(i) != 0){
cout << i + 1 << " ";
}
}
cout << endl;
}
}
*/
| 0 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, a;
cin >> N;
a=(N-N%111)/111;
if (N%111==0) {
cout << N << endl;
}
else {
cout << 111*(a+1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
long long n,i;
int main()
{
cin >> n;
for(i=111; i<=999; i+=111)
if(i>=n) {
cout<<i<<endl;
break;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin>>A>>B;
int sum=0;
for(int i=A;i<=B;i++){
if((i%10==i/10000)&&((i%100)/10==(i/1000)%10)){
sum+=1;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
int a,b,num = 0;
cin >> a >> b;
for(int i = 0; a <= b; i++) {
bool flag = 0;
string s = to_string(a);
int n = s.size();
for(int j = 0; j < double(n/2); j++) {
if(s[j] == s[n-1-j])
flag = 1;
else {
flag = 0;
break;
}
}
if(flag) num++;
a++;
}
cout << num << endl;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <numeric>
#include <algorithm>
using namespace std;
int N, Q;
int main() {
while(cin >> N >> Q, N||Q){
int num[101];
for(int i=0; i<101; ++i) num[i]=0;
for(int i=0; i<N; ++i){
int M; cin >> M;
for(int j=0; j<M; ++j){
int a; cin >> a;
num[a]++;
}
}
bool ok=false;
int maxV = 0;
int ans=0;
for(int i=0; i<101; ++i){
if(num[i]>=Q){
if(maxV<num[i]) {
ans = i;
maxV = num[i];
}
ok =true;
}
}
if(!ok) cout << 0 << endl;
else cout << ans << endl;
}
return 0;
}
| #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
scanf("%d",&l);
++Date[l];
}
}
}
l=0;
i=0;
for(k=0;k<100;k++){
if(i<Date[k] && Date[k]>=Q){
i=Date[k];
l=k;
}
}
printf("%d\n",l);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const ll MMM = -1e18;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin >> n;
int a[n];
for (int i=0; i<n; i++) cin >> a[i];
int m = n/2;
if (n&1) {
ll ans = MMM;
vector<ll> suff(m+1), pref(m+1), best_suff(m+1);
// both end case
for (int i=0; i<m; i++) {
pref[i+1] = pref[i] + a[2*i];
}
for (int i=m-1; i>=0; i--) {
suff[i] = suff[i+1] + a[2*i+2];
}
// single 3-jump
for (int i=0; i<=m; i++) {
ans = max(ans, pref[i] + suff[i]);
}
// double 2-jump
for (int i=m-1; i>=0; i--) {
// best_suff[i] = max(best_suff[i+1] + a[i*2+1], suff[i+1] + a[i*2+1]);
best_suff[i] = max(best_suff[i+1], suff[i+1]) + a[i*2+1];
}
bool dbg = false;
if (dbg) {
cout << "PREF "; for (ll x : pref) cout << x << ' '; cout << '\n';
cout << "SUFF "; for (ll x : suff) cout << x << ' '; cout << '\n';
cout << "BEST "; for (ll x : best_suff) cout << x << ' '; cout << '\n';
}
ll best_pref = 0;
ans = max(ans, best_suff[0]);
for (int i=0; i<m; i++) {
best_pref = max(best_pref, pref[i]) + a[i*2+1];
ans = max(ans, best_pref + best_suff[i+1]);
}
// ans = max(ans, max(best_pref, pref[
// one end case
// should have covered by double 2-jump
// neither end case
ll tmp = 0;
for (int i=0, idx=1; i<m; i++, idx+=2) tmp += a[idx];
ans = max(ans, tmp);
cout << ans;
}
else {
vector<ll> suff(m+1);
for (int i=m-1; i>=0; i--) {
suff[i] = suff[i+1] + a[2*i+1];
}
ll ans = suff[0];
ll pref = 0;
for (int i=0; i<m; i++) {
pref += a[i*2];
ans = max(ans, pref + suff[i+1]);
}
cout << ans;
}
} | #include <iostream>
using namespace std;
const long long OO = (long long) 1e18;
const int N = 200008;
int n;
long long a[N];
long long dp[N][3];
// dp[i][j] is maximum possible sum choosing (i+1-j)/2 elements from first i
// elements. This is NOT a floor! So half the dp elements will be impossible
// solely because it's impossible to choose half an element.
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0][0] = -OO;
dp[0][1] = 0;
dp[0][2] = -OO;
dp[1][0] = a[0];
dp[1][1] = -OO;
dp[1][2] = 0;
for (int i = 2; i <= n; i++) {
// note that we are computing dp[i] using a[i-1] and dp[i-1]
for (int j = 0; j < 3; j++) {
// take a[i-1]
dp[i][j] = dp[i-2][j] + a[i-1];
if (j) {
// we have slack; don't take a[i-1]
dp[i][j] = max(dp[i][j], dp[i-1][j-1]);
}
}
}
cout << dp[n][n % 2 == 0 ? 1 : 2];
} | 1 |
#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()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vll = vector<ll>;
using vvll = vector<vll>;
int main()
{
int H, W,inf=100000000,ans=0;
cin>>H>>W;
vvc field(H, vc(W));
vvi d(H, vi(W, inf));
queue<PAIR> que;
rep(i,H)
{
rep(j,W)
{
cin >> field[i][j];
if (field[i][j]=='#')
{
que.push(PAIR(i, j));
d[i][j] = 0;
}
}
}
while(que.size())
{
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
PAIR p = que.front();
que.pop();
rep(i, 4)
{
int nx = p.first + dx[i], ny = p.second + dy[i];
if(0<=nx&&nx<H&&0<=ny&&ny<W&&field[nx][ny]=='.'&&d[nx][ny]==inf)
{
d[nx][ny] = d[p.first][p.second] + 1;
que.push(PAIR(nx, ny));
ans = max(ans, d[nx][ny]);
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long n, m;
while (scanf("%lld %lld", &n, &m), n){
long long p[1024];
for (int i = 0; i < n; i++) scanf("%lld", p + i);
p[n++] = 0;
vector<long long> score;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (!binary_search(score.begin(), score.end(), p[i] + p[j])) score.push_back(p[i] + p[j]);
}
}
sort(score.begin(), score.end());
score.erase(unique(score.begin(), score.end()), score.end());
long long maxi = 0;
for (auto i : score){
if (i > m) continue;
maxi = max(maxi, min(*(upper_bound(score.begin(), score.end(), m - i) - 1) + i, m));
}
printf("%lld\n", maxi);
}
return 0;
} | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
typedef pair<LL,int> LP;
const int INF=1<<30;
void array_show(int *a,int n){
for(int i=0;i<n;i++)printf("%d%c",a[i],(i!=n-1?' ':'\n'));
}
void array_show(LL *a,int n){
for(int i=0;i<n;i++)printf("%lld%c",a[i],(i!=n-1?' ':'\n'));
}
int t[100005];
int bef[100005];
bool used[100005];
vector<int> path_rev[100005];
vector<int> v1;
vector<P> v2;
void check(int a,int m){
v1.push_back(a);
if(v1.size()>=m){
bef[a]=v1[v1.size()-m];
}
v2.push_back(make_pair(v1.size()-1,a));
for(int i=0;i<path_rev[a].size();i++){
check(path_rev[a][i],m);
}
v1.pop_back();
}
void set_used(int a){
if(used[a])return;
used[a]=true;
for(int i=0;i<path_rev[a].size();i++){
set_used(path_rev[a][i]);
}
}
int main(){
int n,m;
int i,j,k;
int a,b,c;
int s=0;
cin>>n>>m;
memset(t,-1,sizeof(t));
for(i=0;i<n;i++){
cin>>t[i];
t[i]--;
if(i==0){
if(t[i]!=0)s++;
continue;
}
path_rev[t[i]].push_back(i);
}
check(0,m);
sort(v2.rbegin(),v2.rend());
for(i=0;i<n;i++){
if(v2[i].first<=m)break;
j=v2[i].second;
if(used[j])continue;
s++;
set_used(bef[j]);
}
cout<<s<<endl;
return 0;
}
| /* be name khoda */
// #define stream_enable
#define long_enable
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <queue>
// #include <bits/stdc++.h>
// #include <numeric>
// #include <iomanip>
// #include <cmath>
// #include <bitset>
// #include <fstream>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<vi> vii;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460LL;
const int Big = 336860180;
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define debug(x) cout << #x << " -> " << (x) << endl;
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl;
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl;
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl;
#define debugp(x) cout << #x << " -> " << "(" << (x).ff << ", " << (x).ss << ")" << endl;
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].ff << ", " << (x)[i1_dap].ss << ")" << endl; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_da].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl
#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD
stringstream sss;
// -----------------------------------------------------------------------
const ll maxn = 100010;
ll n, k;
vi subt[maxn];
ll H[maxn];
ll ans = 0;
ll dfs(ll x) {
ll mx = 0;
for (auto y : subt[x]) {
H[y] = H[x] + 1;
smax(mx, dfs(y));
}
if (mx == k - 1 && H[x] > 1) {
++ans;
return 0;
} else {
return mx + 1;
}
}
void MAIN() {
cin >> n >> k;
ll p;
cin >> p;
ans += p != 1;
fori (i, n - 1) {
ll p;
cin >> p;
subt[p - 1].pb(i + 1);
}
dfs(0);
cout << ans << '\n';
}
// -----------------------------------------------------------------------
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(10);
sss << R"(
8 2
4 1 2 3 1 2 3 4
)";
MAIN();
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf_char=vector<vector<char>>;
using Graf_int=vector<vector<int>>;
#define MAX 100000
int main()
{
int n,m;
cin >> n >> m;
vector<int> s(m),c(m);
rep(i,m){
cin >> s[i] >> c[i];
}
vector<int> num(n,-1);
rep(i,m){
if(num[s[i]-1]!=-1){
if(num[s[i]-1]!=c[i]){
cout << -1 << endl;
return 0;
}
}
else{
num[s[i]-1]=c[i];
if(s[i]-1==0&&c[i]==0&&n>1){
cout << -1 << endl;
return 0;
}
}
}
rep(i,n){
if(n>1&&i==0&&num[i]==-1){
cout << 1;
}else if(num[i]==-1){
cout << 0;
}else{
cout << num[i];
}
}
cout << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int counter = 0; counter < (int)(n); counter++)
#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++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(obj) obj.begin(), obj.end()
#define from1(obj) obj.begin() + 1, obj.end()
#define db(x) cerr << #x << ":" << (x) << " "
#define dbl(x) cerr << #x << ":" << (x) << "\n"
#define db2(x, y) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << " "
#define db2l(x, y) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << "\n"
#define dbl2(x, y) cerr << #x << ":" << (x) << "\n" << #y << ":" << (y) << "\n"
#define db3(x, y, z) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << " " << #z << ":" << (z) << " "
#define db3l(x, y, z) cerr << #x << ":" << (x) << ", " << #y << ":" << (y) << ", " << #z << ":" << (z) << "\n"
#define dbl3(x, y, z) cerr << #x << ":" << (x) << "\n" << #y << ":" << (y) << "\n" << #z << ":" << (z) << "\n"
#define dbp(p) cerr << #p << ":(" << p.first << ", " << p.second << ") "
#define dbpl(p) cerr << #p << ":(" << p.first << ", " << p.second << ")\n"
#define dbt3(t3) cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " << get<2>(t3) << ") "
#define dbt3l(t3) cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " << get<2>(t3) << ")\n"
#define dbt4(t4) cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " << get<2>(t4) << ", " << get<3>(t4) << ") "
#define dbt4l(t4) cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " << get<2>(t4) << ", " << get<3>(t4) << ")\n"
#define dbv(vec) cerr << #vec << ":{ "; for (auto e : vec) cerr << e << ", "; cerr << "}\n"
#define dbvp(vec) cerr << #vec << ":{ "; for (auto p : vec) cerr << "(" << p.first << ", " << p.second << "), "; cerr << "}\n"
#define dbvv(vv) cerr << #vv << ":{\n"; for (auto vec : vv) { cerr << "{ "; for (auto e : vec) cerr << e << ", "; cerr << "}\n"; } cerr << "}\n"
#define dbm(map) cerr << #map << ":{ "; for (auto p : map) cerr << "(" << p.first << ", " << p.second << "), "; cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using vi = vector<int>; using vl = vector<ll>; using vs = vector<string>; using vb = vector<bool>;
using vvi = vector<vi>; using vvl = vector<vl>; using vvb = vector<vb>;
using pii = pair<int, int>; using pil = pair<int, ll> ; using pli = pair<ll, int>; using pll = pair<ll, ll>;
using vpii = vector<pii>; using vpll = vector<pll>;
using ti3 = tuple<int, int, int>; using tl3 = tuple<ll, ll, ll>;
using ti4 = tuple<int, int, int, int>; using tl4 = tuple<ll, ll, ll, ll>;
using mii = map<int, int>; using mil = map<int, ll>; using mli = map<ll, int>; using mll = map<ll, ll>;
mii col; // Qの行番号->列番号
bool solve(vi a) {
for (pii p : col) {
if (a[p.first] != p.second) return false;
}
rep(i, 7) rep2(j, i + 1, 8) if (abs(a[j] - a[i]) == j - i) return false;
return true;
}
void draw(vi a) {
rep(i, 8) {
rep0(a[i]) cout << '.';
cout << 'Q';
rep0(7 - a[i]) cout << '.';
cout << endl;
}
}
int main() {
// 盤面は0-ind
int k; cin >> k;
rep0(k) {
int r, c; cin >> r >> c;
col[r] = c;
}
vi a(8); rep(i, 8) a[i] = i; // aは {0,1,...,N-1} でなくともよい
do {
// aに対応する処理
if (solve(a)) {
// dbv(a);
draw(a);
break;
}
} while (next_permutation(ALL(a)));
}
| 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++) //0から
#define REP(i,N) for(int j=i;j<N;j++) //iから
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1; //無い場合
return right;
}
vector<ll> prime;
void Prime(ll n){ //線形篩,素数列挙
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
//cout<<fixed<<setprecision(10);
int main(){
int n,m;
cin>>n>>m;
vector<int> L(m),R(m+1);
rep(i,m){
cin>>L[i]>>R[i];
L[i]--;
}
vector<int> cnt(n+1,0);
rep(i,m){
cnt[L[i]]++;
cnt[R[i]]--;
}
rep(i,n){
cnt[i+1]+=cnt[i];
}
int ans=0;
rep(i,n){
if(cnt[i]==m){
ans++;
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int l, r, n , m =0;
cin>>n>>m;
int mi= n;
int ma=-1;
for(int i=0; i<m ; i++){
cin>>l>>r;
if(ma < l)ma= l;
if(mi > r)mi=r;
}
cout<<max(mi-ma+1,0);
return 0;
} | 1 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end
int main(){
int n; cin>>n;
vector<int> a(n),b(n);
rep(i,0,n)cin>>a[i];
rep(i,0,n)cin>>b[i];
int d=0;
rep(i,0,n){
int idx=upper_bound(ALL(b),a[i])-b.begin();
chmax(d,idx-i);
}
rotate(b.begin(),b.begin()+d,b.end());
rep(i,0,n)if(a[i]==b[i]){
puts("No"); return 0;
}
puts("Yes");
rep(i,0,n)cout<<b[i]<<(i==n-1?'\n':' ');
return 0;
} | #include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
#include "limits.h"
#define rep(i, a, b) for (long long (i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out(){std::cerr<<std::endl;}
template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
std::cerr<<" "<<h;
debug_out(t...);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
long long pow_mod(long long a, long long b, long long mod=-1) {
if(b==0)return 1;
if ((a == 0)||(mod!=-1&&(a+mod)%mod==0)) {
return 0;
}
long long x = 1;
while (b > 0) {
if (b & 1) {
x = (mod!=-1)?(x * a) % mod:x*a;
}
a = (mod!=-1)?(a * a) % mod:a*a;
b >>= 1;
}
return x;
}
// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;
using ll = long long;
using P = std::pair<long long, long long>;
ll gcd(ll a,ll b){
if(a%b==0)return b;
return gcd(b,a%b);
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
ll n;
std::cin>>n;
std::vector<long double> a(n);
rep(i,0,n)std::cin>>a[i];
long double sum=0;
rep(i,0,n)sum+=a[i];
sum/=(long double)n;
long double min=1e9;
rep(i,0,n)chmin(min,std::abs(a[i]-sum));
rep(i,0,n){
if(std::abs(a[i]-sum)==min){
std::cout<<i<<"\n";
return 0;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll ans = 0;
void merge(vector<int>& v, int left, int mid, int right)
{
int n1 = mid - left, n2 = right - mid;
vector<int> L(v.begin() + left, v.begin() + left + n1);
vector<int> R(v.begin() + mid, v.begin() + mid + n2);
L.push_back(INF);
R.push_back(INF);
for (int i = 0, j = 0, k = left; k < right; ++k) {
if (L[i] <= R[j]) {
v[k] = L[i];
++i;
}
else {
v[k] = R[j];
++j;
ans += n1 - i;
}
}
}
void mergeSort(vector<int>& v, int left, int right)
{
if (left + 1 >= right) { return; }
int mid = (left + right) / 2;
mergeSort(v, left, mid);
mergeSort(v, mid, right);
merge(v, left, mid, right);
}
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
vector<int> A(n);
for (int i = 0; i < n; ++i) {
fscanf(stdin, "%d", &A[i]);
}
mergeSort(A, 0, n);
fprintf(stdout, "%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
template <typename T>
struct BIT{
int n;
vector<T> d;
BIT(int sz){
n = sz+10;
d.resize(n);
}
void add(int i, T x){
while(i<=n){
d[i] += x;
i += i&-i;
}
}
T getSum(int i){
T ret = 0;
while(i>0){
ret += d[i];
i -= i&-i;
}
return ret;
}
};
int main(){
int n; cin >> n;
int ma = 0;
vector<int> a(n),sorted(n);
rep(i,n){
cin >> a[i];
sorted[i] = a[i];
}
sort(sorted.begin(), sorted.end() );
map<int,int> mp;
rep(i,n){
mp[sorted[i]] = i+1;
}
ll res = 0;
BIT<int> bit(n);
rep(i,n){
res += i-bit.getSum(mp[a[i]]);
bit.add(mp[a[i]],1);
}
cout << res << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int L=a+b;
int R=c+d;
if(L>R){
cout << "Left" << endl;
}
if(L<R){
cout << "Right" << endl;
}
if(L==R){
cout << "Balanced" << endl;
}
}
| #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 998244353;
const ll MAX = 2000001;
ll mod(ll a){
if(a % MOD < 0) return MOD + (a % MOD);
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
ll a,b,c,d; cin >> a >> b >> c >> d;
if(a+b == c+d) cout << "Balanced" << endl;
else if(a+b > c+d) cout << "Left" << endl;
else cout << "Right" << endl;
} | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define int ll
const ll mod=998244353;
ll dp[333][99999]={0};
ll dp2[333][99999]={0};
ll ar[305]={0};
ll pow(ll x,ll y){
if(y==0) return 1;
ll res=pow(x,y/2);
res*=res;
res%=mod;
if(y%2==1){
res*=x;
res%=mod;
}
return res;
}
signed main(){
ll n,sum=0;
cin>>n;
dp[0][0]=1;
dp2[0][0]=1;
for(int i=0;i<n;i++){
ll a;
cin>>a;
ar[i]=a;
sum+=a;
}
for(int i=0;i<n;i++){
ll a=ar[i];
for(int j=0;j<98999;j++){
dp[i+1][j]+=(dp[i][j]*2)%mod;
dp[i+1][j+a]+=dp[i][j];
dp[i+1][j]%=mod;
dp[i+1][j+a]%=mod;
dp2[i+1][j]+=dp2[i][j];
dp2[i+1][j+a]+=dp2[i][j];
dp2[i+1][j]%=mod;
dp2[i+1][j+a]%=mod;
}
}
ll ans=pow(3,n);
for(ll i=(sum+1)/2;i<=sum;i++){
ans+=mod-((dp[n][i]*3)%mod);
ans%=mod;
}
if(sum%2==0) {
ans+=(dp2[n][sum/2]*3)%mod;
ans%=mod;
}
ans%=mod;
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T>
T random(T lo, T hi) {
std::random_device rd;
std::uniform_int_distribution<T> uid(lo, hi);
return uid(rd);
}
class RollingHash {
private:
const uint64_t mod = (UINT64_C(1) << 61) - 1;
static inline uint64_t base = random(UINT32_C(10007), UINT32_MAX);
std::vector<uint64_t> hashes, pows;
inline uint64_t add(uint64_t a, uint64_t b) const {
a += b;
if (a >= mod) a -= mod;
return a;
}
inline uint64_t sub(uint64_t a, uint64_t b) const {
if (a < b) a += mod;
a -= b;
return a;
}
inline uint64_t mul(uint64_t a, uint64_t b) const {
uint64_t ah = a >> 31, al = a & ((UINT64_C(1) << 31) - 1), bh = b >> 31,
bl = b & ((UINT64_C(1) << 31) - 1), m = ah * bl + al * bh,
v = (ah * bh << 1) + (m >> 30) +
((m & ((UINT64_C(1) << 30) - 1)) << 31) + al * bl;
v = (v & ((UINT64_C(1) << 61) - 1)) + (v >> 61);
return v;
}
public:
template <typename T>
RollingHash(const T &S) : hashes(S.size() + 1, 0), pows(S.size() + 1, 0) {
pows[0] = 1;
for (size_t i = 0; i < S.size(); i++) {
pows[i + 1] = mul(pows[i], base);
hashes[i + 1] = add(mul(hashes[i], base), S[i]);
}
// cout << base << '\n';
}
// S[l, r)
uint64_t slice(int l, int r) const {
return sub(hashes[r], mul(hashes[l], pows[r - l]));
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
vector<int> S(N), T(N);
for (int i = 0; i < N; i++) {
S[i] = A[i] ^ A[(i + 1) % N];
T[i] = B[i] ^ B[(i + 1) % N];
}
for (int i = 0; i < N; i++) {
S.emplace_back(S[i]);
}
RollingHash rhs(S), rht(T);
for (int i = 0; i < N; i++) {
if (rhs.slice(i, i + N) == rht.slice(0, N)) {
cout << i << ' ' << (A[i] ^ B[0]) << '\n';
}
}
return 0;
}
| 0 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int max_len = 1005;
int dp[max_len][max_len];
char s1[max_len];
char s2[max_len];
void solve() {
int l1 = strlen(s1);
int l2 = strlen(s2);
for (int i = 0; i < max_len; i++) {
dp[i][0] = dp[0][i] = i;
}
for (int i = 0; i < l1; i++) {
for (int j = 0; j < l2; j++) {
int d1s = dp[i][j];
int d1d = dp[i][j] + 1;
int d2 = dp[i + 1][j] + 1;
int d3 = dp[i][j + 1] + 1;
if (s1[i] == s2[j]) {
dp[i + 1][j + 1] = min(min(d1s, d2), d3);
} else {
dp[i + 1][j + 1] = min(min(d1d, d2), d3);
}
}
}
printf("%d\n", dp[l1][l2]);
}
int main() {
fgets(s1, max_len, stdin);
fgets(s2, max_len, stdin);
for (int i = 0; i < max_len; i++) {
if (s1[i] == '\n') { s1[i] = '\0'; }
if (s2[i] == '\n') { s2[i] = '\0'; }
}
solve();
return 0;
} | #include <stdio.h>
#include <string.h>
int main(){
char strA[100], strB[100], strC[100];
scanf("%s %s %s",&strA, &strB, &strC);
int lenA=strlen(strA);
int lenB=strlen(strB);
if (strA[lenA-1] == strB[0] && strB[lenB-1] == strC[0]){
printf("YES");
}
else{
printf("NO");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#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 all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
int main() {
int n; cin >> n;
vint a(n);
rep(i,n) cin >> a[i];
vint b(n,-1);
rep(i,n) {
if (i-a[i] < 0) {cout << -1 << endl; return 0;}
chmax(b[i-a[i]],a[i]);
}
vint c(n,-1);
rep(i,n) if (b[i] != -1) c[i] = i + b[i];
rep(i,n-1) {
if (c[i] == -1 || c[i+1] == -1) continue;
if (c[i] > c[i+1]) {cout << -1 << endl; return 0;}
}
ll ans = 0;
rep(i,n) if (b[i] != -1) ans += b[i];
cout << ans << endl;
} | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n+1); i++)
#define repr(i,n) for (ll i = (n-1); i>=0;i--)
#define repr3(i,n) for(ll i = (n);i>0;i--)
#define repr4(i,s,n) for(ll i = (n);i>=(s);i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll,ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
/*
namespace mp = boost::multiprecision;
// 任意長整数型
using Bint = mp::cpp_int;
// 仮数部長が32の浮動小数点数型
using Real32 = mp::number<mp::cpp_dec_float<32>>;
// 仮数部長が1024の浮動小数点数型
using Real1024 = mp::number<mp::cpp_dec_float<1024>>;
// 有理数型
using Rat = boost::rational<Bint>;
*/
int main() {
int N;
cin>>N;
int A[N+1];
rep3(i,N){
cin>>A[i];
}
int ans[N+1];
repr3(i,N){
int sum=0;
for(int j=2*i;j<=N;j+=i){
sum+=ans[j];
}
ans[i]=(sum+2-A[i])%2;
}
vector<int> ans_list;
int count=0;
rep3(i,N){
if(ans[i]==1){
ans_list.push_back(i);
count++;
}
}
cout<<count<<endl;
rep(i,ans_list.size()){
cout<<ans_list[i]<<endl;
}
return 0;
} | 0 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>
#include <sstream>
#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1;i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
#define LL long long int
#define LD long double
#define PI 3.14159265358979
using namespace std;
//================================================
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
cin.ignore();
string from = "Hoshino";
REP(i, N) {
string S;
getline(cin, S);
while(true) {
int res = S.find("Hoshino", 0);
if (res == -1) break;
S.replace(res, 7, "Hoshina");
}
cout << S << "\n";
}
return 0;
} | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b=0;
cin>>n;
a=n;
while(a>0){
b+=a%10;
a/=10;
}
if(n%b==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return(0);
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fr first
#define sc second
#define pb push_back
const ll mod = 998244353;
const int N = 1e6+205;
ll cnt[N];
void solve(){
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int x,y;
cin>>x>>y;
cnt[x]++;
cnt[y+1]--;
}
int ans = 0;
for(int i=1;i<=n;i++){
cnt[i] = cnt[i-1]+cnt[i];
if(cnt[i]==m)ans++;
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}
| #include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vector<P> hp1(n);
REP(i,n) cin>>hp1[i].first>>hp1[i].second;
vector<P> sorting(n);
REP(i,n) {
sorting[i].first=hp1[i].first+hp1[i].second;
sorting[i].second=i;
}
sort(ALL(sorting));
vector<P> hp(n);
REP(i,n) {
hp[i]=hp1[sorting[i].second];
}
vector<vector<ll>> dp(n,vector<ll>(n+1,INF*INF));
dp[0][0]=0;
dp[0][1]=hp[0].second;
FOR(i,1,n) {
REP(j,n+1) {
if(j==0) dp[i][j]=0;
else {
if(hp[i].first>=dp[i-1][j-1]) dp[i][j]=min(dp[i-1][j],dp[i-1][j-1]+hp[i].second);
else dp[i][j]=dp[i-1][j];
}
}
}
ll ret=0;
REP(i,n+1) {
if(dp[n-1][i]!=INF*INF) ret=i;
}
cout<<ret<<endl;
}
| 0 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
int N;
cin>>N;
string s;
cin>>s;
vector<string> tmp;
tmp.push_back("SS");
tmp.push_back("SW");
tmp.push_back("WS");
tmp.push_back("WW");
string ans;
bool aru = false;
for(int i=0;i<4;++i){
bool tmparu = true;
ans = tmp[i];
for(int j=2;j<N;++j){
if(ans[j-1]=='S'){
if(s[j-1]=='x'){
if(ans[j-2]=='S'){
ans += 'W';
}
else{
ans += 'S';
}
}
else {
if(ans[j-2]=='S'){
ans += 'S';
}
else{
ans += 'W';
}
}
}
else {
if(s[j-1]=='x'){
if(ans[j-2]=='S'){
ans += 'S';
}
else {
ans += 'W';
}
}
else {
if(ans[j-2]=='S'){
ans += 'W';
}
else {
ans += 'S';
}
}
}
}
if(ans[N-1]=='S'){
if(s[N-1]=='x'){
if(ans[N-2]=='S'){
if(ans[0]!='W')tmparu = false;
}
else {
if(ans[0]!='S')tmparu = false;
}
}
else{
if(ans[N-2]=='S'){
if(ans[0]!='S')tmparu = false;
}
else{
if(ans[0]!='W')tmparu = false;
}
}
}
else {
if(s[N-1]=='x'){
if(ans[N-2]=='S'){
if(ans[0]!='S')tmparu=false;
}
else{
if(ans[0]!='W')tmparu=false;
}
}
else{
if(ans[N-2]=='S'){
if(ans[0]!='W')tmparu=false;
}
else{
if(ans[0]!='S')tmparu=false;
}
}
}
if(ans[0]=='S'){
if(s[0]=='x'){
if(ans[N-1]=='S'){
if(ans[1]!='W')tmparu=false;
}
else{
if(ans[1]!='S')tmparu=false;
}
}
else{
if(ans[N-1]=='S'){
if(ans[1]!='S')tmparu=false;
}
else{
if(ans[1]!='W')tmparu=false;
}
}
}
else{
if(s[0]=='x'){
if(ans[N-1]=='S'){
if(ans[1]!='S')tmparu=false;
}
else{
if(ans[1]!='W')tmparu=false;
}
}
else{
if(ans[N-1]=='S'){
if(ans[1]!='W')tmparu=false;
}
else{
if(ans[1]!='S')tmparu=false;
}
}
}
if(tmparu){
aru=true;
break;
}
}
if(aru)cout<<ans<<endl;
else cout<<-1<<endl;
}
| #include <iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
string s1;
string s2;
cin >> s1;
cin >> s2;
int a = s1.size();
int b = s2.size();
vvi dp(a + 1, vi(b + 1, 0));
for (int i = 0; i <= a; i++)dp[i][0] = i;
for (int i = 0; i <= b; i++)dp[0][i] = i;
for (int i = 1; i <= a; i++) {
for (int j = 1; j <= b; j++) {
dp[i][j] = min(dp[i - 1][j]+1, min(dp[i-1][j-1]+1,dp[i][j - 1]+1));
if (i >= 1 && j >= 1 && s1[i - 1] == s2[j - 1]) {
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1]);
}
}
}
/*for (int i = 0; i <= a; i++) {
for (int j = 0; j <= b; j++) {
cout << dp[i][j] << " ";
}
cout << endl;
}*/
cout <<dp[a][b] << endl;
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <ctime>
#define _repargs(_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(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 1LL << 62
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
if(p) cout << fixed << setprecision(p) << a << "\n";
else cout << a << "\n";
}
// end of template
ll pow_mod(ll a, ll b, ll m){
ll ret = 1;
while (b > 0) {
if (b & 1) {
ret = ret * a % m;
}
a = a * a % m;
b >>= 1;
}
return ret;
}
ll inv_mod(ll a, ll m){
return pow_mod(a, m - 2, m);
}
const int MAX_M = 100001;
ll f[MAX_M];
void calc() {
f[0] = 1;
rep(i, 1, MAX_M) {
f[i] = f[i - 1] * i;
f[i] %= mod;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
// source code
calc();
int N;
ll X;
cin >> N >> X;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
reverse(all(A));
vector<ll> dp(MAX_M);
vector<ll> tmp(MAX_M);
dp[X] = 1;
rep(i, N) {
tmp.assign(MAX_M, 0);
ll inv = inv_mod(N - i, mod);
rep(j, MAX_M) {
tmp[j % A[i]] += dp[j] * inv % mod;
tmp[j % A[i]] %= mod;
tmp[j] += (dp[j] * inv % mod) * (N - i - 1) % mod;
tmp[j] %= mod;
}
dp = tmp;
}
ll ans = 0;
rep(i, MAX_M) {
ans += dp[i] * i;
ans %= mod;
}
ans *= f[N];
ans %= mod;
output(ans);
return 0;
}
| #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b)
{
if (a%b == 0)return b;
return gcd(b, a%b);
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main()
{
int l, r; cin >> l >> r;
if (r - l + 1 >= 2019 || l == 0)cout << 0 << endl;
else
{
int res = 1e7;
for (int i = l; i < r; ++i)
{
for (int j = i + 1; j <= r; ++j)
{
chmin(res, ((i % 2019)*(j % 2019)) % 2019);
}
}
cout << res << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 4e2 + 10;
const ll mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);
int l, r; cin >> l >> r;
if (r - l + 1 >= 2019) cout << 0;
else {
ll ans = 2019;
for (ll i = l; i <= r; ++i)
for (ll j = i + 1; j <= r; ++j)
ans = min(ans, (i * j) % 2019);
cout << ans;
}
return 0;
}
| #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << max(a + b, max(a - b, a * b)) << '\n';
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
long long a[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
long long d;
cin>>d;
a[0]=1;
for(int i=1;i<=20;i++)
a[i]=a[i-1]*10;
long long ans=0;
for(int i=2;i<=20;i++)
{
int k=i/2;
for(long long state=0;state<1<<k;state++)
{
long long cha,chan=d;
if(i%2==1)
cha=10;
else
cha=1;
for(int j=0;j<k;j++)
{
long long x=abs(chan)%10;
if(chan<0)
{
x=10-x;
x%=10;
}
if(state>>j&1)
{
long long sym=10-x;
if(j==0)
sym--;
cha*=sym;
chan+=x*a[i-2*j-1];
chan-=x;
}
else
{
long long sym=x;
if(j==0)
sym--;
if(sym<0)
{
cha=0;
break;
}
cha*=sym;
chan-=(10-x)*a[i-2*j-1];
chan+=(10-x);
}
chan/=10;
}
if(chan==0)
ans+=cha;
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin>>N;
T=N;
int sum=0;
while(N>0){
sum+=N%10;
N/=10;
}
if (T%sum==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define INF (1LL << 63)
struct edge{
size_t to;
size_t weight;
};
vector<size_t> dijkstra(vector<vector<edge>>& Graph, int& startPoint, int& vertexNum){
vector<size_t> minimumWeight(vertexNum,INF);
priority_queue<vector<pair<size_t,size_t>>, vector<pair<size_t,size_t>>, greater<pair<size_t,size_t>>> priorityQueue;
priorityQueue.push({0,startPoint});
minimumWeight[startPoint] = 0;
while(!priorityQueue.empty()){
pair<size_t,size_t> tmp = priorityQueue.top();
edge Edge;
Edge.to = tmp.second;
Edge.weight = tmp.first;
priorityQueue.pop();
if(minimumWeight[Edge.to] < Edge.weight) continue;
for(edge& edge : Graph[Edge.to]){
if(minimumWeight[edge.to] < minimumWeight[Edge.to] + edge.weight) continue;
minimumWeight[edge.to] = minimumWeight[Edge.to] + edge.weight;
priorityQueue.push({minimumWeight[edge.to],edge.to});
}
}
return minimumWeight;
}
int main(){
int N,M;
while(cin >> N >> M, N&&M){
vector<vector<edge>> costGraph(M);
vector<vector<edge>> timeGraph(M);
for(int i = 0;i < N; i++){
size_t a,b,c,t;
cin >> a >> b >> c >> t;
a--,b--;
costGraph[a].push_back({b,c});
costGraph[b].push_back({a,c});
timeGraph[a].push_back({b,t});
timeGraph[b].push_back({a,t});
}
int k;
cin >> k;
for(int j=0;j<k;j++){
int p,q,r;
cin >> p >> q >> r;
p--, q--;
vector<size_t> res;
if(r == 0) res = dijkstra(costGraph, p, M);
else res = dijkstra(timeGraph, p, M);
cout << res[q] << endl;
}
}
}
| /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||__]'.__.'[__;.__.' '.__.'_/
*/
/* }}} */
#include <bits/stdc++.h>
using namespace std;
// #define int long long
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
/* cpp template {{{ */
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)
/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';
/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; std::cin >> x; return x;}
template <typename T> void print(T x) {std::cout << x << '\n';}
template <typename T>
void print(std::vector<T>& v, std::string s = " ") {
REP(i, v.size()) {
if (i != 0) std::cout << s;
std::cout << v[i];
}
std::cout << '\n';
}
/* }}} */
int n, m;
void warshall_floyd(vvi& d)
{
REP(k, m) REP(i, m) REP(j, m) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
signed main()
{
while (cin >> n >> m, n || m) {
vvi dc, dt;
dc = dt = vvi(m, vi(m, INF));
REP(i, n) {
int a = in() - 1, b = in() - 1;
dc[a][b] = dc[b][a] = in();
dt[a][b] = dt[b][a] = in();
}
warshall_floyd(dc);
warshall_floyd(dt);
int k = in();
REP(i, k) {
int a = in() - 1, b = in() - 1, r = in();
print(r ? dt[a][b] : dc[a][b]);
}
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
int n;
cin>>n;
cout<<n/3<<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)
{
cout<<m/3<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define rep(i, n) for(i = 0; i < n; i++)
int main(){
int N, K;
int val = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
val = min(val * 2, val + K);
}
cout << val << '\n';
return 0;
} | #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 l, r;
cin >> l >> r;
ll ans = 2018;
chmin(r, l+2019);
for(ll i = l; i < r; ++i){
for(ll j = i+1; j <= r; ++j){
chmin(ans, (i*j)%2019);
}
}
cout << ans << endl;
return 0;
}
| 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
const ll inf = 1e9 + 7;
const ll Mod = 998244353;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
int N, Q, K[100];
string S;
ll DP[int(1e6 + 5)][3];
int main(){
cin >> N >> S >> Q;
for (int i = 0; i < Q; i++) cin >> K[i];
for (int i = 0; i < Q; i++){
DP[0][0] = 0; DP[0][1] = 0; DP[0][2] = 0;
if (S[0] == 'D') DP[0][0] = 1;
if (S[0] == 'M') DP[0][1] = 1;
ll ans = 0;
for (int j = 1; j < N; j++){
for (int k = 0; k < 3; k++) DP[j][k] = DP[j - 1][k];
if (j - K[i] >= 0){
if (S[j - K[i]] == 'D'){
DP[j][2] -= DP[j][1];
DP[j][0]--;
}
if (S[j - K[i]] == 'M') DP[j][1]--;
}
if (S[j] == 'D') DP[j][0]++;
if (S[j] == 'M'){
DP[j][1]++;
DP[j][2] += DP[j][0];
}
if (S[j] == 'C') ans += DP[j][2];
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) cout << endl;
else cout << " ";
}
}
struct SegmentTree {
int sz;
vector<int> d, m, dm;
SegmentTree(string s) {
int n = (int)(s.size());
sz = 1;
while(sz < n) sz *= 2;
d.clear();
m.clear();
dm.clear();
d.resize(2*sz+1, 0);
m.resize(2*sz+1, 0);
dm.resize(2*sz+1, 0);
for(int i=0;i<n;++i) {
if(s[i] == 'D') {
d[i+sz-1] = 1;
} else if(s[i] == 'M') {
m[i+sz-1] = 1;
}
}
for(int i=sz-2;i>=0;--i) {
d[i] = d[2*i+1] + d[2*i+2];
m[i] = m[2*i+1] + m[2*i+2];
dm[i] = dm[2*i+1] + dm[2*i+2] + d[2*i+1] * m[2*i+2];
}
}
tuple<int, int, int> query(int a, int b, int l, int r, int k) {
if(b <= l || r <= a) return make_tuple(0, 0, 0);
if(a <= l && r <= b) return make_tuple(d[k], m[k], dm[k]);
tuple<int, int, int> v1 = query(a, b, l, (l+r)/2, 2*k+1);
tuple<int, int, int> v2 = query(a, b, (l+r)/2, r, 2*k+2);
int resd = get<0>(v1) + get<0>(v2);
int resm = get<1>(v1) + get<1>(v2);
int resdm = get<2>(v1) + get<2>(v2) + get<0>(v1) * get<1>(v2);
return make_tuple(resd, resm, resdm);
}
tuple<int, int, int> query(int a, int b) {
return query(a, b, 0, sz, 0);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n; cin >> n;
string s; cin >> s;
vector<int> su(n);
su[0] == s[0] == 'M';
for(int i=1;i<n;++i) {
su[i] = su[i-1] + (s[i] == 'M');
}
int q; cin >> q;
for(int i=0;i<q;++i) {
int k; cin >> k;
ll cntd = 0, cntm = 0, now = 0, ans = 0;
for(int j=0;j<k;++j) {
if(s[j] == 'D') {
cntd++;
} else if(s[j] == 'M') {
now += cntd;
} else if(s[j] == 'C') {
ans += now;
}
}
for(int j=k;j<n;++j) {
if(s[j-k] == 'D') {
cntd--;
now -= su[j-1] - su[j-k];
}
if(s[j] == 'D') {
cntd++;
} else if(s[j] == 'M') {
now += cntd;
} else if(s[j] == 'C') {
ans += now;
}
}
cout << ans << endl;
}
}
| 1 |
#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 = 2010;
const int mod = 1e9 + 7;
inline int ksm(int x, int k = mod - 2) {
int s = 1;
while(k) {
if(k & 1) s = 1LL * s * x % mod;
x = 1LL * x * x % mod, k >>= 1;
} return s;
}
int fac[MAXN * MAXN];
int ifac[MAXN * MAXN];
int f[MAXN][MAXN];
inline void init(int n) {
fac[0] = 1;
for(int i = 1; i <= n; i++) fac[i] = 1LL * fac[i - 1] * i % mod;
ifac[n] = ksm(fac[n]);
for(int i = n; i >= 1; i--) ifac[i - 1] = 1LL * ifac[i] * i % mod;
}
inline int C(int n, int m) {
return 1LL * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int main() {
#ifdef LOCAL
FILE("");
#endif
int n = ri, k = ri, N = n * k;
init(N);
if(k == 1) return puts("1"), 0;
for(int i = 0; i <= n; i++) f[i][0] = 1;
for(int i = 1; i <= n; i++)
for(int j = 0; j <= i; j++)
if(j) f[i][j] = (f[i - 1][j] + 1LL * f[i][j - 1] * C(N - i - (j - 1) * (k - 1) - 1, k - 2)) % mod;
else f[i][j] = f[i - 1][j];
printf("%lld\n", 1LL * f[n][n] * fac[n] % mod);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
typedef long long LL;
const LL mod = 1e9 + 7;
// head
int n, m, a[105], b[105], cnt;
int main() {
cin>>n>>m;
rep(i, 1, m) {
cin>>a[i];
if(a[i]&1) cnt++;
}
if(cnt > 2) {
cout<<"Impossible"<<endl;
return 0;
}
if(m == 1) {
cout<<n<<endl;
if(n == 1) cout<<1<<endl<<1<<endl;
else cout<<2<<endl<<a[1] - 1<<" "<<1<<endl;
return 0;
}
rep(i, 1, m)
if(a[i]&1) {
swap(a[i], a[1]);
break;
}
rep(i, 2, m - 1)
if(a[i]&1)
swap(a[i], a[m]);
rep(i, 1, m) cout<<a[i]<<" ";
cout<<endl<<((a[m] == 1) ? m - 1: m)<<endl<<a[1] + 1<<" ";
rep(i, 2, m - 1)
cout<<a[i]<<" ";
if(a[m] != 1) cout<<a[m] - 1<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n;
int p[N];
pair<pair<int, int>, int> c[N];
pair< int, pair<int, int> > e[N];
int group(int a) {
if (p[a] == -1) {
return a;
}
return p[a] = group(p[a]);
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
c[i] = make_pair(make_pair(x, y), i);
}
for (int it = 0; it < 2; it++) {
sort(c, c + n);
for (int i = 0; i < n - 1; i++) {
int x = c[i].second;
int y = c[i + 1].second;
int d = abs(c[i + 1].first.first - c[i].first.first);
e[it * (n - 1) + i] = make_pair(d, make_pair(x, y));
}
for (int i = 0; i < n; i++) {
swap(c[i].first.first, c[i].first.second);
}
}
sort(e, e + 2 * n - 2);
fill_n(p, n, -1);
long long ans = 0;
for (int i = 0; i < 2 * n - 2; i++) {
int x = group(e[i].second.first);
int y = group(e[i].second.second);
int d = e[i].first;
if (x == y) {
continue;
}
p[x] = y;
ans += d;
}
printf("%lld\n", ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
inline void read(long long &x) {
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
inline void write(long long x) {
static const long long maxlen = 100;
static char s[maxlen];
if (x < 0) { putchar('-'); x = -x;}
if (!x) { putchar('0'); return; }
long long len = 0; for (; x; x /= 10) s[len++] = x % 10 + '0';
for (long long i = len - 1; i >= 0; --i) putchar(s[i]);
}
inline void read(int &x){
char ch;
bool flag = false;
for (ch = getchar(); !isdigit(ch); ch = getchar())if (ch == '-') flag = true;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
const long long MAXN =1001000;
long long n;
struct kt{
long long x,y;
long long id;
}a[ MAXN ];
long long fa[ MAXN ];
struct edge{
long long x,y,val;
}E[ MAXN*2 ];
bool cmp_x(kt A,kt B){
return A.x<B.x;
}
bool cmp_y(kt A,kt B){
return A.y<B.y;
}
bool cmp_e(edge A,edge B){
return A.val<B.val;
}
long long get_fa(long long x){
return (fa[x]==x)?(x):(fa[x]=get_fa(fa[x]));
}
int main(){
read(n);
for (long long i=1;i<=n;i++)
{
a[i].id=i;
read(a[i].x);read(a[i].y);
}
sort(a+1,a+n+1,cmp_x);
long long cnt=0;
for (long long i=1;i<n;i++)
{
++cnt;
E[cnt].x=a[i].id;
E[cnt].y=a[i+1].id;
E[cnt].val=a[i+1].x-a[i].x;
}
sort(a+1,a+n+1,cmp_y);
for (long long i=1;i<n;i++)
{
++cnt;
E[cnt].x=a[i].id;
E[cnt].y=a[i+1].id;
E[cnt].val=a[i+1].y-a[i].y;
}
for (long long i=1;i<=n;i++)
fa[i]=i;
sort(E+1,E+cnt+1,cmp_e);
long long ans=0;
for (long long i=1;i<=cnt;i++)
{
long long a=E[i].x,b=E[i].y;
long long x=get_fa(a),y=get_fa(b);
if ( x!=y )
{
ans+=E[i].val;
fa[x]=y;
}
}
cout<<ans<<endl;
return 0;
}
| 1 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=new type[n];
#define sl s1.length();
#define yes cout<< "YES"<<endl
#define no cout<< "NO"<<endl
#define all(v) (v).begin(),(v).end()
#define s(v) sort(v,v+n)
#define mt mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define read(a,n) for(int i=0;i<n;i++)cin>>a[i]
#define print(a,n) for(int i=0;i<n;i++)cout<<a[i]<<" "
using namespace std;
//**********************************************DO IT NOW***************************************************************
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",stdout);
#endif
ios_base :: sync_with_stdio(false);
cin.tie(NULL) ;
cout.tie(NULL);
}
int dp[101][1001],ans1=1e9,dp1[1000001];
int num[10];
int a[1000000];
int prime(int n)
{
for(int i=2;i*i<=n;i++)
{
if(n%i==0)
return 0;
}
return 1;
}
signed main()
{
fastio();
int t=1;
// cin>>t;
while(t--)
{
int a,b,c;
cin>>a>>b>>c;
int x=0;
if(a==c && c!=b)
x++;
if(a==b && b!=c)
x++;
if(b==c && c!=a)
x++;
if(x)
cout<<"Yes";
else
cout<<"No";
}
}
// 🍪 🍪 🍪
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a < c && c < b) cout << "Yes" << endl;
else if(b < c && c < a) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
ll d[2], k;
cin >> d[0] >> d[1] >> k;
int cnt = 0;
rep(i, k) {
int id = cnt % 2;
if (d[id] % 2 == 1)
--d[id];
d[id] /= 2;
d[1 - id] += d[id];
++cnt;
}
cout << d[0] << " " << d[1] << endl;
return 0;
} | #include <iostream>
#include <unordered_map>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
int N,H,W;
cin >>N>>H>>W;
int ans = (N-H+1) * (N-W+1);
cout << ans << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
ll happiness = 0;
while(n >= 500){
happiness += 1000;
n -= 500;
}
while(n >= 5){
happiness += 5;
n -= 5;
}
cout << happiness << endl;
}
| #include<iostream>
using namespace std;
const int coin[2] = {5,500};
int main(){
int money,happy;
cin >> money;
int C[2] = {0,0};
for(int i = 1;i >= 0;i--){
C[i] = money / coin[i];
money -= coin[i]*C[i];
}
happy = C[0]*5 + C[1]*1000;
cout << happy << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll n,k;
ll a[20];
bool used[20];
ll ans;
map<ll,bool> mp;
void dfs(ll now, ll num){
if(now == k){
if(!mp[num]){
mp[num] = true;
ans++;
//cout << num << "num" << endl;
}
}
for (int i = 0;i < n;i++){
if(!used[i]){
ll nn;
if(a[i] >= 10) nn = num * 100;
else nn = num * 10;
nn += a[i];
used[i] = true;
dfs(now+1,nn);
used[i] = false;
}
}
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while(true){
cin >> n;
if(n == 0) break;
cin >> k;
for (int i = 0;i < n;i++){
cin >> a[i];
}
memset(used,0,sizeof(used));
mp = map<ll,bool>();
ans = 0;
dfs(0,0);
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
if(x > y) x = y;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, K;
while(
cin >> N >> K,N){
VI xs(N);
REP(i,N) cin >> xs[i];
SORT(xs);
set<int> ans;
do{
int s = 0;
REP(i,K){
s = s * (xs[i] >= 10? 100: 10) + xs[i];
}
ans.insert(s);
}while(next_permutation(ALL(xs)));
cout << SZ(ans) << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;
//-----------------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,b,c;
cin>>n;
if(n==2) {
cin>>a>>b;
FOR(i,1,min(a,b)+1) {
if(a%i==0&&b%i==0) cout<<i<<endl;
}
}
else {
cin>>a>>b>>c;
FOR(i,1,min(a,min(b,c))+1) {
if(a%i==0&&b%i==0&&c%i==0) cout<<i<<endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long h[4];
int a, b, c, ab, cc;
int i, n;
long long j, minl, amari;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
}
minl = h[0];
for (i = 1; i < n; i++) {
if (minl > h[i]) minl = h[i];
}
for (j = 1; j <= minl; j++) {
amari = 0;
for (i = 0; i < n; i++) {
amari += h[i] % j;
}
if (amari == 0) cout << j << endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::function<ret (__VA_ARGS__)>
template <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}
template <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}
template <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}
class range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};
typedef vector<int> V;
typedef vector<V> VV;
int col[612][612][2];
int N;
void coloring(int r, int c, int k, VV& edge) {
for (auto &e : edge) {
int nr = r + e[0];
int nc = c + e[1];
if (nr < 0 || N <= nr)continue;
if (nc < 0 || N <= nc)continue;
if (col[nr][nc][k] != -1)continue;
col[nr][nc][k] = 1 - col[r][c][k];
coloring(nr, nc, k, edge);
}
}
int main() {
LL latte, malta;
cin >> N >> latte >> malta;
N *= 2;
vector<VV> e(2);
for (int i : range(-N,N+1))for (int j : range(-N,N+1)) {
if (i*i + j*j == latte)e[0].push_back({ i,j });
if (i*i + j*j == malta)e[1].push_back({ i,j });
}
for (int i : range(N))for (int j : range(N))for (int k : range(2))col[i][j][k] = -1;
for (int i : range(N))for (int j : range(N))for (int k : range(2))if (col[i][j][k] == -1) {
col[i][j][k] = 0;
coloring(i, j, k, e[k]);
}
int cnt[2][2] = { {0,0},{0,0} };
for (int i : range(N))for (int j : range(N)) {
cnt[col[i][j][0]][col[i][j][1]]++;
}
int ai = 0, aj = 0;
for (int i : range(2))for (int j : range(2)) {
if (cnt[ai][aj] < cnt[i][j])ai = i, aj = j;
}
int M = N * N / 4;
for (int i : range(N))for (int j : range(N)) {
if (col[i][j][0] == ai && col[i][j][1] == aj && M > 0) {
cout << i << " " << j << endl;
M--;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
bool vis[603][603]; int N , D1 , D2;
void color(int dist){
int now = 0; while(!(dist & 3)){dist >>= 2; ++now;}
if(dist % 4 == 3) return;
for(int i = 0 ; i < 2 * N ; ++i)
for(int j = 0 ; j < 2 * N ; ++j)
vis[i][j] |= ((dist & 2) && (i >> now & 1)) || ((dist & 1) && (((i >> now) + (j >> now)) & 1));
}
int main(){
cin >> N >> D1 >> D2; color(D1); color(D2); int num = 0;
for(int i = 0 ; i < 2 * N ; ++i) for(int j = 0 ; j < 2 * N ; ++j) if(!vis[i][j] && ++num <= N * N) printf("%d %d\n" , i , j);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long Int;
const Int INF = 1e18;
int main() {
Int N;
cin >> N;
vector<Int> A(N);
rep(i,N) cin >> A[i];
vector<Int> dp0(N, -INF), dp1(N, -INF);
dp0[0] = 0;
dp1[0] = A[0];
dp0[1] = max(A[0], A[1]);
for(int i = 2; i<N; i++) {
if (i % 2 == 1) {
dp0[i] = max(dp1[i-1], A[i]+dp0[i-2]);
}
else {
dp0[i] = max(dp0[i-1], A[i] + dp0[i-2]);
dp1[i] = A[i] + dp1[i-2];
}
}
cout << dp0[N-1] << endl;
}
| #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,cur;
cin >> n;
long long ans = 0;
cin >> cur;
long long tot[3] = { 0,0,cur };
for (int i = 2; i <= n; i++) {
cin >> cur;
if (i % 2) {
tot[1] = max(tot[1], tot[2]);
tot[0] += cur;
tot[2] += cur;
}
else {
tot[0] = max(tot[0], tot[1]);
tot[1] += cur;
}
}
cout << (n % 2 ? max(tot[0], tot[1]) : max(tot[1], tot[2]));
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> P;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
string maxs(string S, string T){
if(S.length() > T.length()){
return S;
} else if (S.length() < T.length()){
return T;
} else {
return (S < T) ? T : S;
}
}
int main(){
int N, M; vector<int> A(9);
cin >> N >> M;
rep(i,M) cin >> A[i];
// dp[i]: マッチちょうどi本で作れる最大値
vector<string> dp(10010, "");
rep(i,N) rep(j,M){
if(dp[i] == "" && i != 0) continue;
char c = A[j] + '0';
if(i+num[A[j]] <= N){
string next = dp[i] + c;
dp[i+num[A[j]]] = maxs(dp[i+num[A[j]]], next);
}
}
cout << dp[N] << endl;
}
| #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
bool dp[5100][10100];
int main() {
int n,m;
cin >> n >> m;
vector<int> ex(8,0);
rep(i,m) {
int a;
cin >> a;
int b;
if(a == 1) b = 2;
else if(a == 7) b = 3;
else if(a == 4) b = 4;
else if(a == 2 || a == 3 || a == 5) b = 5;
else if(a == 6 || a == 9) b = 6;
else b = 7;
chmax(ex[b],a);
}
rep(i,5100) rep(j,10100) dp[i][j] = false;
dp[0][0] = true;
rep(i,5099) {
rep(j,n+1) {
if(!dp[i][j]) continue;
rep2(k,2,8) if(ex[k] > 0) {
dp[i+1][j+k] = true;
}
}
}
int mx;
rrep(i,5100) {
if(dp[i][n]) {
mx = i+1;
break;
}
}
int now = n;
for(int i = mx-1; i > 0; i--) {
int can = 0;
int use;
rep2(j,2,min(8,now+1)) {
if(ex[j] > can && dp[i-1][now-j]) {
can = ex[j];
use = j;
}
}
now -= use;
cout << can;
}
cout << endl;
}
| 1 |
#include <iostream>
using namespace std;
int n;
int A[100000];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>A[i];
int x=A[n-1];
int j=A[0]<x?1:0;
for(int i=1;i<n-1;i++)
{
if (A[i]<=x)
{
int aj=A[j];
A[j]=A[i];
A[i]=aj;
j++;
}
}
A[n-1]=A[j];
A[j]=x;
for (int i=0;i<j;i++)
{
if (i) cout <<' ';
cout<<A[i];
}
if(j)cout<<' ';
cout<<'['<<A[j]<<']';
for(int i=j+1;i<n;i++)//bug here i=j+1
{
cout <<' '<<A[i];
}
cout<<endl;//bug here
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); ++i)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ELEM(array) (sizeof (array)/sizeof *(array))
#define MAX_N 100000
#define SAFE_FREE(ptr) if( ptr != NULL ){ free(ptr); ptr = NULL; }
typedef unsigned int UINT;
typedef long long ll;
typedef pair<int, int> P;
int S[MAX_N];
int T[505];
int A[505];
int n, q;
bool mysearch(int key);
int main()
{
int j = 0;
int ans = 0;
bool over =false;
cin >> n;
REP(i, n)cin >> S[i];
cin >> q;
REP(i, q)cin >> T[i];
REP(i, n){
over = false;
for (int k = 0; k < j; k++)
{
if (A[k] == S[i]){
over=true; break;
}
}
if (mysearch(S[i]) == true&&over==false)
{
ans++;
A[j] = S[i];
j++;
}
}
cout << ans << endl;
return 0;
}
inline bool mysearch(int key){
int i;
T[q] = key;
for (i = 0; i < q; i++){
if (T[i] == key)break;
}
if (i == q){ return false; }
return true;
} | 0 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=998244353;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
vi Z_Algorithm(string s){
int S=s.size();
vi A(S);
A[0]=S;
int i=1,j=0;
while(i<S){
while(i+j<S&&s[j]==s[i+j]) j++;
A[i]=j;
if(!j){
i++;continue;
}
int k=1;
while(i+k<S&&k+A[k]<j) A[i+k]=A[k],k++;
i+=k;j-=k;
}
return A;
}
int n;
vi a,b;
int main(){
cin>>n;
a=b=vi(n);
for(auto &i:a) cin>>i;
for(auto &i:b) cin>>i;
vi used(n,1);
for(int j=0;j<30;j++){
vi c(n);
for(int k=0;k<2;k++){
string s;
for(int i=0;i<n;i++){
if(((b[i]&1<<j)>0)^(k==1)) s+='1';
else s+='0';
}
for(int i=0;i<n;i++){
if(a[i]&1<<j) s+='1';
else s+='0';
}
for(int i=0;i<n;i++){
if(a[i]&1<<j) s+='1';
else s+='0';
}
vi z=Z_Algorithm(s);
for(int i=0;i<n;i++) if(z[i+n]>=n) c[i]=1;
// cout<<s<<endl;
// for(auto i:z) cout<<i<<' ';cout<<endl;
}
// for(auto i:c) cout<<i<<' ';
// cout<<endl;
for(int i=0;i<n;i++) used[i]&=c[i];
}
for(int i=0;i<n;i++) if(used[i]) cout<<i<<' '<<(a[i]^b[0])<<endl;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
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; }
struct MaxFlow{
int n;
struct edge{
int to, cap, rev;
edge(int to, int cap, int rev):to(to), cap(cap), rev(rev) {}
};
vector<vector<edge>> G;
vector<int> level, iter;
MaxFlow(int N): n(N){
G.resize(N);
level.resize(N);
iter.resize(N);
}
void add_edge(int from, int to, int cap){
G[from].emplace_back(to, cap, G[to].size());
G[to].emplace_back(from, 0, G[from].size()-1);
}
void bfs(int s){
level.assign(n, -1);
queue<int> q;
level[s] = 0;
q.push(s);
while(!q.empty()){
int v = q.front(); q.pop();
for(int i=0; i<G[v].size(); i++){
edge& e = G[v][i];
if(0 < e.cap && level[e.to] < 0){
level[e.to] = level[v] + 1;
q.push(e.to);
}
}
}
}
int dfs(int v, int t, int f){
if(v == t) return f;
for(int& i = iter[v]; i<G[v].size(); i++){
edge& e = G[v][i];
if(0 < e.cap && level[v] < level[e.to]){
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0){
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t){
// O(|E||V|^2)
int flow = 0;
for(;;){
bfs(s);
if(level[t] < 0) return flow;
iter.assign(n, 0);
int f;
while((f = dfs(s, t, INF)) > 0){
flow += f;
}
}
}
};
void Main(){
int N; cin >> N;
VI a(N), b(N), c(N), d(N);
REP(i,N) cin >> a[i] >> b[i];
REP(i,N) cin >> c[i] >> d[i];
MaxFlow mf(N+N+2);
REP(i,N)REP(j,N){
if(a[i]<c[j] && b[i]<d[j]) mf.add_edge(i,j+N,1);
}
REP(i,N){
mf.add_edge(N+N,i,1);
mf.add_edge(i+N,N+N+1,1);
}
int ans = mf.max_flow(N+N,N+N+1);
cout << ans << en;
return;
}
int main(void){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
int t=1; //cin>>t;
REP(_,t) Main();
return 0;
} | 0 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout<<fixed<<setprecision(15);
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
int main(){
Init();
ll n, k; cin >> n >> k;
vi a(n);
bool possible = false;
ll gcdNum = -1;
rep(i, n){
cin >> a[i];
if(a[i] == k) possible = true;
if(i == 0) gcdNum = a[i];
else gcdNum = __gcd(gcdNum, a[i]);
}
sort(all(a));
if(a[n-1] >= k && !possible){
ll sub = k-a[n-1];
if(sub%gcdNum == 0) possible = true;
}
cout << (possible ? "POSSIBLE" : "IMPOSSIBLE") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,A,Z;
cin>>N>>K>>A;
Z=A;
for(int i=1;i<N;i++){
int b;
cin>>b;
A=gcd(A,b);
Z=max(Z,b);
}
if(K<=Z&&K%A==0){
cout<<"POSSIBLE"<<endl;
}
else{
cout<<"IMPOSSIBLE"<<endl;
}
}
| 1 |
#include <iostream>
#include <cstdlib>
#include <vector>
#include <string>
class Dice {
private:
std::vector<int> number;
std::vector<int> initialize();
std::string order_list;
std::string decide_order();
public:
std::string set_order();
void move(std::string orders);
void print();
Dice() {
number = initialize();
order_list = decide_order();
}
};
int main(void) {
Dice dice;
std::string orders = dice.set_order();
dice.move(orders);
dice.print();
return EXIT_SUCCESS;
}
std::vector<int> Dice::initialize() {
number.resize(6);
int temp;
for (int surface = 0; surface < 6; surface++) {
std::cin >> number[surface];
}
return number;
}
std::string Dice::decide_order() {
std::cin >> order_list;
return order_list;
}
std::string Dice::set_order() {
return order_list;
}
void Dice::move(std::string orders) {
std::vector<int> new_dice(6 ,0);
int deflt_data[] = {1, 2, 3, 4, 5, 6};
std::vector<int> deflt(deflt_data, deflt_data + 6);
int east_data[] = {4, 2, 1, 6, 5, 3};
std::vector<int> east(east_data, east_data + 6);
int west_data[] = {3, 2, 6, 1, 5, 4};
std::vector<int> west(west_data, west_data + 6);
int south_data[] = {5, 1, 3, 4, 6, 2};
std::vector<int> south(south_data, south_data + 6);
int north_data[] = {2, 6, 3, 4, 1, 5};
std::vector<int> north(north_data, north_data + 6);
std::string dir;
for (int loop = 0; loop < orders.size(); loop++) {
dir = orders[loop];
if (dir == "E") {
for (int loop = 0; loop < 6; loop++) {
new_dice[deflt[loop] - 1] = number[east[loop] - 1];
}
} else if (dir == "W") {
for (int loop = 0; loop < 6; loop++) {
new_dice[deflt[loop] - 1] = number[west[loop] - 1];
}
} else if (dir == "S") {
for (int loop = 0; loop < 6; loop++) {
new_dice[deflt[loop] - 1] = number[south[loop] - 1];
}
} else if (dir == "N") {
for (int loop = 0; loop < 6; loop++) {
new_dice[deflt[loop] - 1] = number[north[loop] - 1];
}
}
number = new_dice;
}
return;
}
void Dice::print() {
/*
for (int surface = 0; surface < number.size(); surface++) {
std::cout << number[surface] << " ";
}
std::cout << std::endl;
*/
std::cout << number[0] << std::endl;
return;
} | #include<iostream>
using namespace std;
class Dice{
int _num[6];
public:
void set(int num[6]){
for(int i = 0; i < 6; i++) _num[i] = num[i];
}
void N(){
swap(_num[0],_num[4]);
swap(_num[0],_num[5]);
swap(_num[0],_num[1]);
}
void S(){
swap(_num[0],_num[1]);
swap(_num[0],_num[5]);
swap(_num[0],_num[4]);
}
void W(){
swap(_num[0],_num[3]);
swap(_num[0],_num[5]);
swap(_num[0],_num[2]);
}
void E(){
swap(_num[0],_num[2]);
swap(_num[0],_num[5]);
swap(_num[0],_num[3]);
}
void printTop(){
cout << _num[0] << endl;
}
};
int main(){
int num[6];
for(int i = 0; i < 6; i++) cin >> num[i];
Dice d;
d.set(num);
string cmd;
cin >> cmd;
while(cmd.size() > 0){
char c = cmd[0];
cmd = cmd.substr(1);
switch(c){
case('N'):
d.N(); break;
case('S'):
d.S(); break;
case('W'):
d.W(); break;
case('E'):
d.E(); break;
}
}
d.printTop();
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.