code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
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; }
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) (x.begin(), x.end())
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
int a, b;
cin >> a >> b;
if(a%b==0) cout << 0 << endl;
else cout << 1 << endl;
} | /// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)998244353;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
int sum(int x, int y) {
add(x, y);
return x;
}
int mult(int x, int y) {
return x * 1ll * y % mod;
}
int bp(int x, int y) {
if (x < 0) return 0;
int res = 1;
while (y) {
if (y & 1) res = res * 1ll * x;
x = x * 1ll * x % mod, y >>= 1;
}
return res;
}
int n, k;
int dp[N][N][2];
int calc(int ost, int prs, int f) {
if (ost < 0) return 0;
if (!ost) return 1;
if (~dp[ost][prs][f]) return dp[ost][prs][f];
int res = 0;
if (prs) add(res, calc(ost, prs - 1, 1));
if (f) {
if (prs) add(res, calc(ost - 1, prs, 0) * 2ll % mod);
} else {
add(res, calc(ost - 1, prs, 0));
}
return dp[ost][prs][f] = res;
}
int dp1[N][N];
int calc1(int ost, int cnt) {
if (ost < 0) return 0;
if (!ost || cnt <= 0) return !ost;
if (~dp1[ost][cnt]) return dp1[ost][cnt];
int res = calc1(ost, cnt - 1);
if (cnt) add(res, calc1(ost - 1, cnt));
return dp1[ost][cnt] = res;
}
int total(int K) {
int prs = 0;
rep(i, 1, K) {
prs += (K - i <= k && i < K - i);
}
int res = 0;
rep(i, 0, n) {
int cnt1 = sum(calc(i, prs, 1), calc(i - 1, prs, 1) * (K % 2 == 0 && K / 2 <= k));
/* cout << calc(i, prs, (K % 2 == 0 && K / 2 <= n), 1) << nl;
cout << calc1(n - i, k - 2 * prs - (K % 2 == 0 && K / 2 <= n)) << nl;
cout << nl; */
add(res, mult(cnt1, calc1(n - i, k - 2 * prs - (K % 2 == 0 && K / 2 <= k))));
}
return res;
}
int main() {
#ifdef wws
freopen ("in.txt", "r", stdin);
#endif
cin >> k >> n;
memset(dp, -1, sizeof(dp));
memset(dp1, -1, sizeof(dp1));
rep(i, 2, 2 * k) {
cout << total(i) << nl;
}
ioi
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
cout << (N / 1 * 1 * (N / 1 + 1) - N / 3 * 3 * (N / 3 + 1) - N / 5 * 5 * (N / 5 + 1) + N / 15 * 15 * (N / 15 + 1)) / 2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int res = 0;
if (s[0] == 'R'||s[1] == 'R'||s[2] == 'R') res = 1;
if (s[0] == 'R' && s[1] == 'R') res = 2;
if (s[1] == 'R' && s[2] == 'R') res = 2;
if (s[0] == 'R' && s[1] == 'R' && s[2] == 'R') res = 3;
cout << res << endl;
return 0;
} | 0 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
const int INF = 1000000007;
const long double EPS = 1e-15;
const long double PI = acos(-1);
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
// *max_element(all(d))
class UnionFind{
private:
vector<int>par;
public:
UnionFind(int n):par(n,-1){}
int root(int x){
if(par[x] < 0)return x;
return par[x] = root(par[x]);
}
bool unite(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;
}
bool same(int x,int y){
return root(x) == root(y);
}
int size(int x) {
return -par[root(x)];
}
};
int solve(){
int n,k,l;
cin >> n >> k >> l;
UnionFind uf(n),uf2(n);
rep(i,k){
int a,b;
cin >> a >> b;
a--;
b--;
uf.unite(a,b);
}
rep(i,l){
int a,b;
cin >> a >> b;
a--;
b--;
uf2.unite(a,b);
}
map<pair<int,int>,int>m;
rep(i,n){
pair<int,int>P;
P.first = uf.root(i);
P.second = uf2.root(i);
m[P]++;
}
rep(i,n){
pair<int,int>P;
P.first = uf.root(i);
P.second = uf2.root(i);
cout << m[P] << " ";
}
cout << endl;
return 0;
}
int main(){
// ios::sync_with_stdio(false);cin.tie(nullptr);
cout << fixed;cout << setprecision(16);
solve();
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001
vi adj[2][N];
int vis[N];
int vit;
int wh[2][N];
void d1(int v){
vis[v] = vit;
wh[0][v] = vit;
FORR(i,adj[0][v]){
if(vis[i] != vit)
d1(i);
}
}
void d2(int v){
vis[v] = vit;
wh[1][v] = vit;
FORR(i,adj[1][v]){
if(vis[i] != vit)
d2(i);
}
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n,k,l;
sc(n,k,l);
int f,s;
while(k--){
sc(f,s);
--f,--s;
adj[0][f].pb(s);
adj[0][s].pb(f);
}
while(l--){
sc(f,s);
--f,--s;
adj[1][f].pb(s);
adj[1][s].pb(f);
}
FOR(i,0,n){
if(!vis[i]){
++vit;
d1(i);
}
}
memset(vis,0,n<<2);
FOR(i,0,n){
if(!vis[i]){
++vit;
d2(i);
}
}
map<pi,int> st;
FOR(i,0,n){
++st[mp(wh[0][i],wh[1][i])];
}
FOR(i,0,n){
cout << st[mp(wh[0][i],wh[1][i])] << ' ';
}
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;
int main(){
int t; cin>>t;
REP(kai,t){
int out=0;
int point=0;
bool rui[3]={false,false,false};
while(true){
string s; cin>>s;
if(s=="OUT"){
out++;
if(out==3)goto nextf;
}else if(s=="HOMERUN"){
point++;
REP(j,3)if(rui[j])point++;
REP(j,3)rui[j]=false;
}else{
if(rui[2])point++;
rui[2]=rui[1];
rui[1]=rui[0];
rui[0]=true;
}
}
nextf:;
cout<<point<<endl;
}
return 0;
} | #include <cstdio>
#include <algorithm>
#include <functional>
#include <stack>
#include <cmath>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define llong long long
int main() {
while(1){
int n;
scanf("%d",&n);
if(n == 0) break;
int a[n];
REP(i,n) scanf("%d",a+i);
int maxseq = a[0];
int sum = 0;
REP(i,n) {
sum = max(sum+a[i], a[i]);
if(maxseq < sum) maxseq = sum;
}
if(maxseq < sum) maxseq = sum;
printf("%d\n",maxseq);
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define LL long long
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define FOD(i,a,b) for(int i=a; i>=b; i--)
#define pa pair<int,int>
#define fi first
#define se second
#define MOD xxx
#define getbit(n,i) ((n>>(i-1))&1)
#define offbit(n,i) ((n^(1<<(i-1))
#define onbit(n,i) (n|(1<<(i-1)))
#define cntone(x) (__builtin_popcount(x))
using namespace std;
const int N = 80+5;
const int P = 12800;
int m,n;
int A[N][N],B[N][N];
int F[N][N][N*N*4];
int tmp,ans(0);
int main()
{
cin >> m >> n;
FOR(i,1,m)
FOR(j,1,n) cin >> A[i][j];
FOR(i,1,m)
FOR(j,1,n) cin >> B[i][j];
tmp = A[1][1] - B[1][1];
F[1][1][tmp +P] = F[1][1][-tmp +P] = 1;
FOR(i,1,m)
FOR(j,1,n)
if(i+j!=2)
{
tmp = A[i][j] - B[i][j];
FOR(k,0,2*P)
if(F[i-1][j][k] || F[i][j-1][k])
{
F[i][j][k+tmp] = F[i][j][k-tmp] = 1;
}
}
FOR(i,0,P)
{
if(F[m][n][i+P]==1)
{
ans = i;
break;
}
if(F[m][n][i])
ans = i-P;
}
cout << abs(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, x, cur = 0;
vector<vector<long long>> tests;
long long check(long long k){
long long best, complete = k / x, other = k % x, cursum = 0;
if(complete >= n)
return cur + 1;
for(int i = 0; i < complete; ++i)
cursum += tests[i][0];
best = cursum;
for(int i = 0; i < n; ++i){
if(i < complete){
best = max(best, tests[complete][0] + (cursum - tests[i][0]) + tests[i][3] * other - tests[i][1] * (tests[i][3] - tests[i][2]));
best = max(best, tests[complete][0] + (cursum - tests[i][0]) + tests[i][2] * other);
} else {
best = max(best, cursum + tests[i][3] * other - tests[i][1] * (tests[i][3] - tests[i][2]));
best = max(best, cursum + tests[i][2] * other);
}
}
return best;
}
int main(){
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
long long b, l ,u; cin >> n >> x;
for(int i = 0; i < n; ++i){
cin >> b >> l >> u;
cur += b * l;
tests.push_back({(x - b) * u + b * l, b, l, u});
}
sort(tests.begin(), tests.end(), greater<vector<long long>>());
long long mid, lef = -1, rig = n * x;
for(;lef < rig - 1;){
mid = lef + rig >> 1;
if(check(mid) >= cur)
rig = mid;
else
lef = mid;
}
cout << rig << "\n";
return 0;
} | 0 |
#include <iostream>
#include <vector>
using i64 = long long;
template <class T = long long int>
class Bit {
private:
unsigned len;
T init;
std::vector<T> arr;
public:
Bit(unsigned length, T initialValue = 0): len(length), init(initialValue), arr(len + 1, init) {}
void update(unsigned a, T newval) {
for (unsigned x = a; x <= len; x += x & -x) arr[x] += newval;
}
T query(unsigned a) const {
T ret = init;
for (unsigned x = a; x > 0; x -= x & -x) ret += arr[x];
return ret;
}
};
int main() {
int n, q;
std::cin >> n >> q;
Bit<> b(n + 1);
for (int i = 0; i < n; i++) {
i64 a;
std::cin >> a;
b.update(i + 1, a);
}
while (q--) {
int t, x, y;
std::cin >> t >> x >> y;
if (t) std::cout << b.query(y) - b.query(x) << '\n';
else b.update(x + 1, y);
}
return 0;
}
| #include<bits/stdc++.h>
#define maxn 100005
#define endl '\n'
using namespace std;
int arr[maxn],brr[maxn],pre[maxn];
struct sqrtd {
int next,cnt;
}table[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for(int i=1;i<=n;i++)
cin >> arr[i];
for(int i=1;i<n;i++)
brr[i] = arr[i+1] - arr[i] , pre[i] = brr[i] + pre[i-1];
n--;
int L;
cin >> L;
int box = sqrt(n);
for(int i=1;i<=n;i++) {
int tem_cnt = 0 , bound = min((i/box+1)*box,n);
int j , sum = 0;
for(j=i;j<=bound;) {
sum = 0;
do {
sum += brr[j++];
} while(j <= bound && sum + brr[j] <= L);
tem_cnt++;
}
if(j > bound && j <= n && sum + brr[j] <= L) {
int l = j , r = n , m;
while(true) {
if(r-l<3) {
for(m=l;m<=r && pre[m]-pre[j-1]+sum <= L;m++);
break;
}
m = (l+r)>>1;
if(pre[m]-pre[j-1]+sum <= L)
l = m;
else
r = m-1;
}
j = m;
}
table[i] = {j,tem_cnt};
}
int q;
cin >> q;
while(q--) {
int l,r;
cin >> l >> r;
if(l > r) swap(l,r);
r--;
int ans = 0;
while(l <= r && l/box != r/box) {
ans += table[l].cnt;
l = table[l].next;
}
if(l <= r && l/box == r/box) {
while(l <= r) {
int sum = 0;
do {
sum += brr[l++];
} while(l <= r && sum + brr[l] <= L);
ans++;
}
}
cout << ans << endl;
}
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
string revstr( string str ) {
string ret;
for(int i = str.length() - 1; i >= 0; i--)
ret += str[i];
return ret;
}
int main(void){
string str;
cin >> str;
cout << revstr( str ) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
int toInt(char c) {
return c-'0';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s; cin >> s;
reverse(all(s));
int n = s.size();
vector<vector<ll>> dp(n+1, vector<ll>(2, longinf));
dp[0][0] = 0;
rep(i, n) {
if(toInt(s[i]) == 9) {
dp[i+1][0] = min({dp[i][0]+toInt(s[i])});
dp[i+1][1] = min({dp[i][0]+10-toInt(s[i]), dp[i][1]+10-(toInt(s[i])+1), dp[i][1]+1});
} else {
dp[i+1][0] = min({dp[i][0]+toInt(s[i]), dp[i][1]+toInt(s[i])+1});
dp[i+1][1] = min({dp[i][0]+10-toInt(s[i]), dp[i][1]+10-(toInt(s[i])+1)});
}
}
cout << min(dp[n][0], dp[n][1]+1) << "\n";
return 0;
}
| 0 |
/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define flsh '\n'<<flush
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) __begin = clock(); ccc; cerr<<"Time of work = "<<(clock()-__begin)/CLOCKS_PER_SEC<<endl;
#define MAX3 2010
#define MAX4 20010
#define MAX5 200010
#define MAX6 2000010
//cin.ignore (7777, '\n');
using namespace std;
using namespace __gnu_pbds;
const ll MOD1=1000000007LL;
const ll MOD2=998244353LL;
#define debug(args...)(Debugger()) , args
class Debugger
{
public:
Debugger(const std::string& _separator=", ") :
first(true),separator(_separator){}
template<typename ObjectType>
Debugger& operator,(const ObjectType& v)
{
if(!first)cerr<<separator;
cerr<<v;
first=false;
return *this;
}
~Debugger() {cerr<<endl;}
private:
bool first;
string separator;
};
template <typename T1, typename T2>
inline ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p)
{
return os<<"("<<p.first<<", "<<p.second<<")";
}
template<typename T>
inline ostream &operator<<(ostream & os,const vector<T>& v)
{
bool first=true;
os<<"[";
for(unsigned ll i=0;i<v.size();i++)
{
if(!first)os<<", ";
os<<v[i];
first=false;
}
return os<<"]";
}
template<typename T>
inline ostream &operator<<(ostream & os,const set<T>&v)
{
bool first=true;
os<<"[";
for(typename set<T>::const_iterator ii=v.begin();ii!=v.end();++ii)
{
if(!first)os<<", ";
os<<*ii;
first=false;
}
return os<<"]";
}
template<typename T1, typename T2>
inline ostream &operator<<(ostream & os,const map<T1, T2>&v)
{
bool first=true;
os<<"[";
for(typename map<T1,T2>::const_iterator ii=v.begin(); ii!=v.end();++ii)
{
if(!first)os<<", ";
os<<*ii;
first=false;
}
return os<<"]";
}
string stroka;
ll dp[200010];
ll cnt[60];
int main(){
FAST_READ;
cin>>stroka;
ll n=(ll)stroka.size();
cnt[stroka[0]-'a']++;
for(ll i=1;i<(ll)stroka.size();i++)
{
dp[i]=dp[i-1];
cnt[stroka[i]-'a']++;
for(char j='a';j<='z';j++)if(stroka[i]!=j)dp[i]+=cnt[j-'a'];
}
cout<<dp[n-1]+1<<endl;
return 0;
}
| //0039
//include-------------------------------------
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
using namespace std;
//typedef--------------------------------------
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define MP make_pair
//repetition-----------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
//constant-------------------------------------
const double PI = acos(-1.0);
//cout,cin-------------------------------------
#define COUT(x) cout<<(x)<<endl
#define CIN(x) cin>>(x)
int f(char c){
if (c == 'I') return 1;
else if (c == 'V') return 5;
else if (c == 'X') return 10;
else if (c == 'L') return 50;
else if (c == 'C') return 100;
else if (c == 'D') return 500;
else if (c == 'M') return 1000;
}
int main(){
int ans = 0;
string st;
while (CIN(st)){
int now = f(st[0]);
if (st.size() == 1) ans = now;
ans = now;
REP(i, st.size() - 1){
now >= f(st[i + 1]) ? ans += f(st[i + 1]) : ans += f(st[i + 1]) - now - now;
now = f(st[i + 1]);
}
COUT(ans);
}
return 0;
} | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph=vector<vector<int>>;
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>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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
ll N,ans=0;
cin>>N;
ll A[N],B[N];
// A[i] S[i]の最小値
// B[i] S[i]の値
REP(i,N){
A[i]=0;
B[i]=0;
}
string S[N];
REP(i,N) cin>>S[i];
REP(i,N){
ll cnt=0;
REP(j,S[i].size()){
if(S[i].at(j)=='(') cnt++;
else cnt--;
chmin(A[i],cnt);
}
B[i]=cnt;
}
vector<pair<int,int>> L,LL,LLL;
bool CAN=true;
REP(i,N){
if(B[i]>0){
if(A[i]>=0ll) L.PB(MP(A[i],B[i]));
else LL.PB(MP(A[i],B[i]));
}
else LLL.PB(MP(B[i]-A[i],A[i]));
}
SORT(L);
REVERSE(L);
SORT(LL);
REVERSE(LL);
SORT(LLL);
REVERSE(LLL);
REP(i,L.size()){
if(ans+L[i].first<0) CAN=false;
ans+=L[i].second;
}
REP(i,LL.size()){
if(ans+LL[i].first<0) CAN=false;
ans+=LL[i].second;
}
REP(i,LLL.size()){
if(ans+LLL[i].second<0) CAN=false;
ans+=LLL[i].first+LLL[i].second;
}
if(ans!=0) CAN=false;
if(CAN) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
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; }
bool check(vector<P> s){
int h = 0;
for(P p : s){
int b = h + p.first;
if(b < 0) return false;
h += p.second;
}
return true;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<P> ls, rs;
int total = 0;
rep(i,n){
string s;
cin >> s;
int h = 0, b = 0;
for(char c : s){
if(c == '(') ++h;
else --h;
chmin(b, h);
}
if(h > 0) ls.emplace_back(b, h);
else rs.emplace_back(b-h, -h);
total += h;
}
sort(ls.rbegin(), ls.rend());
sort(rs.rbegin(), rs.rend());
if(check(ls) && check(rs) && total == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
int n;
while(1) {
if(scanf("%d", &n) == EOF) break;
int total = 0;
rep2(i,1,(600/n)) {
total += n * n * i * n * i;
}
cout << total << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
map<string, int> day;
day["SUN"] = 7;
day["MON"] = 6;
day["TUE"] = 5;
day["WED"] = 4;
day["THU"] = 3;
day["FRI"] = 2;
day["SAT"] = 1;
string s;
cin >> s;
cout << day[s] << endl;
return 0;
}
| 0 |
#include<iostream>
#define INF 100000000000000
#define MAXN 1000+10
using namespace std;
long long dist[MAXN][MAXN];
int main(){
int i,j,k,n,m,a,b;
cin>>n>>m;
for (i = 0;i < n;++i){
for (j = 0;j < n;++j){
if (i != j) {
dist[i][j]=INF;
}
}
}
for (i = 0;i < m;++i){
cin>>a>>b;
cin>>dist[a][b];
}
for (k = 0;k < n;++k){
for (i = 0;i < n;++i){
for (j = 0;j < n;++j){
if (dist[i][k] != INF && dist[k][j] != INF)dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
}
}
}
for (i = 0;i < n;++i){
if (dist[i][i] < 0) {
cout<<"NEGATIVE CYCLE"<<endl;
return 0;
}
}
for (i = 0;i < n;++i){
for (j = 0;j < n;++j){
if (j) cout<<" ";
if (dist[i][j] == INF) cout<<"INF";
else cout<<dist[i][j];
}
cout<<endl;
}
return 0;
} | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using gp_queue=priority_queue<T, deque<T>, less<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
Edge(size_t src, size_t dst, Weight weight=1):
src(src), dst(dst), weight(weight)
{}
};
bool operator<(const Edge &e, const Edge &f) {
if (e.weight != f.weight) {
return e.weight > f.weight;
} else {
return e.src!=f.src? e.src<f.src : e.dst<f.dst;
}
}
using Edges=vector<Edge>;
using Vertex=vector<Edge>;
using Graph=vector<Vertex>;
void join(Graph &g, size_t s, size_t d, Weight w=1) {
// non-directed
g[s].push_back(Edge(s, d, w));
g[d].push_back(Edge(d, s, w));
}
void connect(Graph &g, size_t s, size_t d, Weight w=1) {
// directed
g[s].push_back(Edge(s, d, w));
}
vector<vector<Weight>> shortest_distance(Graph g) {
/* Johnson */
size_t V=g.size();
vector<Weight> h(V);
for (size_t k=0; k<V; ++k)
for (size_t i=0; i<V; ++i)
for (const Edge &e: g[i])
if (h[e.dst] > h[e.src] + e.weight) {
h[e.dst] = h[e.src] + e.weight;
if (k == V-1)
return vector<vector<Weight>>();
}
for (size_t i=0; i<V; ++i)
for (Edge &e: g[i])
e.weight += h[e.src] - h[e.dst];
vector<vector<Weight>> d(V, vector<Weight>(V, INF<<1));
vector<vector<size_t>> prev(V, vector<size_t>(V, -1));
for (size_t s=0; s<V; ++s) {
gp_queue<Edge> q; q.push(Edge(s, s, 0));
d[s][s] = 0;
while (!q.empty()) {
Edge e=q.top(); q.pop();
if (~prev[s][e.dst]) continue;
prev[s][e.dst] = e.src;
for (const Edge &f: g[e.dst]) {
if (d[s][f.dst] > e.weight + f.weight) {
d[s][f.dst] = e.weight + f.weight;
q.push(Edge(f.src, f.dst, e.weight+f.weight));
}
}
}
for (size_t u=0; u<V; ++u)
d[s][u] += h[u] - h[s];
}
return d;
}
int main() {
size_t V, E;
scanf("%zu %zu", &V, &E);
Graph g(V);
for (size_t i=0; i<E; ++i) {
size_t s, t;
Weight d;
scanf("%zu %zu %lld", &s, &t, &d);
connect(g, s, t, d);
}
vector<vector<Weight>> d=shortest_distance(g);
if (d.empty())
return !printf("NEGATIVE CYCLE\n");
for (vector<Weight> w: d)
for (size_t i=0; i<V; ++i)
if (w[i] < INF) {
printf("%lld%c", w[i], i<V-1? ' ':'\n');
} else {
printf("INF%c", i<V-1? ' ':'\n');
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const long double pi=acos(-1);
int main(){cout<<fixed<<setprecision(10);
string s;
cin>>s;
ll n=s.size();
//abjka 両端が同じなら数えない
ll ans=1;
map<char,ll> cnt;
rep(i,0,n)cnt[s[i]]++;
ans+=n*(n-1)/2;
ll c;
for(auto v:cnt){
c=v.second;
ans-=c*(c-1)/2;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll N;
bool prime[55556];
vector<ll> v;
signed main(){
cin >> N;
for(ll i = 2; i <= 55555; i++) prime[i] = true;
for(ll i = 2; i <= 55555; i++){
if(prime[i] == false) continue;
if(i % 5 == 1) v.push_back(i);
for(ll j = 2; i * j <= 55555; j++) prime[i * j] = false;
}
REP(i, N){
cout << v[i];
if(i == N - 1) cout << endl;
else cout << " ";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1234567;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[200005];
signed main() {
int N;
cin >> N;
vector<int>a(N);
for(int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int>ans;
for(int i = N; i >= 1; i--) {
if(cnt[i]%2 == a[i-1]) {
continue;
}
ans.push_back(i);
for(int j = 1; j*j <= i; j++) {
if(i%j == 0) {
if(j*j == i) {
cnt[j]++;
}
else {
cnt[j]++;
cnt[i/j]++;
}
}
}
}
cout << ans.size() << endl;
for(int i = 0; i < ans.size(); i++) {
if(i) {
cout << " ";
}
cout << ans[i];
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a[n+1];
rep(i,n) cin >> a[i+1];
int ans[n+1];
rep(i,n) ans[i+1] = 0;
//rep(i,n) cout << a[i] << endl;
for(int i = n; i >= 1; --i) {
//printf("OK\n");
for(int j = i; j <= n; j += i) {
ans[i] = (ans[i]+ans[j])%2;
}
ans[i] = (ans[i]+a[i])%2;
//printf("OK2\n");
}
//rep(i,n) cout << ans[i+1] << endl;
int cnt = 0;
rep(i,n) {
if(ans[i+1]) cnt++;
}
if (cnt) {
cout << cnt << endl;
rep(i,n) {
if (ans[i+1]) {
printf("%d\n", i+1);
}
}
} else cout << 0 << endl;
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
#define MAX_N 20000
#define MAX_M 16
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
int e, m;
int main(){
while (cin >> e&&e){
int m = 1000001;
for (int i = 0; i <= 100; i++){
for (int j = 0; j <= 1000; j++){
int x = e - i*i*i - j*j;
if (x >= 0){
m = min(m, x + i + j);
}
}
}
cout << m << endl;
}
} | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
struct MY_WRITER{
char buf[1048576];
int s;
int e;
MY_WRITER(){
s = 0;
e = 1048576;
}
~MY_WRITER(){
if(s){
fwrite_unlocked(buf, 1, s, stdout);
}
}
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
MY_WRITER_VAR.s = 0;
}
MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
my_putchar_unlocked(a);
}
inline void wt_L(long long x){
int s=0;
int m=0;
char f[20];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
my_putchar_unlocked('-');
}
while(s--){
my_putchar_unlocked(f[s]+'0');
}
}
template<class S, class T> inline S chmax(S &a, T b){
if(a<b){
a=b;
}
return a;
}
int N;
int A[200000];
int main(){
int i;
long long res = 0;
long long mx = -1;
rd(N);
{
int Lj4PdHRW;
for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
rd(A[Lj4PdHRW]);
}
}
for(i=(0);i<(N);i++){
res +=max_L(mx - A[i], 0);
chmax(mx, A[i]);
}
wt_L(res);
wt_L('\n');
return 0;
}
// cLay varsion 20200911-1
// --- original code ---
// int N, A[2d5];
// {
// ll res = 0, mx = -1;
// rd(N,A(N));
// rep(i,N){
// res += max(mx - A[i], 0);
// mx >?= A[i];
// }
// wt(res);
// }
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = s.substr(0, s.size()-8);
cout << ans << endl;
return 0;
} | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define rep2(i, n) for(int i = 2; i < (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a)//少数出力
#define printdbd(a) printf("%.16lf\n", a)//少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str())//string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2)//等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg)/360.0)*2.0*PI)
#define rad_to_deg(rad) (((rad)/2.0/PI)*360.0)
#define Please return
#define AC 0
#define ushi int
#define tapu main
#define nichia (
#define kunn void
#define wara )
using ll = long long;
const int INF = 1073741823;
const int MINF = -1073741823;
const ll LINF = ll(4661686018427387903);
const ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
void scans(string& str) {
char c;
scanf("%c", &c);
if (c == '\n')scanf("%c", &c);//最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char& str) {
char c;
scanf("%c", &c);
if (c == -1)return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) {
return PI / 2 - atan(x);
}
/*-----------------------------------------ここからコード-----------------------------------------*/
int main(){
string s;
scans(s);
prints(s.substr(0, s.length() - 8));
Please AC;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
int h;
ll ans = 0;
cin >> h;
for(int i=0;i<n-1;i++){
int nh;
cin >> nh;
if(nh>=h) h = nh;
else ans += (h-nh);
}
cout << ans << endl;
return 0;
} | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<sstream>
#include<queue>
#include <iomanip>
#include<unordered_set>
#include <stack>
#include <unordered_map>
#include <map>
#include<numeric>
#include<chrono>
#include <fstream>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i,a,b) for(ll i=(ll)a;i<(ll)b;i+=1)
#define rf(i,a,b) for(ll i=(ll)a;i>=(ll)b;i-=1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define M 998244353
#define all(x) x.begin(),x.end()
#define mkp(a,b) make_pair(a,b)
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
inline int mex(unordered_set<int> st)
{
int m = 0;
while (st.find(m) != st.end())
{
m += 1;
}
return m;
}
inline int calculateGrundy(int n)
{
if (n == 1)
return 0;
unordered_set<int> mexi;
for (int i = 1; i <= sqrt(n); i += 1)
{
if (n % i == 0)
{
if (n / i != n)
mexi.insert(calculateGrundy(n / i));
mexi.insert(calculateGrundy(i));
}
}
return mex(mexi);
}
inline ll gcd(ll a, ll b)
{
// This is code taken from geeksforgeek
if (b == 0)
return a;
return gcd(b, a % b);
}
/*ll power(ll x, ll y)
{
// This is code taken from geeksforgeek
ll res = 1;
x = x % N;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res * x) % N;
y = y >> 1;
x = (x * x) % N;
}
return res;
}*/
ll power(ll x, ll y)
{
ll res = 1;
x = x;
while (y > 0)
{
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
/*ll modInverse(ll n, ll p)
{
return power(n, p - 2, p);
}*/
ll sum(ll n)
{
return (n * (n + 1)) / 2;
}
ll sum_digit(ll n)
{
ll ans = 0;
while (n)
{
ans += n % 10;
n /= 10;
}
return ans;
}
ll gp(ll r, ll n)
{
return (pow(r, n) - 1) / (r - 1);
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n;
cin>>n;
vector<ll> arr(n,0);
f(i,0,n)
{
cin>>arr[i];
}
ll ans=0;
f(i,1,n)
{
if(arr[i]<arr[i-1])
{
ans+=arr[i-1]-arr[i];
arr[i]=arr[i-1];
}
}
cout<<ans;
return 0;
} | 1 |
#include <iostream>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int H, W, A[509][509];
vector<tuple<int, int, int, int>> L;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> A[i][j];
}
for (int i = 1; i <= H; i++) {
for (int j = W - 1; j >= 1; j--) {
if (A[i][j + 1] % 2 == 0) continue;
L.push_back(make_tuple(i, j + 1, i, j));
A[i][j + 1]--;
A[i][j]++;
}
}
for (int i = H - 1; i >= 1; i--) {
if (A[i + 1][1] % 2 == 0) continue;
L.push_back(make_tuple(i + 1, 1, i, 1));
A[i + 1][1]--;
A[i][1]++;
}
cout << L.size() << endl;
for (int i = 0; i < L.size(); i++) cout << get<0>(L[i]) << " " << get<1>(L[i]) << " " << get<2>(L[i]) << " " << get<3>(L[i]) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount
#define INF 1e16
#define mod 1000000007
ll N,M;
vector<int> A;
int main(){
cin>>N>>M;
A.resize(M);
rep(i,M)cin>>A[i];
if(M==1){
cout<<A[0]<<endl;
if(A[0]>1){
cout<<2<<endl;
cout<<A[0]-1<<" "<<1<<endl;
}else{
cout<<1<<endl;
cout<<1<<endl;
}
return 0;
}
vector<int> os;
rep(i,M){
if(A[i]%2==1)os.push_back(i);
}
if(os.size()>2){
cout<<"Impossible"<<endl;
return 0;
}
if(os.size()==1){
swap(A[0],A[os[0]]);
}else if(os.size()==2){
swap(A[0],A[os[0]]);
swap(A[M-1],A[os[1]]);
}
rep(i,M)cout<<A[i]<<" ";
cout<<endl;
if(A[0]-1>0){
cout<<M<<endl;
cout<<A[0]-1<<" ";
}else{
cout<<M-1<<endl;
}
repl(i,1,M-1)cout<<A[i]<<" ";
cout<<A[M-1]+1<<endl;
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
#define maxn 1000010
using namespace std;
typedef long long llg;
struct data{
int l,r;
data(int a=0,int b=0):l(a),r(b){}
}s[maxn];
int *q[26],lq[26],ct[26],n;
int R[maxn],ls,d[maxn];
char S[maxn],T[maxn];
int erfen(int *a,int r,int x){
int l=0,mid;
while(l!=r){
mid=(l+r)>>1;
if(a[mid]>=x) r=mid;
else l=mid+1;
}
return l;
}
int main(){
scanf("%d",&n);
scanf("%s\n%s",S+1,T+1);
for(int i=1;i<=n;i++) ct[S[i]-'a']++;
for(int i=0;i<26;i++) q[i]=new int[ct[i]+10];
for(int i=1,x;i<=n;i++)
x=S[i]-'a',q[x][++lq[x]]=i;
for(int i=0;i<26;i++) q[i][++lq[i]]=n+1,q[i][0]=0;
for(int i=n,x,y,l=n;i;i--){
x=T[i]-'a'; l=min(l,i);
y=q[x][erfen(q[x],lq[x],l+1)-1];
if(!y) return printf("-1"),0;
if(!R[y]) R[y]=i; if(y<l) l=y;
}
for(int i=1;i<=n;i++)
if(R[i]) s[++ls]=data(i,R[i]),d[ls]=i-ls;
s[++ls]=data(n*2,n*2),d[ls]=n*2-ls;
int ans=0;
for(int i=1,j=1;i<=ls;i++){
while(d[j]<s[i].r-i) j++;
ans=max(ans,j-i);
}
printf("%d",ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return a<b?b:a;}
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}
namespace ae86
{
const int bufl = 1<<15;
char buf[bufl],*s=buf,*t=buf;
inline int fetch()
{
if(s==t){t=(s=buf)+fread(buf,1,bufl,stdin);if(s==t)return EOF;}
return *s++;
}
inline int ty()
{
int a=0,b=1,c=fetch();
while(!isdigit(c))b^=c=='-',c=fetch();
while(isdigit(c))a=a*10+c-48,c=fetch();
return b?a:-a;
}
inline int ts(char *s)
{
int a=0,c=fetch();
while(c<=32 && c!=EOF)c=fetch();
while(c>32 && c!=EOF)s[a++]=c,c=fetch();
s[a]=0;
return a;
}
}
using ae86::ty;
using ae86::ts;
const int _ = 1000007;
int n,que[_],he,ta;char s[_]={0},t[_]={0};
int main()
{
n=ty(),ts(s+1),ts(t+1);
int got=0;
for(int i=1;i<=n;i++)if(s[i]!=t[i]){got=1;break;}
if(!got){puts("0");return 0;}
he=1,ta=0;
int ans=0;
for(int i=n,j=n;i>=1;i--)
{
if(t[i]==t[i-1])continue;
j=min(j,i);
while(j>0 && s[j]!=t[i])j--;
if(j<=0){puts("-1");return 0;}
while(he<=ta && que[he]-(ta-he+1)+1>i)he++;
que[++ta]=j;
if(i!=j)ans=max(ans,ta-he+1);
}
printf("%d\n",ans+1);
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define re register
int f[6010][9030],mod;
int main()
{
re int n;
scanf("%d%d",&n,&mod);
f[0][6010]=1;
for(re int i=0;i<3*n;i++)
{
for(re int j=-i;j<=i/2;j++)
if(f[i][j+6010]){
f[i+1][j-1+6010]=(f[i+1][j-1+6010]+f[i][j+6010])%mod;
f[i+2][j+1+6010]=(f[i+2][j+1+6010]+1ll*f[i][j+6010]*(i+1))%mod;
f[i+3][j+6010]=(f[i+3][j+6010]+1ll*(i+2)*(i+1)*f[i][j+6010])%mod;
}
}
re int ans=0;
for(re int i=-3*n;i<=0;i++)ans=(ans+f[3*n][i+6010])%mod;
printf("%d\n",ans);
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <cstring>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF 1e18
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
const ll MOD = 1e9 + 7;
ll fastPow(ll x, ll n)
{
if (n == 0)
return 1;
if (n % 2 == 0)
return fastPow(x * x % MOD, n / 2);
else
return x * fastPow(x, n - 1) % MOD;
}
ll fac[112345];
void combInit(int mx)
{
fac[0] = 0;
fac[1] = 1;
for (int i = 2; i <= mx; i++)
{
fac[i] = fac[i - 1] * i % MOD;
}
}
ll modDiv(ll a, ll b)
{
return a * fastPow(b, MOD - 2) % MOD;
}
int main()
{
combInit(11234);
ll perm[1010][1010];
for (int i = 1; i <= 1000; i++)
{
perm[i][1] = i;
for (int j = 2; j <= 1000; j++)
{
perm[i][j] = perm[i][j - 1] * (i - j + 1);
perm[i][j] %= MOD;
}
}
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
ll dp[1010][1010];
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= n; i++)
dp[0][i] = 1;
for (int i = 1; i <= n; i++)
{
for (int j = a; j <= b; j++)
{
dp[i][j] += dp[i][j - 1];
dp[i][j] %= MOD;
for (int k = c; k <= d; k++)
{
if (i - j * k < 0)
break;
dp[i][j] += dp[i - j * k][j - 1] * modDiv(perm[n - i + j * k][j * k], fastPow(fac[j], k) * fac[k] % MOD);
dp[i][j] %= MOD;
}
}
}
cout << dp[n][b] << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
bool truth = false;
cin >> n >> s;
s /= 1000;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n - i; j++)
{
if (i * 9 + j * 4 + n == s)
{
cout << i << ' ' << j << ' ' << n - i - j;
truth = true;
break;
}
}
if (truth == true) break;
}
if (truth == false) cout << "-1 -1 -1";
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
void otoshidama();
int main()
{
//darts();
//longest_dis();
//sum_of_three_integers();
otoshidama();
}
void darts()
{
while (true)
{
int n, m;
cin >> n >> m;
// stop cond
if (n == 0) break;
vector<int> p(n);
for (int i = 0; i < n; ++i) cin >> p[i];
// 2 darts combination
// p = q, 0, p + q
vector<int> q = p;
q.push_back(0);
for (int i = 0; i < n; ++i)
{
for (int j = 0; j <= i; ++j)
{
q.push_back(p[i] + p[j]);
}
}
sort(q.begin(), q.end());
// q's size = 1 + n + n(n + 1) / 2
//cout << q.size() << "\n";
//for (auto x : q) cout << x << " ";
int ret = 0;
int j = q.size() - 1;
//i:q linear scan
for (int i = 0; i < q.size(); ++i)
{
if (q[i] > m) break;
while (q[i] + q[j] > m) --j;
ret = max(ret, q[i] + q[j]);
}
cout << ret << "\n";
}
}
void longest_dis()
{
int n;
cin >> n;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; ++i) cin >> p[i].first >> p[i].second;
double v_max = 0.0;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if ((p[i].first - p[j].first) * (p[i].first - p[j].first)
+ (p[i].second - p[j].second) * (p[i].second - p[j].second)
> v_max * v_max)
{
v_max = sqrt((p[i].first - p[j].first) * (p[i].first - p[j].first)
+ (p[i].second - p[j].second) * (p[i].second - p[j].second));
}
}
}
cout << v_max << "\n";
}
void sum_of_three_integers()
{
int k, s;
cin >> k >> s;
int cnt = 0;
//for (int i = 0; i <= k; ++i)
//{
// for (int j = 0; j <= k; ++j)
// {
// for (int m = 0; m <= k; ++m)
// {
// if (i + j + m == s) ++cnt;
// }
// }
//}
for (int i = 0; i <= k; ++i)
{
for (int j = 0; j <= k; ++j)
{
int m = s - i - j;
if (0 <= m && m <= k) ++cnt;
}
}
cout << cnt << "\n";
}
void otoshidama()
{
int n, Y;
cin >> n >> Y;
for (int x = 0; x <= n; ++x)
{
for (int y = 0; x + y <= n; ++y)
{
int z = n - x - y;
if (x * 10000 + y * 5000 + z * 1000 == Y)
{
cout << x << " "<< y << " " << z << "\n";
return;
}
}
}
cout << "-1 -1 -1\n";
} | 1 |
#include <cstdio>
#include <cctype>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _T template <typename T>
#define _HT template <typename H, typename... T>
#define _il inline
#define _in _il int in
#define _sc _il bool scan
_T T in(int c){T n=0;bool m=false;while(isspace(c)){c=gcu();}if(c=='-')m=true,c=gcu();
do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m?-n:n;}
_in() {return in<int>(gcu());}
_T T scan(T &n){int c=gcu();return c==EOF?false:(n=in<T>(c),true);}
_sc(char &c){c=gcu();gcu();return c!=EOF;}
#ifdef _GLIBCXX_STRING
_sc(string &s){int c;s="";
for(;;){c=gcu();if(c=='\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}
#endif
_HT _sc(H &h, T&&... t){return scan(h)&&scan(t...);}
#define _vo _il void out
#define _vl _il void outl
_vo(bool b) {pcu('0'+b);}
_vo(const char *s){while(*s)pcu(*s++);}
_vo(char c){pcu(c);}
#ifdef _GLIBCXX_STRING
_vo(string s){for(char c:s)pcu(c);}
#endif
_T _vo(T n){static char buf[20];char *p=buf;
if(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;
while (p!=buf)pcu(*--p);}
_vl(){out('\n');}
#ifdef _GLIBCXX_VECTOR
_T _vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);outl();}
#endif
_HT _vo(H&& h, T&&... t){out(h);out(move(t)...);}
template <typename... T> _vl(T&&... t){out(move(t)...);outl();}
int main() {
for (int n, m; n = in(), m = in();) {
vector<int> v(n);
for (int &x: v)
x = in();
sort(v.rbegin(), v.rend());
int p = 0;
for (int i = 0; i < n; i++)
if ((i + 1) % m)
p += v[i];
outl(p);
}
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <climits>
#include <bitset>
#include <numeric>
using namespace std;
const long double PI = 3.14159265358979323846264338327950;
const double EPS = 1e-9;
const int N = 1000000;
template <class T> T gcd(T a, T b) {
if (b == 0) { return a; }
return gcd(b, a % b);
}
template <class T> bool isPrime(T x) {
for (T d = 2; d * d <= x; d++) { if (x % d == 0) return false; }
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
unordered_map<int, int> mp;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> m;
++mp[m];
}
int ans = 0;
for (auto it = mp.begin(); it != mp.end(); ++it) {
if ((it->second) & 1) ++ans;
}
cout << ans << '\n';
}
| 0 |
//http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2676345#1
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
#include<fstream>
#include<cstring>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define P pair<int,int>
#define ll __int64
int n,k;
int f,to,from,cost;
const int INF=222222222;
vector<P> G[1000];//first→終点 second→cost
int dist[1000];//頂点iへの最小距離
int keiro(int from,int to){
for(int i=0;i<=n;i++)dist[i]=INF;
//dist[from]=0;
priority_queue<P,vector<P>,greater<P> >bfs;//first→頂点へのコスト second→頂点
bfs.push(mp(0,from));
while(!bfs.empty()){
P now=bfs.top();
bfs.pop();
int index=now.second,ncost=now.first;
if(dist[index]!=INF)continue;
//cout<<index<<" "<<ncost<<endl;
dist[index]=ncost;
for(int i=0;i<G[index].size();i++){
bfs.push(mp(ncost+G[index][i].second,G[index][i].first));
//cout<<G[index][i].first<<" "<<G[index][i].second<<endl;
}
}
//rep(i,n+1)cout<<dist[i]<<" ";
if(dist[to]==INF)return -1;
return dist[to];
}
int main(){
while(cin>>n>>k,n||k){
for(int i=0;i<200;i++)G[i].clear();
for(int i=0;i<k;i++){
cin>>f;
if(!f){
cin>>from>>to;
cout<<keiro(from,to)<<endl;
}
else{
cin>>from>>to>>cost;
G[from].push_back(mp(to,cost));
G[to].push_back(mp(from,cost));
}
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define SP << " " <<
LL mod = 1000000007;
template <typename M>
class lazy_segment_tree {
using T1 = typename M::t1;
using T2 = typename M::t2;
const int n;
vector<T1> data;
vector<T2> lazy;
int size(int n) {
int res = 1;
while (res < n) res <<= 1;
return res;
}
void push(int node) {
if (lazy[node] == M::id2()) return;
if (node < n) {
lazy[node * 2] = M::op3(lazy[node * 2], lazy[node]);
lazy[node * 2 + 1] = M::op3(lazy[node * 2 + 1], lazy[node]);
}
data[node] = M::op2(data[node], lazy[node]);
lazy[node] = M::id2();
}
void suc(int l, int r, int node, int lb, int ub, T2 val) {
if (ub <= l || r <= lb) return;
if (l <= lb && ub <= r) {
lazy[node] = M::op3(lazy[node], val);
return;
}
push(node);
int c = (lb + ub) / 2;
suc(l, r, node * 2, lb, c, val);
suc(l, r, node * 2 + 1, c, ub, val);
data[node] = M::op1(M::op2(data[node * 2], lazy[node * 2]), M::op2(data[node * 2 + 1], lazy[node * 2 + 1]));
}
T1 sub(int l, int r, int node, int lb, int ub) {
if (ub <= l || r <= lb) return M::id1();
if (l <= lb && ub <= r) return M::op2(data[node], lazy[node]);
int c = (lb + ub) / 2;
return M::op2(M::op1(sub(l, r, node * 2, lb, c), sub(l, r, node * 2 + 1, c, ub)), lazy[node]);
}
public:
lazy_segment_tree(int n_) : n(size(n_)), data(n * 2, M::id1()), lazy(n * 2, M::id2()) {}
lazy_segment_tree(int n_, T1 v1) : n(size(n_)), data(n * 2, v1), lazy(n * 2, M::id2()) {}
lazy_segment_tree(const vector<T1>& data_) : n(size(data_.size())), data(n * 2, M::id1()), lazy(n * 2, M::id2()) {
init(data_);
}
void init() {
for (int i = n - 1; i >= 1; i--) data[i] = M::op1(data[i * 2], data[i * 2 + 1]);
}
void init(const vector<T1>& data_) {
for (int i = 0; i < (int)data_.size(); i++) data[i + n] = data_[i];
init();
}
void update(int l, int r, T2 val) {
suc(l, r + 1, 1, 0, n, val);
}
T1 find(int l, int r) {
return sub(l, r + 1, 1, 0, n);
}
};
struct RURM {
using t1 = int;
using t2 = int;
static t1 id1() { return INT_MAX; }
static t2 id2() { return -1; }
static t1 op1(const t1& l, const t1& r) { return min(l, r); }
static t1 op2(const t1& l, const t2& r) { return r != id2() ? r : l; }
static t2 op3(const t2& l, const t2& r) { return r != id2() ? r : l; }
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
LL N,Q;
cin >> N >> Q;
lazy_segment_tree<RURM> seg(N);
seg.init();
REP(i,Q){
LL y;
cin >> y;
if(y==0){
LL s, t, x;
cin >> s >> t >> x;
seg.update(s, t, x);
}
else
{
LL s;
cin >> s;
cout << seg.find(s, s) << endl;
}
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i=0; i<N; i++) {
cin >> s;
if (S.count(s)) S.at(s) += 1;
else S[s] = 1;
}
int M;
cin >> M;
for (int i=0; i<M; i++) {
cin >> s;
if (S.count(s)) S.at(s) -= 1;
}
using pis = pair<int, string>;
priority_queue<pis> cnt;
for (auto x : S) { // 要素はキーと値のpair
cnt.push(pair(x.second, x.first));
}
if (cnt.top().first < 0) cout << 0 << endl;
else cout << cnt.top().first << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,m;
cin>>n;
map<str,int> a,b;
for(int i=0;i<n;i++)
{
str s;
cin>>s;
a[s]++;
}
cin>>m;
for(int i=0;i<m;i++)
{
str s;
cin>>s;
b[s]++;
}
int ans=0;
for(auto const& aa:a)
{
int cnt=aa.second-b[aa.first];
if(cnt>0)ans=max(ans,cnt);
}
cout<<ans<<"\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max=1e6+7;
ll a[Max]; int n,k;
int main(){
ios::sync_with_stdio(0);
scanf("%d%d",&n,&k);
for(int i=1; i<=n; i++) scanf("%lld",&a[i]);
ll ans=0;
//cout<<"OK"<<endl;
if(a[1]>=0) ans=a[k];
else if(a[n]<=0) ans=-a[n-k+1];
else{
int index=0;
for(int i=1; i<=n; i++){
if(a[i]>=0) {
index=i; break;
}
}
ans=0x3f3f3f3f;
for(int i=index; i<index+k && i<=n; i++){
ll tot=abs(a[i]);
if(i-index+1<k){
tot+=abs(a[i]);
if(i-k+1>=1){
tot+=abs(a[i-k+1]);
//cout<<tot<<endl;
ans=min(tot,ans);
}
}else{
//cout<<tot<<endl;
ans=min(tot,ans);
}
}
index--;
for(int i=index; i>=1 && i>=index-k+1; i--){
ll tot=abs(a[i]);
if(index-i+1<k){
tot+=abs(a[i]);
if(k+i-1<=n){
tot+=abs(a[k+i-1]);
ans=min(ans,tot);
}
}
else{
ans=min(ans,tot);
}
}
}
cout<<ans<<endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
//loops
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
//bitsearch
#define BITSEARCH(bit, n) for (int bit = 0; bit < (1<<n); ++bit)
#define isOne(bit, i) bit & (1<<i)
//arrays
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define add push_back
template<typename T>
std::vector<T> slice(std::vector<T> const &v, int m, int n)
{
auto first = v.cbegin() + m;
auto last = v.cbegin() + n + 1;
std::vector<T> vec(first, last);
return vec;
}
//v need to be sorted
#define remove_unique(v) v.erase(unique(ALL(v)), v.end())
//comparision
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
//pair
#define fir first
#define sec second
#define mp make_pair
//types
#define ll long long
#define vec vector
#define cord2d pair<int,int>
#define intP pair<int, int>
//UNCOMMENT WHEN NEEDED
//#define int ll
//input
template <class T> T get(){ T s; cin >> s; return(s);}
#define gi get<int>()
#define gs get<string>()
#define gll get<ll>()
template <class T> vector<T> getv(int n) { vec<T> v(n); REP(i, n) cin >> v[i]; return v; }
#define gim(n) getv<int>(n)
#define gsm(n) getv<string>(n)
#define gllm(n) getv<ll>(n)
//output
void print(int a){ cout << a << endl; }
void print(long long a){ cout << std::fixed << a << endl; }
void print(string a){ cout << a << endl; }
void print(char a){ cout << a << endl; }
void print(double a){ cout << a << endl; }
void print(double a, int dig){ cout << std::setprecision(dig) << a << endl; }
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
template <class T = int>
void print(vec<T> v){ cout << v << endl; }
template <class T = int>
void print2dVec(vec<vec<T>> v2d){for(vec<T> v: v2d) {print(v);}}
void YesNo1(bool i = true){ return print(i?"Yes":"No"); }
void YESNO2(bool i = true){ return print(i?"YES":"NO"); }
//debug output
#define var_name(var) #var
template <class T> void debug(T &var, int nest = 0, string before = "") { cout << string(" ", nest) << before; print(var); }
//name replacement
#define y0 y0__
#define y1 y1__
#define j0 j0__
#define j1 j1__
//bool lambdas
#define lamb(exp) [](auto i){return exp;}
#define isEven [](int i){return i % 2 == 0;}
#define isOdd [](int i){return i % 2 != 0;}
//constants
const ll INF = 1e18;
const int MOD = 1000000007;
const vec<string> alphabets = { "a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z" };
//maths
int factorial(int k){ int sum = 1; for (int i = 1; i <= k; ++i) { sum *= i; } return sum; }
ll gcd(ll a, ll b) { if (b == 0) { return a; } return gcd(b, a % b); }
ll lcm(ll a, ll b) { ll temp = gcd(a, b); return temp ? (a / temp * b) : 0; }
////////////////////
void Main() {
//code here
int n = gi, k = gi;
vec<int> nums = gim(n);
int minDif = INT_MAX;
REP(i, n-k+1) {
int l = i;
int r = l+k-1;
int dif = min(abs(nums[r]), abs(nums[l])) + abs(nums[l]-nums[r]);
chmin(minDif, dif);
}
print(minDif);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
}
| 1 |
#include <iostream>
using namespace std ;
long long b[102][102] , v , e ;
int main() {
cin >> v >> e ;
for(int i=1 ; i<=v ; i++) {
for(int j=1 ; j<=v ; j++) {
if(i==j) {
b[i][j]=0;
}
else {
b[i][j]=1e18 ;
}
}
}
for(int i= 0 ; i < e ; i++) {
int x , y , z ;
cin >> x >> y >> z ;
b[x+1][y+1]=z;
}
for(int x=1 ; x<=v ; x++) {
for(int y=1 ; y<=v ; y++) {
for(int z=1; z<=v ; z++) {
b[y][z]=min(b[y][z],b[y][x]+b[x][z]);
if(y==z) {
if(b[y][z]<0) {
cout << "NEGATIVE CYCLE" << endl ;
return 0 ;
}
}
}
}
}
for(int i=1 ; i<=v ; i++) {
for(int j=1 ; j<=v ; j++) {
if(j != 1) {
if(b[i][j]>2e9) {
cout<< " INF";
}
else {
cout << " "<<b[i][j] ;
}
}
else {
if(b[i][j]>2e9) {
cout<< "INF";
}
else {
cout << b[i][j] ;
}
}
}
cout << endl ;
}
}
| # include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include<time.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
#include<fstream>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7;// 998244353;// ;
constexpr long long INF = numeric_limits<LL>::max() / 2;
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
struct Fll { LL first, second, third, fourd; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Rrep(i,mf) for(LL i=mf-1;i>=0;i--)
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
struct Edge { LL to, cost; };
struct edge { LL from, to, cost; };
vector<vector<LL>>g;
vector<edge>edges;
vector<LL>v;
map<LL, LL>ma;
set<Pll>st;
LL h, w, n, m, k, t, s, p, q, last, cnt, sum, ans, dp[210000],a[210000], b[210000];
string str, ss;
bool f;
char c;
vector<LL> kossaraju(vector<vector<LL>>&g) {
LL n = g.size();
vector<vector<LL>>rev(n);
vector<LL>ret(n);
vector<LL>ver;
vector<bool>used(n);
function<void(LL)>dfs1 = [&](LL cur) {
used[cur] = 1;
rep(i, g[cur].size()) {
if (!used[g[cur][i]])
dfs1(g[cur][i]);
}
ver.push_back(cur);
};
function<void(LL, LL)>dfs2 = [&](LL cur, LL root) {
used[cur] = 1;
ret[cur] = root;
rep(i, rev[cur].size()) {
if (!used[rev[cur][i]])
dfs2(rev[cur][i], root);
}
};
rep(i, n) rep(j, g[i].size()) rev[g[i][j]].push_back(i);
rep(i, n) if (!used[i])dfs1(i);
rep(i, n) used[i] = 0;
Rrep(i, n)if (!used[ver[i]])dfs2(ver[i], ver[i]);
return ret;
}
int main() {
cin >> n>>m;
g.resize(n);
rep(i, m) {
LL x, y;
cin >> x >> y;
g[x].push_back(y);
}
vector<LL>V = kossaraju(g);
cin >> q;
rep(i, q) {
LL x, y;
cin >> x >> y;
if (V[x] == V[y])cout << 1 << endl;
else cout << 0 << endl;
}
return 0;
}
| 0 |
#include <stdio.h>
#define MAX 100000
using namespace std;
void swap(int A[], int index1, int index2) {
int temp;
temp = A[index1];
A[index1] = A[index2];
A[index2] = temp;
}
int partition(int A[], int p, int r) {
int x = A[r];
int i = p -1;
for(int j = p; j <= r-1; j++) {
if(A[j] <= x) {
i = i + 1;
swap(A, i, j);
}
}
swap(A, i+1, r);
return i+1;
}
int main()
{
int n, A[MAX];
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
int index = partition(A, 0, n-1);
for(int i = 0; i < n; i++) {
if(i == index)
printf("[%d]", A[i]);
else
printf("%d", A[i]);
if(i != n-1) printf(" ");
}
printf("\n");
return 0;
} | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<float> p(N);
for(int i=0; i<N; i++) cin >> p.at(i);
for(int i=0; i<N; i++) p.at(i) = (p.at(i) + 1) / 2;
vector<double> q(N);
q.at(0) = p.at(0);
for(int i=1; i<N; i++) q.at(i) = q.at(i-1) + p.at(i);
vector<double> r(N - K + 1);
r.at(0) = q.at(K-1);
for(int i=1; i<N-K+1; i++){
r.at(i) = q.at(i+K-1) - q.at(i-1);
}
double max = 0;
for(int i=0; i<N-K+1; i++){
if(max < r.at(i)) max = r.at(i);
}
cout << fixed << setprecision(12);
cout << max << endl;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
ll Gcd(ll a,ll b){
if(a < b)swap(a, b);
if(a%b == 0)return(b);
else return(Gcd(b, a%b));
}
vector<pll> Factor(ll n){
vector<pll> prime;
ll sq = sqrt(n) + 1;
for(int i = 2; i <= sq; ++i){
sq = sqrt(n) + 1;
if(n%i == 0){
prime.push_back(make_pair(i, 0));
while(n%i == 0){
n /= i;
prime[prime.size()-1].second++;
}
}
}
if(n != 1){
prime.push_back(make_pair(n, 1));
}
return prime;
}
int main(){
ll a, b;
cin >> a >> b;
vector<pll> fac = Factor(Gcd(a, b));
cout << fac.size() + 1 << endl;
} | /*
https://www.cnblogs.com/SovietPower/p/9757375.html
*/
#include <cstdio>
#include <algorithm>
#define mod 998244353
const int N=1e6;
int fac[N+3],ifac[N+3];
inline int FP(int x,int k)
{
int t=1;
for(; k; k>>=1,x=1ll*x*x%mod)
if(k&1) t=1ll*t*x%mod;
return t;
}
#define C(n,m) (1ll*fac[n+m]*ifac[n]%mod*ifac[m]%mod)//C(n+m,n)
int main()
{
int n,m; scanf("%d%d",&n,&m);
if(n<m) std::swap(n,m);
int lim=n+m; fac[0]=fac[1]=1;
for(int i=1; i<=lim; ++i) fac[i]=1ll*fac[i-1]*i%mod;
ifac[lim]=FP(fac[lim],mod-2);
for(int i=lim; i; --i) ifac[i-1]=1ll*ifac[i]*i%mod;
long long ans=0;
for(int i=1; i<=m; ++i) ans+=1ll*C(i,i)*C(n-i,m-i)%mod;
ans=ans%mod*FP(C(n,m),mod-2)%mod*FP(2,mod-2)%mod;
printf("%lld\n",(ans+n)%mod);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define print(a) printf("%d\n",a);
#define scanii(a,b) scanf("%d %d",&a,&b);
#define printii(a,b) printf("%d\n%d\n",a,b);
#define scaniii(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define ll long long
#define ull unsigned long long
#define sll signed long long
#define pi acos(-1)
#define mod 1000000007
#define TRUE 1
#define FALSE 0
#define ZERO 0
#define MP make_pair
#define F first
#define S second
#define f1(i,a) for(int i=0;i<a;++i)
#define f2(i,a) for(int i=a-1;i>=0;--i)
#define en puts("");
#define elif else if
typedef ll int lli;
typedef sll int slli;
typedef ull int ulli;
const int sz=10000;
using namespace std;
int clue();
int result();
void show();
bool check(int n) {
for(int i=2;i*i<=n;++i) {
if(n%i==0)
return false;
}
return true;
}
// bool cmp(pair<int,int>p,pair<int,int>q) {
// // return p.first>q.first;//descending by first
// // return p.first<q.first;//ascending by first
// // return p.second>q.second;//descending by second
// return p.second<q.second;//ascending by second
// }
bool cmp(int p,int q) {
return p>q;//descending
// return p<q;//ascending
}
int main() {
int t;
// cin>>t;
t=1;
while(t-->0) {
clue();
}
return 0;
}
int clue() {
string s;
cin>>s;
int cnt;
if(s=="SUN") {
cnt=7;
}
elif(s=="MON") {
cnt=6;
}
elif(s=="TUE") {
cnt=5;
}
elif(s=="WED") {
cnt=4;
}
elif(s=="THU") {
cnt=3;
}
elif(s=="FRI") {
cnt=2;
}
elif(s=="SAT") {
cnt=1;
}
cout<<cnt<<endl;
// ()?cout<<"1"<<endl:cout<<"0"<<endl;
return 0;
} | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
// #include <bitset>
const int oo=2139063143;
const int N=310;
const int P=1000000007;
using namespace std;
typedef long long LL;
typedef double db;
#define pritnf printf
//char buf[1<<22],*p1=buf,*p2=buf,obuf[1<<22],*O=obuf;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
template <typename T>
inline void sc (T &x)
{
x=0; static int p; p=1; static char c; c=getchar();
while (!isdigit(c)) { if (c=='-') p=-1; c=getchar(); }
while ( isdigit(c)) { x=(x<<1)+(x<<3)+(c-48); c=getchar(); }
x*=p;
}
template <typename T>
inline void print (T x)
{
if (x< 0) putchar('-'),x=-x;
if (x>=10) print(x/10);
putchar(x%10+'0');
}
template <typename T>
inline void pr (T x) { print(x),putchar('\n'); }
void chkmax (int &A,int B) { A=A>=B?A:B; }
char s[N];
int f[N][N][N];
int main ()
{
// freopen (".in","r",stdin);
// freopen (".out","w",stdout);
scanf ("%s",s+1);
int n=strlen (s+1),k; sc(k);
for (int i=1; i<=n; i++)
f[i][i][0]=1;
for (int len=2; len<=n; len++)
{
for (int l=1,r=len; r<=n; l++,r++)
{
for (int i=0; i<=k; i++)
{
f[l][r][i]=max (f[l+1][r][i],f[l][r-1][i]);
if (s[l]==s[r]) chkmax (f[l][r][i],f[l+1][r-1][i]+2);
if (i) chkmax (f[l][r][i],f[l+1][r-1][i-1]+2);
}
}
}
int ans=0;
for (int i=0; i<=k; i++)
chkmax (ans,f[1][n][i]);
pr(ans);
return 0;
}
| 0 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
if(a-b>0) cout<<a+a-1<<endl;
else if(b-a>0) cout<<b+b-1<<endl;
else cout<<a+b<<endl;
return 0;
} | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hell;
}}
ll gcd(ll x,ll y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
ll a,b;
cin>>a>>b;
cout<<max(max(a+b,2*a-1),2*b-1);} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
set<int> s;
for(int i = 0; i < n; i++){
//cout << s.size() << endl;
int a; cin >> a;
if(s.count(a))
s.erase(a);
else
s.insert(a);
}
cout << s.size() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n;
cin >> n;
vector<ll>a(n);
ll sum=0;
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n-1;++i) {
if(a[i]>a[i+1]){
sum+=a[i]-a[i+1];
a[i+1]=a[i];
}
}
cout << sum << endl;
return 0;
}
| 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
int main() {
int n; cin >> n;
vector<int> a(n);
int sum = 0;
for (auto &ai: a) cin >> ai, sum += ai;
pair<int, int> mi{INF, -1};
for (int i = 0; i < n; i++) {
mi = min(mi, {abs(a[i] * n - sum), i});
}
cout << mi.second << endl;
return 0;
}
| #include <iostream>
#include <map>
#include <string>
using namespace std;
class Dice {
private:
map<char, int> dice;
public:
Dice(int _I, int _II, int _III, int _IV, int _V, int _VI);
int GetNumber(char c);
void roll_E();
void roll_N();
void roll_S();
void roll_W();
};
Dice::Dice(int _I, int _II, int _III, int _IV, int _V, int _VI) {
dice['T'] = _I;
dice['S'] = _II;
dice['E'] = _III;
dice['W'] = _IV;
dice['N'] = _V;
dice['B'] = _VI;
}
int Dice::GetNumber(char c) {
return dice[c];
}
void Dice::roll_E() {
map<char, int> tmp = dice;
dice['T'] = tmp['W'];
dice['E'] = tmp['T'];
dice['W'] = tmp['B'];
dice['B'] = tmp['E'];
}
void Dice::roll_N() {
map<char, int> tmp = dice;
dice['T'] = tmp['S'];
dice['S'] = tmp['B'];
dice['N'] = tmp['T'];
dice['B'] = tmp['N'];
}
void Dice::roll_S() {
map<char, int> tmp = dice;
dice['T'] = tmp['N'];
dice['S'] = tmp['T'];
dice['N'] = tmp['B'];
dice['B'] = tmp['S'];
}
void Dice::roll_W() {
map<char, int> tmp = dice;
dice['T'] = tmp['E'];
dice['E'] = tmp['B'];
dice['W'] = tmp['T'];
dice['B'] = tmp['W'];
}
int main() {
int I, II, III, IV, V, VI;
cin >> I >> II >> III >> IV >> V >> VI;
Dice dice(I, II, III, IV, V, VI);
string op;
cin >> op;
for (unsigned int i = 0; i < op.size(); i++) {
if (op[i] == 'E') {
dice.roll_E();
}
if (op[i] == 'N') {
dice.roll_N();
}
if (op[i] == 'S') {
dice.roll_S();
}
if (op[i] == 'W') {
dice.roll_W();
}
}
cout << dice.GetNumber('T') << endl;
// std::cout << "\e[38;5;0m\e[48;5;40m --- end --- \e[m" << std::endl; // debug
return 0;
}
| 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
int main(){
int N, K; cin >> N >> K;
int ans = 0;
deque<int> deq;
vector<int> v(N,0);
rep(i,N){
cin >> v[i];
}
// 左から取る個数
for (int l = 0; l <= K; l++){
// 右から取る個数
for (int r = 0; r <= K; r++){
// 取る回数がKを越した場合はNG
if (l + r > K) continue;
int d = K - l - r;
priority_queue<int, vector<int>, greater<int>> tmp;
// 左から取る
rep(i,l){
// dequeの右端に達した場合
if (i >= N) break;
tmp.push(v[i]);
}
// 右から取る
rep(i,r){
int index = N-1-i;
// dequeの左端もしくはすでに左から取られている場合
if (index < 0 || index <= l) break;
tmp.push(v[index]);
}
// 手から宝石をつめる
rep(i,d){
// 手に持っていない場合
if (tmp.empty()) break;
// 価値は正の場合はつめない
if (tmp.top() >= 0) break;
tmp.pop();
}
int now = 0;
while (!tmp.empty()){
now += tmp.top(); tmp.pop();
}
ans = max(now, ans);
}
}
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <map>
#include <list>
#include <set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll inf = INT64_MAX / 4;
constexpr double pi = asin(1) * 2;
constexpr ll mod = 1000000007;
template<class T>
class set2 : public set<T> {
private:
typename set<T>::iterator back_itr() {
auto e = this->end();
e--;
return e;
}
public:
T front() {
if (this->empty()) throw;
return *this->begin();
}
T back() {
if (this->empty()) throw;
return *this->back_itr();
}
void erase_front() {
if (!this->empty()) this->erase(this->begin());
}
void erase_back() {
if (!this->empty()) this->erase(this->back_itr());
}
};
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (auto &e:a) cin >> e;
for (auto &e:b) cin >> e;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
bool f = true;
for (int i = 1; i < n; i++) if (a[i] == a[i - 1]) f = false;
for (int i = 1; i < m; i++) if (b[i] == b[i - 1]) f = false;
if (!f) {
cout << 0 << endl;
return 0;
}
auto in_r = [](vector<int> r, int e) { return binary_search(r.begin(), r.end(), e); };
auto in_a = [&in_r, &a](int e) { return in_r(a, e); };
auto in_b = [&in_r, &b](int e) { return in_r(b, e); };
ll r = 1;
for (int i = n * m; i > 0; i--) {
if (in_a(i) && in_b(i)) {
r *= 1;
} else if (in_a(i)) {
r *= b.end() - lower_bound(b.begin(), b.end(), i);
} else if (in_b(i)) {
r *= a.end() - lower_bound(a.begin(), a.end(), i);
} else {
r *= (a.end() - lower_bound(a.begin(), a.end(), i)) * (b.end() - lower_bound(b.begin(), b.end(), i)) -
(n * m - i);
}
r %= mod;
}
cout << r << endl;
}
| 0 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
void startupcpp(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
}
struct unionfind{
private:
int maxN;
vector<int> par,treesize;
public:unionfind(int N) :maxN(N),par(N),treesize(N,1){
for(int i=0;i<maxN;++i)par[i]=i;
}
int root(int x){
while(par[x]!=x){
x=par[x]=par[par[x]];
}
return x;
}
bool unite(int x,int y){
x=root(x);
y=root(y);
if(x==y)return false;
if(treesize[x]>treesize[y])swap(x,y);
par[x]=y;
treesize[y]+=treesize[x];
return true;
}
bool parcheck(int x,int y){
return root(x)==root(y);
}
int size(int x){
return treesize[root(x)];
}
void clear(){
treesize.assign(maxN,1);
for(int i=0;i<maxN;++i)par[i]=i;
}
};
int main(){
startupcpp();
ll i,N,M,cnt=0,ans=0;
cin>>N>>M;
vector<int> a(M),b(M);
map<int,int> mp;
rep(i,M){
cin>>a[i]>>b[i];
mp[a[i]]+=mp[b[i]];
}
for(auto& x:mp)x.second=cnt++;
ans=N*N-cnt*cnt;
N=cnt;
unionfind ut(N*2);
rep(i,M){
a[i]=mp[a[i]];
b[i]=mp[b[i]];
ut.unite(a[i],b[i]+N);
ut.unite(a[i]+N,b[i]);
}
mp.clear();
rep(i,N){
mp[ut.root(i)]|=ut.parcheck(i,i+N);
}
cnt=0;
for(auto& x:mp)cnt+=!x.second;
print(ans+(mp.size()-cnt/2)*(mp.size()-cnt/2)+cnt*cnt/4);
} | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread_unlocked(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
return A;
}
//わけわかめ
int P[100001];
bool dame[100001];
int Find(int A) {
if (P[A] < 0) return A << 1;
return P[A] = Find(P[A] >> 1) ^ (P[A] & 1);
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint(), M = getint();
rep1(i, N) P[i] = -1;
rep(i, M) {
int a = Find(getint());
int b = Find(getint());
//なんてセンスのない
int a1 = a >> 1;
int b1 = b >> 1;
if (a1 == b1) {
if (!((a ^ b) & 1)) dame[a1] = true;
continue;
}
if (P[a1] > P[b1]) {
P[b1] += P[a1];
dame[b1] |= dame[a1];
P[a1] = b ^ !(a & 1);
}
else {
P[a1] += P[b1];
dame[a1] |= dame[b1];
P[b1] = a ^ !(b & 1);
}
}
ll x = 0, y = 0, z = 0;
rep1(i, N) {
if (P[i] < 0) {
if (P[i] == -1) z++;
else if (dame[i]) y++;
else x++;
}
}
printf("%lld\n", x * x + (x + y) * (x + y) + 2 * N * z - z * z);
Would you please return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll n;
cin >> n;
ll ans;
for(int i = 1; i * i <= n; i++){
ans = i*i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0)
return 1;
else
return ((n%M)*(fact(n-1)%M))%M;
}
int div(int n)
{ int c=0;
for(int i=1;i<sqrt(n);i++)
{
if(n%i==0)
{
c++;
}
}
c=c*2;
if(pow(sqrt(n),2)==(sqrt(n)*sqrt(n)))
c++;
return c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
int s=sqrt(n);
cout<<s*s;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
const int MAXN = 4001;
int main(){
int N;string S;cin >> N >> S;
ll count = 0;
ll red=0,blue=0,green=0;
for(int i=0;i<N;i++){
if(S[i]=='R')red++;
if(S[i]=='B')blue++;
if(S[i]=='G')green++;
for(int k=0;k<N;k++){
int tmp_i = i+1;int tmp_k = k+1;
int tmp_j = (tmp_i+tmp_k)/2;
int j = tmp_j - 1;
if(tmp_j <= N && tmp_i< tmp_j && tmp_j<tmp_k && tmp_j - tmp_i == tmp_k - tmp_j && S[i]!=S[j] && S[j] != S[k] && S[i] != S[k]){
count++;
}
}
}
ll tmp = red*blue*green;
cout << tmp - count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n; cin >> n;
int a,b;
switch (n)
{
case 1:
cout << "Hello World\n";
break;
case 2:
cin >> a >> b; cout << a+b << endl;
break;
}
return (0);
}
| 0 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll n, t;
cin >> n >> t;
vector<ll> tv(n);
rep(i, n) {
cin >> tv[i];
}
ll ans = t;
for (int i = 1; i < n; ++i) {
ans += t;
if (t > tv[i] - tv[i - 1]) ans = ans - t + tv[i] - tv[i - 1];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
int n, t;
cin >> n >> t;
int ans = 0, tnow, tpush, tbfr;
cin >> tbfr;
for(int in=1;in<n;in++) {
cin >> tpush;
if(tpush-tbfr<=t) ans += tpush-tbfr;
else ans += t;
tbfr = tpush;
}
ans += t;
cout << ans << endl;
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int gcd(int n, int m){
if(n % m == 0) return m;
return gcd(m, n % m);
}
int main()
{
int n;
cin >> n;
int a[100005];
for(int i = 0; i < n; i++) cin >> a[i];
if(n == 1){
cout << "Second" << endl;
return 0;
}
if(n == 2){
if(a[0] % 2 == a[1] % 2) cout << "Second" << endl;
else cout << "First" << endl;
return 0;
}
bool first = true;
while(true){
int m = 2;
int l = 0;
int c = 0;
for(int i = 0; i < n; i++){
m = min(m, a[i]);
if(a[i] % 2) c++;
else l = 1 - l;
}
if(l == 1){
if(first) cout << "First" << endl;
else cout << "Second" << endl;
return 0;
}
else if(c > 1 || m == 1){
if(first) cout << "Second" << endl;
else cout << "First" << endl;
return 0;
}
else{
for(int i = 0; i < n; i++) a[i] = a[i] / 2 * 2;
int g = 0;
for(int i = 0; i < n; i++) g = gcd(g, a[i]);
for(int i = 0; i < n; i++) a[i] /= g;
}
first = !first;
}
}
| #include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,n,ans=1e9,b;
string s,t;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
b=0;
while(a%2==0){
b++;
a/=2;
}
ans=min(b,ans);
}
cout<<ans<<"\n";
return(0);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1010;
int h, w, a, b, mat[N][N];
ii arr[N];
bool can(int c1, int c2){
for(int i=0 ; i<c2 ; i++)
arr[i] = ii(b, i);
for(int i=c2 ; i<w ; i++)
arr[i] = ii(h-b, i);
sort(arr, arr+w);
memset(mat, 0, sizeof mat);
for(int i=h-1 ; i>=0 ; i--){
int cur = (i >= c1 ? w-a : a);
for(int j=w-1 ; cur>0 && j>=0 ; j --, cur --){
arr[j].first --;
if(arr[j].first<0)
return false;
mat[i][ arr[j].second ] = 1;
}
sort(arr, arr+w);
}
for(int i=0 ; i<h ; i++){
for(int j=0 ; j<w ; j++)
cout << mat[i][j];
cout << "\n";
}
return true;
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> h >> w >> a >> b;
for(int i=0 ; i<=h ; i++)
for(int j=0 ; j<=w ; j++){
int f1 = i*a + (h-i)*(w-a);
int f2 = j*b + (w-j)*(h-b);
if(f1 == f2 && can(i, j))
return 0;
}
cout << "-1\n";
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
vector<vector<int>> s(h, vector<int>(w));
rep(i, h) rep(j, w) {
if (i < b && j < a || i >= b && j >= a) s[i][j] = 0;
else s[i][j] = 1;
}
rep(i, h) {
rep(j, w) cout << s[i][j];
cout << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
for (int i = 0; i < n; ++i) cin >> xs[i]
void Main();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
return 0;
}
void Main() {
Cin(int, n);
Cin(string, a, b, c);
int ans = 0;
for (int i = 0; i < n; ++i) {
map<char, int> mp;
mp[a[i]]++;
mp[b[i]]++;
mp[c[i]]++;
int ma = 0;
for (auto e : mp) ma = max(ma, e.second);
ans += 3 - ma;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string a, b, c; cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i] && b[i] != c[i] && c[i] != a[i]) {
ans += 2;
}
else if ((a[i] == b[i] && b[i] != c[i]) || (b[i] == c[i] && c[i] != a[i]) || (c[i] == a[i] && a[i] != b[i])) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false)
int a[200000], vs[200000],vs1[100006],p[300000];
vector<int>v[200000];
queue<int>q;
int f(int n)
{
int i, k=0;
vs[n]=1; q.push(n);
while(q.size()){
n=q.front(); q.pop();
for(i=0; i<v[n].size(); i++){
if(vs1[v[n][i]]==1){
p[v[n][i]]=n;
q.push(v[n][i]);
}
else vs1[v[n][i]]--;
}
}
return 1;
}
int main()
{
IO;
int i, j, m, k, n, t, l=0, mx,ll,mxx,mx1;
cin>>n>>m;
for(i=1; i<=n+m-1; i++){
cin>>j>>k;
v[j].push_back(k);
vs1[k]++;
}
for(i=1; i<=n; i++)
if(vs1[i]==0)k=i;
f(k);
for(i=1; i<=n; i++) cout<<p[i]<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll inf = 1e18;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll x(n);
REP(i, n) cin >> x[i];
ll l;
cin >> l;
// reach[k][i] : i から出発して 2^k 日で到達できる一番遠いホテル
vvll reach(31, vll(n));
REP(i, n){
ll nxt = upper_bound(ALL(x), x[i] + l) - x.begin() - 1;
reach[0][i] = nxt;
}
REP(k, 30){
REP(i, n){
reach[k + 1][i] = reach[k][reach[k][i]];
}
}
ll q;
cin >> q;
ll a, b;
while (q) {
cin >> a >> b;
a--, b--;
if (a > b) swap(a, b);
ll res = 1;
REPR(k, 30){
if (reach[k][a] < b) {
res += (1 << k);
a = reach[k][a];
}
}
cout << res << endl;
q--;
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
using lint = long long;
template <class T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
bool solve(int N, std::vector<lint>& A) {
lint sum = std::accumulate(A.begin(), A.end(), 0LL);
// Nが偶数の場合、和の偶奇がそのまま勝敗になる
if (N % 2 == 0) return sum % 2 != 0;
// Nが奇数の場合も、和が偶数なら絶対勝てる
if (sum % 2 == 0) return true;
// 奇数を前に持っていく
std::sort(A.begin(), A.end(), [](int a, int b) { return a % 2 > b % 2; });
// 奇数が複数個ある、あるいは唯一の奇数が1(減らせない)なら負け
if (A[0] == 1 || (A[1] & 1) != 0) return false;
// そうでなければ、唯一の奇数を減らしてシミュレート
--A[0];
int g = accumulate(A.begin(), A.end(), 0LL, gcd<lint>); // 全体のgcdを取る
for (auto& a : A) a /= g;
return !solve(N, A);
}
int main() {
int N;
std::cin >> N;
std::vector<lint> A(N);
for (auto& a : A) std::cin >> a;
std::cout << (solve(N, A) ? "First" : "Second") << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 6.66;
int arr [ MAXN ];
string player[2] = { "First","Second" };
int main ( ) {
int n; scanf ( "%d",&n ) ;
for ( int i = 0;i<n;i++ ) scanf ( "%d", arr + i ) ;
int cnt[2] = { 0 , 0 };
bool is_one = false;
for ( int i = 0;i<n;i++ ) cnt[arr[i] % 2 ] ++,is_one |= (arr[i] == 1);
if ( cnt[0] % 2 == 1 ) { printf ( "First\n" ); return 0; }
bool turn = 0;
while ( !is_one && cnt[1] == 1 )
{
for ( int i = 0;i<n;i++ ) if ( arr[i] % 2 ) arr[i] -- ;
int gc = arr[0];
for ( int i = 0;i<n;i++ ) gc = __gcd ( arr[i], gc );
for ( int i = 0;i<n;i++ ) arr[i] /= gc;
cnt[1] = cnt[0] = 0;
for ( int i = 0;i<n;i++ ) cnt[arr[i] % 2 ] ++,is_one |= (arr[i] == 1);
turn = !turn ;
}
if ( cnt[0] % 2 ) printf ( "%s\n", player[turn].c_str ( ) );
else printf ( "%s\n", player[!turn].c_str ( ) );
return 0;
}
| 1 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"
int main() {
while (1) {
int N; cin >> N;
if (!N)break;
vector<int>as(N);
vector<long long int>sums(N + 1);
for (int i = 0; i < N; ++i)cin >> as[i];
for (int i = 0; i < N; ++i) {
sums[i + 1] = sums[i] + as[i];
}
long long int ans = -1e8;
for (int l = 0; l < N; ++l) {
for (int r = l + 1; r <= N; ++r) {
ans = max(ans, sums[r] - sums[l]);
}
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while(cin>>n, n) {
int now, max;
cin>>now;
max=now;
for(int i=1; i<n; i++) {
int t;
cin>>t;
if(now<=0) now=t;
else now+=t;
if(max<now) max=now;
}
cout<<max<<'\n';
}
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
string a;
string b;
string c;
cin >> a >> b >> c;
char turn = a[0];
a.erase(a.begin());
if(a.empty()) {
cout << 'A' << endl;
return 0;
}
while(1){
if(turn == 'a'){
if(a.empty()) {
cout << 'A' << endl;
return 0;
}
turn = a[0];
a.erase(a.begin());
}
if(turn == 'b'){
if(b.empty()) {
cout << 'B' << endl;
return 0;
}
turn = b[0];
b.erase(b.begin());
}
if(turn == 'c'){
if(c.empty()) {
cout << 'C' << endl;
return 0;
}
turn = c[0];
c.erase(c.begin());
}
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define itfr(it,x) for(it=x.begin();it!=x.end();it++)
#define flash ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
int main()
{
flash;
//sieve();
ll T=1,n,m,k,x,y,z;
// cin>>T;
while(T--)
{
string a,b,c;
cin>>a>>b>>c;
n = a.length();
m = b.length();
k = c.length();
x = 0; y = 0; z = 0;
char cur = 'a';
while(x<=n&&y<=m&&z<=k)
{
if(cur=='a')
{
cur = a[x];
x++;
}
else if(cur=='b')
{
cur = b[y];
y++;
}
else
{
cur = c[z];
z++;
}
}
if(x>n)
cout<<'A';
else if(y>m)
cout<<'B';
else
cout<<'C';
cout<<endl;
}
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
//const int INF = 1<<29;
//const int MODINF = 1000000007;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N + 2, 0);
int sum = 0;
rep(i, 1, N + 1) cin >> A.at(i);
rep(i, 0, N + 1) sum += abs(A.at(i + 1) - A.at(i));
rep(i, 1, N + 1){
int x = A.at(i - 1);
int y = A.at(i);
int z = A.at(i + 1);
if ((x - y)*(y - z) >= 0){
cout << sum << endl;
}
else{
cout << sum - 2 * min(abs(x - y), abs(y - z)) << endl;
}
}
}
| #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
int n;
cin >> n;
vector<int> a(n + 2);
rep(i, n) cin >> a[i + 1];
a[0] = 0, a[n + 1] = 0;
int res = 0;
rep(i, n + 1) res += abs(a[i] - a[i + 1]);
rep(i, n)
{
int x = abs(a[i] - a[i + 1]) + abs(a[i + 1] - a[i + 2]);
int y = abs(a[i] - a[i + 2]);
cout << res - x + y << endl;
}
}
int main(void)
{
solve();
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(int i = 0; i < N; i++){
cin >> a[i];
}
int min= a[0];
int max= a[0];
long long sum= a[0];
for(int i = 1; i < N; i++){
sum += a[i];
if(a[i] < min) min = a[i];
if(a[i] > max) max = a[i];
}
cout << min << " " << max << " " << sum << endl;
}
| #include<iostream>
int main(void){
int n, min = 1000000, max = -1000000;
long long sum = 0;
std::cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++){
int x;
std::cin >> x;
sum = sum + x;
if (min > x) min = x;
if (max < x) max = x;
}
std::cout << min << " " << max << " " << sum << std::endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
string a, b, c; cin>>a>>b>>c;
int size_a = a.size(), size_b = b.size();
cout<<(a[size_a-1] == b[0] && b[size_b-1] == c[0] ? "YES" : "NO")<<endl;
}
int main(){
solve();
Bye;
} | #include<stdio.h>
int main(){
char a[150];
int x=1;
scanf("%[^\n]", a);
for (int i=0 ; a[i]!='\0' ; i++){
if (a[i]==' '){
if (a[i-1]==a[i+1]){
continue;
} else{
x=0;
break;
}
}
}
printf("%s\n", x==1 ? "YES" : "NO");
return 0;
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int main() {
int n;
cin >> n;
vector<int>a(n+2);
for(int i = 1;i<=n;i++) cin >> a[i];
int s = 0;
for(int i = 0;i<=n+1;i++) {
s += abs(a[i]-a[i+1]);
}
for(int i = 1;i<=n;i++) {
int tmp = abs(a[i-1]-a[i+1]) - abs(a[i-1] - a[i]) -abs(a[i]-a[i+1]);
int ans = s + tmp;
cout << ans << endl;
}
} | /*
* Author: .-O_O-.
*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(int a=b;a<c;a++)
#define in insert
#define len length()
#define si size()
#define lb lower_bound
#define ub upper_bound
#define beg begin()
#define en end()
#define f first
#define s second
#define pr(a) cout<<a
#define pr2(a,b) cout<<a<<" "<<b<<"\n"
#define nx cout<<"\n"
#define int long long
// 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 << "]"<<endl;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define deb(x...)
#endif
const ll mod = 1000000007;
const ll N = 105;
const ll mm = 1e+18;
void solve()
{
int n,aa,b;
cin>>n>>aa>>b;
int ans=0;
int a[n];
rep0(i,n) cin>>a[i];
rep1(i,n-1){
ans+=min((a[i]-a[i-1])*aa,b);
}
pr(ans);
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t=1;
//cin>>t;
rep1(_i,t){
//cout<<"Case #"<<_i<<": ";
solve();
//nx;
}
return 0;
} | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 100010
using namespace std;
int n,l,q;
int a[maxn],tp[maxn][25];
void init(){
int to=1;
for(int t=1;t<=n;++t){
while(to<n&&a[t]+l>=a[to+1])to++;
tp[t][0]=to;
}
for(int t=n;t>=1;--t){
for(int i=1;i<=20;++i){
tp[t][i]=tp[tp[t][i-1]][i-1];
}
}
}
bool check(int a,int b,int k){
int now=0;
for(int t=20;t>=0;--t){
if(now+(1<<t)<=k){
now+=1<<t;
a=tp[a][t];
}
}
return a>=b;
}
int getans(int a,int b){
int l=1,r=n,ans=n;
while(l<=r){
int mid=(l+r)>>1;
if(check(a,b,mid)){
ans=mid;
r=mid-1;
}
else l=mid+1;
}
return ans;
}
int main(){
scanf("%d",&n);
for(int t=1;t<=n;++t)scanf("%d",&a[t]);
scanf("%d%d",&l,&q);
init();
for(int t=1;t<=q;++t){
int a,b;
scanf("%d%d",&a,&b);
if(a>b)swap(a,b);
printf("%d\n",getans(a,b));
}
} | #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout << "Yes\n";
else cout << "No\n";
}
void abc_151a()
{
char C;
cin >> C;
cout << (char)((int)C + 1) << "\n";
}
void abc_152a()
{
int N, M;
cin >> N >> M;
if (N == M) cout << "Yes\n";
else cout << "No\n";
}
void abc_154a()
{
string S, T;
cin >> S >> T;
int a, b;
cin >> a >> b;
string U;
cin >> U;
if (S == U) cout << a - 1 << " " << b << "\n";
else cout << a << " " << b - 1 << "\n";
}
void abc_156a()
{
int N, R;
cin >> N >> R;
if (N >= 10) cout << R << "\n";
else cout << R + 100 * (10 - N) << "\n";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n+2);
a[0]=0;
a[n+1]=0;
for(int i=1;i<=n;i++){
cin >> a.at(i);
}
ll ro=0;
rep(i,n+2){
ro+=abs(a[i]-a[i+1]);
}
for(int i=1;i<=n;i++){
if((a[i]-a[i-1])*(a[i+1]-a[i])>=0){
cout << ro << endl;
}
else{
int z=min(abs(a[i]-a[i-1]),abs(a[i+1]-a[i]));
cout << ro-2*z << endl;
}
}
}
|
#include <iostream>
#include <vector>
#include <cstdio>
//2^32/26 = 165191049.846153846153846 = 165191050
#define MAGIC 0x9D89D8A
char shift (char c, int amount)
{
long n;
long q ;
long r;
n = (long) c - 'a' + amount;
q = n * MAGIC;
q >>= 32;
r = n - q * 26;
return (char) 'a' + r;
}
void shiftString (char* s, int amount)
{
int i = 0;
while (s[i]) {
if (s[i] == ' ') {}
else if (s[i] == '.') {}
else { s[i] = shift(s[i], amount); }
i++;
}
}
int main(int argc, const char * argv[]) {
char buffer[256];
std::string line;
std::vector<std::string> listString;
int result = 0;
std::size_t found;
while (std::getline(std::cin, line))
{
//sprintf(buffer, "%s", line.c_str());
listString.push_back(line);
}
std::vector<std::string>::iterator it;
it = listString.begin();
do {
result = 0;
sprintf(buffer, "%s", (*it).c_str());
while (!result)
{
shiftString(buffer, -1);
line = buffer;
result = 0;
found = line.find("the");
result += found!=std::string::npos;
found = line.find("this");
result += found!=std::string::npos;
found = line.find("that");
result += found!=std::string::npos;
}
printf("%s\n", buffer);
} while (++it < listString.end());
return 0;
} | 0 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
string a_tmp, b_tmp;
string ch = to_string(i);
for (int j = 0; j < ch.size(); j++) {
a_tmp.push_back(char(ch[j]));
b_tmp.push_back(char(ch[ch.size() - j-1]));
}
if (a_tmp == b_tmp)ans++;
}
cout << ans << endl;
return 0;
} | //include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
//using
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<vector<ll> >;
//vector<vector<char> > hyou(N, vector<char>(N));
using vd = vector <double>;
//define
//#define int long long
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
#define sortp(d) sort(d.begin(),d.end()) //1234
#define sortm(d) sort(d.rbegin(),d.rend()) //4321
//素数判定 O(√A)
bool is_prime(int x){
if(x<=1) return false;
for(int i=2;i*i<=x;i++)
if(x%i==0) return false;
return true;
}
/*順列生成
do {
// 順列に対する処理
} while (next_permutation(配列変数.begin(), 配列変数.end()));*/
//絶対値 abs()
//文字→数字 '0' アルファベット→数字 'a' 'A'が65番,'a'が97番だわ
//型キャスト char('a'+1)
//reverse 回文
//グローバル変数宣言
ll p=0,q=0,r=0;
int main()
{
ll a,b;
cin>>a>>b;
//q=stoi(b);p=stoi(a);10000
rep(i,b-a+1){
p=a+i;
if((p/10000==p%10)&&(p/1000-(10*(p/10000))==(p%100-p%10)/10))
q++;
}
print(q)
} | 1 |
#include <cstdio>
#include <cstdlib>
using namespace std;
const int mod = 998244353;
class inverse {
public:
inverse(int n, int mod);
~inverse();
long long get_inv(int x);
long long get_fact(int x);
long long get_invfact(int x);
long long get_comb(int x, int y);
private:
int mod;
long long* inv;
long long* fact;
long long* invfact;
};
inverse::inverse(int n, int mod) : mod(mod) {
inv = (long long *)malloc(sizeof(long long) * (n + 1));
fact = (long long *)malloc(sizeof(long long) * (n + 1));
invfact = (long long *)malloc(sizeof(long long) * (n + 1));
inv[1] = 1;
for (int i = 2; i <= n; i++) inv[i] = inv[mod % i] * (mod - mod / i) % mod;
fact[0] = invfact[0] = 1;
for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i % mod;
for (int i = 1; i <= n; i++) invfact[i] = invfact[i - 1] * inv[i] % mod;
}
inverse::~inverse() {
free(inv);
free(fact);
free(invfact);
}
long long inverse::get_inv(int x) {
return inv[x];
}
long long inverse::get_fact(int x) {
return fact[x];
}
long long inverse::get_invfact(int x) {
return invfact[x];
}
long long inverse::get_comb(int x, int y) {
return fact[x] * invfact[y] % mod * invfact[x - y] % mod;
}
int main() {
int n, m, i;
long long ans;
inverse inv(3000000, mod);
scanf("%d %d", &n, &m);
ans = inv.get_comb(m * 3 + n - 1, n - 1);
for (i = m * 2 + 1; i <= m * 3; i++) {
ans -= inv.get_comb(m * 3 - i + n - 2, n - 2) * n % mod;
if (ans < 0) ans += mod;
}
for (i = m + 1; i <= m * 3 && i <= n; i++) {
if ((m * 3 - i) % 2 == 1) continue;
ans -= inv.get_comb((m * 3 - i) / 2 + n - 1, n - 1) * inv.get_comb(n, i) % mod;
if (ans < 0) ans += mod;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 200010, M = 1010, mod = 998244353;
int n, m, k;
int infact[N], fact[N];
int qp(int a, int b)
{
int res = 1;
while (b)
{
if (b & 1) res = (LL)res * a % mod;
a = (LL)a * a % mod;
b >>= 1;
}
return res;
}
int C(int a, int b)
{
return (LL)fact[a] * infact[b] % mod * infact[a - b] % mod;
}
int main()
{
cin >> n >> m >> k;
fact[0] = infact[0] = 1;
for (int i = 1; i <= n; i ++ )
{
fact[i] = (LL)fact[i - 1] * i % mod;
infact[i] = (LL)infact[i - 1] * qp(i, mod - 2) % mod;
}
int res = 0;
for (int i = 0; i <= k; i ++ )
res = (res + (LL)m * C(n - 1, i) % mod * qp(m - 1, n - 1 - i) % mod) % mod;
cout << res << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const int MOD = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//cin.tie(0);ios::sync_with_stdio(false);
//cout << fixed << setprecision(15) << y << endl;
int n;
vector<vector<int>> a(3);
ll solve () {
ll ans = 0;
rep (j, n) {
int tmp = a[1][j];
ll comb = lower_bound(a[0].begin(), a[0].end(), tmp) - a[0].begin();
comb *= a[2].end() - upper_bound(a[2].begin(), a[2].end(), tmp);
ans += comb;
}
return ans;
}
int main() {
while (cin >> n) {
rep (i, 3) {
a[i].resize(n);
rep (j, n) cin >> a[i][j];
sort(a[i].begin(), a[i].end());
}
cout << solve() << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define All(a) (a).begin(),(a).end()
void solve(){
int n;
scanf("%d",&n);
vector<int> a(n),b(n),c(n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
scanf("%d",&b[i]);
}
for(int i=0;i<n;i++){
scanf("%d",&c[i]);
}
sort(All(a));
sort(All(b));
sort(All(c));
ll count=0;
for (int j = 0; j < n; j++)
{
auto tmp = lower_bound(All(a),b[j]);
auto l=tmp-a.begin();
int tmp2 = c.end()-upper_bound(All(c),b[j]);
count+=l*tmp2;
}
printf("%lld\n",count);
}
int main(){
/*
int q;
scanf("%d",&q);
while(--q)solve();
*/
solve();
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
typedef long double ld;
#define pii pair<ll,ll>
#define vi vector< ll >
#define vvi vector< vi >
#define vpi vector< pii >
#define vvpi vector< vpi >
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define test(t) ll t;cin>>t;while(t--)
#define mem(a,b) memset(a,b,sizeof(a))
#define inn freopen("input.txt", "r", stdin)
#define outt freopen("output.txt", "w", stdout)
#define all(arr) arr.begin(),arr.end()
#define fr(i,n) for(ll i=0;i<(n);++i)
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define per(i,a,b) for(ll i=a;i>=b;i--)
#define remin(a,b) (a=min((a),(b)))
#define remax(a,b) (a=max((a),(b)))
#ifndef ONLINE_JUDGE
#define debarr(a,n)cerr<<#a<<":";for(int i=0;i<n;i++)cerr<<a[i]<<" ";cerr<<endl;
#define debmat(mat,row,col)cerr<<#mat<<":\n";for(int i=0;i<row;i++){for(int j=0;j<col;j++)cerr<<mat[i][j]<<" ";cerr<<endl;}
#define pr(...)dbs(#__VA_ARGS__,__VA_ARGS__)
template<class S,class T>ostream &operator<<(ostream &os,const pair<S,T> &p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T>ostream &operator<<(ostream &os,const vector<T> &p){os<<"[";for(auto&it:p)os<<it<<" ";return os<<"]";}
template<class T>ostream &operator<<(ostream &os,const set<T>&p){os<<"[";for(auto&it:p)os<<it<<" ";return os<<"]";}
template<class T>ostream &operator<<(ostream &os,const multiset<T>&p){os<<"[";for(auto&it:p)os<<it<<" ";return os<<"]";}
template<class S,class T>ostream &operator<<(ostream &os,const map<S,T>&p){os<<"[";for(auto&it:p)os<<it<<" ";return os<<"]";}
template<class T>void dbs(string str,T t){cerr<<str<<":"<<t<<"\n";}
template<class T,class...S>void dbs(string str,T t,S... s){int idx=str.find(',');cerr<<str.substr(0,idx)<<":"<<t<<",";dbs(str.substr(idx+1),s...);}
#else
#define pr(...){}
#define debarr(a,n){}
#define debmat(mat,row,col){}
#endif
ll power(ll x,ll y){ll res = 1;while(y){if(y&1) res = (res*x)%mod;y=y/2,x=(x*x)%mod;}return res%mod;}
signed main()
{
fast;
ll n;
cin>>n;
ll arr[n][n];
ll dp[1<<n];
fr(i,n)fr(j,n)cin>>arr[i][j];
fr(i,1<<n){
vi temp;
fr(j,n){
if(i&(1<<j))
temp.pb(j);
}
dp[i]=0;
for(auto v:temp)for(auto u:temp)dp[i]+=arr[u][v];
dp[i]/=2;
}
rep(i,1,(1<<n)-1){
for(ll j=i;j>0;j=i&(j-1)){
dp[i]=max(dp[i],dp[i^j]+dp[j]);
}
}
cout<<dp[(1<<n)-1];
}
| // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// #define Find order_of_key
// #define at find_by_order
#define x first
#define y second
#define ll long long
#define lll __int128
#define ull unsigned long long
#define ulll unsigned __int128
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#define gu getchar_unlocked()
#define pu putchar_unlocked()
#define all(x) x.begin(),x.end()
#define endl '\n'
ll arr[20][20];
int n;
ll dp[(1<<17)];
ll dp1[(1<<17)];
ll val(int m){
ll &s=dp1[m];
if(~s)return s;
s=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(m&(1<<i) && m&(1<<j)){
s+=arr[i][j];
}
}
}return s;
}
ll f(int m){
if(m==0)return 0;
ll &ma=dp[m];
if(~ma)return ma;
ma=0;
for (int s=m; s; s=(s-1)&m){
ma=max(ma,val(s)+f(m^s));
}return ma;
}
//resub
int main()
{
fast;
memset(dp,-1,sizeof dp);
memset(dp1,-1,sizeof dp1);
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>arr[i][j];
}
}cout<<f((1<<n)-1)<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << endl;}
#define bug4( x , y , z , w) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << endl;}
#define bug5( x , y , z , w ,p) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << endl;}
#define bug6( x , y , z , w ,p , q) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << " " << (#q) <<"="<< q << endl;}
#define bugn( x , n ) {cerr << (#x) <<":";for(int i=0;i<n;i++)cerr << x[i] <<" "; cerr << endl;}
#define bugnm( x , n , m ) {cerr << (#x)<<endl;for(int i=0;i<n;i++){cerr << "Row #" << i<< ":";for(int j=0;j<m;j++)cerr << x[i][j] << " ";cerr << endl;}}
typedef long long ll;
typedef long double ld;
using namespace std;
const int maxn = 1e5+10;
vector<int>g[maxn],vis(maxn),dis(maxn),par(maxn),tpl;
int n,m;
void dfs(int u){
vis[u]=1;
for(auto v:g[u]){
if( !vis[v]){
dfs(v);
}
}
tpl.push_back(u);
}
int32_t main(){
IOS
cin>>n>>m;
for(int i=1;i<=n-1+m;i++){
int u,v;cin>>u>>v;
g[u].push_back(v);
}
for(int i=1;i<=n;i++){
if( !vis[i] ){
dfs(i);
}
}
reverse(tpl.begin(),tpl.end());
for(int i=0;i<n;i++){
int u = tpl[i];
for(auto v:g[u]){
if( dis[v] < dis[u] + 1){
dis[v] = dis[u] + 1;
par[v] = u;
}
}
}
for(int i=1;i<=n;i++){
cout << par[i] << endl;
}
}
/*
* long long or int?
* index out of bound?
* Tested on own test case?corner?
* Make more general solution.
* Read Read Read Read ....
*/
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using graph=vector<vector<int>>;
void add_directed_edge(graph& G,int u,int v){
G[u].emplace_back(v);
}
vector<int> topological_order(const graph& D){
int n=D.size();
vector<int> deg(n);
rep(u,n) for(int v:D[u]) deg[v]++;
vector<int> res;
queue<int> Q;
rep(u,n) if(deg[u]==0) Q.emplace(u);
while(!Q.empty()){
int u=Q.front(); Q.pop();
res.emplace_back(u);
for(int v:D[u]) if(--deg[v]==0) Q.emplace(v);
}
return res;
}
int main(){
int n,m; scanf("%d%d",&n,&m);
m+=n-1;
graph G(n);
rep(i,m){
int u,v; scanf("%d%d",&u,&v); u--; v--;
add_directed_edge(G,u,v);
}
vector<int> dp(n);
for(int u:topological_order(G)){
for(int v:G[u]) dp[v]=max(dp[v],dp[u]+1);
}
vector<int> ans(n,-1);
rep(u,n) for(int v:G[u]) if(dp[v]==dp[u]+1) ans[v]=u;
rep(u,n) printf("%d\n",ans[u]+1);
return 0;
}
| 1 |
#include <stdio.h>
#include <string.h>
int main ( void ) {
char str[1000], str2[1000], str3[1000], s[7];
int q, a, b;
scanf ( "%s %d", str, &q );
for ( int i = 0; i < q; i++ ) {
scanf ( "%s", s );
if ( strcmp ( s, "print" ) == 0 ) {
scanf ( "%d %d", &a, &b );
for ( int j = a; j < b + 1; j++ ) {
printf ( "%c", str[j] );
}
printf ( "\n" );
}
else if ( strcmp ( s, "reverse" ) == 0 ) {
scanf ( "%d %d", &a, &b );
for ( int j = a, k = b; j < b + 1; j++, k-- ) {
str2[k] = str[j];
}
for ( int j = a; j < b + 1; j++ ) {
str[j] = str2[j];
}
}
else if ( strcmp ( s, "replace" ) == 0 ) {
scanf ( "%d %d %s", &a, &b, str3 );
for ( int j = a, k = 0; j < b + 1; j++, k++ ){
str[j] = str3[k];
}
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
while( cin >> N , N ){
string L[50];
int P[50], A[50], B[50], C[50], D[50], E[50], F[50], S[50], M[50];
vector< pair<double, string> > ans(N);
for(int i = 0; i < N; i++){
int time = 0, value = 0;
cin >> L[i] >> P[i] >> A[i] >> B[i] >> C[i] >> D[i] >> E[i] >> F[i] >> S[i] >> M[i];
ans[i].second = L[i];
time = A[i] + B[i] + C[i] + (D[i] + E[i]) * M[i];
value = M[i] * F[i] * S[i] - P[i];
ans[i].first = -value / (double)time;
}
sort(ans.begin(), ans.end());
for(int i = 0; i< N; i++){
cout << ans[i].second << endl;
}
cout << "#" << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using T = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(int n){
cout << "Yes" << endl;
}
void no (int n){
cout << "No" << endl;
}
int main() {
ll n, x; cin >> n >> x;
vector<ll> ar(n);
rep(i,n) cin >> ar[i];
ll ans = 0;
rep(i,n){
ans += max(0LL,ar[i] - x);
ar[i] = min(ar[i],x);
}
rep(i,n-1){
ans += max(0LL,-x + ar[i] + ar[i+1]);
ar[i+1] = min(ar[i+1],x - ar[i]);
}
cout << ans << endl;
} | #include <cstdio>
#include <vector>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100000;
typedef long long ll;
#define pb push_back
int n, s;
int x[N + 5], p[N + 5];
int main() {
#ifdef Wearry
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
scanf("%d%d", &n, &s);
for(int i = 1; i <= n; ++i) {
scanf("%d%d", x + i, p + i);
}
vector<int> res;
int l = 1, r = n;
ll tl = 0, tr = 0;
while(l <= n && x[l] < s && r >= 1 && x[r] > s) {
if(tl + p[l] >= tr + p[r]) {
tl += tr + p[r];
tr = 0;
res.pb(r --);
} else {
tr += tl + p[l];
tl = 0;
res.pb(l ++);
}
}
while(l <= n && x[l] < s) res.pb(l ++);
while(r >= 1 && x[r] > s) res.pb(r --);
ll ans = 0;
for(int i = (int) res.size() - 1; i >= 0; --i) {
ans += abs(s - x[res[i]]);
s = x[res[i]];
}
printf("%lld\n", ans);
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0; i<N; i++) {
cin >> A[i];
}
partial_sum(A.begin(), A.end(), A.begin());
int64_t ans = numeric_limits<int64_t>::max();
int64_t P, Q, R, S;
int low, mid, high;
for(int r=1; r<N-2; r++) {
low = 0;
high = r;
while(low + 1 < high) {
mid =(low + high) / 2;
if(2*A[mid] <= A[r]) {
low = mid;
} else {
high = mid;
}
}
if(max(A[low], A[r] - A[low]) - min(A[low], A[r] - A[low]) < max(A[high], A[r] - A[high]) - min(A[high], A[r] - A[high])) {
P = A[low];
Q = A[r] - A[low];
} else {
P = A[high];
Q = A[r] - A[high];
}
low = r+1;
high = N-1;
while(low + 1 < high) {
mid =(low + high) / 2;
if(2*(A[mid] - A[r]) <= A[N-1] - A[r]) {
low = mid;
} else {
high = mid;
}
}
if(max(A[low] - A[r], A[N-1] - A[low]) - min(A[low] - A[r], A[N-1] - A[low]) < max(A[high] - A[r], A[N-1] - A[high]) - min(A[high] - A[r], A[N-1] - A[high])) {
R = A[low] - A[r];
S = A[N-1] - A[low];
} else {
R = A[high] - A[r];
S = A[N-1] - A[high];
}
ans = min(ans, max({P, Q, R, S}) - min({P, Q, R, S}));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5;
int a[maxn];
ll sum[maxn];
ll rsum(int l, int r)
{
return sum[r] - sum[l-1];
}
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen("A.INP", "r")){
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
if (fopen(Task".INP", "r")){
freopen(Task".INP", "r", stdin);
freopen(Task".OUT", "w", stdout);
}
int N; cin >> N;
for (int i=1; i<=N; ++i){
cin >> a[i];
sum[i] = sum[i-1] + a[i];
}
int l=1, r=3;
ll ret = 1e18;
for (int i=2; i<=N-2; ++i){
r = max(r, i+1);
while (l<i-1 && rsum(1, l) < rsum(l+1, i)) ++l;
if (l > 1 && abs(rsum(1, l-1) - rsum(l, i)) < abs(rsum(1, l) - rsum(l+1, i))) --l;
while (r<N-1 && rsum(i+1, r) < rsum(r+1, N)) ++r;
if (r > i + 1 && abs(rsum(i+1, r-1) - rsum(r, N)) < abs(rsum(i+1, r) - rsum(r+1, N))) --r;
vector<ll> vi;
vi.pb(rsum(1, l)); vi.pb(rsum(l+1, i)); vi.pb(rsum(i+1, r)); vi.pb(rsum(r+1, N));
sort(vi.begin(), vi.end());
ret = min(ret, vi[3] - vi[0]);
}
cout << ret << '\n';
}
| 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int a, b;
int x[4],y[2];
int ans = 0;
int main() {
for(int i = 0; i < 4; i++){
cin >> a;
x[i] = a;
}
for(int i = 0; i < 2; i++){
cin >> b;
y[i] = b;
}
sort(x, x+4);
sort(y, y+2);
reverse(x, x+4);
reverse(y, y+2);
for(int i = 0; i < 3; i++){
ans += x[i];
}
ans += y[0];
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a[4];
for(int i=0;i<4;i++) cin>>a[i];
int e,f;
cin>>e>>f;
sort(a,a+4,greater<int>());
if(e<f){
cout<<a[0]+a[1]+a[2]+f<<endl;
}
else{
cout<<a[0]+a[1]+a[2]+e<<endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll x;
cin>>x;
ll d=x/11;
ll r=x%11;
if(0==r){
cout<<2*d<<endl;
}else{
if(r<7){
cout<<2*d+1ll<<endl;
}else{
cout<<2*d+2ll<<endl;
}
}
return 0;
} | #include <iostream>
#include <string>
#include <map>
#include <string.h>
using namespace std;
int main(){
map<char,int> ch;//文字の数字辞書登録
ch['I']=1;
ch['V']=5;
ch['X']=10;
ch['L']=50;
ch['C']=100;
ch['D']=500;
ch['M']=1000;
int ans=0;
int len=0;
char s[1111];
while(cin >> s){
len=strlen(s);
for(int i=0;i<len;i++){
if(ch[s[i]]<ch[s[i+1]]){//もしも引き算をすべき場合だったら
ans-=ch[s[i]];
}else{
ans+=ch[s[i]];
}
}
cout << ans << endl;
ans=0;
}
} | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <iomanip>
using ll=long long;
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int> P(N+2);
for(int i=0;i<N;i++){
cin>>P[i];
}
int tmp=0;
for(int i=0;i<K;i++){
tmp+=P[i];
}
int maxnum=tmp;
for(int i=0;i+K<N;i++){
tmp-=P[i];
tmp+=P[i+K];
if(tmp>maxnum){
maxnum=tmp;
}
}
double ans=(maxnum+K)/(double)2;
cout<<fixed<<setprecision(7)<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,M,i,a,c = 0;scanf("%lld%lld",&N,&M);
map<ll,ll> mp;
mp[0] = 1;
for(i=0;i<N;i++){
scanf("%lld",&a);
c = (c+a) % M;
if(mp.find(c) != mp.end()) mp[c]++;
else mp[c] = 1;
}
ll ans = 0;
for(auto itr = mp.begin();itr != mp.end();itr++) ans += itr->second*(itr->second-1)/2;
printf("%lld\n",ans);
}
| 0 |
#include <iostream>
using namespace std;
int table[100][100];
int memo[100][100];
int w, h;
int xs, ys, xg, yg;
int n;
void solve(int xs, int ys, int c)
{
if( memo[xs][ys] ) {
return;
}
if( !( 0 < xs && xs < w+1 && 0 < ys && ys < h+1 && table[xs][ys] == c ) ) {
memo[xs][ys] = 1;
return;
}
if( xs == xg && ys == yg ) {
memo[xs][ys] = 1;
cout << "OK" << endl;
throw "OK";
}
memo[xs][ys] = 1;
solve(xs+1, ys, c);
solve(xs, ys+1, c);
solve(xs-1, ys, c);
solve(xs, ys-1, c);
return;
}
int main(int argc, char* argv[])
{
while(1) {
for( int i = 0; i < 100; i++ ) {
for( int j = 0; j < 100; j++ ) {
table[i][j] = 0;
memo[i][j] = 0;
}
}
cin >> w >> h;
if( w == 0 && h == 0 )
break;
cin >> xs >> ys;
cin >> xg >> yg;
cin >> n;
for( int i = 0; i < n; i++ ) {
int c; cin >> c;
int d; cin >> d;
int x, y; cin >> x >> y;
if( d == 0 ) {
table[x][y] = c;
table[x][y+1] = c;
table[x+1][y] = c;
table[x+1][y+1] = c;
table[x+2][y] = c;
table[x+2][y+1] = c;
table[x+3][y] = c;
table[x+3][y+1] = c;
} else {
table[x][y] = c;
table[x+1][y] = c;
table[x][y+1] = c;
table[x+1][y+1] = c;
table[x][y+2] = c;
table[x+1][y+2] = c;
table[x][y+3] = c;
table[x+1][y+3] = c;
}
}
try {
if( table[xs][ys] )
solve(xs, ys, table[xs][ys]);
cout << "NG" << endl;
} catch(...) {
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; i++) cin >> x[i];
int l;
cin >> l;
vector<vector<int>> dbl(21, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int ni = upper_bound(begin(x), end(x), x[i] + l) - begin(x) - 1;
dbl[0][i] = ni;
}
for (int i = 0; i < 20; i++) {
for (int j = 0; j < n; j++) {
dbl[i + 1][j] = dbl[i][dbl[i][j]];
}
}
int q;
cin >> q;
while (q--) {
int a, b;
cin >> a >> b, a--, b--;
if (a > b) swap(a, b);
int cur = a;
int ans = 0;
for (int i = 20; i >= 0; i--) {
if (dbl[i][cur] >= b) continue;
cur = dbl[i][cur];
ans += 1 << i;
}
cout << ans + 1 << endl;
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
vector<long long>fact(200550);
long long bigmod(long long a, long long p){
if(p == 0){
return 1;
}
long long ans = bigmod(a, p/2);
ans = (ans * ans) % mod;
if(p % 2 == 1){
ans = (ans * a) % mod;
}
return ans;
}
long long per(long long a, long long b){
long long cur = (fact[b] * fact[a]) % mod;
cur = bigmod(cur, mod - 2);
cur = (cur * fact[a + b]) % mod;
return cur;
}
int main(){
long long h, w, a, b;
cin >> h >> w >> a >> b;
long long ans = 0;
fact[0] = 1;
for(long long i = 1; i <= 200010; i++){
fact[i] = (fact[i - 1] * i) % mod;
}
long long p = h - a, q = b + 1;
while(p >= 1 && q <= w){
ans = (ans + (per(p - 1, q - 1) * per(h - p, w - q)) % mod) % mod;
p--;
q++;
}
cout << ans;
return 0;
} | /*--------------------------------
Author: The Ace Bee
Blog: www.cnblogs.com/zsbzsb
This code is made by The Ace Bee
--------------------------------*/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#define rg register
using namespace std;
template < typename T > inline void read(T& s) {
s = 0; int f = 0; char c = getchar();
while (!isdigit(c)) f |= (c == '-'), c = getchar();
while (isdigit(c)) s = s * 10 + (c ^ 48), c = getchar();
s = f ? -s : s;
}
const int p = 1000000007;
const int _ = 500010;
int n, m, a, b, fac[_], inv[_];
inline void pre() {
fac[0] = inv[0] = inv[1] = 1;
for (rg int i = 1; i < _; ++i) fac[i] = 1ll * i * fac[i - 1] % p;
for (rg int i = 2; i < _; ++i) inv[i] = 1ll * (p - p / i) * inv[p % i] % p;
for (rg int i = 1; i < _; ++i) inv[i] = 1ll * inv[i - 1] * inv[i] % p;
}
inline int C(int n, int m) { return 1ll * fac[n] * inv[n - m] % p * inv[m] % p; }
inline int calc(int i1, int j1, int i2, int j2) { return C(i2 - i1 + j2 - j1, i2 - i1); }
int main() {
pre();
read(n), read(m), read(a), read(b);
int res = 0;
for (rg int i = 1; i <= n - a; ++i)
res = (res + 1ll * calc(1, 1, i, b) * calc(i, b + 1, n, m) % p) % p;
printf("%d\n", res);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main() {
int n,a,b,pa,pb;
while(pa=pb=0,cin>>n,n){
for(;n;--n){
cin>>a>>b;
if(a>b)pa+=(a+b);
else if(a<b)pb+=(a+b);
else pa+=a,pb+=b;
}
cout<<pa<<" "<<pb<<endl;
}
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define n1 "\n"
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define popb pop_back()
#define popf pop_front()
const int BIG=1e5+55;
const int BIGG=1e9+7;
const ll BIGGE=1e12+55;
const double SML=(1e-7);
using namespace std;
int a[5];
bool go = 0;
void dp(int i, int sum, string s) {
if (go || i > 3)
return;
if (sum == 7 && i == 3) {
go = 1;
cout <<s <<'=' <<7;
return;
}
string ans = s , an = s;
ans += '-';
ans += (a[i+1] + '0');
if (i != -1)
an += '+';
an += (a[i+1] + '0');
if (i != -1)
dp(i+1 , sum-a[i+1] ,ans);
dp(i+1 , sum+a[i+1] ,an);
}
int main()
{
ios::sync_with_stdio(false); cin.tie(NULL);
cout.tie(NULL);
for (int i=0; i<4; i++) {
char c;
cin >>c;
a[i] = c - '0';
}
dp(-1,0,"");
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 MAIN() {
int n;
cin >> n;
vector<vector<int>> a(3, vector<int>(n));
vector<vector<int>> d(3, vector<int>(n));
for (auto &i : a) {
for (auto &j : i) cin >> j;
sort(all(i));
}
for (int i = n - 1; i >= 0; i--) {
d[2][i] = 1;
if (i != n - 1) d[2][i] += d[2][i + 1];
}
for (int i = 1; i >= 0; i--) {
for (int j = n - 1; j >= 0; j--) {
int p = upper_bound(all(a[i + 1]), a[i][j]) - a[i + 1].begin();
if (p != n) d[i][j] = d[i + 1][p];
if (j != n - 1) d[i][j] += d[i][j + 1];
}
}
cout << d[0][0] << '\n';
}
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
#endif
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int n;
cin>>n;
vin a(n),b(n),c(n);
rep(i,0,n)cin>>a[i];rep(i,0,n)cin>>b[i];rep(i,0,n)cin>>c[i];
sort(all(a));sort(all(b));sort(all(c));reverse(all(c));
ll ans=0;
rep(i,0,n){
int m=b[i];
//二分探索
ll acnt=0;
int ok=-1,ng=n;
while(ng-ok>1){
int mid=ok+(ng-ok)/2;
if(a[mid]<m)ok=mid;
else ng=mid;
}
acnt=ok+1;
ll ccnt=0;
ok=-1,ng=n;
// cout<<m<<endl;
while(ng-ok>1){
// if(m==2)cout<<ok<<" "<<ng<<endl;
int mid=ok+(ng-ok)/2;
if(c[mid]>m)ok=mid;
else ng=mid;
}
ccnt=ok+1;
// cout<<acnt<<" "<<ccnt<<endl;
ans+=acnt*ccnt;
}
cout<<ans<<endl;
} | 1 |
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int a[100][100];
bool r[100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
cin>>a[i][j];
}
}
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > >q;
q.push(make_pair(0,0));
int cost=0;
pair<int,int> e;
while(!q.empty()) {
e=q.top();
q.pop();
if(r[e.second]) continue;
r[e.second]=true;
cost+=e.first;
for(int i=0; i<n; i++) {
if(a[e.second][i]!=-1) q.push(make_pair(a[e.second][i], i));
}
}
cout<<cost<<'\n';
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#define to first
#define cost second
const int inf=1e9+7;
using namespace std;
int main(){
int n,tmp,r=0,flag[100]={},v=0;
cin>>n;
vector <pair<int,int> > gl[n];
priority_queue <pair<int,int> ,vector<pair<int,int> >, greater<pair<int,int> > >q;
//for(int i=1;i<n;i++) mincost[i]=inf;
for(int i=0;i<n;i++) for(int j=0;j<n&&cin>>tmp;j++) if(tmp!=-1) gl[i].push_back(make_pair(j,tmp));
int now=0;
for(int j=0;j<n-1;j++){
for(int i=0;i<gl[now].size();i++) if(!flag[gl[now][i].to]) q.push(make_pair(gl[now][i].cost,gl[now][i].to));
flag[now]=1;
for(;flag[q.top().second];) q.pop();
//if(q.empty()) break;
r+=q.top().first;
now=q.top().second;
q.pop();
}
cout<<r<<endl;
return 0;
} | 1 |
/**Lucky Boy**/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 100005
#define maxm 1000006
#define pii pair <int,int>
#define Task ""
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar())) x=x*10+c-48;if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
using namespace std;
int n,gt[maxn << 1],ans,cur;
int main()
{
ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
//freopen(Task".inp", "r",stdin);
//freopens(Task".out", "w",stdout);
cin >> n;
n <<= 1;
gt[0] = 1;
FOR(i,1,n) gt[i] = (1ll*gt[i-1]*i) % maxc;
ans = gt[n / 2];
FOR(i,1,n)
{
int x;
char c;
cin >> c;
x = (c == 'W');
if (x)
{
if (cur & 1)
{
++cur;
}
else
{
ans = (1ll*ans*cur) % maxc;
--cur;
}
}
else
{
if (cur & 1)
{
ans = (1ll*ans*cur) % maxc;
--cur;
}
else
{
++cur;
}
}
}
if (cur) ans = 0;
cout << ans;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string.h>
#include <cstdlib>
#include <vector>
#include <string>
#include <bitset>
#include <math.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7, INF = 1e18 + 1;
using namespace std;
ll er[1000001], p[1000000], ptr, n, d[1000][1000];
ll gcd (ll a, ll b)
{
if (!b) return a;
else return gcd (b, a % b);
}
int main ()
{
for (ll i = 2; i <= 1000000; i++)
if (!er[i])
{
p[ptr++] = i;
for (ll j = i * i; j <= 1000000; j += i)
er[j] = 1;
}
cin >> n;
for (int i = 0; i < 2 * n; i += 2)
for (int j = 0; i + j < 2 * n; j++)
d[j][i + j] = p[i / 2];
for (int i = 2; i < 2 * n; i += 2)
for (int j = 0; i + j < 2 * n; j++)
d[i + j][j] = p[i / 2 + (n + 1) / 2 - 1];
for (int i = 0; i < 2 * n; i += 2)
for (int j = 0; i >= j; j++)
d[i - j][j] *= p[i / 2 + n];
ll mx = 0;
if (n == 2)
{
printf ("4 7\n23 10");
return 0;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (!d[i][j])
{
ll lcm = 1;
if (j) lcm = lcm / gcd (lcm, d[i][j-1]) * d[i][j-1];
if (j < n - 1) lcm = lcm / gcd (lcm, d[i][j+1]) * d[i][j+1];
if (i) lcm = lcm / gcd (lcm, d[i-1][j]) * d[i-1][j];
if (i < n - 1) lcm = lcm / gcd (lcm, d[i+1][j]) * d[i+1][j];
d[i][j] = lcm + 1;
}
printf ("%lld ", d[i][j]);
}
putchar ('\n');
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> wa(N + 5, 0);
for (int i = 0; i < M; i++) {
int p;
string s;
cin >> p >> s;
if (wa[p] >= 0 && s == "WA") wa[p]++;
else if (wa[p] >= 0 && s == "AC") wa[p] = wa[p] * (-1) - 1;
}
int ac = 0, penalty = 0;
for (auto a: wa){
if (a < 0) {
penalty += (a + 1) * (-1);
ac++;
}
}
cout << ac << " " << penalty << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int d, g;
cin >> d >> g;
int p[d], c[d];
rep (i, 0, d) cin >> p[i] >> c[i];
// 全完するものをbitで表す
int ans = inf;
rep (bit, 0, 1 << d) {
int sum = 0, cnt = 0;
rep (i, 0, d) {
if (bit & 1 << i) {
sum += (i + 1) * 100 * p[i] + c[i];
cnt += p[i];
}
}
if (sum >= g) {
ans = min (ans, cnt);
} else {
per (i, 0, d) {
if (1 << i & bit) continue;
int res = (g - sum) / (100 * (i + 1));
if (res * 100 * (i + 1) + sum < g) res++;
if (res > p[i]) break;
cnt += res;
sum += res * 100 * (i + 1);
break;
}
if (sum >= g) ans = min (ans, cnt);
}
}
cout << ans << "\n";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1){
int h,w;
cin >> h >> w;
int diagonal = h*h + w*w;
if(h==0 && w==0) break;
pair<int,int> ans = make_pair(500,500); //first = h , second = w
for(int i=1; i<151; i++){
for(int j=i+1; j<151; j++){
int check_rect_diagonal = i*i + j*j;
if(diagonal < check_rect_diagonal || (diagonal == check_rect_diagonal && h < i)){
int ans_h = ans.first;
int ans_w = ans.second;
int ans_rect_diagonal = ans_h*ans_h + ans_w*ans_w;
if(check_rect_diagonal < ans_rect_diagonal || (check_rect_diagonal == ans_rect_diagonal && i < ans_h )){
ans = make_pair(i,j);
}
}
}
}
cout << ans.first << " " << ans.second << endl;
}
return 0;
}
| //2004 366 1/1 Thursday
#include <cstdio>
using namespace std;
void today(int mon, int day);
int main()
{
int mon, day;
while (1){
scanf("%d %d", &mon, &day);
if (mon == 0){
break;
}
today(mon, day);
}
return (0);
}
void today(int mon, int day)
{
int tmp = 0;
for (int i = 1; i < mon; i++){
if (i == 4 || i == 6 || i == 9 || i == 11){
tmp += 30;
}
else if (i == 2){
tmp += 29;
}
else {
tmp += 31;
}
}
switch ((tmp + day) % 7){
case 0:
puts("Wednesday");
break;
case 1:
puts("Thursday");
break;
case 2:
puts("Friday");
break;
case 3:
puts("Saturday");
break;
case 4:
puts("Sunday");
break;
case 5:
puts("Monday");
break;
case 6:
puts("Tuesday");
break;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int h,w,ans = 0;
int dx[4] = {-1,0,1,0},dy[4] = {0,-1,0,1};
bool flag = true;
cin >> h >> w;
string s[h];
rep(i,h) cin >> s[i];
rep(i,h){
rep(j,w){
if(s[i][j] == '#'){
flag = false;
for(int a = 0;a < 4;a++){
if(i+dx[a] >= 0 && i+dx[a] < h && j+dy[a] >= 0 && j+dy[a] < w && s[i+dx[a]][j+dy[a]] == '#')
flag = true;
}
if(flag == false){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < min(k, 50); i++){
vector<int> imos(n); //I'll begin the imos method
for(int j = 0; j < n; j++){
int l = max(0, j-a[j]);
int r = min(n-1, j+a[j]);
imos[l]++;
if(r+1 <= n-1){
imos[r+1]--;
}
}
for(int k = 0; k < n; k++){
if(k > 0){
imos[k] += imos[k-1];
}
}
for(int l = 0; l < n; l++){
a[l] = imos[l];
}
//a = imos;
}
for(int i = 0; i < n; i++){
cout << a[i] << " ";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,q;
while(cin >> n && n != 0){
cin >> q;
map<int,int> d;
for(int i = 0;i < n; i++){
int m; cin >> m;
for(int j = 0; j < m; j++){
int t; cin >> t;
if(d.find(t) != d.end()){
d[t]++;
}
else{
d[t] = 1;
}
}
}
int ans = 0, num = 0;
for(map<int,int>::iterator it = d.begin(); it != d.end(); it++){
if(it->second > num){
ans = it->first;
num = it->second;
}
}
if(num < q){
cout << 0 << endl;
}
else cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(){
int n, q;
while(true){
cin >> n >> q;
if(n == 0)
break;
int m;
vector< vector<int> > sch(n, vector<int>(101, 0));
for(int i=0; i<n; i++){
cin >> m;
for(int j=0; j<m; j++){
int temp;
cin >> temp;
sch[i][temp] = 1;
}
}
int ans, nmax = 0;
for(int i=0; i<101; i++){
int sum = 0;
for(int j=0; j<n; j++){
sum += sch[j][i];
}
if(sum > nmax){
ans = i;
nmax = sum;
}
}
if(nmax < q)
ans = 0;
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int sx,sy,tx,ty;
cin >> sx >> sy >> tx >> ty;
string f="",b="";
rep(i,ty-sy)f.push_back('U');
rep(i,tx-sx)f.push_back('R');
rep(i,ty-sy)b.push_back('D');
rep(i,tx-sx)b.push_back('L');
cout << f << b << "LU" << f <<"RDRD" << b << "LU"<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long sx, long long sy, long long tx, long long ty){
ll dx = (tx - sx);
ll dy = (ty - sy);
string ans = "";
ans = ans + string(dy, 'U') + string(dx, 'R');
ans = ans + string(dy, 'D') + string(dx, 'L');
ans = ans + 'L' + string(dy+1, 'U') + string(dx+1, 'R') + 'D';
ans = ans + 'R' + string(dy+1, 'D') + string(dx+1, 'L') + 'U';
cout << ans << endl;
return;
}
int main(){
long long sx;
scanf("%lld",&sx);
long long sy;
scanf("%lld",&sy);
long long tx;
scanf("%lld",&tx);
long long ty;
scanf("%lld",&ty);
solve(sx, sy, tx, ty);
return 0;
}
| 1 |
//2015
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(void){
int i,ad[4]={0},e=0,f=0,sum=0;
for(i=0;i<4;i++){
cin>>ad[i];
}
cin>>e;
cin>>f;
sort(ad,ad+4,greater<int>());//降順,昇順＝＝sort(ad,ad+4);
for(i=0;i<3;i++){
sum+=ad[i];
}
if(e<f){
sum+=f;
}
else{
sum+=e;
}
cout<<sum<<endl;
return 0;
}
| /**
* author: zvm
* created: 25.09.2020 13:51:29
**/
#include <bits/stdc++.h>
using namespace std ;
typedef long long int ll ;
const ll INF = 1e18 ;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n ;
cin >> n ;
vector<int> a(n), b(n), c(n);
for( int i = 0 ; i < n ; ++i ) {
cin >> a[i] ;
}
for( int i = 0 ; i < n ; ++i ) {
cin >> b[i] ;
}
for( int i = 0 ; i < n ; ++i ) {
cin >> c[i] ;
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
sort(c.begin(),c.end());
vector<pair<int,ll>> good(n);
for( int i = 0 ; i < n ; ++i ) {
good[i].first = b[i] ;
good[i].second = c.end() - upper_bound(c.begin(),c.end(),b[i]) ;
}
for( int i = n-2 ; i >= 0 ; --i ) {
good[i].second += good[i+1].second ;
}
ll ans = 0 ;
for( int i = 0 ; i < n ; ++i ) {
pair<int,ll> to_find{a[i],INF};
auto pos = upper_bound(good.begin(),good.end(),to_find) ;
if( pos != good.end() ) {
ans += (*pos).second ;
}
}
cout << ans << endl ;
}
| 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) { //最大公約数
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
ll digit_sum(ll a){ //10進桁和
ll ans=0;
while(a>0){
ans+=a%10;
a/=10;
}
return ans;
}
int main()
{
ll n,m,X,Y,x[110],y[110];
cin>>n>>m>>X>>Y;
rep(i,n)cin>>x[i];
rep(i,m)cin>>y[i];
for(ll i=X+1;i<=Y;i++){
ll tmp1=0,tmp2=0;
rep(j,n){
if(x[j]>=i){
tmp1++;
}
}
rep(k,m){
if(y[k]<i){
tmp2++;
}
}
if(tmp1==0&&tmp2==0){
cout<<"No War"<<endl;
return 0;
}
}
cout<<"War"<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m,x,y;
cin>>n>>m>>x>>y;
int maxx=x,miny=y,xd,yd;
rep(i,n){
cin>>xd;
maxx=max(maxx,xd);
}
rep(i,m){
cin>>yd;
miny=min(miny,yd);
}
if(maxx<miny) cout<<"No War";
else cout<<"War";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int result;
result = 0;
int resultnow;
resultnow = 100;
int a;
for (int i = 0; i < n; i++)
{
cin >> a;
result = 0;
while (a%2==0)
{
a=a/2;
result=result+1;
}
resultnow = min(result,resultnow);
}
cout << resultnow << endl;
} | #include <bits/stdc++.h>
#include <iomanip> // setprecision
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
// 辺を何回使うか = x
//
// ### 全ての辺についての x の総和
// sigma(x)
// 辺
// = 辺1のx + 辺2のx + ... 辺nのx
// = 辺の本数 * x
// ### n 個の町から2個を選び、その間にできる辺の数を数える
// ### n=3 の場合、3C2 = (3*2) / (2*1) = 3 で、辺の本数は3本となる
// = nC2 * x ... (a)
//
// ### n=3 の場合、3点を結ぶ辺は2本になる。そのため (n-1)
// ### 町を巡回する経路は n! = 3*2*1 = 6通りある。
// = (n-1) * n! ... (b)
//
// ### (a) (b) より
//
// nC2 * x = (n-1) * n!
// x = ((n-1) * n!) / nC2
// x = ((n-1) * n!) / (n*(n-1) / (2*1))
// x = 2((n-1) * n!) / (n*(n-1))
// x = 2 * (n-1)!
//
vector<int> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> x.at(i) >> y.at(i);
}
// [&] 参照キャプチャ、vectorコンテナ x, y を lambda 式内で参照している
auto dist = [&](int i, int j) {
double dx = x.at(i) - x.at(j);
double dy = y.at(i) - y.at(j);
return sqrt(dx*dx + dy*dy);
};
// 全パターンの辺の長さの和を求める
double len = 0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
// 特定2点の辺の長さ
len += dist(i, j);
}
}
// 辺の利用回数
int num = 2;
for (int i = 1; i <= (n-1); i++) {
num = num * i;
}
// 巡回のパターン数
int cnt = 1;
for (int i = 1; i <= n; i++) {
cnt = cnt * i;
}
// ### 入力例1の場合
// len = (1,2) の辺の長さ + (2,3) の辺の長さ + (3,1) の辺の長さ
// num = 全パターンの巡回を行った際、各辺の利用回数 = 4
// len * num = 全パターンの巡回を行った際の辺の長さの和
//
// cnt = 巡回のパターン数
// (len * num) / cnt = 1パターンごとの経路の平均値
//
//
// ### 経路の長さの平均値である ans を算出する数式を整理する
//
// x = 2 * (n-1)!
//
// ans = (各辺の長さの和 * 1辺ごとの利用回数) / パターン数
// = (sigma(len) * (2 * (n-1)!)) / n!
// = (sigma(len) * 2) / n
//
// これより、以下の式でもOK
// double ans = (len * 2) / n;
// これより平均値
double ans = (len * num) / cnt;
printf("%.10f\n", ans);
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
const ll mod = 998244353;
ll modpow(ll n,ll r){
ll res = 1;
while(r){
if(r & 1)res = res*n%mod;
n = n*n%mod;
r >>= 1;
}
return res;
}
int main(){
int n;
cin >> n;
vector<int> v(n,0);
bool is = true;
rep(i,n){
int x;cin >> x;
v[x]++;
if(i == 0 && x != 0)is =false;
}
int mx = 0;
rep(i,n)if(v[i] != 0)mx = i;
ll res = 1;
for(int i = 1;i <= mx;i++)(res *= modpow(v[i-1],v[i]))%=mod;
if(v[0] != 1 || !is)res = 0;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> L(N);
for(int i = 0; i < N; i++) cin >> L.at(i);
int total = 0;
if(N < 3) cout << "0" << endl;
else
{
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(L.at(i) == L.at(j) || L.at(j) == L.at(k) || L.at(k) == L.at(i))
{
continue;
}
if(L.at(i) + L.at(j) > L.at(k) && L.at(i) + L.at(k) > L.at(j) && L.at(j) + L.at(k) > L.at(i))
{
total++;
}
}
}
}
cout << total << endl;
}
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;
int w;
cin>>s>>w;
rep(i,s.size()) if(i%w==0)cout<<s[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{int A, B; cin >> A >> B;
cout << (B + A - 3) / (A - 1);} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
using i64 = int64_t;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr i64 MOD = 1000000007;
constexpr i64 INF = 1LL << 60;
string s[55];
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int h, w; cin >> h >> w;
rep(i, 0, h) cin >> s[i];
rep(i, 0, h) rep(j, 0, w) {
if (s[i][j] == '.') continue;
bool ok = false;
rep(k, 0, 4) {
int nx = j + dx[k];
int ny = i + dy[k];
if (0 <= nx && nx < w && 0 <= ny && ny < h) {
if (s[ny][nx] == '#') ok = true;
}
}
if (!ok) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1000010;
int x,n,fl,ans;
char s[maxn],t[maxn];
queue<int>q;
signed main()
{
cin>>n>>s+1>>t+1;
for(int i=1;i<=n;i++)if(s[i]!=t[i]){fl=1;continue;}
if(!fl)puts("0"),exit(0);
int x=n,y=n;
while(y)
{
while(y>1&&t[y]==t[y-1])y--;
while(x>0&&(x>y||s[x]!=t[y]))x--;
if(x<=0)puts("-1"),exit(0);
while (!q.empty()&&q.front()-q.size()>=y)q.pop();
if(x!=y)q.push(x);
ans=max(ans,(int)q.size()+1);
y--;
}
cout<<ans;
} | 0 |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int cnt[N],ans[N],a[N];
int n,q,bl;
int res;
struct node
{
int l,r,p;
}e[N];
bool cmp(const node &a,const node &b)
{
return (a.l/bl)==(b.l/bl) ? a.r<b.r :a.l>b.l;
}
void remove(int x)
{
if((--cnt[a[x]])==0) res--;
}
void add(int x)
{
if((++cnt[a[x]])==1) res++;
}
int main()
{
scanf("%d %d",&n,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
bl=sqrt(n);
for(int i=1,l,r;i<=q;i++)
{
scanf("%d %d",&l,&r);
e[i]={l,r,i};
}
// cout<<"--------------"<<endl;
sort(e+1,e+1+q,cmp);
// cout<<"*****"<<endl;
res=0;
int curL=1,curR=0;
for(int i=1;i<=q;i++)
{
//cout<<i<<endl;
int L=e[i].l,R=e[i].r;
while(curL<L) remove(curL++);
while(curL>L) add(--curL);
while(curR<R) add(++curR);
while(curR>R) remove(curR--);
ans[e[i].p]=res;
}
for(int i=1;i<=q;i++) printf("%d\n",ans[i]);
}
| #ifndef _TEMPLATE_ROOT
#define _TEMPLATE_ROOT
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repl(i, a, b) for(ll i = a; i < (b); ++i)
#define repd(i, a, b) for(int i = a; i >= (b); --i)
#define repdl(i, a, b) for(ll i = a; i >= (b); --i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true; } return false; }
template<typename H> bool chmax(H& v1, const H v2) { if (v1 < v2) { v1 = v2; return true; } return false; }
#endif
#ifndef _TEMPLATE_IO
#define _TEMPLATE_IO
template<typename H> void read(H& head) { cin >> head; }
template<typename H, typename ...T> void read(H& head, T& ...tail) { cin >> head; read(tail...); }
template<typename H> void write(H head) { cout << head << '\n'; }
template<typename H, typename ...T> void write(H head, T ...tail) { cout << head << " "; write(tail...); }
template<typename ...T> void writef(T ...tail) { write(tail...); cout << flush; }
template<typename ...T> void die(T ...tok) { write(tok...); exit(0); }
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
if (v.size()) {
rep(i, 0, sz(v) - 1)
out << v[i] << " ";
out << v.back();
}
return out;
}
#endif
#ifndef _TEMPLATE_SEGTREE
#define _TEMPLATE_SEGTREE
#ifndef _TEMPLATE_MONOID
#define _TEMPLATE_MONOID
template<class T>
struct Monoid {
T id;
virtual T op(T a, T b) = 0;
};
#endif
template<typename T, typename M, typename = enable_if<is_base_of<Monoid<T>, M>::value>>
struct SegTree {
M monoid;
vector<T> tree;
int size;
SegTree(vector<T> elems, M monoid) : size(elems.size()), monoid(monoid) {
tree = vector<T>(2 * size);
for (int i = 0; i < size; i++)
tree[size + i] = elems[i];
build();
}
SegTree(int size, M monoid) : size(size), monoid(monoid) {
tree = vector<T>(2 * size, monoid.id);
build();
}
void build() {
for (int i = size - 1; i > 0; --i)
tree[i] = monoid.op(tree[i << 1], tree[i << 1 | 1]);
}
T query(int l, int r) {
T resl = monoid.id, resr = monoid.id;
++r; // handle inclusive query range
for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
if (l & 1) resl = monoid.op(resl, tree[l++]);
if (r & 1) resr = monoid.op(tree[--r], resr);
}
return monoid.op(resl, resr);
}
T get(int p) {
return tree[size + p];
}
void update(int p, T val) {
for (tree[p += size] = val; p >>= 1;)
tree[p] = monoid.op(tree[p << 1], tree[p << 1 | 1]);
}
};
#endif
using namespace std;
struct Query {
int l, r, id, ans;
};
struct SegTreeAdd : public Monoid<int> {
int id = 0;
int op(int a, int b) { return a + b; }
};
int n, q;
int c[500005];
Query p[500005];
int lst[500005];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
read(n, q);
rep(i, 1, n + 1) read(c[i]);
rep(i, 1, q + 1) read(p[i].l, p[i].r), p[i].id = i;
sort(p + 1, p + q + 1, [](const Query& p1, const Query& p2) {
return p1.r < p2.r;
});
SegTree<int, SegTreeAdd> segtree(n + 1, SegTreeAdd());
int curr = 0;
rep(i, 1, q + 1) {
while (p[i].r > curr) {
++curr;
if (lst[c[curr]])
segtree.update(lst[c[curr]], 0);
lst[c[curr]] = curr;
segtree.update(lst[c[curr]], 1);
}
p[i].ans = segtree.query(p[i].l, p[i].r);
}
sort(p + 1, p + q + 1, [](const Query& p1, const Query& p2) {
return p1.id < p2.id;
});
rep(i, 1, q + 1)
write(p[i].ans);
}
| 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int i = 1;
while (++i <= n) {
int x = i;
if (x % 3 == 0) {
cout << ' ' << i;
}
else{
while (x > 0) {
if (x % 10 == 3) {
cout << ' ' << i;
break;
}
x /= 10;
}
}
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;
cin>>s;
vector<string>week={"SAT","FRI","THU","WED","TUE","MON","SUN"};
rep(i,7){
if(s==week.at(i)){
cout<<i+1<<endl;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
// aを常に小さい値にする 大きい値にする
template<class T> bool chmin(T &a, T b){ if(a>b) a = b; }
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
// 二分探索 前方のindexを返すもの（自分自身を含む） 前方: -INF側のこと
template<class T> int former(const vector<T> &v, T x){
return upper_bound(v.begin(), v.end(), x) - v.begin() -1; // upper_bound : keyより大きい要素の内の一番左側のイテレータを返す
}
// 二分探索 後方のindexを返すもの（自分自身を含む）後方: INF側のこと
template<class T> int latter(const vector<T> &v, T x){
return lower_bound(v.begin(), v.end(), x) - v.begin(); // lower_bound : key以上の要素の内の一番左側のイテレータを返す
}
// 最大公約数を求める GCD
int GCD(int a, int b) { return b ? GCD(b, a%b) : a; }
/*
* 素因数分解っぽいテーマの問題。こういうのは「まずは素数べきで考える」というのが 1 つの定石ではある。p を素数として
a1×a2×...×aN=pk
を満たす (a1,a2,...,aN) が何通りあるかを考える。これは実は、p の指数に着目して ai=pxi として、
x1+x2+...+xN=k
を満たす 0 以上の整数 (x1,x2,…,xN) が何通りあるかを数え上げる問題と考えることができる。
これは重複組合せ！！！！！
重複組合せは、「仕切りを使って考える」というのが 1 つの見方ではある。（●と｜を並べて考えるというものである）
【N 個の玉と、k−1 個の仕切りの並び替え方を数える問題】
nHk = c+k-1Ck で求められる
M が素数べきについての考察を終えたので、一般の合成数について考えることになるのだが、実は各素因子についてまったく独立に考えることができる。
つまり、上記のことを各素因子ごとに独立に行って、得られた結果を掛け算していけば OK。
*
* */
// 素因数分解 pair
vector<pair<ll, ll> > prime_factorize(ll n) {
vector<pair<ll, ll> > res;
for (ll p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
const int MAX = 210000;
const int MOD = 1000000007;
// 二項係数の計算nCk セット
// https://drken1215.hatenablog.com/entry/2018/06/08/210000
// 使い方としては、最初に一度前処理として COMinit() をしておけば、あとは COM(n, k) 関数を呼べばよい
// 前処理 COMinit(): O(n)
// クエリ処理 COM(n, k): O(1)
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/**
* // 前処理
COMinit();
// 計算
cout << COM(100000, 50000) << endl;
のようにつかう
*/
int main() {
int N, M;
COMinit();
cin >> N >> M;
auto vec = prime_factorize(M);
long long res = 1;
for (auto pa : vec) {
int num = pa.second;
long long tmp = COM(num+N-1, N-1);
res = (res * tmp) % MOD;
}
cout << res << endl;
} | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
vector<vector<ll>> bunkai(ll a){
if(a<=0) return {};
if(a==1) return {{1,1}};
vector<ll> f;
ll b=a;
for(ll i=2;i*i<=a;i++){
if(b%i==0){
f.push_back(i);
b=b/i;
i--;
}
if(b==1)break;
}
if(b!=1)f.push_back(b);
vector<vector<ll>> u;
ll p=f[0];
ll c=1;
for(ll i=1;i<f.size();i++){
if(f[i]==p)c++;
else{
u.push_back({p,c});
p=f[i];
c=1;
}
}
u.push_back({p,c});
return u;
}
ll powmod(ll a,ll n,ll m) {
if(n == 0)
return 1;
if(n % 2 ==0){
ll r = powmod(a,n/2,m);
return r*r % m;
}
return a*powmod(a,n-1,m)%m;
}
ll factmod(ll a,ll b,ll m) {
if(a<b)return 0;
ll s=1;
while(a>=b){
s = s*a % m;
a -= 1;
}
return s;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll combmod(ll a,ll b,ll m){
if(b==0)return 1;
ll c=factmod(a,a-b+1,m);
ll d=modinv(factmod(b,1,m),m);
ll e=(c*d)%m;
return e;
}
void modsum(ll &a,ll b,ll m){
a+=b;
a%=m;
}
void modsub(ll &a,ll b,ll m){
a-=b;
a+=m;
a%=m;
}
void modmul(ll &a,ll b,ll m){
a*=b;
a%=m;
}
void modquo(ll &a,ll b,ll m){
a*=modinv(b,m);
a%=m;
}
int main(){
ll n,m;
cin >> n >> m;
mat f=bunkai(m);
ll ans=1;
if(m==1){
cout << 1 << endl;
return 0;
}
for(ll i=0;i<f.size();i++){
modmul(ans,combmod(f[i][1]+n-1,n-1,mod),mod);
}
cout << ans << endl;
} | 1 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cmath>
#include<string>
#include<fstream>
using namespace std;
//const int N = 1e3 + 5;
int main(){
int n,d=0,t=0,count=0;
cin >> n;
if (0 <= n&&n <= 2){
cout << 0 << endl;
return 0;
}
while (n)
{
n -=3;
if (n >= 3)
count++;
else{
count++;
break;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(NULL);
int n;
cin>>n;
if(n<=2) cout<<"0"<<endl;
else
{
cout<<n/3<<endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define TC ll t; cin >> t; while(t--)
typedef long long ll;
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ll k,x;
cin >> k >> x;
for(ll i=x-k+1;i<=x+k-1;i++)
{
cout << i << " ";
}
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(),(v).end()
#define FIN ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll mod = 1e9+7;
const ll inf = 1e15;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int main(){FIN
ll a,b;cin>>a>>b;
vll s(3);
s[0] = a+b;
s[1] = a-b;
s[2] = a*b;
cout<<*max_element(ALL(s))<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
int main()
{
double x, y, x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
x = fabs(x2 - x1);
y = fabs(y2 - y1);
if( x == 0 ) {
cout << fixed << setprecision(5) << y << "\n";
return 0;
} else if( y == 0 ) {
cout << fixed << setprecision(5) << x << "\n";
return 0;
}
int c = 0;
double v = x*x + y*y,
d = max(x, y),
eps = 0.00001;
do
{
d = (d + v / d ) / 2.0L;
++c;
}
while( c < 5 );
cout << fixed << setprecision(5) << d << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
int main() {
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << setprecision(12) << fixed << hypot(abs(x1 - x2), abs(y1 - y2)) << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int l = S.length();
if (l == 1) {
cout << "No" << endl;
return 0;
}
if (l % 2 == 1) {
cout << "No" << endl;
return 0;
}
string expected = "";
while (l > 0) {
expected += "hi";
l -= 2;
}
if (S == expected) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
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 <cstdlib>
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 endregion
int main()
{
int n; cin >> n;
cout << 0 << endl;
string z; cin >> z;
if (z == "Vacant")return 0;
int ok = 0, ng = n;
while (true)
{
int mid = abs(ok + ng) / 2;
cout << mid << endl;
string s; cin >> s;
if (s == "Vacant")return 0;
else if ((mid % 2 == 0 && s == z) || (mid % 2 == 1 && s != z))
{
ok = mid;
}
else ng = mid;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FPEN freopen("in.txt", "r", stdin);
#define debug(...) \
{ cerr << "# " << __VA_ARGS__ << "\n"; }
#else
#define debug(...)
#define FPEN
#endif
const int maxn = 200009;
typedef long long i64;
typedef pair<i64, i64> pi64;
typedef pair<int, int> pi;
typedef unsigned long long ui64;
const i64 MOD = 119 << 23 | 1;
struct hashing {
static constexpr int dimensions = 4;
static constexpr int mod = (1u << 31) - 1;
vector<vector<int>> hashes, p;
static const vector<int> &get_bases() {
static mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
static vector<int> bases;
while (bases.size() < dimensions) {
bases.emplace_back(uniform_int_distribution<int>((int)1e9, mod - 1)(rng));
}
return bases;
}
hashing(const vector<int> &s) : hashes(dimensions), p(dimensions) {
int n = s.size();
const vector<int> &bases = get_bases();
for (int d = 0; d < dimensions; ++d) {
hashes[d].resize(n + 1);
p[d].resize(n + 1);
p[d][0] = 1;
long long base = bases[d];
for (int i = 0; i < n; i++) {
hashes[d][i + 1] = (hashes[d][i] * base + s[i]) % mod;
p[d][i + 1] = p[d][i] * base % mod;
}
}
}
vector<int> get_hash(int i, int len) {
vector<int> res;
for (int d = 0; d < dimensions; ++d) {
int hash = (int)((hashes[d][i + len] + (long long)hashes[d][i] * (mod - p[d][len])) % mod);
res.emplace_back(hash);
}
return res;
}
};
class {
public:
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n), sa(n), sb(n);
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) cin >> b[i];
for (int i = 0; i < n; ++i) {
sa[i] = a[i] ^ a[(i + 1) % n];
sb[i] = b[i] ^ b[(i + 1) % n];
sa.push_back(sa[i]);
}
hashing A(sa), B(sb);
for (int i = 0; i < n; ++i) {
if (A.get_hash(i, n - 1) != B.get_hash(0, n - 1))
continue;
int v = a[i] ^ b[0];
cout << i << ' ' << v << '\n';
}
}
} NSPACE;
int main() {
FPEN;
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
NSPACE.solve();
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i,a,b) for(ll int i=a;i<b;i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define lower(u) transform(u.begin(), u.end(), u.begin(), ::tolower);//convert string u to lowercase;
#define upper(u) transform(u.begin(), u.end(), u.begin(), ::toupper);
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define N 100005
vi LPS(vi pat)
{
vi lps(sz(pat));
lps[0]=0;
ll len=0;
ll i=1;
while(i<sz(pat))
{
if(pat[i]==pat[len])
{
len++;
lps[i]=len;
i++;
}
else
{
if(len)
len=lps[len-1];
else
lps[i]=0,i++;
}
}
return lps;
}
vi KMP(vi pat,vi txt)
{
vi lps=LPS(pat);
vi ans;
ll i=0,j=0;
while(i<sz(txt))
{
if(pat[j]==txt[i]) i++,j++;
if(j==sz(pat))
{
ans.pb(i-j+1);
j=lps[j-1];
}
else if(i<sz(txt)&&txt[i]!=pat[j])
{
if(j)
j=lps[j-1];
else
i++;
}
}
return ans;
}
void solve()
{
ll n,x;
cin>>n;
vi a;
vi b;
rep(i,0,n)
{
cin>>x;
a.pb(x);
}
rep(i,0,n)
{
cin>>x;
b.pb(x);
}
vi A,B;
rep(i,0,n)
{
A.pb(a[i]^(a[(i+1)%n]));
B.pb(b[i]^(b[(i+1)%n]));
}
rep(i,0,n-1)
{
A.pb(A[i]);
}
// cout<<KMP(B,A)<<endl;
vi ans=KMP(B,A);
for(auto u:ans)
{
cout<<u-1<<" "<<(a[u-1]^b[0])<<endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int TESTS=1;
// cin>>TESTS;
while(TESTS--)
{
solve();
}
return 0;
} | 1 |
#include<iostream>
#include<queue>
#include<cstring>
typedef std::pair<int, int> P;
int w, h;
int field[100][100];
int xs, ys, xg, yg;
int n;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { -1, 0, 1, 0 };
int main()
{
while( std::cin >> w >> h, w | h )
{
memset( field, 0, sizeof( field ) );
std::cin >> xs >> ys >> xg >> yg >> n;
for( int i = 0; i != n; ++i )
{
int c, d, x, y;
std::cin >> c >> d >> x >> y;
for( int j = 0; j != 8; ++j )
{
int nx = x + ( d ? j % 2 : j / 2 ),
ny = y + ( d ? j / 2 : j % 2 );
field[ny-1][nx-1] = c;
}
}
std::queue<P> que;
int col = field[ys-1][xs-1];
bool ans = false;
que.push( P( xs, ys ) );
while( !que.empty() )
{
P p = que.front(); que.pop();
if( p.first == xg && p.second == yg )
{
ans = true;
break;
}
field[p.second-1][p.first-1] = 0;
for( int i = 0; i != 4; ++i )
{
int nx = p.first + dx[i],
ny = p.second + dy[i];
if( nx > 0 && nx <= w && ny > 0 && ny <= h && field[ny-1][nx-1] && field[ny-1][nx-1] == col )
que.push( P( nx, ny ) );
}
}
std::cout << ( ans ? "OK" : "NG" ) << std::endl;
}
return 0;
} | #include<stdio.h>
int main(void)
{
int n,pm[10001],pe[10001],pj[10001],i,x[10001],y[10001];
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=0;i<n;i++){
scanf("%d %d %d",&pm[i],&pe[i],&pj[i]);
x[i]=(pm[i]+pe[i])/2;
y[i]=(pm[i]+pe[i]+pj[i])/3;
}
for(i=0;i<n;i++){
if(pm[i]==100||pe[i]==100||pj[i]==100) printf("A\n");
else if(x[i]>=90||y[i]>=80) printf("A\n");
else if(y[i]>=70||y[i]>=50&&pm[i]>=80||pe[i]>=80) printf("B\n");
else printf("C\n");
}
}
return 0;
} | 0 |
/* C++ */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<endl; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
/* isPrime[1]=false; */
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
/*bool cmp(pint a, pint b) { return a.second < b.second; }*/
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n,m;
cin>>n>>m;
vector<ll> v(n);
rep(i,n) cin>>v[i];
vector<ll> sum(n,0);
sum[0]=v[0];
rep(i,n-1) sum[i+1]=sum[i]+v[i+1];
rep(i,n) sum[i]%=m;
ll ans=0;
map<ll,ll> mp;
rep(i,n) mp[sum[i]]++;
for(auto c:mp){
if(c.first==0) ans+=c.second*(c.second+1)/2;
else ans+=c.second*(c.second-1)/2;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) (int)a.size()
#define fi first
#define se second
#define ar array
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int > pii;
const ll MOD =1e9+7;
void solve(){
int n,k,ans=1e9+10; cin >> n >> k;
vi a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < n-k+1; ++i){
if(a[i] > 0)
ans = min(ans,a[i+k-1]);
else if(a[i+k-1]<0)
ans = min(ans,-a[i]);
else
ans =min(ans,-a[i]+a[i+k-1]+min(-a[i],a[i+k-1]));
}
cout << ans;
}
int main(){
int t=1;
//cin >> t;
while(t--){
solve();
cout <<'\n';
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main(void){
int N,Y;
int c1,c2,c3;
c1 = -1;
c2 = -1;
c3 = -1;
cin >> N >> Y;
for(int a = 0;a <= N;a++){
for(int b = 0;b <= N-a;b++){
int c = N-a-b;
int total = 10000*a+5000*b+1000*c;
if(total == Y){
c1 = a;
c2 = b;
c3 = c;
}
}
}
cout << c1 << " " << c2 << " " << c3 <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
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;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
for (ll num = a; num <= b; num++) {
bool yes = true;
string s;
ll ins = num;
while (ins) {
s.push_back('0' + ins % 10);
ins /= 10;
}
rep(i, (s.size() - 1) / 2 + 1) {
if (s[i] != s[s.size() - 1 - i]) yes = false;
}
if (yes) ans++;
}
cout << ans << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9 * 2;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int count = 1;
int out = 0;
rep(i, n - 1){
if(a[i] == a[i + 1]) count++;
else{
if(count % 2 == 1) out++;
count = 1;
}
}
if(count % 2 == 1) out++;
cout << out << endl;
}
| #include<bits/stdc++.h>
using namespace std;
const int maxn=5e5;
const int mod=1e9+7;
int a[maxn+5],num[maxn+5],dp[maxn+5];
int x[1<<20],y[1<<20];
int n;
void update(int &x,int y)
{
x=(x+y)%mod;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]),a[i]^=a[i-1],num[i]=num[i-1]+(a[i]==0);
for(int i=1;i<=n;++i) dp[i]=1;
for(int i=1;i<=n;++i)
{
update(dp[i],(1LL*x[a[i]]*num[i]-y[a[i]])%mod);
update(x[a[i]],dp[i]);
update(y[a[i]],1LL*dp[i]*num[i]%mod);
}
if(dp[n]<0) dp[n]+=mod;
if(a[n]>0) cout<<dp[n];
else
{
int ans=1;
for(int i=1;i<=num[n-1];++i) ans=ans*2%mod;
for(int i=1;i<=n;++i)
if(a[i]>0) update(ans,dp[i]);
if(ans<0) ans+=mod;
cout<<ans<<endl;
}
return 0;
} | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 1000000007
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
Int n, d;
Int a[216000];
Int sums[216000];
Int difs[216000];
Int res;
int main(){
cin >> n >> d;
for(int i = 0;i < n;i++){
cin >> a[i];
sums[i] = a[i] + i * d;
difs[i] = a[i] - i * d;
res += 2 * a[i];
}
res += (n-1)*d;
res -= a[0] + a[n-1];
for(int i = 1;i < n;i++)difs[i] = min(difs[i], difs[i-1]);
for(int i = n-2;i >= 0;i--)sums[i] = min(sums[i], sums[i+1]);
for(int i = 1;i < n-1;i++){
// cout << difs[i] << " " << sums[i] << endl;
Int ltmp = -a[i] + i*d + difs[i];
Int rtmp = -a[i] - i*d + sums[i];
// cout << ltmp << " " << rtmp << endl;
res += min(ltmp, rtmp);
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,i,j,mx,t,x,ans,f[19][19],a[19],b[19];
char s[101];
int main(){
scanf("%lld",&n);
scanf("%s",s+1);
mx=1ll<<n;mx--;
for(t=0;t<=mx;t++){
a[0]=b[0]=0;
for(i=n*2;i>n;i--){
x=n*2-i;
if(t&(1ll<<x))a[++a[0]]=s[i]-'a';
else b[++b[0]]=s[i]-'a';
}
memset(f,0,sizeof(f));
f[0][0]=1;
for(i=1;i<=n;i++){
for(j=0;j<=min(a[0],i-1);j++){
if(i-1-j>b[0])continue;
if(j<a[0]&&s[i]-'a'==a[j+1])f[i][j+1]+=f[i-1][j];
if(i-j<=b[0]&&s[i]-'a'==b[i-j])f[i][j]+=f[i-1][j];
}
}
ans+=f[n][a[0]];
}
printf("%lld",ans);
} | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int l[200000+5],r[200000+5],n,m,q,ret[200000+5],sz,p,num1[200000+5],num[200000];
int l1[200000+5],r1[200000+5],vec[600000+5],c[600000+5];
void Add( int x) //树状数组加入
{
for(;x<=sz;x+=(x&-x))
c[x]++; //因为这里只需要1，所以我就写出c[x]++了
}
int Sum( int x) //树状数组求和，同上面的sum(x)
{
int s=0; //计数的变量
for(;x>0;x-=(x&-x)) //累计
s+=c[x];
return s; //返回结果
}
bool cmp1(int a,int b){
return r1[a]<r1[b];
}
bool cmp(int a,int b){
return r[a]<r[b];
}
int main()
{
cin>>n>>m>>q;
for(int i=1;i<=m;i++){
cin>>l[i]>>r[i];
vec[p++]=l[i];
vec[p++]=r[i];
num[i]=i;
}
for(int i=1;i<=q;i++){
cin>>l1[i]>>r1[i];
vec[p++]=l1[i];
vec[p++]=r1[i];
num1[i]=i;
}
sort(vec,vec+p);
sz=unique(vec,vec+p)-vec;
for(int i=1;i<=m;i++){
l[i]=lower_bound(vec,vec+sz,l[i])-vec+1;
r[i]=lower_bound(vec,vec+sz,r[i])-vec+1;
}
for(int i=1;i<=q;i++){
l1[i]=lower_bound(vec,vec+sz,l1[i])-vec+1;
r1[i]=lower_bound(vec,vec+sz,r1[i])-vec+1;
}
sort(num1+1,num1+q+1,cmp1);
sort(num+1,num+m+1,cmp);
int j=1;
for(int k=1;k<=q;k++){
int i=num1[k];
while(j<=m&&r[num[j]]<=r1[i]){
Add(l[num[j++]]);
}
ret[i]=j-Sum(l1[i]-1)-1;
}
for(int i=1;i<=q;i++){
cout<<ret[i]<<endl;
}
} | #include <stdio.h>
#include <string.h>
int main(){
char str[1000],ord[10],work[1000];
int q,a,b,i,k;
scanf("%s%d",str,&q);
for(i=0; i<q; ++i){
scanf("%s",ord);
memset( work , '\0' , 1000);
if(strcmp(ord,"replace") == 0){
scanf("%d%d%s",&a,&b,work);
for(k=a; k <= b; ++k)
str[k]=work[k-a];
}else if(strcmp(ord,"reverse") == 0){
scanf("%d%d",&a,&b);
for(k=a; k <= b; ++k)
work[k-a]=str[k];
for(k=a; k <= b; ++k)
str[k]=work[b-k];
}else{
scanf("%d%d",&a,&b);
for(k=a; k <= b; ++k)
work[k-a]=str[k];
printf("%s\n",work);
}
}
return 0;
}
| 0 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
//BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney, tree, chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu, topologicalsort, kyourenketuseibun
#define REP(i,a,b) for(int i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
ll frac[300000];
long long inverse(long long mod, long long val) {
long long x[2] = { mod, val };
long long a[2] = { 1, 0 };
long long i;
for (i = 0; x[!i]; i ^= 1) {
a[!i] -= x[i] / x[!i] * a[i];
x[i] = x[i] % x[!i];
}
if (!i) a[!i] += mod;
return a[!i];
}
ll mod = 998244353;
ll mem[300000];
int main() {
frac[0] = 1;
mem[0] = 1;
ll N, M, K;
cin >> N >> M >> K;
if (M == 1) {
if (K == N - 1) PRI(1);
else PRI(0);
return 0;
}
REP(i, 1, 300000) {
frac[i] = frac[i - 1] * i % mod;
mem[i] = mem[i - 1] * (M - 1) % mod;
}
ll ret = 0;
REP(i, 0, K + 1) {
ll x = M * mem[N - i - 1] % mod;
x *= frac[N - 1];
x %= mod;
x *= inverse(mod,frac[i]);
x %= mod;
x *= inverse(mod,frac[N - 1 - i]);
x %= mod;
ret += x;
ret %= mod;
}
PRI(ret);
return 0;
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ cout << "[" << p.first << ", " << p.second << "]"; return os; }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define Return(expr) { Cout(expr); return 0; }
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)
constexpr int MOD = 998244353;
ll modpow(ll n, ll p){
if(p == 0) return 1;
if(p % 2 == 1) return n * modpow(n, p-1) % MOD;
ll t = modpow(n, p/2);
return t*t % MOD;
}
constexpr int COMB_MAX = 210000;
ll fac[COMB_MAX], finv[COMB_MAX], inv[COMB_MAX];
void initComb(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < COMB_MAX; i ++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll comb(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(void){
Cin(int, n, m, k);
initComb();
ll ans = 0;
For(i, k+1){
ll tmp = m * modpow(m-1, n-i-1) % MOD * comb(n-i-1 + i, i) % MOD;
// Cout(tmp);
ans = (ans + tmp) % MOD;
}
Cout(ans);
}
| 1 |
#include <iostream>
using namespace std;
bool include3(int n){
while(n!=0){
if(n%10==3){
return true;
}
n = n /10;
}
return false;
}
void call(int n){
for(int i = 1; i <= n; i++){
if( i % 3 == 0 || include3(i) ){
cout << " " << i;
}
}
cout << endl;
}
int main()
{
int num;
cin>>num;
call(num);
return 0;
} | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s;
cin >> s;
string ans = "AC";
if(s[0] != 'A'){
ans = "WA";
}
int cnt = 0, m;
for(int i = 2; i <= s.size() - 2; i++){
if(s[i] == 'C') {
cnt++;
m = i;
}
}
if(cnt != 1) ans = "WA";
rep(i,s.size()){
if (i == 0 || i == m) continue;
if(s[i] < 'a' || s[i] > 'z') ans = "WA";
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n;cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
deque<int> d;
int ans = 0;
for(int i = 0;i < n;i++){
int temp = a[i];
int p = lower_bound(d.begin(),d.end(),temp) - d.begin();
if(p == 0) d.push_front(temp);
else d[p-1] = temp;
}
cout << d.size() << endl;
} | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define PI 3.141592653
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int n; cin >> n;
string s; cin >> s;
bool fin;
if(s[0] == 'o'){fin = true;}
else{fin = false;}
bool ans = true;
vector<char> s1(n+1);
s1[0] = 'W'; s1[1] = 'S';
vector<char> s2(n+1);
s2[0] = 'W'; s2[1] = 'W';
vector<char> s3(n+1);
s3[0] = 'S'; s3[1] = 'S';
vector<char> s4(n+1);
s4[0] = 'S'; s4[1] = 'W';
while(true){
bool f;
for(int i = 2; i <= n; i++){
f = true;
if(s1[i-2] == 'W'){f = !f;}
if(s1[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s1[i] = 'S';}
else{s1[i] = 'W';}
}
if(fin){if(s1[n-1] == 'W' && s1[0] == s1[n]) {rep(i, n){cout << s1[i];}ans = false; break;}}
else{if(s1[n-1] == 'S' && s1[0] == s1[n]) {rep(i, n){cout << s1[i];}ans = false; break;}}
for(int i = 2; i <= n; i++){
f = true;
if(s2[i-2] == 'W'){f = !f;}
if(s2[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s2[i] = 'S';}
else{s2[i] = 'W';}
}
if(fin){if(s2[n-1] == 'S' && s2[0] == s2[n] ) {rep(i, n){cout << s2[i];}ans = false; break;}}
else{if(s2[n-1] == 'W' && s2[0] == s2[n]) {rep(i, n){cout << s2[i];}ans = false; break;}}
for(int i = 2; i <= n; i++){
f = true;
if(s3[i-2] == 'W'){f = !f;}
if(s3[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s3[i] = 'S';}
else{s3[i] = 'W';}
}
if(fin){if(s3[n-1] == 'S' && s3[0] == s3[n]) {rep(i, n){cout << s3[i];} ans = false; break;}}
else{if(s3[n-1] == 'W' && s3[0] == s3[n]) {rep(i, n){cout << s3[i];}ans = false; break;}}
for(int i = 2; i <= n; i++){
f = true;
if(s4[i-2] == 'W'){f = !f;}
if(s4[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s4[i] = 'S';}
else{s4[i] = 'W';}
}
if(fin){if(s4[n-1] == 'W' && s4[0] == s4[n]) {rep(i, n){cout << s4[i];} ans = false;break;}}
else{if(s4[n-1] == 'S' && s4[0] == s4[n]) { rep(i, n){cout << s4[i];}ans = false; break;}}
cout << -1;
break;
}
cout << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
string res;
int main()
{
ll a, b;
cin >> a >> b;
println(2*b - a);
}
| /**
* This code has been written by YueGuang, feel free to ask me question. Blog: http://www.yx.telstudy.xyz
* created:
*/
#include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#define REP(i, a, b) for(int i = a; i < b; i++)
#define REP_(i, a, b) for(int i = a; i <= b; i++)
#define sl(n) scanf("%lld", &n);
#define si(n) scanf("%d", &n);
#define RepAll(a) for(auto x: a)
#define cout(ans) cout << ans << endl;
typedef long long ll;
using namespace std;
int main()
{
int a, b;
scanf("%d%d", &a, &b);
cout<<"100 100\n";
REP(i, 0, 100)
{
REP(j, 0, 100)
i < 50 ? cout<< ( i%2 == 1 && j%2 == 1&& (--a) > 0 ? "." : "#" ) : cout << (i%2 == 1 && j%2 == 1&& (--b) > 0 ? "#" : ".");
cout << '\n';
}
}
| 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans,n,m,k,a[200001],d[200001],b[200001],c[200001],nt[200001];
void ksm(){
ll i;
while(k){
if(k&1){
for(i=1;i<=n;i++)nt[i]=b[c[i]];
for(i=1;i<=n;i++)b[i]=nt[i];
}
for(i=1;i<=n;i++)nt[i]=c[c[i]];
for(i=1;i<=n;i++)c[i]=nt[i];
k/=2;
}
}
int main(){
ll i,x;
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld",&a[i]);
d[i]=a[i]-a[i-1];
b[i]=c[i]=i;
}
scanf("%lld%lld",&m,&k);
for(i=1;i<=m;i++){
scanf("%lld",&x);
swap(c[x],c[x+1]);
}
ksm();
for(i=1;i<=n;i++){
ans+=d[b[i]];
printf("%lld.0\n",ans);
}
}
/*
思路：对于兔子x[i]，向左跳有2*x[i-1]-x[i]，向右跳有2*x[i+1]-x[i]，概率各位1/2，
得期望x[i-1]+x[i+1]-x[i]，令d[i] = x[i]-x[i-1]，
这条期望式子相当于swap(d[i], d[i+1])，那么连续执行K次，可参考快速幂的做法进行优化。O(NlogK)。
当然也可以O（n）
心得：没有想到用差分
*/ | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
int GCD(int a,int b){
if(b == 0)return a;
return GCD(b,a%b);
}
int main(void){
int H,W;
cin >> H >> W;
int a[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin >> a[i][j];
}
}
int count = 0;
vector<pair<int,int>> P;
queue<int> que;
for(int i=0;i<H;i++){
if(i % 2 == 0){
for(int j=0;j<W;j++){
P.push_back(make_pair(i,j));
}
}
else{
for(int j=W-1;j>=0;j--){
P.push_back(make_pair(i,j));
}
}
}
for(int i=0;i+1<P.size();i++){
if(a[P[i].first][P[i].second] % 2 == 1){
count ++;
a[P[i+1].first][P[i+1].second]++;
que.push(P[i].first);
que.push(P[i].second);
que.push(P[i+1].first);
que.push(P[i+1].second);
}
}
cout << count << endl;
for(int i=0;i<count;i++){
for(int j=0;j<4;j++){
cout << que.front() + 1;
que.pop();
if(j != 3){
cout << " " ;
}
}
cout << endl;
}
}
| 0 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
const int INF=pow(2,31)-1;
std::vector<P> v(1e6,P(INF,-1));
int N=1;
void update(int a,int b,int c,int d,int k,int l,int r){
if(r<=a||b<=l)return;
if(a<=l&&r<=b)v[k]=P(c,d);
else{
update(a,b,c,d,k*2+1,l,(l+r)/2);
update(a,b,c,d,k*2+2,(l+r)/2,r);
}
}
int ma(int a){
int k=a+N-1;
P res=v[k];
while(k){
k=(k-1)/2;
if(res.second<v[k].second)res=v[k];
}
return res.first;
}
signed main(){
int n,M;
cin>>n>>M;
while(n>N)N*=2;
std::vector<int> ans;
for(int i=0;i<M;i++){
int q;cin>>q;
if(q){
int a;cin>>a;
ans.push_back(ma(a));
}
else{
int s,t,x;cin>>s>>t>>x;
update(s,t+1,x,i,0,0,N);
}
}
for(int p:ans)cout<<p<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
bool upd[(1<<18)];
int val[(1<<18)];
void Set(int a,int b,int x,int k=0,int l=0,int r=(1<<17)){
if(b<=l || r<=a)return;
if( r-l>1 && upd[k] ){
upd[k*2+1] = upd[k*2+2] = 1;
val[k*2+1] = val[k*2+2] = val[k];
}
upd[k]=0;
if(a<=l && r<=b){
upd[k]=1;
val[k]=x;
}
else{
Set(a,b,x,k*2+1,l,(l+r)/2);
Set(a,b,x,k*2+2,(l+r)/2,r);
val[k]=min(val[k*2+1],val[k*2+2]);
}
}
int Find(int a,int b,int k=0,int l=0,int r=(1<<17)){
if(b<=l || r<=a)return INT_MAX;
if( r-l>1 && upd[k] ){
upd[k*2+1] = upd[k*2+2] = 1;
val[k*2+1] = val[k*2+2] = val[k];
}
upd[k]=0;
if(a<=l && r<=b) return val[k];
else{
int L = Find(a,b,k*2+1,l,(l+r)/2);
int R = Find(a,b,k*2+2,(l+r)/2,r);
return min(L,R);
}
}
int n,m,a,b,c,d;
int main(){
memset(upd,0,sizeof(upd));
fill(val,val+(1<<18),INT_MAX);
cin>>n>>m;
while(m--){
cin>>a>>b;
if(a){
cout<<Find(b,b+1)<<endl;
}
else{
cin>>c>>d;
Set(b,c+1,d);
}
}
}
| 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
ll A,B;
cin >> A >> B;
if(A<B){
if(abs(A)==abs(B)){
cout << 1 << endl;
}else if(abs(A)<abs(B)){
if(A>=0){
cout << B-A << endl;
}else{
cout << B+A+1 << endl;
}
}else{
if(B>0){
cout << -A-B+1 << endl;
}else{
cout << B-A << endl;
}
}
}else{
if(abs(A)==abs(B)){
cout << 1 << endl;
}else if(abs(A)<abs(B)){
if(A>=0){
cout << -B-A+1 << endl;
}else{
cout << A-B+2 << endl;
}
}else{
if(B<=0){
cout << B+A+1 << endl;
}else{
cout << A-B+2 << endl;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, Y;
cin >> X >> Y;
int ans =0;
if(X>Y){
if(X*Y>0){
ans += X-Y+2;
}
else ans += max(X, -Y)-min(X, -Y)+1;
}
else{
if(X*Y>=0){
ans += Y-X;
}
else ans += max(-X, Y)-min(-X, Y)+1;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
int dp[45][(1 << 17) + 5];
int main() {
int n, X, Y, Z;
cin >> n >> X >> Y >> Z;
int ban = (1 << Z - 1) | (1 << Y + Z - 1) | (1 << X + Y + Z - 1);
dp[0][0] = 1;
for(int i = 0; i < n; ++i) {
for(int j = 1; j < 11; ++j) {
for(int S = 0; S < 1 << 17; ++S) {
int nxt = (S << j | 1 << j - 1) & ((1 << 17) - 1);
if((nxt & ban) != ban) {
dp[i + 1][nxt] = (dp[i + 1][nxt] + dp[i][S]) % P;
}
}
}
}
int ans = 1;
for(int i = 0; i < n; ++i) {
ans = 1LL * ans * 10 % P;
}
for(int S = 0; S < 1 << 17; ++S) {
ans = (ans - dp[n][S] + P) % P;
}
cout << ans << '\n';
return 0;
} | #include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<string>
#include<bitset>
#include<memory>
using namespace std;
using ll=long long;
const int SIZE=17;
const ll MOD=1e9+7;
void add(ll &lhs,ll rhs){
lhs=(lhs+rhs)%MOD;
}
int main(){
int n;
cin>>n;
int xyz[3];
for(int i=0;i<3;i++) cin>>xyz[i];
vector<vector<ll>> dp(n+1,vector<ll>(1<<SIZE));
dp[0][(1<<SIZE)-1]=1;
vector<int> isAccept(1<<SIZE);
for(int bit=0;bit<(1<<SIZE);bit++){
int st=0;
int buf=0;
for(int i=0;i<SIZE;i++){
buf++;
if(!((bit>>i)&1) && xyz[st]==buf){
st++;
buf=0;
if(st==3){
isAccept[bit]=true;
break;
}
}
}
}
vector<ll> pow10(n);
pow10[0]=1;
for(int i=0;i+1<n;i++) pow10[i+1]=pow10[i]*10%MOD;
ll res=0;
int mask=(1<<SIZE)-1;
for(int i=0;i<n;i++){
for(int bit=0;bit<(1<<SIZE);bit++){
if(dp[i][bit]==0) continue;
for(int v=1;v<=7;v++){
int nex=(bit<<v)+(1<<(v-1))-1;
nex&=mask;
add(dp[i+1][nex],dp[i][bit]);
}
add(dp[i+1][mask],3*dp[i][bit]);
}
for(int bit=0;bit<(1<<SIZE);bit++){
if(isAccept[bit]){
ll r=pow10[n-1-i];
res+=r*dp[i+1][bit];
res%=MOD;
dp[i+1][bit]=0;
}
}
}
cout<<res<<endl;
return 0;
}
| 1 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
if(n==0) {
cout << 0;
return 0;
}
vector<vector<ll>> a(33,vector<ll> (2));
a[0][0] = 1;
a[0][1] = 0;
ll m = 1;
for(int i=1;i<33;i++){
m*=-2;
if(m>0){
a[i][0] = a[i-1][0] + m;
a[i][1] = a[i-1][1];
}else{
a[i][1] = a[i-1][1] + m;
a[i][0] = a[i-1][0];
}
}
ll tmp = n;
vector<int> ans(33,0);
for(int i=32;i>0;i--){
if(tmp>0){
if(a[i][0]>=tmp&&tmp>a[i-1][0]){
ans[i] = 1;
tmp = tmp - m;
}else{
ans[i] = 0;
}
}else{
if(a[i][1]<=tmp&&tmp<a[i-1][1]){
ans[i] = 1;
tmp = tmp - m;
}else{
ans[i] = 0;
}
}
m /= (-2);
}
if(tmp == 1){
ans[0] = 1;
}else{
ans[0] = 0;
}
bool flag = false;
for(int i=32; i >= 0; i--){
if(!flag){
if(ans[i]==1){
cout << ans[i];
flag = true;
}
}else{
cout << ans[i];
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)
using namespace std;
string repeat(string s, int n) {
string s1 = "";
for (int i=0; i<n;i++)
s1+=s;
return s1;
}
string getString(char x) {
string s(1, x);
return s;
}
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int gcd(int a, int b){
if (a == 0) return b;
return gcd(b % a, a);
}
void solve(){
ll n;
cin>>n;
if(n==0){
cout<<0<<endl;
return;
}
string ans="";
ll x=0;
ll num=2;
while(n!=0){
// cout<<n<<endl;
if(abs(n)%num!=0){
if(x%2==0) n-= num/2;
else n+= num/2;
ans+="1";
}
else ans+="0";
num*=2;
x++;
}
reverse(all(ans));
cout<<ans<<endl;
}
int main(){
optimizeIO();
// tc
{ solve();
}
}
| 1 |
Subsets and Splits