code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int,int> pr;
int main() {
// your code goes here
int w,h;
while(cin >> w >> h && w!=0){
int xs,ys,xg,yg,n,m,s,sum,c,d,x,y;
int dx[]={0,1,-1,0},dy[]={1,0,0,-1};
cin >> xs>>ys>>xg>>yg >> n;
bool map[102][102]={};
int color[102][102]={};
queue<pr> q;
color[xs][ys]=10;
for(int i=0;i<n;i++){
cin >> c >> d >>x >> y;
for(int j=0;j<2+d*2;j++)
for(int k=0;k<4-d*2;k++)
color[x+k][y+j]=c;
}
map[xs][ys]=true;
q.push(pr(xs,ys));
while(!q.empty()){
int f=q.front().first,s=q.front().second;
q.pop();
for(int i=0;i<4;i++){
if(color[f][s]==color[f+dx[i]][s+dy[i]] && !map[f+dx[i]][s+dy[i]]){
q.push(pr(f+dx[i],s+dy[i]));
map[f+dx[i]][s+dy[i]]=true;
}
}
}
if(map[xg][yg])
cout << "OK" << endl;
else
cout << "NG" << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n, m;
int x[20];
int y[20];
char d[30]; // ??????
int s[30]; // ?§???????
bool grid[21][21];
while (1)
{
cin >> n;
if (n == 0) return 0;
for (int i=0;i<n;i++) cin >> x[i] >> y[i];
cin >> m;
for (int i=0;i<m;i++) cin >> d[i] >> s[i];
for (int i=0;i<21;i++)
for (int j=0;j<21;j++) grid[i][j]=false;
int posx = 10, posy = 10;
grid[posx][posy]=true;
for (int i=0;i<m;i++)
{
for (int k=0;k<s[i];k++)
{
switch (d[i])
{
case 'E': posx = min(posx+1, 20); break;
case 'W': posx = max(posx-1, 0); break;
case 'N': posy = min(posy+1, 20); break;
case 'S': posy = max(posy-1, 0); break;
}
grid[posx][posy]=true;
}
}
int r=n;
for (int i=0;i<n;i++)
if (grid[x[i]][y[i]]) r--;
if (r==0) cout << "Yes" << endl;
else cout << "No" << endl;
}
} | 0 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
//#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
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;
}
}
int main(void)
{
int x;
string s;
cin >> x;
s = to_string(x);
int sum = 0;
for (int i = 0; i < s.length(); i++)
{
sum += s[i] - '0';
}
if (x % sum == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<cstdlib>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int len = s.size();
int cnts = 0, cntst = 0;
for (int i = 0; i < len; ++i) {
if (s[i] == 'S')
cnts++;
else if (s[i] == 'T' && cnts != 0) {
cnts--;
cntst += 2;
}
}
cout << len - cntst << 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 pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#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 int
#define test int t;cin>>t; while(t--)
#define en '\n'
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 rall(v) v.rbegin(),v.rend()
#define sz(x) (int)x.size()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
// You should only debug a pair of simple data types. For example,
// the debug won't work if one of pair's elements is collection type
// (std::vector, std::map, std::set...).
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// bool check_prime(int n) return whether a number is prime or not O(sqrt(N));
// int BE(int x,int n,int m) return x^n%m; O(logN);
// void sieve() from number 1-1000001 saare prime store kar lega in bool is_prime[1000001] array
// vector<int> z_array(string s) return vector which is Z-array of string s;
// vector<int> lps(string s) return vector which is lps array of string s;
// int power(int x,int n) return x^n; O(logN);
// using_ordered_set (template for using ordered set , replace first 2 lines of this page with this code..);
const int gf = 1e6 + 9;
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;
}
}
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;
vi v;
rep(i, 1, 55555)
{
if (check_prime(i) && i % 5 == 1)
{
v.pb(i);
}
}
debug(sz(v));
zip(i, 0, n)
cout << v[i] << " ";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#include <string>
int main(){
int k;
cin>>k;
string palabra;
cin>>palabra;
int tamano;
tamano=palabra.size();
if (tamano>k){
for(int i=0;i<k;i++){
cout<<palabra[i];
}
cout<<"...";
}
else{
cout<<palabra<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MOD=1000000007;
const int INF= int(1e9);
const int MAX =1007;
string a,b;
int n,m;
int dp[MAX][MAX];
int solve ( int n,int m) {
if(dp[n][m] != -1) {
return dp[n][m];
}
else if(m == 0) {
return dp[n][m]=n;
}
else if(n == 0) {
return dp[n][m]=m;
}
if (a[n-1] == b[m-1] ) {
return dp[n][m]=solve(n-1,m-1);
}
dp[n][m] = 1 + min( solve(n-1,m-1) , min ( solve(n-1,m) ,solve(n,m-1) ) );
return dp[n][m];
}
int main()
{
ios_base::sync_with_stdio(false);
for(int i=0;i<MAX;i++) {
for(int j=0;j<MAX;j++) {
dp[i][j]=-1;
}
}
cin>>a;
cin>>b;
n=a.size(),m=b.size();
solve(n,m);
cout<<dp[n][m]<<"\n";
return 0;
} | //Edit distance
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000
string s,t;
int dp[MAX+1][MAX+1];
int d(int i,int j){
if(s[i]==t[j]) return 0;
else return 1;
}
int main(){
cin>>s>>t;
for(int i=0;i<=s.size();++i) for(int j=0;j<=t.size();++j){
if(i==0||j==0){
dp[i][j]=max(i,j);
continue;
}
dp[i][j]=min(min(dp[i-1][j],dp[i][j-1])+1,dp[i-1][j-1]+d(i-1,j-1));
}
cout<<dp[s.size()][t.size()]<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(int i = 0; i < n; ++i) cout << UIET[i] << " "
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vpp vector<pair< int, int > >
#define pll pair<int , int >
#define ppll pair < pll , pll >
#define debug(n1) cout << n1 << endl
#define len(a) ((int) (a).size())
#define endl "\n"
#define mod 1000000007
const int INF=(1LL<<60)-1;
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
bool isPrime(int x){
for(int i = 2; i * i <= x; ++i){
if(x % i == 0) return 0;
}
return 1;
}
int fun(int n){
if(n & 1) return 3 * n + 1;
else return n/2;
}
int32_t main(){
SPEED;
string s;
cin >> s;
int ans = INF;
for(int i = 0; i < (len(s) - 2); ++i){
string temp = "";
temp += s[i];
temp += s[i + 1];
temp += s[i + 2];
int res = stoi(temp);
ans = min(ans, abs(res - 753));
}
cout << ans ;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
string s, sub;
int a;
vector<int> v;
cin >> s;
for(int i = 0; i < s.size()-2; i++){
sub = s.substr(i, 3);
a = stoi(sub);
v.push_back(abs(753-a));
}
sort(v.begin(), v.end());
cout << v.front();
}
///promy_pompom
//hello world
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef pair<l_l,ll> lll;
typedef vector<string> vs;
const ll dx[4]={1,-1,0,0};
const ll dy[4]={0,0,1,-1};
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//グリッド：（典型）dp,dfs,bfs,最短経路,その他
ll n;
bool ok(vector<l_l> ls){
ll h=0;
rep(i,sz(ls)){
ll b=ls[i].fi;
if(h+b<0)return false;
h+=ls[i].se;
}
return true;
}
int main(){
cin>>n;
vector<l_l> ls,rs;
ll tot=0;
rep(i,n){
string s;cin>>s;
ll h=0,b=0;
rep(j,sz(s)){
if(s[j]=='(')h++;
else h--;
b=min(b,h);
}
tot+=h;
if(h>=0)ls.pb({b,h});
else rs.pb({b-h,-h});
}
sort(ls.rbegin(),ls.rend());
sort(rs.rbegin(),rs.rend());
if(ok(ls)&&ok(rs)&&tot==0){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<int,int>;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(){
int N;
cin>>N;
int A[N];
REP(i,N){
cin>>A[N-1-i];
}
vector<int> L(N+1,MOD);
L[0]=-1;
REP(i,N){
if(A[i]<L[0]){
L[0]=A[i];
continue;
}
auto it=upper_bound(ALL(L),A[i]);
int index=it-L.begin();
if(L[index-1]==A[i]) L[index]=A[i];
else L[index--]=A[i];
}
RREP(i,N){
if(L[i]==MOD){
co(i-1);
return 0;
}
}
co(N);
return 0;
} | 0 |
// Written by newbiechd
#include <cstring>
#include <iostream>
#include <string>
const int maxN = 13;
int n;
const std::string ans[][7] = {
{
"aabc",
"ddbc",
"efgg",
"efhh"
},
{
"aabbd",
"ccf.d",
"eefgg",
"..hij",
"..hij"
},
{
"aabbcc",
"ddeeff",
"ghi...",
"ghi...",
"...jkl",
"...jkl"
},
{
"aabbcc.",
"ddee..h",
"ffgg..h",
"....ijk",
"....ijk",
"....lmn",
"....lmn"
}
};
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cin >> n;
if (n < 3) {
printf("-1\n");
return 0;
}
if (n == 3) {
std::cout << "aa.\n..a\n..a\n";
return 0;
}
int k = (n & 3) + 4;
for (int i = 0; i < n - k; ++i) {
std::string str(n, '.');
str.replace(i / 4 * 4, 4, ans[0][i % 4]);
std::cout << str << '\n';
}
for (int i = n - k; i < n; ++i) {
std::string str(n, '.');
str.replace(n - k, k, ans[k - 4][i + k - n]);
std::cout << str << '\n';
}
return 0;
}
| #include<iostream>
using namespace std;
int main(){
long long int dp[31];
dp[0]=1;
dp[1]=1;
dp[2]=2;
for(int i=3;i<=30;i++)dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
int n;
while(cin>>n,n){
long long int ans=dp[n];
ans=(ans-1)/10+1;
ans=(ans-1)/365+1;
cout<<ans<<endl;
}
} | 0 |
#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;
const int N = 1e6 + 1;
const int MOD = 1e9 + 7;
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int sub(int a, int b) {
return (a - b + MOD) % MOD;
}
int p_col[N];
int p_row[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
fill(p_col, p_col + N, -1);
fill(p_row, p_row + N, -1);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
x--;
p_row[x] = i;
}
for (int i = 0; i < m; i++) {
int x;
cin >> x;
x--;
p_col[x] = i;
}
int ans = 1;
int cnt = 0;
int free_col = 0;
int free_row = 0;
for (int i = n * m - 1; i >= 0; i--) {
if (p_row[i] != -1 && p_col[i] != -1) {
free_row++;
free_col++;
} else if (p_row[i] != -1) {
ans = mul(ans, free_col);
free_row++;
} else if (p_col[i] != -1) {
ans = mul(ans, free_row);
free_col++;
} else {
ans = mul(ans, sub(mul(free_col, free_row), cnt));
}
cnt++;
}
cout << ans << '\n';
}
| #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(int i=0,_i=(n);i<_i;++i)
#define _rep3(i,a,b) for(int i=(a),_i=(b),_ii=(b)>(a)?1:-1;abs(_i-i)>0;i+=_ii)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__)
#define all(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))
signed main() {
ll N, M, V, P;
ins(N, M, V, P);
vector<ll> A(N);
rep(i, N)
cin >> A[i];
all(sort, A); all(reverse, A);
int ok = -1, ng = N;
auto f = [&](int mid) {
if (mid < P) return true;
if (A[P-1] > A[mid]+M) return false;
ll tmp = 1LL * ((N-mid)+P-1) * M;
rep(i, P-1, mid)
tmp += min(1LL*M, max(0LL, A[mid]+M-A[i]));
return tmp >= M*V;
};
while (abs(ok - ng) > 1) {
int mid = ok + (ng-ok) / 2;
(f(mid) ? ok : ng) = mid;
}
cout << ok+1 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s); i < (int)(n+1); i++)
#define repr(i,n) for (int i = (n-1); i>=0;i--)
#define repr3(i,n) for(int i = (n);i>0;i--)
#define stlen(s) ll s.size()-1
#define all(v) v.begin(), v.end()
#define cout(n) cout<<std::fixed<<std::setprecision(n)
using Graph = vector<vector<int>>;
#define INF const ll INF = 1001001001;
#define PI const ld PI = 3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
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;
}
vector<vector<long long>> comb(int n, int r) {
vector<vector<long long>> v(n + 1,vector<long long>(n + 1, 0));
ll div=(ll)powl(10,9)+7;
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k < j; k++) {
v[j][k] = (v[j - 1][k - 1] + v[j - 1][k])%div;
}
}
return v;
}
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1) res.push_back({N, 1});
return res;
}
int main() {
ll N,M;
cin >> N>>M;
//pairの書き換えが煩雑であるので、素数リストと指数連想配列に分ける
map<ll,ll> prime_count;
vector<ll> prime_list;
//resに素数のペア(素数、その素数の指数）の配列が入る
const auto &res = prime_factorize(M);
rep(i,res.size()){
if(prime_count[res[i].first]==0){
prime_list.push_back(res[i].first);
}
prime_count[res[i].first]+=res[i].second;
}
// 前処理
COMinit();
ll ans=1;
rep(i,prime_list.size()){
ans*=COM(N+prime_count[prime_list[i]]-1,N-1);
ans%=MOD;
}
cout<<ans<<endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
nCrprep();
ll n,m; cin >> n >> m;
auto vec = prime_factorize(m);
ll ans = 1;
for(auto p : vec){
ll x = p.second;
ans *= nCr(n-1+x,x);
ans = mod(ans);
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<pair<int, int>, int> p;
#define MOD 1000000007
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll mod = pow(10, 9) + 7;
ll N, M;
cin >> N >> M;
map<ll, ll> a;
for(ll i = 2LL; i * i <= M; i++) {
while(M % i == 0) {
a[i]++;
M /= i;
}
}
if(M != 1) a[M]++;
ll ans = 1LL;
for(auto i = begin(a); i != a.end(); i++) {
ll c = 1LL;
for(ll j = 0LL; j < i -> second; j++) {
c *= (N + j) % mod;
c %= mod;
c *= modpow(j + 1LL, mod - 2LL, mod) % mod;
c %= mod;
}
ans *= c;
ans %= mod;
}
cout << ans % mod << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
ll power(ll n, ll k){
ll res = 1;
while(k > 0){
if (k & 1)
res = res * n % MOD;
n = n * n % MOD;
k >>= 1;
}
return res;
}
ll genfact(ll n, ll k){
ll res = 1;
k--;
while (k >= 0){
res = (res * (n - k)) % MOD;
k--;
}
return res;
}
ll inv(ll n){
return power(n, MOD - 2);
}
ll fact(ll n){
return genfact(n, n - 1);
}
ll nck(ll n, ll k){
if (k == 0)
return 1;
if (n <= 0)
return 0;
return ((genfact(n, k) % MOD) * inv(fact(k))) % MOD;
}
int main(void){
ll n, m, k;
cin >> n >> m >> k;
ll ans = 0;
ll t = nck(n*m-2,k-2);
for (ll j = 1; j < m; j++){
ans += j*(m-j) % MOD * n % MOD *n % MOD * t % MOD;
ans = (ans % MOD);
}
for (ll i = 1; i < n; i++){
ans += i*(n-i) % MOD * m % MOD *m % MOD * t % MOD;
ans = (ans % MOD);
}
cout << ans << endl;
return 0;
}
| 0 |
#define _USE_MATH_DEFINES
#include <iostream> //cin, cout
#include <vector> //vector
#include <algorithm> //sort,min,max,count
#include <string> //string,getline
#include <ios> //fixed
#include <iomanip> //setprecision
#include <utility> //swap
#include <cstdlib> //abs(int)
#include <cmath> //sqrt
#include <sstream> //stringstream,getline
#include <cmath> //ceil,M_PI
#include <numeric> //gcd
using namespace std;
int main() {
string S;
cin >> S;
switch (S[2]) {
case 'N': if (S[0] == 'S') {
cout << 7 << endl;
}
else {
cout << 6 << endl;
}
break;
case 'E': cout << 5 << endl; break;
case 'D': cout << 4 << endl; break;
case 'U': cout << 3 << endl; break;
case 'I': cout << 2 << endl; break;
case 'T': cout << 1 << endl; break;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> V { "SUN","MON","TUE","WED","THU","FRI","SAT" };
int tmp = 0;
for (int i = 0; i < V.size(); i++) {
if (V.at(i) == S) tmp = i;
}
cout << 7 - tmp << "\n";
} | 1 |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/rope>
//using namespace __gnu_cxx
//#include<ext/pb_ds/priority_queue.hpp>
//using namespace __gnu_pbds;
#define lowbit(x) (x&-x)
#define pb push_back
#define empb emplace_back
#define all(x) (x).begin(),(x).end()
#define clr(a,b) memset(a,b,sizeof(a))
#define caze(T) for(cin>>T;T;T--)
#define inf (1<<29)
#define Endl ('\n')
#define fi first
#define se second
#define db double
#define ldb long double
#define ll long long
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define ull unsigned long long
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
inline char nc() {
#define SZ 1000000
static char buf[SZ], *p1, *p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++;
}
template<typename T>
inline int scan(T &x) {
char c, sign=1;
while(!isdigit(c=nc())&&c!=EOF)if(c=='-')sign*=-1;
if(c==EOF) return EOF;
for(x = 0; isdigit(c); c = nc())
x = (x<<1) + (x<<3) + (c&15);
return x *= sign, 1;
}
template<typename T, typename...Args>
inline int scan(T &x, Args&...args) {
return scan(x), scan(args...);
}
const int N=1<<18;
const int mod=1000000007;
int f[N],ivf[N];
int qp(int a,int b)
{
int ret=1;
for(;b;b>>=1,a=1LL*a*a%mod)
if(b&1) ret=1LL*ret*a%mod;
return ret;
}
int C(int n,int m){int ret=1LL*f[n]*ivf[n-m]%mod;return 1LL*ret*ivf[m]%mod;}
int go(int n,int m){return C(n+m-2,m-1);}
int main()
{
f[0]=1;
for(int i=1;i<N;++i)
f[i]=1LL*f[i-1]*i%mod;
ivf[N-1]=qp(f[N-1],mod-2);
for(int i=N-2;~i;--i)
ivf[i]=1LL*ivf[i+1]*(i+1)%mod;
int n,m,a,b;
while(cin>>n>>m>>a>>b)
{
int ans=0;
for(int i=1;i<=n-a;++i)
{
int tp=1LL*go(i,b)*go(n-i+1,m-b)%mod;
(ans+=tp)%=mod;
}
cout<<ans<<Endl;
}
} | #include <iostream>
using namespace std;
const long long MOD = 1e9+7;
//aのMODbでの逆元
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long combi(int n,int k){
k = min(k,n-k);
long long p = 1;
for(int i = n;i>=n-k+1;i--){
p*=i;
p%=MOD;
}
for(int i = 0;i<k;i++){
p*=modinv(i+1,MOD);
p%=MOD;
}
return p;
}
int main(){
long long h,w,a,b;
cin >> h >> w >> a >> b;
long long comb1 = 1;
long long comb2 = combi(w+h-b-2,w-b-1);
long long ans = 0;
for(int i = 0;i<h-a;i++){
ans+=((comb1*comb2)%MOD);
ans%=MOD;
comb1*=(b+i);
comb2*=(h-1-i);
comb1%=MOD;
comb2%=MOD;
comb1*=modinv(i+1,MOD);
comb2*=modinv(w+h-b-2-i,MOD);
comb1%=MOD;
comb2%=MOD;
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for(int i = (a); i <=(n); ++i)
#define repst(i, n) for(auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for(int i = (n); i >= (a); --i)
#define sp(x) fixed << setprecision(x)
#define ordered_set tree<int , null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int inf = int(1e9);
const int mod = inf + 7;
const int N = 1e6 + 555; // TL MB
const double PI = acos(-1.0);
void mul(ll &x, ll y){
x *= y;
if(x >= mod) x %= mod;
}
void add(ll &x, ll y){
x += y;
if(x >= mod) x -= mod;
if(x < 0) x += mod;
}
ll bp(ll a, ll n){
ll r = 1;
while(n){
if(n & 1) mul(r, a);
mul(a, a);
n >>= 1;
}
}
void solve()
{
int n;
cin >> n;
ll a[n];
vector<ll> p;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, n){
if(i && a[i] == a[i - 1]) p.pb(a[i++]);
}
sort(p.rbegin(), p.rend());
if(sz(p) <= 1) cout << 0;
else cout << p[0] * p[1];
}
int main()
{
// freopen("crosses.in", "r", stdin);
// freopen("crosses.out", "w", stdout);
Red;
int T = 1;
// cin >> T;
for(int i = 1; i <= T; ++i){
solve();
}
return 0;
} | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;
vector<ll> & T(vector<ll> &ret,vector<ll> A,vector<ll> B){
for(int i=0;i<B.size();i++){
ret[i]=A[B[i]];
}
return ret;
}
int main(){
ll n;
cin>>n;
vector<ll> x(n);
for(auto &i:x){cin>>i;}
ll m,k;
cin>>m>>k;
vector<ll> A(m);
for(auto &i:A){cin>>i;}
vector<ll> a(n-1);
vector<ll> ans(n-1);
for(int i=0;i+1<n;i++){ans[i]=a[i]=i;}
for(int i=0;i<m;i++){
A[i]--;
swap(a[A[i]-1],a[A[i]]);
}
while(k>0){
if(k&1){T(ans,ans,a);}
T(a,a,a);
k>>=1;
}
vector<ll> dp(n,x[0]);
for(int i=0;i<n-1;i++){
dp[i+1]=dp[i]+x[ans[i]+1]-x[ans[i]];
}
for(int i=0;i<n;i++){
cout<<dp[i]<<endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N; // 1 <= N <= 1+10^15 1000000000000001
string abc = "abcdefghijklmnopqrstuvwxyz";
string name = "";
for(int i = 0; i < 11; i++){
name = abc[(N-1)%26]+name;
N = (N-1)/26;
if(N == 0) break;
}
cout << name << endl;
}
| #include <stdio.h>
#define LL long long
#define ULL unsigned long long
#define UI unsigned int
#define UC unsigned char
#define UL unsigned long
int main() {
LL llMax = 1000000000000001, llN;
scanf("%lld", &llN);
//a = 97
int iChar[20], iCnt = 0;
llN--;
while (iCnt < 20) {
iChar[iCnt++] = llN % 26;
if (llN < 26)
break;
llN -= (iChar[iCnt - 1] + 1);
llN /= 26;
//printf("%lld\n", llN);
}
while (iCnt-- > 0) {
printf("%c", (char)(iChar[iCnt] + 97));
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef tuple<int, int, int, int> T;
int H, W;
int a[510][510];
vector<T> ans;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> H >> W;
rep(i, H) rep(j, W) cin >> a[i][j];
rep(i, H) {
if (i%2==0) {
rep(j, W) {
if (i==H-1 && j==W-1) continue;
int ni, nj;
if (j==W-1) ni = i+1, nj = W-1;
else ni = i, nj = j+1;
if (a[i][j]%2==1) {
ans.pb(make_tuple(i+1, j+1, ni+1, nj+1));
a[ni][nj]++;
}
}
}
else {
for (int j=W-1; j>=0; j--) {
if (i==H-1 && j==0) continue;
int ni, nj;
if (j==0) ni = i+1, nj = 0;
else ni = i, nj = j-1;
if (a[i][j]%2==1) {
ans.pb(make_tuple(i+1, j+1, ni+1, nj+1));
a[ni][nj]++;
}
}
}
}
cout << ans.size() << endl;
rep(i, ans.size()) cout << get<0>(ans[i]) << " " << get<1>(ans[i]) << " " << get<2>(ans[i]) << " " << get<3>(ans[i]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 501;
int a[N][N];
struct Move {
int x1, y1, x2, y2;
};
// up, left, down, right
int dx[4] = {0, -1, 0, 1}, dy[4] = {-1, 0, 1, 0};
void solve() {
int h, w; scanf("%d%d", &h, &w);
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
scanf("%d", a[i]+j);
}
}
vector<Move> v;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (a[i][j]%2 == 0) continue;
for (int k = 0; k < 4; ++k) {
if (i+dy[k] < 0 || i+dy[k] >= h || j+dx[k] < 0 || j+dx[k] >= w) continue;
if (a[i+dy[k]][j+dx[k]]%2==0) continue;
v.push_back({i+1, j+1, i+dy[k]+1, j+dx[k]+1});
--a[i][j];
++a[i+dy[k]][j+dx[k]];
break;
}
if (a[i][j]%2 == 0) continue;
for (int k = 2; k < 4; ++k) {
if (i+dy[k] < 0 || i+dy[k] >= h || j+dx[k] < 0 || j+dx[k] >= w) continue;
v.push_back({i+1, j+1, i+dy[k]+1, j+dx[k]+1});
--a[i][j];
++a[i+dy[k]][j+dx[k]];
break;
}
}
}
printf("%d\n", v.size());
for (const auto &e: v) {
printf("%d %d %d %d\n", e.x1, e.y1, e.x2, e.y2);
}
}
int main() {
init();
int t = 1; //scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
| 1 |
#include <iostream>
using namespace std;
void bubble(int *pbuff, int n){
int v;
int j;
int flag=1;
int i=0;
int count=0;
while(flag){
flag=0;
for(int i=n-1;j<i;i--){
if(pbuff[i]<pbuff[i-1]){
v=pbuff[i];
pbuff[i]=pbuff[i-1];
pbuff[i-1]=v;
count++;
}
flag=1;
}
j++;
}
for(int j=0;j<n-1;j++) cout << pbuff[j]<<" ";
cout << pbuff[n-1]<<endl;
cout << count<<endl;
return ;
}
int main()
{
int n;
cin>> n;
int buff[100];
for(int j=0;j<n;j++) cin >> buff[j];
bubble(buff,n);
return 0;
}
| //FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define pll pair<long,long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define d4(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl
#define PI 3.1415926535897932384626433832795
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define endl "\n"
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
const ll M=1000000007;
const ll MM=998244353;
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
ll newmod(ll a,ll b)
{
return ((a%b)+b)%b;
}
ll powM(ll a,ll b,ll m )
{
if(a<=0)return 0;
a%=m;
if(!b)return 1;
ll ans=1LL;
while(b)
{
if(b&1)ans=ans*a%m;
a=a*a%m;
b>>=1;
}
return ans;
}
ll poww(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
template<typename T,typename F>
void chmax( T &a,F b){
if(b>a)a=b;
}
template<typename T,typename F>
void chmin( T &a,F b){
if(b<a)a=b;
}
const ll N=1e5+5;
int main()
{
IOS;
ll n;cin>>n;
vl f(N);
ll ans=1;
for(int i=1;i<=n;i++){
ll x;cin>>x;
ll temp;
if(!x){
temp=3-f[0];
}
else {
temp=f[x-1]-f[x];
}
if(temp<=0){
cout<<0;
return 0;
}
ans=ans*temp%M;
f[x]++;
}
cout<<ans;
//end_routine();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k, t; cin >> k >> t;
vector<int> a(t);
for(int i=0; i<t; i++) cin >> a[i];
sort(a.begin(), a.end());
int sum = 0, ans = 1e9;
for(int i=0; i<t; i++){
sum += a[i];
ans = min(ans, abs(k-sum-sum));
}
cout << max(0, ans - 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int k, t, a[109];
cin >> k >> t;
for(int i=0;i<t;i++)cin >> a[i];
int ans=0;
for(int i=0;i<t;i++){
int rest=max(a[i]-(k+1)/2, 0);
if(rest==1)ans++;
else if(rest>1){
ans += 1+2*(rest-1);
}
}
cout << ans << endl;
}
| 1 |
#include<bits//stdc++.h>
using namespace std;
int main(){
int n,p;
while(cin>>n>>p&&n!=0&&p!=0){
int a[50];
fill(a,a+n,0);
int m=0,p2=p;
while(true){
if(p==0){
p+=a[m];
a[m]=0;
}
else{
p--;
a[m]++;
}
if(p==0&&a[m]==p2) break;
m++;
if(m==n) m=0;
}
cout<<m<<endl;
}
} | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#include <assert.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for(ll i = 0; i < n; i++)
int main(){
int n, p;
cin >> n >> p;
while(n || p){
ll m = p, idx = 0;
vector<ll> stone(n);
for(;;){
if(m > 0){
m--;
stone[idx]++;
}
else if(stone[idx] < p){
m = stone[idx];
stone[idx] = 0;
}
else{
cout << idx << endl;
break;
}
idx++;
idx %= n;
}
cin >> n >> p;
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
# define ll int64_t
# define str string
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define PI 3.141592653589793
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std;
#define INF 2000000000
#define MAX_V 10
bool compare_by_b(pair<string,ll> a,pair<string,ll> b){
if(a.second != b.second) return a.second<b.second;
else return a.first<b.first;
}
bool my_compare(pair<ll,ll> a,pair<ll,ll> b){
if(a.first != b.first) return a.first<b.first;
if(a.second != b.second) return a.second>b.second;
else return true;
}
ll modpow(ll a,ll n,ll mod1) {
ll res=1;
while(n>0){
if(n&1) res=res*a%mod1;
a = a*a%mod1;
n >>= 1;
}
return res;
}
ll factorial(ll n){
ll x=1;
rrep(i,n) (x*=i)%=mod;
return x;
}
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;
}
const ll MAX = 5100000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
using graph = vector<vector<ll>>;
pair<pair<ll,ll>,ll> p[100010];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,k;
cin>>n>>k;
vec<ll> a(n);
rep(i,n) {
cin>>a[i];
}
sort(ALL(a));
if(a[n-1]<k){
cout<<"IMPOSSIBLE"<<endl;
return 0;
}
ll sum=gcd(a[0],a[1]);
for(ll i=2;i<n;i++) sum=gcd(sum,a[i]);
if(k%sum==0) cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <class T> string join(const T &v, const string delim = ",")
{
if (v.empty())
return "";
ostringstream res;
res << v[0];
for (int i = 1; i < v.size(); i++)
{
res << delim << v[i];
}
return res.str();
}
#pragma endregion Macros
// 解説AC
int main()
{
int H, W;
cin >> H >> W;
vector<vector<int>> a(H, vector<int>(W));
rep(i, H) rep(j, W) cin >> a[i][j];
int ph=-1, pw=-1;
bool c=false;
vector<vector<int>> ans;
for (int h = 0; h < H; h++) {
if (h % 2 == 0) {
for (int w = 0; w < W;w++){
if (c) ans.push_back(vector<int>{ph + 1, pw + 1, h + 1, w + 1});
if(c){
if(a[h][w]%2==1){
c = false;
}
}else{
if(a[h][w]%2==1){
c = true;
}
}
ph = h;
pw = w;
}
} else {
for (int w = W - 1;w>=0;w--){
if (c) ans.push_back(vector<int>{ph + 1, pw + 1, h + 1, w + 1});
if (c) {
if (a[h][w] % 2 == 1) {
c = false;
}
} else {
if (a[h][w] % 2 == 1) {
c = true;
}
}
ph = h;
pw = w;
}
}
}
cout << ans.size() << endl;
for(auto a:ans){
cout << join(a, " ") << endl;
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define endl "\n"
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define all(x) (x).begin(), (x).end()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string a, b, c;
cin >> n >> a >> b >> c;
int ans = 0;
rep(i, 0, n) {
if (a[i] != b[i] && b[i] != c[i] && c[i] != a[i]) ans += 2;
else if (a[i] == b[i] && b[i] == c[i]) continue;
else ans++;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <stack>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 28)
template<typename T>
void remove(vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}
vector<string> split(const string &s, char c);
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int n, q, cnt = 0;
void search(int num, int memo[10001]){
rep(i,n){
if(memo[i]==num){
cnt++;
break;
}
}
}
int main(void){
int memo[10001];
fill_n(memo, 10001, 0);
cin >> n;
rep(i,n)cin >> memo[i];
cin >> q;
rep(i,q){
int a;
cin >> a;
search(a,memo);
}
cout << cnt << endl;
return 0;
}
int StrToInt(string s){
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i){
stringstream ss;
ss << i;
return ss.str();
}
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (int i = 0; i < s.size(); i++) {
char ch = s[i];
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
} | 0 |
#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 <functional>
#include <random>
using namespace std;
const int N = 1000;
int ind[N][N];
vector<pair<int, int>> apply(vector<pair<int, int>> v, int x) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
ind[i][j] = -1;
}
}
vector<pair<int, int>> vecs;
for (int i = 0; i * i <= x; i++) {
for (int j = 0; j * j <= x; j++) {
if (i * i + j * j == x) {
vecs.push_back({-i, j});
vecs.push_back({i, -j});
vecs.push_back({i, j});
vecs.push_back({-i, -j});
}
}
}
int n = (int)v.size();
for (int i = 0; i < n; i++) {
ind[v[i].first][v[i].second] = i;
}
vector<vector<int>> g(n);
for (int i = 0; i < n; i++) {
int f, s;
tie(f, s) = v[i];
for (auto t : vecs) {
int dx, dy;
tie(dx, dy) = t;
if (f + dx > N || f + dx < 0) continue;
if (s + dy > N || s + dy < 0) continue;
if (ind[f + dx][s + dy] != -1) {
g[i].push_back(ind[f + dx][s + dy]);
}
}
}
vector<int> used(n);
vector<int> cl(n);
vector<int> lol(2);
function<void(int, int)> dfs = [&](int cur, int c) {
used[cur] = 1;
cl[cur] = c;
lol[c]++;
for (auto t : g[cur]) {
if (!used[t]) {
dfs(t, c ^ 1);
}
}
};
for (int i = 0; i < n; i++) {
if (!used[i]) {
dfs(i, 0);
}
}
int mx = 0;
if (lol[1] > lol[0]) mx = 1;
vector<pair<int, int>> tk;
for (int i = 0; i < n; i++) {
if (cl[i] == mx) {
tk.push_back(v[i]);
}
}
return tk;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
n *= 2;
int d1, d2;
cin >> d1 >> d2;
if (d1 % 2 < d2 % 2) {
swap(d1, d2);
}
if (d2 % 2 == 1) {
for (int i = 0; i < n; i += 2) {
for (int j = 0; j < n; j += 2) {
cout << i << ' ' << j << endl;
}
}
exit(0);
}
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (d1 % 2) {
if ((i + j) % 2 == 0) {
v.push_back({i, j});
}
} else {
v.push_back({i, j});
}
}
}
if (d1 % 2 == 0) {
v = apply(v, d1);
}
v = apply(v, d2);
for (int i = 0; i < n * n / 4; i++) {
cout << v[i].first << ' ' << v[i].second << '\n';
}
}
| //============================================================================
// Name : hoba.cpp :)
// Author : (O_O Diab) (Why_not) (el 3AQ)
// Version :
// Copyright : please, Don't touch me :(
// Description : problem (I) in C++
// MAIN IDEA : max sum of S(X) + S(S(X)) => 100 so brute force
//============================================================================
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define rw freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
#define pb push_back
#define F first
#define S second
#define pf push_front
#define lp(i,a,b) for (int i=a;i<=(int)b;++i)
#define lp2(i,a,b) for (int i=a;i>=b;--i)
#define f(x) return cout<<x<<"\n",0
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(c) c.begin(),c.end()
#define allr(c) c.rbegin(),c.rend()
#define p(x) cout<<#x<<" = { "<<x<<" } \n"
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define EPS 1e-6
// to convert string to number use int a = stoi(string);
// to convert number to string use string s = to_string(int);
#define FAST ios::sync_with_stdio(0),ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define clr(c,x) memset(c,x,sizeof(c));
using namespace __gnu_pbds;
using namespace std;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const int dx[] = { 0, 1, 0, -1, 1, -1, 1, -1 };
const int dy[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
const int N = 2e5 + 5, mod = (int) 1e9 + 7, INF = 0x3f3f3f3f;
vi vv;
vector<vi> v, vec;
set<int> st;
int ans[N] = { }, comp[N] = { };
bool vis[N] = { };
void dfs(int node) {
vis[node] = true;
for (auto u : v[node])
if (!vis[u])
dfs(u);
vv.pb(node);
}
int main() {
#ifdef ONLINE_JUDGE
FAST
#endif
int n, k, l;
cin >> n >> k >> l;
v.resize(n + 1);
lp(i,1,k)
{
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
int cnt = 0;
lp(i,1,n)
{
if (vis[i])
continue;
vv.clear();
dfs(i);
cnt++;
for (auto u : vv)
comp[u] = cnt;
}
clr(vis, 0);
v.clear();
v.resize(n + 1);
vec.resize(n + 1);
lp(i,1,l)
{
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
lp(i,1,n)
{
if (vis[i])
continue;
vv.clear();
dfs(i);
st.clear();
for (auto u : vv) {
vec[comp[u]].pb(u);
st.insert(comp[u]);
}
for (auto u : st) {
for (auto k : vec[u])
ans[k] = vec[u].size();
vec[u].clear();
}
}
lp(i,1,n)
cout << ans[i] << " ";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, T;
cin >> N >> T;
vector<ll> time(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> time[i];
}
for (int i = 0; i < N-1; i++) {
if (time[i+1] - time[i] < T) {
ans += time[i+1]- time[i];
} else {
ans += T;
}
}
ans += T;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
char str[1002],cmp[8]="Hoshino";
scanf("%d%c",&n,&str[0]);
for(int i=0;i<n;i++){
gets(str);
int cnt=0;
int j=0;
while(str[j]!='\0'){
if(str[j]==cmp[cnt])cnt++;
else cnt=0;
if(str[j]==cmp[cnt])cnt++;
if(cnt==7){str[j]='a';cnt=0;}
j++;
}
puts(str);
}
} | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
int k[1000000];
int p(int A,int B){
if(!B)return 1;
if(B%2)return p(A,B-1)*A%mod;
int C=p(A,B/2);
return C*C%mod;
}
int c(int A,int B){
if(A<B)return 0;
return k[A]*p(k[A-B]*k[B]%mod,mod-2)%mod;
}
signed main(){
k[0]=1;
for(int i=1;i<=1000000;i++)k[i]=k[i-1]*i%mod;
int N,M;
cin>>N>>M;
map<int,int> A;
for(int i=2;i<=M/i;i++)
for(;M%i==0;M/=i)A[i]++;
if(M!=1)A[M]++;
int ans=1;
for(pair<int,int> p:A)ans=ans*c(N+p.second-1,N-1)%mod;
cout<<ans<<endl;
} | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 998244353;
int main(){
const int maxSize = 2000001;
vector<long long> inv(maxSize);
vector<long long> fact(maxSize);
vector<long long> factInv(maxSize);
for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
for(int i=2;i<maxSize;i++){
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
fact[i] = fact[i-1] * i % MOD;
factInv[i] = factInv[i-1] * inv[i] % MOD;
}
auto comb = [&](int n, int r){
if(n < r || r < 0) return 0LL;
return fact[n] * factInv[n-r] % MOD * factInv[r] % MOD;
};
auto perm = [&](int n, int r){
if(n < r || r < 0) return 0LL;
return fact[n] * factInv[n-r] % MOD;
};
int N, M;
while(cin >> N >> M){
long long res = (N * comb(M+N-2, N-2)) % MOD;
long long sum = 0;
for(int i=0;i<=M/2;i++){
int m2 = M+i;
long long cur = comb(m2+N-1, N-1);
sum += N * comb(m2-M+N-2, N-2);
sum %= MOD;
cur = (cur + MOD - sum) % MOD;
res += cur * comb(N, M-2*i);
res %= MOD;
}
cout << res << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
int n=s.size();
vector<int>cnt(26,0);
for (int i = 0; i < n; ++i) {
cnt[s[i]-'a']++;
}
string ans;
char nx;
for (int i = 0; i < 26; ++i) {
if(cnt[i]==0){
nx=(char)('a'+i);
break;
}
}
if(s.size()!=26){
ans=s+nx;
cout <<ans <<endl;
}
else {
ll mx=-1;
reverse(all(s));
int k=-1;
vector<char>f;
for (int i = 0; i < n; ++i) {
if(mx>s[i]-'a'){
// for (int i = 0; i < f.size(); ++i) {
// cout <<f[i]<<" ";
// }
int key=lower_bound(all(f),s[i])-f.begin();
s[i]=f[key];
k=n-i;
break;
}
else {
mx=s[i]-'a';
f.push_back(s[i]);
}
}
reverse(all(s));
if(k>0){
cout <<s.substr(0,k)<<endl;
}
else cout <<-1<<endl;
}
}
| #include<iostream>
#include<string>
using namespace std;
int main() {
string s;
cin >> s;
int mini = 10000;
for (int i = 0; i < s.length()-2; i++) {
int x = atoi(s.substr(i, 3).c_str());
mini = min(abs(x - 753), mini);
}
cout << mini << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int main(){
ll x;cin>>x;
if(x<=6) puts("1");
else if(x<=11) puts("2");
else {
ll y=x/11,z=x%11;
y<<=1;
if(z>0&&z<=6) y++;
else if(z>0&&z>6) y+=2;
cout<<y;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long moves = 2 * (x / 11);
if (x % 11 > 0) moves++;
if (x % 11 > 6) moves++;
cout << moves << endl;
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int n;
ll t[500005];
void inc(int x, ll v) {
for (; x <= n; x += x & -x) t[x] += v;
}
ll que(int x) {
ll z = 0;
for (; x; x -= x & -x) z += t[x];
return z;
}
int main() {
ios::sync_with_stdio(false);
int q, o, u, v;
cin >> n >> q;
for (int i = 1; i <= n; i++) cin >> u, inc(i, u);
while (q--) {
cin >> o >> u >> v;
if (o == 0) inc(u + 1, v);
else cout << que(v) - que(u) << '\n';
}
}
| #include <bits/stdc++.h>
#include <atcoder/all>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
using namespace atcoder;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N, Q; cin >> N >> Q;
fenwick_tree<ll> ft(N);
REP(i, N){
ll a; cin >> a;
ft.add(i, a);
}
REP(i, Q){
int q; cin >> q;
if(q == 0){
int p; ll x; cin >> p >> x;
ft.add(p, x);
}else{
int l, r; cin >> l >> r;
ll ans = ft.sum(l, r);
cout << ans << endl;
}
}
} | 1 |
#include <algorithm>
#include <cstdio>
const int N=1000005;
int f[N];
char a[N],b[N];
bool check(int n){
for (int i=1;i<=n;i++)
if (a[i]!=b[i]) return 0;
return 1;
}
int main(){
int n;scanf("%d\n%s%s",&n,a+1,b+1);
if (check(n)){
printf("0\n");
return 0;
}
int ans=1;
for (int i=n,j=n,x=0;i;i--)
if (b[i]!=b[i-1]){
for (j=std::min(j,i);j && a[j]!=b[i];j--) f[j+x]=-x;
if (!j){
printf("-1\n");
return 0;
}
x++;
if (j--<i) ans=std::max(ans,f[i-1+x]+x+1);
}
printf("%d\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int mod=998244353;
const int maxn=100010;
int k,n,N,tmp,ans,jc[maxn],iv[maxn],ivjc[maxn],cnt;
int C(int x,int y) {
if (x<y||y<0) return 0;
return (ll)jc[x]*ivjc[x-y]%mod*ivjc[y]%mod;
}
void update(int &x,int y) {
x+=y; if (x>=mod) x-=mod;
}
int main() {
read(k); read(n);
jc[0]=iv[0]=ivjc[0]=jc[1]=iv[1]=ivjc[1]=1;
for (int i=2;i<=10000;i++) {
jc[i]=(ll)jc[i-1]*i%mod;
iv[i]=(ll)(mod-mod/i)*iv[mod%i]%mod;
ivjc[i]=(ll)ivjc[i-1]*iv[i]%mod;
}
for (int m=2;m<=2*k;m++) {
cnt=0;
for (int i=1;i<=k;i++)
if (i<=m-i&&m-i<=k) cnt++;
ans=0;
for (int i=0;i<=cnt;i++) {
N=n-i*2;
if (N<0) break;
tmp=(ll)C(N+k-1,k-1)*C(cnt,i)%mod;
if (i&1^1) update(ans,tmp);
else update(ans,mod-tmp);
}
printf("%d\n",ans);
}
return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/ | 0 |
#include<bits/stdc++.h>
#define rep(i,a) for(int (i)=0; (i)<(a); (i)++)
#define rrep(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define rep2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,u,v; cin >> n >> u >> v; u--; v--;
vector<vector<ll>> G(n);
rep(i,n-1){
ll a,b; cin >> a >> b;
a--; b--;
G[a].push_back(b); G[b].push_back(a);
}
queue<ll> q;
q.push(u);
vector<ll> d_u(n, 100000000);
d_u[u] = 0;
while(!q.empty()){
ll now = q.front(); q.pop();
for(ll next:G[now]){
if(d_u[next] != 100000000) continue;
d_u[next] = d_u[now] + 1;
q.push(next);
}
}
q.push(v);
vector<ll> d_v(n, 100000000);
d_v[v] = 0;;
while(!q.empty()){
ll now = q.front(); q.pop();
for(ll next:G[now]){
if(d_v[next] != 100000000) continue;
d_v[next] = d_v[now] + 1;
q.push(next);
}
}
ll ans = 0;
rep(i,n){
if(d_u[i] < d_v[i]) ans = max(ans,d_v[i]-1);
}
cout << ans;
return 0;
} | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
class SCC {
private:
int V;
int E;
vector<int> G[100001];
vector<int> rG[100001];
vector<int> vs;
bool used[100001];
int cmp[100001];
auto dfs(int v) -> void {
used[v] = true;
for (int i = 0; i < G[v].size(); ++i)
if (!used[G[v][i]])
dfs(G[v][i]);
vs.push_back(v);
}
auto rdfs(int v, int k) -> void{
used[v] = true;
cmp[v] = k;
for (int i = 0; i < rG[v].size(); i++)
if (!used[rG[v][i]])
rdfs(rG[v][i], k);
}
public:
SCC(int V, int E)
: V(V), E(E) { }
auto scc() -> int {
fill(used, used + V, false);
vs.clear();
for (int v = 0; v < V; v++) {
if (!used[v]) dfs(v);
}
fill(used, used + V, false);
int k = 0;
for (int i = vs.size() - 1; i >= 0; i--)
if (!used[vs[i]])
rdfs(vs[i], k++);
return k;
}
auto add_edge(int s, int t) {
G[s].push_back(t);
rG[t].push_back(s);
}
auto get_cmp(int a) -> int {
return cmp[a];
}
auto is_union_cmp(int a, int b) -> bool {
return cmp[a] == cmp[b];
}
};
auto main() -> signed {
int a, b;
int V, E;
cin >> V >> E;
SCC scc(V, E);
for (int i = 0; i < E; i++) {
cin >> a >> b;
scc.add_edge(a, b);
}
int k = scc.scc();
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> a >> b;
cout << scc.is_union_cmp(a, b) << endl;
}
return 0;
} | 0 |
#include<stdio.h>
int main (){
int A;
int B;
char str1[100];
int hasil;
scanf("%d %d", &A,&B);
char str[(A+B)+1];
scanf("%s", &str);
for(int i=0;i<A+B+1;i++){
if(i!=A){
if(str[i]>='0'&&str[i]<='9'){
hasil++;
}
}else if(str[i]=='-'){
hasil++;
}
}
if(hasil==A+B+1){
printf("Yes");
}else{
printf("No");
}
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int a,b;
string s;
signed main(){
ios_base::sync_with_stdio(0);
cin>>a>>b>>s;
if(s[a]!='-'){
cout<<"No";
re 0;
}
s.erase(s.begin()+a);
for(int i=0;i<a+b;i++){
if(!isdigit(s[i])){
cout<<"No";
re 0;
}
}
cout<<"Yes";
re 0;
} | 1 |
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = 5 + 1e5;
int main()
{
ll n;
string rr = "";
cin >> n;
while (n>0) {
int xx = n % 26;
n /= 26;
if (xx == 0) {
rr += "z";
n--;
}
else {
rr += (char)('a' + (xx - 1));
}
}
reverse(rr.begin(), rr.end());
cout << rr;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int e;
while ((cin >> e) && e != 0) {
int m = e;
for (int z=0; z<=100; z++) {
int zzz = z*z*z;
if (zzz > e) break;
for (int y=0; y<=100000; y++) {
int yy = y*y;
if (yy+zzz > e) break;
int x = e - (yy+zzz);
m = min(m, x+y+z);
}
}
cout << m << endl;
}
return 0;
} | 0 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) swap(&a,&b);
if(b<1) return -1;
if(a%b==0) return b;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a * b / gcd(a,b);
}
int main(){
int L,R;
std::cin>>L>>R;
if(R - L + 1 >= 2019){
std::cout<<0<<std::endl;
return 0;
}
int num = R - L + 1;
int min=2019;
for(long i=L;i<=R;i++){
for(long j=i+1;j<=R;j++){
int cal=(i * j)%2019;
if(cal < min) min = cal;
}
}
std::cout<<min<<std::endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#define LL long long
#define ull unsigned long long
#define PI acos(-1.0)
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pLL pair<LL,LL>
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define SQR(a) ((a)*(a))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))
#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))
#define vi vector <int>
#define vL vector <LL>
#define LB(a,x) (lower_bound(all(a),x)-a.begin()) // first element in the range [first,last) which does not compare less than val.
#define UB(a,x) (upper_bound(all(a),x)-a.begin()) // first element in the range [first,last) which compares greater than val.
#define prec(n) fixed << setprecision(n)
#define MEM(a,x) memset(a,x,sizeof(a))
#define SORT(v) sort(v.begin(),v.end())
#define REV(v) reverse(v.begin(),v.end())
#define Unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,b) for(int i=0;i<b;i++)
#define IT(it,x) for(it=x.begin();it!=x.end();it++)
int main()
{
LL l,r;
cin>>l>>r;
LL mn=INF;
for(LL i=l;i<=min(l+2019,r);i++)
{
for(LL j=i+1;j<=min(l+2019,r);j++)
{
LL mod=((i%2019)*(j%2019))%2019;
mn=min(mod,mn);
}
}
cout<<mn;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<tuple<int, int, int>> t(m);
vector<P> v;
for (int i = 0; i < m; ++i) {
int p, q, c;
scanf("%d %d %d", &p, &q, &c);
t[i] = make_tuple(p-1, q-1, c);
v.emplace_back(p-1, c);
v.emplace_back(q-1, c);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
auto s = v.size();
vector<vector<P>> G(s+n);
auto getidx = [&](P a){ return lower_bound(v.begin(), v.end(), a)-v.begin();};
for (auto &&i : t) {
int p, q, c;
tie(p, q, c) = i;
auto x = getidx(P(p, c)), y = getidx(P(q, c));
G[x].emplace_back(y, 0);
G[y].emplace_back(x, 0);
G[x].emplace_back(p+s, 1);
G[p+s].emplace_back(x, 1);
G[y].emplace_back(q+s, 1);
G[q+s].emplace_back(y, 1);
}
vector<int> d(s+n, INF<int>);
d[s] = 0;
deque<P> Q;
Q.emplace_front(0, s);
while (!Q.empty()){
int dist, u;
tie(dist, u) = Q.front(); Q.pop_front();
if(dist > d[u]) continue;
for (auto &&e : G[u]) {
int to, c;
tie(to, c) = e;
if(d[to] > d[u]+c){
d[to] = d[u]+c;
if(c == 0) Q.emplace_front(d[u], to);
else Q.emplace_back(d[u]+1, to);
}
}
}
cout << (d[s+n-1] == INF<int> ? -1 : d[s+n-1]/2) << "\n";
return 0;
}
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
const int N=1e5+2;
int n,inv[2],flip[2],pos[N],map[3][N];
struct B_I_T{
int tr[N];
inline void init(){
memset(tr,0,sizeof(tr));
}
inline void add(int x,int v){
for(;x<=n;x+=x&-x){
tr[x]+=v;
}
}
inline int ask(int x){
int ans=0;
for(;x;x-=x&-x){
ans+=tr[x];
}
return ans;
}
inline void mod(const int x,const int y,const int v){
if(x>y) return;
add(x,v);
add(y+1,-v);
}
}ad;
inline bool conts(const int x,const int y,const int z){
if(x<z) return y==x+1&&z==y+1;
return x==y+1&&y==z+1;
}
inline char get_c(){
static char buf[20000],*h,*t;
if(h==t){
t=(h=buf)+fread(buf,1,20000,stdin);
}
return h==t?EOF:*h++;
}
inline int nxi(){
int x=0;
char c;
while((c=getchar())>'9'||c<'0');
while(x=x*10+c-48,(c=getchar())>='0'&&c<='9');
return x;
}
int main(){
#ifndef ONLINE_JUDGE
// freopen("b.in","r",stdin);
#endif
n=nxi();
for(int i=0;i<3;++i){
for(int j=1;j<=n;++j){
map[i][j]=nxi();
}
}
for(int i=1;i<=n;++i){
int x=map[0][i],y=map[1][i],z=map[2][i],w=x>z?x:z;
if(!conts(x,y,z)||w%3){
puts("No");
return 0;
}
if((i-w/3)&1){
puts("No");
return 0;
}
if(z!=w) inv[i&1]^=1;
pos[w/3]=i;
}
for(int i=1;i<=n;i+=2){
int p=pos[i],add=ad.ask(p);
flip[1]=(flip[1]+(abs(p+add-i)>>1))&1;
ad.mod(1,p,2);
}
ad.init();
for(int i=2;i<=n;i+=2){
int p=pos[i],add=ad.ask(p);
flip[0]=(flip[0]+(abs(p+add-i)>>1))&1;
ad.mod(1,p,2);
}
if((flip[0]-inv[1])&1||(flip[1]-inv[0])&1) puts("No");
else puts("Yes");
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF=1e18;
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<endl;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b){ a = b; return 1; } return 0; }
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll ans = 0;
for (int bit = 0; bit < 60; bit++){
ll one = 0;
rep(i, n) if (a[i] & 1ll << bit) one++;
ans = ll(ans%MOD + (1ll << bit) % MOD * one%MOD * (n - one)%MOD) % MOD;
}
cout << ans << endl;
return 0;
} | //Δ_E
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1<<20;
const int MO = 1e9+7;
int n,m,a[N],b[N],s[N];
vector<int> v[N];
int cal(int o,int f=0){
int i,j,x,y;
x=1,y=0;
for(i=0;i<v[o].size();i=i+1){
j=v[o][i];
y=(y+x)%MO;
if(i+1<v[o].size())
x=(x+(LL)y*(s[v[o][i+1]]-s[j])%MO)%MO;
}
if(f)
return x;
return y;
}
int main()
{
int i,x,o;
scanf("%d",&n);
for(i=1;i<=n;i=i+1){
scanf("%d",a+i);
m^=a[i];
b[i]=b[i-1]^a[i];
s[i]=s[i-1];
if(!b[i])
s[i]++;
}
for(i=1;i<n;i=i+1)
v[b[i]].push_back(i);
if(m){
v[m].push_back(n);
cout<<cal(m,1);
return 0;
}
x=0;
for(i=1;i<N;i=i+1)
x=(x+cal(i))%MO;
o=1;
for(i=1;i<=s[n-1];i=i+1)
o=o*2%MO;
cout<<(x+o)%MO;
return 0;
} | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
using namespace std;
typedef pair<int, int> pii;
#define MAX 99999999
int main(){
int n;cin>>n;
char c; scanf("%c",&c);
rep(p,n){
string s;
getline(cin,s);
rep(i,s.length()){
int b=(int)s.find("Hoshino",i);
if(b!=-1){s.replace(b,7,"Hoshina");i+=6;}
}
cout<<s<<endl;
}
} | #include<iostream>
using namespace std;
int main(){
int n;
char c;
int f;
cin >> n;
getchar();
f = 0;
while(n){
c = getchar();
if(f == 1){
if(c == 'o')f++;
else f = 0;
}else if(f == 2){
if(c == 's')f++;
else f = 0;
}else if(f == 3){
if(c == 'h')f++;
else f = 0;
}else if(f == 4){
if(c == 'i')f++;
else f = 0;
}else if(f == 5){
if(c == 'n')f++;
else f = 0;
}else if(f == 6){
if(c == 'o'){
putchar('a');
f++;
}else f = 0;
}
if(c == 'H')f = 1;
if(c == '\n')n--;
if(f==7)f = 0;
else putchar(c);
}
} | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for(int i = 1, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
using namespace std;
#define repi(itr, ds) for(auto itr = ds.begin(); itr != ds.end(); itr++)
// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for(T &x : vec) is >> x;
return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for(int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}\n ";
return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if(sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if(false)
#define dump(...)
#endif
typedef long long int ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for(ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for(ll i = 0; i < sz_; ++i) par[i] = i;
}
// Member Function
// Find
ll root(ll x) {
while(par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if(x == y) return false;
if(siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
int main() {
int N, K, L;
cin >> N >> K >> L;
auto road = UnionFind(N);
auto railway = UnionFind(N);
REP(i, K) {
int p, q;
cin >> p >> q;
p--;
q--;
road.merge(p, q);
}
REP(i, L) {
int r, s;
cin >> r >> s;
r--;
s--;
railway.merge(r, s);
}
auto roots = map<pair<int, int>, int>();
REP(i, N) {
pair<int, int> p = {road.root(i), railway.root(i)};
roots[p]++;
}
REP(i, N) {
pair<int, int> p = {road.root(i), railway.root(i)};
int cnt = roots[p];
cout << cnt;
if(i != N - 1) {
cout << " ";
} else {
cout << endl;
}
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,n2=1,q,a[500010],lst[500010],dat[2000010],ans[500010];
vector <pii> v[500010];
void upd(int k,int val)
{
dat[k]+=val;
while(k>0)
{
k=(k-1)/2;
dat[k]+=val;
}
}
int query(int k,int lb,int ub,int tlb,int tub)
{
if(ub<tlb||tub<lb) return 0;
if(tlb<=lb&&ub<=tub) return dat[k];
return query(k*2+1,lb,(lb+ub)/2,tlb,tub)+query(k*2+2,(lb+ub)/2+1,ub,tlb,tub);
}
int main()
{
cin>>n>>q;
rep(i,n) scanf("%d",&a[i]);
int x,y;
rep(i,q)
{
scanf("%d%d",&x,&y);
x--;
y--;
v[y].pb(mpr(x,i));
}
rep(i,n+5) lst[i]=-1;
while(n2<n) n2*=2;
rep(i,n)
{
if(lst[a[i]]>-1) upd(lst[a[i]]+n2-1,-1);
upd(i+n2-1,1);
lst[a[i]]=i;
rep(j,v[i].size()) ans[v[i][j].se]=query(0,0,n2-1,v[i][j].fi,i);
}
rep(i,q) printf("%d\n",ans[i]);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int vote[101];
int N,Q,M;
int day;
int tmp;
int ans;
int i,j;
while(1){
tmp=0;
ans=0;
for(i = 0 ; i < 101 ; i++){
vote[i]=0;
}
cin >> N >> Q;
if(N == 0 && Q == 0){
break;
}
tmp=Q-1;
for(i = 0 ; i < N ; i++){
cin >> M;
for(j = 0 ; j < M ; j++){
cin >> day;
vote[day]++;
}
}
for(i = 0 ; i < 101 ; i++){
if(vote[i] > tmp){
ans = i;
tmp = vote[i];
}
}
cout << ans << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
const ll mod = 1000000007;
const ll INF = mod * mod;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
ll qp(ll a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}
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 dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,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){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T1, typename T2> pair<T1, T2> operator<(const pair<T1, T2> l, const pair<T1, T2> r) { return (l.first < r.first); }
template<typename T1, typename T2> pair<T1, T2> operator>(const pair<T1, T2> l, const pair<T1, T2> r) { return (l.first > r.first); }
void solve() {
ll N; cin>>N;
vec a(N),b(N),c(N);
ll ans=0;
for(int i=0;i<N;i++){
cin>>a[i]>>b[i];
c[i]=a[i]+b[i];
ans-=b[i];
}
sort(all(c));
for(int i=N-1;i>=0;i-=2)ans+=c[i];
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
std::cout << fixed << setprecision(10);
solve();
return 0;
}
| 0 |
#include <stdio.h>
#include <stdlib.h>
#define MAX_INPUT_SIZE 1024
int
main(int argc, char* argv[])
{
char input[MAX_INPUT_SIZE];
int n = atoi(fgets(input, sizeof(input), stdin));
int ret = n * n * n;
printf("%d\n", ret);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w, a, b;
cin >> h >> w >> a >> b;
bool refl = true;
for (int i = 0; i < h; i++) {
int p = 0, q = 1;
if (!refl) swap(p, q);
for (int j = 0; j < w; j++) {
if (j < a) cout << p;
else cout << q;
}
cout << endl;
if (i == b-1) refl = !refl;
}
}
| 0 |
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#include <x86intrin.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
//#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const ll inf = (ll)1e18 + 1;
const double pi = acos (-1.0);
const double eps = 1e-7;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ll a[N], res, sum;
bool used[N];
inline void boost () {
ios_base :: sync_with_stdio (NULL);
cin.tie (NULL), cout.tie (NULL);
}
inline void Solve () {
cin >> n;
for (int i = 1; i <= n; i ++) cin >> a[i], sum ^= a[i];
for (int bit = 60; bit >= 0; bit --) {
if (!(sum & (1ll << bit))) continue;
for (int i = 1; i <= n; i ++)
if (a[i] & (1ll << bit))
a[i] -= (1ll << bit);
}
for (int bit = 60; bit >= 0; bit --) {
int pos = -1;
for (int i = 1; i <= n; i ++) {
if (used[i]) continue;
if (a[i] & (1ll << bit)) {
pos = i;
}
}
if (pos != -1) {
used[pos] = 1;
for (int i = 1; i <= n; i ++)
if (i != pos && (a[i] & (1ll << bit)))
a[i] ^= a[pos];
}
}
for (int i = 1; i <= n; i ++) res ^= a[i];
cout << res + (sum ^ res);
}
main () {
// freopen (".in", "r", stdin);
// freopen (".out", "w", stdout);
boost ();
int tt = 1;
//cin >> tt;
while (tt --) {
Solve ();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<long long> a(n), base;
for(auto & e : a) cin >> e;
long long all = 0;
for(auto & e : a) all ^= e;
for(auto & e : a) e &= ~all;
for(auto e : a){
for(auto b : base) e = min(e, e ^ b);
if(e){
base.push_back(e);
}
}
sort(base.rbegin(), base.rend());
long long up = 0;
for(auto b : base) up = max(up, up ^ b);
cout << all + 2 * up << endl;
return 0;
} | 1 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
const long long INF2 = (((ll)1<<31)-1);
int main(int argc, char* argv[])
{
int n,q;
scanf("%d%d", &n, &q);
vector<pair<int, pair<int, pair<int,int> > > > z(q); // type, s, t, x;
int i;
int cnt=0;
for(i=0; i<q; i++) {
int type, s, t, x;
scanf("%d", &type);
if(type==0) {
scanf("%d%d%d", &s, &t, &x);
z[i]=make_pair(type, make_pair(s, make_pair(t,x)));
}
else {
scanf("%d", &s);
z[i]=make_pair(type, make_pair(s, make_pair(0,0)));
cnt++;
}
}
int ansnum=cnt;
set<pair<int,int> > zz; // val, ansid
vector<int> ans(ansnum, INF2);
cnt=ansnum-1;
for(i=q-1; i>=0; i--) {
if(z[i].first==0) {
int s=z[i].second.first;
int t=z[i].second.second.first;
int x=z[i].second.second.second;
auto it=zz.lower_bound(make_pair(s,-INF));
auto itend=zz.lower_bound(make_pair(t+1,-INF));
while(it!=itend) {
ans[it->second]=x;
auto itnext=it; itnext++;
zz.erase(*it);
it=itnext;
}
}
else {
zz.insert(make_pair(z[i].second.first, cnt));
cnt--;
}
}
for(i=0; i<ansnum; i++) {
printf("%d\n", ans[i]);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//using Graph = vector<vector<edge>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
//#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<": "
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll)
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
//typedef long long T;
ll ceil(ll a,ll b){
return ((a+b-1)/b);
}
const int INF = 1000000000;
const ll INF64 = 9223372036854775807ll;
const ll MOD = 1000000007ll;
const dou pi=3.141592653589793;
//mapは、if関数などで覗いただけで構成されるので注意しよう！
//std::vector<vector<int>> g;
//std::vector<std::set<int>> g;
std::vector<int> c;//トポロジカルソート
std::set<int> al;
void topological(int p,std::vector<std::vector<int>> &g,std::vector<int> &ans){
ans.pb(p);
al.erase(p);
erep(i,g[p]){
c[i]--;
if(c[i]==0){
topological(i,g,ans);
}
}
//return;
}
std::vector<int> topo(std::vector<std::vector<int>> &g){
std::vector<int> ans;
rep(i,g.size())al.insert(i);
c.resize(g.size());
rep(i,g.size()){
erep(j,g[i]){
c[j]++;
}
}
rep(i,g.size()){
if(c[i]==0&&al.find(i)!=al.end()){
topological(i,g,ans);
}
}
return ans;
}
int main(){
itn n,m;
std::cin >> n>>m;
std::vector<std::vector<int> >g(n) ;
rep(i,n+m-1){
itn a,b;
std::cin >> a>>b;
a--;b--;
g[a].pb(b);
}
std::vector<int> dum=topo(g);
std::vector<int> ans(n,-1);
erep(i,dum){
erep(j,g[i])ans[j]=i;
}
erep(i,ans){
std::cout << i+1 << std::endl;
}
}
| 0 |
#include <algorithm>
#include <cstdio>
const int N=2005;
int l[N][N],r[N][N];
bool a[N][N];
char s[N];
int main(){
int h,w;
scanf("%d%d\n",&h,&w);
for (int i=0;i<h;i++){
scanf("%s",s);
for (int j=0;j<w;j++) a[i][j]=(s[j]=='#');
}
for (int i=h-1;i;i--){
for (int j=0;j<w;j++) a[i][j]^=a[i-1][j];
for (int j=w-1;j;j--) a[i][j]^=a[i][j-1];
a[i][0]=a[i][w]=1;
for (int j=0;j<w;j++)
if (a[i][j]) l[i][j]=j;else l[i][j]=l[i][j-1];
for (int j=w;j;j--)
if (a[i][j]) r[i][j]=j;else r[i][j]=r[i][j+1];
}
int ans=std::max(h,w);
for (int j=1;j<w;j++)
for (int i=1,k=0,L=0,R=w;i<h;i++)
if (a[i][j]) k=i,L=0,R=w;
else{
L=std::max(L,l[i][j]);
R=std::min(R,r[i][j]);
ans=std::max(ans,(R-L)*(i-k+1));
}
printf("%d\n",ans);
} | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=2200;
int a[N][N],n,m,d[N][N],h[N][N],ans,stack[N][2],top,tt;
char ch;
int main(){
// freopen("1.in","r",stdin);
scanf("%d%d\n",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
scanf("%c",&ch);
if(ch=='#')a[i][j]=1;
else a[i][j]=0;
}scanf("\n");
} ans=max(n,m);n=n-1;m=m-1;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
d[i][j]=1-((a[i][j]+a[i+1][j]+a[i][j+1]+a[i+1][j+1])%2);
}
}
for(int i=1;i<=n;i++){
for(int j=m;j>=1;j--){
if(d[i][j]==1)h[i][j]=h[i][j+1]+1;
else h[i][j]=0;
}
}
// for(int i=1;i<=n;i++){
// for(int j=1;j<=m;j++)printf("%d ",d[i][j]);
// printf("\n");
// }printf("\n\n");
// for(int i=1;i<=n;i++){
// for(int j=1;j<=m;j++)printf("%d ",h[i][j]);
// printf("\n");
// }
for(int j=1;j<=m;j++){
top=0;memset(stack,0,sizeof stack);
for(int i=1;i<=n+1;i++){
tt=1;
while(top>0&&stack[top][0]>=h[i][j]){
tt+=stack[top][1];
ans=max(ans,(stack[top][0]+1)*(tt));
--top;
}
++top;
stack[top][0]=h[i][j];
stack[top][1]=tt;
}
}
printf("%d",ans);
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i,n) for(ll i=0; i<n; ++i)
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n,cnt=0;cin>>n;
lvector ans;
bool is_prime;
for(ll i=2;i<=55555;i++) {
if(i%5!=1) continue;
is_prime=true;
for(ll div=2;div*div<=i;++div)
if(i%div==0) {is_prime=false;break;}
if(is_prime) {ans.emplace_back(i);cnt++;}
if(cnt==n) break;
}
rep(i,n-1) cout<<ans[i]<<' ';print(ans[n-1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
struct Sieve {
ll n;
vi f;
vi primes;
// constructor
Sieve(ll n=1) : n(n), f(n+1,0) {
f.at(0) = -1;
f.at(1) = -1;
for(ll i = 2; i <= n; ++i){
if (f.at(i)!=0) continue;
primes.push_back(i);
f.at(i) = i;
for (ll j = i*i; j <= n; j += i) {
if(f.at(j)==0) f.at(j) = i;
}
}
}
// xが素数かを判定
bool isPrime(ll x) {
return f.at(x) == x;
}
// xを素因数分解する関数(分解後の値を昇順の配列にして返す)
// (100) => ([2,1,5,5]);
vi primeFactorizedList(ll x) {
vi res;
while (x != 1) {
res.push_back(f.at(x));
x /= f.at(x);
}
return res;
}
// 素因数分解したときの各因数の個数をsecondに持つpairにする
vector<P> primeFactorizedPair(ll x) {
vi fl = primeFactorizedList(x);
if (fl.size() == 0) return {};
vector<P> res(1, P(fl.at(0), 0));
for (ll p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
int main() {
// fasten cin
cin.tie(0);
ios::sync_with_stdio(false);
// implement
ll n;
cin >> n;
Sieve s = Sieve(55556);
vi cand;
for(ll p:s.primes){
string str = to_string(p);
if((str.at(str.size()-1)-'0')==1){
cand.push_back(p);
}
if(cand.size()>55) break;
}
rep(i,n) cout << cand.at(i) << " ";
cout << endl;
} | 1 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//vector<vector<int> > dp;
//vector<vector<vector<int> > > vvvi;
//dp=vector<vector<int> >(N, vector<int>(M,0));
//vector<pair<int,int> > v;
//v.push_back(make_pair(x,y));
//priority_queue<int,vector<int>, greater<int> > q2;
const int MAX_N=10000;
vector<VI> g1(MAX_N);
vector<VI> g2(MAX_N);
VI flag(MAX_N);
int fcnt = 0;
int gcnt = 0;
vector<bool>vis(MAX_N, false);
VI group(MAX_N);
void dfs(int v) {
vis[v] = true;
for (int w : g1[v]) {
if (!vis[w])dfs(w);
}
flag[fcnt] = v;
//cout << fcnt << " " << v << endl;
fcnt++;
}
void rdfs(int v) {
vis[v] = false;
group[v] = gcnt;
//cout << v << " " << gcnt << endl;
for (int w : g2[v]) {
if (vis[w])rdfs(w);
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
REP(i, M) {
int a, b;
cin >> a >> b;
g1[a].push_back(b);
g2[b].push_back(a);
}
REP(i, N) {
if (!vis[i])dfs(i);
}
//REP(i, N)cout << flag[i] << endl;
for (int i = N - 1; i >= 0; i--) {
if (vis[flag[i]]) {
//cout << i << endl;
rdfs(flag[i]);
gcnt++;
}
}
//REP(i, N)cout << group[i] << endl;
int Q;
cin >> Q;
REP(i, Q) {
int a, b;
cin >> a >> b;
cout << (group[a] == group[b]) << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
ll n;cin >> n;
vl a(n);rep(i,n)cin >> a[i];
ll l;cin >> l;
vvl v(21,vl(n));
rep(i,n){
auto itr=upper_bound(all(a),a[i]+l);
itr--;
v[0][i]=itr-a.begin();
if(i==n-1)v[0][i]=inf;
}
rep(j,20){
rep(i,n){
if(v[j][i]==inf)v[j+1][i]=inf;
else v[j+1][i]=v[j][v[j][i]];
}
}
/*rep(j,20){
rep(i,n){
cout << v[j][i] <<" ";
}
cout << endl;
}*/
//exit(0);
ll q;cin >> q;
while(q--){
ll a,b;cin >> a >> b;a--;b--;
if(a>b)swap(a,b);
ll ng=0,ok=100000;
while(abs(ok-ng)>1){
ll mid=(ok+ng)/2;
ll t=a;
rep(i,20){
if(t==inf)break;
if(mid&(1<<i)){
t=v[i][t];
}
}
if(t>=b)ok=mid;
else ng=mid;
}
cout << ok <<endl;
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int N,arr[200200],mod = 1e9 + 7;
long long prefix[200200],sum;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>N;
for(int i = 1;i <= N;i++){
cin>>arr[i];
prefix[i] = prefix[i - 1] + arr[i];
}
for(int i = 2;i <= N;i++){
sum += (prefix[i - 1] % mod) * (arr[i] % mod);
sum %= mod;
}
cout<<sum<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
class Combination {
/*
:)
*/
public :
const int mod = 1e9 + 7;
ll add(ll x, ll y) {
x += y;
if (x >= mod) return x - mod;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0) return x + mod;
return x;
}
ll mult(ll x, ll y) {
return (x * y) % mod;
}
ll bin_pow(ll x, ll p) {
if (p == 0) return 1;
if (p & 1) return mult(x, bin_pow(x, p - 1));
return bin_pow(mult(x, x), p / 2);
}
ll rev(ll x) {
return bin_pow(x, mod - 2);
}
ll fact(ll a) {
ll S = 1;
for (ll I = 1 ; I <= a; I++)S = S * I % mod;
return S;
}
ll Combin(ll x, ll y) {
return mult(fact(x), rev(mult(fact(sub(x, y)), fact(y))));
}
};
int main () {
ios_base::sync_with_stdio(false), cin.tie(0);
Combination cm;
ll ans = 0;
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >> x;
ll araysum = 0;
for (int i = 0 ; i < n; i++) araysum = cm.add(araysum, a[i]);
ll S = cm.mult(araysum, araysum);
ll Si = 0;
for (int i = 0 ; i < n; i++) {
Si = cm.add(Si, cm.mult(a[i], a[i]));
}
ans = cm.mult(cm.sub(S, Si), cm.rev(2));
cout << ans ;
} | 1 |
#include<stdio.h>
#include<string.h>
int main(){
char A[11], B[11], C[11];
scanf("%s %s %s", A, B, C);
if (A[strlen(A) - 1] == B [0] && B[strlen(B) - 1] == C [0]){
printf ("YES\n");
}
else {
printf ("NO\n");
}
return 0;
} | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <utility>
#include <numeric>
#include <iterator>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s) cout << fixed << setprecision(10) << s << endl;
int main()
{
vector<string> a(3);
string res = "YES";
for (ll i = 0; i < 3; i++)
{
cin >> a[i];
if (i > 0)
{
if (a[i - 1].back() != a[i].front())
{
res = "NO";
}
}
}
println(res);
}
| 1 |
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
const int N = 1003;
int n, cnt = 0, d;
char a[N][N];
char get(int d)
{
return (char)(d % 26 + 'a');
}
void addHor(int y, int x)
{
a[y][x] = get(d);
a[y][x + 1] = get(d);
d++;
}
void addVer(int y, int x)
{
a[y][x] = get(d);
a[y + 1][x] = get(d);
d++;
}
void add7(int y, int x)
{
addVer(y, x);
addHor(y, x + 1);
addHor(y, x + 3);
addHor(y + 1, x + 2);
addHor(y + 1, x + 5);
addVer(y + 2, x + 2);
addVer(y + 2, x + 4);
addHor(y + 2, x + 5);
addVer(y + 3,x);
addVer(y + 4, x + 1);
addVer(y + 4, x + 6);
addVer(y + 5, x + 3);
addHor(y + 6, x);
addHor(y + 6, x+4);
}
void add6(int y, int x)
{
addHor(y, x);
addVer(y, x + 2);
addHor(y+2, x+1);
addVer(y+1, x);
addVer(y+3, x);
addHor(y+3 + 2, x + 1);
addVer(y, x + 3);
addHor(y + 2, x + 3 + 1);
addHor(y + 3, x+3);
addVer(y + 3, x +3+ 2);
addHor(y + 3 + 2, x+3 + 1);
addVer(y + 3 + 1, x+3);
}
void add5(int y, int x)
{
addHor(y, x);
addHor(y, x + 2);
addHor(y + 4, x + 1);
addHor(y + 4, x + 3);
addVer(y + 1, x);
addVer(y + 3, x);
addVer(y, x+4);
addVer(y + 2, x+4);
addVer(y+1,x+1);
addHor(y + 3, x + 2);
}
void add3(int y, int x)
{
addHor(y,x);
addVer(y+1, x);
addVer(y, x+2);
addHor(y+2, x+1);
}
void solve(int l, int r)
{
if (r - l + 1 <= 2)
return;
if ((r - l + 1) == 7)
{
add7(l, l);
return;
}
if ((r - l + 1) == 6)
{
add6(l, l);
return;
}
if ((r - l + 1) == 5)
{
add5(l,l);
return;
}
if ((r - l + 1) == 3)
{
add3(l, l);
return;
}
if ((r - l + 1) == 6)
{
add6(l, l);
return;
}
a[l][l] = get(d);
a[l][l + 1] = get(d);
d++;
a[l][r] = get(d);
a[l + 1][r] = get(d);
d++;
a[r][r] = get(d);
a[r][r - 1] = get(d);
d++;
a[r][l] = get(d);
a[r - 1][l] = get(d);
d++;
a[l + 1][l] = get(d);
a[l + 1][l + 1] = get(d);
d++;
a[l][r - 1] = get(d);
a[l + 1][r - 1] = get(d);
d++;
a[r - 1][r] = get(d);
a[r - 1][r - 1] = get(d);
d++;
a[r][l + 1] = get(d);
a[r - 1][l + 1] = get(d);
d++;
l += 2;
r -= 2;
solve(l, r);
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
a[i][j] = '.';
if (n > 2)
solve(1, n);
else
{
cout << -1 << endl;
return 0;
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
cout << a[i][j];
cout << endl;
}
return 0;
}
/*
100 20 81
*/ | #include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<time.h>
#include<cstdlib>
typedef long long ll;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define mm(a) memset(a,0,sizeof(a))
#define lr rt<<1
#define rr rt<<1|1
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0);
#define inf 0x3f3f3f3f
#define eqs 1e-8
#define lb(x) (x&(-x))
#define ch(a) (int(a-'a')+1)
#define rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef pair<int,int> pii;
const double pi=acos(-1);
const int maxn=1100;
const ll Mod=1000000007;
char ans3[12][12] = {"aa.",
"..a",
"..a"};
char ans4[12][12] = {"aacd",
"bbcd",
"dcaa",
"dcbb"};
char ans5[12][12] = {"aabc.",
"..bcd",
"iij.d",
"n.jaa",
"nkkbb"};
char ans7[12][12] = {"aade...",
"bbde...",
"ccffg..",
"..i.gee",
"..ihhdd",
"....cba",
"....cba"};
int n;
char a[maxn][maxn];
void add(int st,int len,char (*T)[12])
{
int x,y;
for(int i=0;i<len;i++)
{
for(int j=0;j<len;j++)
{
x=st+i;
y=st+j;
a[x][y]=T[i][j];
}
}
}
int main()
{
sync;
cin>>n;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
a[i][j]='.';
}
if(n<=2)
{
cout<<-1<<endl;
return 0;
}
if(n==3)
add(0,3,ans3);
else if(n==4)
add(0,4,ans4);
else if(n==5)
add(0,5,ans5);
else if(n==7)
add(0,7,ans7);
else if(n==11)
{
add(0,4,ans4);
add(4,7,ans7);
}
else if(n%3==0)
{
for(int i=0;i<=n;i+=3)
add(i,3,ans3);
}
else
{
if(n%5==0)
{
for(int i=0;i<=n;i+=5)
add(i,5,ans5);
}
else if(n%5==1)
{
add(0,4,ans4);
add(4,7,ans7);
for(int i=11;i<=n;i+=5)
add(i,5,ans5);
}
else if(n%5==2)
{
add(0,7,ans7);
for(int i=7;i<=n;i+=5)
add(i,5,ans5);
}
else if(n%5==3)
{
add(0,4,ans4);
add(4,4,ans4);
for(int i=8;i<=n;i+=5)
add(i,5,ans5);
}
else if(n%5==4)
{
add(0,4,ans4);
for(int i=4;i<=n;i+=5)
add(i,5,ans5);
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cout<<a[i][j];
cout<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define mkp make_pair
#define fi first
#define se second
void read(int &x){
char ch=getchar();x=0;
for (;ch==' '||ch=='\n';ch=getchar());
for (;ch!=' '&&ch!='\n';x=x*10+ch-'0',ch=getchar());
}
void write(int x){
if (x>9) write(x/10);
putchar(x%10+'0');
}
int n,m,cnt;
vector<pii>G[100004];
vector<int>mycol[100004];
vector<pii>g[500004];
int dist[500004];
bool vis[500004];
map<pii,int>mp;
int main(){
read(n),read(m);
for (int i=0;i<m;i++){
int a,b,c;read(a),read(b),read(c);
G[a].push_back(mkp(b,c));
G[b].push_back(mkp(a,c));
}
for (int i=1;i<=n;i++)
for (int j=0;j<G[i].size();j++)
if (mp.find(mkp(i,G[i][j].se))==mp.end())
mp[mkp(i,G[i][j].se)]=++cnt,mycol[i].push_back(cnt);
for (int i=1;i<=n;i++){
for (int j=0;j<G[i].size();j++)
g[mp[mkp(i,G[i][j].se)]].push_back(mkp(mp[mkp(G[i][j].fi,G[i][j].se)],0));
for (int j=0;j<mycol[i].size();j++) g[mycol[i][j]].push_back(mkp(cnt+i,0)),g[cnt+i].push_back(mkp(mycol[i][j],1));
}
for (int i=1;i<=cnt+n;i++)dist[i]=1e8;
deque<int>dq;dist[1+cnt]=0,dq.push_back(1+cnt);
while (!dq.empty()){
int x=dq.front();dq.pop_front();
if (vis[x]) continue;vis[x]=1;
for (int i=0;i<g[x].size();i++) if (dist[g[x][i].fi]>dist[x]+g[x][i].se){
dist[g[x][i].fi]=dist[x]+g[x][i].se;
if (g[x][i].se==0) dq.push_front(g[x][i].fi);
else dq.push_back(g[x][i].fi);
}
}
if (dist[cnt+n]==1e8) puts("-1");
else write(dist[cnt+n]);
} | #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, k; cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for(int i=0; i<=k; i++) { // push
int j = k-i; // pop
if(j >= n) {
priority_queue<ll, vector<ll>, greater<ll>> q;
rep(l, n) q.push(v[l]);
rep(l, i) {
if(q.empty()) break;
if(q.top() >= 0) break;
q.pop();
}
ll tmp = 0;
while(!q.empty()) {
tmp += q.top();
q.pop();
}
chmax(ans, tmp);
} else {
for(int l=0; l<=j; l++) {
priority_queue<ll, vector<ll>, greater<ll>> q;
rep(m, l) q.push(v[m]);
rep(m, j-l) q.push(v[n-1-m]);
rep(m, i) {
if(q.empty()) break;
if(q.top() >= 0) break;
q.pop();
}
ll tmp = 0;
while(!q.empty()) {
tmp += q.top();
q.pop();
}
chmax(ans, tmp);
}
}
}
cout << ans << endk;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define ll long long int
#define w(x) int x; cin>>x; while(x--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll a,b;
cin>>a>>b;
ll c=1,d=0;
while(c<b){
c=c+a-1;
d++;
}
cout<<d;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll A,B;
cin >>A>>B;
if(A<=8 && B<=8){
cout<<"Yay!"<<endl;
}else{
cout<<":("<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
typedef long long ll;
using namespace std;
int main() {
int n;
double avg = 0, count = 0;
cin >> n;
std::vector<int> v(n), x(n), y(n);
REP(i,n){
v.at(i) = i;
cin >> x.at(i) >> y.at(i);
}
do {
REP(i,n-1){
avg += sqrt(pow(x[v[i]]-x[v[i+1]],2) + pow(y[v[i]]-y[v[i+1]],2));
}
count += 1;
} while (std::next_permutation(v.begin(), v.end()));
cout << fixed << setprecision(10) << avg / count;
return 0;
}
| #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n;
cin >> n;
vector<ll> x(n);
vector<ll> y(n);
rep(i, n) cin >> x[i] >> y[i];
double sum = 0;
rep(i, n) for (ll j = i + 1; j < n; j++)
{
sum += sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));
}
double ans = 2 * sum / n;
cout << fixed << setprecision(8) << ans << "\n";
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cmath>
#include<string>
#include<fstream>
using namespace std;
//const int N = 1e3 + 5;
int main(){
int n,d=0,t=0,count=0;
cin >> n;
if (0 <= n&&n <= 2){
cout << 0 << endl;
return 0;
}
while (n)
{
n -=3;
if (n >= 3)
count++;
else{
count++;
break;
}
}
cout << count << endl;
} | #include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
n=n/3;
printf("%d\n",n);
} | 1 |
#include <bits/stdc++.h>
using Int = int64_t;
using UInt = uint64_t;
using C = std::complex<double>;
#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)
#define guard(x) if( not (x) ) continue;
struct DisjointSet {
DisjointSet(Int n)
: ps(n, -1), ns(n, 1) {}
std::vector<Int> ps, ns;
Int find(Int x) {
while( ps[x] != -1 ) x = ps[x];
return x;
}
void unite(Int x, Int y) {
x = find(x), y = find(y);
if( x != y ) {
if( not ( ns[x] <= ns[y] ) ) std::swap(x, y);
ps[x] = y;
ns[y] += ns[x];
}
}
};
int main() {
Int v, e;
std::cin >> v >> e;
std::vector<Int> ss(e), ts(e), ws(e);
rep(i, e) std::cin >> ss[i] >> ts[i] >> ws[i];
std::vector<std::pair<Int, Int>> xs;
rep(i, e) xs.emplace_back(ws[i], i);
std::sort(xs.begin(), xs.end());
DisjointSet z(v);
Int res = 0;
rep(i, e) {
Int k = xs[i].second;
Int s = ss[k], t = ts[k];
guard( z.find(s) != z.find(t) );
z.unite(s, t);
res += ws[k];
}
printf("%ld\n", res);
} | #include "bits/stdc++.h"
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<vector<int>>edge(N,vector<int>(N));
for(int i=0;i<M;i++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
edge[a][b]=c;
edge[b][a]=c;
}
vector<int>box(1<<N);
for(int i=0;i<1<<N;i++){
for(int j=0;j<N;j++){
if((i>>j)&1){
for(int k=j+1;k<N;k++){
if((i>>k)&1)box[i]+=edge[j][k];
}
}
}
}
vector<vector<int>>dp(1<<N,vector<int>(N,-1e9));
for(int i=1;i<1<<N;i+=2)dp[i][0]=box[i];
for(int i=1;i<1<<N;i+=2){
for(int j=0;j<N;j++){
if(!((i>>j)&1))continue;
int bag=(1<<N)-1-i;
int c=bag;
while(c>0){
for(int k=1;k<N;k++){
if(!edge[j][k])continue;
if((c>>k)&1) dp[i|c][k]=max(dp[i|c][k],dp[i][j]+edge[j][k]+box[c]);
}
c--;
c&=bag;
}
}
}
int ans=0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++)ans+=edge[i][j];
}
cout<<ans-dp.back().back()<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
deque<int> jewel;
for (int i = 0; i < N; i++) {
int num;
cin >> num;
jewel.push_back(num);
}
int ans = -1;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= min(N, K)-i; j++) {
deque<int> jewel_copy = jewel;
vector<int> tmp;
for (int a = 0; a < i; a++) {
tmp.push_back(jewel_copy.front());
jewel_copy.pop_front();
}
for (int b = 0; b < j; b++) {
tmp.push_back(jewel_copy.back());
jewel_copy.pop_back();
}
sort(tmp.begin(), tmp.end());
int value = 0, trash = K - i - j;
for (auto x : tmp) {
if (trash > 0 && x < 0) {
trash--;
continue;
}
value += x;
}
if (value > ans) ans = value;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#define eps (1e-8)
#define INF (1e18)
#define FASTER ios_base::sync_with_stdio(0);cin.tie(0)
template<class A,class B>ostream&operator<<(ostream&out,const pair<A,B>&a){return out<<"("<<a.first<<","<<a.second<<")";}
template<class A>ostream&operator<<(ostream&out,const vector<A>&a){for(const A &it:a)out<<it<<" ";return out;}
template<class A,class B>istream&operator>>(istream&in,pair<A,B>&a){return in>>a.first>>a.second;}
template<class A>istream&operator>>(istream&in,vector<A>&a){for(A &i:a)in>>i;return in;}
//ifstream cinn("in.in");ofstream coutt("out.out");
int poww(const int &a,int b,const int &m=MOD){if(b==0)return 1;int x=poww(a,b/2,m);x=x*x%m;if(b&1)x=x*a%m;return x;}
int ceil(const int &a,const int &b){return (a+b-1)/b;}
////Read:
//Check corner cases, n==1;
//
////Some function:
//__builtin_popcountll(),
int n,c,dp[55][55][55][55];
vi v;
int f(int i,int cnt,int mxgap,int lst){
if(i==n){
mxgap=max(mxgap,i-lst-1);
if(cnt+(n-cnt-mxgap)*2<=c)return 0;
return -INF;
}
int &ans=dp[i][cnt][mxgap][lst+1];
if(ans!=-INF)return ans;
ans=v[i]+f(i+1,cnt+1,max(mxgap,i-lst-1),i);
ans=max(ans,f(i+1,cnt,mxgap,lst));
return ans;
}
signed main(){
FASTER;
cin>>n>>c;
v=vi(n);cin>>v;
for(int i=0;i<55;i++){
for(int j=0;j<55;j++){
for(int k=0;k<55;k++){
for(int l=0;l<55;l++){
dp[i][j][k][l]=-INF;
}
}
}
}
cout<<f(0,0,0,-1);
}
| 1 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define Rep(i,n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all(vec));
#define cend printf("\n");
#define prique(T) priority_queue<T, vector<T>, greater<T>>
#define prique2(T) priority_queue<T>
struct edge { int to, cost; };
using P = pair<int, int>;
using PP = pair<P, int>;
using D = pair<double, double>;
const int mod2 = 998244353;
const int mod = (int)1e9 + 7, inf = (int)1e16;
const string sp = " ";
int modpow(int x, int n) {
int ans = 1;
while (n > 0) {
if (n & 1) {
ans *= x;
if (mod <= ans) ans %= mod;
}
x *= x;
if (mod <= x) x %= mod;
n >>= 1;
}
return ans;
}
int fact[1000000];
void f_init(int n) {
if (1000000 <= n) return;
fact[0] = fact[1] = 1;
for (int i = 2; i <= n; ++i) {
fact[i] *= fact[i - 1];
if (mod <= fact[i]) fact[i] %= mod;
}
return;
}
int comb(int n, int r) {
if (n < r) return 0;
int ans = fact[n] * modpow(fact[n - r], mod - 2) % mod * modpow(fact[r], mod - 2);
if (ans < 0) return ans + mod;
return ans;
}
int perm(int n, int r) {
if (n < r) return 0;
if (n - r < r) r = n - r;
int ans= fact[n] * modpow(fact[n - r], mod - 2) % mod;
if (ans < 0) return ans + mod;
return ans;
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
bool pri(int p) {
for (int i = 2; i * i <= p; ++i) if (p % i == 0) return false;
return p > 1;
}
map<int, int>factring(int n) {
map<int, int>ans;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
++ans[i];
}
}
if (n != 1) ++ans[n];
return ans;
}
P operator+(const P& a, const P& b) {
return P(a.first + b.first, a.second + b.second);
}
P operator-(const P& a, const P& b) {
return P(a.first - b.first, a.second - b.second);
}
class unionfind {
private:
int par[200010], rankth[200010], sizeth[200020];
public:
void init(int n) {
rep(i, n) {
par[i] = i;
rankth[i] = 0;
sizeth[i] = 1;
}
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return;
if (rankth[x] < rankth[y]) {
par[x] = y;
sizeth[y] += sizeth[x];
}
else {
par[y] = x;
if (rankth[x] == rankth[y]) rankth[x]++;
sizeth[x] += sizeth[y];
}
}
};
int n;
P x[100000],y[100000];
prique(PP) que;
int ans;
signed main() {
cin>>n;
for(int i=0;i<n;i++){
cin>>x[i].first>>y[i].first;
x[i].second=i;
y[i].second=i;
}
sort(x,x+n);
sort(y,y+n);
for(int i=1;i<n;i++){
que.push({{x[i].first-x[i-1].first,x[i-1].second},x[i].second});
que.push({{y[i].first-y[i-1].first,y[i-1].second},y[i].second});
}
unionfind UF;
UF.init(n);
while((int)que.size()){
PP p=que.top();que.pop();
if(!UF.same(p.first.second,p.second)){
ans+=p.first.first;
UF.unite(p.first.second,p.second);
}
}
cout<<ans<<endl;
}
| #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
typedef pair<int, int>P;
const int MOD = 1e9 + 7;
//const int MOD = 998244353;
const int INF = 1e10;
const long double PI = (acos(-1));
signed main() {
int N;
cin >> N;
vector<int>A(N), B(N);
rep(i, N)cin >> A[i] >> B[i];
priority_queue<P>q;
rep(i, N) {
P p = { A[i] + B[i] ,i };
q.push(p);
}
int ans = 0;
rep(i, N) {
P p = q.top();
q.pop();
if (i % 2 == 0)ans += A[p.second];
else ans -= B[p.second];
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
string S;
int K;
int dp[300][300][300];
int rec(int left, int right, int rest) {
if(left >= right) return left == right;
if(~dp[left][right][rest]) return dp[left][right][rest];
int ret = max(rec(left + 1, right, rest), rec(left, right - 1, rest));
if(rest > 0) ret = max(ret, rec(left + 1, right - 1, rest - 1) + 2);
if(S[left] == S[right]) ret = max(ret, rec(left + 1, right - 1, rest) + 2);
return dp[left][right][rest] = ret;
}
int main() {
cin >> S >> K;
memset(dp, -1, sizeof(dp));
cout << rec(0, S.size() - 1, K) << endl;
} | // luogu-judger-enable-o2
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
#define R register
using namespace std;
char s[351];int len,k;
int f[351][351][351],ans;
inline void read(R int &x)
{
x=0;R int f=1;
R char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>=48&&c<=57)
{
x=(x<<1)+(x<<3)+(c^48);
c=getchar();
}
x=x*f;
}
inline void input_data()
{
char ch=getchar();
while(ch>='a'&&ch<='z')
s[++len]=ch,ch=getchar();
read(k);return;
}
int dfs(R int k,R int l,R int r)
{
if(l>r) return false;
if(l==r) return s[l]==s[r];
if(f[k][l][r]) return f[k][l][r];
f[k][l][r]=max(dfs(k,l+1,r),dfs(k,l,r-1));
if(s[l]==s[r]) f[k][l][r]=max(f[k][l][r],dfs(k,l+1,r-1)+2);
if(k>=1) f[k][l][r]=max(f[k][l][r],dfs(k-1,l+1,r-1)+2);
return f[k][l][r];
}
int main()
{
input_data();
for(R int i=0;i<=k;++i)
ans=max(ans,dfs(i,1,len));
printf("%d\n",ans);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,A,B,counter=0;
cin>>N>>A>>B;
long long a[100000];
for(int j=0; j<N;j++){
cin>>a[j];}
for(int j=0; j<N-1;j++){
if((a[j+1]-a[j])*A<=B){
counter+=A*(a[j+1]-a[j]);}
else
counter+=B;
}
cout<<counter<<endl;}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
int a[n+1];
a[0] = 0;
for(int i=1; i<=n; i++) cin >> a[i];
int s = 0;
for(int i=0; i<n; i++){
s += abs(a[i+1]-a[i]);
}
s += abs(a[0]-a[n]);
int de[n];
for(int i=0; i<n-1; i++){
de[i] = abs(a[i+2]-a[i]) - abs(a[i+1]-a[i]) -abs(a[i+2]-a[i+1]);
}
de[n-1] = abs(a[0]-a[n-1]) -abs(a[n] - a[n-1]) - abs(a[n]-a[0]);
for(int i=0; i<n; i++){
cout << s+de[i] << endl;
}
return 0;
}
| 0 |
#include <iostream>
using namespace std;
const int MOD = 1000000007;
int dv[1000];
int sqrt(int x) {
int l = 1, r = x;
while (l + 1 < r) {
int m = (l + r) / 2;
(m * m <= x ? l : r) = m;
}
return l;
}
void memoDivisor(int n) {
while (n > 1) {
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
dv[i]++;
n /= i;
break;
}
}
}
}
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; ++i) memoDivisor(i);
long long cnt = 1;
for (int i = 2; i <= N; ++i) {
cnt = cnt * (dv[i] + 1) % MOD;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int p[168], q[168], mod = 1000000007;
int primecheck(int n) {
int d = 0;
for (int i = 1; i <= sqrt(n); i++)
{
if (n % i == 0) d++;
if (d == 2) break;
}
if (d > 1) return 0;
else return 1;
}
int main() {
int k = 0, n, l;
long long f = 1;
for (int i = 0; i < 168; i++) q[i] = 0;
for (int i = 2; i <= 997; i++)
{
if (primecheck(i) == 1)
{
p[k] = i;
k++;
}
}
cin >> n;
for (int i = 2; i <= n; i++)
{
k = 0, l = i;
while (l != 1)
{
if (l % p[k] == 0)
{
l /= p[k];
q[k]++;
}
else k++;
}
}
for (int i = 0; i < 168; i++)
{
f *= (q[i] + 1);
f %= mod;
}
cout << f;
} | 1 |
#include <stdio.h>
int main (){
char name1[105];
char name2[105];
scanf("%s%s",&name1,&name2);
printf("%s%s\n",name2,name1);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
const int MAX_DICE_NUMBER = 5;
void moveNorth(int diceRot[3]) {
int temp = diceRot[2];
diceRot[2] = diceRot[1];
diceRot[1] = MAX_DICE_NUMBER - temp;
}
void moveSouth(int diceRot[3]) {
int temp = diceRot[1];
diceRot[1] = diceRot[2];
diceRot[2] = MAX_DICE_NUMBER - temp;
}
void moveEast(int diceRot[3]) {
int temp = diceRot[1];
diceRot[1] = diceRot[0];
diceRot[0] = MAX_DICE_NUMBER - temp;
}
void moveWest (int diceRot[3]) {
int temp = diceRot[0];
diceRot[0] = diceRot[1];
diceRot[1] = MAX_DICE_NUMBER - temp;
}
int main() {
int diceValue[6];
int diceRotation[3] = {3,0,4};
for (int i = 0; i < 6; i++) {
cin >> diceValue[i];
}
string sequence;
//cin.sync();
cin >> sequence;
//cin.sync();
//cout << sequence << endl;
for (int i = 0; i < sequence.length(); i++) {
switch (sequence[i])
{
case 'N':
moveNorth(diceRotation);
break;
case 'S':
moveSouth(diceRotation);
break;
case 'E':
moveEast(diceRotation);
break;
case 'W':
moveWest(diceRotation);
break;
default:
break;
}
}
cout << diceValue[diceRotation[1]]<< endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------------------------------
void MAIN() {
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.insert(c);
for (auto &i : s) d.erase(i);
if (d.size()) {
s += *d.begin();
cout << s << '\n';
return;
}
set<char> g;
while (s.size()) {
char c = s.back();
s.pop_back();
auto it = g.upper_bound(c);
if (it != g.end()) {
s += *it;
cout << s << '\n';
return;
}
g.insert(c);
}
cout << -1 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
int n = s.size();
if (n != 26) {
vector<bool> flg(26, false);
rep(i, n) flg[s[i]-'a'] = true;
cout << s;
rep(i, 26) {
if (!flg[i]) {
cout << (char)(i + 'a') << endl;
return 0;
}
}
}
else {
string t = s;
if (!next_permutation(t.begin(), t.end())) {
cout << -1 << endl;
return 0;
}
rep(i, n) {
cout << t[i];
if (t[i] != s[i]) {
cout << endl;
break;
}
}
}
return 0;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
#define MAX 100100
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x:x;
}
int a[MAX],n,m,S[MAX],top;
int main()
{
n=read();m=read();
for(int i=1;i<=m;++i)
{
a[i]=read();
if(a[i]&1)S[++top]=i;
}
if(top>2){puts("Impossible");return 0;}
if(top)swap(a[1],a[S[1]]);
if(top>1)swap(a[m],a[S[2]]);
if(m==1)
{
if(a[1]==1)printf("1\n1\n1\n");
else printf("%d\n2\n%d 1\n",a[1],a[1]-1);
return 0;
}
for(int i=1;i<=m;++i)printf("%d ",a[i]);puts("");
printf("%d\n",m-(a[m]==1));
printf("%d ",a[1]+1);
for(int i=2;i<m;++i)printf("%d ",a[i]);
if(a[m]>1)printf("%d ",a[m]-1);
puts("");return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
//xにはvectorなどのコンテナ
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 //10^12:極めて大きい値,∞
#define inf 2147483647 //int値の最大値
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define PB push_back //vectorヘの挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
#define cint(n) int n;cin>>n;
#define CST(x) cout<<fixed<<setprecision(x)//小数点以下の桁数指定
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int gcd(int a, int b) {
if (b==0) return a;
else return gcd(b, a%b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int sx,sy,tx,ty;cin>>sx>>sy>>tx>>ty;
rep(i,tx-sx){
cout<<"R";
}
rep(i,ty-sy){
cout<<"U";
}
rep(i,tx-sx){
cout<<"L";
}
rep(i,ty-sy){
cout<<"D";
}
cout<<"D";
rep(i,tx-sx){
cout<<"R";
}
cout<<"RU";
rep(i,ty-sy){
cout<<"U";
}
cout<<"LU";
rep(i,tx-sx){
cout<<"L";
}
cout<<"LD";
rep(i,ty-sy){
cout<<"D";
}
cout<<"R"<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int a,b;
cin>>a>>b;
cout<<(a+b-3)/(a-1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
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;
}
//O(k)愚直,nは大きいがkがそうでもないときに思い出す
long long modpow(long long x,long long n,long long mod){
long long res = 1;
while(n > 0) {
if(n & 1) (res *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return res;
}
long long modinv(long long x, long long mod){
return modpow(x, mod - 2, mod); }
long long modcomb(long long n,long long r,long long mod){
long long numerator = 1;
for(long long i = 0; i < r; i++) {
(numerator *= (n - i)) %= mod;
}
long long denominator = 1;
for(long long i = 1; i <= r; i++) {
(denominator *= i) %= mod;
}
denominator = modinv(denominator, mod);
return numerator * denominator % mod;
}
int main(){
ll n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
} | 0 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
// -------------------------------------------------------
ll N, x;
ll a[101010];
int main() {
cin >> N >> x;
rep(i, 0, N) { cin >> a[i]; }
ll ans = max(0LL, a[0] - x);
a[0] -= ans;
ll prev = a[0];
rep(i, 1, N) {
ll diff = max(0LL, prev + a[i] - x);
ans += diff;
a[i] -= diff;
prev = a[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
typedef double ld;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 305;
int dp[N][N][N];
int main(){
fastIO;
string s;
cin >> s;
int k;
cin >> k;
int n = s.size();
for(int i = 0 ; i < n; i ++ ){
dp[i][i][0] = 1;
if(i + 1 < n){
if(s[i] == s[i + 1]){
dp[i][i + 1][0] = 2;
}
else{
dp[i][i + 1][0] = 1;
dp[i][i + 1][1] = 2;
}
}
}
int r;
int cost;
for(int len = 3; len <= n; len ++ ){
for(int l = 0 ; l + len - 1 < n; l ++ ){
r = l + len - 1;
for(int t = 0 ; t <= k ; t ++ ){
dp[l][r][t] = max(dp[l][r-1][t], dp[l+1][r][t]);
cost = (s[l] != s[r]);
if(t - cost >= 0){
dp[l][r][t] = max(dp[l][r][t], dp[l+1][r-1][t - cost] + 2);
}
}
}
}
int ans = 0;
for(int t = 0 ;t <= k ; t ++ ) ans = max(ans, dp[0][n-1][t]);
cout << ans << "\n";
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, K, a[maxn];
int main() {
scanf("%d %d", &n, &K);
int g = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]), g = __gcd(a[i], g);
}
if (K <= *max_element(a + 1, a + n + 1) && !(K % g)) {
printf("POSSIBLE\n");
} else {
printf("IMPOSSIBLE\n");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main(){
ios::sync_with_stdio(false);
int n,k;
cin >> n >> k;
int g;
cin >> g;
int max=g;
rep(i,n-1) {
int a;
cin >> a;
chmax(max, a);
g = __gcd(g,a);
}
if(k > max) cout << "IMPOSSIBLE" << endl;
else if(k%g == 0) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
}
| 1 |
#include <iostream>
#include <string>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
string s; int n;
int K;
int dp[300][300][301]; //dp[l][r][x] = 区間[l, r]内における最長回文の長さ（変更数≦x)
int iter[2][300][26]; //iter[left or right][pos][moji] = (leftの場合)s[pos],…,s[n-1]の間において文字mojiが出現する最初の場所
//, (rightの場合)s[0],…,s[pos]の間において文字mojiが出現する最後の場所
int dfs(int l, int r, int x) {
int len = r - l + 1;
if (len == 1) return 1;
if (len <= 0) return 0;
if (dp[l][r][x] != -1) return dp[l][r][x];
int ret = 0;
if (x > 0 && len >= 2) ret = 2 + dfs(l + 1, r - 1, x - (s[l] != s[r]));
for (int i = 0; i < 26; i++) {
int nl = iter[0][l][i];
int nr = iter[1][r][i];
if (nl == -1 || nr == -1 || nl > nr) continue;
int res = 2 - (nl == nr) + dfs(nl + 1, nr - 1, x);
ret = max(ret, res);
}
return dp[l][r][x] = ret;
}
int main() {
int i, j, k;
cin >> s >> K;
n = s.length();
rep(i, n) rep(j, n) rep(k, n + 1) dp[i][j][k] = -1;
rep(i, 2) rep(j, n) rep(k, 26) iter[i][j][k] = -1;
rep(i, n) {
for (j = i; j < n; j++) {
if (iter[0][i][s[j] - 'a'] == -1) {
iter[0][i][s[j] - 'a'] = j;
}
}
for (j = i; j >= 0; j--) {
if (iter[1][i][s[j] - 'a'] == -1) {
iter[1][i][s[j] - 'a'] = j;
}
}
}
int res = dfs(0, n - 1, K);
cout << res << endl;
return 0;
}
//K=0の場合で実験すると、最長部分列のうち一つは回文になっていると予想できる。これが正しければ、最長回文の長さが解の上界になる。
//まあ、AGCなので正しいだろう（は？）
//また、Tの回文部分列なら何でも、TとT'の共通部分列になっている。よって、最長回文の長さが解の下界になる。
//
//よって、「文字列Sの文字をK文字まで変更できるとき、作れる回文部分列の長さは最大でいくらになるか？」という問題になる。
//これは、
//１．文字を変更する→（回文になるように）左から文字を選ぶ
//２．左から文字を選ぶ→（回文になるように）文字を変更する→変更数≦Kかをチェックする。
//３．両端から文字を選ぶ→（回文になるように）文字を変更する
//のいずれでも解くことができるが、３の方針で考えると見通しがよい。このとき、以下の問題を解くのが本質になる。
//
//「両端からペアを作っていく。1文字だけのペアも作れるが、ペアは入れ子構造になっている必要がある。
//ペアを作るとき、違う文字ならコストが1発生する。コストK以下でいくつペアを作れるか？」
//
//この問題は、dp[左端l][右端r][変更数x] = そこからいくつのペアを作れるか？というDPで解くことができる。
//遷移は、「両端(l, r)を使う」「コストを消費せず、文字aでペアを作る」の2つだが、どちらもO(1)で行うことができる。
//計算量はO(N^3) * 26 / 2くらいになる。これ間に合うのか？ | //beet
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
#define MAX 114514
vector<P> G[MAX*5];
map<int,int> M[MAX];
int dist[MAX*5];
signed main(){
int n,m;
cin>>n>>m;
int cnt=n;
for(int i=0;i<m;i++){
int p,q,c;
cin>>p>>q>>c;
p--;q--;
auto add_edge = [&](int x){
if(!M[x].count(c)){
M[x][c]=cnt++;
G[M[x][c]].push_back(P(x,0));
G[x].push_back(P(M[x][c],1));
}
};
add_edge(p);
add_edge(q);
G[M[p][c]].push_back(P(M[q][c],0));
G[M[q][c]].push_back(P(M[p][c],0));
}
memset(dist,-1,sizeof(dist));
priority_queue<P,vector<P>,greater<P> > q;
dist[0]=0;
q.push(P(dist[0],0));
while(!q.empty()){
P p=q.top();q.pop();
int d=p.first,v=p.second;
if(dist[v]<d) continue;
for(P e:G[v]){
int u=e.first,c=e.second;
if(dist[u]<0||dist[u]>d+c){
dist[u]=d+c;
q.push(P(dist[u],u));
}
}
}
cout<<dist[n-1]<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<vector<int>> x(n, vector<int>());
vector<vector<int>> y(n, vector<int>());
for(int i=0; i<n; i++){
int a;
cin >> a;
for(int j=0; j<a; j++){
int xx, yy;
cin >> xx >> yy;
x[i].push_back(xx-1);
y[i].push_back(yy);
}
}
int max_pop = 0;
for(int i=0; i<(1<<n); i++){
bool flag = true;
for(int j=0; j<n; j++){
if((i & (1<<j)) == (1<<j)){
// j が正直者のとき
for(int k=0; k<x[j].size(); k++){
if((i & (1<<x[j][k])) != y[j][k] * (1<<x[j][k])){
// 証言と違う
flag = false;
}
}
}
}
if(flag && max_pop < __builtin_popcount(i)){
max_pop = __builtin_popcount(i);
}
}
cout << max_pop << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init(){
cin.tie(0);
ios::sync_with_stdio(false);
}
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WG = vector< Edges< T > >;
using UG = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
struct UnionFind
{
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
rep(i,n) par[i] = i;
}
int find(int x) {
if (x == par[x]) return x;
return par[x] = find(par[x]);
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (sizes[x] < sizes[y]) swap(x, y);
par[y] = x;
sizes[x] += sizes[y];
return true;
}
int size(int x) {
return sizes[find(x)];
}
};
template<typename T>
T kruskal(Edges<T> &es,int n) {
sort(all(es),[](const edge<T> & a,const edge<T> &b){
return (a.cost < b.cost);
});
UnionFind uf(n);
T min_cost = 0;
for(auto &e:es) {
if(uf.unite(e.src,e.to))
min_cost += e.cost;
}
return min_cost;
}
main(){
int n;
cin>>n;
vector<P> x,y;
rep(i,n){
int a,b;
cin>>a>>b;
x.PB(P(a,i));
y.PB(P(b,i));
}
sort(all(x));
sort(all(y));
Edges<int> es;
rep(i,n-1){
P p=x[i+1],q=x[i];
es.PB(edge<int>(p.S,q.S,abs(p.F-q.F)));
es.PB(edge<int>(q.S,p.S,abs(p.F-q.F)));
p=y[i+1],q=y[i];
es.PB(edge<int>(p.S,q.S,abs(p.F-q.F)));
es.PB(edge<int>(q.S,p.S,abs(p.F-q.F)));
}
cout<<kruskal(es,n)<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
if(n <= 111) cout << 111 << endl;
else if(n <= 222) cout << 222 << endl;
else if(n <= 222) cout << 222 << endl;
else if(n <= 333) cout << 333 << endl;
else if(n <= 444) cout << 444 << endl;
else if(n <= 555) cout << 555 << endl;
else if(n <= 666) cout << 666 << endl;
else if(n <= 777) cout << 777 << endl;
else if(n <= 888) cout << 888 << endl;
else cout << 999 << endl;
return 0;
}
| #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int x; cin>>x;
for (int i=x; i<=999; i++) {
string cur=to_string(i);
set<char> st(cur.begin(),cur.end());
if (st.size()==1) {
cout<<i<<endl;
break;
}
}
return 0;
}
| 1 |
#include <vector>
#include <algorithm>
using namespace std;
void scc_dfs(int at, int &cnt, vector<int> &inum, vector<bool> &used, const vector<vector<int>> &graph)
{
used[at] = true;
for (int ne : graph[at]) {
if (!used[ne]) scc_dfs(ne, cnt, inum, used, graph);
}
inum[cnt] = at;
cnt++;
}
#include <iostream>
void scc_rdfs(int at, vector<int> &cs, vector<bool> &used, const vector<vector<int>> &inv)
{
used[at] = true;
cs.push_back(at);
for (int ne : inv[at]) {
if (!used[ne]) scc_rdfs(ne, cs, used, inv);
}
}
vector<vector<int>> strongly_connected_components(const vector<vector<int>> &graph)
{
const int V = graph.size();
int cnt = 0;
vector<int> inum(V);
vector<bool> used(V);
for (int i = 0; i < V; i++) {
if (!used[i]) scc_dfs(i, cnt, inum, used, graph);
}
vector<vector<int>> inv(V);
for (int i = 0; i < V; i++){
for (int v : graph[i]) {
inv[v].push_back(i);
}
}
fill(used.begin(), used.end(), false);
vector<vector<int>> ret;
for (int i = V - 1; i >= 0; i--) {
vector<int> cs;
if (!used[inum[i]]) scc_rdfs(inum[i], cs, used, inv);
ret.push_back(cs);
}
return ret;
}
#include <iostream>
int main()
{
ios::sync_with_stdio(false);
int V, E;
cin >> V >> E;
vector<vector<int>> graph(V);
int s, t;
for (int i = 0; i < E; i++) {
cin >> s >> t;
graph[s].push_back(t);
}
auto res = strongly_connected_components(graph);
vector<int> num(V);
for (int i = 0; i < res.size(); i++) {
for (int v : res[i]) {
num[v] = i;
}
}
int Q;
cin >> Q;
int u, v;
for (int i = 0; i < Q; i++) {
cin >> u >> v;
cout << (num[u] == num[v]) << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
#define int long long
#define ll long long
#define mod 1000000007
#define INF (1LL<<60)
void bfs(int s, vector<vector<int>>& g, vector<int>& visited){
queue<int> q;
q.push(s);
visited[s] = s;
while (!q.empty()){
int u = q.front(); q.pop();
for (int v : g[u]){
if (visited[v] < 0){
visited[v] = s;
q.push(v);
}
}
}
}
signed main(){
int N, K, L;
vector<vector<int>> road, train;
cin >> N >> K >> L;
road.assign(N, vector<int>());
train.assign(N, vector<int>());
for (int i = 0; i < K; i++){
int p, q;
cin >> p >> q; p--; q--;
road[p].push_back(q);
road[q].push_back(p);
}
for (int i = 0; i < L; i++){
int p, q;
cin >> p >> q; p--; q--;
train[p].push_back(q);
train[q].push_back(p);
}
vector<int> visited_road(N), visited_train(N);
visited_road.assign(N, -1);
visited_train.assign(N, -1);
for (int i = 0; i < N; i++){
if (visited_road[i] < 0) bfs(i, road, visited_road);
if (visited_train[i] < 0) bfs(i, train, visited_train);
}
map<pair<int, int>, int> cnt;
for (int i = 0; i < N; i++){
cnt[pair<int, int>(visited_road[i], visited_train[i])]++;
}
for (int i = 0; i < N; i++){
cout << cnt[pair<int, int>(visited_road[i], visited_train[i])] << " ";
}
return 0;
}
| 0 |
#include<iostream>
#include<vector>
using namespace std;
int m;
int g[1000000];
int cnt=0;
std::vector<int> G;
void insertionSort(int array[], int n, int g){
int tmp,j;
for(int i=g;i<n;i++){
tmp = array[i];
j= i-g;
while(j>=0 && array[j]>tmp){
array[j+g] = array[j];
j=j-g;
cnt++;
}
array[j+g]=tmp;
}
}
void shellSort(int array[],int n){
cnt = 0;
for(int h=1; ;){
if(h>n) break;
G.push_back(h);
h = 3 * h + 1;
}
for(int i=G.size()-1;i>=0;i--){
insertionSort(array,n,G[i]);
}
}
int main(){
int n;
int array[1000001];
cin >> n;
for(int i=0;i<n;i++){
cin >>array[i];
}
shellSort(array,n);
cout << G.size() << endl;
for(int i=G.size()-1;i>=0;i--){
cout<<G[i];
if(i) cout<<" ";
}
cout << endl;
cout << cnt << endl;
for(int i=0;i<n;i++){
cout << array[i]<<endl;
}
return 0;
} | #include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
void insertionSort(int A[], const int n, const int g, int *cnt)
{
for( int i = g; i < n; ++i ){
int tmp = A[i];
int j = i - g;
while( -1 < j && tmp < A[j] ){
//cout << A[j+g] << "<-->" << A[j] << endl;
A[j+g] = A[j];
j = j - g;
++*cnt;
}
A[j+g] = tmp;
}
}
void shellSort(int A[], const int n)
{
int cnt = 0;
int m;
int G[100];
for( int i = 0; i < 100; ++i ){
if( i == 0 ) G[i] = n / 2 + 1;
else G[i] = G[i-1] / 2 - 1;
if( G[i] < 0 ){
G[i-1] = 1;
G[i] = 0;
m = i;
break;
}
}
for( int i = 0; i < m; ++i )
insertionSort(A, n, G[i], &cnt);
//出力
printf("%d\n", m);
for( int i = 0; i < m; ++i ){
if( i ) printf(" ");
printf("%d", G[i]);
}
printf("\n%d\n", cnt);
for( int i = 0; i < n; ++i )
printf("%d\n", A[i]);
}
int main()
{
//入力
int n;
scanf("%d", &n);
int A[n];
for( int i = 0; i < n; ++i )
scanf("%d", &A[i]);
//シェルソート
shellSort(A, n);
return 0;
}
| 1 |
#ifdef __unix__
#include <bits/stdc++.h>
#else
#include <iostream>
#include <algorithm>
#include <math.h>
#include <functional>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <bitset>
#endif
#define fastIO ios_base::sync_with_stdio(0), cin.tie(NULL)
#define pb push_back
#define all(x) x.begin(), x.end()
#define endl '\n'
#define mkp make_pair
/*#define NUMTOSTR(x) (unsigned char)((x) + 48);*/
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main(){
fastIO;
string s;
cin >> s;
if (s.size() == 2) cout << s;
else {
reverse(all(s));
cout << s;
}
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
cout << n * 3.141592653589 * 2;
}
| 0 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> s(H);
rep(i, H) cin >> s[i];
rep(y, H) rep(x, W) {
if (s[y][x] != '#') {
continue;
}
bool ok =false;
rep(i, 2) {
int xx = x - 1 + 2 * i;
int yy = y;
if (0 <= xx && xx < W && 0 <= yy && yy < H) {
if (s[yy][xx] == '#') {
ok = true;
}
}
}
rep(i, 2) {
int xx = x;
int yy = y - 1 + 2 * i;
if (0 <= xx && xx < W && 0 <= yy && yy < H) {
if (s[yy][xx] == '#') {
ok = true;
}
}
}
if (ok == false) {
put("No");
return 0;
}
}
put("Yes");
return 0;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[128] = { 0 };
short grid[64][64] = { {0} };
int H,W;
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d", &H, &W);
for(int i = 0; i < H; i++){
memset(buf, 0, sizeof(buf));
fgets(buf, sizeof(buf), stdin);
for(int j = 0; j < W; j++)
if(buf[j] == '#') grid[i+1][j+1] = 1;
}
int flag = 0;
for(int i = 1; i < H+1; i++){
for(int j = 1; j < W+1; j++){
if(grid[i][j] == 0) continue;
else{
if(grid[i-1][j] != 1 && grid[i][j-1] != 1
&& grid[i+1][j] != 1 && grid[i][j+1] != 1){
flag = 1;
break;
}
}
}
if(flag) break;
}
if(flag == 0) printf("Yes\n");
else printf("No\n");
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
// utility
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
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; }
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
/* const int MOD = 998244353; */
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
int N;
vector<int> A, sum;
signed main() {
cin >> N;
A.resize(N);
REP(i, N) cin >> A[i];
sum.resize(N+1, 0);
REP(i, N) sum[i+1] += sum[i]+A[i];
auto f = [&](int l, int m, int r){
return abs((sum[m]-sum[l])-(sum[r+1]-sum[m]));
};
int ans = INF;
int l = 1, r = 2;
FOR(i, 1, N-1){
while(l+1 <= i && f(0, l, i) > f(0, l+1, i)) l++;
while(r+1 <= N && f(i+1, r, N-1) > f(i+1, r+1, N-1)) r++;
int P = sum[l];
int Q = sum[i+1]-sum[l];
int R = sum[r]-sum[i+1];
int S = sum[N]-sum[r];
int MAX = max(max(P, Q), max(R, S));
int MIN = min(min(P, Q), min(R, S));
chmin(ans, MAX-MIN);
}
cout << ans << "\n";
return 0;
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 1000000007
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
Int n, d;
Int a[216000];
Int sums[216000];
Int difs[216000];
Int res;
int main(){
cin >> n >> d;
for(int i = 0;i < n;i++){
cin >> a[i];
sums[i] = a[i] + i * d;
difs[i] = a[i] - i * d;
res += 2 * a[i];
}
res += (n-1)*d;
res -= a[0] + a[n-1];
for(int i = 1;i < n;i++)difs[i] = min(difs[i], difs[i-1]);
for(int i = n-2;i >= 0;i--)sums[i] = min(sums[i], sums[i+1]);
for(int i = 1;i < n-1;i++){
// cout << difs[i] << " " << sums[i] << endl;
Int ltmp = -a[i] + i*d + difs[i];
Int rtmp = -a[i] - i*d + sums[i];
// cout << ltmp << " " << rtmp << endl;
res += min(ltmp, rtmp);
}
cout << res << endl;
return 0;
} | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define pb push_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
// #define int ll
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 1100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[4] ={1,0,-1,0} , dy[4] ={0,1,0,-1};
struct Timer{
chrono::system_clock::time_point start, end;
Timer(){ start = chrono::system_clock::now(); }
~Timer(){
end = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(end - start).count();
cerr<<"time : "<<msec<<" ms"<<endl;
}
};
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Timer TM;
ll n;
ll ans=0;
string s;
// unordered_map<string,ll> mp;
map<pair<string,string>,ll> mp;
cin>>n>>s;
rep(bit,(1<<n)){
string u="",t="";
rep(i,n){
if(bit&(1<<i)){
u+=s[i];
}
else t+=s[i];
}
++mp[make_pair(u,t)];
// cout<<u+'0'+t<<endl;
}
rep(bit,(1<<n)){
string u="",t="";
rep(i,n){
if(bit&(1<<i)){
u=s[i+n]+u;
}
else t=s[i+n]+t;
}
ans+=mp[make_pair(t,u)];
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
void all_enum(string R, string B, string &S, map<string,int> &m){
int i=(int)R.size()+B.size();
if(i==(int)S.size()){
string key_=R+","+B;
//cout << key_ << endl;
if(m.count(key_)){
m[key_]++;
}else{
m[key_]=1;
}
return;
}
all_enum(R+S[i],B,S,m);
all_enum(R,B+S[i],S,m);
}
ll count_pattern(string R, string B, string &T, map<string,int> &m){
int i=(int)R.size()+B.size();
if(i==(int)T.size()){
string key_=R+","+B;
//cout << key_ << endl;
if(m.count(key_)){
return m[key_];
}else{
return 0;
}
}
ll cnt=0;
cnt+=count_pattern(R+T[i],B,T,m);
cnt+=count_pattern(R,B+T[i],T,m);
return cnt;
}
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T=S.substr(N,N);
reverse(T.begin(),T.end());
S=S.substr(0,N);
map<string,int> m;
all_enum("","",S,m);
//cout << "_______" << endl;
cout << count_pattern("","",T,m) << endl;
} | 1 |
#include <cstdio>
#include <cstring>
char ans3[4][4]={"aab","b.b","baa"};
char ans4[5][5]={"aacd","bbcd","dcaa","dcbb"};
char ans5[6][6]={"aabc.","..bcd","ccd.d","d.daa","dccbb"};
char ans6[7][7]={"a..bcc","a..bdd",".bccb.",".baab.","ddb..a","ccb..a"};
char ans7[8][8]={"aacd...","bbcd...","ccaab..","..b.bdd","..baacc","....cba","....cba"};
char s[1010][1010];
inline void paint3(int x){ for(int i=0;i<3;++i) for(int j=0;j<3;++j) s[x+i][x+j]=ans3[i][j]; }
inline void paint4(int x){ for(int i=0;i<4;++i) for(int j=0;j<4;++j) s[x+i][x+j]=ans4[i][j]; }
inline void paint5(int x){ for(int i=0;i<5;++i) for(int j=0;j<5;++j) s[x+i][x+j]=ans5[i][j]; }
inline void paint6(int x){ for(int i=0;i<6;++i) for(int j=0;j<6;++j) s[x+i][x+j]=ans6[i][j]; }
inline void paint7(int x){ for(int i=0;i<7;++i) for(int j=0;j<7;++j) s[x+i][x+j]=ans7[i][j]; }
int main(){
int n; scanf("%d",&n); if(n==2){ puts("-1"); return 0; }
for(int i=0;i<n;++i) for(int j=0;j<n;++j) s[i][j]='.';
if(n%6==0){ for(int i=0;i<n/6;++i) paint6(6*i); }
if(n%6==1){ for(int i=0;i<n/6-1;++i) paint6(6*i); paint7(n-7); }
if(n%6==2){ for(int i=0;i<n/6-1;++i) paint6(6*i); paint4(n-8); paint4(n-4); }
if(n%6==3){ for(int i=0;i<n/3;++i) paint3(3*i); }
if(n%6==4){ for(int i=0;i<n/6;++i) paint6(6*i); paint4(n-4); }
if(n%6==5){ for(int i=0;i<n/6;++i) paint6(6*i); paint5(n-5); }
for(int i=0;i<n;++i){ for(int j=0;j<n;++j) printf("%c",s[i][j]); puts(""); }
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
vector<bool>A(55556,true);
for(int i=2;i<55556;i++){
if(!A.at(i))
continue;
else{
for(int j=2;i*j<=55555;j++)
A.at(i*j)=false;
}
}int a=0;
vector<int>B;
for(int i=2;i<55556;i++){
if(A.at(i)){if(i%5==1){B.push_back(i);a++;}}
if(a==N)break;
}for(int i=0;i<N-1;i++)
cout<<B.at(i)<<" ";
cout<<B.at(N-1)<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define bits(x) __builtin_popcount(x)
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
//template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#ifdef LOCAL
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template<typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << "# "<< name << " = " << arg1 << '\n';
}
template<typename Arg1, typename... Args>
void __f(const char* names, Arg1 && arg1, Args &&... args){
const char* comma = strchr(names + 1 ,',');
cout << "# ";
cout.write(names, comma - names)<< " = " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define debug(...) 36
#endif
std::mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int ri(int a, int b) {
return uniform_int_distribution<int>(a, b)(rng);
}
ll power(ll x, ll y, ll p){
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
const ll INF = (ll)(8e18);
const ll MOD = (ll)(1e9 + 7);
const ll HMOD = (ll)4222234727;
const ll Hashprime = (ll)31;
const int maxn = 100100;
int32_t main(){
IOS;
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int TestCases = 1; // cin >> TestCases;
while(TestCases--){
int n,r; cin >> n >> r;
if(n >= 10){
cout << r << '\n';
}else{
cout << r + (100 * (10 - n)) << '\n';
}
}
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
//g++ -DLOCAL -std=c++17 -Wshadow -Wall -o "c" "comp.cpp" -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -g
| #include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
sort(A.begin(), A.end());
int ans = 0;
for(int i = 0; i < K; i++){
ans += A.at(N - 1 - i);
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int n , m , X , Y;
int x[MAXX];
int y[MAXX];
int main()
{
_FastIO;
int a , b;
cin >> n >> m >> X >> Y;
for(int i = 0; i < n; i++){
cin >> x[i];
if(i) a = max(a , x[i]);
else a = x[0];
}
for(int i = 0; i < m; i++){
cin >> y[i];
if(i) b = min(b , y[i]);
else b = y[0];
}
int tp = max(X + 1 , a + 1);
int yp = min(Y , b);
if(tp > yp){
cout << "War" << endl;
return 0;
}
cout << "No War" << endl;
return 0;
}
| #include <cctype>
#include <string>
#include <iostream>
using namespace std;
int main()
{
string S; int C = 0;
while (getline(cin, S))
{
for (int i = 0; i < 26; i++)
{
if (!(S.find("this") == string::npos && S.find("that") == string::npos && S.find("the") == string::npos))
{
cout << S << endl;
goto Exit;
}
for (string::size_type j = 0; j < S.size(); j++)
{
if (isalpha(static_cast<int>(S[j])))
{
if (S[j] == 'z')
{
S[j] = 'a';
}
else
{
S[j]++;
}
}
}
}
Exit:;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
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;}
typedef pair<int, int> P;
typedef pair<ll,ll> PLL;
double rad(double a) {return a * 180 / PI;}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
//dpTable
int dp[100050];
int main(){
ll N;
cin >> N;
int sqrtN = sqrt(N);
int A,B;
for (int i = sqrtN; i >= 1; i--) {
if (N % i == 0) {
A = i;
B = N / i;
break;
}
}
int cntA = 0,cntB = 0;
while (A != 0) {
A /= 10;
cntA++;
}
while (B != 0) {
B /= 10;
cntB++;
}
cout << max(cntA,cntB) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long total = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
total = i;
}
}
long long result = N / total;
long long count = 0;
while (result != 0) {
result = result / 10;
count++;
}
cout << count << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define very_slow ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define inf 1e18
#define MAX 1e9
#define MIN -1e9
#define no_of_test(x) int x; cin>>x; while(x--)
const double pi=3.14159265359;
//Actual Code Is At The Top
const int mod = 1e9 + 6;
int gcd(int a, int b)
{
if (b == 0) return a;
return gcd(b, a % b);
}
int binary_exponentation(int a, int b)
{
int ret = 1;
while (b)
{
if (b & 1) ret = (ret * a) % mod;
b >>= 1;
a = (a * a) % mod;
}
return ret;
}
int main()
{
very_slow
// no_of_test(x)
{
double r;
cin>>r;
double k=(2.0)*pi*r;
cout<<fixed<<setprecision(16)<<k<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1)
int main(){
ll N;
cin>>N;
cout<<2*N*PI<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define FAST_INPUT ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
const int mod = 1e9+7;
void add_self(int& a, int b) {
a+=b;
if (a>mod) {
a-=mod;
}
}
void solve() {
string K;
cin >> K;
int D;
cin >> D;
// 544 -> 499
vector<vector<int>> dp(D, vector<int>(2));
dp[0][false] = 1;
for (int idx=0; idx<(int) K.size(); idx++) {
vector<vector<int>> new_dp(D, vector<int>(2));
for (int sum=0; sum<D; sum++) {
for (bool smaller_already: {false, true}) {
for(int digit=0; digit<10; digit++) {
if (digit>K[idx]-'0' && !smaller_already) {
break;
}
add_self(new_dp[(sum+digit)%D][smaller_already||(digit<K[idx]-'0')], dp[sum][smaller_already]);
}
}
}
dp = new_dp;
}
int res=(dp[0][true]+dp[0][false])%mod;
res--;
if (res==-1){
res=mod-1;
}
cout << res << endl;
}
int main() {
FAST_INPUT;
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e4+3;
int dp[maxn][102][2];
char s[maxn], d;
int main()
{
scanf("%s %d", s+1, &d);
int len = strlen(s+1);
dp[0][0][1] = 1;
for (int i = 0; i < len; ++i)
for (int j = 0; j < d; ++j)
for (int k = 0; k < 10; ++k)
{
int to = (j+k)%d;
if (dp[i][j][1])
{
if (k<s[i+1]-'0')
dp[i+1][to][0] = (dp[i+1][to][0] + dp[i][j][1])%mod;
else if (k==s[i+1]-'0')
dp[i+1][to][1] = (dp[i+1][to][1] + dp[i][j][1])%mod;
}
if (dp[i][j][0])
dp[i+1][to][0] = (dp[i+1][to][0] + dp[i][j][0])%mod;
}
printf("%d\n", (dp[len][0][1] + dp[len][0][0]-1+mod)%mod);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
ll x;
cin>>x;
ll ans=x/5.5;
if(2*x%11==0||2*(x+5)%11==0)
cout<<ans<<endl;
else
{
cout<<ans+1<<endl;
}
return 0;
}
| #include <iostream>
int main()
{
int64_t x;
std::cin >> x;
// 5と6を交互に出す
// どちらから始めてもいいので、最後を6にできる
const auto r = x % 11;
std::cout << x / 11 * 2 + (r + 5) / 6 << std::endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define fi first
#define se second
#define pb push_back
#define ins insert
#define er erase
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int oo = 1e18 + 7, mod = 1e9 + 7, mul = (1 << 30);
int n, pw[200005], a[200005], b[200005], hash1[200005], hash2[200005], c[200005], d[200005];
vector<ii> answers;
int hash11(int l, int r){
return (hash1[r] - (hash1[l - 1] * pw[r - l + 1]) + mod * mod) % mod;
}
int hash22(int l, int r){
return (hash2[r] - (hash2[l - 1] * pw[r - l + 1]) + mod * mod) % mod;
}
signed main(){
ios_base::sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) cin >> b[i];
for(int i = 1; i < n; i++) c[i] = (a[i] ^ a[i + 1]);
c[n] = (a[n] ^ a[1]);
for(int i = 1; i < n; i++) d[i] = (b[i] ^ b[i + 1]);
d[n] = (b[n] ^ b[1]);
//for(int i = 1; i <= n; i++) cout << c[i] << " ";
//cout << "\n";
//for(int i = 1; i <= n; i++) cout << d[i] << " ";
//cout << "\n";
for(int i = 1; i <= n; i++) hash1[i] = (hash1[i - 1] * mul + c[i]) % mod;
for(int i = 1; i <= n; i++) hash2[i] = (hash2[i - 1] * mul + d[i]) % mod;
pw[0] = 1;
for(int i = 1; i <= n; i++) pw[i] = (pw[i - 1] * mul) % mod;
for(int i = 1; i <= n; i++){
//cout << hash11(1, n - i + 1) << " " << hash22(i, n) << "\n";
if(hash11(1, (n - i + 1)) != hash22(i, n) || ((i != 1) && (hash11(n - i + 2, n) != hash22(1, i - 1)))) continue;
answers.pb({(n - i + 1) % n, b[i] ^ a[1]});
}
sort(answers.begin(), answers.end());
for(int i = 0; i < answers.size(); i++) cout << answers[i].fi << " " << answers[i].se << "\n";
}
/*
TEST HERE
INPUT #1
OUTPUT #1
INPUT #2
OUTPUT #2
INPUT #3
OUTPUT #3
*/
| #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cmath>
#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
using namespace std;
int C[10001];
int partition(int *A,int p,int r){
int x = A[r];
int i = p-1;
for (int j = p ;j < r ;j++){
if (A[j] <= x){
i = i+1;
swap(A[i],A[j]);
}
}
swap(A[i+1],A[r]);
return i+1;
}
int main(){
int n,A[100000];
cin >> n;
REP(i,n){
cin >> A[i];
}
int part;
part = partition(A,0,n-1);
cout << A[0];
REP(i,n-1){
cout << " ";
if(part==i+1) cout << "[";
cout << A[i+1];
if(part==i+1) cout << "]";
}
cout << endl;
} | 0 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
constexpr int mod = 1e9 + 7, two = (mod+1)/2;
int n, m, k;
ll fac[N], inv[N];
ll powmod(ll a,ll b)
{
a %= mod;
ll ans = 1;
while(b)
{
if(b&1) ans = ans*a%mod;
a = a*a%mod;
b >>= 1;
}
return ans;
}
void init(int n)
{
fac[0] = 1;
for(int i=1;i<=n;i++) fac[i] = fac[i-1]*i%mod;
inv[n] = powmod(fac[n],mod-2);
for(int i=n-1;i>=0;i--) inv[i] = inv[i+1]*(i+1)%mod;
}
ll comp(ll a,ll b)
{
if(a<b||b<0||a<0) return 0;
return fac[a]*inv[b]%mod*inv[a-b]%mod;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll ans = 0;
cin >> n >> m >> k;
init(n*m);
for(int i=1; i<n; i++)
{
ll cur = 1ll*(n-i)*(n-i+1)%mod*m%mod*two%mod*m%mod;
cur = cur*comp(n*m-2, k-2)%mod;
ans = (ans + cur)%mod;
}
for(int i=1; i<m; i++)
{
ll cur = 1ll*(m-i)*(m-i+1)%mod*n%mod*two%mod*n%mod;
cur = cur*comp(n*m-2, k-2)%mod;
ans = (ans + cur)%mod;
}
ans = (ans + mod)%mod;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int H, W, N;
cin >> H >> W >> N;
int MAX = max(H, W);
ans = (N + MAX - 1) / MAX;
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
map<string, int> m{
{"SUN", 7},
{"MON", 6},
{"TUE", 5},
{"WED", 4},
{"THU", 3},
{"FRI", 2},
{"SAT", 1}
};
string s;
cin >> s;
cout << m[s];
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int tcs = 1;
for (int tc = 1; tc <= tcs; tc++) {
// cout << "Case " << tc << ": ";
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int M=S.size();
int N=0,A=0,B=0;
for(int i=0;i<M;i++){
if(S[i]=='S'){
B++;
}
else{
A++;
}
N=max(N,A-B);
}
cout<<N*2<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std ;
#define int long long
int32_t main(){
int n;
cin >> n;
int a[n] ;
for(int i = 0 ; i < n ; i++) cin >> a[i] ;
int ans = 0 ;
int mx = 0 ;
for(int i = 0 ; i < n ; i++){
mx = max(mx , a[i]) ;
ans += mx - a[i] ;
}
cout << ans ;
return 0 ;
}
| #include<stdio.h>
int s[500000],n;
long long count;
void Merge(int left,int mid,int right){
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1],R[n2 + 1];
for(int i = 0;i < n1;i++)
L[i] = s[left + i];
for(int i = 0;i < n2;i++)
R[i] = s[mid + i];
L[n1] = 2000000000;
R[n2] = 2000000000;
int i = 0;
int j = 0;
for(int k = left;k < right;k++){
if(L[i] <= R[j])
s[k] = L[i++];
else{
s[k] = R[j++];
count += n1 - i;
}
}
}
void MergeSort(int left,int right){
if(left + 1< right){
int mid = (left + right)/2;
MergeSort(left,mid);
MergeSort(mid,right);
Merge(left,mid,right);
}
}
int main(void){
scanf("%d",&n);
for(int i = 0;i < n;i++){
scanf("%d",&s[i]);
}
MergeSort(0,n);
printf("%lld\n",count);
return 0;
} | 0 |
#include<iostream>
using namespace std;
void checknum(int &i, int &n);
void endchecknum(int i, int n)
{
i++;
if (i <= n)
{
checknum(i, n);
}
else
{
cout << endl;
}
}
void include3(int &x, int &i, int &n)
{
if (x % 10 == 3)
{
cout << " " << i;
endchecknum(i, n);
}
else
{
x /= 10;
if (x)
{
include3(x, i, n);
}
else
{
endchecknum(i, n);
}
}
}
void checknum(int &i, int &n)
{
int x = i;
if (x % 3 == 0)
{
cout << " " << i;
endchecknum(i, n);
}
else
{
include3(x, i, n);
}
}
void call(int &n)
{
int i = 1;
checknum(i, n);
}
int main()
{
int n;
cin >> n;
call(n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5, mod = 1e9 + 7, inf = INT_MAX;
int main()
{
//ios::sync_with_stdio(false);cin.tie(nullptr);ios_base::sync_with_stdio(false);
int ans = inf, n, x, c;
cin >> n;
while (n--)
{
c = 0;
cin >> x;
while (x % 2 == 0)
c++,
x /= 2;
ans = min(ans, c);
}
cout << ans;
return 0;
} | 0 |
#include<iostream>
#include<string>
using namespace std;
class DICE
{
private:
const int dice_tem[5][6] = { { 3,2,6,1,5,4 },{ 2,6,3,4,1,5 },
{ 5,1,3,4,6,2 },{ 4,2,1,6,5,3 },{1,2,3,4,5,6} }; //{0}:W {1}:N {2}:S {3}:E {4}:defalut
const string dice_rl = "AWWWNWWWNWWWWNWWWSWWWSWWW";
const int n = 6;
int dice_i[6] = { 0 };
int dice_j[6] = { 0 };
int a = 4;
void setup() {
for (int i = 0; i < n; i++) {
cin >> dice[i];
dice_i[i] = dice[i];
}
}
public:
int dice[6];
int num = 0;
const int dice_suffle_num = dice_rl.length();
DICE() {
}
void roll_dice() {
switch (dice_rl[num])
{
case 78: //N
a = 1;
break;
case 83: //S
a = 2;
break;
case 87: //W
a = 0;
break;
case 69: //E
break;
a = 3;
default:
a = 4;
break;
}
for (int i = 0; i < n; i++) dice_j[i] = dice_i[dice_tem[a][i] - 1];
for (int i = 0; i < n; i++) dice_i[i] = dice_j[i];
num++;
if (num > dice_suffle_num) num = 0;
}
int check(int i) {
return dice_i[i];
}
void set()
{
setup();
}
};
int main() {
const int n = 6;
bool flag = true;
int num;
cin >> num;
const int con_num = num;
DICE dice[100];
for (int i = 0; i < num ; i++)dice[i].set();
for (int i = 0; i < num - 1; i++) {
for (int j = i+1; j < num; j++) {
for (int k = 0; k < dice[0].dice_suffle_num;k++) {
dice[j].roll_dice();
for (int l = 0; l < n; l++) {
if (dice[i].dice[l] != dice[j].check(l)) {
flag = true;
break;
}
flag = false;
}
if (flag == false)break;
}
if (flag == false)break;
}
if (flag == false)break;
}
if (flag == true) {
cout << "Yes" << endl;
}
else if (flag == false) {
cout << "No" << endl;
}
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
int n;
cin >> n;
int min = n;
int ans = 0;
vector<int> p(n);
for (int i = 0;i < n;i++) {
cin >> p[i];
if (min >= p[i]) {
ans++;
min = p[i];
}
}
cout << ans << endl;
return 0;
}
//BBBBBBBBBBBBBBBBB
//int main() {
// int a, b;
// cin >> a >> b;
// if (a > b) {
// for (int i = 0;i < a;i++) {
// printf("%d", b);
// }
// }
// else {
// for (int i = 0;i < b;i++) {
// printf("%d", a);
// }
// }
//
// return 0;
//}
//AAAAAAAAAAAAAAAAA
//int main() {
// int n, m;
// cin >> n >> m;
//
// if (n == m) {
// cout << "Yes" << endl;
// }
// else {
// cout << "No" << endl;
// }
//
// return 0;
//} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long a b;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define set0(k,n) for(int nn=0;nn<(n);nn++){ (k).push_back(0); }
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define vecsize(b,size) vector<int> (b)((size));
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsl(s) vector<pair<ll,ll>> (s);
#define pairss(s) vector<pair<string,string>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define pairspl(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define pairsps(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define pairsREV(s) (s).push_back(make_pair(bb,aa));
#define pairslREV(s) (s).push_back(make_pair(bb,aa));
#define pairssREV(s) (s).push_back(make_pair(bb,aa));
#define MOD 1000000007
int main()
{
string s;
cin >> s;
ce(s.substr(0,s.size()-8))
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
string str;
signed main()
{
cin>>str;
for(int i=0;i<str.size()-8;i++) cout<<str[i];
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main(){
int N;
cin>>N;
long long answer=0;
long long before=-1;
int judge=0;
for(int i=0;i<N;i++){
long long A;
cin>>A;
if(A>before+1){
cout<<-1<<endl;
judge++;
break;
}
else if(A<=before) answer+=before;
if(i==N-1) answer+=A;
before=A;
}
if(judge==0) cout<<answer<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
rep(i,n) cout << "i" << " " << vec.at(i) << "\n";
}
void pr2d(vector<vector<ll>> vvec){
ll h = vvec.size();
ll w = vvec.at(0).size();
rep(i,h){
rep(j,w){
cout << vvec.at(i).at(j) << " ";
}
cout << "\n";
}
}
int main(){
ll n ; cin >> n;
ll prev ; cin >> prev;
bool NG = false;
if(prev!=0) NG = true;
ll ans = 0;
rep(i,n-1){
ll x ; cin >> x;
if(x == prev + 1){
ans++;
}else if(x>prev+1){
NG = true;
}else{
ans+=x;
}
prev = x;
}
if(NG){
cout << -1 << endl;
}else{
cout << ans << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) // rep(i, 1, 5) --> {1,2,3,4} // rep(i, 5, 1) --> {4,3,2,1} // rep(it, end(v), begin(v)) --> *it
using namespace std;
int main()
{
ll n;
cin >> n;
ll q = (n-1) / 11 + 1;
ll r = n % 11;
if (r == 0)
r = 7;
ll res = q * 2;
if (r <= 6)
cout << (ll)res - 1;
else
cout << (ll)res;
return 0;
} | #include<iostream>
using namespace std;
typedef long long ll;
int main(){
ll n;
while(cin>>n){
ll ans,x;
ans=n/11<<1;
x=n%11;
if(x>6)
ans+=2;
else if(x)
ans++;
cout<<ans<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void dfs(vector<vector<int>> &g, vector<bool> &used, int v, vector<int> &ans) {
used[v] = true;
for(int nv: g[v]) {
if(!used[nv]) {
dfs(g, used, nv, ans);
}
}
ans.push_back(v);
}
int main(){
ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
vector<vector<int>> to(n);
vector<vector<int>> from(n);
vector<int> ind(n,0);
rep(i,n-1+m) {
int a,b;
cin >> a >> b;
a--;b--;
to[a].push_back(b);
from[b].push_back(a);
ind[b]++;
}
vector<bool> used(n, false);
vector<int> topo_sort(0);
//dfs
/*
rep(v,n) {
if(!used[v]) dfs(to, used, v, topo_sort);
}
reverse(topo_sort.begin(), topo_sort.end());
*/
//bfs
queue<int> q;
rep(i,n) if(ind[i] == 0) q.emplace(i);
while(!q.empty()) {
int now = q.front();
topo_sort.push_back(now);
q.pop();
for(auto e: to[now]) {
ind[e]--;
if(ind[e] == 0) {
q.emplace(e);
}
}
}
vector<int> inv_topo(n);
rep(i,n) {
inv_topo[topo_sort[i]] = i;
}
rep(i,n) {
if(from[i].size() == 0) {
cout << 0 << endl;
continue;
}
int ans = from[i][0];
for(int v :from[i]) {
if(inv_topo[v] > inv_topo[ans]) {
ans = v;
}
}
cout << ans+1 << endl;
}
}
| #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int v, e;
const int MAX_N = 100010;
// 隣接リスト
vector<int> g[MAX_N];
bool used[MAX_N];
// トポロジカルソートされた数列
vector<int> ans;
bool head[MAX_N];
void dfs(int u) {
if(used[u]) return;
used[u] = true;
for(auto& i: g[u]) dfs(i);
// 帰りがけ順で追加
ans.push_back(u);
}
void tsort() {
for(int i=0; i<v; ++i) dfs(i);
reverse(ans.begin(), ans.end());
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> v >> e;
e += v - 1;
rep(i, v) head[i] = true;
for(int i=0; i<e; ++i) {
int s, t;
cin >> s >> t;
s--; t--;
g[s].push_back(t);
}
tsort();
//for(int i: ans) cout << i + 1 << endl;
vector<pair<int, int>> p;
rep(i, v) p.push_back({i, ans[i]});
rep(i, v) ans[i] = -1;
sort(p.begin(), p.end());
for(auto& e: p) {
int u = e.second;
//cerr << "*" << e.first << " " << e.second << endl;
for(auto to: g[u]) {
ans[to] = u;
}
}
for(int i: ans) cout << i + 1 << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int w,h;
int sx,sy;
int gx,gy;
int n;
vector<vector<int>> field;
int de[] = {1, 0, -1, 0};
void dfs(int x ,int y, int c) {
if(x < 1 || x > w || y < 1 || y > h || field[x][y] != c) return;
field[x][y] = -1;
dfs(x + 1, y, c);
dfs(x - 1, y, c);
dfs(x, y + 1, c);
dfs(x, y - 1, c);
}
int main() {
while(cin >> w >> h, w && h) {
field.assign(101, vector<int>(101, 0));
cin >> sx >> sy;
cin >> gx >> gy;
cin >> n;
int dd[] = {4, 2};
for(int i = 0;i < n;i++) {
int c, d, x, y;
cin >> c >> d >> x >> y;
for(int xx = x; xx < x + dd[d];xx++) {
for(int yy = y;yy < y + dd[d ^ 1];yy++) {
field[xx][yy] = c;
}
}
}
if(field[sx][sy] == 0) {
cout << "NG" << endl;
continue;
}
dfs(sx, sy, field[sx][sy]);
if(field[gx][gy] == -1) {
cout << "OK" << endl;
}
else {
cout << "NG" << endl;
}
}
}
| #include<iostream>
#include<queue>
using namespace std;
int main() {
int w, h, sx, sy, gx, gy, n;
while (cin >> w >> h, w) {
cin >> sx >> sy >> gx >> gy >> n;
int map[110][110] = {};
for (int i = 0; i < n; i++) {
int c, d, x, y; cin >> c >> d >> x >> y;
map[x][y] = c;
map[x][y + 1] = c;
map[x + 1][y] = c;
map[x + 1][y + 1] = c;
if (d == 0) {
map[x + 2][y] = c;
map[x + 2][y + 1] = c;
map[x + 3][y] = c;
map[x + 3][y + 1] = c;
}
else {
map[x][y + 2] = c;
map[x + 1][y + 2] = c;
map[x][y + 3] = c;
map[x + 1][y + 3] = c;
}
}
queue<pair<int, int> >q;
int p = map[sx][sy];
if (p == 0)goto museum;
q.push(make_pair(sx, sy));
while (q.size()) {
int x = q.front().first, y = q.front().second;
q.pop();
map[x][y] = 0;
if (x == gx&&y == gy)goto heaven;
if (map[x][y - 1] == p)q.push(make_pair(x, y - 1));
if (map[x][y + 1] == p)q.push(make_pair(x, y + 1));
if (map[x - 1][y] == p)q.push(make_pair(x - 1, y));
if (map[x + 1][y] == p)q.push(make_pair(x + 1, y));
}
museum:cout << "NG\n"; goto park;
heaven:cout << "OK\n";
park:;
}
} | 1 |
#include <iostream>
using namespace std;
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };
int field[20][20];
int dfs(int W, int H, int x, int y, int step, int limit){
if(++step > limit){ return limit; }
for(int i = 0; i < 4; ++i){
int fx = x + dx[i], fy = y + dy[i];
if(fx < 0 || fx >= W || fy < 0 || fy >= H){ continue; }
while(!(fx < 0 || fx >= W || fy < 0 || fy >= H)){
if(field[fy][fx] < 0){ return step; }
if(field[fy][fx] > 0){
fx -= dx[i]; fy -= dy[i];
break;
}
fx += dx[i]; fy += dy[i];
}
if(fx < 0 || fx >= W || fy < 0 || fy >= H){ continue; }
if(fx == x && fy == y){ continue; }
field[fy + dy[i]][fx + dx[i]] = 0;
limit = min(limit, dfs(W, H, fx, fy, step, limit));
field[fy + dy[i]][fx + dx[i]] = 1;
}
return limit;
}
int main(){
while(true){
int w, h;
cin >> w >> h;
if(w == 0 && h == 0){ break; }
int x = 0, y = 0;
for(int i = 0; i < h; ++i){
for(int j = 0; j < w; ++j){
cin >> field[i][j];
if(field[i][j] == 2){
x = j; y = i;
field[i][j] = 0;
}else if(field[i][j] == 3){
field[i][j] = -1;
}
}
}
int answer = dfs(w, h, x, y, 0, 11);
if(answer >= 11){ answer = -1; }
cout << answer << endl;
}
return 0;
} | /* 駄実装の典型 皆さんはstackではなくてn進法を使いましょう */
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <set>
#include <deque>
#include <algorithm>
using namespace std;
int main() {
while (1) {
int n;
int k;
vector<string> element_strings;
set<string> generated_strings;
deque<int> stack;
scanf("%d", &n);
scanf("%d", &k);
if (n == 0 && k == 0) return 0;
for (int i=0; i<n; i++) {
char number[3];
scanf("%s", number);
element_strings.push_back(string(number));
}
sort(element_strings.begin(), element_strings.end());
while (1) {
char has_appeared[11];
char not_count = 0;
string new_string = "";
int next_ind;
while (stack.size() != k) {
stack.push_back(0);
}
memset(has_appeared, 0, sizeof(has_appeared));
for (deque<int>::iterator itr=stack.begin(); itr != stack.end(); itr++) {
if (has_appeared[*itr]) {
not_count = 1;
break;
}
has_appeared[*itr] = 1;
new_string += element_strings[*itr];
}
if (!not_count && generated_strings.count(new_string) == 0) {
generated_strings.insert(new_string);
}
while (!stack.empty() && stack.back() == element_strings.size()-1) {
stack.pop_back();
}
if (stack.empty()) {
break;
}
next_ind = stack.back() + 1;
stack.pop_back();
stack.push_back(next_ind);
}
printf("%lu\n", generated_strings.size());
}
} | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
int H,W;
cin >> H >> W;
vector<vector<int>> A(H,vector<int>(W));
REP(i, H){
REP(j, W){
cin >> A.at(i).at(j);
}
}
vector<vector<int>> ans(4,vector<int> ());
int flag = 0;
REP(i,H){
if(i%2==0){
REP(j,W){
if(A.at(i).at(j)%2==1&&flag==0){
flag=1;
continue;
}
if(flag==1){
ans.at(2).push_back(i);
ans.at(3).push_back(j);
if(j==0){
ans.at(0).push_back(i-1);
ans.at(1).push_back(j);
}else{
ans.at(0).push_back(i);
ans.at(1).push_back(j-1);
}
}
if(A.at(i).at(j)%2==1&&flag==1){
flag=0;
}
}
}else{
REPR(j,W-1){
if(A.at(i).at(j)%2==1&&flag==0){
flag=1;
continue;
}
if(flag==1){
ans.at(2).push_back(i);
ans.at(3).push_back(j);
if(j==W-1){
ans.at(0).push_back(i-1);
ans.at(1).push_back(j);
}else{
ans.at(0).push_back(i);
ans.at(1).push_back(j+1);
}
}
if(A.at(i).at(j)%2==1&&flag==1){
flag=0;
}
}
}
}
cout << ans.at(0).size() << endl;
REP(i,ans.at(0).size()){
REP(j,3){
cout << ++ans.at(j).at(i) << " ";
}
cout << ++ans.at(3).at(i) << endl;
}
} | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;
#define REP(i,n) for(int i=0; i<n; i++)
#define RPA(i,s,e) for(int i=s; i<=e; i++)
#define RPD(i,s,e) for(int i=s; i>=e; i--)
#define PB(a) push_back(a)
#define MP(i,s) make_pair(i,s)
#define ALL(a) (a).begin(), (a).end()
#define PRT(a) cout << (a) << endl
typedef pair<int,int> P;
const int INF = 1000000009;
const int MAX_V = 101;
struct edge { int to, cost; };
vector<edge> G[MAX_V];
int N,K,L;
int f,t,c;
int dist[MAX_V];
void add_edge(int from, int to, int cost) {
edge e1 = { to, cost };
edge e2 = { from, cost };
G[from].PB(e1);
G[to].PB(e2);
}
int dijkstra(int from, int to) {
fill(dist, dist+MAX_V, INF);
priority_queue<P, vector<P>, greater<P> > que;
dist[from] = 0;
que.push(MP(0, from));
while(!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if(dist[v] < p.first) continue;
REP(i,G[v].size()) {
edge& e = G[v][i];
if(dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
que.push(MP(dist[e.to], e.to));
}
}
}
return dist[to] == INF ? -1 : dist[to];
}
void coding() {
while(scanf("%d%d", &N, &K) != EOF) {
REP(i,N) G[i].clear();
REP(i,K) {
scanf("%d", &L);
if(L == 0) {
scanf("%d%d", &f, &t);
f--; t--;
printf("%d\n", dijkstra(f, t));
} else if(L == 1) {
scanf("%d%d%d", &f, &t, &c);
f--; t--;
add_edge(f, t, c);
} else {
PRT("unknown");
}
}
}
}
// #define _LOCAL_TEST
int main() {
#ifdef _LOCAL_TEST
clock_t startTime = clock();
freopen("a.in", "r", stdin);
#endif
coding();
#ifdef _LOCAL_TEST
clock_t elapsedTime = clock() - startTime;
cout << endl;
cout << (elapsedTime / 1000.0) << " sec elapsed." << endl;
cout << "This is local test" << endl;
cout << "Do not forget to comment out _LOCAL_TEST" << endl << endl;
#endif
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF=1001001001;
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
int ans=0;
vector<string>s(h);
rep(i,h)cin>>s[i];
rep(i,h)rep(j,w)if(s[i][j]=='.')ans++;
vector<vector<int>>dist(h,vector<int>(w,INF));
queue<P>q;
q.push(P(0,0));
dist[0][0]=1;
while(!q.empty()){
int y=q.front().first;
int x=q.front().second;
q.pop();
rep(dir,4){
int vy=y+dy[dir];
int vx=x+dx[dir];
if(vy<0||vy>=h||vx<0||vx>=w)continue;
if(s[vy][vx]=='#'||dist[vy][vx]!=INF)continue;
dist[vy][vx]=dist[y][x]+1;
q.push(P(vy,vx));
}
}
ans-=dist[h-1][w-1];
if(dist[h-1][w-1]!=INF)cout<<ans<<endl;
else cout<<-1<<endl;
} | #include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> Q; Q.push(make_pair(0, 1));
bool visited[N]; for (int i = 0; i < N; i++) visited[i] = false;
visited[0] = true;
int score = -1;
while (!Q.empty()) {
auto front = Q.front(); Q.pop();
int u = front.first, d = front.second;
if (u == H*W-1) { score = white_num-d; break; }
vector<int> e;
if (u >= W) e.push_back(u-W);
if (u % W > 0) e.push_back(u-1);
if (u % W < W-1) e.push_back(u+1);
if (u / W < H-1) e.push_back(u+W);
for (int v : e) {
if (A[v] && !visited[v]) {
visited[v] = true;
Q.push(make_pair(v, d+1));
}
}
}
cout << score << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int read(){
int x=0; char c=getchar(); int flag=1;
while(!isdigit(c)) { if(c=='-') flag=-1; c=getchar(); }
while(isdigit(c)) { x=((x+(x<<2))<<1)+(c^48); c=getchar(); }
return x*flag;
}
const int N=1e5+50;
int n,k;
struct Edge{
int to,next;
}edge[N<<1];
int head[N];
int tmp=0;
void add(int x,int y){
++tmp;
edge[tmp].to=y; edge[tmp].next=head[x];
head[x]=tmp;
}
int a[N];
int ans;
int dfs(int nod,int dep){
int ret=dep;
for(int i=head[nod];i!=-1;i=edge[i].next){
ret=max(ret,dfs(edge[i].to,dep+1));
}
if(a[nod]!=1&&ret-dep==k-1) { ++ans; return 0; }
return ret;
}
signed main(){
memset(head,-1,sizeof(head));
n=read(),k=read();
for(int i=1;i<=n;i++) a[i]=read();
if(a[1]!=1) ans=1,a[1]=1;
for(int i=2;i<=n;i++) add(a[i],i);
dfs(1,0);
printf("%d\n",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define N 100000
#define pb push_back
int n, k, len, a[N + 5], d[N + 5], vis[N + 5], ans;
vector<int> G[N + 5];
struct Cmp {
bool operator () (const int &a, const int &b) const {
return d[a] < d[b];
}
};
priority_queue<int, vector<int>, Cmp> pq;
void dfs1(int u) {
for (int i = 0, v; i < G[u].size(); ++i) {
v = G[u][i];
d[v] = d[u] + 1;
dfs1(v);
}
}
void dfs2(int u) {
len++;
if (u == 1)
return ;
dfs2(a[u]);
}
void mark(int u) {
vis[u] = 1;
for (int i = 0, v; i < G[u].size(); ++i) {
v = G[u][i];
if (vis[v])
continue;
mark(v);
}
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
dfs2(a[1]);
for (int i = 2; i <= n; ++i)
G[a[i]].pb(i);
dfs1(1);
bool flag = 1;
for (int i = 1; i <= n; ++i)
if (d[i] > k || (k - d[i]) % len) {
flag = 0;
break;
}
if (flag)
ans = 0;
else {
if (a[1] != 1) ans = 1;
else ans = 0;
a[1] = 1;
for (int i = 2; i <= n; ++i)
pq.push(i);
while (!pq.empty()) {
int u = pq.top(), v; pq.pop();
if (d[u] <= k || vis[u])
continue;
ans++;
v = u;
for (int i = 1; i <= k - 1; ++i)
v = a[v];
a[v] = 1;
// printf("u:%d v:%d\n", u, v);
mark(v);
}
}
printf("%d\n", ans);
// for (int i = 1; i <= n; ++i) printf("%d ", a[i]);
// printf("\n");
return 0;
} | 1 |
#include <iostream>
#include <vector>
using namespace std;
int cnt = 0;
void PrintfArray(int a[], int n)
{
for(int i = 0; i < n; i++)
{
if( i )
cout << endl;
cout << a[i];
}
cout << endl;
}
void insertionSort(int a[], int n, int g)
{
for(int i = g; i < n; i++)
{
int temp = a[i];
int j = i - g;
while(j >= 0 && temp < a[j]){
a[j+g] = a[j];
j -= g;
cnt ++;
}
a[j+g] = temp;
}
}
void shellSort(int a[], int n)
{
cnt = 0;
vector<int> G;
int g = 1;
do{
G.push_back(g);
g = 3 * g + 1;
}while(g<n);
cout << G.size() << endl;
for(int i=G.size()-1; i>=0; i--)
{
if(G.size()-i-1)
cout << " ";
cout << G[i];
}
cout << endl;
for(int i=G.size()-1; i>=0; i--)
{
insertionSort(a, n, G[i]);
}
}
int main() {
int n;
cin >> n;
int* a = new int[n];
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
shellSort(a, n);
cout << cnt << endl;
PrintfArray(a, n);
return 0;
} | #include <cmath>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
void insertion_sort(vector<int> &list, int interval, int &count) {
for (int i = interval; i < list.size(); ++i) {
int key = list[i];
int j = i - interval;
while (j >= 0 && list[j] > key) {
list[j+interval] = list[j];
j = j - interval;
count++;
}
list[j+interval] = key;
}
}
void shell_sort(vector<int> &list, int &count) {
int index = max(0, (int)(log10(list.size())/log10(2)) - 1);
vector<int> intervals;
while (index >= 0) {
intervals.push_back(pow(2, index));
index--;
}
cout << intervals.size() << endl;
for (auto iter = intervals.begin(); iter != intervals.end() - 1; ++iter) {
cout << *iter << " ";
}
cout << intervals.back() << endl;
for (int interval : intervals) {
insertion_sort(list, interval, count);
}
}
int main() {
int N;
cin >> N;
string str;
vector<int> list;
for (int i = 0; i < N; ++i) {
cin >> str;
list.push_back(stoi(str));
}
int count = 0;
shell_sort(list, count);
cout << count << endl;
for (auto iter = list.begin(); iter != list.end(); ++iter) {
cout << *iter << endl;
}
} | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(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; }
int main(){
int n; cin >> n;
vector<int> memo{0, 0, 0};
ll res = 1;
rep(i, n){
int a; cin >> a;
int cnt = 0;
rep(i, 3)if(memo[i] == a) cnt++;
if(cnt == 0){res = 0; break;}
res = res * cnt % MOD;
rep(i, 3)if(memo[i] == a){memo[i]++; break;}
}
cout << res << ln;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n; int64_t ans = 0;
vector<int64_t> a(n), b(n);
priority_queue<pair<int64_t, int>> que;
for (auto i = 0; i < n; i++) {
cin >> a[i] >> b[i]; que.push({{a[i] + b[i]}, i});
}
for (auto i = 0; i < n; i++) {
auto p = que.top(); que.pop();
if(i % 2 == 0) ans += a[p.second];
else ans -= b[p.second];
}
cout << ans << endl;
return 0;
} | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int mx = -INF, mi = INF;
int n;
cin >> n;
vector<int> l(n), r(n);
rep(i,n){
cin >> l[i] >> r[i];
--l[i];
chmax(mx, l[i]);
chmin(mi, r[i]);
}
int ans = 0;
rep(i,n) chmax(ans, max(mi - mx, 0) + r[i] - l[i]);
vector<P> v;
rep(i,n){
int a = max(mi - l[i], 0);
int b = max(r[i] - mx, 0);
v.emplace_back(b, -a);
}
sort(v.begin(), v.end());
int left = INF;
rep(i,n){
if(i > 0) chmax(ans, left + v[i].first);
chmin(left, -v[i].second);
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const double pi=acos(-1.);
int x[233],y[233],n,sz;
double ans,st[666];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",x+i,y+i);
for(int i=1;i<=n;i++){
sz=0;
for(int j=1;j<=n;j++)
if(i^j)
st[++sz]=atan2(x[j]-x[i],y[j]-y[i]);
sort(st+1,st+sz+1);
st[0]=st[sz]-2.*pi;
ans=0;
for(int j=1;j<=n;j++)
ans=max(ans,st[j]-st[j-1]-pi);
printf("%.8f\n",ans/2./pi);
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int n = s.length();
if(n%2!=0) {
cout<<"No\n";
return 0;
}
for(int i =0;i<n;i+=2)
{
if(s[i]=='h' && s[i+1]=='i') continue;
else{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
string s;
cin >> s;
rep(i, 1 << 3) {
ll n = s[0] - '0';
rep(j, 3) {
if(i >> j & 1)
n += s[j + 1] - '0';
else
n -= s[j + 1] - '0';
}
if(n != 7) continue;
cout << s[0];
rep(j, 3) cout << (i >> j & 1 ? '+' : '-') << s[j + 1];
cout << "=7" << endl;
return 0;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 998244353;
const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
ll mypow(ll a, ll b){
ll res = 1;
a %= mo;
while (b)
{
if (b & 1)
res = res * a % mo;
a = a * a % mo;
b >>= 1;
}
return res;
}
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()
{
ll k , n ;
cin >> k >> n ;
vector<ll> ans(2*k-1);
COMinit();
for (ll i = 2; i <= 2*k; i++)
{
ll kk;
if(i<k+1)kk=i-1;
else kk=2*k+1-i;
if(i%2){
rep(j,kk/2+1){
ll te=COM(kk/2,j)*mypow(2,j);
te%=mo;
te*=COM(n-j+j+k-kk-1,j+k-kk-1);
te%=mo;
ans[i-2]+=te;
ans[i-2]%=mo;
}
}
else{
rep(j,kk/2+1){
ll te=COM(kk/2,j)*mypow(2,j);
te%=mo;
te*=COM(n-j+j+k-kk-1,j+k-kk-1);
te%=mo;
ans[i-2]+=te;
ans[i-2]%=mo;
}
rep(j,kk/2+1){
ll te=COM(kk/2,j)*mypow(2,j);
te%=mo;
te*=COM(n-j+j+k-kk-1-1,j+k-kk-1);
te%=mo;
ans[i-2]+=te;
ans[i-2]%=mo;
}
}
}
for(auto a:ans){
cout << a << endl;
}
return 0;
} | //Be Name Khoda, Besmellah Rahmane Rahim, In The Name Of God;
//#include<bits/stdc++.h>
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include <stdio.h>
#include <string.h>
#include<iomanip>
#include<unordered_map>
#include<unordered_set>
using namespace std;
const long long N = 2e3 + 5;
const long long mod = 1e9 + 7;
long long dp[N][N];
long long fact[N * N];
long long n, k;
//dp[i][j] = the number of ways when i zero has come and j colorful ball has come
void pre()
{
fact[0] = 1;
for (long long i = 1; i < N * N; i++)
{
fact[i] = fact[i - 1] * i;
fact[i] = fact[i] % mod;
}
}
long long power(long long a, long long b)
{
if (!b)
{
return 1;
}
long long ans = power(a, b / 2);
ans = ans * ans;
ans = ans % mod;
if (b % 2)
{
ans = ans * a;
ans = ans % mod;
}
return ans % mod;
}
long long choose(long long a, long long b)
{
if (a > b)
{
return 0;
}
long long ans = fact[b];
ans = ans * power(fact[a], mod - 2);
ans = ans % mod;
ans = ans * power(fact[b - a], mod - 2);
ans = ans % mod;
return ans;
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
pre();
cin >> n >> k;
dp[0][0] = 1;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n; j++)
{
// the i + j * (k - 1) + 1th ball
if (j > i)
{
continue;
}
if (i == j) // this ball only can be zero
{
dp[i + 1][j] += dp[i][j];
dp[i + 1][j] %= mod;
continue;
}
else
{
//this ball is zero
dp[i + 1][j] += dp[i][j];
dp[i + 1][j] %= mod;
// this ball is colorful
dp[i][j + 1] += dp[i][j] * choose(k - 2, n * k - i - j * (k - 1) - 1);
dp[i][j + 1] %= mod;
}
}
}
if (k > 1)
{
cout << (dp[n][n] * fact[n]) % mod << endl;
}
else
{
cout << 1 << endl;
}
}
| 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
int n,x,t;
int ans;
scanf("%d%d%d",&n,&x,&t);
if(n%x==0)
ans = n/x*t;
else
ans = n/x*t + t;
printf("%d\n",ans);
return 0;
}
| #include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main()
{
int x,y,z;
cin>>x>>y;
z =x*y;
cout <<z<<endl;
return 0;
}//どうして・・・(´･_･`) | 0 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
template<typename T> void chmin(T &a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T &a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
ll lin() { ll x; scanf("%lld", &x); return x; }
#define INF 1LL<<60
ll l_max = 0, r_min = 1e9+5;
struct problem {
ll l;
ll r;
ll a;
ll b;
bool operator<(const problem& other) const {
if (a < other.a ) return true;
else if(a > other.a ) return false;
else return b > other.b;
}
};
int main() {
int N, l_arg, r_arg;
cin >> N;
vector<ll> L(N), R(N);
vector<problem> problems(N);
REP(i, N) {
ll l, r;
cin >> l >> r;
L[i] = l;
R[i] = r+1;
if(l_max < l) {
l_max = l;
l_arg = i;
}
if(r_min > r + 1) {
r_min = r + 1;
r_arg = i;
}
}
ll length_max = 0;
REP(i, N) {
problems[i].l = L[i];
problems[i].r = R[i];
problems[i].a = max(R[i] - l_max, ll(0));
problems[i].b = max(r_min - L[i], ll(0));
if(R[i] - L[i] > length_max) length_max = R[i] - L[i];
}
sort(ALL(problems));
set<ll> tset;
ll ans = 0, min1, min2;
min1 = problems[0].a;
min2 = 0;
ans = min1 + min2;
FOR(i, 1, N-1) {
min1 = problems[i].a;
tset.insert(problems[i-1].b);
min2 = *tset.begin();
if(ans < min1 + min2) ans = min1 + min2;
}
tset.insert(problems[N-1].b);
if(ans < *tset.begin()) {
ans = *tset.begin();
}
if(ans < length_max + max(min(R[l_arg], R[r_arg]) - max(L[l_arg], L[r_arg]), ll(0)))
ans = length_max + max(min(R[l_arg], R[r_arg]) - max(L[l_arg], L[r_arg]), ll(0));
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
#define asort(x) sort(x.begin(),x.end())
#define dsort(x,t) sort(x.begin(),x.end(),greater<t>())
#define vuniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main() {
ll N;
cin >> N;
vector<ll> A;
ll sum = 0;
for (int i = 0; i < N; i++) {
ll a; cin >> a;
A.pb(a);
sum += a;
}
long double avg = (long double)((long double)sum / (long double)N);
ll num = 0;
for (int i = 1; i < N; i++) {
if(abs(avg-A[num]) > abs(avg-A[i])){
num = i;
}
}
cout << num << endl;
} | 0 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
ll DP[200005][2];
int main() {
for(int i=0;i<200005;++i) {
for(int j=0;j<2;++j) {
DP[i][j] = -big;
}
}
int N;
cin>>N;
ll A[N];
for(int i=0;i<N;++i) cin>>A[i];
if(N==2) {
cout<<max(A[0], A[1])<<endl;
return 0;
}
DP[0][1] = A[0];
DP[1][0] = A[1];
DP[2][0] = A[2];
DP[2][1] = DP[0][1]+A[2];
for(int i=3;i<N;++i) {
if(i%2==0) {
DP[i][0] = max(DP[i-4][1], max(DP[i-3][0], DP[i-2][0]))+A[i];
DP[i][1] = DP[i-2][1]+A[i];
}
else {
DP[i][0] = max(DP[i-3][1], DP[i-2][0])+A[i];
}
}
if(N%2==0) {
cout<<max(DP[N-1][0], DP[N-2][1])<<endl;
}
else {
cout<<max(DP[N-1][0], max(DP[N-2][0], DP[N-3][1]))<<endl;
}
}
| #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int month[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int main(){
int m,d;
while(scanf("%d %d",&m,&d),(m!=0)){
for(int i=0;i<m;i++){
d=d+month[i];
}
d=d%7;
switch(d){
case 0:
cout<<"Wednesday"<<endl;
break;
case 1:
cout<<"Thursday"<<endl;
break;
case 2:
cout<<"Friday"<<endl;
break;
case 3:
cout<<"Saturday"<<endl;
break;
case 4:
cout<<"Sunday"<<endl;
break;
case 5:
cout<<"Monday"<<endl;
break;
case 6:
cout<<"Tuesday"<<endl;
}
}
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.