code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#define pb push_back
#define pq priority_queue
#define dbg(x) cerr << #x" = " << x << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fl(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)
using namespace std;
namespace io {
const int SI = 1 << 21 | 1;
char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
int f, t;
#define gc() (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin), IS == IT ? EOF : *IS++) : *IS++)
inline void flush() {
fwrite(OB, 1, OS - OB, stdout), OS = OB;
}
inline void pc(char x) {
*OS++ = x;
if (OS == OT) flush();
}
template <class I>
inline void rd(I &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());
x *= f;
}
template <class I>
inline void rd(I &x, I &y) {
rd(x), rd(y);
}
template <class I>
inline void rd(I &x, I &y, I &z) {
rd(x), rd(y), rd(z);
}
template <class I>
inline void rda(I *a, int n) {
for (int i = 1; i <= n; i++) rd(a[i]);
}
inline void rdc(char &c) {
for (c = gc(); c < 33 || c > 126; c = gc());
}
inline void rds(char *s, int &n) {
for (c = gc(); c < 33 || c > 126; c = gc());
for (n = 0; c >= 33 && c <= 126; s[++n] = c, c = gc());
s[n+1] = '\0';
}
inline void rds(string &s) {
for (c = gc(); c < 33 || c > 126; c = gc());
for (s.clear(); c >= 33 && c <= 126; s.pb(c), c = gc());
}
template <class I>
inline void print(I x, char k = '\n') {
if (!x) pc('0');
if (x < 0) pc('-'), x = -x;
while (x) ch[++t] = x % 10 + '0', x /= 10;
while (t) pc(ch[t--]);
pc(k);
}
template <class I>
inline void print(I x, I y) {
print(x, ' '), print(y);
}
template <class I>
inline void print(I x, I y, I z) {
print(x, ' '), print(y, ' '), print(z);
}
template <class I>
inline void printa(I *a, int n) {
for (int i = 1; i <= n; i++) print(a[i], " \n"[i==n]);
}
inline void printc(char c) {
pc(c);
}
inline void prints(char *s, int n) {
for (int i = 1; i <= n; i++) pc(s[i]);
pc('\n');
}
inline void prints(string s) {
int n = s.length();
while (t < n) pc(s[t++]);
pc('\n'), t = 0;
}
struct Flush {
~Flush() {
flush();
}
} flusher;
}
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
using io::print;
using io::printa;
using io::printc;
using io::prints;
const int N = 1e5 + 7;
int n, x, p[N];
ll b[N], l[N], r[N], s[N], sum;
inline ll calc(int x, ll t) {
return t <= b[x] ? t * l[x] : b[x] * l[x] + (t - b[x]) * r[x];
}
inline ll pd(ll t) {
int w = t % x ? t % x : x, c = (t - w) / x;
ll sum = 0, ret = 0;
for (int i = 1; i <= c; i++) sum += s[p[i]];
for (int i = c + 1; i <= n; i++)
ret = max(ret, sum + calc(p[i], w));
sum += s[p[c+1]];
for (int i = 1; i <= c; i++)
ret = max(ret, sum - s[p[i]] + calc(p[i], w));
return ret;
}
int main() {
rd(n, x);
for (int i = 1; i <= n; i++)
rd(b[i], l[i], r[i]), p[i] = i,
s[i] = b[i] * l[i] + (x - b[i]) * r[i], sum += b[i] * l[i];
sort(p + 1, p + n + 1, [&](int i, int j) { return s[i] > s[j]; });
if (!sum) return print(0), 0;
ll l = 1, r = 1ll * n * x;
while (l < r) {
ll mid = (l + r) >> 1;
if (pd(mid) >= sum) r = mid;
else l = mid + 1;
}
print(l);
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n, maxi;
int aoki[100005], lo[100005], up[100005];
long long score[100005];
bool higher[100005];
long long require;
long long ans, ans1, ans2;
vector<pair<long long, int> > chase;
int main(){
scanf("%d %d", &n, &maxi);
for(int i = 1; i <= n; i++){
scanf("%d %d %d", &aoki[i], &lo[i], &up[i]);
require += 1LL * aoki[i] * lo[i];
score[i] = 1LL * aoki[i] * lo[i] + 1LL * (maxi - aoki[i]) * up[i];
chase.push_back({-score[i], i});
}
sort(chase.begin(), chase.end());
for(auto choice: chase){
long long delta = choice.first;
int id = choice.second;
if(require + delta <= 0){
// two scenarios
// scenario 1: pick all "higher", one partial from "lower" ones
int opt = maxi;
for(int i = 1; i <= n; i++){
if(!higher[i]){
// see if it can make up the difference of delta
if(score[i] < require){
continue;
}else if(1LL * aoki[i] * lo[i] >= require){
opt = min(opt, (int)ceil((require + .0) / lo[i]));
}else{
opt = min(opt, aoki[i] + (int)ceil((require - 1.0 * aoki[i] * lo[i]) / up[i]));
}
}
}
ans1 = ans + opt;
// scenario 2: pick all "higher" and this, then make one "higher" partial
higher[id] = true;
require += delta;
opt = maxi;
for(int i = 1; i <= n; i++){
if(higher[i]){
long long target = require + score[i]; // should be positive
if(1LL * aoki[i] * lo[i] >= target){
opt = min(opt, (int)ceil((target + .0) / lo[i]));
}else{
opt = min(opt, aoki[i] + (int)ceil((target - 1.0 * aoki[i] * lo[i]) / up[i]));
}
}
}
ans2 = ans + opt;
printf("%lld\n", min(ans1, ans2));
return 0;
}
higher[id] = true;
require += delta;
ans += maxi;
}
return 0;
} | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) num = num * 10 + (ch & 15);
if(neg) num = -num;
}
int N, K;
int main(){
getint(N), getint(K);
return printf("%d\n", N - K + 1), 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K) {
cout<<N-K+1;}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
solve(N, K);
return 0;
}
| 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
typedef pair<ll,ll> l_l;
typedef pair<int,int> i_i;
const ll mod=1e9+7;
const int inf=1<<30;
vector<vector<int> > to;
int color[100010];
bool isbi=true;
void dfs(int v,int c=0){
color[v]=c;
rep(i,to[v].size()){
int nv=to[v][i];
if(color[nv]==-1) dfs(nv,1-c);
else if(color[nv]==1-c) continue;
else isbi=false;
}
}
int main(){
ll N,M;
cin >> N >> M;
to.resize(N);
rep(i,N) color[i]=-1;
rep(i,M){
int a,b;
cin >> a >> b;
a--; b--;
to[a].push_back(b);
to[b].push_back(a);
}
dfs(0);
ll ans;
if(isbi){
ll b=0,w=0;
rep(i,N){
if(color[i]==0) b++;
else w++;
}
ans=b*w-M;
}
else{
ans=N*(N-1)/2-M;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int tt,ts,h,t,o,a,b,tmp,count=0;
cin>>a>>b;
for(int i=a;i<=b;i++){
tmp=i;
tt=tmp/10000;
tmp-=tt*10000;
ts=tmp/1000;
tmp-=ts*1000;
h=tmp/100;
tmp-=h*100;
t=tmp/10;
tmp-=t*10;
o=tmp;
if((tt==o)&&(ts==t))count++;
}
cout<<count<<endl;
return 0;
} | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>
using namespace std;
#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double
ostream& operator<< (ostream &out, const vector<int> &b) {
for (auto k : b) out << k << " ";
return out;
}
istream& operator>> (istream& in, pii& b) {
in >> b.first >> b.second;
return in;
}
ostream& operator<< (ostream& out, const pii& b) {
out << "{" << b.first << ", " << b.second << "}";
return out;
}
template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}
#ifdef LOCAL
#define dbg(x) cout << #x << " : " << (x) << "\n";
const int INF = 1e18;
// const int mod = 2600000069;
// const int p = 10;
#else
#define dbg(x) 57
const int INF = 1e18;
// const int mod = 2600000069;
// const int p = 179;
#endif
const ld PI = acos(-1);
#define time clock() / (double) CLOCKS_PER_SEC
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MAXN = 2e5 + 10;
const int K = 20;
int n, l, q;
int a[MAXN], up[MAXN][K];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >> l >> q;
int ptr = 0;
for (int i = 0; i < n; i++) {
while (ptr < n - 1 && a[ptr + 1] - a[i] <= l) {
ptr++;
}
up[i][0] = ptr;
}
for (int i = n - 1; i >= 0; i--) {
for (int j = 1; j < K; j++) {
up[i][j] = up[up[i][j - 1]][j - 1];
}
}
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
x--, y--;
if (x > y) swap(x, y);
int ans = 0;
for (int i = K - 1; i >= 0; i--) {
if (up[x][i] < y) {
ans += (1 << i);
x = up[x][i];
}
}
cout << ans + 1 << "\n";
}
}
/*
*/ | #include <bits/stdc++.h>
using namespace std;
int A[100050];
int n,l,q;
int dp[100050][20];
int main(){
//freopen("input.in","r",stdin);
cin >> n;
for(int i=1; i<=n; ++i) cin >> A[i];
cin >> l;
for(int i=1; i<=n; ++i) dp[i][0] = upper_bound(A+1,A+n+1,A[i]+l)-A-1;
for(int k=1; k<=18; ++k){
for(int i=1; i<=n; ++i){
dp[i][k] = dp[dp[i][k-1]][k-1];
}
}
// for(int k=0; k<=3; ++k){ for(int i=1; i<=n; ++i) printf("%d ", dp[i][k]); printf("\n"); }
cin >> q;
while(q--){
int a, b; cin >> a >> b;
if(a > b) swap(a,b);
int ans = 0;
while(a < b){
int s=0,e=19,m;
for(int k=0; k<=18; ++k) if(dp[a][k] < b) s=k;
ans += (1<<s);
a = dp[a][s];
}
cout << ans << "\n";
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a,b,c;
cin>>a>>b>>c;
int ans = 0;
if(a=='R'&&b=='R'&&c=='R')
ans = 3;
else if((a=='R' && b=='R')|| (b=='R'&&c=='R'))
ans= 2;
else if(a=='R'||b=='R'||c=='R')
ans =1;
cout<<ans;
return 0;
}
| #include <iostream>
#include <string>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e-a<=k) {
cout << "Yay!";
}
else {
cout << ":(";
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
int main(){
ll counte=0,countw=0;
string str;
cin>>str>>str;
vector<ll> w((ll)str.size());
vector<ll> e((ll)str.size());
for(ll i=0;i<(ll)str.size();i++){
if(i==0){
if(str.at(i)=='E'){e.at(i)=1;w.at(i)=0;counte++;}
else{e.at(i)=0;w.at(i)=1;countw++;}
}
else{
if(str.at(i)=='E'){e.at(i)=e.at(i-1)+1;w.at(i)=w.at(i-1);counte++;}
else{e.at(i)=e.at(i-1);w.at(i)=w.at(i-1)+1;countw++;}
}
}
ll ans;
for(ll i=0;i<(ll)str.size();i++){
if(i==0){ans=counte-e.at(0);}
else if(i==(ll)str.size()-1){ans=min(ans,w.at(i));}
else{ans=min(ans,w.at(i-1)+counte-e.at(i));}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int main(){
int N , sum = 0;
string S;
cin >> N >> S;
for(int i = 0; i < N; i++){
if(S[i] == 'E'){
sum++;
}
}
int t = sum;
for(int i = 0; i < N; i++){
if(S[i] == 'E'){
sum--;
}
if(S[i] == 'W'){
sum++;
}
t = min(t , sum);
}
cout << t << endl;
}
| 1 |
#include <stdio.h>
int main(void)
{
int a[1010];
int b[1010];
int t[1010];
int ans[1010];
int i=0;
int j=0;
int n=0;
a[0] = 1;
for(;;)
{
scanf("%d",&t[j]);
if(t[j]==0)
{
break;
}
j++;
}
a[1]=1;
a[2]=2;
a[3]=4;
for(i=4;i<1010;i++)
{
a[i]=a[i-1]+a[i-2]+a[i-3];
ans[i]=a[i]/3650;
}
int k,unk;
for(k=0;k<j;k++)
{
printf("%d\n",ans[t[k]]+1);
}
} |
#include<iostream>
#include<vector>
using namespace std;
int foot(int);
int main() {
int n;
vector<int>floor;
cin >> n;
while (n != 0) {
floor.push_back(n);
cin >> n;
}
floor.push_back(0);
int i = 0;
while (floor[i] != 0) {
int res = 0;
res = foot(floor[i]) / 3650;
if( foot(floor[i]) % 3650 != 0) res++;
cout << res << endl;
i++;
}
cin >> n;
return 0;
}
int foot(int n) {
if (n == 1)return 1;
if (n == 2)return 2;
if (n == 3)return 4;
if (n < 1)return 0;
return foot(n - 1) + foot(n - 2) + foot(n - 3);
} | 1 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define lint long long
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define zlbits(x) __builtin_clzll(x)
#define parsbits(x) __builtin_parityll(x)
#define mem(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define inf 1e17
#define neginf -1e17
#define sp(x,y) fixed<<setprecision(x)<<y
#define testcase(t) lint t; cin>>t; while(t--)
#define power(a,b) (double)pow((double)a,(double)b)
#define FOR(i,n) for(lint i=0;i<n;i++)
#define gcd(a,b) __gcd(a,b)
#define PI 3.1415926535
#define pb push_back
#define ss second
#define ff first
#define umap unordered_map
#define ummap unordered_multimap
#define uset unordered_set
#define umset unordered_multiset
typedef unsigned long long ull;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
//freopen("C:\\Users\\pranjal bhatt\\Desktop\\code contests\\input1.txt", "r", stdin);
/// freopen("C:\\Users\\pranjal bhatt\\Desktop\\code contests\\output1.txt", "w", stdout);
// #endif
}
lint me(lint x, lint y, lint p)
{
lint res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
/*---------------------------SOLUTION---------------------------------*/
void solve()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
lint n,k;
cin>>n>>k;
lint arr[10]={0};
for(lint i=0;i<k;i++)
{
lint u;
cin>>u;
arr[u]=1;
}
for(lint i=n;i<=100000;i++)
{
lint x=i;
lint flg=0;
while(x>0)
{
lint p=x%10;
x=x/10;
if(arr[p]==1)
flg=1;
}
if(flg==0)
{
cout<<i<<endl;
return;
}
}
}
int main()
{
c_p_c();
lint flg99=0;
if(flg99==1)
{
testcase(t)
{
solve();
}
}
else
{
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD = 1000000007;
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 (b<a) {a=b; return 1;} return 0;}
#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...)
#define print(...)
#endif
int main() {
int n, m; cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s(n+1);
rep(i, n) s[i+1] = (s[i]%m+a[i]%m)%m;
map<int, int> mp;
ll ans = 0;
rep(i, n+1) {
int num = s[i];
int rem = num%m;
ans += mp[rem];
mp[rem]++;
debug(i, num, rem, ans);
}
cout << ans << endl;
// int db = 0;
// rep(i, n) FOR(j, i, n) {
// ll tot = 0;
// FOR(k, i, j+1) tot += a[k];
// if (tot%m==0) {
// debug(i, j, tot);
// db++;
// }
// }
// debug(db);
} | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Dice{
public:
long top, front, right, left, back, bottom;
Dice(long top, long front, long right, long left, long back, long bottom);
void north();
void south();
void west();
void east();
void rightTurn();
void ChangeTop(long top);
};
Dice::Dice(long top, long front, long right, long left, long back, long bottom){
this->top = top;
this->front = front;
this->right = right;
this->left = left;
this->back = back;
this->bottom = bottom;
}
void Dice::north(){
long sv[6];
sv[0] = this->front;
sv[1] = this->bottom;
sv[2] = this->right;
sv[3] = this->left;
sv[4] = this->top;
sv[5] = this->back;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::south(){
long sv[6];
sv[0] = this->back;
sv[1] = this->top;
sv[2] = this->right;
sv[3] = this->left;
sv[4] = this->bottom;
sv[5] = this->front;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::west(){
long sv[6];
sv[0] = this->right;
sv[1] = this->front;
sv[2] = this->bottom;
sv[3] = this->top;
sv[4] = this->back;
sv[5] = this->left;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::east(){
long sv[6];
sv[0] = this->left;
sv[1] = this->front;
sv[2] = this->top;
sv[3] = this->bottom;
sv[4] = this->back;
sv[5] = this->right;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::rightTurn(){
long vs[4];
vs[0] = this->left;
vs[1] = this->right;
vs[2] = this->front;
vs[3] = this->back;
this->left = vs[2];
this->right = vs[3];
this->front = vs[1];
this->back = vs[0];
}
void Dice::ChangeTop(long top){
if (top == this->top) return;
else if (top == this->back) Dice::south();
else if (top == this->front) Dice::north();
else if (top == this->left) Dice::east();
else if (top == this->right) Dice::west();
else for (long i = 0; i < 2; i++) Dice::north();
return;
}
int main(){
bool judge = 1;
long n;
cin >> n;
//n = 4;
vector< vector<long> > roll(n);
for (long i = 0; i < n; i++){
roll[i].resize(6);
cin >> roll[i][0] >> roll[i][1] >> roll[i][2] >> roll[i][3] >> roll[i][4] >> roll[i][5];
}
/*
roll[0][0] = 1;
roll[0][1] = 2;
roll[0][2] = 3;
roll[0][3] = 4;
roll[0][4] = 5;
roll[0][5] = 6;
roll[1][0] = 1;
roll[1][1] = 2;
roll[1][2] = 3;
roll[1][3] = 4;
roll[1][4] = 5;
roll[1][5] = 7;
roll[2][0] = 6;
roll[2][1] = 2;
roll[2][2] = 3;
roll[2][3] = 4;
roll[2][4] = 5;
roll[2][5] = 1;
roll[3][0] = 2;
roll[3][1] = 4;
roll[3][2] = 5;
roll[3][3] = 6;
roll[3][4] = 3;
roll[3][5] = 1;
*/
for (long i = 0; i < n; i++){
for (long j = i + 1; j < n; j++){
long isum = 0, jsum = 0;
for (long k = 0; k < 6; k++){
isum += roll[i][k];
jsum += roll[j][k];
}
//cout << isum << " " << jsum << endl;
if (isum != jsum) continue;
Dice *di, *dj;
di = new Dice(roll[i][0], roll[i][1], roll[i][2], roll[i][3], roll[i][4], roll[i][5]);
dj = new Dice(roll[j][0], roll[j][1], roll[j][2], roll[j][3], roll[j][4], roll[j][5]);
di->ChangeTop(roll[0][0]);
dj->ChangeTop(roll[0][0]);
//cout << di->top << " " << dj->top << endl;
for (long k = 0; k < 3; k++) if (di->front != dj->front) dj->rightTurn();
//cout << di->front << " " << dj->front << endl;
if (di->top == dj->top && di->front == dj->front && di->right == dj->right && di->left == dj->left && di->back == dj->back && di->bottom == dj->bottom){
//cout << i << " " << j << endl;
judge = 0;
break;
}
delete di;
delete dj;
}
if (judge == 0) break;
}
if (judge == 1) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | //#define _USE_MATH_DEFINES //M_PI
#include <iostream> //std::cout, std::cin
//#include <string> //std::string
#include <vector> //std::vector
//#include <valarray> //std::valarray ??°????????????????¬???????
//#include <algorithm> //std::sort
//#include <time.h> //localtime_s
//#include <cstdlib> //abs
//#include <cmath> //abs, pow, sqrt, sin, cos,
//#include <fstream> //std::ifstream
//#include <iomanip> //std::setprecision
//#include <random> //std::random(C++11)
int main(void) {
//test??¨
//std::ifstream in("test.txt");
//std::cin.rdbuf(in.rdbuf());
//??\???
int n;
std::cin >> n;
std::vector<std::vector<int>> dice(n, std::vector<int>(6));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 6; j++) {
std::cin >> dice[i][j];
}
}
//??????
bool flg = true;
std::vector<int> dice1(6), dice2(6), temp1(6);
for (int i = 0; i < n - 1; i++) {
dice1 = dice[i];
for (int j = i + 1; j < n; j++) {
dice2 = dice[j];
for (int x = 0; x < 4; x++) {
for (int y = 0; y < 4; y++) {
for (int z = 0; z < 4; z++) {
if (std::equal(dice1.begin(), dice1.end(), dice2.begin())) {
flg = 0;
x = y = z = 4;
i = j = n;
}
temp1[0] = dice1[3];
temp1[1] = dice1[1];
temp1[2] = dice1[0];
temp1[3] = dice1[5];
temp1[4] = dice1[4];
temp1[5] = dice1[2];
dice1 = temp1;
}
temp1[0] = dice1[1];
temp1[1] = dice1[5];
temp1[2] = dice1[2];
temp1[3] = dice1[3];
temp1[4] = dice1[0];
temp1[5] = dice1[4];
dice1 = temp1;
}
temp1[0] = dice1[0];
temp1[1] = dice1[3];
temp1[2] = dice1[1];
temp1[3] = dice1[4];
temp1[4] = dice1[2];
temp1[5] = dice1[5];
dice1 = temp1;
}
}
}
if (flg) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
} | 1 |
#include<bits/stdc++.h>
#define ld double
#define ull unsigned long long
#define ll long long
#define pii pair<int,int >
#define iiii pair<int,pii >
#define mp make_pair
#define INF 1000000000
#define MOD 1000000007
#define rep(i,x) for(int (i)=0;(i)<(x);(i)++)
inline int getint(){
int x=0,p=1;char c=getchar();
while (c<=32)c=getchar();
if(c==45)p=-p,c=getchar();
while (c>32)x=x*10+c-48,c=getchar();
return x*p;
}
using namespace std;
//ruogu_alter
const int N=605;
int dx[]={1,-1,-1,1};
int dy[]={-1,1,-1,1};
int n,cnt[2][2];
int col[N][N][2];
vector<pii >g[N][N];
bool vis[N][N];
//
inline bool isvalid(int x,int y){
if(x<0||x>=2*n||y<0||y>=2*n)return false;
return true;
}
void go(int x,int y,int z,int c){
col[x][y][z]=c;
vis[x][y]=true;
rep(i,g[x][y].size()){
pii u=g[x][y][i];
if(!vis[u.first][u.second]){
go(u.first,u.second,z,c^1);
}
}
}
void solve(int d,int x){
rep(i,2*n)rep(j,2*n)g[i][j].clear();
rep(i,2*n)if(i*i<=d){
int j=sqrt(d-i*i);
if(j*j+i*i!=d)continue;
rep(x,2*n)rep(y,2*n)rep(k,4){
int fx=x+i*dx[k],fy=y+j*dy[k];
if(!isvalid(fx,fy))continue;
g[x][y].push_back(mp(fx,fy));
}
}
rep(i,2*n)rep(j,2*n)vis[i][j]=false;
rep(i,2*n)rep(j,2*n)if(!vis[i][j]){
go(i,j,x,0);
}
}
int main(){
n=getint();
rep(i,2){
int x=getint();
solve(x,i);
}
rep(i,2*n)rep(j,2*n)cnt[col[i][j][0]][col[i][j][1]]++;
rep(i,2)rep(j,2)if(cnt[i][j]>=n*n){
int c=0;
rep(x,2*n)rep(y,2*n){
if(col[x][y][0]==i&&col[x][y][1]==j){
printf("%d %d\n",x,y);
++c;
}
if(c==n*n)return 0;
}
return 0;
}
return 0;
}
| #include <iostream>
#include <map>
#include <cmath>
using namespace std;
int main() {
int n; cin >> n;
map<pair<int, int>, int> mp;
long long ans = 0;
for(int i = 0; i < n; i++) {
double num; cin >> num;
long long x = llround(num*1e9);
int two = 0, five = 0;
while(x % 2 == 0) two++, x /= 2;
while(x % 5 == 0) five++, x /= 5;
for(auto p: mp) {
if(p.first.first+two >= 18 && p.first.second+five >= 18) ans += p.second;
}
mp[make_pair(two, five)]++;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
const int kMaxFace = 6;
void PushWheel(int (&array)[kMaxFace], int a, int b, int c, int d)
{
int temp = array[a];
array[a] = array[b];
array[b] = array[c];
array[c] = array[d];
array[d] = temp;
}
class Dice
{
public:
Dice(const int (&inputArr)[kMaxFace]);
void Write();
void Rotation(const char dir);
int Get();
private:
enum EFace{UP, SOUTH, EAST, WEST, NORTH, BOTTOM};
Dice(){}
int faces[kMaxFace]; // up,S,E,W,N,bottom.
};
Dice::Dice(const int (&inputArr)[kMaxFace])
{
for (int i=0; i<kMaxFace; ++i)
{
faces[i] = inputArr[i];
}
}
void Dice::Rotation(const char dir)
{
switch(dir)
{
// 5, 1, 3, 4, 6, 2.
case 'S': PushWheel(faces, UP, NORTH, BOTTOM, SOUTH); break;
case 'E': PushWheel(faces, UP, WEST, BOTTOM, EAST); break;
case 'W': PushWheel(faces, UP, EAST, BOTTOM, WEST); break;
case 'N': PushWheel(faces, UP, SOUTH, BOTTOM, NORTH); break;
default: break;
}
}
int Dice::Get()
{
return faces[UP];
}
int main()
{
int faces[kMaxFace] = {0};
for (int i=0; i<kMaxFace; ++i)
{
cin >> faces[i];
}
Dice dice(faces);
string str;
cin >> str;
for (int i=0; i<str.length(); ++i)
{
dice.Rotation(str[i]);
}
cout << dice.Get() << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string str;
string::size_type index;
int num;
int number;
int i,j;
cin >> num;
getline(cin,str);//ツ催渉可づ個づ「ツづつつセツつッツ禿づ敖債楪づ慊つケ
for(i=0;i<num;i++)
{
getline(cin,str);
number = 0;
while((index = str.find("Hoshino") ) != string::npos)
{
str.replace(index,7,"Hoshina");
}
cout << str << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <unordered_map>
using namespace std;
using Map = unordered_map<string, long>;
size_t n;
void dfs(string src, Map &m, size_t i=0, string s="", string t="") {
if (i == n){
m[s + ' ' + t]++;
} else {
dfs(src, m, i+1, s+src[i], t);
dfs(src, m, i+1, s, t+src[i]);
}
}
int main() {
string src;
Map m1, m2;
cin >> n >> src;
string left = src.substr(0, n),
right = src.substr(n);
reverse(right.begin(), right.end());
dfs(left, m1);
dfs(right, m2);
long cnt = 0;
for (auto mp:m1)
cnt += mp.second * m2[mp.first];
cout << cnt << '\n';
return 0;
} | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define SZ(x) ((int)x.size())
using namespace std;
inline LL read()
{
LL f=1,x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int stack[20];
template<typename T>inline void write(T x)
{
if(x<0){putchar('-');x=-x;}
if(!x){putchar('0');return;}
int top=0;
while(x)stack[++top]=x%10,x/=10;
while(top)putchar(stack[top--]+'0');
}
template<typename T>inline void pr1(T x){write(x);putchar(' ');}
template<typename T>inline void pr2(T x){write(x);putchar('\n');}
template<typename T>inline void chkmin(T &x,T y){x=x<y?x:y;}
template<typename T>inline void chkmax(T &x,T y){x=x>y?x:y;}
#define ull unsigned long long
const int MAXN=20;
const int base=233;
char ch[2*MAXN];
int bin[MAXN];
map<ull,int> mp;
int main()
{
// freopen("a.in","r",stdin);
bin[1]=1;for(int i=2;i<MAXN;i++)bin[i]=bin[i-1]<<1;
int n=read();scanf("%s",ch+1);
for(int i=0;i<bin[n+1];i++)
{
ull sum=0;
for(int j=1;j<=n;j++)if(i&bin[j])
sum=(sum*base+ch[j]-'a'+1);
sum=(sum*base+79);
for(int j=1;j<=n;j++)if(!(i&bin[j]))
sum=(sum*base+ch[j]-'a'+1);
++mp[sum];
}LL ans=0;
for(int i=0;i<bin[n+1];i++)
{
ull sum=0;
for(int j=1;j<=n;j++)if(i&bin[j])
sum=(sum*base+ch[2*n-j+1]-'a'+1);
sum=(sum*base+79);
for(int j=1;j<=n;j++)if(!(i&bin[j]))
sum=(sum*base+ch[2*n-j+1]-'a'+1);
ans+=mp[sum];
}pr2(ans);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main()
{
int result = 0;
int numberOfPerson, turnOffDelay;
cin >> numberOfPerson >> turnOffDelay;
int lastSwitch = 0;
for (int i = 0; i < numberOfPerson; i++) {
int time;
cin >> time;
int delta = time - lastSwitch;
result += delta < turnOffDelay ? delta : turnOffDelay;
lastSwitch = time;
}
result += turnOffDelay;
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp>
//#include <functional> // for less
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF (ll)1e15
#define mod 1000000007
///#define isValid(n,m,nx,ny)nx>=0&&nx<n&&ny>=0&&ny<m
///int kx[]={1, 1, -1, -1, 2, 2, -2, -2}; //knight moves
///int ky[]={2,-2, 2, -2, 1,-1, 1, -1}; //knight moves
///int dx[]={1,-1,0,0,1,-1,1,-1};//eight direction
///int dy[]={0,0,1,-1,1,-1,-1,1};//eight direction
///using namespace __gnu_pbds;
using namespace std;
///inline double toRad(double deg){return deg*PI/180;}
///inline double toDeg(double rad){return rad*180/PI;}
///typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> new_data_set;
const int S=123456;
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt","r",stdin);
#endif
int n,t;
while(sf("%d %d",&n,&t)==2)
{
int ara[n+5];
for(int i=0;i<n;i++)
{
sf("%d",&ara[i]);
}
ll ans=0,cur=0,pre=0;
for(int i=1;i<n;i++)
{
if(ara[i-1]+t>=ara[i])
{
cur=ara[i];
}
else
{
cur+=t;
ans+=cur-pre;
pre=ara[i];
cur=ara[i];
}
}
cur+=t;
ans+=cur-pre;
pf("%lld\n",ans);
}
return 0;
}
| 1 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
string s = "abcdefg"
s.substr(4) "efg"
s.substr(0,3) "abc"
s.substr(2,4) "cdef"
// イテレータ要素のインデックス
distance(A.begin(), itr);
*/
const int INF = 1000100100;
int main()
{
int n; cin >> n;
int m; cin >> m;
int s[m], c[m];
rep(i,m) cin >> s[i] >> c[i];
int rn, sn;
if(n == 1) rn = 10, sn = 0;
else if(n == 2) rn = 100, sn=10;
else rn = 1000,sn=100;
int res = INF;
for(int i=sn; i<rn; i++){
int cnt = 0;
rep(j,m){
int sj = n-s[j]+1;
int num;
if(sj == 1){
num = i%10;
if(c[j] == num) cnt++;
}else if(sj ==2){
num = i / 10;
num %= 10;
if(c[j] == num) cnt++;
}else{
num = i/100;
if(c[j] == num) cnt++;
}
}
if(cnt == m) res = min(i, res);
}
if(res == INF) cout << -1 << endl;
else cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
#define endl "\n"
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=1000000007;
vector<vector<ll>> G(100007, vector<ll>(0));
void dfs(ll x,vl &d,ll dist){
d[x]=dist;
for(auto p: G[x]){
if(d[p]==INF)dfs(p,d,dist+1);
}
}
signed main(void){
cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
ll N;
cin >> N;
ll u;
cin >> u;u--;
ll v;
cin >> v;v--;
vector<ll> A(N-1,0);
vector<ll> B(N-1,0);
for(ll i=0;i<N-1;++i){
cin>>A[i]>>B[i];
A[i]--;B[i]--;
G[A[i]].emplace_back(B[i]);
G[B[i]].emplace_back(A[i]);
}
vector<ll> du(N,INF);
vector<ll> dv(N,INF);
dfs(u,du,0);
dfs(v,dv,0);
ll mark;
ll ou=-INF;
for(ll i=0;i<N;++i){
if(du[i]<dv[i]&&chmax(ou,dv[i]))mark=i;
}
ll nige=du[mark];
ll ans=nige;
ll S=ou-nige;//Sは1以上
if(S==1)ans+=0;
else if(S==2)ans++;
else {
ans+=((S-2)/2)*2;
S-=((S-2)/2)*2;
if(S==3)ans+=2;
else ans++;
}
prt(ans)
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
if(s == "SUN") cout << 7 << endl;
else if(s == "MON") cout << 6 << endl;
else if(s == "TUE") cout << 5 << endl;
else if(s == "WED") cout << 4 << endl;
else if(s == "THU") cout << 3 << endl;
else if(s == "FRI") cout << 2 << endl;
else if(s == "SAT") cout << 1 << endl;
return 0;
} | /*
** author:mahmoud magdy
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
inline int D()
{
int m ;
cin>>m;
return m ;
}
inline ll lD()
{
ll m ;
cin>>m;
return m ;
}
inline double dD()
{
double m;
cin>>m;
return m;
}
void fast()
{
ios_base :: sync_with_stdio( 0 ) ;
cin.tie( 0 ) ;
cout.tie( 0 ) ;
}
int main()
{
fast();
string s[7]={"SUN","MON","TUE","WED","THU","FRI","SAT"};
string s1;
cin>>s1;
int day;
for(int i=0;i<7;i++){
if(s[i]==s1){
day=i+1;
break;
}
}
cout<<7-(day-1)<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
int cnt=0;
for(int i=0;i<s.length();i++){
cnt++;
}
if(cnt<=k){
cout<<s<<endl;
}
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"..."<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
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 P = pair<int,int>;
//Write From this Line
vector<int> sw(100010,0);
const int dx[] = {1,0,1,0};
const int dy[] = {1,1,0,0};
int main()
{
int n;
cin >> n;
string s;
cin >> s;
rep(i,4){
sw[0] = dx[i];
sw[1] = dy[i];
for(int j = 1; j < n -1; j++){
if(sw[j]){
// j匹目が羊の時、発言は真
if(s[j]=='o'){
sw[j+1] = sw[j-1];
} else {
sw[j+1] = 1 - sw[j-1];
}
} else {
// j匹目が狼の時、発言は偽
if(s[j] == 'o'){
sw[j+1] = 1 - sw[j-1];
} else {
sw[j+1] = sw[j-1];
}
}
}
// n - 1 匹目の証言があっているかを確かめる。
if(sw[0]){
if(s[0] == 'o'){
if(sw[1] == sw[n-1]){
// OK
} else {
// NO
continue;
}
} else {
if(sw[1] != sw[n-1]){
} else {
// NO
continue;
}
}
} else {
// n - 1 匹目狼
if(s[0] == 'x'){
if(sw[1] == sw[n-1]){
} else {
// NO
continue;
}
} else {
if(sw[1] != sw[n-1]){
} else {
// NO
continue;
}
}
}// n - 1 匹目の証言があっているかを確かめる。
if(sw[n-1]){
if(s[n-1] == 'o'){
if(sw[0] == sw[n-2]){
// OK
} else {
// NO
continue;
}
} else {
if(sw[0] != sw[n-2]){
} else {
// NO
continue;
}
}
} else {
// n - 1 匹目狼
if(s[n-1] == 'x'){
if(sw[0] == sw[n-2]){
} else {
// NO
continue;
}
} else {
if(sw[0] != sw[n-2]){
} else {
// NO
continue;
}
}
}
rep(j,n){
if(sw[j]){
cout << 'S';
} else {
cout << 'W';
}
} cout << endl;
return 0;
}
cout << -1 << endl;
}
| 0 |
#include<bits/stdc++.h>
int n,m,a[101],c[101],b[201],e,sum,now;
int main()
{
scanf("%d%d",&n,&m);
if(m==1)
{
printf("%d\n",n);
if(n==1)puts("1"),puts("1");
else puts("2"),printf("%d %d\n",n-1,1);
return 0;
}
for(int i=1;i<=m;++i)
scanf("%d",&a[i]),sum+=a[i],now+=a[i]/2;
now+=sum/2;
if(now<sum-1)puts("Impossible");
else
{
for(int i=1;i<=m;++i)
if(a[i]&1)
{
if(c[1])c[m]=a[i];
else c[1]=a[i];
a[i]=0;
}
for(int i=1,j=c[1]?1:0;i<=m;++i)
if(a[i])
c[++j]=a[i];
for(int i=1;i<=m;++i)
b[i]=c[i];
++b[1];
e=m;
--b[m];
if(c[m]==1)--e;
for(int i=1;i<=m;++i)
printf("%d ",c[i]);
puts("");
printf("%d\n",e);
for(int i=1;i<=e;++i)
printf("%d ",b[i]);
puts("");
}
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li n, m;
li a[111];
int main() {
cin >> n >> m;
li odd_cnt = 0;
rep(i, m) {
cin >> a[i];
if (a[i] % 2 > 0) {
odd_cnt++;
}
}
if (odd_cnt > 2) {
puts("Impossible");
return 0;
}
vector<li> res;
rep(i, m) {
if (a[i] % 2 > 0 && i != 0) {
swap(a[0], a[i]);
break;
}
}
rep(i, m - 1) {
if (a[i] % 2 > 0 && i != 0) {
swap(a[i], a[m - 1]);
break;
}
}
rep(i, m) {
cout << a[i] << " ";
} cout << endl;
if (m == 1) {
if (a[0] == 1) {
cout << 1 << endl;
cout << 1 << endl;
} else {
cout << 2 << endl;
cout << a[0] - 1 << " " << 1 << endl;
}
return 0;
}
if (a[0] > 1)res.pb(a[0] - 1);
res.pb(2);
rep(i, m - 2) {
res.pb(a[i + 1]);
}
if (a[m - 1] > 1)res.pb(a[m - 1] - 1);
cout << sz(res) << endl;
rep(i, sz(res))cout << res[i] << " ";
cout << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[j]) * (x[i] - x[j]);
int dy = (y[i] - y[j]) * (y[i] - y[j]);
return sqrt(dx+dy);
}
int main(){
int x,y;
cin >> x >> y;
int ans(0);
switch (x)
{
case 1:
ans += 300000;
break;
case 2:
ans += 200000;
break;
case 3:
ans += 100000;
break;
default:
break;
}
switch (y)
{
case 1:
ans += 300000;
break;
case 2:
ans += 200000;
break;
case 3:
ans += 100000;
break;
default:
break;
}
if(x==1 && y==1) ans += 400000;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int f[100][100];
int main(){
int a,b,i,j,k,s,t;
scanf("%d%d",&a,&b);
//a>=b
if(a==0){
printf("1 1\n#\n");
return 0;
}
if(b==0){
printf("1 1\n.\n");
return 0;
}
printf("100 100\n");
for(i=0;i<50;i++)for(j=0;j<100;j++)f[i][j]=0;//o->B->#
for(i=50;i<100;i++)for(j=0;j<100;j++)f[i][j]=1;//1->A->.
a--;b--;
for(i=0;i<49&&a>0;i++)
for(j=i%3;j<99&&a>0;j+=3){
f[i][j]=1;
a--;
}
for(i=51;i<100&&b>0;i++)
for(j=i%3;j<99&&b>0;j+=3){
f[i][j]=0;
b--;
}
for(i=0;i<100;i++){
for(j=0;j<100;j++){
if(f[i][j]==0)printf("#");else printf(".");
}
printf("\n");
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
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; }
//Write From this Line
int main()
{
int n;
cin >> n;
vector<vector<int>> a(n, vector<int> (n-1));
rep(i,n){
rep(j,n-1){
cin >> a[i][j];
a[i][j]--;
}
reverse(a[i].begin(), a[i].end());
}
vector<P> q;
auto check = [&](int i){
if(a[i].size() == 0) return;
int j = a[i].back();
if(a[j].size() == 0) return;
if(a[j].back() == i){
P p(i,j);
if(p.second < p.first) swap(p.first, p.second);
q.push_back(p);
}
};
rep(i,n){
check(i);
}
int day = 0;
while(q.size() > 0){
day++;
sort(q.begin(), q.end());
q.erase(unique(q.begin(), q.end()), q.end());
vector<P> prevQ;
swap(prevQ, q);
for(P p: prevQ){
int i = p.first, j = p.second;
a[i].pop_back();
a[j].pop_back();
}
for(P p: prevQ){
int i = p.first, j = p.second;
check(i);
check(j);
}
}
rep(i,n){
if(a[i].size() != 0){
cout << -1 << endl;
return 0;
}
}
cout << day << endl;
}
| #include<bits/stdc++.h>
using namespace std;
const int inf=1000000000;
int N=1000000;
vector<int>d(N,-inf);
vector<int>check(N,0);
vector<vector<int>>e(N);
int dfs(int v){
if(d[v]!=-inf)return d[v];
if(e[v].size()==0)return d[v]=1;
for(int i=0;i<e[v].size();i++){
int u=e[v][i];
if(check[u]==1 && d[u]==-inf)return d[v]=inf;//non-DAG
check[u]=1;
d[v]=max(d[v],dfs(u)+1);
}
return d[v];
}
int main(){
int n;
cin>>n;
int a[n][n-1];
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
cin>>a[i][j];
a[i][j]--;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n-2;j++){
e[min(i,a[i][j])*1000+max(i,a[i][j])].push_back
(min(i,a[i][j+1])*1000+max(i,a[i][j+1]));
}
}
int m=0;
for(int i=0;i<N;i++)m=max(m,dfs(i));
if(m>=inf)cout<<"-1"<<endl;
else cout<<m<<endl;
return 0;
}
| 1 |
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int N, X;
ll S[200];
ll dp[201][100000 + 1];
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)cin >> S[i];
sort(S, S + N, greater<ll>());
dp[0][X] = 1;
for (int i = 0; i < N; i++) {
for (int amari = 0; amari <= X; amari++) {
//今見てるのを確定減少列にいれる
// if (amari >= S[i] ) {
dp[i + 1][amari % S[i]] += dp[i][amari];
dp[i + 1][amari % S[i]] %= MOD;
// }
//いれない
dp[i + 1][amari] += dp[i][amari] * (N - 1 - i);
dp[i + 1][amari] %= MOD;
}
}
ll ans = 0;
for (int i = 0; i <= X; i++) {
ans += i * dp[N][i];
ans %= MOD;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> ppiii;
typedef pair<ll, ll> pll;
typedef pair<pii, pii> query;
ll facs[205];
ll ifacs[205];
const int MOD = 1000000007;
ll modpow(ll b, ll e, ll m) {
ll r = 1;
while(e) {
if(e%2) {
r *= b;
r %= m;
}
b *= b;
b %= m;
e /= 2;
}
return r;
}
int l[205];
bool found[205][100005];
ll dp[205][100005];
int n;
ll solve(int k, int x) {
if(k == 0) return x;
if(found[k][x]) return dp[k][x];
found[k][x] = true;
dp[k][x] = solve(k-1, x%l[k-1]) + (k-1) * solve(k-1, x);
dp[k][x] %= MOD;
dp[k][x] *= modpow(k, MOD-2, MOD);
dp[k][x] %= MOD;
return dp[k][x];
}
void solve() {
int m;
cin >> n >> m;
facs[0] = 1;
for(int i = 1; i <= n; i++) {
facs[i] = facs[i-1] * i;
facs[i] %= MOD;
}
ifacs[n] = modpow(facs[n], MOD-2, MOD);
for(int i = n-1; i >= 0; i--) {
ifacs[i] = ifacs[i+1] * (i+1);
ifacs[i] %= MOD;
}
for(int i = 0; i < n; i++) {
cin >> l[i];
}
sort(l, l+n);
ll ret = solve(n, m);
ret *= facs[n];
ret %= MOD;
cout << ret << "\n";
}
void casesolve() {
int t;
cin >> t;
for(int i = 1; i <= t; i++) {
cout << "Case #" << i << " ";
solve();
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
// casesolve();
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 1000000007;
int main() {
int k,x;
cin >> k >> x;
rep(i, k + k - 1) {
cout << x - k + 1 + i << " ";
}
}
| #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &t : a) {
cin >> t;
}
for (int t = 0; t < k; t++) {
vector<int> v(n);
for (int i = 0; i < n; i++) {
int l = i - a[i];
int r = i + a[i];
v[max(0, l)]++;
if (r + 1 < n) v[r + 1]--;
}
for (int i = 1; i < n; i++) {
v[i] += v[i - 1];
}
a = v;
if (*min_element(a.begin(), a.end()) == n) break;
}
for (auto t : a) {
cout << t << ' ';
}
cout << '\n';
}
| 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
using namespace std;
typedef long long LL;
static const double EPS = 1e-9;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
bool primecheck(int n){
FOR(i,2,n/2)
if(n%i == 0) return false;
return true;
}
int main(void){
int twinprime[1000] = {0};
int ptr=0;
FOR(i,3,9999){
if(primecheck(i)&&primecheck(i+2))
twinprime[ptr++] = i;
}
twinprime[ptr] = 10001;
int n;
while(cin>>n,n){
int i=0;
while(true){
if(twinprime[i]+2>n){
cout << twinprime[i-1] << " " << twinprime[i-1] + 2<< endl;
break;
}
i++;
}
}
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(void)
{
int n;
cin >> n;
getchar();
for(int i=0;i<n;i++){
string s;
getline(cin,s);
for(int j=0;j<(int)s.size()-6;j++){
string hos = s.substr(j,7);
if(hos == "Hoshino"){
s[j+6] = 'a';
}
}
cout << s << endl;
}
} | 0 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(void) {
int i,j;
int n;
while(1){
cin>>n;
if(n==0)break;
cin.ignore();
vector<string> name(n);
pair<double,string> pp[50];
rep(i,n){
int p,a,b,c,d,e,f,s,m;
cin>>pp[i].second>>p>>a>>b>>c>>d>>e>>f>>s>>m;
int t=a+b+c+(d+e)*m;
int in=f*s*m-p;
pp[i].first=(double)in/t;
pp[i].first*=-1;
}
sort(pp,pp+n);
rep(i,n)cout<<pp[i].second<<endl;
cout<<"#"<<endl;
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin >> n && n){
for(int i = 0; i < n; ++i){
int pm, pe, pj;
cin >> pm >> pe >> pj; // ??°????????±????????????
char ans = 'C';
int ave = (pm + pe + pj) / 3;
if(ave >= 50 && (pm >= 80 || pj >= 80)) ans = 'B';
if(ave >= 70) ans = 'B';
if(ave >= 80) ans = 'A';
if(pm + pe >= 180) ans = 'A';
if(pm == 100 || pe == 100 || pj == 100) ans = 'A';
cout << ans << endl;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
int n;
while(1){
cin>>n;
if(n==0) break;
double m,e,j;
rep(i,0,n){
cin>>m>>e>>j;
if(max(m,max(e,j))==100) o('A');
else if(m+e>=180) o('A');
else if(m+e+j>=240) o('A');
else if(m+e+j>=210) o('B');
else if(m+e+j>=150 && max(m,e)>=80) o('B');
else o('C');
}
}
} | /*
* src.cpp
*
* Created on: 2016/08/04
* Author: joi
*/
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e4;
int n;
int p[3];
char out[MAX_N+5];
int main(){
do{
cin>>n;
if (n){
REP(i,n){
int ave=0;
bool f=false;
REP(j,3){
cin>>p[j];
ave+=p[j];
if (p[j]==100){
f=true;
}
}
if (f){
out[i]='A';
}else if (p[0]+p[1]>=180){
out[i]='A';
}else if (ave>=80*3){
out[i]='A';
}else if (ave>=70*3){
out[i]='B';
}else if (ave>=50*3 && (p[0]>=80 || p[1]>=80)){
out[i]='B';
}else{
out[i]='C';
}
}
REP(i,n){
cout<<out[i]<<endl;
}
}
}while (n);
return 0;
} | 1 |
//============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
typedef struct pair<int,int> P;
int A,B,C,D,E,F;
int main() {
cin>>A>>B>>C>>D>>E>>F;
int M=A;
if(B<M)M=B;
if(C<M)M=C;
if(D<M)M=D;
int R=A+B+C+D-M;
int L=0;
if(E<F){
L=F;
}else{
L=E;
}
cout<<R+L<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;
int main() {
int A, B, C, D, E; char CH;
while (cin >> A >> CH >> B >> CH >> C >> CH >> D >> CH >> E) {
VI a = { A,B,C,D,E };
VI cnt(9);
SORT(a);
int i = 0;
while (i < 5) {
int elem = a[i], Cnt = 0;
while (i < 5 && a[i] == elem) { Cnt++; i++; }
cnt[Cnt]++;
}
//check
int ans = -1;
if (cnt[4] == 1)ans = 7;
else if (cnt[3] == 1 && cnt[2] == 1)ans = 6;
else {
bool flag = false;
if (a[0] + 1 == a[1] && a[1] + 1 == a[2] && a[2] + 1 == a[3] && a[3] + 1 == a[4])flag = true;
else if (a[0] == 1 && a[1] == 10 && a[2] == 11 && a[3] == 12 && a[4] == 13)flag = true;
if (flag)ans = 5;
}
if (ans == -1) {
if (cnt[3] == 1)ans = 4;
else if (cnt[2] == 2)ans = 3;
else if (cnt[2] == 1)ans = 2;
else ans = 1;
}
string str;
switch (ans) {
case 1:
str = "null";
break;
case 2:
str = "one pair";
break;
case 3:
str = "two pair";
break;
case 4:
str = "three card";
break;
case 5:
str = "straight";
break;
case 6:
str = "full house";
break;
case 7:
str = "four card";
break;
}
cout << str << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long a,b,x,y,k
;
int main(){
cin>>a>>b;
for(long long i=a;i<=b;i++){
if(i%10==i/10000){
x=i/10;
y=i/1000;
if((x%10)==(y%10))k++;
}
}
cout<<k;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou long double
#define fi first
#define se second
#define setpre(x) std::cout << fixed << setprecision(x)
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x)?("Yes"):("No")) << endl
#define YN(x) cout << ((x)?("YES"):("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger(){ std::cout << " [LOGGER] " << endl; }
template<typename A, typename... B>
void logger(const A& a, const B&... b){
cout << a << " , "; logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 200005;
/* ...o(^-^)o... */
int main(){
int a, b, ans; cin >> a >> b;
ans = 0;
repp(i, a, b+1){
string s = to_string(i); int l = s.length();
bool f = true;
rep(j, l){
if(s[j] != s[l-1-j]) f = false;
}
if(f) ans++;
}
out(ans);
} | 1 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
rep(i,a.size()) cout << a[i] << " ";
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;
int main(){
int n; cin >> n;
vector<vector<int>> a(n,vector<int>(n));
vector<int> now(n,0);
rep(i,n) rep(j,n-1) cin >> a[i][j], a[i][j]--;
int total = n * (n-1) / 2;
int ans = 0;
queue<int> q;
set<int> se;
rep(i,n){
if(a[a[i][0]][0] == i){
if(se.find(i) == se.end() && se.find(a[i][0]) == se.end()){
q.push(i);
se.insert(i); se.insert(a[i][0]);
}
}
}
while(total > 0){
se.clear();
int m = q.size();
total -= m;
vector<int> wait;
rep(j,m){
int u = q.front(); q.pop();
int v = a[u][now[u]];
wait.push_back(u);
wait.push_back(v);
now[u]++;
now[v]++;
}
for(auto u : wait){
if(se.find(u) != se.end()) continue;
if(now[u] == n-1) continue;
int v = a[u][now[u]];
if(se.find(v) != se.end()) continue;
if(now[v] == n-1) continue;
if(a[v][now[v]] != u) continue;
q.push(u);
se.insert(u);
se.insert(v);
}
if(!m){
puts("-1");
return 0;
}
ans++;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
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 = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int main(){
int n;
cin >> n;
vector<queue<int>> A(n);
int a;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n-1; ++j) {
cin >> a;
A[i].push(a-1);
}
}
int res = 0;
while (1) {
bool fin = true;
bool loop = true;
vector<bool> checked(n, false);
for (int i = 0; i < n; ++i) {
if (checked[i]) continue;
if (A[i].empty()) {
continue;
} else {
fin = false;
}
if (A[A[i].front()].front() == i && !checked[A[i].front()]) {
checked[i] = true;
checked[A[i].front()] = true;
A[A[i].front()].pop();
A[i].pop();
loop = false;
}
}
if (fin) break;
if (loop) {
cout << -1 << endl;
return 0;
}
res++;
}
cout << res << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#define INF 1000000007
#define pi 3.141592653589793
using namespace std;
int saidaikouyakusuu(int a,int b){
if(b==0) return a;
return saidaikouyakusuu(b,a%b);
}
int saisyoukoubaisuu(int a,int b){
return a*b/saidaikouyakusuu(a,b);
}
int n,m,cnt=0,aa[220000],ans=0,x,y,ab[220000];
pair<int,int> pp[220000];
string s,ss[220000];
char c;
queue<int> que;
signed main(){
cin>>n>>m>>x>>y;
rep(i,n){
cin>>aa[i];
x=max(x,aa[i]);
}
rep(i,m){
cin>>ab[i];
y=min(y,ab[i]);
}
if(y<=x){
cout<<"War"<<endl;
}else{
cout<<"No War"<<endl;
}
} | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vs vector <string>
#define vvs vector <vector<string>>
#define pq priority_queue<int>
#define smallpq priority_queue<int, vector<int>, greater<int>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
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;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
bool isprime(ll a)//素数判定、primeならtrue,違うならfalse
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
// 素数である
return true;
}
ll keta(ll n) { //桁数を求める
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
string S;
cin >> S;
int cnt = 0;
rep(i, S.size()) {
if (S[i] >= 97 && S[i] <= 122) cnt++;
}
if (S[0] == 'A' && S[0] != 'C' && S[1] != 'C' && S[S.size() - 1] != 'C' && count(all(S), 'C') == 1 && cnt == S.size() - 2) {
puts("AC");
}
else puts("WA");
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
int main(){
string s;
cin >> s;
int a = s.at(0) - '0', b = s.at(1) - '0', c = s.at(2) - '0', d = s.at(3) - '0';
for(int i = 0; i < 8;i++){
bitset<3> s(i);
vector<char> fugou(3);
int temp = a;
if(s.test(0)) temp += b, fugou[0] = '+';
else temp -= b, fugou[0] = '-';
if(s.test(1)) temp += c, fugou[1] = '+';
else temp -= c, fugou[1] = '-';
if(s.test(2)) temp += d, fugou[2] = '+';
else temp -= d, fugou[2] = '-';
if(temp == 7){
cout << a << fugou[0] << b << fugou[1] << c << fugou[2] << d << "=7" << endl;
break;
}
}
return 0;
} | #include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
bool search(int num)
{
for (int i=0; i<4000; i++)
if (order[i] == num ) return true;
return false;
}
int main()
{
int n, idx, memNum;
long price, num;
bool nothing;
ios::sync_with_stdio();
while (1) {
Member *member = new Member[4000];
memNum=0;
nothing =true;
for (int i=0; i<4000; i++) order[i] = -1;
if (cin >> n, !n) break;
for (int i=0; i<n; i++) {
scanf("%d %ld %ld", &idx, &price, &num);
member[idx].add(price, num);
if (!search(idx)) order[memNum++] = idx;
}
for (int i=0; i<4000 && order[i] > 0; i++)
if (member[order[i]].milion()) { cout << order[i] << endl; nothing = false; }
if (nothing) cout << "NA" << endl;
}
} | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int cand[2] = {0, 1};
rep (i, 2)
{
rep (j, 2)
{
bool ok = true;
vs32 ans(n);
ans[0] = cand[i];
ans[1] = cand[j];
for (int k = 2; k < n; ++ k)
{
ans[k] = ans[k - 1] ^ ans[k - 2] ^ (s[k - 1] == 'x');
}
if ((ans[0] == ans[n - 1] ^ ans[n - 2] ^ (s[n - 1] == 'x')) && (ans[n - 1] == ans[0] ^ ans[1] ^ (s[0] == 'x')))
{
rep (k, n)
{
cout << (ans[k] ? 'W' : 'S');
}
cout << "\n";
return 0;
}
}
}
cout << "-1\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
typedef pair<ll, ll> P;
int n;
string s;
vector<char> ans(100005);
void tyosa() {
REPN(i, 1, n) {
if(ans[i] == 'S') {
if(s[i] == 'o') ans[(i+1)%n] = ans[i-1];
else ans[(i+1)%n] = ans[i-1] == 'S' ? 'W' : 'S';
} else {
if(s[i] == 'x') ans[(i+1)%n] = ans[i-1];
else ans[(i+1)%n] = ans[i-1] == 'S' ? 'W' : 'S';
}
}
}
bool hantei() {
if(s[0] == 'o') {
if(ans[0] == 'S') {
if(ans[n-1] == ans[1]) {
return true;
}
} else {
if(ans[n-1] != ans[1]) {
return true;
}
}
} else {
if(ans[0] == 'S') {
if(ans[n-1] != ans[1]) {
return true;
}
} else {
if(ans[n-1] == ans[1]) {
return true;
}
}
}
return false;
}
int main(){
cin >> n >> s;
char zenkai;
/* 羊、羊 */
ans[0] = 'S';
zenkai = 'S';
ans[1] = 'S';
tyosa();
if(zenkai == ans[0]) {
if(hantei()) {
REP(i, n) cout << ans[i];
cout << endl;
return 0;
}
}
/* 羊、狼 */
ans[0] = 'S';
zenkai = 'S';
ans[1] = 'W';
tyosa();
if(zenkai == ans[0]) {
if(hantei()) {
REP(i, n) cout << ans[i];
cout << endl;
return 0;
}
}
/* 狼、羊 */
ans[0] = 'W';
zenkai = 'W';
ans[1] = 'S';
tyosa();
if(zenkai == ans[0]) {
if(hantei()) {
REP(i, n) cout << ans[i];
cout << endl;
return 0;
}
}
/* 狼、狼 */
ans[0] = 'W';
zenkai = 'W';
ans[1] = 'W';
tyosa();
if(zenkai == ans[0]) {
if(hantei()) {
REP(i, n) cout << ans[i];
cout << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
}
| 1 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pcnt __builtin_popcount
typedef long long ll;
const ll inf = 99900100100;
const int MOD = 998244353;
const double EPS = 1e-9;
int dp[1100][1100] = {};
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
string s1,s2;
cin >> s1;
cin >> s2;
rep(i,s1.size()+1) dp[i][0] = i;
rep(j,s2.size()+1) dp[0][j] = j;
REP(i,1,s1.size()+1){
REP(j,1,s2.size()+1){
int u = (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]+u});
}
}
cout << dp[s1.size()][s2.size()] << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define whole(xs) (xs).begin(),(xs).end()
template<class T>
ostream& operator<<(ostream& os, const vector<T>& xs) {
if (xs.empty()) return os << "[]";
os << "[" << xs[0];
for (int i = 1; i < xs.size(); i++) os << ' ' << xs[i];
return os << "]";
}
const int INF = 1<<28;
int LevenshteinDistance(const string& s, const string& t) {
const int N = s.size(), M = t.size();
vector< vector<int> > dp(2, vector<int>(M + 1, INF));
for (int j = 0; j <= M; j++) dp[0][j] = j;
for (int i = 1; i <= N; i++) {
fill(whole(dp[i & 1]), INF);
dp[i & 1][0] = i;
for (int j = 1; j <= M; j++) {
int& v = dp[i & 1][j];
v = min(v, dp[(i - 1) & 1][j] + 1);
v = min(v, dp[i & 1][j - 1] + 1);
v = min(v, dp[(i - 1) & 1][j - 1] + (s[i - 1] != t[j - 1]));
}
}
return dp[N & 1][M];
}
int main() {
string s, t; cin >> s >> t;
cout << LevenshteinDistance(s, t) << endl;
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,m;
while(cin >> n >> m,n){
int p[1000],sum = 0;
for(int i = 0;i < n;i++) cin >> p[i];
sort(p,p + n,greater<int>());
for(int i = 0;i < n;i++){
if(i % m != m - 1) sum += p[i];
}
cout << sum << endl;
}
return 0;
} | // abc060_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()
#define INF ((1 << 29)-1)
#define MOD (1000000007)
#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;
int main() {
#ifdef LOCAL
ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif
int N, T;
cin >> N >> T;
vector<int> A(N);
REP(i, N) cin >> A[i];
ll ans = 0;
ll l = 0;
ll r = 0;
REP(i, N){
if (r < A[i]){
ans += r - l;
l = A[i];
r = A[i] + T;
} else {
r = A[i] + T;
}
}
ans += r - l;
print(ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<queue<char>> s(3);
for(int ix=0;ix<3;ix++){
string tmp;
cin >> tmp;
for(int ixx=0;ixx<tmp.size();ixx++) s.at(ix).push(tmp.at(ixx));
}
char card;
int turnplayer = 0;
while(!s.at(turnplayer).empty()){
card = s.at(turnplayer).front();
s.at(turnplayer).pop();
turnplayer = card - 'a';
}
if(turnplayer == 0) cout << "A" << endl;
if(turnplayer == 1) cout << "B" << endl;
if(turnplayer == 2) cout << "C" << endl;
} | #include<iostream>
#include<vector>
#include<set>
#include<utility>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<algorithm>
#include<cinttypes>
#include<stack>
#include<ctgmath>
using namespace std;
typedef long long ll;
#define ceil(a,b) ( !(a%b) ? a/b : a/b+1 )
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define endl '\n'
#define debug(a) cin>>#a>>a;
//vector<ll> primes{ }
template<typename T>
T gcd( T a, T b ) {
return !a ? b : gcd( b%a, a);
}
template<typename T>
T lcm( T a, T b ){
return (a*b)/gcd(a,b);
}
int main(){
string sa,sb,sc;
cin >> sa >> sb >> sc;
reverse(sa.begin(),sa.end());
reverse(sb.begin(),sb.end());
reverse(sc.begin(),sc.end());
char check = sa.back();
sa.pop_back();
if( sa.empty() ){
std::cout << 'A' << endl;
} else {
bool flag = false;
while(true){
switch(check){
case 'a':
if( sa.empty() ){
cout << 'A' << endl;
flag = true;
} else {
check = sa.back();
sa.pop_back();
}
break;
case 'b':
if( sb.empty() ){
cout << 'B' << endl;
flag = true;
} else {
check = sb.back();
sb.pop_back();
}
break;
case 'c':
if( sc.empty() ){
cout << 'C' << endl;
flag = true;
} else {
check = sc.back();
sc.pop_back();
}
break;
}
if(flag){
break;
}
}
}
return 0;
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
int main() {
int n, m;
int s, c;
int ans = 0;
cin >> n >> m;
vector<int> a(3);
a[0] = a[1] = a[2] = 10;
rep(i, m) {
cin >> s >> c;
if (a[s - 1] != 10 && a[s - 1] != c) {
cout << -1 << endl;
return 0;
}
else {
a[s - 1] = c;
}
}
if (a[0] == 0 && n != 1) {
cout << -1 << endl;
return 0;
}
else {
if (a[0] == 10) {
if (n == 1)a[0] = 0;
else a[0] = 1;
}
for (int i = 1; i<n; i++) {
if (a[i] == 10)a[i] = 0;
}
rep(i, n) {
ans += a[i] * pow(10, n - i - 1);
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 20000000000000000
#define mod 998244353
#define ull unsigned long long int
#define f(i,k,n) for(i=k;i<n;i++)
#define fr(i,n,k) for(i=n;i>=k;i--)
#define ent(a) scanf("%lld",&a)
#define ent2(a,b) scanf("%lld%lld",&a,&b)
#define ent3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define mem(a) memset(a,0,sizeof(a))
#define vec(v,s) vector<ll>v[s]
#define arr(a,s) ll a[s];
/*#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
//knight and king//
int dr[]= {2,2,-2,-2,1,-1,1,-1};
int dc[]= {1,-1,1,-1,2,2,-2,-2};
int dr1[]= {0,0,1,1,1,-1,-1,-1};
int dc1[]= {1,-1,1,0,-1,0,1,-1};
int dr2[]= {0,0,1,-1};
int dc2[]= {1,-1,0,0};
////////////////////////////
using namespace std;
#define ma 200
ll a[4][4];
ll mark[ma];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll i,j,x,y,n,m;
while(cin>>n)
{
memset(mark,-1,sizeof(mark));
cin>>m;
vector<pair<ll,ll> >v;
ll max1=n;
for(i=0;i<m;i++)
{
cin>>x>>y;
v.pb({x,y});
mark[x]=y;
max1=max(max1,x);
}
for(i=1;i<=max1;i++)
{
if(mark[i]==-1)
{
if(i==1&&max1>1)mark[i]=1;
else mark[i]=0;
}
}
bool f=0;
for(i=0;i<v.sz;i++)
{
if(mark[v[i].ff]!=v[i].ss)f=1;
}
if(mark[1]==0&&max1>1)f=1;
if(f)cout<<"-1"<<endl;
else
{
for(i=1;i<=max1;i++)cout<<mark[i];
cout<<endl;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,N) for(int i = 0; i < N; i++)
int main()
{
string s;
int maxv = 0;
int m[3] = {'J','O','I'};
cin >> s;
int i = 0;
while(i < s.size()) {
if(m[0] == s[i]) {
int count[3] = {0};
Rep(j,3)for(; m[j] == s[i]; i++, count[j]++);
if(min(count[0],count[2]) < count[1])continue;
maxv = max(maxv,count[1]);
} else i++;
}
cout << maxv << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int anser(string s) {
if (s == "Male") {
return 0;
}
if (s == "Female") {
return 1;
}
if (s == "Vacant") {
exit(0);
}
exit(-1);
}
int query(int p) {
cout << p << endl;
string s;
cin >> s;
return anser(s);
}
bool bingo(int d, int v1, int v2) {
if (d % 2 == 0) {
return v1 != v2;
} else {
return v1 == v2;
}
}
int main() {
int n;
cin >> n;
int from = 0;
int to = n - 1;
int from_q = query(from);
int to_q = query(to);
while(true) {
int mid = from + (to - from) / 2;
int mid_q = query(mid);
if (bingo(mid - from,from_q, mid_q)) {
to = mid;
to_q = mid_q;
} else if (bingo(to - mid, mid_q, to_q)) {
from = mid;
from_q = mid_q;
} else {
int a[0];
a[-10000000] = 0;
}
}
return 0;
} | 0 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
const int INF = 1000000000;
const int MOD = 1000000007;
const long long MAX = 1000100;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2;i < MAX;i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
COMinit();
int n,m;
cin >> n >> m;
map<int,int> mp;
for(int i = 2;i * i <= m;i++){
while(m % i == 0){
mp[i]++;
m /= i;
}
}
if(m != 1)mp[m]++;
ll ans = 1;
for(auto p:mp){
ll com = COM(p.second+n-1,p.second);
ans *= com;
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int A,B; cin >> A >> B; // Aが白
bool changed = false;
if (A>B){
swap(A,B);
changed = true;
}
vector<vector<int>> T(100,vector<int>(100,0));
int b = 1;
while(b<=B){
int yoko = (b-1)%25;
yoko *= 4;
int tate = (b-1)/25;
tate *= 4;
T[tate][yoko] = 1;
T[tate][yoko+1] = 1;
T[tate][yoko+2] = 1;
T[tate+1][yoko] = 1;
T[tate+1][yoko+1] = 1;
T[tate+1][yoko+2] = 1;
T[tate+2][yoko] = 1;
T[tate+2][yoko+1] = 1;
T[tate+2][yoko+2] = 1;
b++;
}
int a = 1;
while(a<=A-1){
int yoko = (a-1)%25;
yoko *= 4;
int tate = (a-1)/25;
tate *= 4;
T[tate+1][yoko+1] = 0;
a++;
}
cout << 100 << " " << 100 << endl;
REP(i,100){
REP(j,100){
if(!changed){
if(T[i][j]==0)cout << ".";
else cout << "#";
}else{
if(T[i][j]==0)cout << "#";
else cout << ".";
}
}
cout << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
string s ;
cin>>s;
int ans = s[0]-'0';
for(int op1 = 0 ;op1 < 2;op1++)
{
if(op1)
{
ans+=(s[1]-'0');
}
else ans-=(s[1]-'0');
for(int op2 = 0;op2<2;op2++)
{
if(op2)
{
ans+=(s[2]-'0');
}
else ans-=(s[2]-'0');
for(int op3 = 0 ; op3<2;op3++)
{
if(op3)
{
ans+=(s[3]-'0');
}
else ans-=(s[3]-'0');
if(ans==7)
{
cout<<s[0];
if(op1)cout<<"+";
else cout<<"-";
cout<<s[1];
if(op2)cout<<"+";
else
cout<<"-";
cout<<s[2];
if(op3)cout<<"+";
else
cout<<"-";
cout<<s[3] <<"=7"<<endl;
return 0;
}
if(op3)
{
ans-=(s[3]-'0');
}
else ans+=(s[3]-'0');
}
if(op2)
{
ans-=(s[2]-'0');
}
else ans+=(s[2]-'0');
}
if(op1)
{
ans-=(s[1]-'0');
}
else ans+=(s[1]-'0');
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int now[4];
char C[4], op[2] = {'+', '-'};
int main(){
for (int i = 0; i < 4; i++){
cin >> C[i];
now[i] = C[i] - '0';
}
for (int i = 0; i < 8; i++){
int val = now[0], num = i;
for (int j = 1; j < 4; j++){
val += pow(-1, num % 2) * now[j];
num /= 2;
}
if (val == 7){
num = i;
cout << now[0];
for (int j = 1; j < 4; j++){
cout << op[num%2] << now[j];
num /= 2;
}
cout << "=7" << endl;
return 0;
}
}
return 0;
}
| 1 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i; --i)
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
unordered_map<int, int> odd, even;
rep(i, 0, n) {
if (i & 1)
odd[a[i]]++;
else
even[a[i]]++;
}
vector<pair<int, int>> o, e;
for (auto p : odd) { o.emplace_back(p.second, p.first); }
for (auto p : even) { e.emplace_back(p.second, p.first); }
sort(o.rbegin(), o.rend());
sort(e.rbegin(), e.rend());
o.emplace_back(0, n / 2);
e.emplace_back(0, n / 2);
if (o[0].second == e[0].second) {
cout << n - o[0].first - max(o[1].first, e[1].first) << endl;
} else {
cout << n - o[0].first - e[0].first << endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
//#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define L(a) scanf("%lld",&a)
#define L2(a,b) scanf("%lld%lld",&a,&b)
#define L3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define PI(a) printf("%d",a)
#define PL(a) printf("%lld",a)
#define PT(t) printf("Case %d: ",t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a,0,sizeof a)
#define SETR(a) memset(a,-1,sizeof a)
#define SZ(a) ((int)a.size())-1
#define f(i,a,b) for(int i=a;i<=b; i++)
#define fr(i,a,b) for(int i=a;i<=b; i++)
#define frr(i,a,b) for(int i=a;i>=b; i--)
#define frv(i,a) for(int i=0;i<a.size();i++)
#define pi 2.0*acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T mul(T p, T e, T M)
{
ll ret = 0;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret + p) ;
p = (p + p) ;
if(ret>=M)ret-=M;
if(p>=M)p-=M;
}
return (T)ret;
}
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 mdINV(T a, T M)
{
return BM(a, M - 2, M);
}
template <class T> inline T PW(T p, T e)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T>bool ISLEFT(T a, T b, T c)
{
if(((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)return 1; //Uporer dike //A,b,c, x okkher ordera sorted
else return 0;
}
#define mx 200004
#define base 193ll
typedef pair<int,int >P;
//////////////////////////
////////////////////////
#define F(i,a,b) for(int i=a;i<b; i++)
#define LL long long
#define MX 200007
#define md 998244353ll
///////////////////////////
///////////////////////////
///
int main(){
int n;
I(n);
vector<int>v[2];
for(int i = 1;i<=n;i++){
int x;
I(x);
v[i%2].push_back(x);
}
int res = 0;
map<int,int> mp[2];
set< pair<int, int> >st[2];
for(int i = 0;i<= 1;i++){
int ma = 0;
int cnt = 1;
for(int j = 0;j<v[i].size();j++){
mp[i][v[i][j]]++;
}
}
for(int i = 0;i<= 1;i++){
for(int j = 1;j<v[i].size();j++){
st[i].insert(mk(-mp[i][v[i][j]], v[i][j]));
}
}
int ans = n;
int i = 0;
for(auto it: st[0]){
i++;
if(i==3)break;
int j = 0;
for(auto it1: st[1]){
j++;
if(j==3)break;
if(it.second == it1.second){
// cout<<it.first<<" "<<it1.first<<endl;
ans = min(ans, n - max(-it.first, -it1.first));
}
else {
ans = min(ans, n+it.first +it1.first);
}
}
}
cout<<ans<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,K;
while( cin >> N >> K){
if( N == 0 && K == 0){ break;}
vector<string> P(N);
for(int i = 0; i < N; i++){ int c; cin >> c; P[i] = to_string(c);}
set<string> s;
if( K == 2){
for(int i = 0; i < N-1; i++){
for(int j = i+1; j < N; j++){
vector<string> vec;
vec.push_back(P[i]); vec.push_back(P[j]);
sort(vec.begin(),vec.end());
do{
s.insert(vec[0]+vec[1]);
}while(next_permutation(vec.begin(),vec.end()));
}}}
if( K == 3){
for(int i = 0; i < N-2; i++){
for(int j = i+1; j < N-1; j++){
for(int k = j+1; k < N; k++){
vector<string> vec;
vec.push_back(P[i]); vec.push_back(P[j]); vec.push_back(P[k]);
sort(vec.begin(),vec.end());
do{
s.insert(vec[0]+vec[1]+vec[2]);
}while(next_permutation(vec.begin(),vec.end()));
}
}
}
}
if( K == 4){
for(int i = 0; i < N-3; i++){
for(int j= i+1; j < N-2; j++){
for(int k = j+1;k < N-1; k++){
for(int l = k+1; l < N; l++){
vector<string> vec;
vec.push_back(P[i]); vec.push_back(P[j]); vec.push_back(P[k]); vec.push_back(P[l]);
sort(vec.begin(),vec.end());
do{
s.insert(vec[0]+vec[1]+vec[2]+vec[3]);
}while(next_permutation(vec.begin(),vec.end()));
}
}
}
}
}
cout << s.size() << endl;
}
return 0;}
| #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)///
bool comp(pii a, pii b) {
if (a.first*a.first + a.second*a.second == b.first*b.first + b.second*b.second) {
return a.first < b.first;
}
else {
return a.first*a.first+a.second*a.second < b.first*b.first+b.second*b.second;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<pii> v;
FOR(i, 1, 151) {
FOR(j, i + 1, 151) {
v.push_back({ i,j });
}
}
sort(ALL(v), comp);
while (1) {
int h, w;
cin >> h >> w;
if (!h)break;
int c = find(ALL(v), make_pair(h, w)) - v.begin();
cout << v[c + 1].first << " " << v[c + 1].second << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned long long int
#define test int t;cin>>t; while(t--)
#define um unordered_map
#define en '\n'
#define us unordered_set
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
bool check_prime(long long n)
{
int flag = 0;
for (long long i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
flag = 1;
break;
}
}
if (n == 1)
return false;
else if (flag == 0 || n == 2 || n == 3)
{
return true;
}
else
{
return false;
}
}
int BE(int x, int n, int m) //function to calculate x raise to power n modulo m
{
int result = 1;
while (n > 0)
{
if (n % 2 == 1)
result = result * x % m;
x = x * x % m;
n = n / 2;
}
return result;
}
int c[3];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
//_______________________________-code starts-_______________________________________________
int n;
cin >> n;
int a[n];
zip(i, 0, n)
{
cin >> a[i];
}
int ans = 1;
zip(i, 0, n)
{
int cnt = 0;
int id = -1;
if (a[i] == c[0]) cnt++, id = 0;
if (a[i] == c[1]) cnt++, id = 1;
if (a[i] == c[2]) cnt++, id = 2;
if (id == -1)
{
cout << 0 << en;
return 0;
}
ans = (ans * cnt) % mod;
c[id]++;
}
cout << ans << en;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
ll N;
cin >> N;
ll c[3] = {};
ll ans = 1;
rep(i,N) {
ll a;
cin >> a;
bool t = false;
ll cnt = 0;
rep(j,3) {
if (c[j]==a && !t) {
c[j]++;
cnt++;
t = true;
}
else if (c[j]==a) {
cnt++;
}
}
ans*=cnt;
ans%=MOD;
}
cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = n; i >= 0; --i) {
string u = s;
for (int j = i; j < n; ++j) u += t[j];
bool same_t = true;
rep(j, n) if (u[u.size() - 1 - j] != t[t.size() - 1 - j]) same_t = false;
if (same_t) {
cout << 2 * n - i << endl;
return 0;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,s,d;
cin>>a>>s>>d;
if(a<=s*d){
cout<<"Yes";
}else{
cout<<"No";
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
#define int long long
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
signed main() {
int n;
cin >> n;
map<int, int> mp;
rep (i, 1, n + 1) {
int k = i;
for (int j = 2; j * j <= k; j++) {
while (k % j == 0) {
k /= j;
mp[j]++;
}
}
mp[k]++;
}
int ans = 1;
const int mod = 1e9 + 7;
for (auto p : mp) {
// cout << p.first << " : " << p.second << "\n";
if (p.first == 1) continue;
ans = ans * (p.second + 1) % mod;
// cout << ans << "\n";
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
int ans;
cin >> x;
ans = pow(x, 3);
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<ll> A(N), B(N);
REP(i, N)
cin >> A[i] >> B[i];
vector<ll> index(N);
iota(ALL(index), 0ll);
sort(ALL(index), [&](auto &a, auto &b)
{
return (A[a] + B[a] > A[b] + B[b]);
});
ll res{0};
bool ist{true};
REP(i, N)
{
if (ist)
res += A[index[i]];
else
res -= B[index[i]];
ist ^= true;
}
std::cout << res << std::endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
template<class T>
void OUT0(T N)
{
cout << N << endl;
}
static const double pi = acos(-1.0);
double Cos(double D)
{
return cos(pi/180 * D);
}
class Dishes
{
public:
ll point_takahashi;
ll point_aoki;
ll sum;
ll number;
};
void ALLIN1_DISHES(ll N, vector<Dishes>& dishes)
{
for(ll i=0;i<N;i++)
{
dishes[i].number = i;
cin >> dishes[i].point_takahashi >> dishes[i].point_aoki;
dishes[i].sum = dishes[i].point_takahashi + dishes[i].point_aoki;
}
}
bool Sort_TA(vector<Dishes>& dishesTA)
{
sort
(ALL(dishesTA),
[](Dishes& a, Dishes& b)
{
return (a.sum == b.sum) ? (a.point_takahashi > b.point_takahashi) : (a.sum > b.sum);
});
}
void Sort_AT(vector<Dishes>& dishes)
{
sort
(ALL(dishes),
[](Dishes& a, Dishes& b)
{
return (a.sum == b.sum) ? (a.point_aoki > b.point_aoki) : (a.sum > b.sum);
});
}
ll Ans(ll N, vector<Dishes> dishes_TA, vector<Dishes> dishes_AT)
{
vector<bool> eaten(N,false);
ll takahashi_point = 0;
ll aoki_point = 0;
ll itr_TA = 0;
ll itr_AT = 0;
for(ll i=0;i<N;i++)
{
if(i%2==0)
{
for(ll& j=itr_TA;j<N;j++)
{
if(!eaten[dishes_TA[j].number])
{
eaten[dishes_TA[j].number] = true;
takahashi_point += dishes_TA[j].point_takahashi;
j++;
break;
}
}
}
else
{
for(ll& j=itr_AT;j<N;j++)
{
if(!eaten[dishes_AT[j].number])
{
eaten[dishes_AT[j].number] = true;
aoki_point += dishes_AT[j].point_aoki;
j++;
break;
}
}
}
}
return takahashi_point - aoki_point;
}
int main()
{
ll N;
cin >> N;
vector<Dishes> dishes(N);
ALLIN1_DISHES(N,dishes);
vector<Dishes> dishes_TA = dishes;
Sort_TA(dishes_TA);
vector<Dishes> dishes_AT = dishes;
Sort_AT(dishes_AT);
OUT0(Ans(N,dishes_TA,dishes_AT));
return 0;
} | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
int n;
int res = 0;
struct node {
int id;
int parent;
};
node v[100];
vector<tuple<int, int, int>> cost;
vector<int> path;
int find(node x){
if(x.parent == -1){
REP(i, path.size())
v[path[i]].parent = x.id;
path.clear();
return x.id;
}
else{
path.push_back(x.id);
return find(v[x.parent]);
}
}
void marge(node x, node y){
int x_id = find(x);
int y_id = find(y);
if(x_id == y_id)
return;
else
v[y_id].parent = x_id;
return;
}
bool judge(node x, node y){
vector<int> xpath, ypath;
return find(x) == find(y);
}
int main() {
cin >> n;
REP(i, n) REP(j, n) {
int tmp;
cin >> tmp;
if(tmp != -1)
cost.push_back(make_tuple(tmp, i, j));
}
REP(i, n){
v[i].id = i;
v[i].parent = -1;
}
sort(ALL(cost));
REP(i, cost.size()){
node from = v[get<1>(cost[i])];
node to = v[get<2>(cost[i])];
if(judge(from, to)){
continue;
}
res += get<0>(cost[i]);
marge(from, to);
}
cout << res << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int INF = 10000;
template<typename ISTREAM>
void readWeightedGraphMatrix(ISTREAM& cin, vector< vector<int> >& weightedGraphMatrix) {
size_t n;
cin >> n;
int weight;
weightedGraphMatrix = vector< vector<int> >(n, vector<int>(n));
for (size_t i = 0; i != n; ++i) {
for (size_t j = 0; j != n; ++j) {
cin >> weight;
weightedGraphMatrix.at(i).at(j) = weight != -1 ? weight : INF;
}
}
}
int MST(const vector< vector<int> >& weightedGraphMatrix) {
enum Color {
WHITE, GRAY, BLACK//白は未訪問でTと隣接していない、。グレーはTと隣接状態だが未訪問、黒は訪問済み。木は閉路を持たないグラフなので、全域木の計算では
//各点は1度だけ訪問されるはず。
};
const size_t n = weightedGraphMatrix.size();
vector<Color> color(n,Color::WHITE);
vector<int> d(n, INF);
vector<int> p(n, INF);
color.front() = Color::GRAY;
d.front() = 0;
int currentNode = 0;
while (true) {
int min = INF;
int u;
//TからV-Tへ接続する辺の重みの中で最小のものを求める。
//同時に、その辺に接続する辺のT内のノードを求める。
for (size_t i = 0; i != n; ++i) {
if (color.at(i) == Color::BLACK || color.at(i) == Color::WHITE) continue;//訪問済みはスキップ
if (d.at(i) >= min)continue;
min = d.at(i);//TからV-Tの中のノードiへ向かう辺の重みの最小値を更新
u = i;
}
if (min == INF) {
//ノード０からアクセス可能なすべての点を訪問済みになったらMST構築完了
break;
}
color.at(u) = Color::BLACK;//訪問
for (int v = 0; v != n; ++v) {
if (color.at(v) == Color::BLACK) continue;//訪問済みはスキップ
if (weightedGraphMatrix.at(u).at(v) == INF ) continue;
if (weightedGraphMatrix.at(u).at(v) >= d.at(v)) continue;
d.at(v) = weightedGraphMatrix.at(u).at(v);
p.at(v) = u;
color.at(v) = Color::GRAY;
}
}
int sum = 0;
for (int i = 0; i != n; ++i) {
if (p.at(i) == INF)continue;
sum += weightedGraphMatrix.at(i).at(p.at(i));
}
return sum;
}
template<typename T>
void execute(T& cin) {
vector< vector<int> > graphList;
readWeightedGraphMatrix(cin, graphList);
cout << MST(graphList) << endl;
}
int main()
{
execute(cin);
return 0;
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
typedef pair<int, int> P;
typedef pair<ll, P> PP;
int main() {
int N, M;
cin >> N >> M;
map<P, vector<PP>> G;
map<P, ll> dist;
for (int i = 0; i < M; i++) {
int p, q;
ll c;
cin >> p >> q >> c;
p--; q--;
G[P(p, 0)].emplace_back(1, P(p, c));
G[P(p, c)].emplace_back(0, P(p, 0));
G[P(q, 0)].emplace_back(1, P(q, c));
G[P(q, c)].emplace_back(0, P(q, 0));
G[P(p, c)].emplace_back(0, P(q, c));
G[P(q, c)].emplace_back(0, P(p, c));
}
priority_queue<PP, vector<PP>, greater<PP>> Q;
dist[P(0, 0)] = 0;
Q.push(PP(0, P(0, 0)));
while (!Q.empty()) {
PP now = Q.top(); Q.pop();
if (dist[now.second] < now.first) continue;
for (auto e : G[now.second]) {
if (dist.find(e.second) == dist.end() || dist[e.second] > now.first + e.first) {
dist[e.second] = now.first + e.first;
Q.push(PP(dist[e.second], e.second));
}
}
}
if (dist.find(P(N - 1, 0)) == dist.end()) {
cout << -1 << endl;
return 0;
}
cout << dist[P(N - 1, 0)] << endl;
}
| #include <bits/stdc++.h>
#define sc(x) scanf("%d", &x)
#define pr(x) printf("%d\n", x)
#define lowbit(x) (x & -x)
#define ll long long
#define N 500010
using namespace std;
ll tot = 0, head[N], v[N], dis[N], n, m, cnt;
struct Xiao
{
int next, to, w;
}f[N * 3];
void add(int x, int y, int z)
{
f[++tot].to = y;
f[tot].next = head[x];
f[tot].w = z;
head[x] = tot;
}
void spfa()
{
memset(dis, 127, sizeof dis);
memset(v, 0, sizeof v);
queue <int> q;
q.push(1);
v[1] = 1;
dis[1] = 0;
while (q.size())
{
int x = q.front();
q.pop();
for (int i = head[x]; i; i = f[i].next)
{
int y = f[i].to;
if (dis[y] > dis[x] + f[i].w)
{
dis[y] = dis[x] + f[i].w;
if (!v[y])
{
v[y] = 1;
q.push(y);
}
}
}
v[x] = 0;
}
}
map < pair <int, int>, int > p;
int get(int x, int y)
{
if (p.find(make_pair(x, y)) != p.end()) return p[make_pair(x, y)];
else return p[make_pair(x, y)] = ++cnt;
}
int main()
{
//freopen("railway.in", "r", stdin);
//freopen("railway.out", "w", stdout);
sc(n);
sc(m);
cnt = n;
for (int i = 1; i <= m; i++)
{
int x, y, z;
sc(x);
sc(y);
sc(z);
int p1 = get(x, z);
int p2 = get(y, z);
add(p2, p1, 0);
add(p1, p2, 0);
add(x, p1, 1);
add(p1, x, 1);
add(y, p2, 1);
add(p2, y, 1);
}
spfa();
printf("%lld\n", dis[n] > 2 * n ? -1 : dis[n] / 2);
return 0;
}
| 1 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod);
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
//if(i==1)res = false;
if(n%i==0)res=false;
return res;
}
struct UnionFind{
ll N;
llvec p;
llvec cnt;
UnionFind(ll n){
N = n;
p=llvec(N);
cnt=llvec(N, 0);
rep(i, N){
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b){
P at = root(a);
P bt = root(b);
if(at.second!=bt.second){
if(at.first>bt.first){
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second]+=cnt[at.second];
p[a]=bt.second;
}
}
P root(ll a){
ll atmp = a;
ll c=0;
while(atmp!=p[atmp]){
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b){
P at=root(a);
P bt=root(b);
return at.second == bt.second;
}
};
struct dijkstra{
ll N;
llvec d;
vector<vector<edge>> e;
dijkstra(ll n){
N = n;
//d = llvec(N, 1e18);
e = vector<vector<edge>>(N);
}
void add_edge(ll from, ll to, ll cost){
e[from].push_back({to, cost});
}
void run(ll start){
priority_queue<P, vector<P>, greater<P>> que;
que.push({0, start});
d = llvec(N, 1e18);
d[start]=0;
while(!que.empty()){
P q = que.top();que.pop();
ll dc = q.first;
ll x = q.second;
if(dc>d[x]){
continue;
}else{
for(auto ip: e[x]){
if(d[ip.x]<=d[x]+ip.c){
continue;
}else{
d[ip.x]= d[x]+ip.c;
que.push({d[ip.x], ip.x});
}
}
}
}
}
};
/**************************************
** A main function starts from here **
***************************************/
int main(){
ll N, M, Q;
cin >> N >> M >> Q;
vector<llvec> T(N+1, llvec(N+1, 0));
vector<llvec> S(N+1, llvec(N+1, 0));
rep(i, M){
ll a, b;
cin >> a >> b;
T[a][b] += 1;
}
FOR(i, 1, N+1){
FOR(j, 1, N+1){
S[i][j] = S[i][j-1] + T[i][j];
}
}
FOR(i, 1, N+1){
FOR(j, 1, N+1){
S[i][j] += S[i-1][j];
}
}
rep(i, Q){
ll a, b;
cin >> a >> b;
a--;
cout << S[b][b] - S[a][b] - S[b][a] + S[a][a] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long h,w,k,mod=1000000007;
cin >> h >> w >> k;
if(w==1) {
cout << 1 << endl;
return 0;
}
vector<long> sayu(w-1),sonomama(w);
vector<vector<long>> amida(h+1,vector<long>(w));
amida[0][0]=1;
for(long bit=0;bit<(1<<(w-1));bit++) {
bool imp=false;
for(long i=0;i<w-2;i++) {
if((bit&(1<<i))&&(bit&(1<<(i+1)))) imp=true;
}
if(imp) continue;
for(long i=0;i<w-1;i++) if(bit&(1<<i)) sayu[i]++;
if(!(bit&(1<<0))) sonomama[0]++;
if(!(bit&(1<<(w-2)))) sonomama[w-1]++;
for(long i=1;i<w-1;i++) if(!(bit&(1<<(i-1))||bit&(1<<i))) sonomama[i]++;
}
for(long i=0;i<h;i++) {
for(long j=0;j<w-1;j++) {
amida[i+1][j]=(amida[i+1][j]+amida[i][j+1]*sayu[j])%mod;
amida[i+1][j+1]=(amida[i+1][j+1]+amida[i][j]*sayu[j])%mod;
}
for(long j=0;j<w;j++) {
amida[i+1][j]=(amida[i+1][j]+amida[i][j]*sonomama[j])%mod;
}
}
cout << amida[h][k-1] << endl;
} | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <random>
#include <cfloat>
#define norm(X) ((X) * (X))
using namespace std;
template<class T, class Compare = less<T> >
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template<class T, class Compare = greater<T> >
using MinHeap = priority_queue<T, vector<T>, Compare>;
using llong = long long;
const llong s = 1000000;
const double R = 1e11;
llong n;
double px[105];
double py[105];
llong cnt[105];
double x, y;
double r;
double sx, sy;
llong indx;
int main() {
cin >> n;
for (llong i = 0; i < n; i++) {
cin >> px[i];
cin >> py[i];
sx += px[i];
sy += py[i];
}
sx /= n;
sy /= n;
for (llong i = 1; i <= s; i++) {
x = R * cos(i * 2.0 * M_PI / s) + sx;
y = R * sin(i * 2.0 * M_PI / s) + sy;
indx = 0;
r = 1e32;
//cout << x << ' ' << y << endl;
for (llong j = 0; j < n; j++) {
double d = norm(x - px[j]) + norm(y - py[j]);
if (d < r) {
indx = j;
r = d;
}
}
cnt[indx]++;
}
for (llong i = 0; i < n; i++) {
printf("%.*lf\n", DBL_DIG, (double)cnt[i] / (double)s);
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define loop(i,n) rep(i,0,n)
using namespace std;
using ll = long long;
constexpr double pi=3.1415926535897932;
int main(){
int n;
cin >> n;
vector<double> x(n),y(n);
loop(i,n)cin >> x[i] >> y[i];
loop(i,n){
vector<double> theta;
loop(j,n){
if(i==j)continue;
theta.push_back(atan2(y[i]-y[j],x[i]-x[j]));
}
sort(theta.begin(),theta.end());
double probability=0;
if(theta[n-2]-theta[0]<pi)probability=0.5-(theta[n-2]-theta[0])/(2*pi);
else{
loop(i,n-2){
if(theta[i+1]-theta[i]>pi){
probability=-0.5+(theta[i+1]-theta[i])/(2*pi);
break;
}
}
}
cout << setprecision(20) << probability << endl;
}
return 0;
} | 1 |
#include <stdio.h>
struct Dice {
int face1, face2, face3, face4, face5, face6;
};
void roll_for_E(struct Dice *dice);
void roll_for_N(struct Dice *dice);
void roll_for_S(struct Dice *dice);
void roll_for_W(struct Dice *dice);
int main(void)
{
struct Dice dice;
char ch;
scanf("%d%d%d%d%d%d", &(dice.face1), &(dice.face2), &(dice.face3), &(dice.face4), &(dice.face5), &(dice.face6));
(void)getchar();
while((ch=getchar())!='\n') {
if(ch=='E')
roll_for_E(&dice);
if(ch=='N')
roll_for_N(&dice);
if(ch=='S')
roll_for_S(&dice);
if(ch=='W')
roll_for_W(&dice);
}
printf("%d\n", dice.face1);
return 0;
}
void roll_for_E(struct Dice *dice)
{
int temp;
temp = dice->face1;
dice->face1=dice->face4;
dice->face4=dice->face6;
dice->face6=dice->face3;
dice->face3=temp;
}
void roll_for_N(struct Dice *dice)
{
int temp;
temp = dice->face1;
dice->face1=dice->face2;
dice->face2=dice->face6;
dice->face6=dice->face5;
dice->face5=temp;
}
void roll_for_S(struct Dice *dice)
{
int temp;
temp = dice->face1;
dice->face1=dice->face5;
dice->face5=dice->face6;
dice->face6=dice->face2;
dice->face2=temp;
}
void roll_for_W(struct Dice *dice)
{
int temp;
temp = dice->face1;
dice->face1=dice->face3;
dice->face3=dice->face6;
dice->face6=dice->face4;
dice->face4=temp;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
ll solve(){
ll sm=0,ans=0;
ll n,t=0;
cin>>n;
int a[n];
for(int &i:a) cin>>i,sm=(sm+i)%mod;
for(int i=0;i<n;i++){
t=(t+a[i])%mod;
ans=(ans + ((sm-t+mod)%mod)*a[i]%mod )%mod;
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
//cin>>t;
while(t--) cout<<solve()<<'\n';
//while(t--) solve(),cout<<'\n';
return 0;
}
| 0 |
#include <iostream>
using namespace std;
char m[12][13];
void dfs(int x, int y)
{
int i, j, nx, ny;
m[y][x] = '0';
for (i = 1; i >= -1; i--)
{
if (i == 1 || i == -1)
{
nx = x;
ny = y + i;
if (0 <= nx && nx < 12 && 0 <= ny && ny < 12 && m[ny][nx] == '1') dfs(nx, ny);
}
else
{
for (j = 1; j >= -1; j--)
{
nx = x + j;
ny = y + i;
if (0 <= nx && nx < 12 && 0 <= ny && ny < 12 && m[ny][nx] == '1') dfs(nx, ny);
}
}
}
return;
}
int main()
{
int i, j, n;
while (1)
{
for (i = 0; i < 12; i++)
{
cin >> m[i];
if (cin.eof()) return 0;
}
n = 0;
for (i = 0; i < 12; i++)
{
for (j = 0; j < 12; j++)
{
if (m[i][j] == '1')
{
n++;
dfs(j, i);
}
}
}
cout << n << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define INF -1000000000000000
#define pb push_back
#define sz(a) int((a).size())
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
ll n,ara[200005];
vector< vector<ll> > dp(200005, vector<ll> (5,INF));
ll f(ll i, ll j){
if(i>n) return 0;
if(dp[i][j]!=INF) return dp[i][j];
if(j==0){
if(i>=n) return 0;
dp[i][j] = ara[i] + max(max(f(i+2,0),f(i+3,3)),f(i+4,1));
return dp[i][j];
}
if(j==2) return dp[i][j] = ara[i] + max(f(i+2,2),f(i+3,1));
if(j==3) return dp[i][j] = ara[i] + max(f(i+2,3),f(i+3,1));
else return dp[i][j] = ara[i] + f(i+2,1);
}
int main(){
ll i;
cin>>n;
for(i=1;i<=n;i++) cin>>ara[i];
if(n%2==1){
cout<<max(max(f(1,0),f(2,2)),f(3,1))<<endl;
}
else{
cout<<max(f(1,2),f(2,1))<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int counter=1;
int cnt=0;
while(counter<b){
counter--;
counter+=a;
cnt++;
}
cout<<cnt<<endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
using Graph = vector<vector<int>>;
const unsigned long long mod = 1e9 + 7;
const long long INF = 1LL<<60;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
int main(void){
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, k = 1;
cin >> a >> b;
FOR(i, 0, 100)
{
if(k>=b){
cout << i << endl;
return 0;
}
else{
k += (a - 1);
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b; cin >> a >> b;
cout << (a <= 8 && b <= 8 ? "Yay!" : ":(") << "\n";
return 0;
}
| #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
/*
string s1;
getline( cin, s1 );
int n1 = s1.size();
*/
int a, b;
cin >> a >> b ;
if( 2*a <= 16 && 2*b <= 16 ){
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
return 0;
}
| 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;
LL N;
vector<LL>A;
vector<LL>xmos;
const LL MOD = 1000000007;
LL solvedp(vector<pair<LL, int>>& vec, LL lasval) {
LL zero = 1, notz = 0;
LL zpar = 1, npar = 0;
for (auto p : vec) {
if (p.first == 0) {
zpar = (notz * p.second) % MOD;
zero += zpar;
zero %= MOD;
}
else {
npar = (zero * p.second) % MOD;
notz += npar;
notz %= MOD;
}
}
if (lasval == 0) {
return zpar;
}
return npar;
}
int main() {
cin >> N;
LL xsum = 0;
xmos.push_back(0);
for (int i = 0; i < N; ++i) {
LL tmp;
cin >> tmp;
A.push_back(tmp);
xsum ^= tmp;
xmos.push_back(xsum);
}
/*vector<LL>dp(N + 1);
dp[1] = 1;
LL odd = 1, eve = 0;
for (int i = 2; i <= N; ++i) {
if (i % 2) {
dp[i]++;
dp[i] += eve;
dp[i] %= MOD;
odd += dp[i];
odd %= MOD;
}
else {
dp[i] += odd;
eve += dp[i];
eve %= MOD;
}
}*/
if (xsum != 0) {
vector<pair<LL, int>>nowarr;
for (int i = 1; i <= N; ++i) {
if (xmos[i] == 0) {
nowarr.push_back({ 0,1 });
}
if (xmos[i] == xsum) {
nowarr.push_back({ xsum,1 });
}
}
LL ans = solvedp(nowarr, xsum);
cout << ans << endl;
}
else {
map<LL, int>zerolas;
map<LL, vector<pair<LL, int>>>arrs;
int zerocnt = 0;
LL zerotwo = 1;
for (int i = 1; i <= N; ++i) {
if (xmos[i] == 0) {
zerocnt++;
if (i < N) {
zerotwo *= 2;
zerotwo %= MOD;
}
}
else {
if (zerocnt != zerolas[xmos[i]]) {
arrs[xmos[i]].push_back({ 0,zerocnt - zerolas[xmos[i]] });
zerolas[xmos[i]] = zerocnt;
}
arrs[xmos[i]].push_back({ xmos[i],1 });
}
}
LL ans = zerotwo;
for (auto& elm : arrs) {
if (elm.second.back().second != 0) {
elm.second.push_back({ 0,1 });
}
ans += solvedp(elm.second, 0);
ans %= MOD;
}
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
#include <set>
#define _USE_MATH_DEFINES
#include <cmath>
#include <math.h>
#include <iomanip>
#include <list>
#include <limits>
using namespace std;
class cPartition
{
int mn;
int mpi;
vector<int> m_va;
public:
cPartition(int n, vector<int> &va)
: mn(n)
{
m_va = va;
}
void partition();
void output();
};
void cPartition::partition()
{
int p = 0;
int r = m_va.size() - 1;
int x = m_va[r];
int i = p - 1;
for (int j = p; j <= r - 1; ++j)
{
if (m_va[j] <= x)
{
++i;
swap(m_va[i], m_va[j]);
}
}
swap(m_va[i + 1], m_va[r]);
mpi = i + 1;
}
void cPartition::output()
{
for (int i = 0; i < mn - 1; ++i)
{
if (i == mpi)
{
cout << "[" << m_va[i] << "]" << " ";
}
else
{
cout << m_va[i] << " ";
}
}
cout << m_va[mn - 1] << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
cin.ignore();
int a;
vector<int> va;
for (int i = 0; i < n; ++i)
{
cin >> a;
va.push_back(a);
}
cPartition cp(n, va);
cp.partition();
cp.output();
return 0;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+1;
double s[N];
int n,m;ll k;
int a[N],p[N],u[N],tmp[N];
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
int main(){
n=read();
for(int i=1;i<=n;i++) a[i]=read();
m=read();scanf("%lld",&k);
for(int i=1;i<=n;i++) p[i]=i,u[i]=i;
for(int i=1;i<=m;i++){
int x=read();
swap(p[x],p[x+1]);
}
while(k){
if(k&1){
for(int i=1;i<=n;i++) tmp[i]=u[p[i]];
for(int i=1;i<=n;i++) u[i]=tmp[i];
}
for(int i=1;i<=n;i++) tmp[i]=p[p[i]];
for(int i=1;i<=n;i++) p[i]=tmp[i];
k>>=1;
}
for(int i=1;i<=n;i++) s[i]=a[u[i]]-a[u[i]-1]+s[i-1];
for(int i=1;i<=n;i++) printf("%.1lf\n",s[i]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T,class U> void outs(T a,U b){if((ll)(a)>=inf-100||(ll)(a)<=-inf+100)out(b);else out(a);}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
int main(){
ll n;cin>>n;
string s;cin>>s;
vector<pair<string,string>> a,b;
rep(bit,1<<n){
string t,u;
rep(i,n){
if(bit>>i&1)t+=s[i];
else u+=s[i];
}
a.eb(t,u);
}
rep(bit,1<<n){
string t,u;
rep(i,n){
if(bit>>i&1)t+=s[n*2-1-i];
else u+=s[n*2-1-i];
}
b.eb(t,u);
}
sort(all(a));
sort(all(b));
//outv(a);outv(b);
ll ans=0;
for(auto x:a){
ans+=ub(b,x)-lb(b,x);
}
out(ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
//{{{ templates
#define TMPINL_(...) template<__VA_ARGS__>inline
#define TT_ TMPINL_(typename T)
#define TTF_ TMPINL_(typename T,typename F)
#define TTTS_ TMPINL_(typename T,typename...Ts)
#define TITS_ TMPINL_(size_t I=0,typename...Ts)
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TITS_ typename enable_if<I==tuple_size<tuple<Ts...>>::value-1,string>::type join(string s,tuple<Ts...>t){return to_string(get<I>(t));}
TITS_ typename enable_if<I<tuple_size<tuple<Ts...>>::value-1,string>::type join(string s,tuple<Ts...>t){return to_string(get<I>(t))+s+join<I+1>(s,t);}
TT_ string join(string s,T t){return to_string(t);}
TTTS_ string join(string s,T t,Ts...ts){return join(s,t)+s+join(s,ts...);}
inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
inline int puts(const string&s){ return puts(s.c_str()); }
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
int main()
{
ll way[128][128];
for (int i = 0; i < 128; i++){
for (int j = 0; j < 128; j++){
way[i][j] = 1ll << 60;
}
}
for (int i = 0; i < 128; i++) way[i][i] = 0;
int V, E;
V = in(), E = in();
for (int i = 0; i < E; i++){
int s, t, d;
s = in(), t = in(), d = in();
way[s][t] = d;
}
for (int k = 0; k < V; k++){
for (int i = 0; i < V; i++){
for (int j = 0; j < V; j++){
way[i][j] = min(way[i][j], way[i][k] + way[k][j]);
}
}
}
for (int i = 0; i < V; i++){
if (way[i][i] < 0){
puts("NEGATIVE CYCLE");
return 0;
}
}
for (int i = 0; i < V; i++){
for (int j = 0; j < V; j++){
if (way[i][j] >= (1ll << 59)) cout << "INF";
else cout << way[i][j];
if (j == V - 1) cout << "\n";
else cout << " ";
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d){
long long count = 0;
long long f1 = 1;
long long f2 = 1;/*ここを変える*/
long long temp;
if(d == 1){
count = f1;
}else if(d == 2){
count = f2;
}else if(d==0){
count = 1;
}else{
for(int i=0;i<d-2;i++){
temp = f1+f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*ここから*/
int main() {
int N,L;
cin >> N >> L;
int R = N+L-1;
long ans=0;
if(L>0){
for(int i=0;i<N;i++){
ans += L+i;
}
cout << ans - L << endl;
}
if(L<=0&&R>=0){
for(int i=0;i<N;i++){
ans += L+i;
}
cout << ans << endl;
}
if(R<0){
for(int i=0;i<N;i++){
ans += L+i;
}
cout << ans-R << endl;
}
} | 0 |
#include<cstdio>
#define int long long
int D;
int calc(int A,int t,int first){
if(!t)return A==0;
int v=(A%10+10)%10;
int res=0;
res+=(10-v-first)*calc((A-t*v)/10,t/100,0);
res+=(v-first)*calc((A+(10-v)*t)/10,t/100,0);
return res;
}
signed main() {
scanf("%lld",&D);
if(D%9)return puts("0"),0;
D/=9;
int ans=0,p10=10;
for(int i=2;i<=18;i++){
int tot=(i%2)*9+1;
ans+=tot*calc(D,p10/9,1);
p10*=10;
}
printf("%lld\n",ans);
} | #include <iostream>
using namespace std;
int func(int y,int z,int e){
return y+z+e-y*y-z*z*z;
}
int main(){
int e;
while(cin>>e){
if(e==0)break;
int min=10000000;
for(int y=0;y*y<=e;y++){
for(int z=0;(z*z*z+y*y)<=e;z++){
int ans = func(y,z,e);
// cout<<"y="<<y<<"z="<<z<<endl;
if(ans<=0)break;
if(min>=ans){
min=ans;
}
}
}
cout<<min<<endl;
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
int main(){
long long int x;
cin>>x;
long long int sum;
sum = (x/500)*1000;
x -= (x/500)*500;
sum += (x/5)*5;
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
int main()
{
//Opy;
/*-------------------------------------------------
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
-------------------------------------------------*/
ll a, h = 0;
cin>> a;
h += (a - (a % 500)) * 2;
a %= 500;
h += a - (a % 5);
cout<< h<< endl;
return 0;
}
| 1 |
//
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T>
vector<T> make_vec_nd(T init, size_t size) {
return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, size_t size, Args... rest) {
auto inner = make_vec_nd(init, rest...);
return vector<decltype(inner)>(size, inner);
}
#define rep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,a,b) for(ll i=(a)-1;i>=(b);i--)
vector<vector<ll>> graph;
vector<bool> visited;
void dfs(ll now) {
visited[now] = true;
for (ll to : graph[now]) {
if (!visited[to]) {
dfs(to);
}
}
}
int main() {
ll N, M;
cin >> N >> M;
graph.resize(2*N);
rep(i,0,M) {
ll a, b;
cin >> a >> b;
a--;
b--;
graph[2*a].push_back(2*b+1);
graph[2*b+1].push_back(2*a);
graph[2*a+1].push_back(2*b);
graph[2*b].push_back(2*a+1);
}
visited.resize(2*N);
dfs(0);
ll cnt = 0;
rep(i,0,N) {
if (visited[2*i]) {
cnt++;
}
}
ll ans = 0;
rep(i,0,N) {
bool have_true = false;
bool have_false = false;
for (ll to : graph[2*i]) {
to /= 2;
if (visited[2*to]) {
have_true = true;
} else {
have_false = true;
}
}
ll ans_loc = 0;
if (have_true) {
ans_loc += cnt;
if (visited[2*i]) {
ans_loc--;
}
}
if (have_false) {
ans_loc += N - cnt;
if (!visited[2*i]) {
ans_loc--;
}
}
// cout << i+1 << ":" << ans_loc << endl;
ans += ans_loc;
}
cout << ans / 2 - M << endl;
}
| #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 1001001001;
const long long LINF = 1001002003004005006ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int,int> P;
using Graph = vector<vector<int>>;
// 二部グラフ判定
vector<int> color;
bool dfs(const Graph &G, int v, int cur = 0) {
color[v] = cur;
for (auto next_v : G[v]) {
// 隣接頂点がすでに色確定していた場合
if (color[next_v] != -1) {
if (color[next_v] == cur) return false; // 同じ色が隣接したらダメ
continue;
}
// 隣接頂点の色を変えて、再帰的に探索 (一回でも false が返ってきたら false)
if (!dfs(G, next_v , 1 - cur)) return false;
}
return true;
}
int main(){
int n,m;
cin >> n >> m;
Graph G(n);
rep(i,m){
int a,b;
cin >> a >> b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
color.assign(n, -1);
bool is_bipartite = dfs(G,0);
if(is_bipartite){
int b=0;int w=0;
rep(i,n){
if(color[i]==0)b++;
else w++;
}
cout << (ll)b*w - m << endl;
}else{
cout << (ll)n*(n-1)/2 - m << endl;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
int main()
{
fastread();
ll n,m;
cin>>n>>m;
ll a,b;
cin>>a>>b;
for(ll i=0;i<m-1;i++)
{
ll a1,b1;
cin>>a1>>b1;
a=max(a,a1);
b=min(b,b1);
}
cout<<max(b-a+1,0ll)<<endl;
}
| /*
Motto - try hard to become an expert
*/
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
//define
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=n;i--)
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define INF (int)INT_MAX
#define all(v) v.begin(), v.end()
#define endl "\n"
//typedef
typedef long long int ll;
typedef long double ld;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector< pii > vii;
typedef std::vector< ll > vll;
typedef std::vector< std::pair < pii, int > > vpp;
const int N = 3*1e5 +5 ;
const long long MOD = 1e9 + 7;
const long long inf = 1e18;
using namespace std;
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%MOD;
x=x*x%MOD;
n>>=1;
}
return res;
}
ll modFact(ll n, ll p)
{
if (n >= p)
return 0;
ll result = 1;
for (ll i = 1; i <= n; i++)
result = (result * i) % p;
return result;
}
bool isPrime(int x)
{
if(x%2==0)
return 0;
for(int i=3;i<=sqrt(x);i+=2)
{
if(x%i==0)
return 0;
}
return 1;
}
ll binomialCoeff(ll n, ll k)
{
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= min(i, k); j++)
{
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = (C[i - 1][j - 1] +
C[i - 1][j])%MOD;
}
}
return C[n][k];
}
bool compare(const pair<int,int> &a , const pair<int,int>&b){
//set<pair<int,int> , decltype(&compare)>s(&compare) ;
if(a.fi!=b.fi)return a.se<b.se ;
return a.fi<b.fi;
}
// struct compare{
// // for priority_queue
// bool operator()(const int &a , const int&b){
// return a<b ;
// }
// };
void solve()
{
int n , m ;
cin>>n>>m;
vector<int>L(m) , R(m) ;
rep(i , m){
cin>>L[i]>>R[i] ;
}
int mal = INT_MIN ;
int mir = INT_MAX ;
rep(i , m){
mal = max(L[i] , mal) ;
mir = min(mir , R[i]) ;
}
int ans= 0 ;
repu(i , 1 , n){
if(mal<=i && mir>=i){
ans++;
}
}
cout<<ans<<endl;
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int t = 1;
//cin>>t;
while(t--)
{
solve();
}
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
string s;
vector<vector<char>> v(h+2, vector<char>(w+2));
for(int i=0; i<h+2; i++) {
if(i==0 || i==h+1) for(int j=0; j<w+2; j++) v[i][j] = '.';
else {
cin >> s;
for(int j=0; j<w+2; j++) {
if(j==0 || j==w+1) v[i][j] = '.';
else v[i][j] = s[j-1];
}
}
}
bool check = true;
for(int i=0; i<h+2; i++) {
for(int j=0; j<w+2; j++) {
if(v[i][j]=='#') {
if(v[i-1][j]!='#' && v[i+1][j]!='#' && v[i][j-1]!='#' && v[i][j+1]!='#') check = false;
}
}
}
if(check) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <vector>
//#define rep(i,n) for(int i = 0; i , (n); ++i)
using ll = long long;
using namespace std;
int sum(int n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
int main() {
int N, W;
cin >> N >> W;
vector<vector<char>>A(N, vector<char>(W));
for (int i = 0;i < N;i++) {
for (int j = 0;j < W;j++) {
cin >> A.at(i).at(j);
}
}
bool hantei = true;
for (int i = 0;i < N;i++) {
for (int j = 0;j < W;j++){
if (j>0&&j<(W-1)&&i>0&&i<(N-1)&&A.at(i).at(j) == '#'&&A.at(i + 1).at(j) == '.' && A.at(i - 1).at(j) == '.' &&
A.at(i).at(j + 1) == '.' && A.at(i).at(j - 1) == '.') {
hantei=false;
break;
}
}
if (hantei == false) {
break;
}
}
if (hantei) {
cout << "Yes";
}
else {
cout << "No";
}
}
| 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll A, B;
cin >> A >> B;
cout << max({A - B, A + B, A * B}) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
while(cin >> a >> b )
{
cout << max(a+b,max(a-b,a*b)) << endl;
}
}
| 1 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
ll Max(ll(a), ll(b), ll(c)) {
return max(max(a, b), c);
}
ll Min(ll(a), ll(b), ll(c)) {
return min(min(a, b), c);
}
ll gcd(ll(a), ll(b)) {
ll c = a;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
int main() {
ll N,K,G,M;
cin >> N >> K;
ll A;
cin >> A;
G = A;
M = A;
string an = "POSSIBLE";
rep(i, N-1) {
cin >> A;
G = gcd(G, A);
M = max(M, A);
}
if (K % G != 0 || K > M) {
an = "IM" + an;
}
cout <<an << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#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++)
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; }
// 最大公約数(ユークリッドの互除法)
// O(log max(a, b))
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(){
int n, k, g;
bool ans = false;
cin >> n >> k;
vector<int> a(n), b(n-1);
rep(i, n){
cin >> a.at(i);
}
sort(a.begin(), a.end());
g = a.at(0);
rep2(i, 1, n){
if(a.at(i) != a.at(i-1)) g = gcd(g, a.at(i) - a.at(i-1));
}
rep(i, n){
if(a.at(i) == k) {
ans = true;
break;
}
if((a.at(i) - k) > 0 && (a.at(i) - k) % g == 0) {
ans = true;
break;
}
}
if(ans) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
int main()
{
int r,g;
cin>>r>>g;
cout<<((g*2)-r);
cout<<nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B;
cin>>A>>B;
ll ans=0;
for(ll i=A;i<=B;i++) {
string S=to_string(i);
if(S[0]==S[4]&&S[1]==S[3]) {
ans++;
}
}
cout<<ans<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int INF = 1e9;
const ll INFll = 1e18;
#define put(n) cout<<(n)<<endl
#define Cout(n) cout<<(n)
#define rep(i,num,N) for(int(i)=(num);(i)<(N);++(i))
#define rrep(i,num,N) for(int (i)=(num);(i)>(N);--(i))
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin() , (v).rend()
#define MP make_pair
#define pb(q) push_back(q)
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,K;
while(cin>>N>>K,N!=0&&K!=0){
set<string> num;
vector<string> card(N);
rep(i,0,N) cin>>card[i];
sort(all(card));
do{
string s = "";
rep(i,0,K) s += card[i];
num.insert(s);
}while(next_permutation(all(card)));
put(num.size());
}
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
int n, k;
while(cin >> n, n) {
cin >> k;
set<string> SET;
vector<string> vs(n); FOR(i,0,n) cin >> vs[i];
FOR(i,0,1<<n) {
vector<int> v;
int cnt = 0;
FOR(j,0,n) {
if((i>>j)&1) {
cnt++;
v.push_back(j);
}
}
if(cnt != k) continue;
do {
string s = "";
FOR(l,0,k) s = s + vs[v[l]];
SET.insert(s);
} while(next_permutation(v.begin(), v.end()));
}
cout << SET.size() << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define nl '\n'
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int MOD = 998244353;
const int N = 2*1e5;
int main(){
AC
int n, m;
cin>>n>>m;
if(n%2!=0){
for(int i=1; i<=m; i++){
cout<<i<<" "<<n-i<<endl;
}
}
else{
int odd = (m+1)/2;
for (int i = 1; i<=odd; i++)
cout << i << ' ' << n-i+1 << '\n';
for (int i = odd+1; i<=m; i++)
cout << i << ' ' << n-i << '\n';
}
} | /*input
8 3
*/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
for (int i = 1; i <= m; ++i) {
if (n%2 == 0 && i == n/2/2+1) l++;
cout << l << " " << r << endl;
l++; r--;
}
return 0;
} | 1 |
///not today
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef pair<long long, long long> pll;
#define SZ(x) (int)(x).size()
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define xmax(x, y) (x) = max((x), (y))
#define xmin(x, y) (x) = min((x), (y))
#define F first
#define S second
#define int long long
#define accept_sho ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define lc (v << 1)
#define rc ((v << 1)| 1)
#define mid ((R + L) >> 1)
const int maxn = 3e2 + 2;
int dp[maxn][maxn][maxn];
int32_t main(){
string s;
int K, n;
cin >>s >>K;
n = SZ(s);
for(int k = 0; k <= K; k ++){
for(int j = 0; j < n; j ++){
for(int i = 0; i + j < n; i ++){
dp[k][j][i] = 1;
if(j == 0)
continue;
if(s[i] == s[i + j]){
if(j > 1){
dp[k][j][i] = dp[k][j - 2][i + 1] + 2;
}
else{
dp[k][j][i] = 2;
}
}
else{
xmax(dp[k][j][i], dp[k][j - 1][i]);
xmax(dp[k][j][i], dp[k][j - 1][i + 1]);
if(k){
if(j > 1){
xmax(dp[k][j][i], dp[k - 1][j - 2][i + 1] + 2);
}
else{
dp[k][j][i] = 2;
}
}
}
}
}
}
cout <<dp[K][n - 1][0] <<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int x;
x = 1;
for(int i = 0; i < N; i++){
if(2 * x > x + K)
x = x + K;
if(2 * x <= x + K)
x = 2 * x;
}
cout << x << endl;
} | 0 |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
int year[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
string day[7] = {"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
int first = 3;
int m, d;
while (true) {
cin >> m >> d;
if (!(m|d)) break;
int n = first;
for (int i = 0; i < m-1; i++) {
n += year[i];
}
n += d-1;
n %= 7;
cout << day[n] << endl;
}
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 +c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
const int MOD = 1000000007;
int N,M,s[2],l[2];
int inc(int a,int b) {
return a + b >= MOD ? a + b - MOD : a + b;
}
int mul(int a,int b) {
return 1LL * a * b % MOD;
}
void update(int &x,int y) {
x = inc(x,y);
}
void Solve() {
read(N);read(M);
int x;
for(int i = 1 ; i <= N ; ++i) {
read(x);
x = (x + MOD) % MOD;
update(l[0],inc(mul(i - 1,x),MOD - s[0]));
update(s[0],x);
}
int y;
for(int i = 1 ; i <= M ; ++i) {
read(y);
y = (y + MOD) % MOD;
update(l[1],inc(mul(i - 1,y),MOD - s[1]));
update(s[1],y);
}
out(mul(l[0],l[1]));
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
}
| 0 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int a,b,sa;
cin>>a>>b;
sa = max(a+b,a-b);
sa = max(a*b,sa);
cout<<sa;
return 0;
} | //Radhe Radhe
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,a,b,c,d,j,k;
cin>>a>>b>>c;
cout<<max(a+b,max(a*b,a-b));
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N, A[1000000], cnt;
void Out(const vector<int> G) {
cout << G.size() << endl;
cout << G.back();
for (int i = G.size() - 2; i >= 0; i--) {
cout << ' ' << G[i];
}
cout << endl;
cout << cnt << endl;
for (int i = 0; i < N; i++)
cout << A[i] << endl;
}
void InsertionSort(int g) {
for (int i = g; i < N; i++) {
int v = A[i], j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
cnt++;
}
A[j + g] = v;
}
}
void ShellSort(const vector<int> G) {
cnt = 0;
for (int i = G.size() - 1; i >= 0; i--) {
InsertionSort(G[i]);
}
}
int main()
{
vector<int> G;
cin >> N;
int calc = 1;
while (calc <= N) {
G.push_back(calc);
calc = calc * 3 + 1;
}
for (int i = 0; i < N; i++)
cin >> A[i];
ShellSort(G);
Out(G);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IL inline
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define repd(i,j,k) for(int i=j;i>=k;--i)
#define pb push_back
#define db double
#define mp make_pair
#define mp3(a,b,c) mp(mp(a,b),c)
#define pii pair<int,int>
#define piii pair<pii,int>
#define fr first
#define se second
#define ll long long
#define ull unsigned long long
#define pbc(x) __builtin_popcount(x)
#define clr(x) memset(x,0,sizeof x)
#define SIZE(x) (int)(x.size())
const int mod=1e9+7;
IL int pls(int x,int y){x+=y;return x>=mod?x-mod:x;}
IL int dec(int x,int y){x-=y;return x<0?x+mod:x;}
IL int mul(int x,int y){return 1ll*x*y%mod;}
IL int mul(int x,int y,int z){return mul(mul(x,y),z);}
IL int mul(int x,int y,int z,int p){return mul(mul(x,y),mul(z,p));}
IL void add(int &x,int y){x+=y;x=(x>=mod)?x-mod:x;}
IL int fpw(int x,int y,int r=1){for(;y;y>>=1,x=mul(x,x))if(y&1)r=mul(r,x);return r;}
IL int inv(int x){return fpw(x,mod-2);}
IL int gi(){int x;int _w=scanf("%d",&x);return x;}
IL void gi(int &x){int _w=scanf("%d",&x);}
IL void write(int x){printf("%d\n",x);}
void chkmax(int &x,int y){x=(x>y)?x:y;}
void chkmin(int &x,int y){x=(x<y)?x:y;}
const int INF=0x3f3f3f3f;
template<typename T>IL void debug(T x){cerr<<x;return;}
/* --------------------------------------------------------------------------------------------------------- */
const int maxn=1e5+10;
int n,m,a[maxn];
namespace sub1{
IL bool check(){
rep(i,1,m)if(a[i]&1)return false;
return true;
}
IL void work(){
rep(i,1,m)printf("%d ",a[i]);
putchar('\n');
vector<int>b;
b.pb(1);
rep(i,1,m-1)b.pb(a[i]);
b.pb(a[m]-1);
printf("%d\n",b.size());
rep(i,0,b.size()-1)printf("%d ",b[i]);
}
}
namespace sub2{
IL bool check(){
int cnt=0;
rep(i,1,m)if(a[i]&1)cnt++;
return cnt==1;
}
IL void work(){
int pos;
rep(i,1,m)if(a[i]&1)pos=i;
swap(a[m],a[pos]);
rep(i,1,m)printf("%d ",a[i]);
putchar('\n');
vector<int>b;
b.pb(1);
rep(i,1,m-1)b.pb(a[i]);
if(a[m]!=1)b.pb(a[m]-1);
printf("%d\n",b.size());
rep(i,0,b.size()-1)printf("%d ",b[i]);
}
}
namespace sub3{
IL bool check(){
int cnt=0;
rep(i,1,m)if(a[i]&1)cnt++;
return cnt==2;
}
IL void work(){
int pos;
rep(i,1,m)if(a[i]&1)pos=i;
swap(a[1],a[pos]);
rep(i,2,m)if(a[i]&1)pos=i;
swap(a[m],a[pos]);
rep(i,1,m)printf("%d ",a[i]);
putchar('\n');
vector<int>b;
b.pb(a[1]+1);
rep(i,2,m-1)b.pb(a[i]);
if(a[m]!=1)b.pb(a[m]-1);
printf("%d\n",b.size());
rep(i,0,b.size()-1)printf("%d ",b[i]);
}
}
int main(){
#ifdef LOCAL
freopen("/home/noilinux/Desktop/input.txt","r",stdin);
#endif
n=gi(),m=gi();
rep(i,1,n)a[i]=gi();
if(sub1::check())sub1::work();else if(sub2::check())sub2::work();
else if(sub3::check())sub3::work();else printf("Impossible\n");
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << i << " "; cerr << endl;} while(0)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool umin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}
template<typename A,size_t N,typename T> void FILL(A (&array)[N],const T &val){fill((T*)array,(T*)(array+N),val);}
template<typename T> void FILL(vector<T> &v, const T &x) {fill(v.begin(), v.end(), x);}
template<typename T> void FILL(vector<vector<T>> &v, const T &x) {for(auto &i:v)fill(i.begin(), i.end(), x);}
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
if(a[0]!=0) {
cout << -1 << endl;
return 0;
}
ll ans = 0;
rep(i,1,n) {
cerr << i-1 << " " << a[i-1] << " " << ans << endl;
if(a[i]==0) {
continue;
}
if(a[i] > a[i-1]+1) {
cout << -1 << endl;
return 0;
}
if(a[i] == a[i-1]+1) {
ans++;
}
else /* if(a[i] <= a[i-1]) */ {
ans += a[i];
}
}
cout << ans << endl;
}
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define ALL(x) (x).begin(),(x).end()
using namespace std;
const int MAXN = 200005;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
vector<int>A(n);
for(int i=0;i<n;i++){
cin >> A[i];
}
int flag= 1;
while(k--&&flag){
flag = 0 ;
vector<int>B(n);
for(int i=0;i<n;i++){
B[max(0,i-A[i])]++;
if(i+A[i]+1<n)
B[i+A[i]+1]--;
}
for(int i=1;i<n;i++){
B[i]+=B[i-1];
//cout << B[i] <<" \n"[i=n-1];
if(B[i]!=n)
flag=1;
}
if(B[0]!=n)
flag=1;
A=B;
}
for(int i=0;i<n;i++)
cout <<A[i]<<" ";
return 0;
}
| 0 |
#include <iostream>
const int N = 7;
typedef struct {
int panels[N];
int upper;
int east;
int south;
} Dice;
void rotate_dice(int *x, int *y, int d) {
*x = *y;
*y = d;
}
int main(void) {
Dice dice;
for (int i = 1; i < N; i++) {
std::cin >> dice.panels[i];
}
dice.upper = 1;
dice.east = 3;
dice.south = 2;
std::string input;
std::cin >> input;
for (int i = 0; i < input.size(); i++) {
char m = input[i];
if (m == 'E') {
rotate_dice(&dice.east, &dice.upper, N - dice.east);
} else if (m == 'W') {
rotate_dice(&dice.upper, &dice.east, N - dice.upper);
} else if (m == 'S') {
rotate_dice(&dice.south, &dice.upper, N - dice.south);
} else {
rotate_dice(&dice.upper, &dice.south, N - dice.upper);
}
}
std::cout << dice.panels[dice.upper] << std::endl;
return 0;
} | /*___________Bismillahir Rahmanir Rahim__________*/
//Think positive, be positive and never use negative words
#include<bits/stdc++.h>
#define ll long long int
#define uni(a) a.erase(unique(a.begin(),a.end()),a.end())
#define vsum(a) accumulate(a.begin(),a.end(),0)
#define vmax(a) *max_element(a.begin(),a.end())
#define vmin(a) *min_element(a.begin(),a.end())
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/gcd(a,b))*b
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
ll x=(s[0]=='R');
ll y=(s[1]=='R');
ll z=(s[2]=='R');
if(x && y && z) cout<<3<<endl;
else if((x && y) || (y && z)) cout<<2<<endl;
else if(x || y || z) cout<<1<<endl;
else cout<<0<<endl;
return 0;
}
/*_________________Alhamdulillah_________________*/
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int A, B, M;
std::cin >> A >> B >> M;
std::vector<int> a(A), b(B), x(M), y(M), c(M);
rep(i, A) std::cin >> a[i];
rep(i, B) std::cin >> b[i];
rep(i, M) {
std::cin >> x[i] >> y[i] >> c[i];
}
int minv = 1000000;
rep(i, M) {
minv = min(minv, a[x[i]-1] + b[y[i]-1] - c[i]);
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
minv = min(minv, a[0] + b[0]);
std::cout << minv << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
const int N = 100005;
int n, m, q, a[N], b[N];
void solve() {
read(n), read(m), read(q);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
for (int i = 1; i <= m; ++i) {
read(b[i]);
}
int ans = *std::min_element(a + 1, a + 1 + n) + *std::min_element(b + 1, b + 1 + m);
for (int i = 1; i <= q; ++i) {
int x, y, c;
read(x), read(y), read(c);
ans = std::min(ans, a[x] + b[y] - c);
}
print(ans);
}
int main() {
int T = 1;
// read(T);
while (T--) {
solve();
}
}
| 1 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define SIZE(a) int((a).size())
#define out(a) cout<<(a)<<endl;
const int INF=INT_MAX;
const int MAX = 510000;
const ll MOD = 1000000007;
int main(){
int n;cin>>n;
vin x(0),y(0),xx(n),yy(n);
set<int> s1,s2;
vvb g(8,vb(8,false));
rep(i,0,n){
int x1,y1;cin>>x1>>y1;
s1.insert(x1+y1);s2.insert(x1-y1);
g[x1][y1]=true;
xx[i]=x1;yy[i]=y1;
}
rep(i,0,8){
if(find(xx.begin(),xx.end(),i)==xx.end()){x.push_back(i);}
if(find(yy.begin(),yy.end(),i)==yy.end()){y.push_back(i);}
}
do{
bool ok=true;
set<int> ss1=s1,ss2=s2;
rep(i,0,8-n){
if(find(ss1.begin(),ss1.end(),x[i]+y[i])!=ss1.end()){ok=false;break;}
else{ss1.insert(x[i]+y[i]);}
if(find(ss2.begin(),ss2.end(),x[i]-y[i])!=ss2.end()){ok=false;break;}
else{ss2.insert(x[i]-y[i]);}
}
if(ok){
rep(i,0,8-n){
g[x[i]][y[i]]=true;
}
rep(i,0,8){
rep(j,0,8){
if(g[i][j]){cout<<'Q';}
else{cout<<'.';}
}
cout<<endl;
}
break;
}
}while(next_permutation(x.begin(),x.end()));
}
| // Phttps://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
using Graph = vector<vector<ll>>;
const ll INF = 1LL << 60;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
const ll tl= 1'000'000'007;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ind(...) long double __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << endl;} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#define in1(A) REP(i,A.size()) in(A[i]);
#define in2(A,B) REP(i,A.size()) in(A[i],B[i]);
#define in3(s,t,u) REP(i,sz(s)){in(s[i] , t[i] , u[i]);}
#define in4(s,t,u,v) REP(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);}
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
struct Point{ ld x,y; };
ld dist(Point a, Point b){return sqrt(abs(a.x-b.x)*abs(a.x-b.x)+abs(a.y-b.y)*abs(a.y-b.y));} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a,ll b){ return a / gcd(a,b) * b;}
ll fact(ll n){ if(n < 2) return 1; return (n * fact(n-1))%tl; } //階乗
inline ll updiv(ll a,ll b){ return (a + b - 1) / b; } //切り上げ
template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
//-------------------------------------------------------------------------------------------------
ll n=8;
vvl bd(n,vl(n,0));
vvl memo(n); //-1,0,1
vector<pair<ll,ll>>A;
void queen_dfs(int cnt, int p,vvl bd, vvl old_memo){
bd[cnt][p]=1;
if(cnt==n-1){
int f=1;
each(x,A){
if(!bd[x.first][x.second]) f=0;
}
if(f){
REP(i,n){
REP(j,n){
cout << ((bd[i][j])?"Q":".");
}out();
}
}
return;
}
//memo 更新
vvl new_memo(n);
REP(j,n){
REP(t,old_memo[j].size()){
ll x= j+old_memo[j][t];
if(0<=x && x<n) new_memo[x].pb(old_memo[j][t]);
}
}
// bd
REP(i,n){
if(!new_memo[i].size()){
vvl n_memo= new_memo;
n_memo[i].pb(-1);
n_memo[i].pb(0);
n_memo[i].pb(1);
queen_dfs(cnt+1, i, bd, n_memo);
}
}
}
int main(){
init();
inl(k);
A.resize(k);
REP(i,k){
inl(r,c);
A[i]= {r,c};
}
REP(i,n){
vvl memo(8);
memo[i].pb(-1);
memo[i].pb(0);
memo[i].pb(1);
queen_dfs(0,i,bd,memo);
}
}
| 1 |
#include<iostream>
#include<stdlib.h>
using namespace std;
int main (){
int n, m;
int b, count, answer;
int *list, *result;
list = (int*)malloc(sizeof(int)*n);
result = (int*)malloc(sizeof(int)*n);
cin >> n >> m;
for(int i = 0; i<n; i++){
cin >>list[i];
result[i] = 0;
}
for(int i= 0; i< m; i++){
count = 0;
cin >>b;
while(1){
if(list[count] < b+1) break;
count++;
}
//cout <<count <<endl ;
result[count] ++;
}
answer = 0;
for(int i =0; i<n; i++){
if(result[answer] < result[i])
answer = i ;
}
cout << answer + 1 <<endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int score = 0;
int out = 0;
int first = 0;
int second = 0;
int third = 0;
while(1) {
string str;
cin >> str;
if(str == "HIT") {
score += third;
third = second;
second = first;
first = 1;
} else if(str == "HOMERUN") {
score += first + second + third + 1;
first = second = third = 0;
} else if(str == "OUT") {
out++;
}
if(out == 3) {
cout << score << endl;
break;
}
}
}
return 0;
} | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_N (1000L)
#define NUM_MOD (1000000007L)
using namespace std;
long mod_pow(long n, long k, long mod) {
long res = 1, num = n;
while (k > 0) {
if (k % 2 == 1) {
res = res * num % mod;
}
k /= 2;
num = num * num % mod;
}
return res;
}
long fs[MAX_N + 1], finvs[MAX_N + 1], invs[MAX_N + 1];
void fact_init(long N) {
fs[0] = fs[1] = 1;
finvs[0] = finvs[1] = 1;
invs[1] = 1;
for (int i = 2; i <= N; i++) {
fs[i] = fs[i - 1] * i % NUM_MOD;
invs[i] = NUM_MOD - invs[NUM_MOD % i] * (NUM_MOD / i) % NUM_MOD;
finvs[i] = finvs[i - 1] * invs[i] % NUM_MOD;
}
}
long num_comb(long i, long j, long k) {
long res = 1;
res = res * fs[i] % NUM_MOD;
res = res * finvs[i - k * j] % NUM_MOD;
res = res * finvs[k] % NUM_MOD;
res = res * mod_pow(finvs[j], k, NUM_MOD) % NUM_MOD;
return res;
}
int main(int argc, char *argv[]) {
// read inputs
long N, A, B, C, D;
scanf("%ld %ld %ld %ld %ld", &N, &A, &B, &C, &D);
// init
fact_init(N);
// solve dp
long dpss[MAX_N + 1][MAX_N + 1];
// initialize
for (long j = 0; j <= N; j++) {
dpss[0][j] = 1;
}
for (long i = 1; i <= N; i++) {
// B is the maximum number of people per group
if (i % B == 0 && i / B >= C && i / B <= D) {
dpss[i][B] = num_comb(i, B, i / B);
} else {
dpss[i][B] = 0;
}
}
// update
for (long i = 1; i <= N; i++) {
for (long j = B - 1; j >= A; j--) {
long dp = 0;
// dp = max(dp, dpss[i][j + 1]);
dp = (dp + dpss[i][j + 1]) % NUM_MOD;
for (long k = C, k_last = min(D, i / j); k <= k_last; k++) {
dp = (dp + dpss[i - k * j][j + 1] * num_comb(i, j, k) % NUM_MOD) % NUM_MOD;
// printf("i = %ld, j = %ld, k = %ld, dpss[i - k * j] = %ld, num_comb = %ld\n", i, j, k,
// dpss[i - k * j][j + 1], num_comb(i, j, k));
}
dpss[i][j] = dp;
}
}
// for (long i = 0; i <= N; i++) {
// printf("i = %ld:", i);
// for (long j = A; j <= B; j++) {
// printf(" %ld", dpss[i][j]);
// }
// printf("\n");
// }
printf("%ld\n", dpss[N][A]);
return 0;
}
| /**
*Makacha
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typename T> inline void wrip(T x) {if (x > 9) wrip(x / 10); putchar(x%10 + 48); }
template <typename T> inline void write(T x) {if (x < 0) putchar('-'), x = -x; wrip(x); putchar(' ');}
template <typename T> inline void writeln(T x) {if (x < 0) putchar('-'), x = -x; wrip(x); putchar('\n');}
inline char readch() {char c; do c = getchar(); while (c == '\n' || c == ' '); return c;}
inline void reads(string &s) {char c; while((c=getchar())==' '||c =='\n'); s=c; while((c=getchar())!=' '&&c!='\n') s+=c;}
inline void getlines(string &s) {char c; while((c=getchar())=='\n'); s=c; while((c=getchar())!='\n') s+=c;}
typedef const int csint;
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair <int, int> ii;
typedef vector <int> vi;
const ld pi = acos(-1);
const ll inf = 1e9,
mod = 1e9 + 7,
N = 1011;
int n, a, b, c, d;
ll f[N][N], cb[N][N], g[N][N];
ll fac[N], inv[N];
void Inc(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll pw(ll a, ll b) {
if (b == 0)
return 1;
ll t = pw(a, b / 2);
t = t * t % mod;
if (b % 2)
return t * a % mod;
return t;
}
int res, dx[111], pa[111];
void Try(int x) {
if (x > n) {
int cnt[21], num[21];
memset(cnt, 0, sizeof(cnt));
memset(num, 0, sizeof(num));
for (int i = 1; i <= n; i++)
cnt[pa[i]]++;
for (int i = 1; i <= n; i++) {
if (!cnt[i])
continue;
if (cnt[i] < a || cnt[i] > b)
return;
num[cnt[i]]++;
}
for (int i = 1; i <= n; i++) {
if (!num[i])
continue;
if (num[i] > d || num[i] < c)
return;
}
res++;
return;
}
for (int i = 1; i <= x; i++) {
if (dx[i])
continue;
dx[x] = i != x;
pa[x] = i;
Try(x + 1);
dx[x] = 0;
}
}
int main() {
#ifdef makacha
freopen("m.inp", "r", stdin);
freopen("m.out", "w", stdout);
#endif // makacha
read(n);
read(a);
read(b);
read(c);
read(d);
// Try(1);
// cout << res << '\n';
cb[0][0] = 1;
for (int i = 1; i <= n; i++) {
cb[i][0] = 1;
for (int j = 1; j <= i; j++)
cb[i][j] = (cb[i - 1][j] + cb[i - 1][j - 1]) % mod;
}
g[0][0] = 1;
for (int i = 1; i <= n; i++) {
g[i][0] = 1;
for (int j = i; j <= n; j += i)
g[i][j] = (ll) cb[j][j / i] * g[i - 1][j - j / i] % mod;
}
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = (ll)fac[i - 1] * i % mod;
inv[n] = pw(fac[n], mod - 2);
for (int i = n; i >= 1; i--)
inv[i - 1] = (ll)inv[i] * i % mod;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j += i)
g[i][j] = (ll)g[i][j] * inv[i] % mod;
f[a - 1][0] = 1;
for (int i = a; i <= b; i++) {
int lim = min(d * i, n);
int im = i - 1;
for (int j = i * c, grs = c; j <= lim; j += i, grs++)
for (int k = j, rem = n, kk = k - j; k <= n; k++, rem--, kk++) {
ll tmp = f[im][kk];
tmp = tmp * cb[rem][j] % mod;
tmp = tmp * g[grs][j] % mod;
Inc(f[i][k], tmp);
}
for (int j = 0; j <= n; j++)
Inc(f[i][j], f[im][j]);
}
cout << f[b][n];
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a,b,c,d;
int pnt[1000]={};
for(int i=0;i<(n*(n-1)/2);i++){
cin>>a>>b>>c>>d;
if(c>d) pnt[a]+=3;
else if(d>c)pnt[b]+=3;
else if(d==c) pnt[a]++,pnt[b]++;
}
int vic[1000];
for(int i=1;i<=n;i++){
int cnt=1;
for(int j=1;j<=n;j++)if(pnt[i]<pnt[j])cnt++;
vic[i]=cnt;
}
for(int i=1;i<=n;i++) cout<<vic[i]<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int n;
const int INF = 1 << 29;
typedef pair<int,int> P;
vector<P> teams;
bool sortSecond(const P& p1, const P& p2)
{
if(p1.second != p2.second) return p1.second < p2.second;
if(p1.first != p2.first) return p1.first < p2.first;
return false;
}
int main(void)
{
while(cin >> n && n)
{
teams.resize(n);
for (int i = 0; i < n; i++)
{
teams[i] = P(0, i);
}
for (int i = 0, leags = n * (n - 1) / 2; i < leags; i++)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(c == d)
{
teams[a - 1].first++;
teams[b - 1].first++;
}
else if(c > d) teams[a - 1].first += 3;
else teams[b - 1].first += 3;
}
sort(teams.begin(), teams.end(), greater<P>());
int hikiwake = 0;
for (int i = 0; i < n; i++)
{
int tmp = teams[i].first;
teams[i].first = i + 1 - hikiwake;
if(i + 1 < n && tmp == teams[i + 1].first)
{
hikiwake++;
}
else hikiwake = 0;
}
sort(teams.begin(), teams.end(), sortSecond);
for (int i = 0; i < n; i++)
{
cout << teams[i].first << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a;
int dp[n];
int ans=0;
for(int i=0;i<n;i++)dp[i]=1e9;
for(int i=0;i<n;i++){
cin >> a;
a *= (-1);
*upper_bound(dp,dp+n,a)=a;
}
cout << lower_bound(dp,dp+n,1e9)-dp;
} | /*
https://atcoder.jp/contests/abc134/tasks/abc134_e
N個同時に最小部分列を作る
部分列では常に増加
dp[][]がある
a[i]を見た時, どこを更新するべきか?
30 40 50 60
新たに20が来た
30 40 50 60
20
新たに45が気来た
30 40 50 60
45
vs
30 40 45
50 60
どちらも嬉しさは変わらない 前者の方がいい
最後尾に対して数列を持っておくと,
最後尾のうちxより小さい最大のものをxに更新
条件を満たすものがなければ追加
だから全部-1にしておいて,
20
10
-1
-1
[30が来たら]
30
10
-1
-1
[15が来たら]
20
15
-1
-1
[10が来たら]
20
10
10
-1
dp[j]<A[i]を満たす最小のjを更新
*/
#include<bits/stdc++.h>
using namespace std;
long bs(long x,const vector<long>& v){
long l=-1,r=v.size();
while(r-l!=1){
long z=(l+r)/2;
if(v[z]<x)r=z;
else l=z;
}
return r;
}
int main(){
long N;cin>>N;vector<long>A(N),dp(N,-1);
for(long i=0;i<N;i++)cin>>A[i];
for(long i=0;i<N;i++){
long z=bs(A[i],dp);
dp[z]=A[i];
}
long ans=0;
for(long i=0;i<N;i++)ans+=(dp[i]!=-1);
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
int tr[21][21];
while(true){
scanf("%d", &N);
if(N == 0) break;
for(int i = 0; i <= 20; i++){
fill(tr[i], tr[i] + 21, 0);
}
for(int i = 0; i < N; i++){
int x, y;
scanf("%d%d", &x, &y);
tr[x][y] = 1;
}
scanf("%d", &M);
int cnt = 0;
int rx = 10, ry = 10;
for(int i = 0; i < M; i++){
char d; int s;
scanf(" %c%d", &d, &s);
int dx, dy;
if(d == 'N'){
dx = 0, dy = 1;
}else if(d == 'E'){
dx = 1, dy = 0;
}else if(d == 'S'){
dx = 0, dy = -1;
}else{
dx = -1, dy = 0;
}
while(s--){
rx += dx;
ry += dy;
if(tr[rx][ry] == 1){
tr[rx][ry] = 0;
cnt += 1;
}
}
}
if(cnt == N){
puts("Yes");
}else{
puts("No");
}
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n;
do {
cin >> n;
int score_a = 0, score_b = 0;
for (int i = 0; i < n; i++) {
int inp_a, inp_b;
cin >> inp_a >> inp_b;
if (inp_a == inp_b) {
score_a += inp_a;
score_b += inp_b;
}
else {
(inp_a>inp_b ? score_a : score_b) += inp_a + inp_b;
}
}
if (n > 0 && n <= 10000) {
cout << score_a << ' ' << score_b << '\n';
}
} while (n > 0 && n <= 10000);
return 0;
} | 0 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout << fixed << setprecision(10);
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int time = 0;
if(h1==h2){
time += m2-m1;
cout << time -k << endl;
}
else{
time += 60 - m1;
//cout << time << endl;
time += m2;
//cout << time << endl;
time += (h2 - (h1 + 1))*60;
cout << time - k << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll vector<ll>
#define vvl vector<vll>
#define pii pair<ll,ll>
#define F first
#define S second
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
ll ans=h2*60+m2-h1*60-m1-k;
if(ans<0)
cout<<0;
else
cout<<ans;
return 0;
} | 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<string>
#include<map>
#include<vector>
using namespace std;
int main(){
int n,anum,bnum;
int as, bs;
as = bs = 0;
while(1){
scanf("%d",&n);
if(n == 0) break;
for(int i = 0 ; i < n ; i++){
scanf("%d%d",&anum,&bnum);
if(anum == bnum){
as += anum;
bs += bnum;
}
else if(anum > bnum){
as += anum;
as += bnum;
}
else if(anum < bnum){
bs += anum;
bs += bnum;
}
}
printf("%d %d\n",as,bs);
as = bs = 0;
}
return 0;
} | #include <iostream>
//#include <algorithm>
//#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
//#include <cmath>
//#include <string>
//#include <sstream>
//#include <iomanip>
//#include <complex>
using namespace std;
//#define ll long long
//#define vvi vector< vector<int> >
//#define All(X) X.begin(),X.end()
//#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
//#define pb push_back
//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(){
while(1){
int n, p;
cin >> n >> p;
if(n==0&&p==0) break;
int kago=p;
int pc[100]={0};
int i=0;
while(1){
int nowc=i%n;
if(pc[nowc]==p){
cout << nowc << endl;
break;
}
if(kago>0){
kago--;
pc[nowc]++;
}
else{
kago=pc[nowc];
pc[nowc]=0;}
i++;
}
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
const int maxN = 500;
long long gcd(long long a, long long b){
return a%b ? gcd(b, a%b) : b;
}
long long lcm(long long a, long long b){
return a/gcd(a, b)*b;
}
vector<vector<int>> getPrimes(){
vector<int> p(100000, 1);
vector<int> primes;
for(int i=2;;i++){
if(!p[i]) continue;
primes.push_back(i);
if(primes.size() == 4 * maxN) break;
for(int j=2*i;j<100000;j+=i) p[j] = 0;
}
vector<vector<int>> res(2, vector<int>(2*maxN));
int seek = 0;
for(int i=0;i<maxN;i++){
res[0][2*i] = primes[seek];
res[0][2*i+1] = primes[3*maxN-1-seek];
++seek;
}
for(int i=0;i<2*maxN;i++){
if(i < maxN/4 || maxN/4*7 <= i){
res[1][i] = res[0][i];
} else {
if(i%2 == 0){
res[1][i] = primes[seek];
} else {
res[1][i] = primes[3*maxN-1-seek];
++seek;
}
}
}
return res;
}
vector<vector<long long>> makeBoard(){
vector<vector<long long>> res(maxN, vector<long long>(maxN, 0));
auto primes = getPrimes();
for(int i=0;i<maxN;i++){
for(int j=i%2;j<maxN;j+=2){
int idxA = (i+j)/2;
int idxB = (i-j+maxN-2)/2;
res[i][j] = (long long)primes[0][idxA] * primes[1][idxB];
}
}
for(int i=0;i<maxN;i++){
for(int j=1-i%2;j<maxN;j+=2){
res[i][j] = 1;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
for(int k=0;k<4;k++){
int nx = i + dx[k];
int ny = j + dy[k];
if(nx < 0 || maxN <= nx || ny < 0 || maxN <= ny) continue;
res[i][j] = lcm(res[i][j], res[nx][ny]);
}
++res[i][j];
}
}
return res;
}
int main(){
int N;
auto board = makeBoard();
while(cin >> N){
for(int i=0;i<N;i++){
cout << board[i][0];
for(int j=1;j<N;j++) cout << " " << board[i][j];
cout << endl;
}
}
} | #include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Mod=998244353;
int k,n,ans[4100],C[4100][4100];
int calc(int x,int k,int n){
int tmp,sum=0;
for (int i=0;i<=(x-1)/2&&n-i*2>=0;i++){
if (!k) tmp=0;
else tmp=(ll)C[(x-1)/2][i]*C[n-i*2+k-1][k-1]%Mod;
if (i&1) sum=(sum-tmp+Mod)%Mod;
else sum=(sum+tmp)%Mod;
}
return sum;
}
int main(){
C[0][0]=1;
for (int i=1;i<=4000;i++){
C[i][0]=1;
for (int j=1;j<=i;j++) C[i][j]=(C[i-1][j-1]+C[i-1][j])%Mod;
}
scanf("%d%d",&k,&n);
for (int i=2;i<=k+1;i++)
if (!(i&1)) ans[i]=(calc(i,k-1,n)+calc(i,k-1,n-1))%Mod;
else ans[i]=calc(i,k,n);
for (int i=2;i<=k;i++) printf("%d\n",ans[i]);
printf("%d\n",ans[k+1]);
for (int i=k;i>=2;i--) printf("%d\n",ans[i]);
return 0;
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(i!=num-1) cout<<" ";}
cout << endl;
}
template <typename T>
void print_pairvec(const vector<T> &v, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl;
for(ll i=0; i<num; i++){ cout << v[i].first << " " << v[i].second << endl;}
}
template <typename T>
void print_vec2(const vector<vector<T>>& v){
cout << endl; cout << " ";
for(ll i=0; i<v[0].size(); i++) cout << i << " ";
cout << endl;
for(ll i=0; i<v.size(); i++){
cout << "i=" << i << ": ";
for(ll j=0; j<v[i].size(); j++){
if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << " ";
else cout << "\x1B[31m" << v[i][j] << " ";//https://stackoverrun.com/ja/q/12618775
}
cout << "\x1B[0m" << endl;
}
}
int main(){
int N, k;
cin >> N >> k;
vector<int> x(N);
for(int i=0; i<N; i++) cin >> x[i];
// vector<int> anses;
// const int INF = 2e8+1;
const int INF = 1e8 + 1e8 + 1e8 + 1;//
int ans = INF;
for(int i=0; i<N; i++){
if(i+k-1 >= N) break;
int sx = x[i];
int gx = x[i+k-1];
if(sx < 0 && gx < 0) ans = min(ans, -sx);
else if(sx >= 0 && gx >= 0) ans = min(ans, gx);
else if(sx <= 0 && 0 <= gx){
int tmp = min(2*(-sx) + gx, -sx + 2*gx);
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int>x(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i);
}
vector<int>A(N-K+1);
for (int i = K-1; i < N; i++) {
A.at(i-K+1) = x.at(i) - x.at(i-K+1);
A.at(i-K+1) += min(abs(x.at(i)),abs(x.at(i-K+1)));
}
sort(A.begin(), A.end());
cout << A.at(0) << endl;
}
| 1 |
//----------------------------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <ios>
#include <math.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>;
using Graph = vector<vector<int>>;
int main(void) {
int n;
cin >> n;
vector<pair<double, double>> xy(n);
rep(i, n) {
cin >> xy[i].first >> xy[i].second;
}
vector<int> keiro;
rep(i, n)
keiro.push_back(i);
double ans = 0.0;
double sum = 0.0;
do {
for(int i = 0; i < n - 1; ++i) {
double dx = xy[keiro[i+1]].first - xy[keiro[i]].first;
double dy = xy[keiro[i+1]].second- xy[keiro[i]].second;
ans += sqrt(dx * dx + dy * dy);
}
sum++;
}while(next_permutation(keiro.begin(), keiro.end()));
ans /= sum;
cout << fixed << setprecision(16) <<
ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define MOD 1000000007
#define mod 998244353
#define pie 3.14159265358979323846264338327950L
#define N 200009
#define M 2000009
#define mid(l, r) l + (r - l) / 2
#define vec vector<int>
#define umap unordered_map<int, int>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define endl "\n"
#define int long long
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
ll lcm(ll a, ll b) { return (a*b)/ gcd(a,b);}
vector<pair<int,int> > arr(10);
map<pair<int,int>,ld> mp;
ld ans = 0;
int n;
void fun(vector<int> temp, ld curr) {
if(temp.size() == n) {
ans+= curr;
// for(auto it : temp) {
// cout<<it<<" ";
// }
// cout<<endl;
return;
}
for(int i=0; i<n; i++) {
if(find(all(temp),i) == temp.end()) {
int prev = temp.back();
temp.push_back(i);
fun(temp,curr + mp[mpr(i,prev)]);
temp.pop_back();
}
}
}
const int MAX = 510000;
long long 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;
}
}
void test_case() {
cin>>n;
COMinit();
rep(i,n) {
int x,y;
cin>>x>>y;
arr[i] = mpr(x,y);
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
ld d= pow(arr[i].first - arr[j].first,2) + pow(arr[i].second -arr[j].second,2);
d = sqrt(d);
// cout<<d<<endl;
mp[mpr(i,j)] = d;
mp[mpr(j,i)] = d;
}
}
vec temp;
for(int i=0; i<n; i++) {
temp.push_back(i);
fun(temp,0.0);
temp.pop_back();
}
ld fin = ans/fac[n];
// cout<<ans<<endl;
cout<<fin<<endl;
}
signed main ()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin >> t;
while (t--)
{
test_case();
}
} | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = INT_MAX / 2;
const ll inf = LLONG_MAX / 2;
const int mod = 1000000007;
const int MAX_N = 101010;
const long double PI = acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
/*------------------------------*/
string s;
cin >> s;
cout << s.substr(0, s.length() - 8) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int ans=0;
for(int i=0;i<s.size();i++){
if(s[i]!='J') continue;
else{
int now=i+1;
int J=1,O=0,I=0;
int flag1=1,flag2=0;
while(s[now]=='J'){
//cout<<now<<endl;
J++;
now++;
}
while(s[now]=='O' && flag1){
//cout<<now<<endl;
O++;
now++;
flag2=1;
}
if(J<O){
i=now-1;
continue;
}
while(s[now]=='I' && flag2){
//cout<<now<<endl;
I++;
now++;
}
if(O>I){
i=now-1;
continue;
}
ans=max(ans,min(I,min(O,J)));
// cout<<ans<<endl;
i=now-1;
//cout<<i<<endl;
//cout<<s[i]<<endl;
}
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
// 最大公約数
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
// 最小公倍数
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
ll fibo[10];
ll dp[102][10];
ll func_fibo(ll n){
if(n <= 0) return 1;
else{
return fibo[n];
}
}
int main()
{
cout << fixed << setprecision(15);
ll H, W, K;
cin >> H >> W >> K;
fibo[1] = 2;
fibo[2] = 3;
for(ll i=3; i<=10; i++){
fibo[i] = fibo[i-1] + fibo[i-2];
}
// cout << func_fibo(8) << endl;
Fill(dp, 0);
dp[0][1] = 1;
for(ll i=1; i<=H; i++){
for(ll j=1; j<=W; j++){
dp[i][j] += (dp[i-1][j]*func_fibo(j-2)*func_fibo(W-j-1)) % MOD;
if(j>1){
dp[i][j] += (dp[i-1][j-1]*func_fibo(j-3)*func_fibo(W-j-1)) % MOD;
}
if(j< W){
dp[i][j] += (dp[i-1][j+1]*func_fibo(j-2)*func_fibo(W-j-2)) % MOD;
}
dp[i][j] = dp[i][j] % MOD;
}
}
cout << dp[H][K] << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <ctime>
////
//#include <random>//
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
////定数
const int INF = (int)1e9 + 10;
const LL MOD = (LL)1e9 + 7;
const LL LINF = (LL)4e18 + 20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;
void chmax(LL& a, LL b) {
a = max(a, b);
}
void chmin(LL& a, LL b) {
a = min(a, b);
}
//////////////
void solve() {
int H, W, K;
cin >> H >> W >> K;
/*
縦棒がW本ある。W-1個のあるなしで全探索。って
*/
//左付きで棒があるかないか
vector<vector<bool>> BF;
vector<int> BF_num;
for (int s = 0; s < (1 << (W-1)); ++s) {
int ter = s;
vector<bool> res(W - 1);
int cnt = 0;
for (int i = 0; i < W-1; ++i) {
if (ter & 1) {
res[i] = true;
cnt++;
}
else {
res[i] = false;
}
ter /= 2;
}
bool flag = true;
for (int i = 0; i < W - 1 - 1; ++i) {
if (res[i] == true && res[i + 1] == true) {
flag = false;
break;
}
}
if (flag == true) {
BF.push_back(res);
BF_num.push_back(cnt);
}
}
/*
H+1 * W * (K+1)個必要
*/
//高さと位置のみ
vector<vector<LL>> dp(H + 1,vector<LL>(W, 0));
dp[0][0] = 1;
int BF_len = BF.size();
for (int h = 0; h < H; ++h) {//上から順に
//dp[h]->dp[h+1]
for (int s = 0; s < BF_len; ++s) {//全ての横棒で
vector<bool> B = BF[s];
for (int w = 0; w < W; ++w) {
//dp[h][k]
if (w+1 <W && B[w] == true) {//右へ
dp[h + 1][w + 1] += dp[h][w];
dp[h + 1][w + 1] %= MOD;
}
else if (w - 1 >= 0 && B[w - 1] == true) {//左
dp[h + 1][w - 1] += dp[h][w];
dp[h + 1][w - 1] %= MOD;
}
else{//真下へ
dp[h + 1][w] += dp[h][w];
dp[h + 1][w] %= MOD;
}
}
}
}
//[H][K-1]
LL ans = dp[H][K-1];
cout << ans << endl;
}
signed main(void) {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cout << std::fixed;//小数を10進数表示
cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別
solve();
}
| 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
//typedef __int64 LL;
//typedef long long int LL;
typedef pair<int,int> P;
//typedef pair<LL,LL> PL;
const int MOD=1000000007;
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((j<a && i<b)||(j>=a && i>=b))cout<<0;
else cout<<1;
}
cout<<"\n";
}
return 0;
} | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
// constants
const ll N = 1e5+5, M = 1e6+5, A = 1e7+5, inf = 1e9; string alph("abcdefghijklmnopqrstuvwxyz");
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
string s;
void solve(){
ll n, m, x, y;
cin >> n >> m >> x >> y;
vector<vector<int>> v(n, vector<int>(m, 0));
rep(i, n){
for(ll j = m-x; j < m; j++) v[i][j] ^= 1;
}
rep(j, m){
for(ll i = n-y; i < n; i++) v[i][j] ^= 1;
}
rep(i, n) {rep(j, m) cout << v[i][j]; cout << endl;}
}
int main(int argc, char const* argv[])
{
ll t = 1; //cin >> t;
while(t--) {
solve();
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char str;
int n[3]={},ans=0,x;
while(cin>>str){
if(str=='J'&&n[1]==0&&n[2]==0)n[0]++;
else if(str=='O'&&n[1]<n[0]&&n[2]==0)n[1]++;
else if(str=='I'&&n[2]<(x=min(n[0],n[1]))){
n[2]++;
if(n[2]==x)ans=max(ans,x);
}
else{
for(int i=0;i<3;i++)n[i]=0;
if(str=='J')n[0]=1;
}
}
cout<<ans<<endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
string str;
int ret=0;
vector<pair<char,int> > v;
cin >> str;
int cnt=1;
char tmp=str[0];
for(int i=1;i<str.size();++i){
if(str[i] == tmp){
cnt++;
}else{
v.push_back(make_pair(tmp,cnt));
cnt=1;
tmp = str[i];
}
}
v.push_back(make_pair(tmp,cnt));
for(int i=0;v.size() >=3 && i<v.size()-2;++i){
if(v[i].first == 'J' &&
v[i+1].first == 'O' &&
v[i+2].first == 'I'){
if(v[i].second >= v[i+1].second &&
v[i+2].second >= v[i+1].second){
ret = max(ret, min(v[i].second, min(v[i+1].second,v[i+2].second)));
}
}
}
cout << ret << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int>> graph[100001];
int ans[100001];
signed main() {
//Ввод графа и вершины start.
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
graph[a].push_back({b, c});
graph[b].push_back({a, c});
}
int Q, K;
cin >> Q >> K;
for (int i = 0; i < n; i++) {
ans[i] = LONG_MAX;
}
int start = K - 1;
ans[start] = 0;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
q.push({0, start});
while (!q.empty()) {
pair<int, int> c = q.top();
q.pop();
int dst = c.first, v = c.second;
if (ans[v] < dst) {
continue;
}
for (pair<int, int> e: graph[v]) {
int u = e.first, len_vu = e.second;
int n_dst = dst + len_vu;
if (n_dst < ans[u]) {
ans[u] = n_dst;
q.push({n_dst, u});
}
}
}
for (int i = 1; i <= Q; i++) {
int u, v;
cin >> u >> v;
u--; v--;
cout << ans[u] + ans[v] << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll N, M, Q, sum[510][510], lr[510][510];
int main(int argc, char **argv)
{
cin >> N >> M >> Q;
REP(i, M)
{
ll l, r; cin >> l >> r;
--l, --r;
++lr[l][r];
}
REP(i, N)REP(j, N)
{
sum[i+1][j+1] = sum[i][j+1] + sum[i+1][j] - sum[i][j] + lr[i][j];
}
REP(_, Q)
{
ll l, r; cin >> l >> r;
--l, --r;
std::cout << sum[r+1][r+1] - sum[r+1][l] - sum[l][r+1] + sum[l][l] << std::endl;
}
}
| 0 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define REP(i,n) for(int i=0; i<n; i++)
int main()
{
string str;
// string roman[] = {"I", "V", "X", "L", "C", "D", "M"};
map<char, int> roman;
roman['I'] = 1;
roman['V'] = 5;
roman['X'] = 10;
roman['L'] = 50;
roman['C'] = 100;
roman['D'] = 500;
roman['M'] = 1000;
while(cin>>str){
int nums[str.size()];
REP(i,str.size())
nums[i] = roman[str[i]];
int dec=0;
int begin=0;
int i=0;
while(i<str.size()-1){
if(nums[i] < nums[i+1]){
for(int j=begin; j<=i; j++){
dec += nums[j];
nums[j] = 0;
}
begin = i+2;
}
if(nums[i] > nums[i+1]){
begin = i+1;
}
i++;
}
int res=0;
REP(i,str.size()) res += nums[i];
cout << res-dec << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
char rome[110];
int num, ara, nu;
while(cin >> rome){
num = ara = nu = 0;
for(int i = 0; rome[i] != '\0'; i++){
if (rome[i] == 'I') num = 1;
else if (rome[i] == 'V') num = 5;
else if (rome[i] == 'X') num = 10;
else if (rome[i] == 'L') num = 50;
else if (rome[i] == 'C') num = 100;
else if (rome[i] == 'D') num = 500;
else if (rome[i] == 'M') num = 1000;
if (nu < num) ara += num - nu - nu;
else ara += num;
nu = num;
}
cout << ara << endl;
}
return (0);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
string reply;
cin >> a >> b >> c >> d;
a += b;
c += d;
if (a > c) {
reply = "Left";
} else if (a == c) {
reply = "Balanced";
} else {
reply = "Right";
}
cout << reply << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main(){
int a, b; cin >> a >> b;
string s; cin >> s;
int cnt1 = 0, cnt2=0;
int h_cnt=0;
rep(i, s.size()){
if(s[i]=='-'){
h_cnt++;
if(h_cnt==1)swap(cnt1, cnt2);
continue;
}
else{
cnt1++;
}
}
if(h_cnt==0||h_cnt>1){
out("No");
return 0;
}
if(a==cnt2&&b==cnt1){
out("Yes");
}
else out("No");
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,i,n;
cin>>a>>b;
n=((a*2)-1)/2;
for(i=0;i<n;i++)
{
a--;
cout<<b-a<<" ";
}
cout<<b<<" ";
a=0;
for(i=n+1;i<2*n+1;i++)
{
a++;
cout<<b+a<<" ";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORD(i, m, n) for (int i = m; i >= n; --i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REP1(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int k,x;
cin>>k>>x;
FOR(i,x-k+1,x+k){
printf("%d ",i);
}
return 0;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
#include<functional>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
template<typename T>
void sort_u(T& v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(),v.end()), v.end());
}
template<typename T, typename DT=T>
struct monoid_factory {
using value_type = T;
using operator_type = DT;
using oa_type = std::function<void(operator_type&,operator_type)>;
using va_type = std::function<void(value_type&,operator_type)>;
using vo_type = std::function<value_type(value_type,operator_type)>;
using vv_type = std::function<value_type(value_type,value_type)>;
value_type ve;
operator_type oe;
oa_type op_assign;
va_type v_assign;
vo_type v_op;
vv_type v_v;
monoid_factory(value_type in_ve, operator_type in_oe, oa_type&& in_oa,
va_type&& in_va, vo_type&& in_vo, vv_type in_vv): ve(in_ve), oe(in_oe),
op_assign(in_oa), v_assign(in_va), v_op(in_vo), v_v(in_vv) {}
};
// lazy_seg_tree
template<typename MonoidFactory>
struct lazy_seg_tree {
using T = typename MonoidFactory::value_type;
using OT = typename MonoidFactory::operator_type;
std::vector<T> data_;
std::vector<OT> lazy_;
int NN;
MonoidFactory mf;
lazy_seg_tree(int N, MonoidFactory const& in_m): mf(in_m) {
NN=1;
while(NN<N+2) NN<<=1;
data_.assign(NN*2-1, mf.ve);
lazy_.assign(NN*2-1, mf.oe);
}
void eval(int k) {
if(lazy_[k] == mf.oe) return;
if(k*2+1 < NN*2-1) {
mf.op_assign(lazy_[2*k+1], lazy_[k]);
mf.op_assign(lazy_[2*k+2], lazy_[k]);
}
mf.v_assign(data_[k], lazy_[k]);
lazy_[k] = mf.oe;
}
T update(int a, int b, OT x, int k, int l, int r) {
if(b <= l || r <= a) {
eval(k);
return data_[k];
}
if(a <= l && r <= b) {
mf.op_assign(lazy_[k], x);
return mf.v_op(data_[k], lazy_[k]);
}
eval(k);
int m = (l+r)/2;
T vl = update(a, b, x, k*2+1, l, m);
T vr = update(a, b, x, k*2+2, m, r);
return data_[k] = mf.v_v(vl, vr);
}
T query(int a, int b, int k, int l, int r) {
if(b <= l || r <= a) return mf.ve;
eval(k);
if(a <= l && r <= b) return data_[k];
int m = (l+r)/2;
T vl = mf.ve, vr = mf.ve;
if(!(m <= a || b <= l)) vl = query(a, b, k*2+1, l, m);
if(!(r <= a || b <= m)) vr = query(a, b, k*2+2, m, r);
return mf.v_v(vl, vr);
}
void update(int a, int b, OT x){ update(a, b, x, 0, 0, NN); }
T query(int a, int b){ return query(a, b, 0, 0, NN); }
};
struct C {
int l, r, v;
C(int S, int T, int X): l(std::max(0,S-X)), r(std::max(0, T-X)), v(X) {}
};
int const INF = 1e9+5;
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int N, Q; std::cin >> N >> Q;
std::vector<int> xs(1, 0);
std::vector<C> cond;
for(int i = 0; i < N; ++i) {
int S, T, X; std::cin >> S >> T >> X;
if(X >= T) continue;
cond.emplace_back(S, T, X);
xs.push_back(cond.back().l);
xs.push_back(cond.back().r);
}
sort_u(xs);
for(auto& c: cond) {
c.l = std::lower_bound(xs.begin(), xs.end(), c.l) - xs.begin();
c.r = std::lower_bound(xs.begin(), xs.end(), c.r) - xs.begin();
}
auto ch_min = [](int& o1, int o2)->void { if(o1 > o2) o1 = o2; };
auto op_min = [](int x, int y)->int { return std::min(x, y); };
monoid_factory<int> mf(INF, INF, ch_min, ch_min, op_min, op_min);
lazy_seg_tree<monoid_factory<int>> lst(xs.size(), mf);
for(auto& c: cond) lst.update(c.l, c.r, c.v);
for(int i = 0; i < Q; ++i) {
int D; std::cin >> D;
int d = std::upper_bound(xs.begin(), xs.end(), D) - xs.begin();
int ans = lst.query(d-1, d);
if(ans == INF) ans = -1;
std::cout << ans << "\n";
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define all(v) (v).begin(),(v).end()
using ll = long long;
constexpr ll INF = 1e18;
vector<ll> solver(ll N, ll Q, vector<ll> a, vector<ll> t, vector<ll> u, vector<ll> v) {
fenwick_tree<ll> fw(N);
vector<ll> ans;
for (int i = 0; i < N; i++) {
fw.add(i, a[i]);
}
for (int i = 0; i < Q; i++) {
if (t[i] == 0) {
fw.add(u[i], v[i]);
} else {
ans.push_back(fw.sum(u[i], v[i]));
}
}
return ans;
}
int main(void) {
ll N, Q;
cin >> N >> Q;
vector<ll> a(N);
vector<ll> t(Q), u(Q), v(Q);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < Q; i++) {
cin >> t[i] >> u[i] >> v[i];
}
for (auto&& x : solver(N, Q, a, t, u, v)) {
cout << x << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<double, P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
#define INF (ll)10000000000000000
int main() {
ll N,Q;
cin>>N>>Q;
priority_queue<event>pq;
set<ll>st;
//eventはP(P(a,b),c)で書き、
//aに時刻をもち,b=0→工事開始,1→終了,2→歩行者とする
rep(i,N){
double s,t;
ll x;
cin>>s>>t>>x;
s=(double)x-s+0.5;
t=(double)x-t+0.5;
pq.push(event(s,P(0ll,x)));
pq.push(event(t,P(1ll,x)));
}
rep(i,Q){
double g;
cin>>g;
pq.push(event(-1*g,P(2ll,0ll)));
}
while(!pq.empty()){
auto t=pq.top();
pq.pop();
if(t.second.first==0){
st.insert(t.second.second);
}
if(t.second.first==1){
st.erase(t.second.second);
}
if(t.second.first==2){
if(st.empty()){cout<<-1<<endl;}
else{
cout<<*begin(st)<<endl;
}
}
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define pi pair<int,int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#include "string"
typedef tree<
pair<int,int>,
null_type,
less< pair<int,int> >,
rb_tree_tag,
tree_order_statistics_node_update
>ordered_set;
int32_t main(){
int n,q;
cin>>n>>q;
array<int,3> a[n];
for(int i=0;i<n;i++)
cin>>a[i][1]>>a[i][2]>>a[i][0];
sort(a,a+n);
set<pair<int,int>>s;
for(int i=0;i<q;i++){
int x;
cin>>x;
s.insert({x,i});
}
int ans[q];
memset(ans,-1,sizeof ans);
for(int i=0;i<n;i++){
int t1 = a[i][1] - a[i][0];
int t2 = a[i][2] - a[i][0];
auto l = s.lower_bound({t1,0ll});
auto r = s.lower_bound({t2,0ll});
/*cout<<l->ff<<" "<<l->ss<<endl;
cout<<r->ff<<" "<<r->ss<<endl;
cout<<t2<<" "<<t1<<endl<<endl;
*/vector<pi>v;
for(auto it=l;it!=r;it++){
pi x = *it;
//cout<<x.ff<<" "<<x.ss<<endl;
ans[x.ss] = a[i][0];
v.push_back(x);
}
//print(v);
for(auto &p :v)
s.erase(p);
}
for(int i=0;i<q;i++)
cout<<ans[i]<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ')'
ll MOD = 1000000007;
//ll INF = 21474836470000000;
ll INF = 100100100100100100;
long double EPS = 1e-11;
long double PI = 3.141592653589793238;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
ll dp[1000010][5];
int main(){
ll N;
string S;
ll Q;
cin >> N >> S >> Q;
vector<ll> k(Q),ans(Q);
rep(i,Q) cin >> k[i];
rep(j,Q){
dp[0][0] = 0;
ll D = 0,M = 0,K = k[j];
rep(i,N){
if(S[i] == 'D'){
D++;
dp[i+1][0] = dp[i][0] + 1;
dp[i+1][1] = dp[i][1];
dp[i+1][2] = dp[i][2];
if(i - K >= 0){
if(S[i-K] == 'D'){
D--;
dp[i+1][0]--;
dp[i+1][1] -= M;
}
if(S[i-K] == 'M') M--;
}
}else if(S[i] == 'M'){
M++;
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][1] + dp[i][0];
dp[i+1][2] = dp[i][2];
if(i - K >= 0){
if(S[i-K] == 'D'){
D--;
dp[i+1][0]--;
dp[i+1][1] -= M;
}
if(S[i-K] == 'M') M--;
}
}else if(S[i] == 'C'){
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][1];
dp[i+1][2] = dp[i][2] + dp[i][1];
if(i - K >= 0){
if(S[i-K] == 'D'){
D--;
dp[i+1][0]--;
dp[i+1][1] -= M;
dp[i+1][2] -= M;
}
if(S[i-K] == 'M') M--;
}
}else{
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][1];
dp[i+1][2] = dp[i][2];
if(i - K >= 0){
if(S[i-K] == 'D'){
D--;
dp[i+1][0]--;
dp[i+1][1] -= M;
}
if(S[i-K] == 'M') M--;
}
}
}
ans[j] = dp[N][2];
}
rep(i,Q) cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
string s; cin >> s;
int q; cin >> q;
rep(_, q) {
int k; cin >> k;
ll d = 0, m = 0, cnt = 0, ans = 0;
rep(i, n) {
if(i >= k) {
if(s[i-k] == 'D') {
d--;
cnt -= m;
} else if(s[i-k] == 'M') {
m--;
}
}
if(s[i] == 'D') {
d++;
} else if(s[i] == 'M') {
m++;
cnt += d;
} else if(s[i] == 'C') {
ans += cnt;
}
}
cout << ans << endk;
}
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#include <stack>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}
int H,W;
vector<string> S;
int same[2020][2020];
int diff[2020][2020];
void preprocess(){
rep(i,H) rep(j,W){
if(j==0) continue;
if(S[i][j]==S[i][j-1]) same[i][j]=1;
if(i>0&&S[i][j]==S[i][j-1]) same[i][j]+=same[i-1][j];
}
rep(i,H) rep(j,W){
if(j==0) continue;
if(S[i][j]!=S[i][j-1]) diff[i][j]=1;
if(i>0&&S[i][j]!=S[i][j-1]) diff[i][j]+=diff[i-1][j];
}
}
int calc(vector<int> &P){
stack<pair<int,int>> st;
int res=0;
rep(j,W){
if(j==0) continue;
int pos=j;
while(st.size()&&st.top().first>=P[j]){
auto f=st.top();
st.pop();
pos=f.second;
chmax(res,f.first*(j-pos+1));
}
st.push(mkp(P[j],pos));
}
while(st.size()){
auto f=st.top();
st.pop();
chmax(res,f.first*(W+1-f.second));
}
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>H>>W;
S.resize(H);
rep(i,H) cin>>S[i];
preprocess();
int ans=max(H,W);
rep(i,H){
if(i==0) continue;
{
vector<int> P(W,0);
vector<int> rev(W,0);
rep(j,W) if(S[i][j]=='.') rev[j]=1;
rep(j,W){
if(j==0) continue;
if(rev[j]==rev[j-1]) P[j]=same[i][j];
else P[j]=diff[i][j];
}
chmax(ans,calc(P));
}
{
vector<int> P(W,0);
vector<int> rev(W,0);
rep(j,W) if(S[i][j]!='.') rev[j]=1;
rep(j,W){
if(j==0) continue;
if(rev[j]==rev[j-1]) P[j]=same[i][j];
else P[j]=diff[i][j];
}
chmax(ans,calc(P));
}
}
cout<<ans<<endl;
return 0;
}
| // Have a nice day
// ∠( ᐛ 」∠)
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
template <typename T> inline T read()
{
T sum=0, fl=1; char ch=getchar();
for(; !isdigit(ch); ch=getchar()) if(ch=='-') fl=-1;
for(; isdigit(ch); ch=getchar()) sum=(sum<<3)+(sum<<1)+ch-'0';
return sum*fl;
}
const int maxn=2000+5;
int n, m, ans;
char s[maxn][maxn];
int l[maxn], r[maxn], h[maxn], c[maxn][maxn];
void Solve()
{
n=read<int>(), m=read<int>(); ans=max(n, m);
for(int i=1; i<=n; ++i) scanf("%s", s[i]+1);
--n, --m;
for(int i=1; i<=n; ++i)
for(int j=1; j<=m; ++j)
if(((s[i][j]=='#')+(s[i+1][j]=='#')+(s[i][j+1]=='#')+(s[i+1][j+1]=='#'))&1);
else c[i][j]=1;
for(int i=1; i<=m; ++i) l[i]=r[i]=maxn;
for(int i=1; i<=n; ++i)
{
for(int j=1, p=0; j<=m; ++j)
{
if(c[i][j]) ++p; else p=0;
l[j]=min(l[j], p);
}
for(int j=m, p=0; j>=1; --j)
{
if(c[i][j]) ++p; else p=0;
r[j]=min(r[j], p);
}
for(int j=1; j<=m; ++j)
{
if(c[i][j]) ++h[j], ans=max(ans, (l[j]+r[j])*(h[j]+1));
else l[j]=r[j]=maxn, h[j]=0;
}
}
printf("%d\n", ans);
}
int main()
{
// freopen("081d.in","r",stdin);
//freopen("081d.out","w",stdout);
Solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string x, y, z;
cin >> x >> y >> z;
cout << z+" "+x+" "+y << endl;
}
| #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
int main() {
int a,b,c;
cin >> a >> b >> c;
swap(a, b);
swap(a, c);
cout << a << " " << b << " " << c;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n;
cin>>n;
cout<<180*(n-2);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
void into(){
scanf("%d",&n);
}
void work(){
}
void outo(){
printf("%d\n",(n-2)*180);
}
int main(){
into();
work();
outo();
return 0;
} | 1 |
#include <stdio.h>
char a[111][111];
int main(void)
{
int W, B, n = 100, i, j;
scanf("%d %d" ,&W, &B);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j] = (i <= n / 2 ? '.' : '#');
for (i = 1; i <= (B - 1) / (n / 2); i++)
for (j = 1; j <= n / 2; j++)
a[i * 2 - 1][j * 2 - 1] = '#';
for (j = 1; j <= (B - 1) % (n / 2); j++)
a[i * 2 - 1][j * 2 - 1] = '#';
for (i = 1; i <= (W - 1) / (n / 2); i++)
for (j = 1; j <= n / 2; j++)
a[(n + 1) - (i * 2 - 1)][j * 2 - 1] = '.';
for (j = 1; j <= (W - 1) % (n / 2); j++)
a[(n + 1) - (i * 2 - 1)][j * 2 - 1] = '.';
puts("100 100");
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
printf("%c" ,a[i][j]);
puts("");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,L;
cin >> N >> L;
vector<int>A(N);
vector<int>B(N);
int sum = 0;
for (int i = 0; i < N; i++) {
A.at(i) = L + i;
sum += A.at(i);
B.at(i) = abs(A.at(i));
}
sort(B.begin(), B.end());
for (int i = 0; i < N; i++) {
if (B.at(0) == abs(A.at(i))){
sum -= A.at(i);
}
}
cout << sum << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<string, string> P;
string s;
void dfs(int i, int end, const string& lTemp, const string& rTemp, vector<P> &x)
{
if (i == end)
{
x.push_back(make_pair(lTemp, rTemp));
return;
}
dfs(i + 1, end, lTemp + s[i], rTemp, x);
dfs(i + 1, end, lTemp, s[i] + rTemp, x);
}
int main(void)
{
int n;
cin >> n;
cin >> s;
reverse(s.begin() + n, s.end());
vector<P> vl;
vector<P> vr;
dfs(0, n, "", "", vl);
dfs(n, 2 * n, "", "", vr);
sort(vl.begin(), vl.end());
sort(vr.begin(), vr.end());
long long score = 0;
auto ir_lower = vr.begin();
for (auto il = vl.begin(); il < vl.end(); ++il)
{
ir_lower = lower_bound(ir_lower, vr.end(), *il);
auto ir_upper = upper_bound(ir_lower, vr.end(), *il);
score += ir_upper - ir_lower;
}
cout << score << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N+2, 0);
for(int i=1;i<=N;i++){
cin >> A[i];
}
int sum = 0;
for(int i=0;i<N+1;i++){
sum += abs(A[i+1] - A[i]);
}
for(int i=1;i<N+1;i++){
auto res = sum;
res -= abs(A[i+1] - A[i]);
res -= abs(A[i] - A[i-1]);
res += abs(A[i+1] - A[i-1]);
cout << res << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define RFOR(i,a,b) for(long i=(a);i>=(b);--i)
#define REP(i,a) FOR(i,0,a)
#define RREP(i,a) RFOR(i,a,0)
#define EACH(i,a) for(auto (i)=(a).begin(),_END=(a).end();i!=_END;++i)
#define REACH(i,a) for(auto (i)=(a).rbegin(),_END=(a).rend();i!=_END;++i)
//Algorithm
#define ALL(a) (a).begin(), a.end()
#define RALL(a) (a).rbegin(), a.rend()
#define EXIST(a,x) ((a).find(x)!=(a).end())
#define SORT(a) sort(ALL(a))
//Setting
#define OPT std::cin.tie(0);std::ios::sync_with_stdio(false);
//debug message
bool debug = true;
#define MSG(s) if(debug){std::cout << s << std::endl;}
#define DEBUG(x) if(debug){std::cout << "debug(" << #x << "): " << x << std::endl;}
//alias
typedef long long LL;
typedef std::vector<int> VI;
typedef std::vector<long> VL;
typedef std::vector<long long> VLL;
typedef std::pair<int,int> PII;
//Common
typedef long long Weight;
const Weight WEIGHT_INF = std::numeric_limits<Weight>::max()/4;
struct Edge {
int src, dst;
Weight weight;
};
bool operator<(const Edge& a, const Edge& b) {
return (a.weight < b.weight);
};
bool operator>(const Edge& a, const Edge& b) {
return (a.weight > b.weight);
};
typedef std::vector<Edge> Edges;
typedef std::vector<Edges> Graph;
//Wardhall-Floyd
std::vector< std::vector<Weight> > g;
std::vector< std::vector<int> > trace;
void warshallFloyd() {
int n = g.size();
trace.resize(n, std::vector<int>(n, -1));
REP(k, n) REP(i, n) REP(j, n) {
if(g[i][k] == WEIGHT_INF || g[k][j] == WEIGHT_INF){
continue;
}
if(g[i][j] > g[i][k] + g[k][j]){
g[i][j] = g[i][k] + g[k][j];
trace[i][j] = k;
}
}
}
int main(void){
int V, E;
std::cin >> V >> E;
g.resize(V, std::vector<Weight>(V, WEIGHT_INF));
REP(i, V) g[i][i] = 0;
int s, d;
Weight w;
REP(i, E) {
std::cin >> s >> d >> w;
g[s][d] = w;
}
warshallFloyd();
bool f = false;
REP(i, V){
if(g[i][i] < 0){
f = true;
}
}
if(f){
std::cout << "NEGATIVE CYCLE" << std::endl;
} else {
REP(i, V) {
REP(j, V) {
if(j > 0) std::cout << " ";
if(g[i][j] == WEIGHT_INF){
std::cout << "INF";
} else {
std::cout << g[i][j];
}
}
std::cout << std::endl;
}
}
} | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using gp_queue=priority_queue<T, deque<T>, less<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
Edge(size_t src, size_t dst, Weight weight=1):
src(src), dst(dst), weight(weight)
{}
};
bool operator<(const Edge &e, const Edge &f) {
if (e.weight != f.weight) {
return e.weight > f.weight;
} else {
return e.src!=f.src? e.src<f.src : e.dst<f.dst;
}
}
using Edges=vector<Edge>;
using Vertex=vector<Edge>;
using Graph=vector<Vertex>;
void join(Graph &g, size_t s, size_t d, Weight w=1) {
// non-directed
g[s].push_back(Edge(s, d, w));
g[d].push_back(Edge(d, s, w));
}
void connect(Graph &g, size_t s, size_t d, Weight w=1) {
// directed
g[s].push_back(Edge(s, d, w));
}
vector<vector<Weight>> shortest_distance(Graph &g) {
/* Johnson */
size_t V=g.size();
vector<Weight> h(V);
for (size_t k=0; k<V; ++k)
for (size_t i=0; i<V; ++i)
for (const Edge &e: g[i])
if (h[e.dst] > h[e.src] + e.weight) {
h[e.dst] = h[e.src] + e.weight;
if (k == V-1)
return vector<vector<Weight>>();
}
for (size_t i=0; i<V; ++i)
for (Edge &e: g[i])
e.weight += h[e.src] - h[e.dst];
vector<vector<Weight>> d(V, vector<Weight>(V, INF));
vector<vector<size_t>> prev(V, vector<size_t>(V, -1));
for (size_t s=0; s<V; ++s) {
gp_queue<Edge> q; q.push(Edge(s, s, 0));
d[s][s] = 0;
while (!q.empty()) {
Edge e=q.top(); q.pop();
if (~prev[s][e.dst]) continue;
prev[s][e.dst] = e.src;
for (const Edge &f: g[e.dst]) {
if (d[s][f.dst] > e.weight + f.weight) {
d[s][f.dst] = e.weight + f.weight;
q.push(Edge(f.src, f.dst, e.weight+f.weight));
}
}
}
for (size_t u=0; u<V; ++u)
if (d[s][u] < INF)
d[s][u] += h[u] - h[s];
}
for (size_t v=0; v<V; ++v)
for (Edge &e: g[v])
e.weight += h[e.dst] - h[e.src];
return d;
}
int main() {
size_t V, E;
scanf("%zu %zu", &V, &E);
Graph g(V);
for (size_t i=0; i<E; ++i) {
size_t s, t;
Weight d;
scanf("%zu %zu %lld", &s, &t, &d);
connect(g, s, t, d);
}
vector<vector<Weight>> d=shortest_distance(g);
if (d.empty())
return !printf("NEGATIVE CYCLE\n");
for (vector<Weight> w: d)
for (size_t i=0; i<V; ++i)
if (w[i] < INF) {
printf("%lld%c", w[i], i<V-1? ' ':'\n');
} else {
printf("INF%c", i<V-1? ' ':'\n');
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,s,n) for(int i=s;i<n;++i)
#define FORR(i,s,n) for(int i=n-1;i>=s;--i)
#define ALL(c) (c).begin(),(c).end()
#define CLEAR(v) memset(v,0,sizeof(v))
#define MP(a,b) make_pair((a),(b))
#define ABS(a) ((a)>0?(a):-(a))
#define F first
#define S second
ll n, v[100000];
P a[100001], b[100001];
int main(int argc, char **argv) {
cin >> n;
REP(i, n) cin >> v[i];
REP(i, 100001) a[i] = b[i] = P{0, i};
REP(i, n/2) ++a[v[i*2]].F;
REP(i, n/2) ++b[v[i*2+1]].F;
sort(a, a+100001); reverse(a, a+100001);
sort(b, b+100001); reverse(b, b+100001);
if (a[0].S == b[0].S) cout << min(n - a[0].F - b[1].F, n - b[0].F - a[1].F) << endl;
else cout << (n - a[0].F - b[0].F) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define matrix vector<vector<char>>
#define zero(n,m) matrix(n , vector<char>(m,'0'))
#define one(n,m) matrix(n , vector<ll>(m,1))
#define pii pair<int,int>
#define point complex<ld>
#define angle(a) (atan2((a).imag() , (a).real() ))
#define pi acos(-1)
#define X real()
#define Y imag()
const int N = 2e5+5;
ll n , a[N] , b[N] , seg[4*N] , lazy[4*N];
ll st[N] , en[N] , st2[N] , en2[N];
set<ll> stt;
void probagate(int node , int st , int en)
{
if (lazy[node] != 0)
{
seg[node] += lazy[node];
if (st != en)
{
lazy[2*node] += lazy[node];
lazy[2*node+1] += lazy[node];
}
lazy[node] = 0;
}
}
void update(int node , int st , int en , int l , int r , int val)
{
probagate(node , st , en);
if (st > en || st > r || en < l)
return;
if (st >= l && en <= r)
{
lazy[node] += val;
return probagate(node , st , en);
}
int mid = (st+en)/2;
update(2*node,st,mid,l,r,val);
update(2*node+1,mid+1,en,l,r,val);
seg[node] = max(seg[2*node] , seg[2*node+1]);
}
ll query(int node , int st , int en , int l , int r)
{
if (st > en || st > r || en < l) return 0;
probagate(node , st , en);
if (st >= l && en <= r)
{
return seg[node];
}
int mid = (st+en)/2;
return max(query(2*node , st , mid , l , r) , query(2*node+1 , mid+1 , en , l , r));
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i=1; i<=n; i++)
{
cin >> a[i];
if (!st[a[i]]) st[a[i]] = i;
en[a[i]] = i;
}
for(int i=1; i<=n; i++)
{
cin >> b[i];
if (!st2[b[i]]) st2[b[i]] = i;
en2[b[i]] = i;
stt.insert(b[i]);
}
for(ll i=1; i<=n; i++)
{
ll l = st[b[i]] , r = en[b[i]];
if (l > i)
{
update(1,0,n-1,0,l-i-1,1);
}
l = max(en[b[i]]+1,i) , r = n;
if (l<=r)
{
ll l2 = l-i , r2 = r-i;
if (l2 <= r2)
{
update(1,0,n-1,l2,r2,1);
}
}
//from one to st[b[i]]-1
l = 1 , r = min(st[b[i]]-1 , i-1);
if (l<=r)
{
ll l2 = n-i+l , r2 = n-i+r;
if (l2 <= r2)
{
update(1,0,n-1,l2,r2,1);
}
}
if (i > en[b[i]])
{
l = en[b[i]]+1 , r = i-1;
if (l<=r)
{
ll l2 = n-i+l , r2 = n-i+r;
if (l2 <= r2)
{
update(1,0,n-1,l2,r2,1);
}
}
}
}
for(int i=0; i<n; i++)
{
if (query(1,0,n-1,i,i) == n)
{
cout << "Yes\n";
for(int j=1; j<=n; j++)
{
int newIdx = j + i;
if (newIdx > n) newIdx -= n;
a[newIdx] = b[j];
}
for(int j=1; j<=n; j++)
cout << a[j] << ' ';
cout << '\n';
return 0;
}
}
cout << "No\n";
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.