code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int b[10],k[10],i,v1,v2;
double h;
while (scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&b[0],&b[1],&b[2],&b[3],&b[4],&b[5],&b[6],&b[7],&b[8],&b[9],&v1,&v2)!=EOF) {
k[0]=b[0];
for (i=1;i<10;i++) k[i]=k[i-1]+b[i];
h=(double)k[9]*v1/(v1+v2);
for (i=0;i<10;i++) if (h>=k[i]-b[i] && h<=k[i]) break;
cout << i+1 << endl;
}
return 0;
} | // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#define mnlld -LLONG_MAX
#define mxd 2e8
#define mnd -2e8
#define pi 3.14159265359
using namespace std;
bool check(ll n, ll pos)
{
return n & (1LL << pos);
}
ll Set(ll n, ll pos)
{
return n = n | (1LL << pos);
}
int main()
{
ll i, j, k, l, m, n, o, r, q;
ll testcase;
ll input, flag, tag, ans;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
double rad;
while(cin >> rad)
{
cout << setprecision(10) << fixed << 2.0 * acos(-1.0) * rad << "\n";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n ;
cin >> n ;
string s , t ;
cin >> s >> t ;
deque<char> S , T ;
rep(i,n){
S.push_back(s.at(i)) ;
T.push_back(t.at(i));
}
if(s == t ) {
cout << s.size() <<endl ;
return 0 ;
}
int ans = 2 * n ;
rep(i,n){
S.pop_front();
T.pop_back();
if( S == T){
ans = S.size() + 2*(i+1) ;
cout << ans <<endl ;
return 0 ;
}
}
}
| #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define debug(v) cout << #v<< ": " << v <<endl;
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL<<60;
ll M = 1000000007;
int main(){
ll k, t; cin >> k >> t;
vll a(t);
Map m;
ll mx = 0; ll s = 0;
rep(i, 0, t){
cin >> a[i];
m[i] = a[i];
s += a[i]; mx = max(mx, a[i]);
}
ll g = s - mx;
if(mx < g){
prtl(0);
}else{
prtl(mx - g - 1);
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main(){
FastIO;
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
rep(i,n){
cin >> a[i];
a[i]*=-1;
}
rep(i,n) cin >> b[i];
rep(i,n) cin >> c[i];
sort(all(a));
sort(all(b));
sort(all(c));
ll ans = 0;
for(int i = 0; i < n; i++){
int bi = b[i];
auto itrA = upper_bound(all(a), -bi);
if (itrA == a.end()) continue;
size_t posA = distance(a.begin(), itrA);
auto itrC = upper_bound(all(c), bi);
if (itrC == c.end()) continue;
size_t posC = distance(c.begin(), itrC);
ll cntA = n-posA;
ll cntC = n-posC;
ans += cntA * cntC;
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<string>
#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++)
#define ll long long
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
int n; cin >>n;
vector<ll> a(n);
rep(i,n) cin >>a[i];
map<ll,ll> mp;
rep(i,n) mp[a[i]]++;
ll ans=0;
for(auto x :mp){
if(x.second%2==1) ans++;
}
cout <<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 100000000;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
int count = 0;
if (x % 2 != 0)
ans = 0;
while (x % 2 == 0) {
x /= 2;
count++;
}
ans = min (ans,count);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll color1 = 0;
ll color2 = 0;
ll color3 = 0;
ll count = 1;
rep(i,N){
if (color1 == A[i] && color2 == A[i] && color3 == A[i]){
color1++;
count = (count * 3) % 1000000007;
}
else if (color1 == A[i] && color2 == A[i]){
color1++;
count = (count * 2) % 1000000007;
}
else if (color2 == A[i] && color3 == A[i]){
color2++;
count = (count * 2) % 1000000007;
}
else if (color1 == A[i]) color1++;
else if (color2 == A[i]) color2++;
else if (color3 == A[i]) color3++;
else{
count = 0;
}
}
cout << count << endl;
}
| 0 |
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
const long long MAXN = 1e6 + 1;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long readInt() {
bool minus1 = false;
long long result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-') minus1 = true; else result = ch-'0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result*10 + (ch - '0');
}
if (minus1)
return -result;
else
return result;
}
#define int __int64_t
int a[MAXN];
int prem[MAXN];
int n;
vector <int> mult(const vector <int>& a, const vector <int>& b) {
vector <int> c(a.size());
for (int i = 0; i < a.size(); i++) {
c[i] = a[b[i]];
}
return c;
}
vector <int> binpow(vector <int>& a, int K) {
int sz = a.size();
vector <int> ans(sz);
for (int i = 0; i < sz; i++) ans[i] = i;
while(K) {
if (K & 1) {
ans = mult(ans, a);
}
a = mult(a, a);
K >>= 1;
}
return ans;
}
main() {
#ifdef IZI_KATKA
assert(freopen("input", "r", stdin));
assert(freopen("output", "w", stdout));
#endif
n = readInt();
vector <int> d(n - 1);
vector <int> perm(n - 1);
for (int i = 0; i < n; i++) {
a[i] = readInt();
}
for (int i = 0; i < n - 1; i++) {
d[i] = a[i + 1] - a[i];
perm[i] = i;
}
int M = readInt(), K = readInt();
for (int i = 1; i <= M; i++) {
int x = readInt() - 1;
swap(perm[x - 1], perm[x]);
}
vector <int> kekekek = binpow(perm, K);
int cur = a[0];
for (int i = 0; i < n - 1; i++) {
cout << cur << endl;
cur += d[kekekek[i]];
}
cout << cur;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
ll x[100010];
int a[100010], nsw[100010], now[100010], vid[100010], vnum[100010], repl[100010];
bool looked[100010]={};
vector<vector<int>> v;
int main() {
int N;
cin >> N;
for(int i=0; i<N; ++i) cin >> x[i];
int M;
ll K;
cin >> M >> K;
for(int i=0; i<M; ++i) cin >> a[i];
for(int i=1; i<N; ++i) nsw[i]=i;
for(int i=0; i<M; ++i) swap(nsw[a[i]-1], nsw[a[i]]);
for(int i=1; i<N; ++i) now[nsw[i]]=i;
int cnt=0;
for(int i=1; i<N; ++i){
if(!looked[i]){
int b=i;
v.emplace_back();
do{
vnum[b]=v[cnt].size();
v[cnt].emplace_back(b);
vid[b]=cnt;
looked[b]=1;
b=now[b];
}while(b!=i);
++cnt;
}
}
for(int i=1; i<N; ++i){
ll sz=v[vid[i]].size();
ll r=(K%sz+vnum[i])%sz;
repl[v[vid[i]][r]]=i;
}
cout << x[0] << endl;
ll ans=x[0];
for(int i=1; i<N; ++i){
ans += x[repl[i]]-x[repl[i]-1];
cout << ans << endl;
}
return 0;
} | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
void Trace( int *A, int N, int cnt){
//?????????????????????????????????N-1??¨??????
for (int i = 0; i < N - 1; i++){
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
printf("%d\n", cnt);
}
int BubbleSort(int *A, int N){
int cnt = 0;
for (int i = N-1; i > 0; i--){
for (int j = N-1; j >= 0; j--){
//??\???????????????
if (A[j - 1] > A[j]){
int t = A[j - 1];
A[j - 1] = A[j];
A[j] = t;
cnt++;
}
}
}
return cnt;
}
int main(int argc, char *argv[]){
int N;
scanf("%d", &N);
int *A = (int*)malloc(sizeof(int) * N);
//??\???
for (int i = 0; i < N; i++){
scanf("%d", &A[i]);
}
int cnt = BubbleSort(A, N);
Trace(A, N, cnt);
free(A);
return 0;
} | #include <iostream>
#include <string>
#include <stdio.h>
#define N 1000
using namespace std;
int main()
{
int n;
int s;
string str;
cin >> n;
cin.ignore();
for(int i = 0; i < n; i++)
{
getline(cin,str);
for(s = 0; s < N; s++){
if(str[s] == 'H' && str[s+1] =='o' && str[s+2] == 's' && str[s+3] == 'h'
&& str[s+4] == 'i' && str[s+5] == 'n' && str[s+6] == 'o' ){
str[s] = 'H';
str[s+1] = 'o';
str[s+2] = 's';
str[s+3] = 'h';
str[s+4] = 'i';
str[s+5] = 'n';
str[s+6] = 'a';
}
}
cout << str << endl;
}
} | 0 |
#include <iostream>
using namespace std;
char solve(int m,int e,int j){
if( m == 100 || e == 100 || j == 100 )
return 'A';
if( (m+e)>=180 || (m+e+j)>=240)
return 'A';
if( (m+e+j)>=210 || ( (m+e+j)>=150 && (m>=80||e>=80) ) )
return 'B';
return 'C';
}
int main(){
int n,m,e,j;
while( cin >> n , n ){
for(int i=0 ; i<n ; ++i ){
cin >> m >> e >> j;
cout << solve(m,e,j) << endl;
}
}
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#define MAXN 10010
using namespace std;
struct Edge
{
int point1;
int point2;
int weight;
};
bool cmp(Edge &x, Edge &y)
{
return x.weight < y.weight;
}
int pre[MAXN];
vector <Edge> vec;
int find(int x)
{//并查集
int root = x;
while (pre[root] != root)
root = pre[root];//找根
int t = x;
while (pre[t] != root)
{//路径压缩
int temp = pre[t];
pre[t] = root;
t = temp;
}
return root;
}
int main()
{
int n, m;
int min_sum = 0;
scanf("%d%d", &n, &m);//n是点数，m是边数
for (int i = 0; i < n; i++)
pre[i] = i;//初始化并查集
for (int i = 0; i < m; i++)
{//输入每条边的两个顶点及其权重
Edge temp;
scanf("%d%d%d", &temp.point1, &temp.point2, &temp.weight);
vec.push_back(temp);
}
sort(vec.begin(), vec.end(), cmp);//按权重对边进行排序
int coun = 0;
for (int i = 0; i < m; i++)
{//最多只有m条边
int fx = find(vec[i].point1);
int fy = find(vec[i].point2);
if (fx != fy)
{//如果这条边的两个顶点所在集合不相同就合并
coun++;//成功合并后就多了一条边
min_sum += vec[i].weight;
pre[fx] = fy;//合并
if (coun == n - 1)
break;//krusal有n-1条边
}
}
printf("%d\n", min_sum);
return 0;
}
| 0 |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
int tab[30][30];
int dx[] = {1,-1,0,0};
int dy[] = {0,0,-1,1};
int W, H;
int Gx, Gy;
bool out(int x, int y){
return !(0 <= x && x < W && 0 <= y && y < H);
}
int dfs(int x, int y, int d){
if(d > 10) return d;
int res = 11;
REP(i,4){
int tx = x+dx[i], ty = y+dy[i];
if(out(tx,ty) || tab[ty][tx] != 0)
continue;
while(!out(tx,ty) && tab[ty][tx] == 0){
if(tx == Gx && ty == Gy)
return d+1;
tx += dx[i], ty += dy[i];
}
if(out(tx,ty)) continue;
tab[ty][tx] = 0;
res = min(res, dfs(tx-dx[i], ty-dy[i], d+1));
tab[ty][tx] = 1;
}
return res;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
while(cin>>W>>H,W){
fill((int*)tab,(int*)tab+30*30,0);
int sx, sy;
REP(y,H) REP(x,W){
cin >> tab[y][x];
if(tab[y][x] == 2)
sx = x, sy = y, tab[y][x] = 0;
if(tab[y][x] == 3)
Gx = x, Gy = y, tab[y][x] = 0;
}
int ans = dfs(sx, sy, 0);
if(ans > 10) cout << -1 << endl;
else cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
typedef vector <VI> VVI;
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
int w, h;
int sx, sy, gx, gy;
VVI M;
int answer;
//==================================================
// Tõ
//==================================================
void dfs( int x, int y, int a, int d )
{
if ( d > 10 ) return;
if ( M[y][x] == 3 )
{
if ( answer == -1 )
answer = d;
else
answer = min( answer, d );
}
if ( a > 0 )
{
int nx = x + dx[a];
int ny = y + dy[a];
if ( nx < 0 || nx >= w || ny < 0 || ny >= h )
return;
if ( M[ny][nx] == 1 )
{
M[ny][nx] = 0;
dfs( x, y, 0, d );
M[ny][nx] = 1;
}
else
dfs( nx, ny, a, d );
}
else
{
for ( int i = 1; i < 5; i++ )
{
int nx = x + dx[i];
int ny = y + dy[i];
if ( nx < 0 || nx >= w || ny < 0 || ny >= h )
continue;
if ( M[ny][nx] == 0 || M[ny][nx] == 3 )
{
dfs( nx, ny, i, d+1 );
}
}
}
}
int main( void )
{
while ( cin >> w >> h && w && h )
{
//==================================================
// Ï
//==================================================
M = VVI( h, VI( w, 0 ) );
answer = -1;
//==================================================
// }bvÌüÍ
//==================================================
for ( int i = 0; i < h; i++ )
{
for ( int j = 0; j < w; j++ )
{
int& s = M[i][j];
cin >> s;
// X^[gES[
if ( s == 2 )
{
sx = j;
sy = i;
s = 0;
}
else if ( s == 3 )
{
gx = j;
gy = i;
}
}
}
//==================================================
//
//==================================================
dfs( sx, sy, 0, 0 );
//==================================================
// oÍ
//==================================================
cout << answer << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s,t;
cin>>n>>s>>t;
ans=n;
for(int i=0;i<n;i++){
if(s.substr(i)==t.substr(0,n-i))break;
ans++;
}
cout<<ans<<endl;
}
| #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
int N;
cin>>N;
string S, T;
cin>>S>>T;
int num = 0;
bool can;
for(int i=0;i<N;++i) {
can = true;
for(int j=0;j<N-i;++j) {
if(S[i+j]!=T[j]) can = false;
}
if(can) {
num = N-i;
break;
}
}
cout<<2*N-num<<endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
int max_a = *max_element(a.begin(), a.end());
int g = a[0];
rep(i, n) g = gcd(g, a[i]);
// cerr << g << " " << max_a << endl;
if (k % g == 0 && k <= max_a) {
cout << "POSSIBLE" << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
}
| #include <iostream>
#include <algorithm>
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 1e5 + 9, maxn = 2e2 + 9;
long long dp[maxn][inf], s[inf];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = 0; i < inf; i++) {
dp[0][i] = i % s[0];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j <= x; j++) {
dp[i][j] += dp[i - 1][j % s[i]] * 1LL + dp[i - 1][j] * i * 1LL;
dp[i][j] %= mod * 1LL;
}
}
cout << dp[n - 1][x] << '\n';
return 0;
}
| 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
int main(){
int n; cin >> n; ll a[n];
rep(i, n){
cin >> a[i];
}
if(a[0]!=0){
cout << -1 << endl; return 0;
}
rep(i, n-1){
if(a[i+1]>a[i]+1){
cout << -1 << endl; return 0;
}
}
ll ans = 0;
for(int i=1; i<n; i++){
if(a[i]==a[i-1]+1) ans++;
else ans+=a[i];
}
cout << ans << endl;
} | #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, vector<ll>> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
rep(ti,t){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
string s;
cin >> s;
if(s.back() == 1){
cout << 1 << endl;
continue;
}
vector<P> v;
v.push_back(P(0, {}));
for(int i = n-1; i >= 0; --i){
if(v.back().first == (s[i] - '0')){
v.back().second.push_back(a[i]);
}
else{
int nex = 1 - v.back().first;
v.push_back(P(nex, {a[i]}));
}
}
for(auto &p : v){
sort(p.second.begin(), p.second.end());
}
int sz = v.size();
vector<ll> buf;
bool f = true;
rep(i,sz){
if(v[i].first == 0){
for(ll x : v[i].second) buf.push_back(x);
}
else{
auto memo = buf;
int sz2 = memo.size();
int rank = 0;
for(int j = 59; j >= 0; --j){
int pivot = -1;
for(int k = rank; k < sz2; ++k){
if(memo[k] >> j & 1){
pivot = k;
break;
}
}
if(pivot == -1) continue;
swap(memo[pivot], memo[rank]);
for(int k = 0; k < sz2; ++k){
if(k != rank && (memo[k] >> j & 1)) memo[k] ^= memo[rank];
}
for(ll &x : v[i].second){
if(x >> j & 1) x ^= memo[rank];
}
++rank;
}
for(ll x : v[i].second){
if(x != 0){
f = false;
break;
}
}
if(!f) break;
}
}
cout << !f << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0; }
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0; }
using namespace std;
using vi=vector<int>;
vector<int> m(8, -1);
vector<int> ans(8, -1);
bool valid() {
bool board[8][8] = {0};
rep(i, 8) {
if(m[i] == -1) continue;
board[i][m[i]] = true;
}
const int dr[4] = {1, 1, 0, -1};
const int dc[4] = {0, 1, 1, 1};
rep(i, 8) {
if(m[i] == -1) continue;
rep(j, 4) {
int q_r = i+dr[j], q_c = m[i]+dc[j];
while(0<=q_r && q_r<8
&&0<=q_c && q_c<8) {
if(board[q_r][q_c]) return false;
q_r += dr[j], q_c += dc[j];
}
}
}
return true;
}
void dfs(int r) {
if(r == 8) {
ans = m;
return;
}
if(m[r] != -1) {
dfs(r+1);
return;
}
rep(i, 8) {
m[r] = i;
if(valid()) dfs(r+1);
m[r] = -1;
}
}
int main(void){
int k; cin >> k;
rep(i, k) {
int r, c; cin >> r >> c;
m[r] = c;
}
dfs(0);
// rep(i, 8) {
// cerr << ans[i] << " ";
// }
char board[8][8] = {0};
rep(i, 8) rep(j, 8) board[i][j] = '.';
rep(i, 8) {
board[i][ans[i]] = 'Q';
}
rep(i, 8) {
rep(j, 8) {
cout << board[i][j];
}
cout << endl;
}
return 0;
} | #include <iostream>
#include <vector>
//---------------------------------------------------------------------------
enum TSquareState
{
ssPlaceable,
ssAttacked,
ssQueen
};
typedef std::vector<std::vector<TSquareState> > TBoard;
//---------------------------------------------------------------------------
TBoard PutQueen(const TBoard& PreBoard, int Row, int Col)
{
TBoard Board = PreBoard;
for(int i = 0; i < 8; ++i){
Board[Row][i] = ssAttacked;
}
for(int i = 0; i < 8; ++i){
Board[i][Col] = ssAttacked;
}
for(int i = Row, j = Col; i < 8 && j < 8; ++i, ++j){
Board[i][j] = ssAttacked;
}
for(int i = Row, j = Col; i >= 0 && j >= 0; --i, --j){
Board[i][j] = ssAttacked;
}
for(int i = Row, j = Col; i < 8 && j >= 0; ++i, --j){
Board[i][j] = ssAttacked;
}
for(int i = Row, j = Col; i >= 0 && j < 8; --i, ++j){
Board[i][j] = ssAttacked;
}
Board[Row][Col] = ssQueen;
return Board;
}
//---------------------------------------------------------------------------
bool PutQueens(TBoard& Board, int QueenCount)
{
if(QueenCount == 0) return true;
for(int i = 0; i < 8; ++i){
for(int j = 0; j < 8; ++j){
TBoard TempBoard = PutQueen(Board, i, j);
if(Board[i][j] == ssPlaceable && PutQueens(TempBoard, QueenCount - 1)){
Board = TempBoard;
return true;
}
}
}
return false;
}
//---------------------------------------------------------------------------
void OutputEightQueens(const TBoard& Board, std::ostream& Stream)
{
for(int i = 0; i < 8; ++i){
for(int j = 0; j < 8; ++j){
char Square = Board[i][j] == ssQueen ? 'Q' : '.';
Stream << Square;
}
Stream << std::endl;
}
}
//---------------------------------------------------------------------------
int main()
{
int Count;
std::cin >> Count;
TBoard Board(8, std::vector<TSquareState>(8, ssPlaceable));
for(int i = 0; i < Count; ++i){
int Row, Col;
std::cin >> Row >> Col;
Board = PutQueen(Board, Row, Col);
}
PutQueens(Board, 8 - Count);
OutputEightQueens(Board, std::cout);
return 0;
} | 1 |
#include <string>
#include <iostream>
using namespace std;
int main()
{
string s;
getline(cin, s);
while (getline(cin, s)) {
string::size_type b = 0, e;
do {
e = s.find("Hoshino", b);
if (e != string::npos) {
s[e+6] = 'a';
}
b = e + 1;
} while (e != string::npos);
cout << s << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a;
string str,Hoshino="Hoshino";
cin>>n;
getline(cin,str);
for(int i=0;i<n;i++){
getline(cin,str);
for(int j=0;str[j]!='\0';j++){
if(str[j]=='H'){
for(int k=j;k<7+j;k++){
if(str[k]!=Hoshino[k-j])break;
if(k==j+6)str[k]='a';
}
}
}
cout<<str<<endl;
}
} | 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,a,b,c=0;
string s1[3],s2[1];
char str1[11];
cin >> s1[0] >> n;
for(int i=0;i<n;i++){
cin >> s1[1] >> a >> b;
if(s1[1] == "replace"){ // 置き換え
cin >> s2[0];
for(int j=a;j<=b;j++){
s1[0][j]=s2[0][c];
c++;
}
c=0;
}
if(s1[1] == "reverse"){ // 逆順
for(int j=0;j<=(b-a)/2;j++){
str1[0]=s1[0][a+j];
s1[0][a+j]=s1[0][b-j];
s1[0][b-j]=str1[0];
}
}
if(s1[1] == "print"){ // 出力
for(int j=a;j<=b;j++){
cout << s1[0][j];
}
cout << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
# define ll long long
# define VI vector<int>
# define VLL vector<ll>
# define PII pair<int,int>
#define mp make_pair
#define pb push_back
# define PI acos(-1)
# define ld long double
const int MxN = 200001 ;
# define FOR(i,a,b) for(int i = a ; i < b ; ++i)
# define RFOR(i,a,b) for(int i = a ; i >= b ; --i)
/* VARIABLES */
int n , k ;
VI a(MxN) ;
/* END OF VARIABLES */
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
cin >> n >> k ;
FOR(i,0,n)
cin >> a[i] ;
if(k>=3*log2((ld)n))
{
FOR(i,0,n)
cout<<n<<' ';
return 0;
}
FOR(i,0,k) {
VI tmp(n+1) ;
FOR(j,0,n) {
int l = max(0,j-a[j]) ;
int r = min(n-1,j+a[j]) ;
tmp[l]++;
if(r+1 < n)
tmp[r+1]--;
}
FOR(j,1,n) {
tmp[j] += tmp[j-1] ;
}
FOR(j,0,n){
a[j] = tmp[j] ;
}
}
FOR(i,0,n)
cout << a[i] << " " ;
return 0 ;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<long long, long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
int main() {
ll x; cin >> x;
ll ans = x/11*2;
ll rest = x%11;
if(rest >= 7) ans += 2;
else if(rest > 0) ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a, b;
cin >> a >> b;
b*=2, b-=a;
cout << b;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int MAXN = 1000000 + 1000;
int n;
char s[MAXN], t[MAXN];
void no()
{
cout << -1 << endl;
exit(0);
}
vector<int> sp, ri;
void init()
{
int p = n;
for(int i = n; i >= 1; i--)
if(i == n || t[i] != t[i + 1] || i == p)
{
ri.push_back(i);
while(p >= 1 && s[p] != t[i])
p--;
if(p <= 0) no();
sp.push_back(p);
p = p - 1;
// cout << i << ' ' << p << endl;
}
reverse(sp.begin(), sp.end());
reverse(ri.begin(), ri.end());
sp.push_back(n + 1), ri.push_back(n + 1);
// for(int i = 0; i < sp.size(); i++)
// cout << sp[i] << ' ' << ri[i] << endl;
}
void solve()
{
if(strcmp(s + 1, t + 1) == 0)
{
cout << 0 << endl;
exit(0);
}
int ans = 0;
int pos = 0, cnt = 0;
for(int i = 0; i < sp.size() - 1; i++)
{
if(cnt > 0) cnt--;
while(i + cnt < sp.size() && sp[i + cnt] - cnt < ri[i])
cnt++;
ans = max(ans, cnt);
// cout << cnt << endl;
}
cout << ans << endl;
}
int main()
{
ios::sync_with_stdio(false);
// freopen("game.in", "r", stdin);
// freopen("game.out", "w", stdout);
cin >> n;
cin >> (s + 1);
cin >> (t + 1);
init();
solve();
return 0;
}
/*
12
abxxcdefghij
aabbbbccdeee
*/
/*
8
bbaabbxx
bbbbbbba
*/
/*
10
cydjgcbckr
cccdggggcc
*/
/*
10
aaaaaaaa
aaaaaaaa
*/
| #include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 1001000
#define pb push_back
int n,ans,pos[N],sum[N];
char s[N],p[N];
vector<int>ve[30];
vector<int>::iterator it;
int p1[N],p2[N],m;
bool check(int x)
{
for(int i=1;i+x<=m;++i)
if(p1[i+x]-x<p2[i])
return false;
return true;
}
int main()
{
scanf("%d%s%s",&n,s+1,p+1);
int i,last=n+1,flag=0,r;
for(i=1;i<=n;++i) if(s[i]!=p[i]) flag=1;
if(!flag) puts("0");
else
{
flag=0;
for(i=1;i<=n;++i) ve[s[i]-'a'].pb(i);
for(r=i=n;i>=1;--i)
{
if(i==1||p[i-1]!=p[i])
{
last=min(last,i+1);
it=lower_bound(ve[p[i]-'a'].begin(),ve[p[i]-'a'].end(),last);
if(it==ve[p[i]-'a'].begin()) {flag=1; break;}
--it;
last=*it;
++m;
p1[m]=*it; p2[m]=r;
r=i-1;
}
}
if(flag) puts("-1");
else
{
for(i=1;i<=m;++i) if(i<m+1-i) swap(p1[i],p1[m+1-i]),swap(p2[i],p2[m+1-i]);
int l=0,mid; r=m;
while(l<r)
{
mid=(l+r)>>1;
if(check(mid)) r=mid;
else l=mid+1;
}
printf("%d",r);
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
// cout << fixed << setprecision(10) << ans << endl;
// *min_element(c + l, c + r) *max_element(c + l, c + r)
// int dx[8]={1,1,0,-1,-1,-1,0,1};
// int dy[8]={0,1,1,1,0,-1,-1,-1};
// int dx[4]={1,0,-1,0};
// int dy[4]={0,1,0,-1};
// struct Edge {
// int to, id;
// Edge(int to, int id): to(to), id(id) {}
// };
int main() {
int N,u,v;cin>>N>>u>>v;
u--;v--;
vector<vector<int>> tree(N,vector<int>());
rep(i,N-1) {
int a,b;cin>>a>>b;
a--;b--;
tree[a].push_back(b);
tree[b].push_back(a);
}
vector<bool> u_done(N,false),v_done(N,false);
vector<int> u_dis(N,0),v_dis(N,0);
u_done[u] = true;
v_done[v] = true;
queue<int> uq,vq;
uq.push(u);
vq.push(v);
while(!uq.empty()) {
int now = uq.front();
uq.pop();
for(auto nxt : tree[now]) {
if(!u_done[nxt]) {
u_done[nxt]= true;
u_dis[nxt] = u_dis[now] + 1;
uq.push(nxt);
}
}
}
// rep(i,N) {
// cout<<u_dis[i]<<endl;
// }
vector<int> leaf;
while(!vq.empty()) {
int now = vq.front();
vq.pop();
int chi_siz = 0;
for(auto nxt : tree[now]) {
if(!v_done[nxt]) {
chi_siz++;
v_done[nxt]= true;
v_dis[nxt] = v_dis[now] + 1;
vq.push(nxt);
}
}
// cout<<now<<" "<<chi_siz<<endl;
if(chi_siz == 0) leaf.push_back(now);
}
int ans = 0;
for(auto lf : leaf) {
// cout<<lf<<endl;
if(u_dis[lf] < v_dis[lf]) {
ans = max(ans,v_dis[lf]-1);
}
}
cout<<ans<<endl;
}
| //In The Name of Allah
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Mp make_pair
typedef pair < int , int > pii;
const int N = 2e5 + 10;
int mark[N], cmp[2][N];
vector < int > adj[2][N];
map < pii , int > mp;
void dfs(int v, int t, int c){
mark[v] = 1;
cmp[t][v] = c;
for (int u : adj[t][v])
if (!mark[u])
dfs(u, t, c);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m1, m2;
cin >> n >> m1 >> m2;
for (int i = 0; i < m1; i ++){
int u, v;
cin >> u >> v;
adj[0][u].pb(v);
adj[0][v].pb(u);
}
for (int i = 0; i < m2; i ++){
int u, v;
cin >> u >> v;
adj[1][u].pb(v);
adj[1][v].pb(u);
}
int c = 0;
for (int i = 1; i <= n; i ++)
if (!mark[i])
dfs(i, 0, c ++);
fill(mark, mark + N, 0);
c = 0;
for (int i = 1; i <= n; i ++)
if (!mark[i])
dfs(i, 1, c ++);
for (int i = 1; i <= n; i ++)
mp[Mp(cmp[0][i], cmp[1][i])] ++;
for (int i = 1; i <= n; i ++)
cout << mp[Mp(cmp[0][i], cmp[1][i])] << ' ';
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mpcy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 100005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
AKNOI = flag * x;
}
template <typename T> inline void cmin(T &x, T y) {
if (x > y) x = y;
}
template <typename T> inline void cmax(T &x, T y) {
if (x < y) x = y;
}
int n, a[MAXN];
void output(int win) {
puts(win? "First" : "Second");
exit(0);
}
int gcd(int x, int y) {
return (y == 0)? x : gcd(y, x % y);
}
void play(int player) {
int even = 0;
for (int i=1;i<=n;++i) {
even += !(a[i] & 1);
}
if (even & 1) output(1 ^ player);
if (n - even > 1) output(0 ^ player);
int d = 0;
for (int i=1;i<=n;++i) {
if (a[i] == 1) output(0 ^ player);
d = gcd(d, a[i] - (a[i] & 1));
}
for (int i=1;i<=n;++i) {
a[i] /= d;
}
play(player ^ 1);
}
void solve() {
read(n);
for (int i=1;i<=n;++i) {
read(a[i]);
}
play(0);
}
int main() {
solve();
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(){
int num_battle;
int a, b;
int point_a = 0;
int point_b = 0;
string cards;
cin >> num_battle;
for(; num_battle != 0;){
while(num_battle > 0){
cin >> a >> b;
if(a == b){
point_a += a;
point_b += b;
}else if(a > b){
point_a += a + b;
}else{
point_b += a + b;
}
num_battle--;
}
cout << point_a << " " << point_b << endl;
// initialize
point_a = 0;
point_b = 0;
cin >> num_battle;
}
return 0;
} | 0 |
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a,b) memset(a,b,sizeof(a))
using namespace std;
int n,a[200005],b[200005],p[600005],dp[600005];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>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++){
p[i]=b[i]^b[(i+1)%n];
p[i+n]=a[i]^a[(i+1)%n];p[i+n*2]=p[i+n];
}
int l=0;
FOR(i,1,n*3-1){
if(i+dp[i-l]<dp[l]+l){
dp[i]=dp[i-l];
}else{
int t=max(0,l+dp[l]-i);
while(t+i<3*n&&p[t]==p[t+i])t++;
dp[i]=t;
l=i;
}
}
FOR(i,n,2*n-1){
if(dp[i]>=n){
cout<<i-n<<' '<<(b[0]^a[i-n])<<'\n';
}
}
RE 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main(){
ll n;
cin>>n;
ll a[n],b[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
reverse(b,b+n);
ll j=0;
for(int i=0;i<n;i++){
if(a[i]==b[i]){
for(;j<n;j++){
if(a[i]!=b[j] && a[j]!=b[i]){
swap(b[i],b[j]);
break;
}
}
if(a[i]==b[i]){cout<<"No"<<endl;return 0;}
}
}
cout<<"Yes"<<endl;
for(int i=0;i<n;i++)cout<<b[i]<<" ";
cout<<endl;
}
| 0 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a;
cin>>a;
a=a+pow(a,2)+pow(a,3);
cout<<a;
}
| #include <bits/stdc++.h>
#define ms(a) memset (a , 0 , sizeof a)
#define rr(i, a, b) for(register int i=a;i<=b;++i)
#define re(i, a, b) for(register int i=a;i>=b;--i)
#define reps(s) for(register int i=head[s];i;i=Next[i])
typedef long long ll ;
#define v(int) vector <int>
#define pb push_back
#define pp push
#define fi first
#define se second
using namespace std ;
const int N = 100 ;
int qwq () {
char ch = getchar () ;
int x = 0 , f = 1 ;
while (ch < '0' || ch > '9') {if (ch == '-') f = -1 ; ch = getchar() ;}
while (ch >= '0' && ch <= '9') {x = x *10 + ch - '0' ; ch = getchar() ;}
return x * f ;
}
#define q qwq ()
int main () {
int a ;
cin >> a ;
cout << (ll)(a + a * a + a * a * a) << endl;
return 0 ;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
void no_cost_graphmake(ll E,mat &G){
rep(i,E){
ll a,b;
cin >> a >> b;
G.at(a-1).push_back(b-1);
G.at(b-1).push_back(a-1);//有向なら消す
}
}
ll W=0,B=0;
bool nibugraph(mat &G,ll n){
vec A(n,0);
rep(j,n){
if(A.at(j)==0){
A.at(j)=1;
W++;
queue<ll> Q;
Q.push(j);
while(!Q.empty()){
ll a=Q.front();
Q.pop();
rep(i,(ll)G.at(a).size()){
if(A.at(G.at(a).at(i))==0){
A.at(G.at(a).at(i))=3-A.at(a);
if(A.at(G.at(a).at(i))==1){
W++;
}else{
B++;
}
Q.push(G.at(a).at(i));
}else if(A.at(G.at(a).at(i))==A.at(a)){
return false;
}
}
}
}
}
return true;
}
int main(){
ll N,M;
cin >> N >> M;
mat G(N);
no_cost_graphmake(M,G);
if(nibugraph(G,N)){
cout << W*B-M << endl;
}else{
cout << (N*(N-1))/2-M << endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i <= n; i++)
template<class T> inline int chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline int chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1<<29;
const ll LINF = 1LL<<58;
const int mod = 1000000007;
int used[2][100010] = {0};
int color[2] = {0};
vector<int> G[100010];
void dfs(int v, int c){
used[c][v]++;
color[c]++;
for(auto x: G[v]){
if(used[c ^ 1][x]) continue;
dfs(x, c^1);
}
return;
}
int main(){
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].pb(b);
G[b].pb(a);
}
dfs(0, 0);
ll ans = 0;
if(used[0][0] * used[1][0]) {
cout << (ll)n * (n - 1) / 2 - m << endl;
return 0;
}
for (int i = 0; i < n; i++) {
int b = used[0][i], w = used[1][i];
ans += b * (color[1] - G[i].size()) + w * (color[0] - G[i].size());
}
ans /= 2;
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,sum;
cin>>a>>b>>c>>d;
if(a>b && c>d)
sum=b+d;
else if(a>=b && c<=d)
sum=b+c;
else if(a<=b && c<=d)
sum=a+c;
else if(a<=b && c>=d)
sum=a+d;
cout<<sum<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
double n, x, t;
cin>>n>>x>>t;
double t1 = ceil(double(n/x));
//cout<<n/x<<endl;
//cout<<t1<<endl;
ll t11 = ll(t1)*ll(t);
cout<<t11<<endl;
}
| 0 |
#include <iostream>
using namespace std;
int main() {
int n;
while(1){
cin >> n;
if(n == 0) break;
int num[10000][2] = {};
int score[2] = {};
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < 2; ++j){
cin >> num[i][j];
}
if (num[i][0] > num[i][1])
{
score[0] += num[i][0] + num[i][1];
} else if (num[i][0] == num[i][1])
{
score[0] += num[i][0];
score[1] += num[i][1];
} else{
score[1] += num[i][0] + num[i][1];
}
}
cout << score[0] << " " << score[1] << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;
int main()
{
int n;
int a[10000], b[10000];
while (cin >> n,n) {
int A = 0;
int B = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) A += a[i] + b[i];
else if (a[i] < b[i]) B += a[i] + b[i];
else {
A += a[i];
B += b[i];
}
}
cout << A << " " << B << endl;
}
} | 1 |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <functional>
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
using std::map;
using std::set;
using std::bitset;
using std::vector;
using std::string;
using std::multimap;
using std::multiset;
using std::deque;
using std::queue;
using std::stack;
using std::pair;
using std::iterator;
using std::sort;
using std::stable_sort;
using std::reverse;
using std::max_element;
using std::min_element;
using std::unique;
using std::ios_base;
using std::swap;
using std::fill;
using std::setprecision;
using std::fixed;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef string S;
ll min(ll a, ll b) {return a < b ? a : b;}
ll min(int a, ll b) {return a < b ? a : b;}
ll min(ll a, int b) {return a < b ? a : b;}
ll min(int a, int b) {return a < b ? a : b;}
ll max(ll a, ll b) {return a > b ? a : b;}
ll max(int a, ll b) {return a > b ? a : b;}
ll max(ll a, int b) {return a > b ? a : b;}
ll max(int a, int b) {return a > b ? a : b;}
namespace MySpace{
};
#define F(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()
#define int long long
const int N = 333333;
const int MOD = 998244353;
char sumb = '#';
int n, m;
string s[5000];
int d[2100][2100];
bool bd(int i, int j)
{
int cnt = 0;
cnt += s[i - 1][j] == sumb;
cnt += s[i - 1][j + 1] == sumb;
cnt += s[i][j] == sumb;
cnt += s[i][j + 1] == sumb;
return cnt % 2;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> s[i];
for (int j = 0; j < m - 1; j++)
d[n][j] = n;
for (int i = n - 1; i >= 0; i--)
{
for (int j = 0; j < m - 1; j++)
{
d[i][j] = d[i + 1][j];
if (i && bd(i, j)) d[i][j] = i;
}
}
int ans = max(n, m);
for (int i = 0; i < n; i++)
{
vector<int> r(m);
vector<int> l(m);
for (int j = 0; j < m; j++) r[j] = j, l[j] = j;
vector<vector<pair<int, int> > > v(n + 2);
for (int j = 0; j + 1 < m; j++)
{
int x = d[i + 1][j];
v[x].push_back({j, j + 1});
}
int s = 1;
for (int j = n; j > i; j--)
{
for (int k = 0; k < v[j].size(); k++)
{
int R = v[j][k].first;
int L = v[j][k].second;
int RR = r[L];
int LL = l[R];
int len = RR - LL + 1;
s = max(s, len);
l[RR] = LL;
r[LL] = RR;
}
//cout << i << " " << j << " " << s * (j - i) << "\n";
ans = max(ans, s * (j - i));
}
}
cout << ans;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define int long long
using namespace std;
const ll INF = 1e18;
const ll MOD = 998244353;
int basis[100];
int cnt = 0;
void insert(int mask) {
for(int i = 61; i >= 0; i--) {
if(!(mask&(1ll << i))) continue;
if(basis[i] == 0) {
basis[i] = mask;
cnt++;
return;
}
mask ^= basis[i];
}
}
bool check(int mask) {
for(int i = 61; i >= 0; i--) {
if(!(mask&(1ll << i))) continue;
if(!basis[i]) return false;
mask ^= basis[i];
}
return (mask == 0);
}
int32_t main() {
ios::sync_with_stdio(!cin.tie(NULL));
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
memset(basis, 0, sizeof(basis));
cnt = 0;
int arr[n];
for(int i = 0; i < n; i++) cin >> arr[i];
string s;
cin >> s;
bool flag = true;
for(int i = n - 1; i >=0; i--) {
if(s[i] == '0') {
insert(arr[i]);
}
else {
if(!check(arr[i])) {
cout << 1 << "\n";
flag = false;
break;
}
}
}
if(flag)
cout << 0 << "\n";
}
}
| 0 |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define mp make_pair
#define pb push_back
#define pi pair<ll,ll>
#define clr(x) memset(x,0,sizeof(x));
#define f(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define done(i) cout<<"done = "<<i<<endl;
#define show(x,y) cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf=1e18;
const int mod=1e9+7;
struct BIT
{
int N;
vector<int> bit;
void init(int n)
{
N = n;
bit.assign(n + 1, 0);
}
void update(int idx, int val)
{
while(idx <= N)
{
bit[idx] += val;
idx += idx & -idx;
}
}
void updateMax(int idx, int val)
{
while(idx <= N)
{
bit[idx] = max(bit[idx], val);
idx += idx & -idx;
}
}
int pref(int idx)
{
int ans = 0;
while(idx > 0)
{
ans += bit[idx];
idx -= idx & -idx;
}
return ans;
}
int rsum(int l, int r)
{
return pref(r) - pref(l - 1);
}
int prefMax(int idx)
{
int ans = -2e9;
while(idx > 0)
{
ans = max(ans, bit[idx]);
idx -= idx & -idx;
}
return ans;
}
};
const int M=502;
vector<int>vec[M];
int ses[100009];
vector<pi>yo[M];
vector<pi>abr_yo[M];
BIT Magic;
main()
{
fast
int n,m,q;
cin>>n>>m>>q;
Magic.init(503);
f(i,1,m)
{
int l,r;
cin>>l>>r;
vec[l].pb(r);
}
f(i,1,q)
{
int l,r;
cin>>l>>r;
yo[l].pb(mp(r,i));
abr_yo[r].pb(mp(l,i));
}
f(i,1,500)
{
for(auto x:yo[i])
{
int idx=x.si;
int rgt=x.fi;
int lft=i;
ses[idx]=-Magic.rsum(lft,rgt);
}
for(auto x:vec[i])
{
Magic.update(x,1);
}
}
Magic.init(503);
f(i,1,500)
{
for(auto x:vec[i])
{
Magic.update(x,1);
}
for(auto x:abr_yo[i])
{
int idx=x.si;
int lft=x.fi;
int rgt=i;
ses[idx]+=Magic.rsum(lft,rgt);
}
}
f(i,1,q)
{
cout<<ses[i]<<endl;
}
cout<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep2(i,a,n) for(int i = (a);i < (n);i++)
#define rep(i,n) rep2(i,0,n)
int main(void){
int n,m,q;cin >> n >> m >> q;
vector<vector<int>> s(n+2,vector<int>(n+2,0));
int num[575][770] = {};
rep(i,m){
int l,r;cin >> l >> r;
num[max(l,r)-1][min(r,l)-1]++;
}
for(int i = 1;i < n+1;i++){
for(int j = 1;j < n+1;j++){
s[i][j] = s[i][j-1] + s[i-1][j] - s[i-1][j-1] + num[i-1][j-1];
}
}
rep(i,q){
int alina,gray;cin >> alina >> gray;
int l = max(alina,gray),r = min(alina,gray);
int sum = s[l][l] - s[r-1][l] - s[l][r-1] + s[r-1][r-1];
cout << sum << endl;
}
} | 1 |
#include<bits/stdc++.h>
#define N 200005
#define reg register
#define LL long long
using namespace std;
int val,cnt;
int n,a[N],b[N];
vector<int> p,q;
inline int qr()
{
int x=0,w=1;char a=0;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}
inline LL qrl()
{
LL x=0,w=1;char a=0;
while(a<'0'||a>'9'){if(a=='-')w=-1;a=getchar();}
while(a<='9'&&a>='0'){x=(x<<3)+(x<<1)+(a^48);a=getchar();}
return x*w;
}
bool mycmp(int a,int b)
{
return a>b;
}
int main()
{
n=qr();
for(register int i=1;i<=n;i++)
a[i]=qr();
for(register int i=1;i<=n;i++)
b[i]=qr();
sort(b+1,b+n+1,mycmp);
for(register int i=1;i<=n;i++)
{
if(a[i]!=b[i])
continue;
cnt++;
p.push_back(i);
val=b[i];
}
for(register int i=1;i<=n;i++)
{
if(!cnt)
break;
if(a[i]==b[i])
continue;
if(a[i]!=val&&b[i]!=val)
{
cnt--;
q.push_back(i);
}
}
if(cnt)
{
printf("No\n");
return 0;
}
for(int i=0;i<q.size();i++)
swap(b[p[i]],b[q[i]]);
printf("Yes\n");
for(register int i=1;i<=n;i++)
printf("%d ",b[i]);
printf("\n");
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n), aa(n+1,0), bb(n+1,0);
rep(i,n) {
cin >> a[i];
aa[a[i]]++;
}
rep(i,n) {
cin >> b[i];
bb[b[i]]++;
}
rep(i,n){
if(bb[i+1]+aa[i+1] > n){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
rep(i,n){
aa[i+1] += aa[i];
bb[i+1] += bb[i];
}
int x = 0;
rep(i,n){
x = max(x,aa[i+1]-bb[i]);
}
rep(i,n){
cout << b[(i-x+n)%n] << " ";
}
cout << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pii pair < int, int >
#define pb push_back
#define ll long long
#define int ll
const int inf = (int)1e18 + 7;
pii ar[5234];
int dp[5234];
int x;
bool comp (const pii &a, const pii &b) {
return a.fr + a.sc < b.fr + b.sc;
}
main () {
int n; scanf ("%lld", &n);
for (int i = 1; i <= n; i++) {
int a, b; scanf ("%lld %lld", &a, &b);
ar[i] = {a, b};
}
for (int i = 0; i <= n; i++) {
dp[i] = inf;
}
sort(ar + 1, ar + n + 1, comp);
dp[0] = x;
for (int i = 1; i <= n; i++) {
for (int j = i; j >= 1; j--) {
if (ar[i].fr >= dp[j - 1]) {
dp[j] = min(dp[j], dp[j - 1] + ar[i].sc);
}
}
}
vector < int > ans;
while (dp[n] == inf) n--;
printf ("%lld\n", n);
return 0;
while (n > 1) {
for (int i = n - 1; i >= 1; i--) {
if (dp[n] == dp[i] + ar[i].sc) {
cout << i << ' ';
n = i;
break;
}
}
}
for (int to : ans) {
printf ("%d ", to);
}
}
| #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#define fi first
#define se second
#define lz length()
#define all(x) (x).begin(),(x).end()
#define scf(x) scanf("%lld",&x)
#define rep(i,n) for(ll i=0;i<n;i++)
const int INF = (int)1e9;
const ll IINF=1LL<<62;
const int maxn=10000005;
//int divr[maxn];
/**/
/*void divisor()
{for(int i=2;i<sqrt(maxn);i++)
{
if(!divr[i])
{
for(int j=i*i;j<maxn;j+=i)if(!divr[j])divr[j]=i;
}
}
for(int i=1;i<maxn;i++)if(!divr[i])divr[i]=i;
}*/
/*const int N=1000005;
ll n;
struct line {
long long m, c;
long long eval(long long x) { return m * x + c; }
long double intersectX(line l) { return (long double) (c - l.c) / (l.m - m); }
};
vector<pair<pi,ll>> rect;
deque<line> dq;
*/
/*int find(int a){
if(a==par[a])return a;
return par[a]=find(par[a]);
}
void unite(int a,int b){
a=find(a),b=find(b);
if(a==b)return ;
par[b]=a;
}
ll modexpo(ll a,ll b)
{
ll ans=1LL;
while(b>0)
{
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
*/
vector<int> adj[100005];
int indeg[100005];
int par[100005];
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n+m-1;i++){
int a,b;cin>>a>>b;
adj[a].pb(b);indeg[b]++;
}
queue<int> q;
for(int i=1;i<=n;i++)if(indeg[i]==0){q.push(i);break;}
while(!q.empty()){
int x=q.front();q.pop();
for(int child:adj[x]){
indeg[child]--;
if(indeg[child]==0){
q.push(child);par[child]=x;
}
}
}
for(int i=1;i<=n;i++)cout<<par[i]<<"\n";
}
| 0 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))
typedef long long int ll;
using namespace std;
int dp[41];
int main(){
memset(dp,0,sizeof(dp));
dp[0] = 1;
for(int j=0;j<30;j++){
for(int i=1;i<=3;i++){
dp[i+j] += dp[j];
}
}
while(true){
int n;
cin >> n;
if(n == 0) break;
int fact = dp[n]/10 + ((dp[n]%365==0) ? 0 : 1) ;
cout << fact/365 + ((fact%365==0) ? 0 : 1) << endl;
}
return 0;
} | #include<iostream>
using namespace std;
#define MEMO_MAX 100
typedef unsigned long long ULL;
bool Flag_memo_g = true; //?????¢??????????????????
class Answer
{
public:
Answer()
{
day = 10; year = 365;
for(int i = 0; i < MEMO_MAX; i++)
{
memo[i] = 0;
Flag_memo[i] = false;
}
}
int N; //??\???
int day;
int year;
ULL memo[MEMO_MAX];
bool Flag_memo[MEMO_MAX];
ULL count(int cnt); //??¨??¢?´¢(??±???)
ULL count_memo(int cnt); //??¨??¢?´¢(??±???)(?????¢???ver.)
void set(); //??\???
void OutPut(); //???????????????
bool empty(); //???????????¶?????????
bool ans(); //?§£???
};
ULL Answer::count(int cnt)
{
if( cnt < 0 )
return 0;
else if( cnt == 0 )
return 1;
return count(cnt - 1) + count(cnt - 2) + count(cnt - 3);
}
ULL Answer::count_memo(int cnt)
{
if( cnt < 0 )return 0;
else if( cnt == 0 )return 1;
if( !(Flag_memo[cnt]) )
{
memo[cnt] = count_memo(cnt - 1) + count_memo(cnt - 2) + count_memo(cnt - 3);
Flag_memo[cnt] = true;
}
return memo[cnt];
}
void Answer::OutPut()
{
if( N == 0 )
return;
int ans_ = 1; //??????????????´???
if( Flag_memo_g )
ans_ += count_memo( N ) / (day * year);
else if( !Flag_memo_g )
ans_ += (count( N )) / (day * year); //??\???
cout << ans_ << endl;
}
void Answer::set()
{
cin >> N;
}
bool Answer::empty()
{
if( N == 0 )return false;
else return true;
}
bool Answer::ans()
{
set();
OutPut();
return empty();
}
int main()
{
Answer ans;
while( ans.ans() );
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 rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n;
cin >> n;
vector<int> x(n), y(n), per(n);
rep(i, n) cin >> x[i] >> y[i];
rep(i, n) per[i] = i;
double ans = 0;
int cnt = 0;
do
{
cnt++;
rep(i, n - 1)
{
ans += sqrt(pow(x[per[i + 1]] - x[per[i]], 2.0) + pow(y[per[i + 1]] - y[per[i]], 2.0));
}
} while (next_permutation(all(per)));
printf("%6lf\n", ans / cnt);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
//定数
#define INF 1000000000 //10^9:極めて大きい値,∞
//略記
#define PB push_back //vectorヘの挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
int main(){
int N;
cin>>N;
vector<double> x(N),y(N);
rep(i,N){
cin>>x[i]>>y[i];
}
double sum=0;
rep(i,N-1){
for(int j=i;j<N;j++){
sum+=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
}
double ans=sum*2/N;
std::cout << std::fixed<<std::setprecision(9);
cout<<ans<<endl;
return 0;
} | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int di[]={-1, 0, 1, 0}, dj[]={0, -1, 0, 1};
bool is_valid(const vector<size_t> &q, size_t r) {
for (size_t j=0; j<8; ++j)
if (j!=r && q[j]==q[r])
return false;
for (size_t i=0; i<r; ++i) {
if (q[i]-i == q[r]-r) return false;
if (q[i]+i == q[r]+r) return false;
}
return true;
}
bool solve_equeen(vector<size_t> &q, size_t r=0) {
if (r == 8) return true;
if (!~q[r]) {
for (size_t c=0; c<8; ++c) {
q[r] = c;
if (is_valid(q, r))
if (solve_equeen(q, r+1))
return true;
}
q[r] = -1;
} else {
if (is_valid(q, r))
if (solve_equeen(q, r+1))
return true;
}
return false;
}
int main() {
size_t k;
scanf("%zu", &k);
vector<size_t> q(8, -1);
for (size_t i=0; i<k; ++i) {
size_t r, c;
scanf("%zu %zu", &r, &c);
if (~q[r]) return 1;
q[r] = c;
}
solve_equeen(q);
for (size_t i=0; i<8; ++i)
for (size_t j=0; j<8; ++j)
printf("%c%s", q[i]==j? 'Q':'.', j<7? "":"\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
vector<int> part_ans(0);
vector<int> t_ans;
bool fin=false;
int last=-1;
vector<int> topo_sort1(vector<vector<int>> e)
{
int n=e.size();
vector<int> ans(0);
vector<int> ins(n,0);
int i,j;
rep(i,n)
{
rep(j,e[i].size())
{
ins[e[i][j]]++;
}
}
queue<int> s;
rep(i,n) if(ins[i]==0)s.push(i);
while(!s.empty())
{
int now=s.front();
s.pop();
ans.emplace_back(now);
rep(i,e[now].size())
{
ins[e[now][i]]--;
if(ins[e[now][i]]==0)
{
s.push(e[now][i]);
}
}
}
return ans;
}
void dfs(int now,vector<bool> &visited,vector<vector<int>> e,int count)
{
if(fin)return;
int i,j;
visited[now]=true;
part_ans.emplace_back(now);
int pas=part_ans.size();
rep(i,e[now].size())
{
if(!visited[e[now][i]])
{
dfs(e[now][i],visited,e,count+1);
if(fin)
{
return;
}
}
else
{
last=e[now][i];
bool ap=false;
rep(j,part_ans.size())
{
if(!ap)
{
if(part_ans[j]==last)
{
ap=true;
t_ans.emplace_back(part_ans[j]);
}
}
else
{
t_ans.emplace_back(part_ans[j]);
}
}
fin=true;
break;
}
}
visited[now]=false;
part_ans.erase(part_ans.end()-1,part_ans.end());
}
int main()
{
int n,m;cin>>n>>m;
vector<int> a(m);
vector<int> b(m);
int i,j;
rep(i,m)cin>>a[i]>>b[i];
rep(i,m)
{
a[i]--;
b[i]--;
}
vector<vector<int>> e(n);
rep(i,m)
{
e[a[i]].emplace_back(b[i]);
}
vector<int> ans=topo_sort1(e);
if(ans.size()==n)
{
cout<<-1<<endl;
}
else
{
rep(i,n)
{
vector<bool> visited(n,false);
dfs(i,visited,e,0);
if(fin)break;
}
while(true)
{
vector<bool> inside(n,false);
rep(i,t_ans.size())
{
inside[t_ans[i]]=true;
}
vector<int> ins(n,0);
vector<int> outs(n,0);
bool ok=true;
vector<vector<int>> mine(n);
rep(i,m)
{
if(inside[a[i]]&&inside[b[i]])
{
ins[b[i]]++;
outs[a[i]]++;
mine[a[i]].emplace_back(b[i]);
}
}
int insum=0;
int outsum=0;
rep(i,n)
{
if(inside[i])
{
if(ins[i]!=1||outs[i]!=1)
{
ok=false;
}
}
}
if(ok)break;
int stat=-1;
rep(i,t_ans.size())
{
if(outs[t_ans[i]]>1)
{
stat=i;
break;
}
}
vector<bool> use(n,true);
rep(i,outs[t_ans[stat]])
{
vector<bool> vis(n,false);
int now=t_ans[stat];
vis[now]=true;
now=mine[now][i];
while(true)
{
vis[now]=true;
now=mine[now][0];
if(vis[now])break;
}
rep(j,n)
{
if(!vis[j])use[j]=false;
}
}
t_ans.erase(all(t_ans));
rep(i,n)if(use[i])t_ans.emplace_back(i);
}
cout<<t_ans.size()<<endl;
rep(i,t_ans.size())
{
cout<<t_ans[i]+1<<endl;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long double;
int main() {
double n, k;
cin >> n >> k;
vector<ll> arr(n);
for (int i = 0; i < n; i++) {
ll x; cin >> x;
arr[i] = (x + 1.0) / 2.0;
}
ll ans = 0;
for (int i = 0; i < k; i++) ans += arr[i];
ll temp = ans;
for (int i = k; i < n; i++) {
temp = temp + arr[i] - arr[i-k];
ans = max(ans, temp);
}
printf("%0.7Lf\n", ans);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, ans = 0, prt[N];
vector<int> g[N];
int dfs(int u, int fa) {
int res = 0;
for (auto v : g[u]) {
res = max(res, dfs(v, u));
}
if (res == k - 1 && fa != 1) {
res = -1;
ans++;
}
return res + 1;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &prt[i]);
if (i > 1) {
g[prt[i]].push_back(i);
}
}
if (prt[1] != 1) {
ans ++;
prt[1] = 1;
}
dfs(1, 1);
printf("%d\n", ans);
return 0;
} | 0 |
#include<bits/stdc++.h>
#define REP(i, n) for(int i=0; i<n; i++)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
sort(A, A+N);
string ans = "YES";
for (int i = 1; i < N; i++)
{
if(A[i-1]==A[i]) ans = "NO";
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],i=0;
int z=0;
for (;i<n;i++){
cin>>x[i];
if(z==0&&i>0){
int j=i-1;
if(x[j]==x[i]||x[j-1]==x[i])
z++;
}
}
if(z==0){
sort(x,x+n);
int j=n-1;
int m=n/2+1;
int k=n/2-1;
for (int i=0;i<n/4+2;i++){
if(x[i+1]==x[i]||x[j]==x[j-1]||x[m]==x[m-1]||x[k]==x[k+1]){
z++;
break;
}
else{
j--;
m++;
k--;
}
}
}
if(z==0)
cout<<"YES";
else
cout<<"NO";
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const int MAX_N = 2005;
ll sil[MAX_N * MAX_N], odw[MAX_N * MAX_N], DP[MAX_N][MAX_N];
ll pot(ll a, ll b) {
ll result = 1;
while(b > 0) {
if(b % 2 == 1) {
result = (result * a) % MOD;
}
a = (a * a) % MOD;
b /= 2;
}
return result;
}
ll binom(int n, int k) {
ll result = sil[n];
result = (result * odw[k]) % MOD;
result = (result * odw[n - k]) % MOD;
return result;
}
int main() {
sil[0] = 1;
for(int i = 1; i < MAX_N * MAX_N; i++) {
sil[i] = (sil[i - 1] * i) % MOD;
}
odw[MAX_N * MAX_N - 1] = pot(sil[MAX_N * MAX_N - 1], MOD - 2);
for(int i = MAX_N * MAX_N - 2; i >= 1; i--) {
odw[i] = (odw[i + 1] * ll(i + 1)) % MOD;
}
odw[0] = odw[1];
int n, k;
cin >> n >> k;
if(k == 1) {
cout << 1;
return 0;
}
for(int i = 0; i <= n; i++) {
for(int j = i; j <= n; j++) {
if(i == 0) {
if(j == 0) {
DP[i][j] = 1;
} else {
DP[i][j] = (DP[i][j - 1] * binom(j * (k - 1) - 1, k - 2)) % MOD;
}
continue;
}
DP[i][j] = DP[i - 1][j];
if(j > i) {
DP[i][j] += DP[i][j - 1] * binom(j * (k - 1) + i - 1, k - 2);
DP[i][j] %= MOD;
}
}
}
for(int i = 1; i <= n; i++) {
DP[n][n] = (DP[n][n] * i) % MOD;
}
cout << DP[n][n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a = mul(a, a)) if (b & 1) res = mul(res, a);
return res;
}
int C(int n, int k)
{
if (k < 0 || n < 0 || k > n) return 0;
return mul(fac[n], mul(inv[k], inv[n - k]));
}
int32_t main()
{
fac[0] = 1;
for (int i = 1; i < N; i++) fac[i] = mul(fac[i - 1], i);
inv[N - 1] = Pow(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; i--) inv[i] = mul(inv[i + 1], i + 1);
int n, k; cin >> n >> k;
if (k == 1) return cout << "1\n", 0;
ps[1][1] = dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
dp[i][1] = mul(ps[i - 1][1], C(i * k - 2, k - 2));
for (int j = 2; j <= i; j++) {
dp[i][j] = mul(ps[i - 1][j - 1], C(i * k - j - 1, k - 2));
}
for (int j = i; j >= 1; j--) ps[i][j] = sum(ps[i][j + 1], dp[i][j]);
}
cout << mul(ps[n][1], fac[n]) << "\n";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans=0;
for(int i=0;i<s.size()-1;i++){
if(s.at(i)=='A'&&s.at(i+1)=='C') ans++;
}
if(ans>=1) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"A"下一个是不是"C"
{
cout<<"Yes"<<endl;
break; //跳出循环
}
pos++; //下一次从pos+1找起
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
int main() {
while(cin >> n >> m, n) {
vector<vector<int> > G(n);
for(int i = 0; i < m; i++) {
cin >> a >> b; a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> d(n, -1); d[0] = 0;
queue<int> que; que.push(0);
while(!que.empty()) {
int u = que.front(); que.pop();
for(int i : G[u]) {
if(d[i] == -1) {
d[i] = d[u] + 1;
que.push(i);
}
}
}
int cnt = -1;
for(int i = 0; i < n; i++) {
if(d[i] <= 2) cnt++;
}
cout << cnt << endl;
}
} | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
while(1)
{
int n,m,a[10000],b[10000],lis1[500],lis2[500],x=0,y,z,cnt=0;
cin>>n>>m;
if(n==0&&m==0)break;
for(int i=0;i<m;i++)
{
y=0;
cin>>a[i]>>b[i];
if(a[i]==1)
{
if(x!=0)for(int j=0;j<x;j++)if(lis1[j]==b[i])y++;
if(y==0)
{
lis1[x]=b[i];
x++;
}
}
if(b[1]==1)
{
if(x!=0)for(int j=0;j<x;j++)if(lis1[j]==a[i])y++;
if(y==0)
{
lis1[x]=a[i];
x++;
}
}
}
lis1[x]=1;
y=0;
for(int i=0;i<m;i++)
{
z=0;
for(int j=0;j<=x;j++)
{
if(a[i]==lis1[j])
{
if(b[i]!=1)
{
if(y!=0)for(int k=0;k<y;k++)if(lis2[k]==b[i])z++;
if(z==0)
{
lis2[y]=b[i];
y++;
cnt++;
}
}
}
if(b[i]==lis1[j])
{
if(a[i]!=1)
{
if(y!=0)for(int k=0;k<y;k++)if(lis2[k]==a[i])z++;
if(z==0)
{
lis2[y]=a[i];
y++;
cnt++;
}
}
}
}
}
cout<<cnt<<endl;
}
return 0;
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#define int long long
const int INF = 1e18;
long long d;
unsigned long long ans;
unsigned long long p[50];
map<int, int> kek[2];
void check(long long d, int L, int R, unsigned long long cnt)
{
if (L >= R)
{
ans += cnt * (d == 0) * (L == R ? 10 : 1);
return;
}
long long c = p[R] - p[L];
vector<long long> xs;
for (int digit = -9; digit <= 9; digit++)
{
if (digit < 0 && L == 0) continue;
long long x = d - digit * c;
xs.push_back(x);
}
sort(xs.begin(), xs.end());
for (int i = -1; i < (int)xs.size(); i++)
{
if ((i == -1 || xs[i] < 0) && (i + 1 == xs.size() || xs[i + 1] >= 0))
{
if (i > -1)
{
int digit = (d - xs[i]) / c;
check(xs[i], L + 1, R - 1, cnt * kek[L == 0][digit]);
}
if (i + 1 < xs.size())
{
int digit = (d - xs[i + 1]) / c;
check(xs[i + 1], L + 1, R - 1, cnt * kek[L == 0][digit]);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 10; i++)
{
for (int j = 0; j < 10; j++)
{
kek[0][i - j]++;
}
}
for (int i = 1; i < 10; i++)
{
for (int j = 1; j < 10; j++)
{
kek[1][i - j]++;
}
}
cin >> d;
p[0] = 1;
for (int i = 1; i <= 19; i++) p[i] = p[i - 1] * 10;
for (int len = 1; len <= 19; len++)
{
check(d, 0, len - 1, 1);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,Y,x,y,z;
cin >> N >> Y;
int check = 0;
for(x=0;x<=N;x++){
for(y = 0;y <=N;y++){
z = N-x-y;
if(z >= 0 && Y == 10000*x+5000*y+1000*z){
check = 1;
break;
}
}
if(check)break;
}
if(check){
cout << x << " " << y << " " << z << endl;
}else{
cout << -1 << " " << -1 << " " << -1 << endl;
}
return 0;
}
| 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repq(i,a,n) for(int i=a; i<=n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
// Binary Indexed Tree (BIT)
// Verified: AOJ DSL_2_B: Range Sum Query (int??????)
template <typename T>
struct BIT{
private:
vector<T> array;
const int n;
public:
// ?????????
BIT(int _n) : array(_n + 1, 0), n(_n) {}
// 1???????????? i???????????§????´???????????±???????
T sum(int i) {
T s = 0;
while(i > 0) {
s += array[i];
i -= i & -i; // LSB ??????
}
return s;
}
// [i, j] ???????´??????????
T sum(int i, int j) {
T ret_i = sum(i-1);
T ret_j = sum(j);
return ret_j - ret_i;
}
// i ????????? ????´? x ?????????
void add(int i, T x) {
while(i <= n) {
array[i] += x;
i += i & -i; // LSB ??????
}
}
};
signed main() {
int n; cin >> n;
BIT<int> b(n);
vector<int> a(n);
map<int, int> m;
rep(i,0,n) {
cin >> a[i];
m[a[i]];
}
int newnum = 1;
for(auto &x : m) x.second = newnum++;
rep(i,0,n) a[i] = m[a[i]];
int ans = 0;
rep(j,0,n) {
ans += j - b.sum(a[j]);
b.add(a[j], 1);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<pii> VP;
typedef priority_queue<int> PQ;
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; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//vector<vector<int> > dp;
//vector<vector<vector<int> > > vvvi;
//dp=vector<vector<int> >(N, vector<int>(M,0));
//vector<pair<int,int> > v;
//v.push_back(make_pair(x,y));
//priority_queue<int,vector<int>, greater<int> > q2;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
VP A(N);
REP(i, N) {
cin >> A[i].first >> A[i].second;
A[i].second++;
}
SORT(A);
int s1, s2, t1, t2;
int ans = -1;
s2 = A[N - 1].first;
VI mi(N, INF), mii(N, INF);
mi[N - 1] = A[N - 1].second;
for (int i = N - 2; i >= 0; i--)mi[i] = min(A[i].second, mi[i + 1]);
mii[0] = A[0].second;
FOR(i, 1, N)mii[i] = min(mii[i - 1], A[i].second);
REP(i, N - 1) {
int cnt=-1;
s1 = A[i].first;
t2 = mi[i + 1];
t1 = mii[i];
chmax(cnt, max((t1 - s1), 0LL) + max((t2 - s2), 0LL));
chmax(ans, cnt);
if (i == 0)continue;
t1 = A[i].second;
t2 = min(mii[i - 1], mi[i + 1]);
chmax(cnt, max((t1 - s1), 0LL) + max((t2 - s2), 0LL));
chmax(ans, cnt);
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vb = vector<bool>;
using qi = queue<int>;
using P = pair<int, int>;
using graph = vector<vector<edge>>;
// using graph = vector<vector<int>>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define REP(i,n) for(int i=0;i<n;i++)
#define delim(i, n) cout << (i == n-1 ? "\n" : " ");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int inf = 1LL << 60;
// const int inf = 100000000;
const int mod = 1000000007;
const int maxn = 100000;
int n, m;
vi a(maxn);
vi table(maxn);
vi dx = {-1, 0, 0, 1};
vi dy = {0, -1, 1, 0};
int lds() {
table.resize(n);
REP(i, n) {
table[i] = -1;
}
REP(i, n) {
auto iter = upper_bound(table.begin(), table.end(), a[i], [](const int& a, const int& b) { return a > b; });
*iter = a[i];
}
auto iter = lower_bound(table.begin(), table.end(), -1, [](const int& a, const int& b) { return a > b; });
return (int) (iter - table.begin());
}
signed main () {
cin.tie(0);
ios::sync_with_stdio(false);
// https://onlinejudge.u-aizu.ac.jp/problems/DPL_1_D
cin >> n;
REP(i, n) {
cin >> a[i];
}
int ret = lds();
cout << std::fixed << std::setprecision(10) << ret << "\n";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
for(int i=0;i<9;i++){
int A=100*(i+1)+10*(i+1)+i+1;
if(N<=A){
cout << A << endl;
break;
}
}
}
| 0 |
#include <stdio.h>
#include <algorithm>
using namespace std;
using ll = long long;
int n, a[500010], ca[500010];
ll czero[500010], dp[1 << 20][2], last[1 << 20], mod = 1e9+7;
void zero() {
for (int i = 0; i < (1 << 20); i++)
dp[i][0] = 1, last[i] = 0;
for (int i = 1; i <= n; i++) {
czero[i] = czero[i - 1];
if (ca[i] != 0) {
dp[ca[i]][0] += dp[ca[i]][1] * (czero[i] - czero[last[ca[i]]]);
dp[ca[i]][0] %= mod;
dp[ca[i]][1] += dp[ca[i]][0];
dp[ca[i]][1] %= mod;
last[ca[i]] = i;
}
else
czero[i]++;
}
ll sum = 0;
for (int i = 1; i < (1 << 20); i++)
sum += dp[i][1];
ll pow2 = 1;
for (int i = 0; i < czero[n] - 1; i++)
pow2 = (pow2 * 2) % mod;
sum += pow2;
sum = ((sum % mod) + mod) % mod;
printf("%lld\n", sum);
}
void nonzero() {
for (int i = 0; i < (1 << 20); i++)
dp[i][0] = 1, last[i] = 0;
for (int i = 1; i <= n; i++) {
czero[i] = czero[i - 1];
if (ca[i] != 0) {
dp[ca[i]][0] += dp[ca[i]][1] * (czero[i] - czero[last[ca[i]]]);
dp[ca[i]][0] %= mod;
dp[ca[i]][1] += dp[ca[i]][0];
dp[ca[i]][1] %= mod;
last[ca[i]] = i;
}
else
czero[i]++;
}
printf("%lld\n", dp[ca[n]][0]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
ca[i] ^= ca[i - 1] ^ a[i];
}
if (ca[n] == 0)
zero();
else
nonzero();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
lli rec(int l, int r, vector<int> &A) {
if(r-l <= 1) return 0;
int m = (l+r)/2;
lli res = rec(l, m, A) + rec(m, r, A);
queue<int> a, b;
for(int i = l; i < m; ++i) a.push(A[i]);
for(int i = m; i < r; ++i) b.push(A[i]);
int k = l;
while(a.size() && b.size()) {
if(a.front() <= b.front()) {
A[k++] = a.front();
a.pop();
} else {
A[k++] = b.front();
b.pop();
res += a.size();
}
}
while(a.size()) {
A[k++] = a.front();
a.pop();
}
while(b.size()) {
A[k++] = b.front();
b.pop();
}
return res;
}
int main() {
int n;
vector<int> A;
cin >> n;
A.resize(n);
for(int i = 0; i < n; ++i) cin >> A[i];
cout << rec(0, n, A) << endl;
return 0;
} | 0 |
#include <iostream>
int main(){
int a;
std::cin >> a;
a=a+a*a+a*a*a;
std::cout << a << std::endl;
}
| #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define mod 1000000007
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
return dp[i][k];
if(k!=0)
ans=max(rec(dp,arr,n,i+1,w,w),arr[i]+rec(dp,arr,n,i+1,k-1,w));
else
ans=max(rec(dp,arr,n,i+1,k,w),rec(dp,arr,n,i+1,w,w));
return dp[i][k]=ans;
}
ll t[400008];
void build(vector<ll>& a, int v, int tl, int tr) {
if (tl == tr) {
t[v] = a[tl];
} else {
int tm = (tl + tr) / 2;
build(a, v*2, tl, tm);
build(a, v*2+1, tm+1, tr);
t[v] = max(t[v*2] ,t[v*2+1]);
}
}
ll maxi(int v, int tl, int tr, int l, int r) {
if (l > r)
return 0;
if (l == tl && r == tr) {
return t[v];
}
int tm = (tl + tr) / 2;
return max(maxi(v*2, tl, tm, l, min(r, tm)) ,maxi(v*2+1, tm+1, tr, max(l, tm+1), r));
}
void update(int v, int tl, int tr, int pos, ll new_val) {
if (tl == tr) {
t[v] = new_val;
} else {
int tm = (tl + tr) / 2;
if (pos <= tm)
update(v*2, tl, tm, pos, new_val);
else
update(v*2+1, tm+1, tr, pos, new_val);
t[v] = max(t[v*2] ,t[v*2+1]);
}
}
int main() {
int a;
cin>>a;
cout<<a+a*a+a*a*a;
return 0;
}
| 1 |
#include<stdio.h>
int main(void)
{
int i,num[100],a,j;
scanf("%d",&a);
for(i=0;i<a;i++){
scanf("%d",&num[i]);
}
for(j=a-1;j>=0;j--){
if(j>0&&j<=a-1){
printf("%d ",num[j]);
}
else{
printf("%d\n",num[0]);
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
int input()
{
int value;
std::cin>>value;
return value;
}
int main()
{
std::vector<int> vec;
int n;
std::cin >> n;
for(int i = 0;i<n;++i)
vec.push_back(input());
std::reverse(vec.begin(),vec.end());
for(auto i = 0;i < n;++i)
{
std::cout << vec[i] << (i==n-1?"":" ");
}
std::cout << std::endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
ll r = 0, g = 0, b = 0;
for (const auto& c : s) {
if (c == 'R')
r++;
else if (c == 'G')
g++;
else
b++;
}
ll cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int k = 2 * j - i;
if (k <= j || k > n - 1) continue;
if (s[i] != s[j] && s[j] != s[k] && s[k] != s[i]) {
cnt++;
}
}
}
ll ans = r * g * b - cnt;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define COUNT(V,X) upper_bound((V).begin(),(V).end(),X)-lower_bound((V).begin(),(V).end(),X)
#define debug(x) cerr<<#x<<':'<<x<<endl;
#define DEBUG(v) cerr<<#v<<':';for(auto x:v)cerr<<x<<' ';cerr<<endl;
#define INF 1000000007
#define LINF 1000000000000000007
#define EPS 1e-9
typedef long long ll;
ll levenshtein(string s1,string s2){
long long n = s1.size();
long long m = s2.size();
long long DP[n+1][m+1]={0};
for(long long i = 0;i < n+1;i++)DP[i][0] = i;
for(long long j = 0;j < m+1;j++)DP[0][j] = j;
for(long long i = 1;i < n+1;i++){
for(long long j = 1;j < m+1;j++){
long long cost = (s1[i-1]==s2[j-1] ? 0 :1);
DP[i][j] = min({DP[i-1][j]+1,DP[i][j-1]+1,DP[i-1][j-1]+cost});
}
}
return DP[n][m];
}
signed main(){
string s1,s2;
cin >> s1 >> s2;
cout << levenshtein(s1,s2) << endl;
}
| 0 |
#include<iostream>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
while(h != 0 || w != 0){
int ans[2],min=100000;;
ans[0]=1000;
ans[1]=1000;
int current=h*h+w*w;
int anstmp=current;
for(int i=1; i<10000; i++){
for(int j=i+1; j<10000-i; j++){
int tmp=i*i+j*j;
if(tmp > current || (tmp == current && i>h) ){
if(tmp < min || (tmp == min && ans[0] > i) ){
min = tmp;
ans[0]=i;
ans[1]=j;
}
}
}
}
cout << ans[0] << ' ' << ans[1] << endl;
cin >> h >> w;
}
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct Node{int key; Node *p,*l,*r;};
Node *null,*root;
void insert(int k){
Node *x,*y,*z;
y=null;
x=root;
z=(Node*)malloc(sizeof(Node));
z->key=k;
z->l=null;
z->r=null;
while(x!=null){
y=x;
if(z->key<x->key)
x=x->l;
else
x=x->r;
}
z->p=y;
if(y==null)
root=z;
else if(z->key>y->key)
y->r=z;
else
y->l=z;
}
void in_p(Node *u){
if(u==null)
return;
in_p(u->l);
printf(" %d",u->key);
in_p(u->r);
}
void pre_p(Node *u){
if(u==null)
return ;
printf(" %d",u->key);
pre_p(u->l);
pre_p(u->r);
}
void print(){
in_p(root);
printf("\n");
pre_p(root);
printf("\n");
}
bool find(Node *a,int k){
if(a==null)
return false;
else if(a->key==k)
return true;
else if(a->key>k)
find(a->l,k);
else
find(a->r,k);
}
Node* getmin(Node *x){
while(x->l!=null)
x=x->l;
return x;
}
Node* getS(Node *x){
if(x->r!=null)
return getmin(x->r);
Node *y;
y=x->p;
while(y!=null&&x==y->r){
x=y;
y=y->p;
}
return y;
}
void Delete(int k){
Node *y,*z,*x;
x=null;
z=root;
while(z->key!=k&&z!=null){
if(k>z->key)
z=z->r;
else
z=z->l;
}
if(z->l==null || z->r==null)
y=z;
else
y=getS(z);
if(y->l!=null)
x=y->l;
else
x=y->r;
if(x!=null)
x->p=y->p;
if(y->p==null)
root=x;
else if(y==y->p->l)
y->p->l=x;
else
y->p->r=x;
if(y!=z)
z->key=y->key;
free(y);
}
main(){
int i,n,key;
string com;
scanf("%d",&n);
for(i=0;i<n;i++){
cin>>com;
if(com=="insert"){
scanf("%d",&key);
insert(key);
}
else if(com=="find"){
scanf("%d",&key);
if(find(root,key))
printf("yes\n");
else
printf("no\n");
}
else if(com=="delete"){
scanf("%d",&key);
Delete(key);
}
else
print();
}
return 0;
}
| 0 |
#include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <map>
//#include <unordered_map>
//#include <unordered_set>
//#include <boost/container/static_vector.hpp>
//#include <boost/unordered_set.hpp>
//#include <boost/unordered_map.hpp>
//#include <unistd.h>
//#include <cv.h>
//#include <highgui.h>
#include <stdlib.h>
#include <string>
class Direct_Graph {
public:
struct Edge {
int to; int cost;
};
std::vector<std::vector<Edge>> G;
int node_num;
Direct_Graph() {}
Direct_Graph(const int node_num_in) {
node_num = node_num_in;
G.resize(node_num);
}
void add_edge(const int from, const int to, const int cost) {
Edge edge; edge.to = to; edge.cost = cost;
G[from].push_back(edge);
}
void add_edge_both(const int node1, const int node2, const int cost) {
add_edge(node1, node2, cost);
add_edge(node2, node1, cost);
}
std::vector<int> Dijkstra(int s, const int dist_inf) {
std::vector<int> dist; dist.resize(node_num);
for (int i = 0; i < dist.size(); i++) {
dist[i] = dist_inf;
}
typedef std::pair<int, int> Pair;
std::priority_queue <Pair, std::vector<Pair>, std::greater<Pair>> que;
dist[s] = 0;
que.push(Pair(0, s));
while (!que.empty()) {
Pair pair = que.top(); que.pop();
int v = pair.second;
if (dist[v] < pair.first) { continue; }
for (Edge edge : G[v]) {
if (dist[v] + edge.cost < dist[edge.to]) {
dist[edge.to] = dist[v] + edge.cost;
que.push(Pair(dist[edge.to], edge.to));
}
}
}
return dist;
}
};
const int MAX_N = 100050;
const int MAX_M = 200050;
int N, M;
int p[MAX_M], q[MAX_M], c[MAX_M];
Direct_Graph graph = Direct_Graph(MAX_N + MAX_M * 2);
std::map<std::pair<int, int>, int> mp;
int main(int argc, char **argv) {
std::cin >> N >> M;
for (int i = 1; i <= M; i++) {
std::cin >> p[i] >> q[i] >> c[i];
}
int idx = N + 1;
for (int i = 1; i <= M; i++) {
if (mp.find(std::pair<int, int>({p[i], c[i]})) == mp.end()) {
mp[std::pair<int, int>({p[i], c[i]})] = idx;
graph.add_edge(p[i], idx, 1);
graph.add_edge(idx, p[i], 0);
idx++;
}
if (mp.find(std::pair<int, int>({q[i], c[i]})) == mp.end()) {
mp[std::pair<int, int>({q[i], c[i]})] = idx;
graph.add_edge(q[i], idx, 1);
graph.add_edge(idx, q[i], 0);
idx++;
}
int node_p = mp[std::pair<int, int>({p[i], c[i]})];
int node_q = mp[std::pair<int, int>({q[i], c[i]})];
//graph.add_edge_both(p[i], q[i], 1);
//graph.add_edge_both(p[i], node_q, 1);
//graph.add_edge_both(node_p, q[i], 1);
graph.add_edge_both(node_p, node_q, 0);
}
std::vector<int> dist = graph.Dijkstra(1, MAX_M * 2);
int ret = dist[N];
/*
for (int i = 1; i <= M; i++) {
if (p[i] == N) {
ret = std::min(ret, dist[mp[std::pair<int, int>({p[i], c[i]})]]);
} else if (q[i] == N) {
ret = std::min(ret, dist[mp[std::pair<int, int>({q[i], c[i]})]]);
}
}
*/
if (ret < MAX_M * 2) {
std::cout << ret << std::endl;
} else {
std::cout << -1 << std::endl;
}
return 0;
}
| #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<map>
using namespace std;
const int maxn=4e6+10;
int n,m,head[maxn*2],cnt,vis[maxn*2],dis[maxn*2],tot=200010;
struct edge
{
int next,to,quan;
} e[maxn*2];
priority_queue<pair<int,int> >q;
map<pair<int,int>,int>mp;
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
inline void add(int from,int to,int quan)
{
e[++cnt].next=head[from];
e[cnt].quan=quan;
e[cnt].to=to;
head[from]=cnt;
}
int bianhao(int x,int y)
{
if(mp.find(make_pair(x,y))!=mp.end())
return mp[make_pair(x,y)];
return mp[make_pair(x,y)]=++tot;
}
int main()
{
n=read(),m=read();
memset(dis,0x3f,sizeof(dis));
for(int i=1; i<=m; i++)
{
int p=read(),q=read(),c=read();
int t1=bianhao(p,c),t2=bianhao(q,c);
add(p,t1,1),add(t1,t2,0),add(t2,q,1);
add(t1,p,1),add(t2,t1,0),add(q,t2,1);
}
dis[1]=0;
q.push(make_pair(0,1));
while(!q.empty())
{
int now=q.top().second;
q.pop();
if(vis[now])
continue;
vis[now]=1;
for(int i=head[now]; i; i=e[i].next)
{
int to=e[i].to;
if(dis[to]>dis[now]+e[i].quan)
{
dis[to]=dis[now]+e[i].quan;
q.push(make_pair(-dis[to],to));
}
}
}
if(dis[n]>1e9+10)dis[n]=-2;
printf("%d",dis[n]/2);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int,int> pii;
const int maxn=2e5+7;
const ll modn=1e9+7;
const int inf=2e9+7;
const double PI = acos(-1.0);
const double eps=1e-8;
inline int lowbit(int x){return x&-x;}
inline ll lowbit(ll x) {return x&-x;}
inline int CountOneBinary(ll num){int ans=0;while(num){if(num&1) ans+=1;num>>=1;}return ans;}
inline void read(int &x){char c;x=0;for(c=getchar();c>'9'||c<'0';c=getchar());for(;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';}
inline void read(ll &x){char c;x=0;for(c=getchar();c>'9'||c<'0';c=getchar());for(;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';}
inline ll qpow(ll x,ll y){ll ans=1;while(y){if(y&1) ans=ans*x%modn;x=x*x%modn;y>>=1;}return ans;}
inline double qpow(double x,ll y){double ans=1;while(y){if(y&1) ans=ans*x;x=x*x;y>>=1;}return ans;}
ll inv[maxn],h,w,a,b;
inline ll C(ll x,ll y)
{
x=min(x,y-x);
ll ans=1;
for(ll up=y,down=1;down<=x;down++,up--) ans=ans*up%modn*inv[down]%modn;
return ans;
}
int main()
{
for(ll i=1;i<maxn;i++) inv[i]=qpow(i,modn-2);
while(scanf("%lld%lld%lld%lld",&h,&w,&a,&b)==4)
{
ll ans=C(h-1,w+h-2);
ll left=C(w-b-1,a+w-b-2),right=C(b-1,h-a+b-1);
while(a)
{
ans=((ans-left*right%modn)%modn+modn)%modn;
left=left*(a-1)%modn*inv[a+w-b-2]%modn;
right=right*(h-a+b)%modn*inv[h-a+1]%modn;
a--;
}
printf("%lld\n",ans);
}
}
| #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a, b) get<a>(b)
#define INF (ll)1e18 + 100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define all(v) v.begin(), v.end()
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define INT_SIZE 32
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define o_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define o_setll tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
ll powM(ll x, ll y, ll m)
{
ll ans = 1, r = 1;
x %= m;
while (r > 0 && r <= y)
{
if (r & y)
{
ans *= x;
ans %= m;
}
r <<= 1;
x *= x;
x %= m;
}
return ans;
}
ll modI(ll a, ll m)
{
ll m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll logint(ll x, ll y)
{
ll ans = 0;
ll a = 1;
for (ll i = 0; i <= x; i++)
{
if (x < a)
{
return ans;
}
ans++;
a *= y;
}
return -1;
}
ll extended(ll a, ll b, ll &x, ll &y)
{
if (a == 0)
{
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = extended(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
ll lcm(ll x, ll y) {
return (x * y) / (__gcd(x, y));
}
void solve() {
ll sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
// int c = 0;
REP(j, sx, tx) {
cout << 'R';
// c++;
}
REP(j, sy, ty) {
cout << 'U';
// c++;
}
REP(j, sx, tx) {
cout << 'L';
// c++;
}
REP(j, sy, ty) {
cout << 'D';
// c++;
}
cout << 'D';
// c++;
REP(j, sx, tx) {
cout << 'R';
// c++;
}
// c++;
cout << 'R';
REP(j, sy, ty) {
// c++;
cout << 'U';
}
cout << 'U';
cout << 'L';
cout << 'U';
// c++;
// c++;
// c++;
REP(j, sx, tx) {
// c++;
cout << 'L';
}
// c++;
cout << 'L';
REP(j, sy, ty) {
cout << 'D';
}
cout << 'D';
cout << 'R';
// string temp = "UURRURRDDDLLDLLULUUURRURRDDDLLDL";
// cout << temp.size() << " " << c;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("b1.in", "r", stdin);
// freopen("output.txt", "w", stdout);
ll ntc;
// cin >> ntc;
ntc = 1;
REP(tc, 1, ntc + 1)
{
// cout << "Case #" << tc << ": ";
solve();
}
}
| 0 |
#include <vector>
#include <iostream>
#include <valarray>
#include <string>
#include <algorithm>
#include <set>
#include <cstdio>
typedef unsigned long long ull;
typedef long long ll;
#define fst first
#define snd second
#define rep(i,n) for(ull i = 0;i<(n);i++)
#define rep1(i,n) for(ull i = 1;i<=(n);i++)
#define revrep(i,n) for(ull i = (n-1);i>=0;i--)
#define all(n) (n).begin(),(n).end()
#define show(x) cout << "debug " << #x << ":" << x << endl;
#define showvec(x) cout << endl << "debug " << #x << ";" << endl; \
for(ull __i = 0;__i < x.size();__i++){ \
for(ull __j = 0;__j<x[0].size();__j++){ \
cout << x[__i][__j] << " "; \
} \
cout << endl; \
} \
cout << endl;
using namespace std;
int f(int x){
return x*x;
}
int main(){
int d;
while(~scanf("%d\n",&d)){
ll sum = 0;
for(int x = d;x <= 600 - d; x += d){
sum += d * f(x);
}
cout << sum << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
string v = "Vacant";
vector<string> s(n);
int l = 0;
int r = n-1;
cout << l << endl;
cin >> s[l];
if(s[l] == v) return 0;
cout << r << endl;
cin >> s[r];
if(s[r] == v) return 0;
while(r-l > 0){
int mid = (l+r) / 2;
cout << mid << endl;
cin >> s[mid];
if(s[mid] == v) return 0;
if(s[mid] == s[l]){
if((mid-l)%2 == 0) l = mid;
else r = mid;
}
else{
if((mid-l)%2 == 0) r = mid;
else l = mid;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<double> VD;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ITER(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cout << #a << " = " << a << endl;
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
inline int add(int x, int y)
{
if (x + y < mod)
return x + y;
return x + y - mod;
}
inline int sub(int x, int y)
{
if (x >= y)
return x - y;
return x - y + mod;
}
inline int mult(int x, int y)
{
return x * (LL) y % mod;
}
inline int power(int x, int y)
{
int r = 1;
while(y)
{
if (y & 1)
r = mult(r, x);
x = mult(x, x);
y >>= 1;
}
return r;
}
inline int inverse(int x)
{
return power(x, mod - 2);
}
const int N = 1 << 22;
int f[N];
int inv[N];
inline int C(int n, int m)
{
int res = f[n];
res = mult(res, inv[m]);
res = mult(res, inv[n - m]);
return res;
}
inline int count(int n, int m)
{
return C(n - 1 + m, m);
}
int jebu(int n, int odd, int m)
{
return count(n, (3 * m - odd) / 2);
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("In.txt", "r", stdin);
//freopen("In.txt", "w", stdout);
int n, m;
cin >> n >> m;
f[0] = 1;
FOR(i, 1, N)
f[i] = mult(f[i - 1], i);
FOR(i, 0, N)
inv[i] = inverse(f[i]);
int ans = count(n, 3 * m);
int tut = 0;
FOR(i, 2 * m + 1, 3 * m + 1)
tut = add(tut, count(n - 1, 3 * m - i));
tut = mult(tut, n);
ans = sub(ans, tut);
int odd = 0;
for(int cnt = m + 2; cnt <= n && cnt <= 3 * m; cnt += 2)
{
int coef = C(n, cnt);
int here = jebu(n, cnt, m);
odd = add(odd, mult(coef, here));
}
ans = sub(ans, odd);
cout << ans << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
| #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " "
#define INF 10000000000
#define LINF 9000000000000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(lli i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
cout << std::fixed << std::setprecision(10);
lli n, m;
cin>>n>>m;
lli l=0,r=INF;
rep(i,m){
lli x,y;
cin>>x>>y;
l=max(l, x);
r=min(y, r);
}
out((r-l+1<0?0:r-l+1));
} | 0 |
#include<iostream>
using namespace std;
int main(){
int n, num[10000];
int max = -1000000, min = 1000000;
long long sum = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> num[i];
if(min > num[i]) min = num[i];
if(max < num[i]) max = num[i];
sum = sum + num[i];
}
cout << min << " " << max << " " << sum << endl;
return 0;
}
| #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int main(){
string s;
cin>>s;
string hitachi="";
for(int i=0;5>i;++i){
hitachi+="hi";
if(hitachi==s){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | 0 |
#include <bits/stdc++.h>
#define gc( ) std::getchar( )
#define pc( i ) std::putchar( i )
template < typename T >
inline T read( )
{
register T x = 0;
register char ch = gc( );
register bool f = 0;
while( !std::isdigit( ch ) )
{
f = ( ch == '-' );
ch = gc( );
}
while( std::isdigit( ch ) )
{
x = x * 10 + ( ch - '0' );
ch = gc( );
}
return f ? -x : x;
}
template < typename T >
void print( T x )
{
if( x < 0 )
{
x = -x;
pc( '-' );
}
if( x < 10 )
{
pc( x + 48 );
return;
}
print < T > ( x / 10 );
pc( x % 10 + 48 );
return ;
}
namespace Solution
{
#define IOS std::ios::sync_with_stdio( false ), std::cin.tie( 0 ), std::cout.tie( 0 )
#define Rep( i, j, k ) for( int i = j; i >= k; --i )
#define rdi( ) read < int > ( )
#define rdl( ) read < long long > ( )
#define pti( i ) print < int > ( i ), putchar( ' ' )
#define ptl( i ) print < long long > ( i ), putchar( ' ' )
#define For( i, j, k ) for( int i = j; i <= k; ++i )
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::map;
using std::queue;
using std::deque;
using std::set;
using std::pair;
const int Maxn = 100001;
int n, bol, L, Q, bl[ Maxn ], x[ Maxn ], to[ Maxn ], nxt[ Maxn ], out[ Maxn ];
int find( int u )
{
int l = u + 1, r = n, ans = u;
while( l <= r )
{
int mid = l + r >> 1;
if( x[ mid ] - x[ u ] <= L )
ans = mid, l = mid + 1;
else
r = mid - 1;
}
return ans;
}
int solve( int l, int r )
{
int res = 0;
while( bl[ l ] < bl[ r ] )
{
res += nxt[ l ];
l = out[ l ];
}
while( l < r )
{
res++;
l = to[ l ];
}
return res;
}
void fakemain( )
{
IOS;
cin >> n;
bol = sqrt( n );
For( i, 1, n )
cin >> x[ i ],
bl[ i ] = ( i - 1 ) / bol + 1;
cin >> L;
For( i, 1, n )
to[ i ] = find( i );
Rep( i, n - 1, 1 )
{
if( to[ i ] == n )
{
out[ i ] = n;
nxt[ i ] = 1;
}
else
{
if( to[ i ] > bol * bl[ i ] )
{
out[ i ] = to[ i ];
nxt[ i ] = 1;
}
else
{
out[ i ] = out[ to[ i ] ];
nxt[ i ] = nxt[ to[ i ] ] + 1;
}
}
}
cin >> Q;
int l, r;
while( Q-- )
{
cin >> l >> r;
if( l > r )
std::swap( l, r );
cout << solve( l, r ) << '\n';
}
return;
}
} // namespace Solution
int main( int argc, char* argv[] )
{
Solution::fakemain( );
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
const ll MAX = 50;
ll N;
ll X[100005];
ll D[100005][MAX];
ll solve(ll a, ll b) {
if (a > b)
swap(a, b);
ll ret = 0;
for (ll x = MAX - 1; x >= 0; --x) {
ll nxt = D[a][x];
if (nxt < 0 || nxt > b)
continue;
ret |= (1LL << x);
a = nxt;
}
if (a < b)
ret++;
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
REP(i, N) {
cin >> X[i];
}
ll L;
cin >> L;
memset(D, -1, sizeof(D));
ll n = 0;
REP(i, N - 1) {
while (n < N && X[n + 1] - X[i] <= L)
n++;
D[i][0] = n;
}
FOR(x, MAX, 1) {
REP(i, N - 1) {
if (D[i][x - 1] < 0)
continue;
D[i][x] = D[D[i][x - 1]][x - 1];
}
}
ll Q;
cin >> Q;
REP(_, Q) {
ll a, b;
cin >> a >> b;
cout << solve(a - 1, b - 1) << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >> A >> B >> C >> D;
if(A+B > C+D)
cout << "Left" << endl;
if(A+B == C+D)
cout << "Balanced" << endl;
if(A+B < C+D)
cout << "Right" <<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define re register
#define il inline
#define inf 0x3f3f3f
#define maxn 1000005
int n, pos, ans, head, tail;
int q[maxn];
char s[maxn], t[maxn];
int main() {
scanf("%d%s%s", &n, s + 1, t + 1);
if (strcmp(s + 1, t + 1) == 0) {
putchar('0');
return 0;
}
pos = n;
head = 1;
tail = 0;
for (int i = n; i >= 1; i--) {
if (t[i] == t[i - 1])
continue;
pos = min(pos, i);
while (pos && t[i] != s[pos])
pos--;
if (pos == 0) {
putchar('-');
putchar('1');
return 0;
}
while (head <= tail) {
if (q[head] - (tail - head + 1) + 1 > i)
head++;
else
break;
}
q[++tail] = pos;
if (i != pos)
ans = max(ans, tail - head + 1);
}
printf("%d\n", ans + 1);
return 0;
}
| 0 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <sstream>
#include <assert.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(bool x) {cerr << (x ? "true" : "false");}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";}
template <typename T, typename... V>void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef HOME
#warning CHECK int:ll::INT_MAX:LLONG_MAX
#define maxn 20
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define maxn 2000006
#define gcd __gcd
#define debug(x...)
#endif
#define ff first
#define endl '\n'
#define ss second
#define inf 0x3f3f3f3f
#define MOD 1000000007
#define PI 3.14159265358979323846264338327950L
#define f(i,x,n) for(int i=x;i<=n;i++)
#define fr(i,x,n) for(int i=x;i>=n;i--)
struct _ { ios_base::Init i; _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); } } _;
int dx[] = { -1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
int main() {
int n, l; cin >> n >> l;
int t = (n * (2 * l + (n - 1))) / 2;
debug(t);
int i = min(n, max(1, 1 - l));
int q1 = (l + max(1, (i - 1)) - 1);
int q2 = (l + i - 1);
int q3 = (l + min(n, (i + 1)) - 1);
debug(i, q2, q2, q3);
int min_diff = min({abs(q1), abs(q2), abs(q3)});
if (abs(q1) == min_diff) cout << t - q1;
else if (abs(q2) == min_diff) cout << t - q2;
else cout << t - q3;
return 0;
} | #include <bits/stdc++.h>
typedef long long LL;
const int N = 2e3, M = 4e6, MOD = 1e9 + 7;
int n, k, f[N + 5][N + 5], fac[M + 5], ifac[M + 5];
inline void add(int &x, const int &y) {
(x += y) >= MOD && (x -= MOD);
}
inline int pow(int x, int k) {
int ans = 1;
for (; k > 0; k >>= 1, x = (LL)x * x % MOD) {
if (k & 1) {
ans = (LL)ans * x % MOD;
}
}
return ans;
}
inline int inv(int x) {
return pow(x, MOD - 2);
}
void init(int n) {
fac[0] = 1;
for (int i = 1; i <= n; i++) {
fac[i] = (LL)fac[i - 1] * i % MOD;
}
ifac[n] = inv(fac[n]);
for (int i = n; i >= 1; i--) {
ifac[i - 1] = (LL)ifac[i] * i % MOD;
}
}
inline int binom(int n, int m) {
return (LL)fac[n] * ifac[m] % MOD * ifac[n - m] % MOD;
}
int main() {
scanf("%d%d", &n, &k);
if (k == 1) {
printf("1\n");
return 0;
}
init(n * k);
f[0][0] = 1;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n && j <= i; j++) {
if (i < n) {
add(f[i + 1][j], f[i][j]);
}
if (j < n) {
add(f[i][j + 1], (LL)f[i][j] * (n - j) % MOD * binom(n * k - i - j * (k - 1) - 1, k - 2) % MOD);
}
}
}
printf("%d\n", f[n][n]);
return 0;
} | 0 |
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, ll B, ll C, ll D) {
cout << min(A,B) + min(C,D) << endl;
}
int main() {
ll A;
cin >> A;
ll B;
cin >> B;
ll C;
cin >> C;
ll D;
cin >> D;
solve(A, B, C, D);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(void){
int AB[2], CD[2], value;
for(int i = 0; i < 2; i++)
cin >> AB[i];
for(int i = 0; i < 2; i++)
cin >> CD[i];
sort(begin(AB), end(AB));
sort(begin(CD), end(CD));
value = AB[0] + CD[0];
cout << value << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
// get abs
ll my_abs(ll a);
// a^n
ll a_n(ll a, ll n);
// get gcd
ll my_gcd(ll a, ll b);
// a^(-1) % MOD
ll inv(ll a);
// (a+b+c)%MOD
ll madd(ll a, ll b, ll c);
// (a-b)%MOD
ll msub(ll a, ll b);
// (a*b*c)%MOD
ll mtime(ll a, ll b, ll c);
int main() {
ll h, w, ans = 0; cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<bool>> used(h, vector<bool>(w, false));
rep(i, h) {
rep(j, w) {
// スタート地点
if(s[i][j] == '.' && !used[i][j]) {
ll wh = 0, bl = 0; // 白と黒
wh++;
queue<P> que;
que.push(make_pair(i, j));
used[i][j] = true;
// 幅優先
while(!que.empty()) {
P t = que.front();
que.pop();
ll x = t.first, y = t.second;
if(x > 0) if(!used[x-1][y] && s[x][y] != s[x-1][y]) {
used[x-1][y] = true;
que.push(make_pair(x-1, y));
if(s[x-1][y] == '.') wh++;
else bl++;
}
if(x < h-1) if(!used[x+1][y] && s[x][y] != s[x+1][y]) {
used[x+1][y] = true;
que.push(make_pair(x+1, y));
if(s[x+1][y] == '.') wh++;
else bl++;
}
if(y > 0) if(!used[x][y-1] && s[x][y] != s[x][y-1]) {
used[x][y-1] = true;
que.push(make_pair(x, y-1));
if(s[x][y-1] == '.') wh++;
else bl++;
}
if(y < w-1) if(!used[x][y+1] && s[x][y] != s[x][y+1]) {
used[x][y+1] = true;
que.push(make_pair(x, y+1));
if(s[x][y+1] == '.') wh++;
else bl++;
}
}
ans += bl*wh;
}
}
}
cout << ans << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <string>
#include <iomanip>
using namespace std;
int main(){
int h,w;
char c[400][400];
cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c[i][j];
}
}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int cnt=0;
int id[400][400];
bool used[400][400]={};
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(used[i][j]){
continue;
}
id[i][j]=cnt;
used[i][j]=1;
queue<pair<int,int> > que;
que.push(make_pair(i,j));
while(!que.empty()){
int x=que.front().first;
int y=que.front().second;
que.pop();
for(int i=0;i<4;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if(0<=nx&&nx<h&&0<=ny&&ny<w&&!used[nx][ny]){
if(c[nx][ny]!=c[x][y]){
used[nx][ny]=1;
id[nx][ny]=cnt;
que.push(make_pair(nx,ny));
}
}
}
}
cnt++;
}
}
long long sum[160001][2]={};
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(c[i][j]=='#'){
sum[id[i][j]][0]++;
}else{
sum[id[i][j]][1]++;
}
}
}
long long ans=0;
for(int i=0;i<cnt;i++){
ans+=sum[i][0]*sum[i][1];
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define ffr(i,a,b) for(i=a;i<b;i++)
#define ffrr(i,a,b) for(i=a;i<=b;i++)
#define ll long long int
#define pf printf
#define mp make_pair
#define mm(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define MMAX 200005
using namespace std;
int minn(int a, int b)
{
if(a<b) return a; return b;
}
int main(){
ll n, i, j, sum=0, ans=0, a, b, c, MOD=200003, sz, num, cur;
string s;
map< pair<ll,ll>, ll > mpp; mpp.clear();
cin >> n;
ffr(j,0,n){
cin >> s;
i=0; sz=s.size(); num=0;
while(i<sz && s[i]!='.'){
cur = s[i]-'0';
num*=10; num+=cur;
i++;
}
i++;
a=b=c=0;
while(i<sz){
cur = s[i]-'0';
num*=10; num+=cur;
i++;
c++;
}
while(1){
if(num&1) break;
else{
num>>=1;
a++;
}
}
while(1){
if(num%5>0) break;
else{
num/=5;
b++;
}
}
mpp[mp(a-c,b-c)]++;
}
for(auto i:mpp){
//if(i.first.first<0) continue;
for(auto j:mpp){
//if(j.first.first>0) continue;
if(i==j) continue;
if(i.first.first+j.first.first>=0 && i.first.second+j.first.second>=0) ans+=(i.second*j.second);
}
if(i.first.first>=0 && i.first.second>=0)
{
cur = i.second;
ans+= (cur*cur-cur);
}
}
cout << ans/2 << endl;
}
| #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T>
bool chmin(T& a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
};
template <typename T>
bool chmax(T& a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
};
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
for(int i = 0; i < v.size(); i++) {
os << v[i] << (i + 1 == v.size() ? "\n" : " ");
}
return os;
}
template <typename T>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
for(auto& e : t) {
fill_v(e, v);
}
};
struct UnionFind {
vector<int> par, siz;
UnionFind(int n) {
par.resize(n);
siz.resize(n, 1);
for(int i = 0; i < n; i++)
par[i] = i;
}
int find(int x) {
if(par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
bool unite(int u, int v) {
u = find(u), v = find(v);
if(u == v)
return false;
if(siz[u] < siz[v])
swap(u, v);
par[v] = u;
siz[u] += siz[v];
return true;
}
bool same(int u, int v) { return find(u) == find(v); }
};
struct edge {
ll u, v, cost;
bool operator<(const edge& e) { return cost < e.cost; }
};
ll d;
vector<ll> a;
vector<edge> es;
void calc(int l, int r) {
if(r - l <= 1) {
return;
}
int m = (l + r) / 2;
ll mi = LINF, s, t;
for(ll i = l; i < m; i++) {
ll k = -i * d + a[i];
if(mi > k) {
mi = k;
s = i;
}
}
mi = LINF;
for(ll i = m; i < r; i++) {
ll k = i * d + a[i];
if(mi > k) {
mi = k;
t = i;
}
}
for(ll i = l; i < m; i++) {
es.push_back({i, t, (t - i) * d + a[t] + a[i]});
}
for(ll i = m; i < r; i++) {
es.push_back({s, i, (i - s) * d + a[i] + a[s]});
}
calc(l, m);
calc(m, r);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n >> d;
a.resize(n + 1);
for(ll i = 1; i <= n; i++) {
cin >> a[i];
}
calc(1, n + 1);
UnionFind uf(n + 1);
sort(all(es));
ll ans = 0;
for(auto e : es) {
if(uf.unite(e.u, e.v)) {
ans += e.cost;
}
}
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <utility>
#include <functional>
using namespace std;
#define LEN 1000000
char str[LEN];
int cnt[LEN];
int main() {
char ch;
int s = -1, ans = 0;
while (cin >> ch) {
if (str[s] != ch) {
s++;
}
str[s] = ch;
cnt[s]++;
}
for (int i = 0; i + 2 <= s; ++i) {
if (str[i] == 'J' && str[i + 1] == 'O' && str[i + 2] == 'I') {
if (cnt[i + 1] <= cnt[i] && cnt[i + 1] <= cnt[i + 2]) {
ans = max(ans, cnt[i + 1]);
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
using namespace std;
#define MAX 1000000010
int solve(string str){
int a[3] = {0, 0, 0}, ans = 0;
for(int i = 0;i < str.size();i++){
if(str[i] == 'J'){
if(a[1] || a[2])a[0] = a[1] = a[2] = 0;
if(!a[1] && !a[2])a[0]++;
}else if(a[0] && str[i] == 'O'){
if(!a[2])a[1]++;
else a[0] = a[1] = a[2] = 0;
}else if(a[0] && a[1] && a[0] >= a[1] && str[i] == 'I'){
a[2]++;
if(a[1] == a[2])ans = max(a[1], ans);
}else{
a[0] = a[1] = a[2] = 0;
}
}
return ans;
}
int main(){
string str;
cin >> str;
cout << solve(str) << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
using Graph = vector<vector<int>>;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
struct edge{ll to, cost;};
typedef pair<ll,ll> P;
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<P,vector<P>, greater<P> > que;
que.push(P(0,s));
while(!que.empty()){
P p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
};
int main(){
ll n; cin>>n;
ll a[n]={};
ll b[65]={};
rep(i,n){
cin>>a[i];}
ll ans = 0;
rep(i,n){
bitset<61> s(a[i]);
rep(j,61){
if(s.test(j))b[j]++;}
}
ll k = 1;
rep(i,61){
ll m = b[i]*(n-b[i]);
m%=MOD;
ans += m*k;
k*=2;
k%=MOD;
ans%=MOD;}
cout << ans << endl;}
| #include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (int i = 0; i < v.size(); i++) {
if (i) os << ", ";
os << v[i];
}
os << "}";
return os;
}
int main()
{
ll mod = TEN(9) + 7;
int n;
cin >> n;
vector<ll> a(n, 0);
ll a_max = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
a_max = max(a_max, a[i]);
}
ll y = 1; int log_a_max = 0;
while (y < a_max) {
y *= 2;
log_a_max++;
}
vector<vector<bool>> p(n, vector<bool>(log_a_max, 0));
vector<int> s(log_a_max, 0);
for (int i = 0; i < n; i++) {
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < log_a_max; j++) {
s[j] += (a[i] >> j) & 1;
}
}
ll sum = 0;
ll x = 1;
for (int j = 0; j < log_a_max; j++) {
for (int i = 0; i < n; i++) {
if (a[i] >> j & 1) {
sum += x * (n - s[j]);
} else {
sum += x * s[j];
}
sum %= mod;
}
x *= 2;
x %= mod;
}
cout << sum * ((mod + 1) / 2) % mod << endl;
return 0;
}
| 1 |
#include <iostream>
using namespace std;
const int BASE = 6200;
int N, mod;
int dp[6009][12409][3];
long long ret[12409];
void solve(int p1, int p2) {
// 最大値を更新する場合
for (int i = 0; i <= 2; i++) {
int r = 0;
if (i == 0) r = -1;
if (i == 1) r = 1;
dp[p1][p2][0] += 1LL * dp[p1 - 1][p2 - r][i] % mod;
if (dp[p1][p2][0] >= mod) dp[p1][p2][0] -= mod;
}
// 最大値を更新しない場合
for (int i = 1; i <= 2; i++) {
dp[p1][p2][i] += 1LL * (p1 - 1LL) * dp[p1 - 1][p2][i - 1] % mod;
if (dp[p1][p2][i] >= mod) dp[p1][p2][i] -= mod;
}
}
int main() {
cin >> N >> mod;
dp[1][BASE][0] = 1;
for (int i = 2; i <= 3 * N; i++) {
for (int j = 1; j <= BASE * 2 - 1; j++) {
solve(i, j);
}
}
for (int i = 1; i <= BASE * 2 - 1; i++) {
for (int j = 0; j <= 2; j++) {
int r = 0;
if (j == 0) r = -1;
if (j == 1) r = 1;
ret[i + r] += dp[3 * N][i][j];
}
}
long long Answer = 0;
for (int i = 0; i <= BASE; i++) Answer += ret[i];
cout << Answer % mod << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
using namespace std;
const int MAX = 7000;
// fac[]・・・a! finv[]・・・(a!)^(-1) inv[]・・・a^(-1)
long long N, M, ans, fac[MAX], finv[MAX], inv[MAX], two[MAX], six[MAX];
void pre_comb(void){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
two[0] = 1; two[1] = 2;
six[0] = 1; six[1] = 6;
for(int i=2; i<MAX; i++){
fac[i] = fac[i-1] * i % M;
inv[i] = M - inv[M % i] * (M/i) % M;
finv[i] = finv[i-1] * inv[i] % M;
two[i] = two[i-1] * 2 % M;
six[i] = six[i-1] * 6 % M;
}
}
long long 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] % M) % M;
}
long long mpow(long long n, long long r){
if(r == 1) return n;
if(r % 2 == 1) return n * mpow(n, r-1) % M;
else{
long long a = mpow(n, r/2);
return a * a % M;
}
}
long long inve(long long n){
return mpow(n, M-2);
}
int main(){
cin >> N >> M;
pre_comb();
rep(i, N+1){
rep(j, (3*N/2)+1){
if(3*N - 2*j - 3*i >= j){
long long t1 = (fac[3*N] * finv[3*N-3*i-2*j] % M) * two[i] % M;
long long t2 = t1 * inve(six[i] * two[j] % M) % M;
ans = (ans + (t2 * finv[i] % M) * finv[j] % M) % M;
}
}
}
cout << ans << "\n";
return 0;
}
| 1 |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
#include <bits/stdc++.h>
// #include <atcoder/all>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
// using namespace atcoder;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vb = vector<bool>;
using qi = queue<int>;
using P = pair<int, int>;
using graph = vector<vector<edge>>;
// using graph = vector<vector<int>>;
// using mint = modint1000000007;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define REP(i,n) for(int i=0;i<n;i++)
#define delim(i, n) cout << (i == n-1 ? "\n" : " ")
#define print1(v) cout << fixed << setprecision(10) << v << "\n"
#define print2(v1, v2) cout << fixed << setprecision(10) << v1 << " " << v2 << "\n"
#define print3(v1, v2, v3) cout << fixed << setprecision(10) << v1 << " " << v2 << " " << v3 << "\n"
#define printvi(v, n) REP(iiii, n) { cout << v[iiii]; delim(iiii, n); }
#define printvii(v, h, w) REP(iiiii, h) { printvi(v[iiiii], w); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int inf = 1LL << 60;
// const int inf = 100000000;
const int mod = 1000000007;
const int maxn = 1e5+5;
int n, m;
vi color(3);
vi dx = {-1, 0, 0, 1};
vi dy = {0, -1, 1, 0};
signed main () {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> m;
int cntc = -1;
int cnt9 = -1;
REP(i, m) {
int d, c; cin >> d >> c;
cntc += c;
cnt9 += d*c;
}
int ret = cntc + (cnt9/9);
print1(ret);
} | #include<cstdio>
#include<iostream>
#include<ctype.h>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
int people[21], Total, Total2;
for (int i = 0; i < 20; i++){
cin >> people[i];
}
sort(people, people + 10,greater<int>());
sort(people + 10, people + 20,greater<int>());
Total = people[0] + people[1] + people[2];
Total2 = people[10] + people[11] + people[12];
cout << Total <<" "<< Total2 << endl;
return 0;
} | 0 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
using namespace std;
#define int long long
int gcd(int a,int b){
return b ? gcd(b, a % b) : a;
}
int lcm(int a,int b){
return b / gcd(a,b) * a;
}
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int x,y; cin >> x >> y;
if(y >= x && y >0 && x < 0 && abs(y)> abs(x)) cout << 1 + y + x << endl;
else if(y >= x && y >0 && x < 0) cout << -y - x + 1 << endl;
else if(y >= x) cout << y - x << endl;
else if(y > 0) cout << 1 - y + x + 1 << endl;
else if(y == 0) cout << 1 + x << endl;
else if(x >= 0 && abs(x) >= abs(y)) cout << 1 + abs(x) - abs(y) << endl;
else if(x >= 0) cout << abs(y) - abs(x) + 1 << endl;
else if(x > y)cout << 1 + abs(y) - abs(x) + 1 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int x, y;
cin >> x >> y;
vector <int> c;
c.app(x);
c.app(-x);
c.app(y);
c.app(-y);
const int INF = 5e18;
vector <int> d(4, INF);
d[0] = 0;
for (int t = 0; t < 10; ++t) {
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
if (c[i] <= c[j])
d[j] = min(d[j], d[i] + c[j] - c[i]);
if (c[j] == -c[i])
d[j] = min(d[j], d[i] + 1);
}
}
}
cout << d[2] << endl;
} | 1 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int inf = INT_MAX;
const int MOD = 1000000007;
const long long INF = LLONG_MAX;
// -------------------------------------------------------
int sx, sy, tx, ty;
int main() {
cin >> sx >> sy >> tx >> ty;
int dx = tx - sx;
int dy = ty - sy;
rep(i, 0, dy) { cout << "U"; }
rep(i, 0, dx) { cout << "R"; }
rep(i, 0, dy) { cout << "D"; }
rep(i, 0, dx) { cout << "L"; }
cout << "L";
rep(i, 0, dy + 1) { cout << "U"; }
rep(i, 0, dx + 1) { cout << "R"; }
cout << "D";
cout << "R";
rep(i, 0, dy + 1) { cout << "D"; }
rep(i, 0, dx + 1) { cout << "L"; }
cout << "U";
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int sx, sy;
cin >> sx >> sy;
int tx, ty;
cin >> tx >> ty;
int dx = tx - sx, dy = ty - sy;
cout << string(dy, 'U');
cout << string(dx, 'R');
cout << string(dy, 'D');
cout << string(dx, 'L');
cout << 'L';
cout << string(dy+1, 'U');
cout << string(dx+1, 'R');
cout << "DR";
cout << string(dy+1, 'D');
cout << string(dx+1, 'L');
cout << "U" << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr ll INF = (1LL << 60);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<ll> dp(2, -INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
vector<ll> ndp(2, -INF);
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k++) {
int d = (j ^ k ? -a[i] : a[i]);
ndp[k] = max(ndp[k], dp[j] + d);
}
}
dp = move(ndp);
}
cout << dp[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b,c,k;
int64_t target;
int64_t remains;
cin >> a >> b >> c >> k;
target = max(a,max(b,c));
remains = a + b + c - target;
target = target * pow(2,k);
cout << target + remains << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a;
cin>>a;
if(a==1){
cout<<"Hello World"<<endl;
return 0;
}
ll b,c;
cin>>b>>c;
cout<<b+c<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define wi(t) int t;cin>>t;while(t--)
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0,lim-1);
return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
//=======================
vi g[N];
int a[N];
void solve()
{
string s;
cin>>s;
string ans;
int diff=INT_MAX;
for(int i=0;i<3;i++)
ans+=s[i];
diff=min(diff,abs(stoi(ans)-753));
for(int i=3;i<s.length();i++)
{
ans.erase(ans.begin());
ans.pb(s[i]);
diff=min(diff,abs(stoi(ans)-753));
}
cout<<diff<<endl;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
// wi(t)
{
solve();
}
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m){
int i, u, v;
while(m--){
cin>>u>>v;
u--, v--;
g[u].pb(v);
g[v].pb(u);
}
}
void dfs(int u, int par){
for(int v:g[u]){
if (v == par) continue;
dfs(v, u);
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll H,W;
cin >>H>>W;
vector<vector<bool>>S(H+2,vector<bool>(W+2));
rep2(i,H){
rep2(j,W){
char c;
cin>>c;
if(c=='#'){
S[i][j]=1;
}
}
}
rep2(i,H){
rep2(j,W){
if(S[i][j]==1){
rep(dir,4){
if(S[i+dx[dir]][j+dy[dir]]){
break;
}
if(dir==3){
cout<<"No"<<endl;
return 0;
}
}
}
}
}
cout << "Yes" << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SORT(list) sort(ALL((list)));
#define MOD 1000000007
using namespace std;
using ll = long long;
int main(){
ll x,y;
cin >> x >> y;
if(x*y > 0){
if(x > y){
cout << min(llabs(x)+llabs(y)+1,llabs(llabs(x)-llabs(y))+2)<< endl;
}else{
cout << y - x << endl;
}
}else if(x*y < 0){
cout << llabs(llabs(x)-llabs(y))+1 << endl;
}else{
if(x == y){
cout << 0 << endl;
}else if(x == 0){
if(y > 0){
cout << y << endl;
}else{
cout << llabs(y)+1 << endl;
}
}else{
if(x > 0){
cout << x+1 << endl;
}else{
cout << -x << endl;
}
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,x,n) for(ll i=x;i<n;i++)
#define sort(v) sort(v.begin(),v.end());
const ll mod = 1E9+7;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
swap(a,b);
swap(a,c);
cout<<a<<" "<<b<<" "<<c;
} | #include <stdio.h>
#include <string.h>
int main (){
char d[14], e[14], f[14];
scanf ("%s %s %s", &d, &e, &f);
if ( d[strlen(d) - 1] == e[0] && e[strlen(e) - 1] == f[0]){
puts ("YES\n");
}else {
puts ("NO\n");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
vector<string> a;
string hoge="hi";
a.push_back(hoge);
for(int i=0;i<4;i++){
hoge=hoge+"hi";
a.push_back(hoge);
}
for(int i=0;i<5;i++){
if(a[i]==s){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
char S[15];
int main(){
scanf(" %s", S);
int len = strlen(S);
if(len%2 != 0){
printf("No");
return 0;
}
for(int i = 0; i < len; i ++){
if(i%2 == 0 && S[i] != 'h'){
printf("No");
return 0;
}
if(i%2 == 1 && S[i] != 'i'){
printf("No");
return 0;
}
}
printf("Yes");
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main () {
int n;
vector<int> values;
cin >> n;
cin.ignore();
for (int i = 1; i <= n; i++){
string tmp_value;
if(i == n)
getline(cin, tmp_value);
else
getline(cin, tmp_value, ' ');
values.push_back(stoi(tmp_value));
}
for (int i = n; i != 0; i--){
if (i == 1)
cout << values[i - 1] << endl;
else
cout << values[i - 1] << ' ';
}
return 0;
}
| #include<iostream>
using namespace std;
int main(){
int n, A[100];
cin >> n;
for ( int i = 0; i < n; i++ ) cin >> A[i];
for ( int i = n-1; i >= 0; i-- ) {
if ( i != n-1 ) cout << " ";
cout << A[i];
}
cout << endl;
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 rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
const int MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
int res = 1001001001;
int cnt;
rep(i, n)
{
cnt = 0;
while (v[i] % 2 == 0)
{
cnt++;
v[i] /= 2;
}
res = min(res, cnt);
}
cout << res << endl;
return (0);
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define MOD 1000000007
#define INF 1e9
#define PIE 3.14159265358979323
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;
}
template <class T>
T GCD(T a, T b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
template <class T>
inline T LCM(T a, T b) {
return (a * b) / GCD(a, b);
}
#define int long long
signed main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<int> odd;
vector<int> even;
rep(i, n) {
if (i % 2)
odd.push_back(v[i]);
else
even.push_back(v[i]);
}
map<int, int> o;
map<int, int> e;
rep(i, n / 2) o[odd[i]]++;
rep(i, n / 2) e[even[i]]++;
int ofreq = 0, osfreq = 0;
int efreq = 0, esfreq = 0;
int o1, e1, o2, e2;
for (auto c : o) {
if (c.second > ofreq) {
o2 = o1;
o1 = c.first;
osfreq = ofreq;
ofreq = c.second;
}
else if (c.second > osfreq) {
osfreq = c.second;
o2 = c.first;
}
}
for (auto c : e) {
if (c.second > efreq) {
e2 = e1;
e1 = c.first;
esfreq = efreq;
efreq = c.second;
}
else if (c.second > esfreq) {
esfreq = c.second;
e2 = c.first;
}
}
if (o1 != e1)
cout << n - ofreq - efreq;
else
cout << n - max(ofreq + esfreq, osfreq + efreq);
cout << endl;
} | 0 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main (void){
int r;
cin >> r;
if(2800 <= r){
cout << "AGC" << endl;
}else if(1200 <= r){
cout << "ARC" << endl;
}else{
cout << "ABC" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod - a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint& operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream & is, const mint & a) { return is >> a.x; }
ostream& operator<<(ostream & os, const mint & a) { return os << a.x; }*/
int main() {
int r;
cin >> r;
if (r < 1200)
cout << "ABC" << endl;
else if (r < 2800)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
return 0;
}
/*���C�u�����ő����*/
//���[�O���b�h�̌ݏ��@
int gcd(int x, int y) {
int num[3];
num[0] = (x > y) ? x : y;
num[1] = (x <= y) ? x : y;
num[2] = num[0] % num[1];
while (num[2]) {
num[0] = num[1];
num[1] = num[2];
num[2] = num[0] % num[1];
}
return num[1];
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; ++i)
{
if (A % 2 == 1)
{
--A;
}
B += A / 2;
A = A / 2;
++i;
if (i >= K)
{
break;
}
if (B % 2 == 1)
{
--B;
}
A += B / 2;
B = B / 2;
}
cout << A << " " << B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> AB(2);
for (int i=0;i<2;++i) cin >> AB[i];
int K; cin >> K;
for (int i=0;i<K;++i){
if (AB[i&1]&1) --AB[i&1];
AB[(i&1)^1]+=AB[i&1]/2;
AB[i&1]/=2;
}
cout << AB[0] << ' ' << AB[1] << '\n';
} | 1 |
#include <iostream>
//#include<stack>
#include<set>
#include<bits/stdc++.h>
using namespace std;
//int f[10005];
//int chazhao(int x)
//{
// if(x==f[x])
// return x;
// else
// return f[x]=chazhao(f[x]);
//}
int main()
{
set<int >ss;
int n,x;
cin>>n>>x;
ss.insert(x);
for(int i=1;i<n;i++)
{
cin>>x;
if(ss.count(x)==0)
ss.insert(x);
else
continue;
}
int k=ss.size();
if(k==n)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
int main()
{
Tayeb;
int N,count=0;
cin >> N;
int arr[N];
for(int i=0; i<N; i++)
{
cin >> arr[i];
}
sort(arr,arr+N);
for(int i=1; i<N; i++)
{
if(arr[i]==arr[i-1])
count++;
}
if(count==0)
cout << "YES" << "\n";
else
cout << "NO" << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second
#define set20 cout<<fixed<<setprecision(20) ;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
double pi=acos(-1) ;
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 ; cin>> n ;
vector<string> A(n) ;
rep(i,n) cin>>A[i] ;
vector<ll> sum(n) ,sa(n) ;
rep(i,n){
ll k= A[i].size() ;
ll now=0 ;
ll ans=0 ;
rep(j,k){
if(A[i][j]==')') now-- ;
else now++ ;
chmin(ans,now) ;
}
sum[i]= now ;
sa[i]= ans ;
}
vector<P> B, D ;
ll zero =0 ;
rep(i,n){
if(sum[i]>0){
P xx= mpa(sa[i],sum[i]) ;
B.pb(xx) ;
}
if(sum[i]==0) chmin(zero,sa[i]) ;
if(sum[i]<0){
P yy= mpa(sum[i]-sa[i],sum[i]) ;
D.pb(yy) ;
}
}
sort(B.rbegin(),B.rend()) ;
sort(D.begin(),D.end()) ;
ll ok= B.size() ;
ll ko= D.size() ;
ll start= 0 ;
bool flag= 0;
rep(i,ok){
if(start+ B[i].fi<0) flag=1;
start+= B[i].se ;
}
if(start+zero<0) flag=1 ;
ll goal =0 ;
rep(i,ko){
if(goal-D[i].fi<0) flag=1 ;
goal -= D[i].se ;
}
if(start!=goal) flag=1 ;
if(flag) cout<<"No"<<endl ;
else cout<<"Yes"<<endl ;
return 0 ;
}
| #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, i, a[210];
cin >> n;
n *= 2;
for (i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int b = 0, c = 0;
for (i = 0; i < n; i += 2) {
b += a[i];
}
for (i = 1; i < n - 1; i += 2) {
c += a[i];
}
//c += a[0];
cout << max(b, c) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[101];
int main() {
int n;
while(scanf("%d",&n),n) {
vector<int> key;
for(int i=0;i<n;i++) {
int k;
scanf("%d",&k);
key.push_back(k);
}
scanf("%s",s);
for(int i=0;s[i]!='\0';i++) {
int code=0;
if('a'<=s[i]&&s[i]<='z') code=s[i]-'a';
if('A'<=s[i]&&s[i]<='Z') code=26+s[i]-'A';
code-=key[i%key.size()];
while(code<0) code+=52;
code%=52;
if(0<=code&&code<=25) putchar('a'+code);
if(26<=code&&code<=51) putchar('A'+code-26);
}
putchar('\n');
}
} | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
int main(){
int n,m;
while(cin>>n>>m,n+m){
vector<int>ve(n);
ll ans=0;
for(int i=0;i<n;i++){
cin>>ve[i];ans+=ve[i];
}
sort(ve.begin(),ve.end(),greater<int>());
for(int i=m-1;i<n;i+=m)
ans-=ve[i];
cout<<ans<<endl;
}
return 0;
}
| 0 |
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <iomanip>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define rep(a,t) for(int a=0;a<t;a++)
#define forever while(true)
#define Sort(a) sort(a.begin(),a.end())
#define Reverse(a) reverse(a.begin(),a.end())
#define pb push_back
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
rep(i, n) {
int base[3];
int cnt = 0;
int out = 0;
rep(i123, 3) { base[i123] = 0; }
while (true) {
string thistime;
cin >> thistime;
if (thistime == "HIT") {
cnt += base[2];
base[2] = base[1];
base[1] = base[0];
base[0]=1;
}
else if (thistime == "OUT") {
out++;
if (out == 3) { break; }
}
else {
cnt += base[2] + base[1] + base[0] + 1;
base[2] = base[1] = base[0] = 0;
}
}
cout << cnt << endl;
}
return 0;
}
| #include <iostream>
#include <sstream>
using namespace std;
int main(){
string result[3]={"HIT", "HOMERUN" , "OUT"};
string eventlist;
int inning,run;
int count = 0;
int score;
while(cin >> inning){
for(int i=0;i<inning;i++){
run = 0; score = 0;
for(count=0;count < 3;){
cin >> eventlist;
// cout << eventlist << endl;
if(eventlist == result[0]){
score += (run/4);
run = (2 * run + 1) % 8;
// cout << run << "H" << score << endl;
}
else if(eventlist == result[1]){
for(int j = 0;j < 3;j++){
score += run % 2;
run = run /2;
}
run = 0;
score++;
// cout << " " << score << endl;
}
else{
count++;
// cout << "o" << count << endl;
}
}
cout << score << endl;
}
}
} | 1 |
#include<iostream>
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
sum=n+(n*n)+(n*n*n);
cout<<sum;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int digit(long long int a)
{
int ans = 0;
while(a > 0){
a/=10;
ans++;
}
return ans;
}
int main() {
int i;
int count = 1;
long long int N, A = 1, B;
int ans = 15;
cin >> N;
while ((double)A <= sqrt((double)N))
{
if (N % A == 0)
{
B = N/A;
count = max(digit(A),digit(B));
if (ans > count)
{
ans = count;
}
}
A++;
}
cout << ans <<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
class RUQ{
public:
int t[555555],v[555555],c;
void init(){
c=0;
memset(t,0,sizeof(t));
memset(v,0,sizeof(v));
}
void update(int a,int b,int x) {
c++;
v[c]=x;
update2(a,b,c);
}
void update2(int a,int b,int x,int k=0,int l=0,int r=1<<18){
if(b<=l||r<=a)return;
if(a<=l&&r<=b){t[k]=max(t[k],x);return;}
int m=(l+r)/2;
update2(a,b,x,k*2+1,l,m);
update2(a,b,x,k*2+2,m,r);
}
int query(int i){
i+=(1<<18)-1;
int res=t[i];
while(i){
i=(i-1)/2;
res=max(res,t[i]);
}
return v[res];
}
};
void Main() {
int n,m;
cin >> n >> m;
RUQ r;
r.init();
r.v[0]=INT_MAX;
while(m--) {
int z,x;
cin >> z >> x;
if(!z) {
int y,w;
cin >> y >> w;
r.update(x,y+1,w);
} else pr(r.query(x));
}
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
| #include<bits/stdc++.h>
using namespace std;
const int MAX_N = 1 << 18;
#define int long long
typedef pair<int,int> P;
int n;
P dat[2*MAX_N-1];
void init(int n_){
n=1;
while(n<n_) n*=2;
for(int i=0;i<2*n-1;i++) dat[i].first=-1,dat[i].second=INT_MAX;
}
int query(int k){
k+=n-1;
P p=dat[k];
//cout<<k<<"/"<<dat[k].second<<endl;
while(k>0){
k=(k-1)/2;
//cout<<k<<"/"<<dat[k].second<<endl;
p=max(p,dat[k]);
}
return p.second;
}
void update(int a,int b,int k,P p,int l,int r){
if(r<=a||b<=l) return;
if(a<=l&&r<=b) {
//cout<<a<<":"<<b<<":"<<k<<":"<<l<<":"<<r<<endl;
dat[k]=p;
}else{
update(a,b,k*2+1,p,l,(l+r)/2);
update(a,b,k*2+2,p,(l+r)/2,r);
}
}
signed main(){
int _n,q;
cin>>_n>>q;
init(_n+1);
for(int i=0;i<q;i++){
int f;
cin>>f;
if(!f){
int s,t,x;
cin>>s>>t>>x;
//cout<<i<<":"<<x<<endl;
update(s,t+1,0,P(i,x),0,n);
}else{
int u;
cin>>u;
cout<<query(u)<<endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX = 510000;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
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;}
int h, w;
vector<string> v(400);
class UnionFind
{
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
vector<ll> siz_B;
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1), siz_B(sz_,0)
{
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_)
{
par.resize(sz_);
siz.assign(sz_, 1);
siz_B.assign(sz_, 0);
for (ll i = 0; i < sz_; ++i){
par[i] = i;
if (v[i / w][i % w] == '#')
{
siz_B[i]=1;
}
}
}
// Member Function
// Find
ll root(ll x)
{ // 根の検索
while (par[x] != x)
{
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y)
{
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
siz_B[x]+=siz_B[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y)
{ // 連結判定
return root(x) == root(y);
}
ll size(ll x)
{ // 素集合のサイズ
return siz[root(x)];
}
ll size_B(ll x){
return siz_B[root(x)];
}
};
int main()
{
cin >> h >> w;
REP(i,h){
cin >> v[i];
}
UnionFind uf(h * w);
uf.init(h*w);
REP(i,h){
REP(j,w){
if(j!=w-1&&v[i][j]!=v[i][j+1]){
uf.merge(i*w+j,i*w+j+1);
}
if(i!=h-1&&v[i][j]!=v[i+1][j]){
uf.merge(i*w+j,(i+1)*w+j);
}
}
}
set<ll> ne;
REP(i,h){
REP(j,w){
ne.insert(uf.root(i*w+j));
}
}
ll ans=0;
for(auto& k:ne){
ans+=(uf.size(k)-uf.size_B(k))*(uf.size_B(k));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 100000000000000
vector<vector<pair<int,int>>> parent;
pair<int,int> find(pair<int,int> x){
pair<int,int> y=parent.at(x.first).at(x.second);
if(y!=x){
y=find(y);
}
return parent.at(x.first).at(x.second)=y;
}
void unite(pair<int,int> x, pair<int,int> y){
pair<int,int> a=find(x);
pair<int,int> b=find(y);
if(a!=b){
parent.at(a.first).at(a.second)=b;
}
}
int main(){
int H,W;
cin>>H>>W;
vector<vector<char>> c(H,vector<char>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>c.at(i).at(j);
}
}
parent.resize(H,vector<pair<int,int>>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
parent.at(i).at(j)=make_pair(i,j);
}
}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
for(int k=0;k<4;k++){
int ni=i+dx[k];
int nj=j+dy[k];
if(ni<0||nj<0||ni>=H||nj>=W){
continue;
}
if(c.at(i).at(j)!=c.at(ni).at(nj)){
unite(make_pair(i,j),make_pair(ni,nj));
}
}
}
}
vector<vector<ll>> number1(H,vector<ll>(W,0)),number2(H,vector<ll>(W,0));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
pair<int,int> p=find(make_pair(i,j));
if(c.at(i).at(j)=='.'){
number1.at(p.first).at(p.second)++;
}else{
number2.at(p.first).at(p.second)++;
}
}
}
ll ans=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
ans+=number1.at(i).at(j)*number2.at(i).at(j);
}
}
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
if(n == 0){
cout << 0 << '\n';
return 0;
}
int base = -2;
string ans;
while(n){
int r = n%base;
n = n/base;
if(r < 0) n++;
if(r < 0) r = r*(-1);
char x = r + '0';
ans = x + ans;
}
cout << ans << '\n';
} | #include<iostream>
#include<cstring>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
#define MAX 500000
#define INF 2e9
int L[MAX/2+2],R[MAX/2+2];
long long cnt=0;
long long merge(int A[],int n,int left,int mid,int right)
{
long long cnt=0;
int n1=mid-left;
int n2=right-mid;
for(int i=0;i<n1;i++)
{
L[i]=A[left+i];
}
for(int i=0;i<n2;i++)
{
R[i]=A[mid+i];
}
L[n1]=INF;
R[n2]=INF;
int i=0,j=0;
for(int k=left;k<right;k++)//合并
{
if(L[i]<=R[j])
A[k]=L[i++];
else
{
A[k]=R[j++];
cnt=cnt+(n1-i);
}
}
return cnt;
}
long long mergeSort(int A[],int n,int left,int right)
{
long long v1,v2,v3;
if(left+1<right)
{
int mid=(left+right)/2;
v1=mergeSort(A,n,left,mid);
v2=mergeSort(A,n,mid,right);
v3=merge(A,n,left,mid,right);
return (v1+v2+v3);
}
else
return 0;
}
int main()
{
int A[MAX],n;
cnt=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i];
cnt=mergeSort(A,n,0,n);
cout<<cnt<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <climits>
#include <utility>
typedef long long ll;
using namespace std;
const ll MOD = 998244353LL;
const ll MAX = 2000010LL;
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;
}
}
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 res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main(int argc, char *argv[]) {
COMinit();
ll n, m, k;
cin >> n >> m >> k;
ll ans = 0LL;
for(ll i=0;i<=k;i++){
ans += ((m*modpow(m-1LL,n-i-1LL)%MOD)*COM(n-1LL,i)) % MOD;
ans %= MOD;
}
if(ans<0LL){
ans += MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define arep(a,i,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define cinf(x,n) for(int i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(int i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int turn,tmp;
int main(){
string s[3];
cin >> s[0] >> s[1] >> s[2];
while(true){
if(!s[turn].empty()){
tmp = s[turn][0]-'a';
s[turn].erase(s[turn].begin());
}else{
cout << static_cast<char>(turn+'A') << endl;
return 0;
}
turn = tmp;
}
} | 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e6;
int n,s[N+1],t[N+1];
int hea=1,tai,que[N+1];
int res;
void input(int x[])
{
static char str[N+2];
scanf("%s",str+1);
for(int i=1;i<=n;++i) {
x[i]=str[i]-'a';
}
return;
}
bool check0()
{
for(int i=1;i<=n;++i) {
if(s[i]!=t[i]) {
return false;
}
}
return true;
}
int main()
{
scanf("%d",&n);
input(s);
input(t);
if(check0()) {
puts("0");
return 0;
}
for(int spos=n,tpos=n;tpos;--tpos) {
while((tpos>1)&&(t[tpos-1]==t[tpos])) {
--tpos;
}
while(spos&&((spos>tpos)||(s[spos]!=t[tpos]))) {
--spos;
}
if(!spos) {
puts("-1");
return 0;
}
while((hea<=tai)&&(que[hea]-(tai-hea+1)+1>tpos)) {
++hea;
}
que[++tai]=spos;
if(tpos!=1) {
res=max(res,tai-hea+1);
}
}
++res;
printf("%d\n",res);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
char s[N],t[N];
int n,ans,l=1,r,last,q[N];
int main(){
scanf("%d%s%s",&n,s+1,t+1),last=n;
for(int i=n;i;){
while(last&&(i<last||s[last]!=t[i])) --last;
if(!last) {puts("-1");return 0;}
while(l<=r&&q[l]-r+l-1>=i) ++l;
q[++r]=last;
if(i!=last) ans=max(ans,r-l+1);
while(t[i]==s[last]&&i>=last) --i;
}
printf("%d\n",ans);
return 0;
}
| 1 |
#define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define check(s) cerr << s << endl
#else
#define dump(x)
#define dump2(x, y)
#define dump3(x, y, z)
#define check(s)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
const ll LINF = 2e18;
const int INF = 1e9;
void solve(ll N, ll Q, std::string S, std::vector<ll> l, std::vector<ll> r) {
vector<ll> a(N, 0);
FOR(i, 1, N) {
a.at(i) = a.at(i - 1);
if (S.at(i) == 'C' && S.at(i - 1) == 'A') a.at(i) += 1;
}
rep(i, Q) cout << a.at(r.at(i) - 1) - a.at(l.at(i) - 1) << endl;
}
int main() {
ll N;
scanf("%lld", &N);
ll Q;
scanf("%lld", &Q);
std::string S;
std::cin >> S;
std::vector<ll> l(Q);
std::vector<ll> r(Q);
for (int i = 0; i < Q; i++) {
scanf("%lld", &l[i]);
scanf("%lld", &r[i]);
}
solve(N, Q, S, std::move(l), std::move(r));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 2;
const int INF = 2e18;
signed main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N + 1);
vector<int> count(N + 1, 0);
int start = 0;
{
set<int> remain;
for (int i = 1; i <= N; i++) remain.insert(i);
for (int i = 0; i < N + M - 1; i++) {
int A, B;
cin >> A >> B;
G[A].push_back(B);
count[B]++;
remain.erase(B);
}
start = *remain.begin();
}
vector<int> ans(N + 1, -1), dis(N + 1, -1);
ans[start] = 0;
dis[start] = 0;
queue<int> explore;
explore.push(start);
while (!explore.empty()) {
int now = explore.front();
explore.pop();
for (int next : G[now]) {
count[next]--;
if (dis[next] < dis[now] + 1) {
dis[next] = dis[now] + 1;
ans[next] = now;
}
if (count[next] == 0) explore.push(next);
}
}
for (int i = 1; i <= N; i++) cout << ans[i] << endl;
}
| 0 |
#include <cstdio>
#define my_abs(x) ((x) < 0 ? -(x) : (x))
int arr[3][100005], nxt[100005], rev[100005];
bool vis[100005];
int main()
try
{
// freopen("AGC006-E.in", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < n; j++)
scanf("%d", arr[i] + j);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 2; j++)
{
if (my_abs(arr[j][i] - arr[j + 1][i]) != 1)
throw false;
}
nxt[i] = (arr[1][i] + 1) / 3 - 1;
if ((nxt[i] ^ i) & 1)
throw false;
rev[i & 1] ^= arr[0][i] > arr[2][i];
}
for (int i = 0; i < n; i++)
{
if (vis[i])
continue;
rev[i & 1 ^ 1] ^= 1;
int x = i;
while (!vis[x])
{
vis[x] = true;
rev[i & 1 ^ 1] ^= 1;
x = nxt[x];
}
}
if (rev[0] || rev[1])
throw false;
puts("Yes");
return 0;
}
catch (bool)
{
puts("No");
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define lowbit(x) (x&-x)
int num[4][100010],c0[300010],c1[300010],n;
inline int rd()
{
int x=0;char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x;
}
inline void add0(int x) { for (;x;x-=lowbit(x)) c0[x]++; }
inline void add1(int x) { for (;x;x-=lowbit(x)) c1[x]++; }
inline int sum0(int x)
{
int res=0;
for (;x<=n*3;x+=lowbit(x)) res+=c0[x];
return res;
}
inline int sum1(int x)
{
int res=0;
for (;x<=n*3;x+=lowbit(x)) res+=c1[x];
return res;
}
int main()
{
n=rd();
for (int i=1;i<=3;i++) for (int j=1;j<=n;j++) num[i][j]=rd();
int t0=0,t1=0,tt0=0,tt1=0;
for (int i=1;i<=n;i++)
{
int h1=num[1][i],h2=num[2][i],h3=num[3][i];
if (h1<h3)
{
if (h2-h1!=1||h3-h2!=1) { puts("No");return 0; }
if (h1%3!=1) { puts("No");return 0; }
int hh=h1/3+1;
if (abs(i-hh)&1) { puts("No");return 0; }
}
else
{
if (h2-h3!=1||h1-h2!=1) { puts("No");return 0; }
if (h3%3!=1) { puts("No");return 0; }
int hh=h3/3+1;
if (abs(i-hh)&1) { puts("No");return 0; }
if (i&1) t1^=1;
else t0^=1;
}
}
for (int i=1;i<=n;i++)
{
int h1=num[1][i],h3=num[3][i];
if (h1<h3)
{
if (i&1) tt0+=sum1(h1),add1(h1);
else tt1+=sum0(h1),add0(h1);
}
else
{
if (i&1) tt0+=sum1(h3),add1(h3);
else tt1+=sum0(h3),add0(h3);
}
tt0&=1;tt1&=1;
}
if (t0==tt0&&t1==tt1) puts("Yes");
else puts("No");
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
for (int i = N; i > 0; i--)
{
if (sqrt(i) == floor(sqrt(i))){
cout << i << endl;
return 0;
}
}
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string str;
while(1){
getline( cin, str );
if( str.length()==0 ) break;
for( int i=0; i<=26; i++ ){
for( int j=0; j<str.length(); j++ ){
if( 'a'<=str[j] && str[j]<='z' ){
str[j]++;
if( str[j] == 'z'+1 )
str[j] = 'a';
}
}
if( str.find("the")+str.find("this")+str.find("that") != -3 ){
cout << str << endl;
break;
}
}
}
return 0;
} | 0 |
#include<cstdio>
#include<stdio.h>
#include<string>
#include<iostream>
#include<map>
using namespace std;
#include<algorithm>
bool two(int *a,int left,int right,int num){
while(left<right){
int mid=(left+right)/2;
if(a[mid]==num){
return true;
}
else if(a[mid]>num){
right=mid;
}
else if(a[mid]<num){
left=mid+1;
}
}
return false;
}
int main(){
int n,q,a[100005],b[100005],count=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
cin>>q;
for(int i=0;i<q;i++){
cin>>b[i];
}
sort(a,a+n);
for(int i=0;i<q;i++){
if(two(a,0,n,b[i])){
count++;
}
}
cout<<count<<endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define INF 1LL << 40;
#define ll long long
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
template <class T> inline void chmax(T &a, T b) { a < b ? a = b : a; };
template <class T> inline void chmin(T &a, T b) { a > b ? a = b : a; };
int main() {
int n, q, res = 0;
cin >> n;
vi s(n);
rep(i, n) cin >> s[i];
cin >> q;
vi t(q);
rep(i, q) cin >> t[i];
rep(i, q) rep(j, n) {
if(t[i] == s[j]) {
res++;
break;
}
}
cout << res << endl;
return 0;
}
| 1 |
#include<iostream>
#include<algorithm>
#include<cstring>
#define INF 111111111
using namespace std;
long int cost[1000][1000],ans[1000];
int memo[1000];
int n,k,m,a,b,c;
void solve(int s){
ans[a] = 0;
while(true){
int k = -1;
for(int i=1;i<=n;i++){
if(!memo[i] && (k == -1 || ans[i] < ans[k])) k = i;
}
if(k == -1) break;
memo[k] = 1;
for(int i=1;i<=n;i++) ans[i] = min(ans[i],ans[k]+cost[i][k]);
}
}
int main(){
while(true){
cin >> n >> k;
if(!n && !k) break;
for(int i=0;i<1000;i++){
for(int j=0;j<1000;j++) cost[i][j] = INF;
}
for(int i=0;i<k;i++){
cin >> m;
if(m){
cin >> a >> b >> c;
if(cost[a][b] > c) cost[a][b] = cost[b][a] = c;
}
if(!m){
cin >> a >> b;
for(int i=0;i<1000;i++) ans[i] = INF;
memset(memo,0,sizeof(memo));
solve(a);
if(ans[b] < INF) cout << ans[b] << endl;
if(ans[b] == INF) cout << -1 << endl;
}
}
}
} | #include<atcoder/all>
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define int long long
const int INF = 1e18;
const int MOD = 1e9+7;
//const lint LINF = 1e18;
const double eps = 0.000000001;//もとの値の10^(-16)まで
using namespace std;
using namespace atcoder;
//typedef pair<int, int> P;
//priority_queue< P, vector<P>, greater<P> > q;//ダイクストラの時、greaterで小さい順
//cout << fixed << setprecision(10) << ans << endl;
//int gcd(int a,int b){return b?gcd(b,a%b):a;}
// segtree
// 型 S, 二項演算 S op(S a, S b), 単位元 S e() を設定
// segtree<int, op, e> seg(10); // 要素数n、segという名前で作成
// seg.set(int p, S x) // a[p]にxを代入
// S seg.get(int p) // a[p]を返す
// S seg.prod(int l, int r) // op(a[l], ..., a[r - 1])を返す
// S seg.all_prod() // op(a[0], ..., a[n - 1])を返す
// int seg.max_right<f>(int l) // f(op(a[l], a[l + 1], ..., a[r - 1])) = trueとなる最大のr
int op(int a, int b){
return a+b;
}
int e(){
return 0;
}
signed main(){
int n,q;
cin >> n >> q;
segtree<int, op, e> seg(n);
REP(i,n){
int a1;
cin >> a1;
seg.set(i,a1);
}
REP(i,q){
int q1;
int q2,q3;
cin >> q1 >> q2 >> q3;
if(q1==0){
seg.set(q2,seg.get(q2)+q3);
}
else{
cout << seg.prod(q2,q3) << endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
string s;
int ans=0;
cin >>s;
set<char>dis;
for(char i:s){
dis.insert(i);
}
dis.insert('z' + 6);
for (char i = 'a'; i <= 'z'; i++) {
if(*dis.lower_bound(i)!=i){
cout << i << endl;
return 0;
}
}
cout << "None" << endl;
} | //list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int n;
cin >> n;
vector<int> l(n);
rep1(i, n){
cin >> l[i];
}
int ans = 0;
rep2(i, 0, n-2){
rep2(j, i+1, n-1){
rep2(k, j+1, n){
int a = l[i];
int b = l[j];
int c = l[k];
if(a != b && b != c && c != a && a+b > c && b+c > a && c+a > b){
ans += 1;
}
}
}
}
cout << ans;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod)
{
a %= _mod; b %= _mod; ll res = 1;
switch (op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break;
}
if (res < 0) { res += _mod; } return res;
}
int main()
{
ll N, x;
cin >> N >> x;
vll a(N);
rep(i, 0, N) cin >> a[i];
ll ans = 0;
sort(all(a));
rep(i, 0, N) {
if (i != N-1) {
if (x >= a[i]) {
x -= a[i];
++ans;
}
} else {
if (a.back() == x) ++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 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
int ans=0;
cin >> A >> B;
for(int i=0;i<2;i++){
ans+=max(A,B);
if(max(A,B)==A){
A--;
}
else{
B--;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long n,ans=0,r[4001]={},g[4001]={},b[4001]={};;
string s;
cin >> n >> s;
rep(i,n){
if(s[i]=='R') r[i+1] = r[i] + 1;
else r[i+1] = r[i];
if(s[i]=='G') g[i+1] = g[i] + 1;
else g[i+1] = g[i];
if(s[i]=='B') b[i+1] = b[i] + 1;
else b[i+1] = b[i];
}
rep(i,n){
for(int j=i+1;j<n;j++){
int a = 'R'+'B'+'G';
if(s[i]==s[j]) continue;
char d = a-s[i]-s[j];
if(d=='R') ans += r[n]-r[j];
if(d=='G') ans += g[n]-g[j];
if(d=='B') ans += b[n]-b[j];
if(s[2*j-i]==d) ans--;
}
}
cout << ans << endl;
} | 0 |
#include <stdio.h>
int main(){
int year=0;
char str[5];
scanf("%d/%s",&year, &str);
printf("2018/%s", str);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
string s;
cin >> s;
string ans;
rep(i, s.length()){
if(i == 3) ans += '8';
else ans += s[i];
}
cout << ans << endl;
return 0;
} | 1 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef pair<int,int> P;
#define MAX 10000
int is_prime[MAX+5];// 1:prime 0:not prime
int ans[MAX+5];
void eratos()
{
int i,j;
for(i=2;i<=MAX;i++)is_prime[i]=1;
for(i=2;i*i<=MAX;i++)if(is_prime[i]==1)
{
for(j=i*2;j<=MAX;j+=i)is_prime[j]=0;
}
return;
}
int main(void)
{
eratos();
for(int i=0;i<=MAX;i++)if(is_prime[i]&&is_prime[i+2])ans[i+2]=i+2;
for(int i=5;i<=MAX;i++)if(ans[i]==0)ans[i]=ans[i-1];
while(1)
{
int n;
cin >> n;
if(n==0)break;
cout << ans[n]-2 << ' ' << ans[n] << endl;
}
return 0;
} | #include <cstdio>
#include <cmath>
#define buf 10000
using namespace std;
int k=0;
int B[buf];
void Answer(int n);
int PrimeNumber(int n);
int main(void){
int i,n;
char str[buf];
for(i=2;i<buf;i++)
PrimeNumber(i);
for( ;fgets(str,sizeof(str),stdin)!=NULL; ){
sscanf(str,"%d",&n);
if(n==0) break;
Answer(n);
}
return 0;
}
void Answer(int n){
int i,j;
for(i=0;i<k;i++){
if(B[i]>n)
break;
}
for(j=i-1;j>=0;j--){
if(B[j]-B[j-1]==2){
printf("%d %d\n",B[j-1],B[j]);
break;
}
}
}
int PrimeNumber(int n){
int i,c;
if(n==2){
B[k]=n;
k++; return 0;
}
if(n<2 || n%2==0)
return 0;
c=sqrt(n);
for(i=3;i<=c;i+=2){
if(n%i==0)
return 0;
}
B[k]=n;
k++; return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=1000000007;
ll modpow(ll x,ll y){
if(y==0)
return 1;
else if(y%2==0){
ll z=modpow(x,y/2);
return (z*z)%mod;
}else{
ll z=modpow(x,y/2);
return (x*((z*z)%mod))%mod;
}
}
ll H,W,A,B;
ll fac[200005];
ll rev[200005];
int main(){
cin>>H>>W>>A>>B;
fac[0]=1;rev[0]=1;
for(ll i=1;i<=200004;i++){
fac[i]=(i*fac[i-1])%mod;
rev[i]=modpow(fac[i],mod-2);
}ll ans=0;
for(ll i=B;i<W;i++){
ll a=(rev[i]*((fac[H-A-1+i]*rev[H-A-1])%mod))%mod;
ll b=(rev[W-1-i]*((fac[W+A-2-i]*rev[A-1])%mod))%mod;
ans=(ans+(a*b)%mod)%mod;
}cout<<ans<<endl;
return 0;
} | #include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
}
const int N(2e5 + 10), Mod(1e9 + 7);
int fac[N], inv[N], f[N], n, m, A, B;
int C(int n, int m) { return 1ll * fac[n + m] * inv[m] % Mod * inv[n] % Mod; }
int fastpow(int x, int y)
{
int ans = 1;
for (; y; y >>= 1, x = 1ll * x * x % Mod)
if (y & 1) ans = 1ll * ans * x % Mod;
return ans;
}
int main()
{
n = read() - 1, m = read() - 1, A = read() - 1, B = read() - 1, fac[0] = inv[0] = 1;
if (A == n || B == m) return puts("0"), 0;
for (int i = 1; i <= n + m; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
inv[n + m] = fastpow(fac[n + m], Mod - 2);
for (int i = n + m - 1; i; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % Mod;
int ans = C(n, m);
for (int i = 0; i <= A; i++)
ans = (ans - 1ll * C(i, m - B - 1) * C(n - i, B) % Mod + Mod) % Mod;
printf("%d\n", ans);
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define FOR(i, a, b) for (int i=a; i<b; i++)
#define F0R(i, a) for (int i=0; i<a; i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
const int MOD = 1000000007;
double PI = 4*atan(1);
int N, M;
int adj[15][15], stor[1<<15][15], dp[1<<15][15];
vector<pii> nex[1<<15];
void gen(int i, int cur, int todo, int cost) {
if (todo == N) {
nex[i].pb({cur,cost});
return;
}
if ((i & (1<<todo)) == 0) gen(i,cur+(1<<todo),todo+1,cost+stor[i][todo]);
gen(i,cur,todo+1,cost);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> M;
F0R(i,M) {
int a,b,c; cin >> a >> b >> c;
a--, b--;
adj[a][b] = adj[b][a] = c;
}
F0R(i,1<<N) {
F0R(j,N) {
int tot = 0;
F0R(k,N) if (i & (1<<k)) tot += adj[j][k];
stor[i][j] = tot;
}
gen(i,0,0,0);
}
F0R(i,1<<N) F0R(j,N) dp[i][j] = MOD;
dp[1][0] = 0;
F0R(i,1<<N) if (i&1) F0R(j,N) if (i&(1<<j)) {
F0R(k,N) if ((i&(1<<k)) == 0) if (adj[j][k]) dp[i^(1<<k)][k] = min(dp[i^(1<<k)][k],dp[i][j]+stor[i^(1<<j)][k]);
for(pii a: nex[i]) dp[i^a.f][j] = min(dp[i^a.f][j],dp[i][j]+a.s-stor[a.f][j]);
}
cout << dp[(1<<N)-1][N-1];
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, m, dep[maxn];
bool vis[maxn];
vector<int> G[maxn];
int main() {
scanf("%d %d", &n, &m);
for (int i = 1, u, v; i <= m; i++) {
scanf("%d %d", &u, &v);
G[u].push_back(v), G[v].push_back(u);
}
long long s1 = 0, s2 = 0, s3 = 0;
vector<int> V1, V2;
for (int i = 1; i <= n; i++) if (!vis[i]) {
dep[i] = 1;
int sz = 0, flag = 0;
function<void(int)> dfs = [&](int v) {
vis[v] = 1, sz++;
for (int u : G[v]) {
if (!vis[u]) dep[u] = dep[v] + 1, dfs(u);
else if (!(dep[v] - dep[u] & 1)) flag = 1;
}
};
dfs(i);
if (sz == 1) { s3++; continue; }
if (!flag) s1++;
else s2++;
}
long long ans = 0;
ans += 2 * s3 * n - s3 * s3;
ans += 2 * s1 * s1 + s1 * s2;
ans += s2 * (s1 + s2);
printf("%lld\n", ans);
return 0;
} | 0 |
#include <cstdio>
#include <vector>
#include <map>
using namespace std;
#define N 8
int board[N][N];
vector< pair<int,int> > queen;
vector< pair<int,int> > sol_queen;
bool check(int k, int x, int y)
{
for(int i=0;i<k;i++)
{
int tx = queen[i].first;
int ty = queen[i].second;
if(x == tx) return false;
if(y == ty) return false;
if((x-tx)*(x-tx) == (y-ty)*(y-ty)) return false;
}
return true;
}
/*
void printQueen() {
for(int i=0;i<N;i++) {
printf("%d : (%d,%d)\n",i,queen[i].first,queen[i].second);
}
}
*/
void setQueen(int k,bool is_solution) {
if(k == N && !is_solution) {
is_solution = true;
sol_queen = queen;
return;
}
for(int i=0;i<N;i++) {
for(int j=0;j<N;j++) {
if(check(k,i,j)) {
queen[k] = make_pair(i,j);
setQueen(k+1,is_solution);
}
}
}
}
int main() {
// initialize
queen.resize(N,make_pair(-1,-1));
int k,r,c;
scanf("%d",&k);
for(int i=0;i<k;i++) {
scanf("%d %d",&r,&c);
queen[i] = make_pair(r,c);
}
setQueen(k,false);
for(int k=0;k<N;k++) {
board[sol_queen[k].first][sol_queen[k].second] = 1;
}
for(int i=0;i<N;i++) {
for(int j=0;j<N;j++) {
if(board[i][j] == 0)
printf(".");
else
printf("Q");
}
printf("\n");
}
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
int A,B,C,D;
vector<pair<int,int> > P;
vector<int> R;
cin >> N;
P.push_back({1000000000,-1});
R.resize(N+1);
for(int i=1; i<=N; ++i) P.push_back({0,i});
for(int i=0; i<N*(N-1)/2; ++i) {
cin >> A >> B >> C >> D;
if(C==D) {
++P[A].first;
++P[B].first;
} else if(C>D) {
P[A].first+=3;
} else {
P[B].first+=3;
}
}
sort(P.rbegin(),P.rend());
int rnk=1;
R[P[1].second]=1;
for(int i=2; i<=N; ++i) {
if(P[i-1].first!=P[i].first) rnk=i;
R[P[i].second]=rnk;
}
for(int i=1; i<=N; ++i) {
cout << R[i] << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
int main () {
ios::sync_with_stdio(0); cin.tie(0);
int TT = 1;
// cin >> TT;
while (TT--) {
ll n,h,w;
cin >> n >> h >> w;
--h;
--w;
cout << max(ll(0), ((n-h)*(n-w))) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e18;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,H,W;
cin >> N >> H >> W;
cout << (N-H+1)*(N-W+1) << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N,M;
cin >>N>>M;
vector<ll>m(N+5);
rep(i,M){
ll l,r;
cin>>l>>r;
m[l]++;
m[r+1]--;
}
ll ans =0;
rep(i,N+4){
m[i+1]+=m[i];
if(m[i+1]==M){
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
#define int long long
int dp[6006], n, m, x, y, res;
pair<int, int> p[3003];
int32_t main() {
DAU
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> p[i].first >> p[i].second;
sort(p + 1, p + n + 1);
dp[0] = 1;
for (int i = 1; i <= n; ++i) {
tie(x, y) = p[i];
for (int j = m - 1; j >= 0; --j)
if (dp[j])
dp[j + x] = max(dp[j + x], dp[j] + y);
}
for (int i = 1; i <= m + 3000; ++i)
res = max(res, dp[i]);
cout << res - 1;
PLEC
}
| 0 |
//#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const long long M=1000000007;
//typedef long T;
//#include "math/mod.h"
//#include "math/modulo.h"
template<class T, long long M>
struct modulo {
T n;
T gcd_ext(T a, T b, T *x, T *y) {
if (a == 0) {
*x = 0;
*y = 1;
return b;
}
T x1, y1;
T gcd = gcd_ext(b%a, a, &x1, &y1);
*x = y1 - (b/a) * x1;
*y = x1;
return gcd;
}
modulo(T n): n(n<0? n%M+M: n%M) {}
operator T() const { return n; }
modulo operator-() {
return modulo(-n);
}
modulo operator+(const modulo &o) {
return modulo(n+o.n);
}
modulo operator-(const modulo &o) {
return modulo(n-o.n);
}
modulo operator*(const modulo &o) {
return modulo(n*o.n);
}
modulo operator/(const modulo &o) {
T x, y;
T g = gcd_ext(o.n, M, &x, &y);
if (g != 1) return 0;
else return modulo(n * (x % M));
}
bool operator<(const modulo &o) const {
return n<o.n;
}
bool operator<=(const modulo &o) const {
return n<=o.n;
}
bool operator>(const modulo &o) const {
return n>o.n;
}
bool operator>=(const modulo &o) const {
return n>=o.n;
}
bool operator==(const modulo &o) const {
return n==o.n;
}
bool operator!=(const modulo &o) const {
return n!=o.n;
}
};
typedef modulo<long long, M> T;
//#include "math/comb.h"
void comb_inc_k(T &r, int n, int &k) {
//C(n,k+1) = C(n,k) * (n-k) / (k+1)
r = r * T(n-k) / T(k+1);
k++;
}
void comb_dec_k(T &r, int n, int &k) {
//C(n,k-1) = C(n,k) * k / (n-k+1)
r = r * T(k) / T(n-k+1);
k--;
}
void comb_inc_n(T &r, int &n, int k) {
//C(n+1,k) = C(n,k) * (n+1) / (n+1-k)
r = r * T(n+1) / T(n+1-k);
n++;
}
void comb_dec_n(T &r, int &n, int k) {
//C(n-1,k) = C(n,k) * (n-k) / n
r = r * T(n-k) / T(n);
n--;
}
T comb(int n, int k) {
if (k*2 > n) k = n-k;
if (n==0) return 0;
T r = 1; //C(n,0)
for (int i=0; i<k; ) comb_inc_k(r, n, i);
return r;
}
int h,w,a,b;
int input() {
if (scanf("%d %d %d %d", &h, &w, &a, &b) < 0) return 0;
return 1;
}
void init() {
}
int solve() {
T r = comb(h+w-2, h-1);
int xn = h-a+b-1, xk = b-1;
T x = comb(xn, xk);
int yn = a-1+w-b-1, yk = w-b-1;
T y = comb(yn, yk);
for (int i=0; i<a; i++) {
//T x = mod_combinations(h-a+i+b-1, b-1, M);
//T y = mod_combinations(a-1-i+w-b-1, w-b-1, M);
if (i) {
comb_inc_n(x, xn, xk);
comb_dec_n(y, yn, yk);
}
r = r-x*y;
}
/*
T r = mod_combinations(h+w-2, h-1, M);
T x = mod_combinations(h-a+b-1, b-1, M);
T y = mod_combinations(a-1+w-b-1, w-b-1, M);
for (int i=0; i<a; i++) {
//T x = mod_combinations(h-a+i+b-1, b-1, M);
//T y = mod_combinations(a-1-i+w-b-1, w-b-1, M);
if (i) {
T n = h-a+i+b-1, m = b-1;
x = mod_div(x*n, n-m, M);
n = a-1-i+w-b-1, m = w-b-1;
y = mod_div(y*(n+1-m), n+1, M);
}
T z = mod_mul(x, y, M);
//printf("%d: r=%ld %ld %ld %ld\n", i, r, x, y, z);
r = mod_sub(r, z, M);
}
*/
return r;
}
void output(int ans) {
printf("%d\n", ans);
}
void cleanup() {
}
int main() {
//precalc();
//int ca; scanf("%d", &ca);
while (input()) {
init();
output(solve());
cleanup();
//break;
}
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
inline void normal(ll &a) { if (a >= MOD) a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) {normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) {normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) {normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; } //if MOD is prime, modPow(b, p % (MOD-1))
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
const int mx = 1e6 + 9;
ll f[mx];
ll ncr(ll n, ll r) {
return modDiv(f[n], modMul(f[r], f[n - r]));
}
ll total_path(ll r, ll c) {
return ncr(r + c - 2, r - 1);
}
int main() {
f[0] = 1;
for (int i = 1; i < mx; i++) f[i] = modMul(i, f[i - 1]);
ll h, w, a, b; cin >> h >> w >> a >> b;
ll ttl = 0;
for (ll i = 1; i <= h - a; i++) {
ll temp = modMul(total_path(i, b), total_path(h - i + 1, w - b));
ttl = modAdd(ttl, temp);
}
cout << ttl << endl;
} | 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 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;
cout<<n/3<<endl;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;
const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;
template<class T, class S>
bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
string S; cin >> S;
if(S.length() == 3)
swap(S[0], S[2]);
cout << S << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;
int main() {
int N;
cin>>N;
cout<<0<<endl;
string start;
cin>>start;
string vac="Vacant";
if(start==vac){cout<<0<<endl;return 0;}
int l=0,r=N;
while(r-l>1){
int mid=(l+r)/2;
cout<<mid<<endl;
string next;
cin>>next;
if(next==vac){cout<<mid<<endl;return 0;}
else if(mid%2==l%2){
if(next!=start){r=mid;}
else{l=mid;start=next;}
}
else {
if(next==start){r=mid;}
else{l=mid;start=next;}
}
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
const int inf = 1001001001;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<int> y4 = {1, 0, -1, 0}, y8 = {1, 1, 0, -1, -1, -1, 0, 1};
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;}
template<class T> inline T powerM(T a,T b){if (b==0) return 1;
T tmp = powerM(a,b/2); if (b%2==0) return tmp*tmp%MOD; else return tmp*tmp%MOD*a%MOD; }
template<class T> inline T power(T a,T b,T m=numeric_limits<T>::max()){ if (b==0) return 1;
T tmp = power(a,b/2,m); if (b%2==0) return tmp*tmp%m; else return tmp*tmp%m*a%m; }
template<class T> inline T gcd(T a, T b){if (b==0) return a; return gcd(b, a%b);}
template<class T> inline T lcm(T a, T b){return a / gcd(a,b) * b;}
// ax+by=gcd(a,b)を解く
template<class T> inline T extgcd(T a,T b,T &x,T &y){if (b==0){x=1; y=0; return a;} T d=extgcd(b,a%b,y,x); y -= a/b*x; return d;}
void hey(){ cout <<"hey" <<endl; }
template<class T> struct edge { int to; T cost;};
int main() {
int N; cin >>N;
vector<int> seat(N+1, -1);
// 0: Male, 1: Female
cout <<0 <<endl;
fflush(stdout);
string s; cin >>s;
if (s == "Vacant") return 0;
seat[0] = s == "Male" ? 0 : 1;
seat[N] = s == "Male" ? 0 : 1;
int ai = 0, bi = N;
for (int qq=1; qq<20; qq++){
int ci = (ai+bi)/2;
cout <<ci <<endl;
fflush(stdout);
cin >>s;
if (s == "Vacant") return 0;
seat[ci] = s == "Male" ? 0 : 1;
if ((seat[ai]^seat[ci]) != abs((ai-ci)%2)){
bi = ci;
}else{
ai = ci;
}
}
}
| 1 |
#include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF=1e5;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int main(){
int h,w,a[1009][1009];
string s[1009];
cin >> h >> w;
memset(a, -1, sizeof(a));
for(int i=0;i<h;i++)cin >> s[i];
queue<P> q;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(s[i][j]=='#'){
a[i][j]=0;
q.push(P(i,j));
}
}
}
int mx=0;
while(!q.empty()){
P p=q.front();q.pop();
int ci=p.first;
int cj=p.second;
for(int i=0;i<4;i++){
int ni=ci+dy[i];
int nj=cj+dx[i];
if(!(0<=ni&&ni<h&&0<=nj&&nj<w))continue;
if(a[ni][nj]==-1){
a[ni][nj]=a[ci][cj]+1;
mx = max(mx, a[ni][nj]);
q.push(P(ni, nj));
}
}
}
cout << mx << endl;
}
| //BISMILLAHIR RAHMANIR RAHIM
//BY THE NAME OF ALLAH
//FAISAL AHAMMED SHAWON
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<utility>
#include<set>
#include<map>
#include<iterator>
#include<numeric>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define SQ(a) (a)*(a)
#define pi acos(-1.0)
const int MAX=100001;
const int MOD=1e9+7;
int ara[MAX];
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
else
gcd(b,a%b);
}
ll lcd(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
bool f(ll a,ll b)
{
return a>b;
}
ll max_sum_subarrays(ll ara[],ll n)
{
ll ans=0,sum=0;
for(ll k=0;k<n;k++){
sum=max(ara[k],sum+ara[k]);
ans=max(ans,sum);
}
return ans;
}
ll num_divisors(ll n)
{
long long cnt=0;
for(int i=1;i*i<=n;i++)
{
if(n%i==0 && i*i==n)
cnt+=1;
if(n%i==0 && i*i!=n)
cnt+=2;
}
return cnt;
}
ll comb(ll m, ll n)
{
ll x = max(m-n,n),ans = 1,i=1;
for(ll k=m;k>=x+1;k--){
ans*=k;
ans/=i;
i++;
}
return ans;
}
ll binsearch(ll low,ll high,ll target)
{
while(low<=high)
{
ll mid=(low+high)/2;
if(ara[mid]>target)
high=mid-1;
else if(ara[mid]<target)
low=mid+1;
else return mid;
}
return -1;
}
int main()
{
fast();
int n;
cin>>n;
int ara[n];
for(int i=0;i<n;i++)
{
cin>>ara[i];
}
int maxm=ara[0];
int ans=0;
for(int i=1;i<n;i++)
{
if(maxm>ara[i])
{
maxm=ara[i];
ans++;
}
}
cout<<ans+1<<endl;
} | 0 |
// 2020-07-15 23:41:12
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
void answer() {
using Work = tuple<int, int, int>; // (x, s, t)
using P = pair<int, int>;
int n, q;
cin >> n >> q;
vector<Work> works(n);
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
works[i] = { x, s-x, t-x };
}
sort(ALL(works));
set<P> ds;
rep(i, q) {
int d;
cin >> d;
ds.emplace(d, i);
}
vector<int> ans(q, -1);
for(const auto& w : works) {
int x, s, t;
tie(x, s, t) = w;
auto it = ds.lower_bound({ s, -1 });
while(it != ds.end() && (*it).first < t) {
int d, qi;
tie(d, qi) = *it;
ans[qi] = x;
it++;
ds.erase(prev(it));
}
}
for(const auto x : ans) cout << x << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll oo = 1e18;
const int MOD = 1000000007;
const int N = 300010;
#define x first
#define y second
#define pb push_back
#define mp make_pair
int n , m , dp[1 << 16][16], comp[1 << 16], cost[16][1 << 16], vis[1 << 16],val[1<<16], vsId;
struct edge {
int s , t , c;
};
edge E[16 * 16];
int solve(int msk , int p){
if(p == n-1)return !msk?0:-1e9;
int &ret = dp[msk][p];
if(ret != -1)return ret;
ret = -1e9;
for (int i = 0; i < n; ++i){
if((msk&(1<<i))>0 && cost[i][1<<p]){
ret = max(ret,cost[i][1<<p]+solve(msk^(1<<i),i));
}
}
return ret;
}
ll all = 0;
vector<int> nodes;
int calc(int msk){
if(!msk)return 0;
if(vis[msk]==vsId)return val[msk];
vis[msk] = vsId;
int &ret = val[msk];
ret = -1e9;
for(int sub = msk ; sub > 0 ; sub=(sub-1)&msk){
for(int u = 0 ; u < nodes.size() ; ++u){
int j = nodes[u];
ret = max(ret,cost[j][sub]+comp[sub]+calc(msk^sub));
}
}
return ret;
}
int main() {
memset(dp,-1,sizeof dp);
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
scanf("%d%d%d", &E[i].s, &E[i].t, &E[i].c);
E[i].s--, E[i].t--;
all += E[i].c;
}
for (int i = 0; i < n; ++i) {
for (int msk = 0; msk < (1 << n); ++msk) {
for (int j = 0 ; j < m ; ++j) {
if (E[j].t == i)
swap(E[j].s, E[j].t);
if (E[j].s == i && (msk & (1 << E[j].t)) > 0) {
cost[i][msk] += E[j].c;
}
}
}
}
for (int msk = 0; msk < (1 << n); ++msk) {
for (int j = 0 ; j < m ; ++j) {
if((msk & (1 << E[j].s)) > 0 && (msk & (1 << E[j].t)) > 0){
comp[msk] += E[j].c;
}
}
}
ll ans = oo;
for (int msk = 0 ; msk < (1<< n); ++msk){
if((msk&(1<<0))==0||(msk&(1<<(n-1)))==0)continue;
if(solve(msk^(1<<0),0) < 0)continue;
nodes.clear();
vsId++;
for(int i = 0 ; i < n ; ++i)
if((msk&(1<<i))>0)nodes.pb(i);
ans = min(ans,all-solve(msk^(1<<0),0)-calc(~msk&((1<<n)-1)));
}
printf("%lld\n",ans );
return 0;
}
| 0 |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, h, w, a, b;
scanf("%lld%lld%lld%lld", &h, &w, &a, &b);
for(i = 0; i < h; ++i) {
for(j = 0; j < w; ++j) printf("%d", (i < b) ^ (j < a));
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W; cin >> H >> W;
int A, B; cin >> A >> B;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if ((i < B && j < A ) || (B <= i && A <= j)) cout << '0';
else cout << '1';
}
cout << '\n';
}
cout << endl;
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.