code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define txt freopen("ip.txt", "r", stdin); freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define div2(a) (!(a&1))
#define deb(x) cout<<(#x)<<" "<<(x)<<"\n";
#define newl cout<<"\n"
#define all(s) s.begin(),s.end()
#define pi 3.14159265358979323846
#define fp(x) fixed<<setprecision(x)<<
template<class T>
T mod(T a){
if(a < 0){
a += 1000000007;
}
return a%1000000007;
}
template<class T>
T addmod(T a, T b){
return (mod(a) + mod(b)) % 1000000007;
}
template<class T>
T prodmod(T a, T b){
return (mod(a) * mod(b)) % 1000000007;
}
template<class T>
T bin_exp(T a, T b)
{
T res = 1;
T temp = 1;
if (b <= 1)
return a;
if (b %2 == 0)
res = bin_exp(a * a, b / 2);
else
{
res *= a;
temp = bin_exp(a, --b);
}
return res * temp;
}
template<class T>
T bin_expmod(T a, T b)
{
T res = 1;
T temp = 1;
if (b <= 1)
return a;
if (b %2 == 0)
res = bin_expmod(prodmod(a,a), b / 2);
else
{
res = prodmod(a,res);
temp = bin_exp(a, --b);
}
return prodmod(res , temp);
}
template<class T>
int digit(T a)
{
vector<long long> dig = {
0,
9,
99,
999,
9999,
99999,
999999,
9999999,
99999999,
999999999,
9999999999,
99999999999,
999999999999,
9999999999999,
99999999999999,
999999999999999,
9999999999999999,
99999999999999999,
999999999999999999,
INT64_MAX};
auto it = lower_bound(dig.begin(), dig.end(), a);
int idx = (it - dig.begin());
return idx;
}
template<class T>
int sumAllInts(T n){
int a = 1;
int su = 0;
while(n){
su += n%10;
n/=10;
}
return su;
}
template<class T>
void split(char c,T s){
int n = s.size();
int i = 0;
while ((cout<<s[i],i+=1) && (i<n) && (cout<<c<<' '));
}
void solve(){
long long int N,T;
cin>>N>>T;
vector<int> A(N);
for(unsigned int i=0;i<A.size();i++) cin>>A[i];
long long int total=T;
for(unsigned int i=1;i<A.size();i++)
{
if(A[i]-A[i-1]>T)
total+=T;
else
{
total+=(A[i]-A[i-1]);
}
}
cout<<total;
}
int main(){
quickie;
//txt;
int t=1;
while(t--){
solve();
newl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
// get abs
ll my_abs(ll a);
// a^n
ll a_n(ll a, ll n);
// get gcd
ll my_gcd(ll a, ll b);
// a^(-1) % MOD
ll inv(ll a);
// (a+b+c)%MOD
ll madd(ll a, ll b, ll c);
// (a-b)%MOD
ll msub(ll a, ll b);
// (a*b*c)%MOD
ll mtime(ll a, ll b, ll c);
int main() {
ll h, w; cin >> h >> w;
vector<vector<bool>> b(h+2, vector<bool>(w+2, true)); // trueで黒
queue<P> que;
vector<vector<ll>> dist(h+2, vector<ll>(w+2, 0));
rep(i, h) {
string s; cin >> s;
rep(j, w) {
if(s[j] == '.') {
b[i+1][j+1] = false;
}
else {
que.push(make_pair(i+1, j+1));
}
}
}
while(!que.empty()) {
P t = que.front(); que.pop();
ll x = t.first, y = t.second;
if(!b[x-1][y]) {
dist[x-1][y] = dist[x][y]+1;
b[x-1][y] = true;
que.push(make_pair(x-1, y));
}
if(!b[x+1][y]) {
dist[x+1][y] = dist[x][y]+1;
b[x+1][y] = true;
que.push(make_pair(x+1, y));
}
if(!b[x][y-1]) {
dist[x][y-1] = dist[x][y]+1;
b[x][y-1] = true;
que.push(make_pair(x, y-1));
}
if(!b[x][y+1]) {
dist[x][y+1] = dist[x][y]+1;
b[x][y+1] = true;
que.push(make_pair(x, y+1));
}
}
ll ans = 0;
rep(i, h) {
rep(j, w) {
if(ans < dist[i+1][j+1]) {
ans = dist[i+1][j+1];
}
}
}
cout << ans << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
| 0 |
// 2020-07-04 23:45:06
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
int dp[105][55][55], v[55];
int rec(int k, int l, int r) {
if(dp[k][l][r] >= 0) return dp[k][l][r];
chmax(dp[k][l][r], 0);
if(k == 0) return dp[k][l][r];
if(l == r) return dp[k][l][r];
chmax(dp[k][l][r], rec(k-1, l+1, r) + v[l]);
chmax(dp[k][l][r], rec(k-1, l, r-1) + v[r-1]);
if(k >= 2) {
if(v[l] < 0) chmax(dp[k][l][r], rec(k-2, l+1, r));
if(v[r-1] < 0) chmax(dp[k][l][r], rec(k-2, l, r-1));
}
return dp[k][l][r];
}
void answer() {
int n, k;
cin >> n >> k;
repc(ki, k) repc(li, n) repc(ri, n) dp[ki][li][ri] = -1;
rep(i, n) cin >> v[i];
cout << max(0, rec(k, 0, n)) << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
vector<vector<ll>> g(100010);
vector<ll> dist(100010);
int main(){
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n)cin >> v[i];
ll ans = 0;
rep(i, min(n, k) + 1)rep(j, min(n, k) + 1 - i){
vector<ll> tmp = v;
tmp.erase(tmp.begin()+i, tmp.end()-j);
sort(ALL(tmp));
rep(l, k - (i+j) && !tmp.empty()){
if(tmp.front() < 0)tmp.erase(tmp.begin());
}
ll res = 0;
rep(l, tmp.size())res += tmp[l];
ans = max(ans, res);
}
cout << ans << endl;
} | 1 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b)
{
if (a%b == 0)return b;
return gcd(b, a%b);
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main()
{
int l, r; cin >> l >> r;
if (r - l + 1 >= 2019 || l == 0)cout << 0 << endl;
else
{
int res = 1e7;
for (int i = l; i < r; ++i)
{
for (int j = i + 1; j <= r; ++j)
{
chmin(res, ((i % 2019)*(j % 2019)) % 2019);
}
}
cout << res << endl;
}
} | #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()
{
ll l, r;
cin >> l >> r;
ll mi = 2019;
for (ll i = l; i < l + 2019; i++) {
for (ll j = i + 1; j <= min(r, i + 2020); j++) {
mi = min(mi, ((i % 2019) * (j % 2019)) % 2019);
}
}
put(mi)
return 0;
} | 1 |
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef vector <int> vi;
int main(void){
map <char, int> m;
vi x;
int num[] = {1,5,10,50,100,500,1000};
for (int i=0; i<7; i++)
m["IVXLCDM"[i]] = num[i];
while (true){
string roman;
cin>>roman;
if (cin.eof()) break;
int tmp, tmp2= m[roman[0]];
for (int i=0; i<(int)roman.size(); i++){
tmp = m[roman[i]];
if (i!=0 && tmp2<tmp)
x[i-1] = -tmp2;
x.push_back(tmp);
tmp2 = tmp;
}
int s=0;
for (int i=0; i<(int)x.size(); i++)
s += x[i];
cout<<s<<endl;
x.clear();
}
} | #include<iostream>
#include<string>
using namespace std;
int main(){
long i,l,m,n,y;
string s;
while(cin>>s){
l=s.size();
y=0;m=1001;
for(i=0;i<l;i++){
if(s[i]=='I')n=1;
else if(s[i]=='V')n=5;
else if(s[i]=='X')n=10;
else if(s[i]=='L')n=50;
else if(s[i]=='C')n=100;
else if(s[i]=='D')n=500;
else if(s[i]=='M')n=1000;
if(m<n)y-=m*2;
y+=n;
m=n;
}
cout<<y<<endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template<typename T>
#define TTF template<typename T, typename F>
#define ET(T) typename T::value_type
TT inline T sq(T x){return x*x;}
TT inline T In(){T x;cin>>x;return x;}
TT inline void Out(T&x){cout<<x;}
TT inline void sort(T&v){sort(begin(v),end(v));}
TT inline void revs(T&v){reverse(begin(v),end(v));}
TT inline void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT inline int ubnd(T&v,ET(T)&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT inline int lbnd(T&v,ET(T)&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF inline void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF inline void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
#undef TT
#undef TTF
#undef ET
inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000;
struct Edge {
int f, t, c;
Edge(int f, int t, int c) : f(f), t(t), c(c) {}
bool operator<(const Edge& e) const { return c != e.c ? c > e.c : (f != e.f ? f < e.f : t < e.t); }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
int dijkstra(const Graph& g, int s, int t){
int vis[128];
fill(begin(vis), end(vis), 0);
priority_queue<Edge> pq;
for (pq.push(Edge(-2, s, 0)); !pq.empty(); pq.pop()){
Edge e = pq.top();
if (vis[e.t]++) continue;
if (e.t == t) return e.c;
for (const auto& ee : g[e.t]){
pq.push(Edge(e.f, ee.t, e.c + ee.c));
}
}
return -1;
}
int main()
{
int n, k;
while (cin >> n >> k, n || k){
Graph g(n + 1);
for (int i = 0; i < k; i++){
int t = in();
if (t){
int a, b, c;
cin >> a >> b >> c;
g[a].push_back(Edge(a, b, c));
g[b].push_back(Edge(b, a, c));
}
else {
int a, b;
cin >> a >> b;
cout << dijkstra(g, a, b) << endl;
}
}
}
return (0);
}
// priority_queue queue deque front stringstream max_element min_element insert count make_tuple | #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()
const int INF = 1e9;
int dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
int cost[100][100];
int main()
{
int N, M;
while (cin>>N>>M, N) {
rep(i, N) rep(j, N) cost[i][j] = (i==j?0:INF);
rep(i, M) {
int q; cin>>q;
if (q==0) {
int a, b;
cin>>a>>b; a--, b--;
cout << (cost[a][b] < INF ? cost[a][b] : -1) << endl;
} else {
int a, b, c;
cin>>a>>b>>c; a--, b--;
for (int i=0; i<N; i++) {
for (int j=0; j<N; j++) {
cost[i][j] = min({cost[i][j], cost[i][a] + cost[j][b] + c, cost[i][b]+ cost[j][a] + c});
}
}
}
}
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
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++;
swap(A[i],A[j]);
}
}
swap(A[i+1],A[r]);
return i+1;
}
signed main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];
int k=partition(A,0,n-1);
for(int i=0;i<n;i++){
if(i) cout<<" ";
if(i==k) cout<<"[";
cout<<A[i];
if(i==k) cout<<"]";
}
cout<<endl;
return 0;
} | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
vector<int>bitSearch(int bit,int n){
vector<int>S;
rep(i,n)if(bit&(1<<i))S.push_back(i);
return S;
}
ll gcd(ll a,ll b){
if(b==0)return a;
return gcd(b,a%b);
}
const int mod = INF+7;
int main(){
int n;cin>>n;
string a,b,c;cin>>a>>b>>c;
int res = 0;
rep(i,n){
int cnt = 1;
if(a[i]==b[i])cnt++;
if(b[i]==c[i])cnt++;
if(c[i]==a[i])cnt++;
if(cnt>3)cnt--;
res += 3-cnt;
}
cout<<res<<endl;
}
| 0 |
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define DEBUG(x) cerr << #x << ": " << x << "\n"
#define DEBUG2(x, y) cerr << #x << ": " << x << " " << #y << ": " << y << "\n"
#define DEBUG3(x, y, z) cerr << #x << ": " << x << " " << #y << ": " << y << " " << #z << ": " << z << "\n"
#define PRINTALL(V) \
for (auto v : (V)) { \
cerr << v << " "; \
} \
cerr << "\n";
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
template <class T> void print2(const T &x, const T &y) { cout << x << " " << y << "\n"; }
template <class T> void print3(const T &x, const T &y, const T &z) { cout << x << " " << y << " " << z << "\n"; }
const int MOD = 998244353, INF = 1061109567, INF2 = INF * INF;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int binpow(int a, int 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;
}
const int FACTSIZE = 100100;
int fact[FACTSIZE];
int revfact[FACTSIZE];
int ncr(int n, int r) {
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
int rs = fact[n] * revfact[r];
if (rs >= MOD) rs %= MOD;
rs *= revfact[n - r];
if (rs >= MOD) rs %= MOD;
return rs;
}
void init() {
fact[0] = 1, revfact[0] = 1;
for (int i = 1; i < FACTSIZE; ++i) {
fact[i] = fact[i - 1] * i % MOD;
revfact[i] = binpow(fact[i], MOD - 2, MOD);
}
}
signed main() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
init();
int K, N;
cin >> K >> N;
vec<int> res(2 * K - 1, -1);
FORS(i, 2, K + 1) {
int ans = 0;
if (i % 2 == 1) {
int even = (i - 1) / 2;
FORS(j, 0, even) {
int val = N - j * 2;
int tmp = ncr(even, j) * ncr(val + (K - 1), val);
ans += j % 2 == 0 ? tmp : -tmp;
ans %= MOD;
}
// DEBUG2(i, ans);
} else {
int even = i / 2 - 1;
FORS(j, 0, even) {
int val = N - 1 - j * 2;
// DEBUG2(val, K - 2);
int tmp = ncr(even, j) * ncr(val + (K - 2), val);
ans += j % 2 == 0 ? tmp : -tmp;
ans %= MOD;
}
FORS(j, 0, even) {
int val = N - j * 2;
int tmp = ncr(even, j) * ncr(val + (K - 2), val);
ans += j % 2 == 0 ? tmp : -tmp;
ans %= MOD;
}
// int even = i / 2;
}
ans %= MOD;
ans += MOD;
ans %= MOD;
res[i - 2] = ans;
res[(2 * K - 2) - (i - 2)] = ans;
}
REP(i, 2 * K - 1) print(res[i]);
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
int n, m, v, p, a[100005];
long long pre[100005];
int main() {
read(n), read(m), read(v), read(p);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
std::sort(a + 1, a + 1 + n, std::greater<int>());
long long sum = a[p];
int ans = p;
for (int i = p + 1; i <= n; ++i) {
if (a[i] + m >= a[p] && 1ll * (a[i] + m) * (i - p) - sum >= 1ll * m * (v - n + i - p)) {
++ans;
}
sum += a[i];
}
print(ans);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll gcd(int x, int y){ return y?gcd(y, x%y):x;}
ll lcm(ll x, ll y){ return (x*y)/gcd(x,y);}
/*
正面衝突の場合 U-D, L-R
斜め衝突の場合 U-L, L-D, D-R, R-U
*/
int x_in[200050], y_in[200050];
char c_in[200050];
vector<pair<int, char>> ur[400020];
vector<pair<int, char>> ud[400020];
int n;
int solve_UD(){
rep(i, 400020){
ud[i].clear();
}
rep(i, n){
if (c_in[i] != 'U' && c_in[i] != 'D') continue;
ud[x_in[i]].push_back(make_pair(y_in[i], c_in[i]));
}
int tmin = 2000001;
rep(i, 400020){
sort(ud[i].begin(), ud[i].end());
rep(j, ud[i].size()-1){
if (ud[i][j].second == 'U' && ud[i][j+1].second == 'D'){
tmin = min(tmin, ud[i][j+1].first - ud[i][j].first);
}
}
}
return tmin * 5;
}
int solve_UR(){
rep(i, 400020){
ur[i].clear();
}
rep(i, n){
if (c_in[i] != 'U' && c_in[i] != 'R') continue;
ur[x_in[i]+y_in[i]].push_back(make_pair(x_in[i], c_in[i]));
}
int tmin = 2000001;
rep(i, 400020){
sort(ur[i].begin(), ur[i].end());
rep(j, ur[i].size()-1){
if (ur[i][j+1].second == 'U' && ur[i][j].second == 'R')
tmin = min(tmin, ur[i][j+1].first - ur[i][j].first);
}
}
return tmin*10;
}
void rotate(){
int tmp;
rep(i, n){
tmp = x_in[i];
x_in[i] = 200000-y_in[i];
y_in[i] = tmp;
if (c_in[i] == 'U') c_in[i] = 'L';
else if (c_in[i] == 'L') c_in[i] = 'D';
else if (c_in[i] == 'D') c_in[i] = 'R';
else c_in[i] = 'U';
}
}
int main()
{
cin >> n;
rep(i, n){
cin >> x_in[i] >> y_in[i] >> c_in[i];
}
int t_time = 2000001;
rep(t, 4){
t_time = min(t_time, solve_UD());
t_time = min(t_time, solve_UR());
rotate();
}
if (t_time == 2000001) cout << "SAFE" << endl;
else cout << t_time << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
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; }
lli ans = INF;
const lli ssize = 400100;
void calc(vector<set<lli>> &lef,vector<set<lli>> &rig){
REP(i,0,ssize){
if(rig.size()==0)continue;
for(auto e:lef[i]){
auto itr = rig[i].upper_bound(e);
if(itr==rig[i].end())break;
LOG3(ans,(*itr),e);
chmin(ans,(*itr)-e);
}
}
}
void func(long long N, std::vector<long long> X, std::vector<long long> Y, std::vector<std::string> U){
{
//LR combination
vector<set<lli>> lef(ssize),rig(ssize);
REP(i,0,N){
if(U[i]=="R")lef[Y[i]].insert(X[i]);
else if(U[i]=="L")rig[Y[i]].insert(X[i]);
}
calc(lef,rig);
}
{
//UD combination
vector<set<lli>> lef(ssize),rig(ssize);
REP(i,0,N){
if(U[i]=="U")lef[X[i]].insert(Y[i]);
else if(U[i]=="D")rig[X[i]].insert(Y[i]);
}
calc(lef,rig);
}
{
//y=x+b
{
//LU combination
vector<set<lli>> lef(ssize),rig(ssize);
REP(i,0,N){
if(U[i]=="U")lef[X[i]-Y[i]+ssize/2].insert(X[i]*2);
else if(U[i]=="L")rig[X[i]-Y[i]+ssize/2].insert(X[i]*2);
}
calc(lef,rig);
}
{
//RD combination
vector<set<lli>> lef(ssize),rig(ssize);
REP(i,0,N){
if(U[i]=="R")lef[X[i]-Y[i]+ssize/2].insert(X[i]*2);
else if(U[i]=="D")rig[X[i]-Y[i]+ssize/2].insert(X[i]*2);
}
calc(lef,rig);
}
}
{
//y=-x+b
{
//LD combination
vector<set<lli>> lef(ssize),rig(ssize);
REP(i,0,N){
if(U[i]=="D")lef[X[i]+Y[i]].insert(X[i]*2);
else if(U[i]=="L")rig[X[i]+Y[i]].insert(X[i]*2);
}
calc(lef,rig);
}
{
//RU combination
vector<set<lli>> lef(ssize),rig(ssize);
REP(i,0,N){
if(U[i]=="R")lef[X[i]+Y[i]].insert(X[i]*2);
else if(U[i]=="U")rig[X[i]+Y[i]].insert(X[i]*2);
}
calc(lef,rig);
}
}
if(ans==INF){
cout<<"SAFE"<<endl;
}
else{
cout<<ans*5<<endl;
}
}
int main(){
// cout << fixed << setprecision(5);
long long N;
scanf("%lld",&N);
std::vector<long long> X(N);
std::vector<long long> Y(N);
std::vector<std::string> U(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&X[i]);
scanf("%lld",&Y[i]);
std::cin >> U[i];
}
func(N, std::move(X), std::move(Y), std::move(U));
return 0;
}
| 1 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
vector<ll> v(4);
char c;
rep(i,4){
cin>>c;
v[i]=atoll(&c);
}
if(v[0]+v[1]+v[2]+v[3]==7) {cout<<v[0]<<'+'<<v[1]<<'+'<<v[2]<<'+'<<v[3]<<"=7"<<endl;
}else if(v[0]+v[1]+v[2]-v[3]==7) {cout<<v[0]<<'+'<<v[1]<<'+'<<v[2]<<'-'<<v[3]<<"=7"<<endl;
}else if(v[0]+v[1]-v[2]+v[3]==7) {cout<<v[0]<<'+'<<v[1]<<'-'<<v[2]<<'+'<<v[3]<<"=7"<<endl;
}else if(v[0]+v[1]-v[2]-v[3]==7) {cout<<v[0]<<'+'<<v[1]<<'-'<<v[2]<<'-'<<v[3]<<"=7"<<endl;
}else if(v[0]-v[1]+v[2]+v[3]==7) {cout<<v[0]<<'-'<<v[1]<<'+'<<v[2]<<'+'<<v[3]<<"=7"<<endl;
}else if(v[0]-v[1]+v[2]-v[3]==7) {cout<<v[0]<<'-'<<v[1]<<'+'<<v[2]<<'-'<<v[3]<<"=7"<<endl;
}else if(v[0]-v[1]-v[2]+v[3]==7) {cout<<v[0]<<'-'<<v[1]<<'-'<<v[2]<<'+'<<v[3]<<"=7"<<endl;
}else if(v[0]-v[1]-v[2]-v[3]==7) {cout<<v[0]<<'-'<<v[1]<<'-'<<v[2]<<'-'<<v[3]<<"=7"<<endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef pair<int, int> ii;
const int N = 5e3 + 5;
int n, sum;
vector< pair<int, ii> > vec;
priority_queue<int> pq;
int main () {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
int h, p; cin >> h >> p;
vec.pb( { h + p, { h, p } } );
}
sort(vec.begin(), vec.end() );
for (auto i : vec) {
if(sum <= i.se.fi) {
pq.push(i.se.se);
sum += i.se.se;
}
else {
if(i.se.se < pq.top() ) {
sum -= pq.top(); pq.pop();
sum += i.se.se; pq.push(i.se.se);
}
}
}
cout << pq.size();
return 0;
}
| 0 |
#include<iostream>
#include<list>
#include<queue>
#include<set>
#include<algorithm>
#include<stdio.h>
using namespace std;
int n, m;
struct Node {
//int id;
list<int> next;
};
Node graph[100005];
int prenum[100005];
int parent[100005];
int lowest[100005];
set<int> answer;
int rootCount;
void dfs(int curNodeId,int step) {
int low = prenum[curNodeId];
list<int>::iterator it = graph[curNodeId].next.begin();
list<int>::iterator end = graph[curNodeId].next.end();
for (it; it != end; it++) {
int id = *it;
if (prenum[id] == 0) {
parent[id] = curNodeId;
prenum[id] = step + 1;
dfs(id, step + 1);
low = min(low, lowest[id]);
if (step == 1) {
rootCount++;
}
}
else {
low = min(low, prenum[id]);
}
}
lowest[curNodeId] = low;
}
void findArticulationPoint() {
if (rootCount >= 2) {
answer.insert(0);
}
int p;
for (int i = 1; i < n; i++) {
p = parent[i];
if (p == 0) {
continue;
}
if (prenum[p] <= lowest[i]) {
answer.insert(p);
}
}
vector<int> ans;
for (set<int>::iterator it = answer.begin(); it != answer.end(); it++) {
ans.push_back(*it);
}
sort(ans.begin(), ans.end());
for (vector<int>::iterator it = ans.begin(); it != ans.end(); it++) {
printf("%d\n", *it);
}
}
int main() {
scanf("%d %d", &n,&m);
int a, b;
for (int i = 0; i < m; i++) {
scanf("%d %d", &a,&b);
graph[a].next.push_back(b);
graph[b].next.push_back(a);
}
prenum[0] = 1;
dfs(0,1);
findArticulationPoint();
/*for (int i = 0; i < n; i++) {
cout << i << " " << prenum[i] << " " << parent[i] << " " << lowest[i] << endl;
}*/
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <complex>
#include <cmath>
#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 <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;
struct node {int to,cost; };
typedef vector< vector<node> > G;
inline void add_edge(G& g,int from,int to,int cost=1){
node in; in.to=to; in.cost=cost;
g[from].pb(in);
}
inline void add_both_edge(G& g,int from,int to,int cost=1){
add_edge(g,from,to,cost);
add_edge(g,to,from,cost);
}
void dfs(const G& g,int cur,int prev,int &k,vi& order, vi& low,vi& parent) {
order[cur]=k++;
low[cur]=order[cur];
rep(i,g[cur].size()){
int to=g[cur][i].to;
if(order[to]==-1){
parent[to]=cur;
dfs(g,to,cur,k,order,low,parent);
low[cur]=min(low[cur],low[to]);
}else if(to!=prev)
low[cur]=min(low[cur],order[to]);
}
return;
}
void Lowlink(const G& g, vi& order,vi& low,vi& parent) {
int v=g.size();
order.assign(v,-1);
low.resize(v);
parent.resize(v);
int k=0;
parent[0]=-1;
dfs(g,0,-1,k,order,low,parent);
return ;
}
int main(void){
int n,m;
cin >> n >> m;
G graph(n);
rep(i,m){
int a,b;
cin >> a >> b;
add_both_edge(graph,a,b);
}
vi order,low,parent;
Lowlink(graph,order,low,parent);
rep(i,n){
if(i){
bool ok=false;
rep(j,graph[i].size()){
int to=graph[i][j].to;
if(i==parent[to]&&order[i]<=low[to])
ok=true;
}
if(ok) cout << i << endl;
}else{
int d=0;
rep(j,n) if(parent[j]==0) d++;
if(d>=2) cout << i << endl;
}
}
return 0;
} | 1 |
#include<iostream>
using namespace std;
int n,x,y,z;
long mod=1e9+7,dp[41][1<<17];
main()
{
cin>>n>>x>>y>>z;
int no=1<<z-1|1<<y+z-1|1<<x+y+z-1;
dp[0][0]=1;
long ans=1;
for(int i=0;i<n;i++)
{
for(int j=1;j<=10;j++)
{
for(int k=0;k<1<<17;k++)
{
int nxt=(k<<j|1<<j-1)&(1<<17)-1;
if((nxt&no)!=no)(dp[i+1][nxt]+=dp[i][k])%=mod;
}
}
(ans*=10)%=mod;
}
for(int i=0;i<1<<17;i++)ans=(ans-dp[n][i]+mod)%mod;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
long long D[201][100001], MOD=1000000007;
int main()
{
int n, x, a;
cin >> n >> x;
vector <int> A;
for (int i = 0; i < n; i++)
{
cin >> a;
A.push_back(a);
}
sort(A.begin(),A.end());
for (int i = 0; i <= x; i++)
{
for (int y = 1; y <= n; y++)
{
D[y][i] = 0;
}
D[0][i] = i;
}
for (int i = 0; i < n; i++)
{
for (int y = 0; y <= x; y++)
{
D[i+1][y] += D[i][y] * i;
D[i+1][y] %= MOD;
D[i+1][y] += D[i][y % A[i]];
D[i+1][y] %= MOD;
}
}
cout << D[n][x];
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<cstring>
#include<fstream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const int MAXN=1e5+5;
int tot,head[MAXN];
LL dist[MAXN];
bool vis[MAXN];
struct Edge
{
int from,to,nxt;
LL cost;
}e[MAXN*2];
void addedge(int u,int v,int w)
{
e[tot].from=u;
e[tot].to=v;
e[tot].cost=w;
e[tot].nxt=head[u];
head[u]=tot++;
}
void dfs(int u,int fa)
{
for(int i=head[u];i!=-1;i=e[i].nxt)
{
int to=e[i].to;
if(to==fa) continue;
dist[to]=dist[u]+e[i].cost;
dfs(to,u);
}
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
tot=0;
memset(head,-1,sizeof(head));
memset(dist,0,sizeof(dist));
int u,v;
LL w;
for(int i=1;i<=n-1;i++)
{
scanf("%d%d%lld",&u,&v,&w);
addedge(u,v,w);
addedge(v,u,w);
}
int q,k;
scanf("%d%d",&q,&k);
dfs(k,-1);
// for(int i=1;i<=n;i++)
// cout<<dist[i]<<" ";
// cout<<endl;
int x,y;
for(int i=1;i<=q;i++)
{
scanf("%d%d",&x,&y);
printf("%lld\n",dist[x]+dist[y]);
}
}
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
struct Edge{
Edge(int arg_to,ll arg_dist){
to = arg_to;
dist = arg_dist;
}
int to;
ll dist;
};
vector<Edge> G[SIZE]; //グラフの隣接リスト表現
int N; //ノードの個数
int root; //根ノードの番号
int MAX_LOG_V = 17;
int POW[18];
int parent[18][SIZE];
int depth[SIZE];
ll DIST[SIZE];
//parentとdepthを再帰的に設定
void dfs(int node_id,int parent_id,int d){
parent[0][node_id] = parent_id;
depth[node_id] = d;
for(int i = 0; i < G[node_id].size(); i++){
if(G[node_id][i].to != parent_id){
DIST[G[node_id][i].to] = DIST[node_id]+G[node_id][i].dist;
dfs(G[node_id][i].to,node_id,d+1);
}
}
}
//初期化
void init(){
//parent[0]とdepthを初期化する
dfs(root,-1,0);
//parentを初期化する
for(int k = 0; k + 1 < MAX_LOG_V; k++){
for(int node_id = 0; node_id < N; node_id++){
if(parent[k][node_id] < 0)parent[k+1][node_id] = -1; //node_idの2^k上のノードがルートノードより上なら、2^(k+1)上も同様とする
else{
parent[k+1][node_id] = parent[k][parent[k][node_id]];
}
}
}
}
//leftとrightのLCAを求める
int lca(int left,int right){
//leftとrightの深さが同じになるまで親を辿る
if(depth[left] > depth[right])swap(left,right); //rightの方が深い所にいる
for(int k = MAX_LOG_V-1; k >= 0; k--){
if(depth[right]-depth[left] >= POW[k]){ //たとえば深さの差が39なら、32+4+2+1のように、ノードを上方に移動させる
right = parent[k][right];
}
}
if(left == right)return left;
for(int k = MAX_LOG_V-1; k >= 0; k--){
if(parent[k][left] == parent[k][right]){
//Do nothing
}else{
left = parent[k][left];
right = parent[k][right];
}
}
return parent[0][left]; //最後は、leftの親とrightの親が必ず一致している
}
ll calc_dist(int a,int b){
return DIST[a]+DIST[b]-2*DIST[lca(a,b)];
}
int main(){
POW[0] = 1;
for(int i = 1; i <= 17; i++){
POW[i] = POW[i-1]*2;
}
scanf("%d",&N);
int from,to;
ll dist;
for(int i = 0; i < N-1; i++){
scanf("%d %d %lld",&from,&to,&dist);
from--;
to--;
G[from].push_back(Edge(to,dist));
G[to].push_back(Edge(from,dist));
}
root = 0;
DIST[root] = 0;
init();
int num_query,K;
int x,y;
scanf("%d %d",&num_query,&K);
K--;
for(int loop = 0; loop < num_query; loop++){
scanf("%d %d",&x,&y);
x--,y--;
printf("%lld\n",calc_dist(x,K)+calc_dist(K,y));
}
return 0;
}
| 1 |
/**
* author: otera
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << 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 n, m;
vector<vector<int>> a;
void solve() {
cin >> n >> m;
a.assign(n, vector<int>(m));
rep(i, n) {
rep(j, m) {
cin >> a[i][j];
-- a[i][j];
}
}
vector<int> used(n, 0), check(m, 1);
int ans = n;
int cnt = 0;
while(true) {
map<int, int> mp;
rep(i, n) {
while(used[i] < m && !check[a[i][used[i]]]) {
used[i] ++;
}
mp[a[i][used[i]]] ++;
}
set<int> se; int ma = 0;
for(auto p: mp) {
if(ma == p.sc) {
se.insert(p.fr);
} else if(ma < p.sc) {
se.clear();
ma = p.sc;
se.insert(p.fr);
}
}
chmin(ans, ma);
for(auto j: se) {
check[j] = 0;
++ cnt;
}
if(cnt == m) break;
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int res,ll,rr,uu,dd,ad,R,L,D,U,sx,sy,h,w,pr[105][105],pc[105][105],dp[105][105][105];
char s[105][105];
int main()
{
scanf("%d%d",&h,&w);
for (int i=1;i<=h;++i)
scanf("%s",s[i]+1);
for (int i=1;i<=h;++i)
for (int j=1;j<=w;++j) {
pr[i][j]=pr[i-1][j]+(s[i][j]=='o');
pc[i][j]=pc[i][j-1]+(s[i][j]=='o');
if (s[i][j]=='E')
sx=i,sy=j;
}
memset(dp,-1,sizeof dp);
dp[0][0][0]=0;
L=sy-1,R=w-sy,U=sx-1,D=h-sx;
for (int l=0;l<=L;++l)
for (int r=0;r<=R;++r)
for (int u=0;u<=U;++u)
for (int d=0;d<=D;++d) {
if (dp[r][u][d]==-1)
continue;
rr=min(sy+r,w-l);
ll=max(sy-l,r+1);
uu=max(sx-u,d+1);
dd=min(sx+d,h-u);
res=max(res,dp[r][u][d]);
if (l+r<R) {
ad=pr[dd][sy+r+1]-pr[uu-1][sy+r+1];
dp[r+1][u][d]=max(dp[r+1][u][d],dp[r][u][d]+ad);
}
if (u+d<U) {
ad=pc[sx-u-1][rr]-pc[sx-u-1][ll-1];
dp[r][u+1][d]=max(dp[r][u+1][d],dp[r][u][d]+ad);
}
if (u+d<D) {
ad=pc[sx+d+1][rr]-pc[sx+d+1][ll-1];
dp[r][u][d+1]=max(dp[r][u][d+1],dp[r][u][d]+ad);
}
if (l+r<L) {
ad=pr[dd][sy-l-1]-pr[uu-1][sy-l-1];
dp[r][u][d]=max(dp[r][u][d],dp[r][u][d]+ad);
}
}
printf("%d\n",res);
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main()
{
int a[5000];
int left[5000], right[5000];
int n;
while (true) {
cin >> n;
if (n==0) break;
bool existsPos = false;
for (int i=0; i<n; i++) {
cin >> a[i];
if (a[i] > 0) existsPos = true;
}
int maximum;
if (existsPos) {
int left_max = a[0];
int left_max_pos = 0;
left[0] = a[0];
for (int i=1; i<n; i++) {
left[i] = left[i-1] + a[i];
if (left[i] > left_max) {
left_max = left[i]; left_max_pos = i;
}
}
int right_max = a[n-1];
int right_max_pos = n-1;
right[n-1] = a[n-1];
for (int i=n-2; i>=0; i--) {
right[i] = right[i+1] + a[i];
if (right[i] > right_max) {
right_max = right[i]; right_max_pos = i;
}
}
maximum = 0;
for (int i = right_max_pos; i <= left_max_pos; i++) maximum += a[i];
}
else {
maximum = -100000;
for (int i=0; i<n; i++) {
if (a[i] > maximum) maximum = a[i];
}
}
cout << maximum << endl;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main(){
int sum;
string st;
map <char,int> code;
code['I']=1;
code['V']=5;
code['X']=10;
code['L']=50;
code['C']=100;
code['D']=500;
code['M']=1000;
while(cin>>st){
sum=0;
for(int i=0;i<st.size()-1;i++){
if(code[st[i]]<code[st[i+1]])
sum-=code[st[i]];
else
sum+=code[st[i]];
}
printf("%d\n",sum+code[st[st.size()-1]]);
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define fordebug int hoge;cin>>hoge;
#define DEKAI 1000000007;
#define INF 2000000000
#define int long long
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
int a[100000];
int partition(int p,int r){
int x=a[r];
int i=p-1;
lps(j,p,r){
if(a[j]<=x){
i++;
swap(a[i],a[j]);
}
}
swap(a[i+1],a[r]);
return i+1;
}
signed main(){
int n;
cin>>n;
lp(i,n) cin>>a[i];
int p=partition(0,n-1);
lp(i,n){
if(i) cout<<" ";
if(i==p) cout<<"["<<a[i]<<"]";
else cout<<a[i];
}
cout<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x.size()))
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
ll x = 0; char ch = gc(); bool positive = 1;
for (; !isdigit(ch); ch = gc()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = gc()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(ll a){
if(a<0){
a=-a; putchar('-');
}
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(ll a){write(a); puts("");}
inline void wri(ll a){write(a); putchar(' ');}
ll rnd(){
ull ans=0;
For(i,0,4)ans=ans<<15^rand();
return ans%((ull)1<<63);
}
int main(){
#ifdef Brollan
freopen("1.in","r",stdin);
#endif
int h1=read(),m1=read(),h2=read(),m2=read(),k=read();
cout<<(h2-h1)*60+m2-m1-k<<endl;
}
| 0 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,i,j,k,l,x,y;
short f[105][105][105][105],ans,s1[105][105],s2[105][105],z;
char s[105][105];
int main()
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i)
{
scanf("%s",s[i]+1);
for(j=1;j<=m;++j)
{
s1[i][j]=s1[i][j-1]+(s[i][j]=='o'?1:0);
if(s[i][j]=='E')
x=i,y=j;
}
}
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
s2[i][j]=s2[i][j-1]+(s[j][i]=='o'?1:0);
f[0][0][0][0]=0;
for(i=0;i<x;++i)
for(j=0;j<=n-x;++j)
for(k=0;k<y;++k)
for(l=0;l<=m-y;++l)
{
ans=max(ans,f[i][j][k][l]);
int lx=j+1,rx=n-i,ly=l+1,ry=m-k;
//printf("%d %d %d %d %d %d %d %d %d\n",i,j,k,l,f[i][j][k][l],lx,rx,ly,ry);
if(i+1<x)
f[i+1][j][k][l]=max((int)f[i+1][j][k][l],f[i][j][k][l]+(x-i-1>=lx&&x-i-1<=rx?s1[x-i-1][min(y+l,ry)]-s1[x-i-1][max(y-k,ly)-1]:0));
if(j+1<=n-x)
f[i][j+1][k][l]=max((int)f[i][j+1][k][l],f[i][j][k][l]+(x+j+1>=lx&&x+j+1<=rx?s1[x+j+1][min(y+l,ry)]-s1[x+j+1][max(y-k,ly)-1]:0));
if(k+1<y)
f[i][j][k+1][l]=max((int)f[i][j][k+1][l],f[i][j][k][l]+(y-k-1>=ly&&y-k-1<=ry?s2[y-k-1][min(x+j,rx)]-s2[y-k-1][max(x-i,lx)-1]:0));
if(l+1<=m-y)
f[i][j][k][l+1]=max((int)f[i][j][k][l+1],f[i][j][k][l]+(y+l+1>=ly&&y+l+1<=ry?s2[y+l+1][min(x+j,rx)]-s2[y+l+1][max(x-i,lx)-1]:0));
}
printf("%hd",ans);
return 0;
}
| #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n, k;
cin >> n >> k;
// n = 200000;
// k = 100000;
if (n <= k + 1)
{
for(int i = 0; i < n; ++i) cout << n << " ";
return;
}
vector<int> a(n + 1, 0);
for(int i = 0; i < n; ++i)
{
// a[i] = 1;
cin >> a[i];
}
for(int i = 0; i < k; ++i)
{
vector<int> next_a(n + 1, 0);
for(int j = 0; j < n; ++j)
{
next_a[ max(0, j - a[j]) ]++;
next_a[ min(n, j + a[j] + 1) ]--;
// cout << "add " << max(0, j - a[j]) << ", " << min(n, j + a[j] + 1) << endl;
}
int max_cd_num = 0;
for(int j = 0; j < n; ++j)
{
next_a[j + 1] += next_a[j];
max_cd_num += (next_a[j] == n);
}
a = next_a;
if (max_cd_num >= n) break;
}
for(int i = 0; i < n; ++i) cout << a[i] << " ";
}
int main()
{
fastio;
solve();
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
bool p[101000];
void prime() {
fill(p, p+101000, true);
p[0] = false;
p[1] = false;
for(int i = 2; i < 101000; i++) {
if(p[i]) {
for(int j = 2; i*j < 101000; j++) {
p[i*j] = false;
}
}
}
}
int main() {
int n;
prime();
while(cin >> n, n) {
int ans;
for(int i = 0; i <= n; i++) {
if(p[i] && p[i-2]) ans = i;
}
cout << ans-2 << ' ' << ans << endl;
}
} | #include<stdio.h>
int isprime(int n){
for(int i = 2; i * i <= n; i++){
if(n % i == 0)return 0;
}
return 1;
}
int main(){
int v;
while(scanf("%d", &v) != EOF) {
if(v == 0){
break;
}
while(1){
if(isprime(v) == 1 && isprime(v - 2) == 1){
printf("%d %d\n", v - 2, v);
break;
}else{
v--;
}
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<bool> seen(1'000'000'000);
bool ans = true;
for (int i = 0; i < n; ++i)
{
int a;
cin >> a;
if (seen[a])
ans = false;
seen[a] = true;
}
cout << (ans ? "YES" : "NO") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,ans=0,cnt=0;
string s;
cin>>a>>b;
cin>>s;
for(int i=0; i<a; i++)
{
if(s[i]-'0'<0||s[i]-'0'>9)
{
cout<<"No";
return 0;
}
}
if(s[a]!='-')
{
cout<<"No";
return 0;
}
for(int i= a+1 ; i <a+b+1 ; i++)
{
if(s[i]-'0'<0||s[i]-'0'>9)
{
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
}
| 0 |
//Now you are making me a boy with luvv...
//I don't want to do this but I'm being forced to ....pls help!!
#include <bits/stdc++.h>
using namespace std;
#define loop(x,n) for(int x = 0; x < n; ++x)
#define ed end()
#define bg begin()
# define ld long double
#define ll long long
#define ub(v,a) upper_bound(all(v),a)
#define lb(v,a) lower_bound(all(v),a)
#define sz(a) (int)(a.size())
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define tr(v,it) for(auto it=v.begin();it!=v.end();it++)
#define present(v,x) (v.find(x)!=v.end()) //set/map etc.
#define vpresent(v,x) (find(all(v),x)!=v.end()) // vector
typedef vector< int > vi;
typedef vector< long long > vll;
typedef vector<pair<ll,ll>> vp;
typedef vector< vi > vvi;
typedef pair< int,int > pii;
const long long max_sz = 1e5 + 1;
const long long mod = 1e9 + 7;
const long long MAXN = 4e18 + 1;
char flip(char k){ if(k=='0') return '1'; return '0'; }
ll sum_digit(ll n){ ll a=0,i; for(i=n;i>0;i=i/10){ a+=(i%10);} return a; }
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(){
// ios_base::sync_with_stdio(false);
//cin.tie(NULL);
//cout.tie(NULL);
ll t;
// cin >> t;
t=1;
while (t--){
ll h1,m1,h2,m2,k;cin>>h1>>m1>>h2>>m2>>k;
if(m2>m1){
ll diff=(h2-h1)*60 + m2-m1;
cout<<diff-k<<endl;
}
else{
ll diff=(h2-h1)*60 +m2-m1;
cout<<diff -k<<endl;
}
}
cerr << endl
<< "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
return 0;
}
| #include <iostream>
#include <cstring>
#include <cstdio>
#define Maxn 4010
#define Maxm 4010
using namespace std;
int read() {
int x = 0,f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while('0' <= c && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
int N,M,Q;
int mp[Maxn][Maxm],sum1[Maxn][Maxm],sum2[Maxn][Maxm];
int main() {
N = read(); M = read(); Q = read();
char ch;
for(int i = 1;i <= N; i++)
for(int j = 1;j <= M; j++) {
int x = i * 2 - 1,y = j * 2 - 1;
ch = getchar();
while(ch != '0' && ch != '1') ch = getchar();
if(ch == '1') mp[x][y] = 1;
}
for(int i = 1;i <= N; i++)
for(int j = 1;j <= M; j++) {
int x = i * 2 - 1,y = j * 2 - 1;
if(mp[x][y]) {
if(mp[x - 2][y]) mp[x - 1][y] = 2;
if(mp[x + 2][y]) mp[x + 1][y] = 2;
if(mp[x][y + 2]) mp[x][y + 1] = 2;
if(mp[x][y - 2]) mp[x][y - 1] = 2;
}
}
for(int i = 1;i < N * 2; i++)
for(int j = 1;j < M * 2; j++) {
if(mp[i][j] == 1) sum1[i][j] = sum1[i - 1][j] + sum1[i][j - 1] - sum1[i - 1][j - 1] + 1;
else sum1[i][j] = sum1[i - 1][j] + sum1[i][j - 1] - sum1[i - 1][j - 1];
if(mp[i][j] == 2) sum2[i][j] = sum2[i - 1][j] + sum2[i][j - 1] - sum2[i - 1][j - 1] + 1;
else sum2[i][j] = sum2[i - 1][j] + sum2[i][j - 1] - sum2[i - 1][j - 1];
}
int i_1,j_1,i_2,j_2,x_1,y_1,x_2,y_2;
for(int k = 1;k <= Q; k++) {
i_1 = read(); j_1 = read(); i_2 = read(); j_2 = read();
x_1 = i_1 * 2 - 1; y_1 = j_1 * 2 - 1;
x_2 = i_2 * 2 - 1; y_2 = j_2 * 2 - 1;
int ans1 = sum1[x_2][y_2] + sum1[x_1 - 1][y_1 - 1] - sum1[x_2][y_1 - 1] - sum1[x_1 - 1][y_2];
int ans2 = sum2[x_2][y_2] + sum2[x_1 - 1][y_1 - 1] - sum2[x_2][y_1 - 1] - sum2[x_1 - 1][y_2];
printf("%d\n",ans1 - ans2);
}
return 0;
} | 0 |
#include <stdio.h>
int main(){
int X,Y,Z;
int *px,*py,*pz;
scanf("%d",&X);
scanf("%d",&Y);
scanf("%d",&Z);
px = &Z;
py = &X;
pz = &Y;
printf("%d %d %d",*px,*py,*pz);
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,z;
cin>>x>>y>>z;
int temp = x;
x = y;
y = temp;
int temp2 = x;
x = z;
z = temp2;
cout<<x<<" "<<y<<" "<<z;
return 0;
} | 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a,b,c,i,d;
cin>>a>>b>>c;
i=c;
d=b;
while(a>b){
b=b+d;
c=c+i;
}
cout<<c;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> void chmax(T& a, T b){ if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b){ if (a > b) { a = b; } }
int main() {
int n, x, t;
cin >> n >> x >> t;
cout << (n + x - 1) / x * t << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
map<ll, int> mp;
cin >> N;
for (int i = 0; i < N; i++) {
ll A;
cin >> A;
mp[A]++;
}
int ans = 0;
for (auto ite = mp.rbegin(); ite != mp.rend(); ++ite) {
if (ite->second == 0) continue;
ll x = pow(2, floor(log2(ite->first)) + 1);
auto ite1 = mp.lower_bound(x - ite->first);
if (ite1->first + ite->first == x) {
if (ite1->first == ite->first) {
int c = ite->second / 2;
ite->second -= c;
ite1->second -= c;
ans += c;
} else {
int c = min(ite->second, ite1->second);
ite->second -= c;
ite1->second -= c;
ans += c;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef multiset<ll> S;
typedef priority_queue<ll> PQ;
typedef priority_queue<P,vector<P>,greater<P>> SPQ;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())outp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size()){rep(j,v[i].size()){if(j)cout<<' ';cout<<v[i][j];}cout<<'\n';}}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
int main(){
ll n,ans=0;cin>>n;
multiset<ll> v;
rep(i,n){
ll a;cin>>a;
v.insert(a);
}
while(!v.empty()){
auto it=v.end();
it--;
ll k=1;
while(k<=*it)k*=2;
k=k-*it;
v.erase(it);
auto w=v.lower_bound(k);
if(*w==k){
ans++;
v.erase(w);
}
}
out(ans);
} | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
typedef long long ll;
using namespace std;
/*
class LightSwitchingPuzzle
{
public:
int minFlips(string s)
{
}
}
*/
int main()
{
int n, m;
while (cin >> n >> m, n | m)
{
int p[n];
REP(n) cin >> p[i];
sort(p, p + n);
int sum = 0, cnt = 0;
for (int i=n-1; i>=0; i--)
{
cnt++;
if (cnt == m)
{
cnt = 0;
continue;
}
sum += p[i];
}
cout << sum << endl;
/*
//テスト出力
REP(n) cout << p[i] << " ";
*/
}
return 0;
} | #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(int i = 1; i <= n; i ++)
#define ITER(c) __typeof((c).begin())
#define each(c, it) for(ITER(c) it =(c).begin(); it!=(c).end(); it++)
#define ALL(c) c.begin(), c.end()
#define mp make_pair
#define pb push_back
#define MEMSET(v, h) memset((v), h, sizeof(v))
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
const int INF = 1 << 24;
int main(void){
for(int n, m, s; s = 0, cin >> n >> m, n; cout << s << endl){
priority_queue<int> p;
rep(i, n){
int in; cin >> in;
p.push(in);
}
COUNT(i, n){
if(i % m) s += p.top();
p.pop();
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define pb push_back
#define pf push_front
int gcd(int a,int b){/*a>=0,b>=0,￢(a=b=0)*/
while(min(a,b)>0){if(a<b)swap(a,b);a%=b;}return max(a,b);
}
int dx[]={1,0,-1,0,1,-1,-1,1};
int dy[]={0,1,0,-1,1,1,-1,-1};
const int MOD = 1e9+7;
const long long INF = 1e18+10;
/*--------------------------------------------------------------------*/
signed main(){
int n;
cin>>n;
int a[17];
int x[17][17];
int y[17][17];
rep(i,n){
cin>>a[i];
rep(j,a[i]){
cin>>x[i][j]>>y[i][j];
}
}
int ans=0;
rep(bit,1<<n){
int shoujiki[17];
rep(i,n){
if(bit&(1<<i)) shoujiki[i]=1;
else shoujiki[i]=0;
}
int to[17][17];
int ok=1;
rep(i,n){
if(shoujiki[i]){
rep(j,a[i]){
if(y[i][j]){
if(shoujiki[x[i][j]-1]==0) ok=0;
}else{
if(shoujiki[x[i][j]-1]==1) ok=0;
}
}
}
}
if(ok){
int cnt=0;
rep(i,n){
if(shoujiki[i]==1) cnt++;
}
chmax(ans,cnt);
}
}
cout<<ans<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD=1000000007;
LL nol[60],satu[60];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
LL a;
cin >> n;
for(int i=1;i<=n;i++){
cin >> a;
for(int j=0;j<60;j++){
if(a & (1LL<<j))satu[j]++;
else nol[j]++;
}
}
LL ans=0;
for(int i=0;i<60;i++){
LL byk=(nol[i]*satu[i])%MOD,res=((1LL<<i))%MOD;
ans=(ans+((byk*res)%MOD))%MOD;
}
cout << ans << '\n';
return 0;
}
| 0 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
int h,w;cin >> h >> w;
vvb bo(h,vb(w));
vector<P> v;
rep(i, h) {
rep(j, w) {
char c;cin >> c;
if(c=='#') {
bo[i][j]=true;
v.pb({i,j});
}
else bo[i][j]=false;
}
}
bool ok = true;
rep(i, v.size()) {
rep(j, 4) {
int x=v[i].first+dx[j],y=v[i].second+dy[j];
if(x<0||x>=h||y<0||y>=w||!bo[x][y]) {
// cout << i << endl;
if(j==3) {
cout << "No" << endl;
return 0;
}
continue;
}
break;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int h,w;
char s[60][60];
signed main()
{
h=read(), w=read();
for(ri int i=1;i<=h;i++) scanf("%s",s[i]+1);
for(ri int i=1;i<=h;i++)
for(ri int j=1;j<=w;j++)
if(s[i][j]=='#')
{
if(s[i-1][j]!='#'&&s[i+1][j]!='#'&&s[i][j-1]!='#'&&s[i][j+1]!='#')
{
puts("No");
return 0;
}
}
puts("Yes");
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
//Made with <3 by MinumCoklatPanas
typedef long long ll;
const ll INF = 1e9;
const ll INFF = 1e18;
const ll MAXN = 510;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
ll mul(ll x,ll y)
{
return ((x % MOD) * (y % MOD)) % MOD;
}
ll add(ll x,ll y)
{
return ((x % MOD) + (y % MOD)) % MOD;
}
ll sub(ll x,ll y)
{
ll ret = ((x % MOD) - (y % MOD)) % MOD;
if (ret < 0)
ret += MOD;
return ret;
}
ll modpow(ll x,ll y)
{
if (!y) return 1;
ll z = modpow(x,y / 2);
z = mul(z,z);
if (y & 1) z = mul(z,x);
return z;
}
ll inv(ll x)
{
return modpow(x,MOD - 2);
}
ll bagi(ll x,ll y)
{
return mul(x,inv(y));
}
ll pref[65][300010];
ll tab[300010];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
for (ll i = 1 ; i <= n ; i++)
{
for (ll j = 0 ; j < 60 ; j++)
pref[j][i] = pref[j][i - 1];
ll ta;
cin >> ta;
for (ll j = 0 ; j < 60 ; j++) if (ta & (1ll << j))
{
pref[j][i]++;
}
tab[i] = ta;
}
ll ans = 0;
for (ll i = 1 ; i <= n ; i++)
{
ll pengali = 1;
ll rem = n - i;
for (ll j = 0 ; j < 60 ; j++)
{
ll satu = pref[j][n] - pref[j][i];
ll nol = rem - satu;
// cout << j << ": " << satu << " " << nol << endl;
if (tab[i] & (1ll << j))
ans = add(ans,mul(nol,pengali));
else
{
// cout << "yo\n";
ans = add(ans,mul(satu,pengali));
}
pengali = mul(pengali,2ll);
}
// cout << ans << endl;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define loop(i,a,b) for (ll i = a; i <= b; i++)
#define rloop(i,a,b) for (ll i = a; i >= b; i--)
#define ms(a,x) memset(a,x,sizeof a)
#define ll long long int
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define nl cout<<"\n"
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/(gcd(a,b))
#define sq(a) (a)*(a)
#define sz(a) a.size()
#define mod 1000000007
#define PI 2*acos(0.0)
int main()
{
IOS
int T=1;
//cin>>T;
while(T--)
{
ll n;
cin>>n;
ll a[n];
loop(i,0,n-1) cin>>a[i];
ll res=0;
loop(i,0,60)
{
ll one=0,zero=0;
loop(j,0,n-1)
{
if(a[j] & 1ll<<i) one++;
else zero++;
}
res=((res)+(1ll<<i)%mod*one%mod*zero%mod)%mod;
}
cout<<res;
}
return 0;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<complex>
#define rep(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define R long double
#define P complex<R>
using namespace std;
const int mod = 1000000007;
const int INF = 1e12;
template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}
const R PI = acos(-1.0L);
const R inf = 1e13;
int x[110], y[110];
R ans[110];
inline R dist(int i, P q) {
P p = P(x[i], y[i]);
return norm(p - q);
}
signed main(){
int n;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>x[i]>>y[i];
}
int limit = 200000;
rep(i, 0, limit){
R cur = 2.0 * PI / limit * i;
P point = polar(inf, cur);
R d = 1e130;
int idx = -1;
rep(j, 0, n) if(chmin(d, dist(j, point))) idx = j;
ans[idx] += 1.0;
}
cout.precision(20);
rep(i, 0, n) cout << fixed << 1.0 * ans[i] / limit << endl;
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
#include <queue>
using namespace std;
int main(){
long long n;
cin >> n;
vector<vector<long long> > a(n + 1, vector<long long>(n));
for(int i = 1; i <= n; ++i){
for(int j = 1; j < n; ++j){
cin >> a[i][j];
}
}
vector<long long> round;
vector<long long> cnt(n + 1, 1);
for(int i = 1; i <= n; ++i){
if(a[a[i][1]][1] == i){
round.push_back(i);
}
}
long long ans = 0;
while(!round.empty()){
ans++;
vector<long long> nw;
for(long long i: round){
cnt[i]++;
if(cnt[i] <= n - 1){
long long x = a[i][cnt[i]];
if(i == a[x][cnt[x]]){
nw.push_back(i);
nw.push_back(x);
}
}
}
round = nw;
}
for(int i = 1; i <= n; ++i){
if(cnt[i] != n){
cout << -1;
return 0;
}
}
cout << ans;
} | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) (((x) < 0)?-(x):(x))
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge
using cat = long long;
#ifdef DONLINE_JUDGE
// palindromic tree is better than splay tree!
#define lld I64d
#endif
cat pw(cat a, cat e, cat mod) {
if(e <= 0) return 1;
cat x = pw(a, e/2, mod);
x = x * x % mod;
if(e&1) x = x * a % mod;
return x;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int N, M;
cin >> N >> M;
cat tot = 1, dif = 0, fac_inv = 1, mod = 998244353;
for(int i = 1; i < N; i++) {
tot = tot * (3*M+i) % mod;
fac_inv = fac_inv * i % mod;
}
vector<cat> prod_m1(N+3*M+1, 0), prod_m2(N+3*M+1, 0);
prod_m1[0] = fac_inv;
prod_m2[0] = fac_inv * pw(N-1, mod-2, mod) % mod;
for(int i = 0; i < M; i++) {
prod_m1[i+1] = prod_m1[i] * (i+N) % mod * pw(i+1, mod-2, mod) % mod;
prod_m2[i+1] = prod_m2[i] * (i+N-1) % mod * pw(i+1, mod-2, mod) % mod;
}
for(int i = 0; i < M; i++) dif = (dif + prod_m2[i]) % mod;
dif = dif * N % mod * (N-1) % mod;
vector<cat> C(N+1, 0); // C(N, i)
C[0] = 1;
for(int i = 1; i <= N; i++) C[i] = C[i-1] * pw(i, mod-2, mod) % mod * (N-i+1) % mod;
for(int i = M+1; i <= min(3*M, N); i++) if((M-i)%2 == 0)
dif = (dif + prod_m1[(3*M-i)/2] * C[i]) % mod;
cat ans = (tot - dif) * pw(fac_inv, mod-2, mod) % mod;
if(ans < 0) ans += mod;
cout << ans << "\n";
return 0;
}
// look at my code
// my code is amazing
| #include<stdio.h>
#include<string.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
#define P 998244353
const int N=305;
int f[N][N][N],K,ans,n,cn[N];
char s[N];
il void mo(it&p,ct q){p+=q,p=(p>=P?p-P:p);}
int main(){
scanf("%s%d",s+1,&K),n=strlen(s+1),K=(K<n?K:n);it i,j,k,l,c0;
for(i=1;i<=n;++i) s[i]=='0'?++c0:++cn[c0];
f[0][0][0]=1;
for(i=0;i<=c0;++i)
for(j=0;j<=K;++j)
for(k=0;k<=j;++k)
for(l=-(k<cn[i]?k:cn[i]);l<=K-j;++l)
mo(f[i+1][j+(l>0?l:0)][k+l],f[i][j][k]);
for(i=0,++c0;i<=K;++i) ans+=f[c0][i][0],ans=(ans>=P?ans-P:ans);
printf("%d",ans);
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<functional>
int *v,m,n,ans=0;
int main(){
while(true){
std::cin >> n >> m;
if(!n && !m)
return 0;
v = new int[n];
for(int i=0 ;i<n; i++)
std::cin >> v[i];
std::sort(v,v+n,std::greater<int>());
if(m!=1)
for(int i=0; i<n; i++)
if(!((i+1)%m == 0 && (i+1) >= m))
ans += v[i];
std::cout << ans << std::endl;
delete[] v;
ans = 0;
}
} | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int m, n;
while (cin >> n >> m&&n != 0 && m != 0) {
int a = n%m, b = (n - a) / m, d = 0, e[1000], sum = 0;
string c, h = "";
getline(cin, c);
getline(cin, c);
c += " ";
for (int i = 0; i < c.length(); i++) {
if (c[i] == ' ') {
e[d] = atoi(h.c_str());
h = "";
d++;
}
else
h += c[i];
}
sort(e, e + n);
d = 0;
for (int i = 0; i < a; i++) {
sum += e[i];
d++;
}
for (int i = 0; i < b; i++) {
for (int j = 0; j < m; j++) {
if (j != 0) {
sum += e[i*m + j+a];
}
}
}
cout << sum << endl;
}
} | 1 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <functional>
using namespace std;
typedef pair<double, string> P;
typedef pair<string, double> Q;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
string plant;
int p, a, b, c, d, e, f, s, m;
int time;
double kou;
priority_queue<P> pq;
for (int i = 0; i < n; i++) {
cin >> plant >> p >> a >> b >> c >> d >> e >> f >> s >> m;
time = a+b+c+(d+e)*m;
kou = (double)(s*f*m-p) / (double)time;
P pp;
pp.first = kou;
pp.second = plant;
pq.push(pp);
}
while (!pq.empty()) {
P ppp = pq.top();
pq.pop();
priority_queue< Q, vector<Q>, greater<Q> > pqq;
Q q;
q.first = ppp.second;
q.second = ppp.first;
pqq.push(q);
while (!pq.empty()) {
if ((pq.top()).first == ppp.first) {
q.first = (pq.top()).second;
pqq.push(q);
pq.pop();
} else {
break;
}
}
while (!pqq.empty()) {
cout << (pqq.top()).first << endl;
pqq.pop();
}
}
cout << '#' << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int N;
const double EPS = 1e-10;
struct state{
string name;
double k;
state(){}
state(int P,int A,int B,int C,int D, int E,int F,int S,int M){
int time = A + B + C + (D + E)*M;
int num = M * F;
int mon = num * S;
int s = mon - P;
k = (double)s/(double)time;
}
bool operator<(const state& st) const {
return abs(k-st.k) < EPS ? name < st.name : k > st.k;
}
};
state st[111];
int main(){
while( cin >> N && N ){
for(int i=0;i<N;i++){
string L;int P,A,B,C,D,E,F,S,M;
cin >> L >> P >> A >> B >> C >> D >> E >> F >> S >> M;
st[i] = state(P,A,B,C,D,E,F,S,M);
st[i].name = L;
}
sort(st,st+N);
for(int i=0;i<N;i++)
cout << st[i].name << endl;
cout << "#" << endl;
}
} | 1 |
#if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
int m, nin, nax;
int p[202];
bool input(){
cin>>m>>nin>>nax;
REP(i, m)cin>>p[i];
return m;
}
void solve(){
int s=0, b=0;
FOR(i, nin-1, nax) {
if(p[i]-p[i+1]>=s){
b=i+1;
s=p[i]-p[i+1];
}
}
cout<<b<<endl;
}
int main(){
cin.tie(0);
while (input()){
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int m,n_min,n_max;
while(cin>>m>>n_min>>n_max,m){
int pre;
for(int i=0;i<n_min;++i){
cin>>pre;
}
int buf1=0,ans;
for(int i=n_min;i<=n_max;++i){
int p;cin>>p;
if(buf1<=pre-p){
buf1=pre-p;
ans=i;
}
pre=p;
}
for(int i=n_max+1;i<m;++i)cin>>pre;
cout<<ans<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<vector<int>> vv;
typedef pair<int, int> P;
typedef tuple<int, int, int> tp;
// input
int N, Q;
vector<tp> XST;
vector<int> D;
vector<int> ans;
set<P> ds;
void input() {
cin >> N >> Q;
XST = vector<tp>(N);
rep(i, N) {
int s, t, x;
cin >> s >> t >> x;
XST[i] = tp(x, s, t);
}
D = vector<int>(Q);
rep(i, Q) cin >> D[i];
}
int main() {
input();
sort(XST.begin(), XST.end());
rep(i, Q) ds.insert(P(D[i], i));
ans = vector<int>(Q, -1);
rep(i, N) {
int x, s, t;
tie(x, s, t) = XST[i];
auto itr = ds.lower_bound(P(s - x, 0));
while (itr != ds.end()) {
if (itr->first >= t - x) break;
ans[itr->second] = x;
ds.erase(itr++);
}
}
rep(i, Q) printf("%d\n", ans[i]);
}
| // 0514 Quality Checking (????????????)
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0514
// by Equim on 16-12-21
#include <cstdio>
int main()
{
while (true)
{
// INPUT
int a, b, c, Cases;
scanf("%d%d%d", &a, &b, &c);
if (a == 0)
break;
scanf("%d", &Cases);
int Result[a + b + c + 1];
for (int i = 1; i <= a + b + c; i++)
{
Result[i] = 2;
}
int RawData[Cases][4];
for (int i = 0; i < Cases; i++)
{
scanf("%d%d%d%d", &RawData[i][0], &RawData[i][1], &RawData[i][2], &RawData[i][3]);
}
int Unqualified, QualifiedCount;
bool HasNewChecked = false;
// PROCESS
do
{
HasNewChecked = false;
for (int i = 0; i < Cases; i++)
{
if (RawData[i][0] + RawData[i][1] + RawData[i][2] == 0)
continue;
if (RawData[i][3] == 1)
{
for (int j = 0; j <= 2; j++)
{
Result[RawData[i][j]] = 1;
RawData[i][j] = 0;
}
HasNewChecked = true;
}
else
{
Unqualified = 0;
QualifiedCount = 0;
for (int j = 0; j <= 2; j++)
{
if (Result[RawData[i][j]] == 1 || RawData[i][j] == 0)
{
RawData[i][j] = 0;
QualifiedCount++;
}
else
Unqualified = j;
}
if (QualifiedCount == 2)
{
Result[RawData[i][Unqualified]] = 0;
RawData[i][Unqualified] = 0;
HasNewChecked = true;
}
}
}
} while (HasNewChecked);
// OUTPUT
for (int i = 1; i < a + b + c + 1; i++)
{
printf("%d\n", Result[i]);
}
}
return 0;
} | 0 |
#include<iostream>
#include<cstring>
int field[14][14];
void dfs(int r,int c);
int main()
{
int num;
char buf[14];
while(1)
{
num=0;
memset(field,0,sizeof(field));
for(int i=1;i<=12;i++)
{
if(std::cin.eof())break;
std::cin.getline(buf,14);
if(buf[0]=='\0')
{
i--;
continue;
}
for(int j=1;j<=12;j++)
{
field[i][j]=buf[j-1]-'0';
}
}
if(std::cin.eof())break;
for(int i=1;i<=12;i++)
{
for(int j=1;j<=12;j++)
{
if(field[i][j]==1)
{
dfs(i,j);
num++;
}
}
}
std::cout<<num<<std::endl;
}
return 0;
}
void dfs(int r,int c)
{
field[r][c]=0;
if(field[r-1][c]==1){dfs(r-1,c);}
if(field[r+1][c]==1){dfs(r+1,c);}
if(field[r][c-1]==1){dfs(r,c-1);}
if(field[r][c+1]==1){dfs(r,c+1);}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > > minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d",&n)
#define scnll(n) scanf("%lld",&n)
#define scn2(n,m) scanf("%d%d",&n,&m)
#define scn3(n,m,w) scanf("%d%d%d",&n,&m,&w)
#define scn2ll(n,m) scanf("%lld%lld",&n,&m)
#define atoz(v) v.begin(),v.end()
#define ratoz(v) v.rbegin(),v.rend()
#define Fill(a,v) memset(a,v,sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mod 1000000007
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"
int Set(int N,int pos)
{
return N=N | (1<<pos);
}
int reset(int N,int pos)
{
return N = N & ~(1<<pos);
}
bool check(int N,int pos)
{
return (bool)(N & (1<<pos));
}
inline int addmod(lli x,lli y)
{
return (x%mod + y%mod)%mod;
}
inline int submod(lli x,lli y)
{
return (x%mod - y%mod + mod)%mod;
}
inline int mulmod(lli x,lli y)
{
return (x%mod * y%mod)%mod;
}
inline int nextSubMask(int i, int mask)
{
return (i-1)&mask; /// returns next submask
}
template<typename T>
void we_r_done(T mssg)
{
cout<<mssg;
exit(0);
}
int main()
{
///freopen("output.txt","w",stdout);
// freopen("input.txt","r",stdin);
FastIO;
string s;
while(cin>>s){
int n = s.size();
lli ans = 1 + n*1LL*(n-1)/2;
vector<int>cnt(30,0);
for(int i=0; i<n; i++){
cnt[s[i]-'a']++;
}
for(int i=0; i<26; i++) ans -= cnt[i]*1LL*(cnt[i]-1)/2;
cout<<ans<<endl;
}
return 0;
}
///sin and cos expect input in radians not degrees. so use , sin(degrees * pi / 180)
///using bs = bitset<MX>; // how many distinct number can be form?
///sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b : x.a<y.a);});
| 0 |
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using ld = long double;
using ui = unsigned int;
using ull = unsigned long long;
using ui128 = __uint128_t;
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define lc ind<<1
#define rc ind<<1|1
const int MN = 1e5 + 2, LOG = 17, INF = 1e8;
char s[MN];
int wot[MN];
int main () {
int n;
scanf ("%d",&n);
auto nxt = [&] (int a) {int x = a + 1; return x > n ? 1 : x;};
auto lst = [&] (int a) {int x = a - 1; return x < 1 ? n : x;};
scanf ("%s",s+1);
for (int a = 0; a < 2; a++) {
for (int b = 0; b < 2; b++) {
wot[1] = a; wot[2] = b;
for (int i = 3; i <= n; i++) {
if ((s[i-1] == 'o' && wot[i-1] == 0) || (s[i-1] == 'x' && wot[i-1] == 1)) wot[i] = wot[i-2];
else wot[i] = wot[i-2] ^ 1;
}
bool ok = 1;
for (int i = 1; i <= n; i++) {
if ((s[i] == 'o' && wot[i] == 0) || (s[i] == 'x' && wot[i] == 1)) ok &= wot[nxt(i)] == wot[lst(i)];
else ok &= wot[nxt(i)] != wot[lst(i)];
}
if (ok) {
for (int i = 1; i <= n; i++) putchar(wot[i]?'W':'S');
return 0;
}
}
}
printf ("-1\n");
return 0;
}
| #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 pair<int, int> P;
int N;
string s;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> s;
rep(a, 2) rep(b, 2) {
int A[N];
A[0] = a;
A[1] = b;
for (int i=2; i<N; i++) {
if (s[i-1]=='o' && A[i-1]==0) A[i] = A[i-2];
else if (s[i-1]=='o' && A[i-1]==1) A[i] = 1^A[i-2];
else if (s[i-1]=='x' && A[i-1]==0) A[i] = 1^A[i-2];
else A[i] = A[i-2];
}
bool flag = true;
if (s[0]=='o' && A[0]==0) flag &= A[1]==A[N-1];
else if (s[0]=='o' && A[0]==1) flag &= A[1]!=A[N-1];
else if (s[0]=='x' && A[0]==0) flag &= A[1]!=A[N-1];
else if (s[0]=='x' && A[0]==1) flag &= A[1]==A[N-1];
if (s[N-1]=='o' && A[N-1]==0) flag &= A[0]==A[N-2];
else if (s[N-1]=='o' && A[N-1]==1) flag &= A[0]!=A[N-2];
else if (s[N-1]=='x' && A[N-1]==0) flag &= A[0]!=A[N-2];
else if (s[N-1]=='x' && A[N-1]==1) flag &= A[0]==A[N-2];
if (flag) {
rep(i, N) {
if (A[i]==0) cout << 'S';
else cout << 'W';
}
cout << endl;
exit(0);
}
}
cout << -1 << endl;
} | 1 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fil(a,b) memset((a),(b),sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pa;
typedef pair<ll,ll> PA;
typedef vector<int> poly;
inline ll read(){
ll x=0,f=1;char c=getchar();
while ((c<'0'||c>'9')&&(c!='-')) c=getchar();
if (c=='-') f=-1,c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
int main(){
int n=read(),m=read(),k=read();
printf("%d\n",k/max(n,m)+(k%max(n,m)>0));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double H, W, N;
cin >> H >> W >> N;
if(H >= W) cout << ceil(N/H) << endl;
else cout << ceil(N/W) << endl;
} | 1 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <cstring>
using namespace std;
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
typedef long long ll;
int c[10];
int main(){
int n;
while (cin >> n, n){
REP(i,10) c[i] = 0;
REP(i,n){
int a;
scanf("%d", &a);
c[a]++;
}
REP(i,10){
if (c[i] == 0) printf("-\n");
else {
REP(j,c[i]) printf("*");
puts("");
}
}
}
return 0;
} | #include <iostream>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <sstream>
#include <vector>
#include <map>
#include <cmath>
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)
using namespace std;
int main(void){
long long n, bg, tn, su;
while(cin >> n){
if(n==0 || cin.eof()) break;
map<int,long long> sk;
vector<int> jun;
rep(i,n){
cin >> bg >> tn >> su;
if(sk[bg]==0) jun.push_back(bg);
sk[bg] += tn * su;
}
int cnt=0;
rep(i,jun.size()){
if(sk[jun[i]] >= 1000000){
cout << jun[i] << endl;
cnt++;
}
}
if(cnt==0) cout << "NA" << endl;
}
return 0;
} | 0 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll x, y,ans=0;
cin >> x >> y;
if (x * y == 0) {
ans = abs(x) + abs(y);
if (y < x)ans++;
}
else if (x * y < 0) {
ans = abs(abs(x) - abs(y)) + 1;
}
else if (0 < x * y) {
ans = abs(abs(x) - abs(y));
if (y < x)ans += 2;
}
cout << ans << endl;
return 0;
}
| #include<iostream>
#include<algorithm>
#include<cstring>
#include<stdio.h>
#include<cstdio>
#include<string.h>
#include<cmath>
using namespace std;
bool prime(int n) {
if (n == 1)return false;
if (n == 2)return true;
if (n == 3)return true;
if (n == 4)return false;
for (int i = 2; i < ceil(sqrt(n)); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int lst[110];
int main() {
int n,x,rec;
cin >> n>>x;
long long sum=0;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> lst[i];
}
sort(lst, lst + n);
for (int i = 0; i < n; i++) {
sum += lst[i];
if (sum <= x)ans++;
else break;
}
if (sum < x) {
cout << ans - 1 << endl;
}
else cout << ans << endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
const int MAX = 500;
int main() {
int n, m, Q;
cin >> n >> m >> Q;
int S[MAX+1][MAX+1] = {};
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
S[l][r]++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
S[i][j] += S[i][j-1];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
S[i][j] += S[i-1][j];
}
}
auto sum_rect = [&](int x0, int y0, int x1, int y1) {
return S[x1][y1] - S[x0-1][y1] - S[x1][y0-1] + S[x0-1][y0-1];
};
for (int query = 0; query < Q; query++) {
int p, q;
cin >> p >> q;
int ans = sum_rect(p, p, q, q);
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
#include <stack>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
using Vvec = vector<vector<T> >;
using Graph = Vvec<int>;
template <class T>
void debug(T& v)
{
for(auto& x: v) cout << x << " ";
cout << endl;
}
void inputGraph(Graph& graph, int num_edge, bool is_bidirectional, bool is_zero_indexed = false){
int u, v;
for(int i=0; i<num_edge; i++){
cin >> u >> v;
if(!is_zero_indexed){
u--; v--;
}
graph[u].emplace_back(v);
if(is_bidirectional) graph[v].emplace_back(u);
}
}
bool isBipartite(Graph& graph, vector<int>& vis, int tmp, int from){
if(vis[tmp] >= 0) return true;
bool ret = true;
vis[tmp] = (from == -1) ? 0 : 1 - vis[from];
for(auto& to: graph[tmp]){
if(to != from){
ret &= isBipartite(graph, vis, to, tmp);
ret &= (vis[tmp] == 1-vis[to]);
}
}
return ret;
}
int main()
{
int N, M;
cin >> N >> M;
Graph graph(N);
inputGraph(graph, M, true);
ll u = 0, v = 0, w = 0;
vector<int> vis(N, -1);
for(int i=0; i<N; i++){
if(vis[i] >= 0) continue;
if(graph[i].size()==0) w++;
else if(isBipartite(graph, vis, i, -1)) u++;
else v++;
}
cout << u*u + (u+v)*(u+v) + w*(2*N-w) << endl;
} | 0 |
#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bitset>
#include <utility>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//最大公約数
ll gcd(ll x, ll y) {
ll tmp = 0;
if (x < y){
tmp=x;
x=y;
y=tmp;
}
while (y > 0) {
ll r = x % y;
x = y;
y = r;
}
return x;
}
//最大公倍数
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
const int MAX = 1e6+1;
const ll MOD = 1e9+7;
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;
}
//階乗
ll kaijo(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum *= i;
sum%=1000000000+7;
}
return sum;
}
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;
}
//sieve(MAX);でベクトルIsPrimeに「MAXまでの数値の素数の真偽」を格納する。
vector<bool> IsPrime;
void sieve(size_t max){
if(max+1 > IsPrime.size()){ // resizeで要素数が減らないように
IsPrime.resize(max+1,true); // IsPrimeに必要な要素数を確保
}
IsPrime[0] = false; // 0は素数ではない
IsPrime[1] = false; // 1は素数ではない
for(size_t i=2; i*i<=max; ++i) // 0からsqrt(max)まで調べる
if(IsPrime[i]) // iが素数ならば
for(size_t j=2; i*j<=max; ++j) // (max以下の)iの倍数は
IsPrime[i*j] = false; // 素数ではない
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
};
ll count(int n, int a){
ll bunshi = 1;
for(int i = 0; i < a; i++){
bunshi*=(n-i);
bunshi%=MOD;
}
ll bunbo = 1;
for(int i = 1; i < a+1; i++){
bunbo*=i;
bunbo%=MOD;
}
bunbo = modpow(bunbo,MOD-2,MOD);
// cout<<(bunshi*bunbo)%MOD<<endl;
return (bunshi*bunbo)%MOD;
}
// 約数列挙。約数をvector<ll>で返す。計算量はsqrt(n)。
vector<ll> divisor(ll n) {
vector<ll> ret;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
// ここから開始
int main(){
int x,y;
cin>>x>>y;
int a[3] = {300000,200000,100000};
ll ans = 0;
if(0<x&&x<4){
ans+=a[x-1];
}
if(0<y&&y<4){
ans+=a[y-1];
}
if(x==1&&y==1){
ans+=400000;
}
cout<<ans<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
ll x,y,sum=0;
cin>>x>>y;
if(x==1)sum+=300000;
if(x==2)sum+=200000;
if(x==3)sum+=100000;
if(y==1)sum+=300000;
if(y==2)sum+=200000;
if(y==3)sum+=100000;
if(x==1&&y==1)sum+=400000;
cout<<sum<<endl;
} | 1 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define iter(i, n) for (int i = 1; i <= n; ++i)
#define iter_r(i, n) for (int i = n; i >= 1; --i)
const int mod = 998244353;
#define NR 1010000
const int N = 1e6 + 10;
int n, m;
struct Int {
int v;
Int(int v = 0) : v(v) {}
void operator+=(Int b) { v = (v + b.v) % mod; }
void operator-=(Int b) { v = (v - b.v + mod) % mod; }
void operator*=(Int b) { v = 1ll * v * b.v % mod; }
};
Int fac[NR], inv[NR];
Int operator+(Int a, Int b) { return (a.v + b.v) % mod; }
Int operator-(Int a, Int b) { return (a.v - b.v + mod) % mod; }
Int operator*(Int a, Int b) { return 1ll * a.v * b.v % mod; }
Int F(int n, int m) {
return fac[n + m] * inv[n] * inv[m];
}
Int pr(Int a, int z) {
Int s = 1;
while (z > 0) {
if (z % 2 == 1) s *= a;
a *= a;
z /= 2;
}
return s;
}
Int get_inv(Int a) { return pr(a, mod - 2); }
int main() {
fac[0] = inv[0] = 1;
iter(i, N) fac[i] = fac[i - 1] * i;
inv[N] = get_inv(fac[N]);
iter_r(i, N - 1) inv[i] = inv[i + 1] * (i + 1);
scanf("%d%d", &n, &m); ++n; ++m;
if (n > m) swap(n, m);
Int last = 0, speed = 0, ans = 0;
int _x = -1;
const Int tot = F(n - 1, m - 1), tmp0 = F(n - 1, m - 2);
iter(q, n + m - 2) {
// if (q > n - 1 && _x < n - 1) last -= n - 1;
// if (q > m - 1) last -= m - 1;
if (_x < n - 1) {
if (q % 2 == 1) {
++_x;
int y = q - _x;
if (_x == 0) {
speed += F(n - 2, m - 1);
speed += F(n - 1, m - 2);
} else {
//printf("!!\n");
speed += F(_x, y - 2) * F(n - _x - 1, m - y - 1);
speed += F(y - 2, _x) * F(m - _x - 1, n - y - 1);
}
} else {
int y = q - _x;
// printf("c[%d %d]\n", _x, y);
speed -= F(_x, y - 2) * F(n - _x - 2, m - y);
speed -= F(y - 2, _x) * F(m - _x - 2, n - y);
}
} else speed = tmp0;
last += speed;
// printf("c%d %d (%d %d %d %d)\n" ,last.v, speed.v, q, n, m, _x);
// printf("[%d %d]\n", _x, q-_x);
// printf("!%d %d\n", last.v, tot.v);
ans += last * get_inv(q);
}
printf("%d\n", (ans * get_inv(tot)).v);
return 0;
} | #include <cstdio>
#include <algorithm>
using namespace std;
const int mod = 998244353;
typedef long long LL;
const int MAXN = 1e6 + 6;
LL n , m , fac[MAXN] , inv[MAXN] , finv[MAXN];
int main() {
scanf("%lld %lld" , &n , &m);
fac[0] = 1;
for (LL i = 1; i <= n + m; ++i) fac[i] = fac[i - 1] * i % mod;
finv[1] = inv[1] = 1;
finv[0] = 1;
for (LL i = 2; i <= n + m; ++i) inv[i] = (mod - mod / i) * inv[mod % i] % mod , finv[i] = finv[i - 1] * inv[i] % mod;
LL ans = 0;
for (int k = 1; k <= min(n , m); ++k) {
ans = (ans + inv[2] * fac[n - k + m - k] % mod * finv[m - k] % mod * finv[n - k] % mod * fac[2 * k] % mod * finv[k] % mod * finv[k] % mod * finv[n + m] % mod * fac[n] % mod * fac[m] % mod) % mod;
}
ans = (ans + max(n , m)) % mod;
printf("%lld" , ans);
return 0;
} | 1 |
#pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vs vector <string>
#define vvs vector <vector<string>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0) return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
bool isprime(ll a)//素数判定、primeならtrue,違うならfalse
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
// 素数である
return true;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
int X;
cin >> X;
cout << X / 500 * 1000 + X % 500 / 5 * 5 << endl;
}
| #include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
int r;
cin >> r;
if(r >= 2800){
cout << "AGC" << endl;
}else if(r >= 1200){
cout << "ARC" << endl;
}else{
cout << "ABC" << endl;
}
} | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
//const ll mod = 998244353;
const int inf = 1e9 + 10;
const ld INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
int n;
cin >> n;
vector<ld> a(n);
rep(i, n) cin >> a[i];
ld ave = 0;
rep(i, n) ave += a[i];
ave /= n;
int ans = -1;
ld res = INF;
rep(i, n) if (chmin(res, fabs(a[i] - ave))) ans = i;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
int main(void){
int N;
cin >> N;
vector<pair<float, int>> vec(N);
float avg = 0.0f;
rep(i,0,N){
int input;
cin >> input;
vec[i] = make_pair(input, i);
avg+=(float)vec[i].first;
}
avg/=N;
float minimum = vec[0].first;
rep(i,0,N){
vec[i].first = abs(vec[i].first- avg);
if (minimum > vec[i].first)
minimum = vec[i].first;
}
rep(i,0,N){
if ( minimum == vec[i].first){
cout << i << endl;
return 0;
}
}
}
| 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target ("sse4")
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define MEM(x,a) memset((x),a,sizeof((x)))
#define F first
#define S second
#define imx INT_MAX
const long long MOD = (long long)(1e9+7);
const long long MMX = (long long)(1e18);
typedef long long LL;
typedef pair<int,int> pii;
int n,x,ans;
LL pow2[50];
map<int,int>mp;
priority_queue<int>pq;
int main()
{
pow2[0]=1;
for(int i=1;i<=31;i++)pow2[i]=pow2[i-1]*2;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
mp[x]++;
pq.push(x);
}
while(!pq.empty())
{
if(mp[pq.top()]==0)
{
pq.pop();
continue;
}
mp[pq.top()]--;
for(int i=31;i>-1;i--)
{
if(pow2[i]-pq.top()>pq.top())continue;
if(mp[pow2[i]-pq.top()]>0)
{
mp[pow2[i]-pq.top()]--;
ans++;
break;
}
}
pq.pop();
}
printf("%d",ans);
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
const int MN = 100010;
int N;
int a[3][MN];
pii b[MN];
ll flip[2], inv[2];
template<class T>
class BIT {
T bit[MN];
int n;
public:
BIT() {
n = N + 10;
memset(bit, 0, sizeof(bit));
}
T sum(int i) {
++i;
T s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, T x) {
++i;
while (i < n) {
bit[i] += x;
i += i & -i;
}
}
};
int main() {
cin >> N;
rep(i, 3) {
rep(j, N) {
cin >> a[i][j];
--a[i][j];
}
}
rep(i, N) {
if (a[1][i] == a[0][i] + 1 && a[2][i] == a[0][i] + 2) {
b[i] = mp(a[0][i] / 3, 0);
} else if (a[1][i] == a[0][i] - 1 && a[2][i] == a[0][i] - 2) {
b[i] = mp(a[0][i] / 3, 1);
} else {
puts("No");
return 0;
}
if (i % 4 >= 2) {
b[i].se ^= 1;
}
if (b[i].fi % 2 != i % 2) {
puts("No");
return 0;
}
}
BIT<int> T[2];
rep(i, 2) { //parity
for (int j = i; j < N; j += 2) {
flip[i] += (b[j].se != (b[j].fi % 4 >= 2));
inv[i] += T[i].sum(N) - T[i].sum(b[j].fi);
T[i].add(b[j].fi, 1);
}
}
puts(inv[0] % 2 == flip[1] % 2 && inv[1] % 2 == flip[0] % 2 ? "Yes" : "No");
return 0;
} | 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> pii;
int main()
{
int h,w;
int i,j;
while(1){
cin>>h>>w;
if(h==0 && w==0)break;
int len=h*h+w*w;
int ans=0;
for(i=h+1;i*i<len/2;i++){//i:tate
double left=len-i*i;
// printf("i*i=%d,left=%f,yoko=%f\n",i*i,left,sqrt(left));
if(sqrt(left)-(int)sqrt(left)<EPS){
ans=i;
break;
}
}
if(ans>0){
cout<<ans<<" "<<sqrt(len-ans*ans)<<endl;
goto END;
}
while(1){
len++;
for(i=1;i*i<len/2;i++){
double left=len-i*i;
// printf("len=%d,i*i=%d,left=%f,yoko=%f\n",len,i*i,left,sqrt(left));
left=sqrt(left);
if(left-(int)left<EPS){
cout<<i<<" "<<left<<endl;
goto END;
}
}
}
END:;
}
} | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<pair<int, pair<int,int>>>v;
for (int i = 1; i <= 150; i++) {
for (int j = i + 1; j <= 150; j++) {
v.push_back({ i*i + j*j ,{i,j} });
}
}
sort(v.begin(), v.end());
cin >> H >> W;
while (H) {
bool flag = false;
for (auto i : v) {
if (flag) {
cout << i.second.first << " " << i.second.second << endl;
break;
}
if (i.second.first == H&&i.second.second == W) {
flag = true;
}
}
cin >> H >> W;
}
return 0;
} | 1 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
ll int MOD=998244353;
#define N 3000000
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
main(){
ll int k;
cin>>k;
ll int kk=k;
int n=50;
ll int a[50]={};
rep(i,50){
a[i]=kk/50;
k-=kk/50;
}
rep(i,50){
if(k>0){
a[i]++;
k--;
}
}
cout<<50<<endl;
rep(i,50){
a[i]=(ll)51*a[i]-kk+(ll)49;
cout<<a[i]<<" ";
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
int main(){
ll K;
cin>>K;
cout<<50<<endl;
REP(i,50){
ll ans;
if (i<K%50){
ans=100-(K%50)+K/50;
}else{
ans=49-(K%50)+K/50;
}
if (i){
cout<<" ";
}
cout<<ans;
}
cout<<endl;
return 0;
} | 1 |
#include <iostream>
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <set>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
#define f first
#define s second
typedef long long LLI;
int n;
pair<int, pair<int, int> > p[5001];
long long dp[5001][5001];
const long long inf = 1e15;
int main() {
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d %d", &p[i].s.f, &p[i].s.s);
p[i].f = p[i].s.f + p[i].s.s;
}
sort(p, p + n);
for(int i = 0; i < 5001; ++i) {
dp[i][0] = 0;
for(int j = 1; j < 5001; ++j) dp[i][j] = inf;
}
int ans = 1;
dp[0][1] = p[0].s.s;
for(int i = 1; i < n; ++i) {
for(int j = 1; j <= n; ++j) {
dp[i][j] = dp[i-1][j];
if(p[i].s.s + dp[i-1][j-1] < dp[i][j] && p[i].s.f >= dp[i-1][j-1]) dp[i][j] = p[i].s.s + dp[i-1][j-1];
if(dp[i][j] < inf) ans = max(ans, j);
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std ;
const int N = 5010 ;
const long long inf = 10000000000000000 ;
pair<int,int> zab [ N ] ;
bool cmp ( pair<int,int> A, pair<int,int> B ) {
return A.first + A.second < B.first + B.second ;
}
long long dp [ N ][ 3 ];
int main() {
// freopen("input.txt", "r", stdin) ;
int n ; cin >> n ;
for ( int i = 0 ; i < n ; ++i )
cin >> zab[i].first >> zab[i].second ;
sort ( zab, zab+n, cmp ) ;
int ans =0 ;
for ( int i = 1 ; i <= n ; ++i ) {
for ( int j = 0 ; j < n ; ++j ) {
if ( i == 1 ) dp[j][i%2] = zab[j].first ;
else if ( j + i <= n ) dp[j][i%2] = min ( 1ll*zab[j].first, dp[j+1][(i-1)%2] - zab[j].second );
else dp[j][i%2] = -inf ;
}
bool kPosible = (dp[n-1][i%2] >= 0ll) ;
for ( int j = n-2 ; j >= 0 ; --j ) {
dp[j][i%2] = max ( dp[j][i%2], dp[j+1][i%2] ) ;
kPosible |= (dp[j][i%2]>=0ll) ;
}
if ( kPosible ) ans = i ;
}
cout << ans << '\n' ;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
string t("2018"),s;
rep(i,10){
char c; cin >> c;
if(i>=0 && i<=3){
cout << t[i];
}else{
cout << c;
}
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
cout << s.replace(3, 1, "8") << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll h,w;
cin >> h >> w;
string s[h];
vector<vector<char>> t(h, vector<char>(w));
rep(i,h) cin >> s[i];
rep(i,h)rep(j,w) t[i][j]='.';
rep(i,h)rep(j,w){
if(s[i][j]=='.') continue;
rep(k,4){
int ii = i+dx[k];
int jj = j+dy[k];
if(ii<0 || ii>h-1) continue;
if(jj<0 || jj>w-1) continue;
if(s[ii][jj]=='#'){
t[ii][jj]='#';
t[i][j]='#';
break;
}
}
}
int cnt=0;
rep(i,h)rep(j,w){
if(s[i][j]==t[i][j]) cnt++;
}
if(cnt==h*w) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
str a[60];
#define fi first
#define se second
#define DIRMAX 4
pair<int,int> dir[4]=
{
{ 0,-1},
{-1, 0},
{ 1, 0},
{ 0, 1},
};
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int h,w;cin>>h>>w;
ss maketop;
for(int i=0;i<w+2;i++)maketop<<".";
a[0]=maketop.str();
a[h+1]=maketop.str();
for(int i=0;i<h;i++)
{
str s;
cin>>s;
ss makemid;
makemid<<"."<<s<<".";
a[i+1]=makemid.str();
}
bool ans=true;
for(int i=1;i<=h;i++)for(int j=1;j<=w;j++)
{
if(a[i][j]=='#')
{
bool c=true;
for(int k=0;k<DIRMAX;k++)
if(a[i+dir[k].fi][j+dir[k].se]=='#')
{
c=false;
break;
}
if(c)
{
ans=false;
break;
}
}
}
puts(ans?"Yes":"No");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
// Your code here!
ll n,k;
cin>>n>>k;
char d[k];
rep(0,i,k)cin>>d[i];
rep(n,N,100001){
string nN=to_string(N);
bool t=true;
rep(0,i,nN.length()){
rep(0,j,k){
if(d[j]==nN[i])t=false;
}
}
//cout<<nN<<" "<<t<<endl;
if(t==true){
cout<<nN;
return 0;
}
}
} | //
//AtCoder Beginner Contest 042
//C
//
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) (int)(x).size()
#define SIZEL(x) (ll)(x).size()
#define MSG(a) cout << #a << " " << a << endl;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; } //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //最小公倍数
int main()
{
int n, k;
cin >> n >> k;
vector<int> dislike(10, 0);
REP(i, k) {
int d;
cin >> d;
dislike[d]=1;
}
int likeMin = -1;
REP(i, 10) {
if (dislike[i]==0){
likeMin = i;
break;
}
}
vector<int> ans(10010, -1);
int over = -1;
int nn = n;
int pos = 0;
while(nn>0){
ans[pos]=nn%10;
if (dislike[nn%10] == 1) over = pos;
nn /= 10;
pos++;
}
if (over == -1) {
cout << n << endl;
return 0;
}
REP(i, over) ans[i]=likeMin;
FOR(i, over, pos){
int like = -1;
FOR(j, ans[i], 9){
if (dislike[j]==0){
like = j;
break;
}
}
if (like == -1){
ans[i]=likeMin;
if (ans[i+1]==-1) ans[i+1] = 1;
else ans[i+1]++;
}else{
ans[i]=like;
break;
}
}
string sans = "";
REP(i, ans.size()){
if (ans[i]==-1) break;
else sans = to_string(ans[i]) + sans;
}
cout << sans << endl;
return 0;
}
| 1 |
#include <iostream>
#include <cstdio>
using namespace std;
int N, M;
int MOD;
int Fact[6005], Inv[6005], Pw2[6005], Pw3[6005], IPw2[6005], IPw3[6005];
int power(int n, int p){
int sol = 1;
while(p){
if(p & 1)
sol = (1LL * sol * n) % MOD;
p /= 2;
n = (1LL * n * n) % MOD;
}
return sol;
}
void precalcFact(){
Fact[0] = 1;
for(int i = 1; i <= N * 3; i++){
Fact[i] = (1LL * Fact[i - 1] * i) % MOD;
}
Inv[N * 3] = power(Fact[N * 3], M - 2);
for(int i = N * 3 - 1; i >= 0; i--)
Inv[i] = (1LL * Inv[i + 1] * (i + 1)) % MOD;
}
void precalcPower(){
Pw2[0] = 1;
Pw3[0] = 1;
IPw2[0] = 1;
IPw3[0] = 1;
for(int i = 1; i <= N * 3; i++){
Pw2[i] = (1LL * Pw2[i - 1] * 2) % MOD;
Pw3[i] = (1LL * Pw3[i - 1] * 3) % MOD;
IPw2[i] = power(Pw2[i], M - 2);
IPw3[i] = power(Pw3[i], M - 2);
}
}
int compute(int p1, int p2, int p3){
int ans = Fact[3 * N];
ans = (1LL * ans * Inv[p1]) % MOD;
ans = (1LL * ans * Inv[p2]) % MOD;
ans = (1LL * ans * Inv[p3]) % MOD;
ans = (1LL * ans * IPw2[p2]) % MOD;
ans = (1LL * ans * IPw3[p3]) % MOD;
return ans;
}
void Solve(){
int ans = 0;
for(int i = 0; i <= N * 3; i++){
for(int j = 0; j <= N * 3; j++){
int g1 = 3 * N - 2 * i - 3 * j;
if(g1 < i)
break;
ans += compute(g1, i, j);
if(ans >= MOD)
ans -= MOD;
}
}
cout << ans << '\n';
}
int main()
{
cin >> N >> M;
MOD = M;
precalcFact();
precalcPower();
Solve();
return 0;
}
| #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort(x.rbegin(), x.rend())
#define REVERSE(x) reverse(ALL(x))
#define MAX(x) *max_element(ALL(x))
#define MAXI(x) max_element(ALL(x)) - x.begin()
#define SUM(x) accumulate(ALL(x), 0ll)
#define COUNT(x, y) count(ALL(x), y);
#define ANS cout << ans << "\n"
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define Yes cout << "Yes\n";
#define No cout << "No\n";
#define YN YES else NO
#define yn Yes else No
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(z, v.size()) cerr << " " << v[z]; \
cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
using vp = vector<P>;
using vs = vector<string>;
template <typename T>
inline istream& operator>>(istream& i, vector<T>& v) {
rep(j, v.size()) i >> v[j];
return i;
}
template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
return i >> v.first >> v.second;
}
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
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;
}
signed main() {
init();
ll N, M, V, P;
cin >> N >> M >> V >> P;
vll A(N);
cin >> A;
RSORT(A);
ll left = 0, right = N;
while (right - left > 1) {
ll center = (left + right) / 2;
if (center < P) {
left = center;
continue;
}
ll after = A[center] + M;
if (after < A[P - 1]) {
right = center;
continue;
}
ll num = ((P - 1) + 1 + N - (center + 1)) * M;
rep2(i, P - 1, center) num += after - A[i];
if (num < M * V)
right = center;
else
left = center;
}
COUT(left + 1);
return 0;
} | 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<vector>
#include<cctype>
using namespace std;
int main(){
vector<int>a;
int n,s=0,b=0;long sum=0;
cin>>n;int nnn;
if(n>0){
for(int i=0;i<n;i++){cin>>nnn;a.push_back(nnn);}
s=a[0],b=a[0];
for(int i=0;i<a.size();i++){
sum+=a[i];
b=max(b,a[i]);
s=min(s,a[i]);
}
cout<<s<<" "<<b<<" "<<sum<<endl;
}
else{
printf("%d %d %d\n",s,b,sum);
}
return 0;
} | #include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int partition(int A[], int p, int last){
int x = A[last];
int bigger_first_ind = p - 1;
for(int j = p; j < last; j++){
if(A[j] <= x) swap(A[++bigger_first_ind], A[j]);
}
swap(A[++bigger_first_ind], A[last]);
return bigger_first_ind;
}
int main(){
int n;
cin >> n;
int* A; A = new int[n];
for(int i = 0; i < n; i++) cin >> A[i];
int border = partition(A, 0, n-1);
for(int i = 0; i < n-1; i++){
if(i == border){
cout << "[" << A[i] << "] ";
}else
cout << A[i] << " ";
}
cout << A[n-1] << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 1000000000 + 7;
ll dp[200][10];
void init() {
rep(i, 0, 200) rep(j, 0, 10) dp[i][j] = 0;
}
int main(){
init();
// input
ll h, w, k;
cin >> h >> w >> k;
// dp
dp[0][0] = 1;
rep(i, 0, h) {
rep(j, 0, w) {
for(int bit = 0; bit < (1<<(w-1)); bit++) {
bool f = true;
rep(k, 0, w-2) {
if((bit & (1<<k)) && (bit & (1<<(k+1)))) f = false;
}
if(!f) continue;
if(j >= 1 && (bit & (1 << (j-1) ) ) ) {
dp[i+1][j-1] += dp[i][j];
dp[i+1][j-1] %= mod;
}else if(j <= w-2 && (bit & (1<<j) ) ) {
dp[i+1][j+1] += dp[i][j];
dp[i+1][j+1] %= mod;
}else{
dp[i+1][j] += dp[i][j];
dp[i+1][j] %= mod;
}
}
}
}
cout << dp[h][k-1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.14159265358979
typedef long long ll;
using namespace std;
const ll MOD = 1e9+7LL;
const int INF = 2e9;
int H, W, K;
ll DP[101][10]; // 残りn本の段階でiにいる場合の数
ll Memo[9]; // 本数がidxのときに何通りあるか
void calc() {
rep(i, H+1) {
if (i==0) continue;
rep(j, W) {
DP[i][j] += DP[i-1][j]*Memo[j]*Memo[W-j-1]; // 左右に棒を置かない
if (j>0) DP[i][j] += DP[i-1][j-1]*Memo[W-j-1]*Memo[j-1]; // 左に棒を置く
if (j<W-1) DP[i][j] += DP[i-1][j+1]*Memo[W-j-2]*Memo[j]; // 右に棒を置く
DP[i][j]%=MOD;
}
}
}
int main() {
INCANT;
cin >> H >> W >> K;
if (W==1) {
cout << 1 << endl;
return 0;
}
Memo[0] = 1;
Memo[1] = 1;
rep(i, W) Memo[i+2] = Memo[i]+Memo[i+1];
DP[0][0] = 1ll;
calc();
cout << DP[H][K-1] << "\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define vll vector<ll>
#define ld long double
#define pll pair<ll,ll>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define oset tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define osetll tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define ook order_of_key
#define fbo find_by_order
const int MOD=1000000007;
long long int inverse(long long int i){
if(i==1) return 1;
return (MOD - ((MOD/i)*inverse(MOD%i))%MOD+MOD)%MOD;
}
ll POW(ll a,ll b)
{
if(b==0) return 1;
if(b==1) return a%MOD;
ll temp=POW(a,b/2);
if(b%2==0) return (temp*temp)%MOD;
else return (((temp*temp)%MOD)*a)%MOD;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin>>n;
string s[n];
ll a[n],b[n];
vector<pair<ll,ll> > v1,v2;
for(int i=0;i<n;i++)
{
cin>>s[i];
ll mx=0,temp=0;
for(int j=0;j<s[i].size();j++)
{
if(s[i][j]==')') temp++;
else temp--;
mx=max(temp,mx);
}
a[i]=mx;
temp=0;
ll mn=0;
for(int j=s[i].size()-1;j>=0;j--)
{
if(s[i][j]=='(') temp++;
else temp--;
mn=max(mn,temp);
}
b[i]=mn;
//cout<<a[i]<<" "<<b[i]<<" ";
if( (b[i]-a[i]) >0) v1.PB(MP(a[i],i));
else v2.PB(MP(-b[i],i));
}
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
stack<ll> st;
ll flag=0;
for(int i=0;i<v1.size();i++)
{
string k=s[v1[i].S];
for(int j=0;j<k.size();j++)
{
if(k[j]=='(') st.push(1);
else
{
if(st.empty()) {flag=1; break;}
else st.pop();
}
}
if(flag==1) break;
}
if(flag==0)
{
for(int i=0;i<v2.size();i++)
{
string k=s[v2[i].S];
for(int j=0;j<k.size();j++)
{
if(k[j]=='(') st.push(1);
else
{
if(st.empty()) {flag=1; break;}
else st.pop();
}
}
if(flag==1) break;
}
}
if(flag==0 && st.empty()) cout<<"Yes";
else cout<<"No";
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
void Ans(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
const ll INF=1001001001;
const ll mod=1000000007;
int main(){
ll n;
cin>>n;
string s;
P a[n];
vector<P> b,c;
ll s1,s2;
rep(i,n){
s1=0;
s2=0;
cin>>s;
rep(j,s.size()){
if(s[j]=='('){
s1++;
}
else if(s[j]==')'&&s1==0){
s2++;
}
else{
s1--;
}
}
a[i]=P(s1,s2);
if(s1-s2>=0) b.push_back(P(s2,s1));
else c.push_back(P(s1,s2));
}
sort(all(b));
sort(all(c));
s1=0;
s2=0;
int ch=0;
rep(i,b.size()){
s2+=b[i].fi;
if(s1<s2) ch++;
s1+=b[i].se;
if(s1<s2) ch++;
}
rep(i,c.size()){
int j=c.size()-i-1;
s2+=c[j].se;
if(s1<s2) ch++;
s1+=c[j].fi;
if(s1<s2) ch++;
}
Ans(ch==0&&s1==s2);
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define togglebit(n, i) ((n) ^ (1LL << (i)))
char gap = 32;
template < typename T >
ostream& operator<<(ostream &os, const vector < T > &v) {
os << '{';
for (const auto &x: v) os << gap << x;
return os << '}';
}
template < typename A, typename B >
ostream& operator<<(ostream &os, const pair < A, B > &p) {
return os << '(' << p.first << gap << p.second << ')';
}
template < class T >
void read(T &x) {
char c;
for (c = getchar(); c < '0' || c > '9'; c = getchar());
for (x = 0; c <= '9' && c >= '0'; c = getchar()) x = x * 10 + (c & 15);
}
#define ll long long
#define lll __int128_t
#define pb push_back
#define mp make_pair
typedef pair < int, int > ii;
typedef vector < ii > vii;
typedef vector < ll > vl;
typedef vector < int > vi;
typedef vector < vi > vvi;
typedef tree <
int,
null_type,
less < int >,
rb_tree_tag,
tree_order_statistics_node_update >
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
ll dp[1001][1001];
ll mod=1000000007;
vector<string>Data;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll i,j,k,l,n,m;
cin>>n>>m;
vector<pair<ll,ll>>res;
ll ini=1;
ll fina=n;
vector<ll>used(n+1,0);
ll kola1=(m+1)/2;
while(kola1--){
used[ini]=1;used[fina]=1;
res.pb({ini++,fina--});
}
m=m/2;
ll cnt=2*m;
while(m--){
while(used[ini]==1) ini++;
res.pb(make_pair(ini,ini+cnt));
used[ini]=1;
used[ini+cnt]=1;
cnt-=2;
}
for(auto x:res) cout<<x.first<<" "<<x.second<<'\n';
} | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int main() {
int n, m;
cin >> n >> m;
rep(i, m/2)cout << i+1 << " " << m-i << endl;
rep(i, (m+1)/2)cout << i+1+m << " " << 2*m+1-i << endl;
}
| 1 |
#include<iostream>
using namespace std;
long long p=998244353,jc[200010],n,m,k,f[200010],ans;
long long ksm(long long a,long long b)
{
long long x=1;
for(;b;a=(a*a)%p,b/=2) if(b%2==1) x=(x*a)%p;
return x;
}
long long c(long long x,long long y)
{
long long z=jc[x];
if(y<=0) return 1;
z=(z*ksm(jc[y],p-2))%p;
z=(z*ksm(jc[x-y],p-2))%p;
return z;
}
int main()
{
int i;
cin>>n>>m>>k;
jc[0]=1;
for(i=1;i<=n;i++) jc[i]=(jc[i-1]*i)%p;
f[1]=m;
for(i=2;i<=n;i++) f[i]=(f[i-1]*(m-1))%p;
for(i=0;i<=k;i++) ans=(ans+c(n-1,n-i-1)*f[n-i])%p;
cout<<ans;
cin>>i;
}
| #include <bits/stdc++.h>
#define MOD 998244353LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll fact[400005];
ll mod_pow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1LL){
res=res*x%MOD;
}
x=x*x%MOD;
n>>=1LL;
}
return res;
}
ll extgcd(ll a,ll b,ll& x,ll& y){
ll d=a;
if(b!=0LL){
d=extgcd(b,a%b,y,x);
y-=(a/b)*x;
}else{
x=1;
y=0;
}
return d;
}
ll mod_inverse(ll a,ll m){
ll x,y;
extgcd(a,m,x,y);
return (m+x%m)%m;
}
ll mod_fact(ll n,ll p,ll& e){
e=0;
if(n==0)return 1;
ll res=mod_fact(n/p,p,e);
e+=n/p;
if(n/p%2!=0){
return res*(p-fact[n%p])%p;
}
return res*fact[n%p]%p;
}
ll mod_comb(ll n,ll k,ll p){
if(n<0 || k<0 || n<k)return 0;
ll e1,e2,e3;
ll a1=mod_fact(n,p,e1),a2=mod_fact(k,p,e2),a3=mod_fact(n-k,p,e3);
if(e1>e2+e3)return 0;
return a1*mod_inverse(a2*a3%p,p)%p;
}
int n,m,k;
int main(void){
fact[0]=1;
fact[1]=1;
for(ll i=2;i<=400000;i++){
fact[i]=fact[i-1]*i%MOD;
}
scanf("%d%d%d",&n,&m,&k);
ll ans=mod_pow(m,n);
ll co=1;
for(int i=k+1;i<n;i++){
ll ch=n-i-1;
ll val=m;
val=val*mod_pow(m-1,ch)%MOD;
val=val*mod_comb(n-1,ch,MOD)%MOD;
ans-=val;
if(ans>=MOD){
ans-=MOD;
}
if(ans<0){
ans+=MOD;
}
}
printf("%lld\n",ans);
return 0;
}
| 1 |
#include <iostream>
#include <iomanip>
#include<vector>
using namespace std;
int main()
{
while(1)
{
int N;
cin >> N;
if(N == 0)
{
return 0;
}
vector<vector<int>> map;
//??????????????????
for(int i = 0; i < N+1; i++)
{
vector<int> column;
for(int j = 0; j < N + 1; j++)
{
if(i == N)
{
column.push_back(0);
}
else if(j != N)
{
int value;
cin >> value;
column.push_back(value);
}
else
{
column.push_back(0);
}
}
map.push_back(column);
}
//?????????????¨????
int totalSum = 0;
//????????????????¨????
for(int i = 0; i < N; i++)
{
int sum = 0;
for(int j = 0; j < N; j++)
{
sum += map[i][j];
}
map[i][N] = sum;
}
//????????????????¨????
for(int i = 0; i < N; i++)
{
int sum = 0;
for(int j = 0; j < N; j++)
{
sum += map[j][i];
}
map[N][i] = sum;
totalSum += sum;
}
//????????????????¨???????????????£??\
map[N][N] = totalSum;
for(int i = 0; i < N + 1; i++)
{
for(int j = 0; j < N + 1; j++)
{
cout << setw(5) << right << map[i][j];
}
cout << endl;
}
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
const int MAX = 10001;
bool isPrime[MAX];
fill_n(isPrime, MAX, true);
for (int i = 4; i < MAX; i += 2) {
isPrime[i] = false;
}
for (int i = 3; i * i <= MAX; i += 2) {
if (isPrime[i]) {
for (int j = i * 2; j < MAX; j += i) {
isPrime[j] = false;
}
}
}
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
if (n % 2 == 0) {
n--;
}
for (int i = n; i >= 5; i -= 2) {
if (isPrime[i] && isPrime[i - 2]) {
cout << i - 2 << " " << i << endl;
break;
}
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long x;
cin >> n >> x;
vector<long long> b(n), l(n), u(n);
long long loss = 0;
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> u[i];
loss += b[i] * l[i];
}
vector<long long> value(n);
for (int i = 0; i < n; i++) {
value[i] = x * u[i] - b[i] * (u[i] - l[i]);
}
vector<int> order(n);
iota(order.begin(), order.end(), 0);
sort(order.begin(), order.end(), [&](int i, int j) {
return value[i] > value[j];
});
vector<long long> pref(n + 1);
for (int i = 0; i < n; i++) {
pref[i + 1] = pref[i] + value[order[i]];
}
long long ans = (long long) 9e18;
for (int it = 0; it < n; it++) {
int i = order[it];
for (long long coeff : {l[i], u[i]}) {
int low = 0, high = n;
while (low <= high) {
int mid = (low + high) >> 1;
long long cur = loss;
if (coeff == u[i]) {
cur += b[i] * (u[i] - l[i]);
}
long long can_get = pref[mid];
long long vals = mid;
if (it < mid) {
can_get -= value[i];
vals -= 1;
}
can_get += x * coeff;
if (can_get >= cur) {
can_get -= x * coeff;
long long need = 0;
if (can_get < cur) {
need = (cur - can_get + coeff - 1) / coeff;
}
ans = min(ans, vals * x + need);
}
if (low == high) {
break;
}
if (can_get >= cur) {
high = mid;
} else {
low = mid + 1;
}
}
}
}
cout << ans << '\n';
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <tuple>
#include <functional>
using namespace std;
using T=tuple<int64_t,int>;
int main(){
int64_t N,X;
cin>>N>>X;
vector<int64_t> B(N),L(N),U(N);
for(int i=0;i<N;i++){
cin>>B[i]>>L[i]>>U[i];
}
vector<T> V;
for(int i=0;i<N;i++){
V.emplace_back(U[i]*(X-B[i])+L[i]*B[i],i);
}
sort(V.begin(), V.end(),greater<T>());
function<bool(int64_t)> test = [&](int64_t sum){
int64_t total=0;
for(int i=0;i<N;i++){
int idx;
tie(ignore,idx)=V[i];
if(i<(sum+X-1)/X){
total+=U[idx]*(X-B[idx]);
}else{
total+=-L[idx]*B[idx];
}
}
if(sum%X==0){
return total>=0;
}
int64_t maximum=-10000000000000;
for(int i=0;i<N;i++){
int idx;
tie(ignore,idx)=V[i];
int64_t diff = max(U[idx]*(sum%X-B[idx]),L[idx]*(sum%X-B[idx]));
if(i<(sum+X-1)/X){
maximum = max(maximum, total-U[idx]*(X-B[idx])+diff);
}else{
int edge = get<1>(V[(sum+X-1)/X-1]);
maximum = max(maximum, total-U[edge]*(X-B[edge])-L[edge]*B[edge]+L[idx]*B[idx]+diff);
}
}
// cout<<sum<<' '<<maximum<<' '<<total<<endl;
return maximum>=0;
};
int64_t lb=0,ub=X*N;
while(ub-lb>1){
int64_t mid=(lb+ub)/2;
if(test(mid)){
ub=mid;
}else{
lb=mid;
}
}
if(lb==0&&test(lb)){
cout<<lb<<endl;
}else{
cout<<ub<<endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N=1000005;
const int mo=998244353;
int fac[N],inv[N],n,m,ans;
int C(int x,int y){
return 1ll*fac[x]*inv[y]%mo*inv[x-y]%mo;
}
int main(){
fac[0]=inv[0]=inv[1]=1;
for (int i=2;i<N;i++)
inv[i]=1ll*(mo-mo/i)*inv[mo%i]%mo;
for (int i=1;i<N;i++)
fac[i]=1ll*fac[i-1]*i%mo,
inv[i]=1ll*inv[i-1]*inv[i]%mo;
scanf("%d%d",&n,&m);
for (int i=1;i<=n&&i<=m;i++)
ans=(ans+1ll*C(i*2,i)*C(n+m-i*2,n-i))%mo;
ans=1ll*ans*inv[n+m]%mo*fac[n]%mo*fac[m]%mo*(mo+1)/2%mo;
printf("%d",(ans+max(n,m))%mo);
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
// 10x + 5y + z = Y
// x + y + z = N
// 9x + 4y = Y - N
int n, yy;
cin >> n >> yy;
yy /= 1000;
int x = -1, y = -1, z = -1;
for (int i = 0; 4 * i <= yy - n; i++) {
int t = yy - n - 4 * i;
if (t >= 0 && t % 9 == 0 && n - t / 9 - i >= 0) {
x = t / 9;
y = i;
z = n - x - y;
break;
}
}
cout << x << " " << y << " " << z << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e3+5,inf=0x3f3f3f3f;
char s[N][N];
int a,b,n=100;
int main()
{
cin>>a>>b;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(j>50)
s[i][j]='#';
else
s[i][j]='.';
}
for(int i=1;i<=n;i+=2)
for(int j=1;j<50;j++)
{
if((i+j)%2&&b!=1)
s[i][j]='#',b--;
}
for(int i=1;i<=n;i+=2)
for(int j=51;j<=100;j++)
{
if((i+j)%2&&a!=1)
s[i][j]='.',a--;
}
puts("100 100");
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%c",s[i][j]);
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(n) cout << ( (n) ? "YES":"NO") << endl;
#define OUT(n) cout << (n) << endl;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
int main(void)
{
IOS
const int HW = 100;
const char W = '.';
const char B = '#';
int a, b;
cin >> a >> b;
vector<string> ss;
REP(i,HW) {
if (i < HW /2) ss.emplace_back(string(HW,B));
else ss.emplace_back(string(HW,W));
}
int x = 0, y = 0;
int i = a-1;
while(i > 0) {
ss[y][x] = W;
x += 2;
if (x >= HW) {
y += 2;
x = 0;
}
i--;
}
x = 0, y = HW-1;
i = b-1;
while(i > 0) {
ss[y][x] = B;
x += 2;
if (x >= HW) {
y -= 2;
x = 0;
}
i--;
}
cout << HW << " " << HW << '\n';
REP(i,HW) cout << ss[i] << '\n';
return 0;
} | 1 |
// Problem : C - Snuke Festival
// Contest : AtCoder - AtCoder Beginner Contest 077
// URL : https://atcoder.jp/contests/abc077/tasks/arc084_a
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
/* DEBUGGING */
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 deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define deb(x...)
#endif
/* MACROS */
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef map<int,int> mii;
#define ff first
#define ss second
#define pb push_back
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define ps(x,y) fixed<<setprecision(y)<<x
#define setbit(x) __builtin_popcountll(x)
#define rep(i,a,b) for(int i=a ; i<b ; ++i)
#define repr(i,a,b) for(int i=a ; i>=b ; --i)
/* CONSTANTS */
#define PI 3.141592653589793
const ll MOD = 1e9 + 7;
const ll INF = 1000000000;
const ll MAX_N = 2e5 + 2;
// #define cerr if(false)cerr
/* CODE STARTS HERE */
void solve(){
int n; cin >> n;
vi a(n),b(n),c(n);
rep(i,0,n) cin >> a[i];
rep(i,0,n) cin >> b[i];
rep(i,0,n) cin >> c[i];
sort(all(a)) , sort(all(c));
ll ans = 0,temp1,temp2;
rep(i,0,n){
auto it1 = lb(all(a),b[i]) - a.begin();
auto it2 = ub(all(c),b[i]) - c.begin();
temp1 = it1, temp2 = n - it2;
ans += (temp1 * temp2);
}
cout << ans;
}
int main(){
IOS;
solve();
} | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl "\n"
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define co(x) cout << x << endl
#define coel cout << endl
#define pb push_back
#define sz(v) ((ll)(v).size())
using namespace std;
const double pi = acos(-1.0);
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define pp pair<ll, pair<ll, ll>>
#define fi first
#define se second
////////////////////////////////////////////////////////
int main() {
ll n; cin >> n;
string s, t; cin >> s >> t;
ll a = 2*n;
ll ans = a;
rep(i, 0, n){
string ss = s.substr(n-1-i, i+1), tt = t.substr(0, i+1);
if(ss == tt) chmin(ans, a-i-1);
}
co(ans);
return 0;
}
| 0 |
#include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define LAST(x) x[x.size()-1]
#define ALL(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a -= b)
#define CEIL(a,b) ((a+b-1)/b)
int FACT(int a) {
if (a == 0)
return 1;
else
return a * FACT(a - 1);
}
int nPr(int n, int r) {
int s = n-r+1;
int sum = 1;
for(int i =s;i<=n;i++)
sum *= i;
return sum;
}
//int nCr1(int n, int r)
//int nCr2(int n, int r)
int GCD(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b) // assuming a,b >= 1
{
return a * b / GCD(a, b);
}
double LOG(int a, int b) {
return log(b) / log(a);
}
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
using namespace std;
#pragma endregion
signed main() {
int x, y,z=0;
cin >> x >> y;
if (x == 1 && y == 1)
cout << 1000000;
else
cout << max(z, 100000 * (4 - x)) + max(z, 100000 * (4 - y));
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define mod 1000000007
#define MAX 510000
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main(){
lli A,B,C,D,E,F,N,M,K,L,X,Y,Z,H,W,sum=0,num=0,flag=0;string S,T;
cin >> X >> Y;
if(X==3)sum+=100000;
if(X==2)sum+=200000;
if(X==1)sum+=300000;
if(Y==3)sum+=100000;
if(Y==2)sum+=200000;
if(Y==1)sum+=300000;
if(X==Y&&Y==1)sum+=400000;
Out(sum);
} | 1 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
vector<int> v;
int x, y, res(2019);
int main() {
DAU
cin >> x >> y;
for (int i = x; i <= min(x + 2020, y); ++i)
v.emplace_back(i % 2019);
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
for (size_t i = 0; i < v.size(); ++i)
for (size_t j = i + 1; j < v.size(); ++j)
res = min(res, (v[i] * v[j]) % 2019);
cout << res;
PLEC
}
| #include <bits/stdc++.h>
using namespace std;
namespace program
{
namespace IO
{
struct input_t
{
static const int BUF_SIZ = 500000;
FILE *f;
char Buf[BUF_SIZ], *p, *pend;
input_t(FILE *_f) : f(_f), p(Buf), pend(Buf) {}
~input_t() { fclose(f); }
char getchar();
template <typename T>
T read();
};
char input_t::getchar()
{
if (p >= pend)
{
p = Buf;
pend = Buf + fread(Buf, sizeof(char), BUF_SIZ, f);
if (p >= pend)
return EOF;
}
return *p++;
}
template <typename T>
T input_t::read()
{
T s = 0;
int fl = 0;
char ch;
while (!isdigit(ch = getchar()))
fl ^= (ch == '-');
do
s = s * 10 + ch - '0';
while (isdigit(ch = getchar()));
return fl ? -s : s;
}
struct output_t
{
static const int BUF_SIZ = 500000;
FILE *f;
char Buf[BUF_SIZ], *p, *const pend;
output_t(FILE *_f) : f(_f), p(Buf), pend(Buf + BUF_SIZ) {}
~output_t()
{
fwrite(Buf, sizeof(char), p - Buf, f);
fclose(f);
}
void putchar(char ch);
template <typename T>
void write(T x);
void puts(const char *ch);
};
void output_t::putchar(char ch)
{
*p++ = ch;
if (p >= pend)
{
fwrite(Buf, sizeof(char), p - Buf, f);
p = Buf;
}
}
template <typename T>
void output_t::write(T x)
{
static char St[30];
char *top = St;
if (x < 0)
{
putchar('-');
x = -x;
}
do
*top++ = x % 10 + '0';
while (x /= 10);
while (top > St)
putchar(*--top);
}
void output_t::puts(const char *ch)
{
while (*ch)
putchar(*ch++);
putchar('\n');
}
}
IO::input_t input(stdin);
IO::output_t output(stdout);
typedef long long big;
const int MAXN = 100000;
template <typename T>
vector<T> &operator*=(vector<T> &A, vector<int> B)
{
vector<T> C = A;
for (int i = 0; i < A.size(); i++)
A[i] = C[B[i]];
return A;
}
template <typename T1, typename T2>
void qpow(T1 &S, T2 X, big n)
{
while (n)
{
if (n & 1)
S *= X;
X *= X;
n >>= 1;
}
}
void work()
{
int n = input.read<int>(), m;
big k;
vector<big> X;
vector<int> C;
for (int i = 0; i < n; i++)
{
X.push_back(input.read<big>());
C.push_back(i);
}
for (int i = n - 1; i > 0; i--)
X[i] -= X[i - 1];
m = input.read<int>();
k = input.read<big>();
while (m--)
{
int x = input.read<int>();
swap(C[x - 1], C[x]);
}
qpow(X, C, k);
for (int i = 1; i < n; i++)
X[i] += X[i - 1];
for (int i = 0; i < n; i++)
{
output.write(X[i]);
output.puts(".0");
}
}
}
int main()
{
program::work();
return 0;
}
| 0 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
// ===============================================================
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
// ===============================================================
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
//最大公約数
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
//最小公倍数
ll box(double a)
{
ll b = a;
return b;
}
//切り捨て
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
//四捨五入
ll sum(ll n) {
return (1 + n) * n / 2;
}
//1から整数nまでの合計
bool prime(ll a)//素数判定、primeならtrue,違うならfalse
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double sqrtNum = sqrt(a);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (a % i == 0)
{
return false;
}
}
// 素数である
return true;
}
//素数判定
// ===============================================================
int main() {
ll n; cin >> n;
ll q; cin >> q;
string a;
cin >> a;
vl x(q);
vl y(q);
for (int i = 0; i < q; i++) {
cin >> x[i] >> y[i];
}
vector<ll> dataa(n);
vector<ll> datab(n);
ll count = 0;
for (int i = 0; i < n - 1; i++) {
if (a.substr(i, 2) == "AC") {
count++;
dataa[i] = count;
datab[i + 1] = count;
}
else {
dataa[i] = datab[i + 1] = count;
}
}
for (int i = 0; i < q; i++) {
cout << datab[y[i] - 1] - datab[x[i] - 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
struct StQuery
{
StQuery() : m_nLeft(0), m_nRigt(0) { }
int m_nLeft;
int m_nRigt;
};
void input(string& rsStr, vector<StQuery>& rvoQuery)
{
int nStrSiz, nQuerySiz;
cin >> nStrSiz >> nQuerySiz;
rvoQuery.resize(nQuerySiz);
cin >> rsStr;
for (StQuery& roQuery : rvoQuery)
cin >> roQuery.m_nLeft >> roQuery.m_nRigt;
}
void calcSubStrACCnt(string sStr, const vector<StQuery>& cnrvoQuery)
{
vector<int> vnCumlSum(sStr.size() + 1); // 累積和
//vnCumlSum_ix 0 1 2 3 4 5 6 7 8
//sStr_pos 1 2 3 4 5 6 7 8
//sStr A C A C T A C G
//sStr_ix 0 1 2 3 4 5 6 7
for (int nBgn = 0; nBgn < vnCumlSum.size() - 1; nBgn++)
{
vnCumlSum[ nBgn + 2 ] = vnCumlSum[ nBgn + 1 ];
if (sStr[nBgn] == 'A' && sStr[nBgn + 1] == 'C')
vnCumlSum[ nBgn + 2 ]++;
}
for (int i = 0; i < cnrvoQuery.size(); i++)
{
cout << vnCumlSum[ cnrvoQuery[i].m_nRigt ] - vnCumlSum[ cnrvoQuery[i].m_nLeft ];
cout << endl;
}
}
int main()
{
string sStr;
vector<StQuery> voQuery;
input(sStr, voQuery);
calcSubStrACCnt(sStr, voQuery);
return 0;
} | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= int(n); i++)
#define rep(i,n) reps(i,0,int(n)-1)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sz size()
#define eb emplace_back
int memo[64][64];
int main(void){
while(1){
int n,p;
int pl[64] = {0};
int ans = -1;
int bowl;
cin >> n >> p;
bowl = n;
if(n+p==0)break;
if(memo[n][p] == 0){
bowl = p;
rep(i,1000000){
if(bowl){
bowl--;
pl[(i%n)]++;
if(pl[i%n] == p){ans = i%n;break;}
}else{
bowl = pl[i%n];
pl[i%n] = 0;
}
}
cout << ans << endl;
memo[n][p] = ans;
}else{
cout << memo[n][p] << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define MEM(a,n) memset(a,n,sizeof(a))
#define p(S) cout<<(S)<<endl
using namespace std;
int main(){
int n,p;
while(cin>>n>>p,n){
int a[50],center=p;
MEM(a,0);
int ans;
REP(i,0,n){
if(center>0) {
a[i]++;
center--;
}
else{
center+=a[i];
a[i]=0;
}
if(center==0){
bool flag=true;
REP(j,0,n){
if(i==j) continue;
if(a[j]!=0){
flag=false;
break;
}
}
if(flag) {
ans=i;
break;
}
}
if(i==n-1) i=-1;
}
p(ans);
}
return 0;
} | 1 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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 big=1e18;
const double PI=2*asin(1);
int main() {
ll x, y;
cin>>x>>y;
priority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll> >, greater<tuple<ll, ll, ll> > >que;
que.push(make_tuple(0, x, y));
tuple<ll, ll, ll> state;
ll path, xx, yy;
ll ans;
map<pair<ll, ll>, int> amap;
while(!que.empty()){
state = que.top();que.pop();
path = get<0>(state);
xx = get<1>(state);
yy = get<2>(state);
if(xx==yy){
ans = path;
break;
}
if(amap[mp(xx, yy)]>0) continue;
amap[mp(xx, yy)]++;
if(amap[mp(-xx, yy)]==0){
que.push(make_tuple(path+1, -xx, yy));
}
if(xx<yy){
if(amap[mp(yy, yy)]==0){
que.push(make_tuple(path+yy-xx, yy, yy));
}
}
if(xx<-yy){
if(amap[mp(-yy, yy)]==0){
que.push(make_tuple(path-yy-xx, -yy, yy));
}
}
}
cout<<ans<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
ll n;
cin>>n;
vector<ll>cnt(n+1,0);
while(n>1)
{
ll x=n;
for(ll i=2;i<=x;i++)
{
while(x%i==0)
{
cnt[i]++;
x=x/i;
}
}
n--;
}
ll ans=1;
for(auto x:cnt)
{
//cout<<x<<" ";
ans*=(x+1);
ans=mod(ans);
}
cout<<ans;
}
int main()
{
fast;
ll t;
// cin>>t;
t=1;
while(t--)
test_cases();
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
string s;
ll n;
cin >> s;
n = s.size();
vector<ll>cnt(26);
rep(i,0,n) cnt[s[i]-'a']++;
ll ans = 1+n*(n-1)/2;
rep(i,0,26) ans -= cnt[i]*(cnt[i]-1)/2;
cout << ans << endl;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 //1e4
#define base10_5 100000 //1e5
#define base10_6 1000000 //1e6
#define base10_7 10000000 //1e7
#define base10_8 100000000 //1e8
#define base10_9 1000000000 //1e9
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ld long double
#define ull unsigned long long
#define vint vector<int>
#define vll vector<ll>
//#include <stack>
//#include <queue>
// #include <iomanip>
// cout << fixed << setprecision(15) << y << endl;
string ans_Yes = "Yes";
string ans_No = "No";
string ans_yes = "yes";
string ans_no = "no";
ll A;
ll B;
ll C;
ll N;
ll M;
ll K;
ll ltmp;
string stmp;
double dtmp;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
//N = 1000000000000001;
ll num_mozi;
ltmp = N;
ll base = 26;
while(ltmp>base){
ltmp -= base;
base*=26;
num_mozi++;
}
base = base/26;
//cout << num_mozi << endl;
//cout << ltmp << endl;
//cout << base << endl;
ltmp = N ;
string S = "";
ll val = ltmp % 26;
ltmp -= val;
if(val==0){
val = 26;
//val = ltmp / 26;
ltmp-=26;
}
S = char('a'+val-1) + S;
while(ltmp>0){
ltmp = ltmp / 26;
val = ltmp % 26;
ltmp -= val;
if(val==0){
val = 26;
ltmp-=26;
}
S = char('a'+val-1) + S;
}
cout << S;
} | 0 |
#include<stdio.h>
#include<string.h>
#include<math.h>
void p(int,int);
int a,s,d[4]={0,-1,0,1},f[4]={-1,0,1,0},g,h,c,x;
char z[13][13];
int main(void)
{
int i,j;
while(scanf("%s",z[0])!=EOF){
for(i=1;i<12;i++) scanf("%s",z[i]);
g=0;
for(i=0;i<12;i++){
for(j=0;j<12;j++){
if(z[i][j]=='1'){
g++;
p(i,j);
}
}
}
printf("%d\n",g);
}
}
void p(int x,int c)
{
int i,j;
z[x][c]='0';
for(i=0;i<4;i++){
if(x+d[i]<12&&x+f[i]>=0&&z[x+d[i]][c]=='1') p(x+d[i],c);
if(c+d[i]>=0&&c+f[i]<12&&z[x][c+f[i]]=='1') p(x,c+f[i]);
}
} | #include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> Vint;
#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)
signed main(void){
int i, j, k;
for(int testcase = 0;testcase >= 0;testcase++){
int3(m, nin, nax); if(!(m|nax|nin))break;
int p[m]; scn(m, p);
int res = 0, resi;
nin--; nax--;
for(i = nin;i <= nax;++i){
if(res <= p[i] - p[i + 1]){ res = p[i] - p[i + 1]; resi = i + 1; }
}
pri(resi);
//*/
//*/ break;
}
return 0;
} | 0 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
const ll MOD=1000000007;
const ll MAX_N=500010;
const ll INF=999999999999;
int main(){
ll a,b,k;
cin>>a>>b>>k;
bool flag=true;
while(k){
if(flag){
a/=2;
b+=a;
flag=false;
}else{
b/=2;
a+=b;
flag=true;
}
k--;
}
cout<<a<<" "<<b<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(2);
int k;
cin >> a[0] >> a[1] >> k;
int times = 0;
int side = 0;
while(1){
if(a[side] % 2 == 1) a[side] -= 1;
a[side] /= 2;
a[(side+1)%2] += a[side];
side += 1;
side %= 2;
times += 1;
if(times == k) break;
}
cout << a[0] << " " << a[1] << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool a=true;
if(S.size()%2==1) a=false;
else for(int i=0;i<S.size()/2;i++){
if(S.at(i*2)!='h'||S.at(i*2+1)!='i') a=false;
}
if(a)cout << "Yes" << endl;
else cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
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; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
constexpr int INF = 1e9+5;
constexpr long long INFLL = 1LL<<60;
constexpr double eps = (1e-9);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
if (n == 0) {
cout << 0 << endl;
return 0;
}
string ans;
while (n != 0) {
if (n % 2 == 0) ans.append("0"); // 後で reverse するので末尾に足す
else {
ans.append("1");
n -= 1; // 余りを取り除く
}
n /= -2;
}
reverse(ALL(ans));
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
struct dish{
ll A,B;
bool operator<(const dish &o) const {return A+B < o.A+o.B;}
bool operator>(const dish &o) const {return A+B > o.A+o.B;}
};
int main(){
ll N,i,ans = 0;scanf("%lld",&N);
dish D[N];
for(i=0;i<N;i++) scanf("%lld%lld",&D[i].A,&D[i].B);
sort(D,D+N,greater<dish>());
for(i=0;i<N;i++){
if(i&1) ans -= D[i].B;
else ans += D[i].A;
}
printf("%lld\n",ans);
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n;
cin >> n;
vi A(n), B(n), C(n);
rep(i,n) cin >> A[i];
rep(i,n) cin >> B[i];
rep(i,n) cin >> C[i];
sort(A.begin(), A.end());
sort(B.begin(), B.end());
sort(C.begin(), C.end());
ll ans = 0;
rep(i,n){
ll x = lower_bound(A.begin(), A.end(), B[i]) - A.begin();
ll y = C.end() - upper_bound(C.begin(), C.end(), B[i]);
ans += x * y;
//cout << ans << endl;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <vector>
using namespace std;
int n,m,q,v[2002][2002],e[2][2002][2002];
string s[2002];
int main(void){
cin>>n>>m>>q;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
v[i][j]=e[0][i][j]=e[1][i][j]=0;
}
}
for(int i=0;i<n;i++){
cin>>s[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(s[i-1][j-1]=='1'){
v[i][j]++;
if(j>1){
if(s[i-1][j-2]=='1'){
e[0][i][j]++;
}
}
if(i>1){
if(s[i-2][j-1]=='1'){
e[1][i][j]++;
}
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
v[i][j]+=v[i][j-1];
e[0][i][j]+=e[0][i][j-1];
e[1][i][j]+=e[1][i][j-1];
}
}
for(int j=1;j<=m;j++){
for(int i=1;i<=n;i++){
v[i][j]+=v[i-1][j];
e[0][i][j]+=e[0][i-1][j];
e[1][i][j]+=e[1][i-1][j];
}
}
for(int i=0;i<q;i++){
int a,b,c,d;
cin>>a>>b>>c>>d;
int t=0;
t+=v[c][d]-v[c][b-1]-v[a-1][d]+v[a-1][b-1];
t-=e[0][c][d]-e[0][c][b]-e[0][a-1][d]+e[0][a-1][b];
t-=e[1][c][d]-e[1][c][b-1]-e[1][a][d]+e[1][a][b-1];
cout<<t<<endl;
}
}
| #include <cstdio>
using namespace std;
namespace roadagain
{
struct union_find_node
{
unsigned parent;
unsigned lank;
union_find_node() = default;
union_find_node(unsigned num)
{
this->parent = num;
this->lank = 1;
}
};
class union_find_tree
{
public:
union_find_tree(unsigned size) : size(size), group(size)
{
this->forest = new union_find_node[size];
for (unsigned i = 0; i < size; i++){
this->forest[i] = union_find_node(i);
}
}
~union_find_tree()
{
delete[] this->forest;
}
unsigned get_size()
{
return (this->size);
}
unsigned get_group()
{
return (this->group);
}
void unite(unsigned a, unsigned b)
{
if (this->forest[a].lank <= this->forest[b].lank){
this->forest[b].parent = this->forest[a].parent;
this->forest[a].lank++;
}
else {
this->forest[a].parent = this->forest[b].parent;
this->forest[b].lank++;
}
this->group--;
}
unsigned find(unsigned num)
{
if (this->forest[num].parent == num){
return (num);
}
return (this->forest[num].parent = find(this->forest[num].parent));
}
bool same(unsigned a, unsigned b)
{
return (this->find(a) == this->find(b));
}
private:
const unsigned size;
unsigned group;
union_find_node* forest;
};
}
using namespace roadagain;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
union_find_tree* uf;
char map[16][16];
void island(int y, int x)
{
if (map[y][x] == '0') return;
map[y][x] = '0';
for (int i = 0; i < 4; i++){
int tx = x + dx[i];
int ty = y + dy[i];
if (0 <= tx && tx < 12 && 0 <= ty && ty < 12){
uf->unite(y * 12 + x, ty * 12 + tx);
island(ty, tx);
}
}
}
int main()
{
while (~scanf("%s", map[0])){
for (int i = 1; i < 12; i++){
scanf("%s", map[i]);
}
uf = new union_find_tree(12 * 12);
int cnt = 0;
for (int i = 0; i < 12; i++){
for (int j = 0; j < 12; j++){
if (map[i][j] == '1'){
cnt++;
island(i, j);
}
}
}
printf("%d\n", cnt);
delete uf;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); i++)
#define REP(i,n) for (int i=0; i<(n); i++)
#define RREP(i,n) for (int i=(n-1); i>=0; i--)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define bug(x) cerr<<#x<<" is "<<x<<endl
using namespace std;
#define int ll
const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;
void GG(){cout<<"Impossible\n"; exit(0);}
ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
ll re=1;
while (n>0){
if (n&1) re = re*a %mo;
a = a*a %mo;
n>>=1;
}
return re;
}
ll inv (ll b, ll mo = mod){
if (b==1) return b;
return (mo-mo/b) * inv(mo%b) % mo;
}
const int maxn = 1e5+5;
ll gcd(ll a, ll b){
if (b==0) return a;
return gcd(b,a%b);
}
main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, m; cin>>n>>m;
vector<int> e, o;
REP(i,m){
int x; cin>>x; if (x&1)o.pb(x); else e.pb(x);
}
if (SZ(o)>2) GG();
vector<int> re;
vector<int> mo;
if (SZ(o)) mo.pb(o[0]);
mo.insert(mo.end(),ALL(e));
if (SZ(o)>1) mo.pb(o[1]);
REP(i, SZ(mo)){
if (i==0) {if (mo[i]!=1) re.pb(mo[i]-1);}
else if (i==SZ(mo)-1){
re.pb(mo[i]+1);
} else re.pb(mo[i]);
}
int s = 0; REP(i, SZ(re)) s += re[i];
if (s!=n) re.pb(n-s);
REP(i, SZ(mo)) cout<<mo[i]<<' '; cout<<endl;
cout<<SZ(re)<<endl;
REP(i, SZ(re)) s+=re[i],cout<<re[i]<<' ';
} | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,a[100005];
int main()
{
scanf("%d%d",&n,&m);
int ct=0;
for(int i=1;i<=m;i++)
{
scanf("%d",&a[i]);
if(a[i]%2) ct++;
}
if(ct>2)
{
printf("Impossible\n");
return 0;
}
int id1=0,id2=0;
for(int i=1;i<=m;i++)
if(a[i]%2)
{
if(!id1) id1=i;
else if(!id2) id2=i;
}
if(id1)
{
if(id2==1) id2=id1;
swap(a[1],a[id1]);
}
if(id2) swap(a[m],a[id2]);
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;
}
if(!id2)
{
for(int i=1;i<=m;i++)
printf("%d ",a[i]);
printf("\n%d\n",m);
for(int i=1;i<=m;i++)
{
if(i==1) printf("%d ",a[i]+1);
else if(i==m) printf("%d ",a[i]-1);
else printf("%d ",a[i]);
}
return 0;
}
if(n==2&&m==2)
{
printf("1 1\n1\n2\n");
return 0;
}
if(n==4&&m==3)
{
printf("1 2 1\n2\n2 2\n");
return 0;
}
if(a[1]==1&&a[m]==1)
{
for(int i=1;i<=m;i++)
printf("%d ",a[i]);
printf("\n%d\n",m-1);
for(int i=2;i<=m;i++)
{
if(i==m) printf("%d ",a[i]+1);
else printf("%d ",a[i]);
}
return 0;
}
for(int i=1;i<=m;i++)
printf("%d ",a[i]);
printf("\n%d\n",m);
for(int i=1;i<=m;i++)
{
if(i==1) printf("%d ",a[i]+1);
else if(i==m) printf("%d ",a[i]-1);
else printf("%d ",a[i]);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define print(a) printf("%d\n",a);
#define scanii(a,b) scanf("%d %d",&a,&b);
#define printii(a,b) printf("%d\n%d\n",a,b);
#define scaniii(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define ll long long
#define ull unsigned long long
#define sll signed long long
#define pi acos(-1)
#define mod 1000000007
#define TRUE 1
#define FALSE 0
#define ZERO 0
#define MP make_pair
#define F first
#define S second
#define f1(i,a) for(int i=0;i<a;++i)
#define f2(i,a) for(int i=a-1;i>=0;--i)
#define en puts("");
#define elif else if
typedef ll int lli;
typedef sll int slli;
typedef ull int ulli;
const int sz=10000;
using namespace std;
int clue();
int result();
void show();
bool check();
bool cmp(pair<int,int>p,pair<int,int>q) {
// return p.first>q.first;//descending by first
// return p.first<q.first;//ascending by first
// return p.second>q.second;//descending by second
return p.second<q.second;//ascending by second
}
// bool cmp(int p,int q) {
// return p>q;//descending
// return p<q;//ascending
// }
int main() {
int t;
// cin>>t;
t=1;
while(t-->0) {
clue();
}
return 0;
}
int clue() {
int a,b,c;
cin>>a>>b>>c;
cout<<c<<" "<<a<<" "<<b<<endl;
// (det)?cout<<"Yes"<<endl:cout<<"No"<<endl;
return 0;
} | #include <stdio.h>
int main(){
int X,Y,Z;
int *px,*py,*pz;
scanf("%d",&X);
scanf("%d",&Y);
scanf("%d",&Z);
px = &Z;
py = &X;
pz = &Y;
printf("%d %d %d",*px,*py,*pz);
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int k;
cin >> k >> s;
int n = s.size();
if(n <= k){
cout << s << endl;
return 0;
}else{
int i = 0;
while(i<=k-1){
cout << s.at(i);
if(i==k-1){
cout << "..." << endl;
return 0;
}
i++;
}
}
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main ()
{
int M,N,mo[10000],sk[10000]={};
cin>>N>>M;
for(int i=0;i<N;i++)
{
cin>>mo[i];
}
for(int i=0;i<M;i++)
{
int aa;
cin>>aa;
for(int q=0;q<N;q++)
{
if(mo[q]<=aa){sk[q]++;
break;
}
}
}
int z=0,b=0;
for(int i=0;i<N;i++)
{
if(sk[i]>b){
b=sk[i];
z=i;
}
}
z++;
cout<<z<<endl;
return 0;
} | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<P> lr(n);
rep(i, n) cin >> lr[i];
sort(all(lr));
int ans = 0;
vi mil(n+1, INT_MAX), mir(n+1, INT_MAX);
rep(i, n) {
mil[i+1] = min(mil[i], lr[i].second);
mir[n-1-i] = min(mir[n-i], lr[n-1-i].second);
}
int min = INT_MAX;
rep(i, n-1) {
chmin(min, lr[i].second);
if(min < lr[i].first) break;
chmax(ans, min-lr[i].first + mir[i+1]-lr[n-1].first + 2);
}
rep(i, n) {
chmax(ans, lr[i].second - lr[i].first + 1 + (mil[n] >= lr[n-1].first?mil[n]-lr[n-1].first+1:0));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<int, int> intersect(const pair<int, int> &lhs, const pair<int, int> &rhs) {
return {max(lhs.first, rhs.first), min(lhs.second, rhs.second)};
}
int length(const pair<int, int> &interval) {
if (interval.first > interval.second) {
return 0;
} else {
return interval.second - interval.first + 1;
}
}
int main() {
int n = 0;
cin >> n;
vector<pair<int, int>> seg(n);
pair<int, int> left = {0, 1e9}, right = {0, 1e9};
for (auto &i:seg) {
cin >> i.first >> i.second;
if (i.first > right.first) {
right = i;
}
if (i.second < left.second) {
left = i;
}
}
for (int i = 0; i < seg.size(); ++i) {
if (seg[i] == left) {
seg.erase(begin(seg) + i);
i--;
if (seg.empty()) {
break;
} else {
continue;
}
}
if (seg[i] == right) {
seg.erase(begin(seg) + i);
i--;
if (seg.empty()) {
break;
} else {
continue;
}
}
}
int ans = 0;
if (!seg.empty()) {
pair<int, int> inter = {0, -1};
for (const auto &i:seg) {
if (length(i) > length(inter)) {
inter = i;
}
}
ans = length(inter) + length(intersect(left, right));
} else {
ans = length(left) + length(right);
}
if (!seg.empty()) {
sort(begin(seg), end(seg));
vector<int> suf(seg.size());
suf[seg.size() - 1] = seg[seg.size() - 1].second;
for (int i = static_cast<int>(seg.size()) - 2; i >= 0; --i) {
suf[i] = min(suf[i + 1], seg[i].second);
}
for (int i = 0; i < seg.size(); ++i) {
int first = length(intersect(seg[i], left)),
second = i + 1 < seg.size() ? length(intersect({right.first, suf[i + 1]}, right)) : length(right);
ans = max(ans, first + second);
}
ans = max(ans, length(left) + length(intersect({right.first, suf[0]}, right)));
}
cout << ans;
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
void call(int n){
for(int i = 1; i <= n; i++){
if(i % 3 == 0) cout << " " << i;
else{
for(int tmp = i; tmp != 0; tmp /= 10){
if(tmp % 10 == 3){
cout << " " << i;
break;
}
}
}
}
cout << endl;
}
int main(){
int n;
cin >> n;
call(n);
return 0;
} | #include<iostream>
using namespace std;
int x, i = 1;
int n;
void check_num();
void include3();
void end_check_num();
void check_num() {
x = i;
if (x % 3 == 0){
cout << " " << i;
end_check_num();
}else include3();
}
void include3() {
if (x % 10 == 3){
cout << " " << i;
end_check_num();
}else{
x /= 10;
if (x)include3();
else end_check_num();
}
}
void end_check_num() {
if (++i <= n) check_num();
}
int main() {
cin >> n;
check_num();
cout << endl;
char c;
cin >> c;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sort(x) sort(x.begin(), x.end());
#define rese(x) reverse(x.begin(), x.end());
int main() {
int a,b;
cin>>a>>b;
cout<<a*b<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) for(auto it=x.begin();it!=x.end();it++) cout<<*it<<' '; cout<<'\n';
#define debug(a,b,c) cout << a << " " << b << " " << c << endl;
#define in(x,n) for(int e=0;e<n;e++){int y;cin>>y;x.pb(y);}
#define inl(x,n) for(int e=0;e<n;e++){ll y;cin>>y;x.pb(y);}
#define lower(sl) transform(sl.begin(), sl.end(), sl.begin(), ::tolower);
#define endl "\n";
#define pi pair<int,int>
#define vpi vector<pair<int,int>>
#define vvi vector<vector<int>>
int solve(int st, vi a, int& ans,int& n){
if(st > n ) return 0;
int res = 0;
int x1 = solve(st*2, a, ans, n);
int x2 = solve(st*2+1, a, ans, n);
int l1 = (st*2-2)>=a.size()?0:a[st*2-2];
int l2 = (st*2-1)>=a.size()?0:a[st*2-1];
l2 += x2; l1+=x1;
ans += abs(l2-l1);
return max(l1,l2);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//code here
int a, b;
cin >> a>> b;
cout << (ll) a*b << endl;
} | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n,tmp;
cin >> n;
int a[110];
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = n-1; i >= 0;i--){
cout << a[i];
if(i != 0){
cout << " ";
}
}
/*ソートじゃなかった！
for(int i = 0;i < n-1; i++){
for(int j = n-1;j > i;j--){
if(a[j-1] < a[j]){
tmp = a[j-1];
a[j-1] = a[j];
a[j] = tmp;
}
}
}
for(int i = 0;i < n; i++){
cout << a[i];
if(i != n-1){
cout << " ";
}
}
*/
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ins insert
#define eb emplace_back
#define endl '\n'
#define ll long long
#define ld long double
#define vl vector<ll>
#define tc ll t; cin >> t; while (t--)
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define sz(c) (ll) c.size()
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define trav(x,c) for(auto &x : c)
#define _for(i,a,n) for(ll i = a ; i < n ; ++i)
#define _rfor(i,a,n) for(ll i = n-1 ; i >= a ; --i)
#define dx(x) cout << #x << ": " << x << endl;
#define dc(c) trav(x,c) cout << x << " "; cout << endl;
#define godspeed ios::sync_with_stdio(0); cin.tie(0);
int main() {
godspeed;
set<int> s;
int x;
while(cin >> x) {
s.ins(x);
}
if(sz(s) == 2) yes;
else no;
} | 0 |
#include <stdio.h>
//#include <math.h>
using namespace std;
int log10(int n) {
int keta = 0;
do{
n /= 10;
keta++;
} while (n > 0);
return keta;
}
int main() {
const int MAX_N = 20;
int N;
int table[MAX_N][MAX_N];
while (1) {
for (int i = 0;i < MAX_N;i++) {
for (int j = 0;j < MAX_N;j++) {
table[i][j] = 0;
}
}
scanf("%d", &N);
if (!N)break;
for (int i = 0;i < N;i++) {
for (int j = 0;j < N;j++) {
scanf("%d", &table[i][j]);
}
}
for (int i = 0;i < N;i++) {
for (int j = 0;j < N;j++) {
table[i][N] += table[i][j];
table[N][j] += table[i][j];
table[N][N] += table[i][j];
}
}
for (int i = 0;i <= N;i++) {
for (int j = 0;j <= N;j++) {
for (int k = 0;k < 5-log10(table[i][j]);k++) {
printf(" ");
}
printf("%d", table[i][j]);
}
printf("\n");
}
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
while(1){
int a,b,c,n,p[1002],q[1002],r[1002],s[1002],Q[302];
for(int i=0;i<302;i++)Q[i]=2;
scanf("%d%d%d",&a,&b,&c);
if(a==0&&b==0&&c==0)break;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d%d",&p[i],&q[i],&r[i],&s[i]);
if(s[i]==1){Q[p[i]]=1; Q[q[i]]=1; Q[r[i]]=1;}
}
for(int i=0;i<n;i++){
if(s[i]==0){
if(Q[p[i]]==1&&Q[q[i]]==1)Q[r[i]]=0;
if(Q[p[i]]==1&&Q[r[i]]==1)Q[q[i]]=0;
if(Q[r[i]]==1&&Q[q[i]]==1)Q[p[i]]=0;
}
}
for(int i=1;i<=a+b+c;i++){
printf("%d\n",Q[i]);
}
}
} | 0 |
// 解き直し.
// https://img.atcoder.jp/soundhound2018-summer-qual/editorial.pdf
#include <bits/stdc++.h>
using namespace std;
int main(){
// 1. 入力情報.
double n, m, d;
scanf("%lf %lf %lf", &n, &m, &d);
// 2. 出力.
if(d == 0) printf("%.10lf", (m - 1.0) * 1.0 / n);
else printf("%.10lf", (m - 1.0) * 2.0 * (n - d) / n / n);
return 0;
} | #include <iostream>
using namespace std;
int main()
{
string date;
getline(cin,date);
string date2;
date2=date.substr(4,6);
cout << "2018"<< date2;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i)
{
cin >> a >> b;
v.push_back({a, b});
}
vector<vector<ll>> dp(n, vector<ll>(n, -1));
function<ll(int, int)> f = [&](int i, int j)
{
if (i == j)
return 0LL;
if (dp[i][j] != -1)
return dp[i][j];
ll r = 1LL<<62;
for (int k = i; k < j; ++k)
r = min(r, f(i, k)+f(k+1, j)+v[i].first*v[j].second*v[k].second);
return dp[i][j]=r;
};
cout << f(0, n-1) << "\n";
return 0;
}
| // http://algorithms.blog55.fc2.com/blog-entry-66.html
#include <stdio.h>
#include <string.h>
#define M 100
int N,R[M+1],C[M][M],B[M][M];
void compute(){
int i=0,j,k,cost;
memset(C,99,sizeof(C));
for(;i<N;i++)C[i][i]=0;
for(j=1;j<N;j++)
for(i=0;i<N - j; i++ )
for (k = i; k < i + j; k++ ){
cost = C[i][k] + C[k+1][i+j] + R[i]*R[k+1]*R[i+j+1];
if(cost<C[i][i+j])C[i][i+j]=cost,B[i][i+j]=k;
}
}
void order( int i, int j ){
if(i==j)printf("M%d",i);
else{
printf("(");
order( i, B[i][j]-1 ); order(B[i][j], j);
printf(")");
}
}
void input(){
scanf("%d",&N);
int z,i=0;
for(;i<N;i++)scanf("%d%d",R+i,&z);
R[i]=z;
}
void output(){
printf("%d\n",C[0][N-1]);
//order(0, N);
//puts("");
}
main(){
input();
compute();
output();
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 3e5;
const LL MOD = 1e9+7;
inline LL dmod(LL x){
return x%MOD;
}
LL fakto[N+5];
void pre(){
fakto[0] = 1LL;
for(int i=1;i<=N;i++){
fakto[i] = dmod(fakto[i-1]*(LL)(i));
}
return;
}
LL fe(LL x, LL y){
if(y==0) return 1LL;
LL ret = fe(x,y/2);
ret = dmod(ret*ret);
if(y&1){
ret = dmod(ret*x);
}
return ret;
}
LL nCr(LL x, LL y){
LL tmp = dmod(fakto[y]*fakto[x-y]);
tmp = fe(tmp,MOD-2);
tmp = dmod(tmp*fakto[x]);
return tmp;
}
LL step(int x, int y, int a, int b){
int dx = a-x;
int dy = b-y;
int tot = dx+dy;
return nCr(tot,dx);
}
int h,w,a,b;
int main(){
pre();
cin >> h >> w >> a >> b;
LL ret = 0LL;
for(int i=1;i<=h-a;i++){
LL tmp = step(1,1,i,b);
tmp = dmod(tmp*step(i,b+1,h,w));
ret = dmod(ret+tmp);
}
cout << ret << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const long long mod=1000000007;
const int maxn=200005;
ll inv[maxn],s[maxn];
int N,n,m,x,y;
ll Pow(ll a,int b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}
ll C(int a,int b)
{
if(a<0||b<0)
return 1;
return s[a]*inv[b]%mod*inv[a-b]%mod;
}
int main()
{
scanf("%d%d",&n,&m);
scanf("%d%d",&x,&y);
N=n+m-2;
s[0]=1;
for(int i=1;i<=N;i++)
s[i]=s[i-1]*i%mod;
inv[0]=1;
inv[N]=Pow(s[N],mod-2);
for(int i=N-1;i>0;i--)
inv[i]=inv[i+1]*(i+1)%mod;
ll ans=0;
for(int i=y+1;i<=m;i++)
{
ans+=C(n-x+i-2,i-1)*C(x+m-i-1,x-1)%mod;
ans%=mod;
}
printf("%lld\n",ans);
return 0;
} | 1 |
#include<stdio.h>
int main(){
char S[100], T[100];
scanf("%s %s", S, T);
printf("%s%s\n", T, S);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
ll k,x;
cin>>k>>x;
ll n=k-1;
for(ll i=x-n;i<=x+n;i++){
cout<<i<<" ";
}
cout<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll x; cin>>x;
ll ans=x/11*2;
x%=11;
if(x!=0)
{
if(x>=7)
{
ans++;
}
ans++;
}
cout<<ans<<endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int a, b, l, x;
char c;
while (getline(cin, str)) {
x = 0;
l = (int)str.size();
for (int i=0; i<l; i++) {
c = str.at(i);
if (c == 'I') a = 1;
else if (c == 'V') a = 5;
else if (c == 'X') a = 10;
else if (c == 'L') a = 50;
else if (c == 'C') a = 100;
else if (c == 'D') a = 500;
else if (c == 'M') a = 1000;
if (i) {
if (b >= a) {
x += b;
} else {
x -= b;
}
}
b = a;
}
x += b;
cout << x << endl;
}
return 0;
} | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
ll n, T;
cin >> n >> T;
ll ans = 0;
vector<ll> t(n);
rep(i, n)
{
cin >> t[i];
}
rep(i, n)
{
if (i + 1 >= n)
{
ans += T;
}
else if (t[i + 1] > t[i] + T)
{ //かぶっていなかったら
ans += T;
}
else
{
ans += t[i + 1] - t[i];
}
// cout << ans << endl;
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, T;
cin >> N >> T;
long long ans = 0LL;
long long prevt;
cin >> prevt;
for (long long i = 1; i < N; ++i) {
long long t;
cin >> t;
if (T <= t - prevt) {
ans += T;
}
else {
ans += t - prevt;
}
prevt = t;
}
ans += T;
cout << ans << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 1 |
#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int main() {
int n, a[100],ans;
float sum = 0,min=101.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum /= n;
for (int i = 0; i < n; i++) {
if (fabs(a[i] - sum) == min)continue;
if (fabs(a[i] - sum) < min){
min = fabs(a[i] - sum);
ans = i;
}
}
cout << ans;
} | #include <iostream>
int main(void){
int N, ans=40;
std::cin >> N;
for (int i=0; i<N; ++i){
int a, cnt=0;
std::cin >> a;
while (a % 2 == 0){
a /= 2;
++cnt;
}
if (cnt < ans) ans = cnt;
}
std::cout << ans << std::endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
const Int MOD = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<int> a(N), b(M);
vector<Int> cnt_a(1000010, 0), cnt_b(1000010, 0);
bool ok = true;
for (int i = 0; i < N; ++i) {
cin >> a[i];
++cnt_a[a[i]];
if (cnt_a[a[i]] > 1) { ok = false; }
}
for (int i = 0; i < M; ++i) {
cin >> b[i];
++cnt_b[b[i]];
if (cnt_b[b[i]] > 1) { ok = false; }
}
if (!ok) {
cout << 0 << endl;
return 0;
}
Int ans = 1;
for (int i = N * M; i > 0; --i) {
if (cnt_a[i] == 0 && cnt_b[i] == 0) {
Int tmp = cnt_a[i + 1] * cnt_b[i + 1] % MOD;
tmp = (tmp + MOD - (N * M - i)) % MOD;
(ans *= tmp) %= MOD;
} else if (cnt_a[i] != 1 || cnt_b[i] != 1) {
if (cnt_a[i] > 0) {
(ans *= cnt_b[i + 1]) %= MOD;
} else {
(ans *= cnt_a[i + 1]) %= MOD;
}
}
cnt_a[i] += cnt_a[i + 1];
cnt_b[i] += cnt_b[i + 1];
}
cout << ans % MOD << endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=1010;
ll n, m, k, u, v, x, y, t, a, b, ans=1;
int A[MAXN], B[MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m;
for (int i=0; i<n; i++) cin>>A[i];
for (int i=0; i<m; i++) cin>>B[i];
sort(A, A+n);
sort(B, B+m);
reverse(A, A+n);
reverse(B, B+m);
int i=0, j=0, t=0;
for (int num=n*m; num; num--, t++){
if (A[i]!=num && B[j]!=num) ans=ans*(i*j-t)%mod;
if (A[i]!=num && B[j]==num) ans=ans*i%mod;
if (A[i]==num && B[j]!=num) ans=ans*j%mod;
i+=(A[i]==num);
j+=(B[j]==num);
}
cout<<ans<<"\n";
return 0;
}
| 1 |
#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(int i = a; i < (int)(b); i++)
#define rep(i,b) range(i,0,b)
#define eb emplace_back
typedef long long ll;
#define int ll
auto const inf = numeric_limits<int>::max()/4;
using Weight = int;
using Capacity = int;
struct Edge {
int src, dst; Weight weight;
Edge(int s, int d, int w) : src(s), dst(d), weight(w) {}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;
pair<vector<Weight>, bool> spfa(const Graph &g, int s){
const Weight inf = numeric_limits<Weight>::max()/4;
const int n = g.size(); priority_queue<int> q;
vector<Weight> dist(n, inf); vector<int> inQ(n);
vector<int> count(n);
dist[s] = 0; q.emplace(s); inQ[s] = true; ++count[s];
bool negCycle = false;
for(int i = 0; q.size(); i++){
int v = q.top(); q.pop(); inQ[v] = false;
for(auto &e : g[v]){
if(dist[v] != inf && dist[e.dst] > dist[v] + e.weight){
dist[e.dst] = dist[v] + e.weight;
if(!inQ[e.dst]){
q.emplace(e.dst); inQ[e.dst] = true; ++count[e.dst];
if(count[e.dst] >= n){ negCycle = true; goto END; }
}
}
}
}
END:;
return make_pair(dist, !negCycle);
}
signed main(){
int V,E,r;
while(cin >> V >> E >> r){
Graph g(V);
rep(i,E){
int a,b,c;
cin >> a >> b >> c;
g[a].eb(a,b,c);
}
bool ok;
vector<Weight> dist;
tie(dist, ok) = spfa(g,r);
if(ok){
for(int i = 0; i < (int)dist.size(); i++){
if(dist[i] == inf) cout << "INF";
else cout << dist[i];
cout << endl;
}
} else {
cout << "NEGATIVE CYCLE" << endl;
}
}
} | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i);
using namespace std;
const int MAX_V = 100001;
const long long INF = 1e12;
int n,m,r;
struct edge{
int to, dist;
edge(int t_to,int t_dist){
to=t_to;dist=t_dist;
}
};
typedef pair<int,int> P;//cost??¨v
vector< vector<edge> > G(MAX_V);
long long d[MAX_V];
void dijkstra(int s){
priority_queue<P,vector<P>,greater<P> > que;
fill_n((long long *)d, sizeof(d)/sizeof(long long),INF);
d[s] = 0;
que.push(P(0,s));
while(!que.empty()){
P p = que.top(); que.pop();
int v = p.second;
if(d[v]<p.first) continue;
rep(i,G[v].size()){
edge e = G[v][i];
if(d[e.to] > d[v] + e.dist){//??????????????´???
d[e.to] = d[v] + e.dist;
que.push(P(d[e.to],e.to));
}
}
}
}
int main(){
cin >> n >> m >> r;
// G.clear();
// G.resize(n);
rep(i,m){
int a,b,d;
cin >> a >> b >> d;
edge tmp1(b,d);
G[a].push_back(tmp1);
}
dijkstra(r);
rep(i,n){
//if(i==r) continue;
if(d[i]==INF) cout << "INF" <<endl;
else cout << d[i] << endl;
}
} | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
using lint = int64_t;
using P = pair<int, int>;
using D = pair<double, double>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define repn(i, a, b) for(int i = (a); i < (b); ++i)
#define Rep(i, n) for (int i = (n); i >= 0; --i)
#define All(vec) vec.begin(), vec.end()
#define cend printf("\n")
//constexpr lint mod = 998'244'353LL;
constexpr lint mod = 1000'000'007LL;
constexpr lint inf = 3LL * mod * mod;
const double Pi = 2.0 * acos(0.0);
template<class T> using prique = priority_queue<T>;
template<class T> using prique_inv = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& rhs) { return is >> rhs.first >> rhs.second; }
template<class T, class U>inline ostream& operator<<(ostream& os, const pair<T, U>& rhs) { return os << rhs.first << " " << rhs.second << "\n"; }
template<class InputIterator> void arrin(InputIterator first, InputIterator last) { for (; first != last; ++first) cin >> (*first); }
template<class InputIterator> void arrout(InputIterator first, InputIterator last) {
for (; first != last; ++first) {
cout << (*first) << " ";
}
cout << "\n";
}
constexpr bool pri(lint x) { for (lint i = 2; i * i <= x; ++i) if (x % i == 0) return false; return 1 < x; }
inline double dis(D a, D b) { return hypot(a.first - b.first, a.second - b.second); }
lint fact[3000000];
void fact_init(lint n) {
if (3000000 <= n) return;
fact[0] = fact[1] = 1;
for (lint i = 2; i <= n; ++i) {
fact[i] = i * fact[i - 1];
if (mod <= fact[i]) fact[i] %= mod;
}
}
lint modpow(lint x, lint n, lint m = mod) {
lint res = 1;
while (n > 0) {
if (n & 1) {
res *= x;
if (m <= res) res %= m;
}
x *= x;
if (m <= x) x %= m;
n >>= 1;
}
return res;
}
lint intpow(lint x, lint n) {
lint res = 1;
while (n > 0) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
lint comb(lint n, lint r) {
if (r == 0 || r == n) return 1;
lint res = fact[n] * modpow(fact[n - r], mod - 2) % mod * modpow(fact[r], mod - 2) % mod;
return res < 0 ? res + mod : res;
}
map<lint, lint> factring(lint n) {
map<lint, lint> res;
for (lint i = 2; i * i <= n; ++i) {
while (n % i == 0) {
n /= i;
++res[i];
}
}
if (n != 1) ++res[n];
return res;
}
int n, k;
bool f(vector<int>& a) {
vector<int>b(n + 1);
rep(i, n) {
b[max(0, i - a[i])]++;
b[min(n, i + a[i] + 1)]--;
}
rep(i, n) {
b[i + 1] += b[i];
}
bool res = true;
rep(i, n) {
a[i] = b[i];
res &= (a[i] == n);
}
return res;
}
int main() {
cin >> n >> k;
vector<int>a(n);
rep(i, n) {
cin >> a[i];
}
rep(i, k) {
if (f(a)) break;
}
for (int e : a) cout << e << " ";
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define fi first
#define se second
#define eb emplace_back
#define ef emplace_front
#define pof pop_front()
#define pob pop_back()
#define Rep(i,n) for(li i=0,nn=(li)(n);i!=nn;++i)
#define Rep1(i,n) for(li i=1,nn=(li)(n)+1;i!=nn;++i)
#define Size(v) (li)(v.size())
#define SortA(v) sort(v.begin(),v.end())
#define SortD(v) sort(v.rbegin(),v.rend())
#define All(a) (a).begin(),(a).end()
#define Input(a) for(li ii=0,nn=(li)(a.size());ii!=nn;++ii){cin>>(a).at(ii);}
#define Input2(a,b) for(li ii=0,nn=(li)(a.size());ii!=nn;++ii){cin>>(a).at(ii)>>(b).at(ii);}
#define mp make_pair
using li = int64_t;
using intl = int64_t;
using vi = vec<li>;
using vb = vec<bool>;
using vvi = vec<vi>;
using qi = deque<li>;
using pi = pair<li,li>;
using vpi = vec<pi>;
using si = set<li>;
using vsi = vec<si>;
using mii = map<li,li>;
using vmii = vec<mii>;
vec<li> dx = {0, 1, 0, -1, 1, 1, -1, -1};
vec<li> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr li INF = 9223372036854775807;
void Yes(li b){
if(b)cout<<"Yes";
else cout<<"No";
}
void yes(li b){
if(b)cout<<"yes";
else cout<<"no";
}
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cout.precision(16);
li N=200000,K=41;
cin >>N>>K;
vector<int> A(N,0),B(N,0);
if(K>41){
Rep(i,N){
cout<<N<<' ';
}
return 0;
}
Input(A);
li l,r;
Rep(j,K){
Rep(i,N){
l=max(0L,i-A[i]);
r=min(N-1,i+A[i]);
B[l]++;
if(r+1<N){B[r+1]--;}
}
Rep1(i,N-1){
B[i]+=B[i-1];
}
Rep(i,N){
A[i]=B[i];
B[i]=0;
}
}
for(auto&& a:A){
cout<<a<<' ';
}
} | 1 |
#include <iostream>
#define MEN 6
using namespace std;
struct IN_DICE
{
int num1;
int num2;
int num3;
int num4;
int num5;
int num6;
};
struct DICE
{
int num;
};
int main()
{
DICE A[MEN];
DICE B1[MEN];
DICE B2[MEN];
DICE B3[MEN];
IN_DICE in[100];
int flag = 0;
int x;
int n;
cin >> n;
for ( int i = 0; i < n; i++)
{
cin >> in[i].num1 >> in[i].num2 >> in[i].num3 >> in[i].num4 >> in[i].num5 >> in[i].num6;
}
for (int i1 = 0; i1 < n - 1; i1++)
{
for (int i2 = i1 + 1; i2 < n; i2++)
{
A[0].num = in[i1].num1;
A[1].num = in[i1].num2;
A[2].num = in[i1].num3;
A[3].num = in[i1].num4;
A[4].num = in[i1].num5;
A[5].num = in[i1].num6;
B1[0].num = in[i2].num1;
B1[1].num = in[i2].num2;
B1[2].num = in[i2].num3;
B1[3].num = in[i2].num4;
B1[4].num = in[i2].num5;
B1[5].num = in[i2].num6;
for (int count = 0; count < MEN; count++)
{
for (int i = 0; i < MEN; i++)
{
B2[i] = B1[i];
}
if (1 <= count && count <= 5)
{
x = B2[0].num;
B2[0].num = B2[1].num;
B2[1].num = B2[5].num;
B2[5].num = B2[4].num;
B2[4].num = x;
}
if (2 <= count && count <= 4)
{
for (int i = 0; i < count - 1; i++)
{
x = B2[0].num;
B2[0].num = B2[2].num;
B2[2].num = B2[5].num;
B2[5].num = B2[3].num;
B2[3].num = x;
}
}
if (count == 5)
{
x = B2[0].num;
B2[0].num = B2[1].num;
B2[1].num = B2[5].num;
B2[5].num = B2[4].num;
B2[4].num = x;
}
if (A[0].num != B2[0].num)
{
continue;
}
for (int i = 0; i < MEN; i++)
{
B3[i] = B2[i];
}
for (int count2 = 0; count2 < 4; count2++)
{
for (int i = 0; i < MEN; i++)
{
B2[i] = B3[i];
}
for (int i = 0; i < count2; i++)
{
x = B2[1].num;
B2[1].num = B2[2].num;
B2[2].num = B2[4].num;
B2[4].num = B2[3].num;
B2[3].num = x;
}
x = B2[0].num;
B2[0].num = B2[1].num;
B2[1].num = B2[5].num;
B2[5].num = B2[4].num;
B2[4].num = x;
if (A[1].num != B2[0].num)
{
continue;
}
x = B2[0].num;
B2[0].num = B2[2].num;
B2[2].num = B2[5].num;
B2[5].num = B2[3].num;
B2[3].num = x;
if (A[2].num != B2[0].num)
{
continue;
}
x = B2[0].num;
B2[0].num = B2[2].num;
B2[2].num = B2[5].num;
B2[5].num = B2[3].num;
B2[3].num = x;
if (A[4].num != B2[0].num)
{
continue;
}
x = B2[0].num;
B2[0].num = B2[2].num;
B2[2].num = B2[5].num;
B2[5].num = B2[3].num;
B2[3].num = x;
if (A[3].num != B2[0].num)
{
continue;
}
x = B2[0].num;
B2[0].num = B2[1].num;
B2[1].num = B2[5].num;
B2[5].num = B2[4].num;
B2[4].num = x;
if (A[5].num == B2[0].num)
{
flag = 1;
}
if (flag == 1)
{
break;
}
}
if (flag == 1)
{
break;
}
}
if (flag == 1)
{
break;
}
}
if (flag == 1)
{
break;
}
}
if (flag == 1)
{
cout << "No" << endl;
}
else if (flag == 0)
{
cout << "Yes" << endl;
}
return 0;
} | /*+lmake
* STD = c++14
* DEFINE += WAAUTOMATON
*/
#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#ifdef WAAUTOMATON
#define debug(args...) {dbg,args; cerr<<endl;}
#else
#define debug(args...) // Just strip off all debug tokens
#endif
struct debugger
{
template<typename T> debugger& operator , (const T& v)
{
cerr<<v<<" ";
return *this;
}
} dbg;
#define MAXN 100000
int c[MAXN+10];
bool b[MAXN+10];
void solve(long long N, vector<vector<long long>> a){
int r[2]={0,0},f[2]={0,0};
for(int i=0; i<N; ++i) {
c[i]=a[1][i]/3+1;
if (c[i]%2==i%2) throw 2;
if (a[0][i]==c[i]*3-2 && a[1][i]==c[i]*3-1 && a[2][i]==c[i]*3) {
} else if (a[0][i]==c[i]*3 && a[1][i]==c[i]*3-1 && a[2][i]==c[i]*3-2) {
r[(i+1)&1]^=1;
} else {
throw 1;
}
}
memset(b,true,sizeof(b));
for(int i=1; i<=N; ++i) {
if (b[i]) {
int x=c[i-1];
while(x!=i) {
debug(x);
b[x]=false;
f[i&1]^=1;
x=c[x-1];
}
}
}
debug(f[0],f[1]);
debug(r[0],r[1]);
if (f[0]!=r[1] || f[1]!=r[0]) throw 3;
puts("Yes");
}
int main(){
#ifdef WAAUTOMATON
freopen("in.txt","r",stdin);
#endif
long long N;
scanf("%lld",&N);
vector<vector<long long>> a(3-1+1,vector<long long>(N-1+1));
for(int i = 0 ; i <= 3-1 ; i++){
for(int j = 0 ; j <= N-1 ; j++){
scanf("%lld",&a[i][j]);
}
}
try {
solve(N, a);
} catch(int err) {
puts("No");
debug(err);
}
return 0;
}
| 0 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define REP(i,e,s) for(register int i=e; i<=s; i++)
#define DREP(i,e,s) for(register int i=e; i>=s; i--)
#define ll long long
#define DE(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG(a) DE("DEBUG: %d\n",a)
#define int long long
int read() {
int x=0,f=1,ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int MOD=1e9+7,MAXN=200000+10;
int fac[MAXN],inv[MAXN];
int qpow(int a,int b) {
int ans=1;
while(b) {
if(b&1) ans=(ans*a)%MOD;
a=(a*a)%MOD;
b>>=1;
}
return ans;
}
int c(int m,int n) {
if(n==m||!m||!n) return 1;
return ((fac[m]*inv[n]%MOD)*inv[m-n])%MOD;
}
int calc(int x_1,int y_1,int x_2,int y_2) {
return c(abs(x_2-x_1)+abs(y_2-y_1),abs(x_2-x_1));
}
signed main() {
int h=read(),w=read(),a=read(),b=read();
fac[0]=1;
REP(i,1,h+w) fac[i]=(fac[i-1]*i)%MOD;
REP(i,1,h+w) inv[i]=qpow(fac[i],MOD-2);
int ans=0;
REP(i,1,h-a) {
ans=(ans+calc(1,1,b,i)*(calc(b+1,i,w,h)))%MOD;
}
printf("%lld\n",ans%MOD);
return 0;
} |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int Max(int(a), int(b), int(c)) {
return max(max(a, b), c);
}
int Min(int(a), int(b), int(c)) {
return min(min(a, b), c);
}
int main() {
ll A,B,C;
cin >> A>>B>>C;
cout <<(A-B+1)*(A-C+1)<< endl;
} | 0 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353;//786433;//998244353;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, m;
queue <pair <int, int> > BFS;
int Dist[1005][1005];
char a[1005][1005];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
Dist[i][j] = 1000000;
cin >> a[i][j];
if(a[i][j] == '#')
{
Dist[i][j] = 0;
BFS.push(mp(i, j));
}
}
}
while(BFS.empty() == false)
{
int x = BFS.front().fi, y = BFS.front().se;
BFS.pop();
for(int i = 0; i < 4; i++)
{
if(Dist[x + dx[i]][y + dy[i]] > Dist[x][y] + 1)
{
Dist[x + dx[i]][y + dy[i]] = Dist[x][y] + 1;
BFS.push(mp(x + dx[i], y + dy[i]));
}
}
}
int t = 0;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
t = max(t, Dist[i][j]);
}
}
cout << t;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MAX = 1000000;
using Graph =vector<vector<lint>>;
typedef pair<lint,lint> P;
typedef map<lint,lint> M;
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
lint fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lint 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(lint n, lint k)
{
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
lint primary(lint num)
{
if (num < 2) return 0;
else if (num == 2) return 1;
else if (num % 2 == 0) return 0;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return 0;
}
}
return 1;
}
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;
}
lint lcm(lint a,lint b){
return a/__gcd(a,b)*b;
}
lint gcd(lint a,lint b){
return __gcd(a,b);
}
int main(){
lint n,g;
cin>>n>>g;
lint p[n];
lint c[n];
rep(i,n)cin>>p[i]>>c[i];
lint ans=INF;
rep(bit,1<<n){
bool x[n];
fill(x,x+n,false);
rep(i,n)if(bit&(1<<i))x[i]=true;
lint cost=0;
lint comp=0;
rep(i,n){
if(x[i]){
cost+=p[i]*(i+1)*100+c[i];
comp+=p[i];
}
}
for(lint i=n;i>=0;i--){
if(x[i])continue;
rep(j,p[i]){
if(cost>=g)break;
cost+=(i+1)*100;
comp++;
}
}
ans=min(ans,comp);
}
cout<<ans<<endl;
}
| 0 |
#include<iostream>
using namespace std;
#include<vector>
#include<functional>
template<typename T>
struct dualsegtree{
function<T(T,T)>lazycalcfn,updatefn;
int n;
T lazydefvalue;
vector<T>dat,lazy;
vector<bool>lazyflag;
dualsegtree(int n_=0,T defvalue=0,
function<T(T,T)>lazycalcfn_=[](T a,T b){return a+b;},
function<T(T,T)>updatefn_=[](T a,T b){return a+b;},
T lazydefvalue_=0
):lazydefvalue(lazydefvalue_),
lazycalcfn(lazycalcfn_),updatefn(updatefn_)
{
n=1;
while(n<n_)n<<=1;
dat.assign(n,defvalue);
lazy.assign(n-1,lazydefvalue);
lazyflag.assign(n-1,false);
}
void copy(const vector<T>&v)
{
for(int i=0;i<v.size();i++)dat[i]=v[i];
lazy.assign(n-1,lazydefvalue);
lazyflag.assign(n-1,false);
}
void update(int a,int b,T x,int k=0,int l=0,int r=-1)//[a,b)
{
if(r<0)r=n;
if(b<=l||r<=a)return;
else if(a<=l&&r<=b)
{
if(k<n-1)
{
lazy[k]=lazycalcfn(lazy[k],x);
lazyflag[k]=true;
}
else dat[k-n+1]=updatefn(dat[k-n+1],x);
}
else
{
if(lazyflag[k])
{
update(0,n,lazy[k],k*2+1,l,(l+r)/2);
update(0,n,lazy[k],k*2+2,(l+r)/2,r);
lazy[k]=lazydefvalue;
lazyflag[k]=false;
}
update(a,b,x,k*2+1,l,(l+r)/2);
update(a,b,x,k*2+2,(l+r)/2,r);
}
}
T query(int i)
{
T ret=dat[i];
i+=n-1;
while(i>0)
{
i=(i-1)/2;
if(lazyflag[i])ret=updatefn(ret,lazy[i]);
}
return ret;
}
};
main()
{
int N,Q;
cin>>N>>Q;
dualsegtree<int>P(N,(int)((1LL<<31)-1),
[](int a,int b){return b;},[](int a,int b){return b;});
for(;Q--;)
{
int q;cin>>q;
if(q==0)
{
int s,t,x;cin>>s>>t>>x;
P.update(s,t+1,x);
}
else
{
int i;cin>>i;cout<<P.query(i)<<endl;
}
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll linf = (1ll << 61);
const int inf = 1001001001;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<P>> g(n);
rep(i, n - 1) {
int a, b, c;
cin >> a >> b >> c;
a--; b--;
g[a].push_back(P(b, c));
g[b].push_back(P(a, c));
}
int q, k;
cin >> q >> k;
k--;
priority_queue<P, vector<P>, greater<P>> pq;
vector<ll> d(n, linf);
pq.emplace(0, k);
d[k] = 0;
while (pq.size()) {
P p = pq.top(); pq.pop();
int v = p.second;
if (d[v] < p.first) continue;
for (auto c : g[v]) {
if (d[c.first] > d[v] + c.second) {
d[c.first] = d[v] + c.second;
pq.emplace(d[c.first], c.first);
}
}
}
while (q--) {
int x, y;
cin >> x >> y;
x--; y--;
cout << d[x] + d[y] << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define IN freopen("dichromatic.in","r",stdin)
#define OUT freopen("dichromatic.out","w",stdout)
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#define DBG pf("Hi\n")
#define INF 1000000000
#define i64 long long int
#define eps (1e-8)
#define xx first
#define yy second
#define sq(x) ((x)*(x))
using namespace __gnu_pbds;
using namespace std ;
#define maxn 200005
#define mod 1000000007LL
typedef long long int T ;
const int N = 100000 ;
int bigMod(int a, int n, int m)
{
if(n==0 ) return 1 ;
int r = bigMod(a,n/2,m) ;
r = (1LL*r*r)%m ;
if(n&1) r = (1LL*r*a)%m ;
return r ;
}
int fact[maxn] , invFact[maxn] ;
int dp[maxn] , cnt[maxn] ;
int a[maxn] ;
int C(int n, int r)
{
return (1LL*fact[n]*((1LL*invFact[r]*invFact[n-r])%mod))%mod ;
}
int main()
{
fact[0] =1 ;
for(int i=1 ; i<=2*N ; i++) fact[i] = (1LL*fact[i-1]*i)%mod ;
invFact[2*N] = bigMod(fact[2*N],mod-2,mod) ;
for(int i=2*N -1 ; i>=0 ; i--) invFact[i] = (1LL*invFact[i+1]*(i+1))%mod ;
// for(int i=0 ; i<=N ; i++) printf("%d\n",invFact[i]) ;
// printf("%d %d\n",fact[6],C(6,2)) ;
int n , X ;
scanf("%d %d",&n,&X) ;
for(int i=1; i<=n ; i++) scanf("%d",&a[i]) ;
sort(a+1,a+n+1) ;
for(int i=1 ; i<=n ; i++) cnt[ a[i] ]++ ;
for(int i=1; i<=N ; i++) cnt[i] += cnt[i-1] ;
dp[0] = 0 ;
for(int i=1 ; i<=N ; i++)
{
if( cnt[i]==0 )
{
dp[i] = i ;
continue ;
}
for(int j=cnt[i] ; j>=1 ; j--)
{
int m = a[ j ] ;
int r = i%m ;
int ret = dp[r] ;
ret = (1LL*ret*fact[cnt[i]-1])%mod ;
ret = (1LL*ret*invFact[cnt[r]])%mod;
// printf("%d----%d %d\n",i,r,ret) ;
dp[i] = (dp[i]+ret)%mod ;
}
// printf("%d--> %d\n",i,dp[i]) ;
}
int ans = (1LL*dp[X]*fact[n])%mod ;
ans = (1LL*ans*invFact[cnt[X]])%mod ;
printf("%d\n",ans) ;
return 0 ;
}
| #include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main(){
int N, X; cin >> N >> X; int S[N];
rep(i, N){
cin >> S[i];
}
sort(S, S+N);
ll dp[N+1][X+1] = {};
rep(i, X+1){
dp[0][i] = i;
}
rep(i, N){
rep(j, X+1){
dp[i+1][j] = dp[i][j%S[i]] + i*dp[i][j];
dp[i+1][j]%=mod;
}
}
cout << dp[N][X] << endl;
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;
vector<vi> e;
int v[100000];
void rec(int c, int col, bool &bi, int &x, int &y){
if(col > 0) x++; else y++;
v[c] = col;
for(int i : e[c]){
if(v[i]){
if(v[i] == col) bi = 0;
}
else rec(i, -col, bi, x, y);
}
}
int main(){
cin.tie(0); cin.sync_with_stdio(0);
int n, m; cin >> n >> m;
e.resize(n);
rep(i, m){
int a, b; cin >> a >> b; a--; b--;
e[a].pb(b);
e[b].pb(a);
}
vector<pi> bigraph;
vi graph;
int point = 0;
rep(i, n) if(!v[i]){
bool bi = 1;
int x = 0, y = 0;
rec(i, 1, bi, x, y);
if(bi){
if(x + y == 1) point++;
else bigraph.emplace_back(x, y);
}
else graph.pb(x + y);
}
//dbg(bigraph);dbg(graph);dbg(point);
ll ans = 0;
for(pi a : bigraph){
/*
for(pi b : bigraph){
ans += 2;
}
for(int b : graph){
ans++;
}*/
ans += bigraph.size() * 2;
ans += graph.size();
ans += (ll)point * (a.first + a.second);
}
dbg(ans);
for(int a : graph){
/*
for(pi b : bigraph){
ans++;
}
for(int b : graph){
ans++;
}*/
ans += bigraph.size();
ans += graph.size();
ans += (ll)point * a;
}
dbg(ans);
{
for(pi b : bigraph){
ans += (ll)point * (b.first + b.second);
}
for(int b : graph){
ans += (ll)point * b;
}
ans += (ll)point * point;
}
cout << ans << endl;
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread_unlocked(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
return A;
}
//わけわかめ
int P[100001];
bool dame[100001];
int Find(int A) {
if (P[A] < 0) return A << 1;
return P[A] = Find(P[A] >> 1) ^ (P[A] & 1);
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint(), M = getint();
rep1(i, N) P[i] = -1;
rep(i, M) {
int a = Find(getint());
int b = Find(getint());
//なんてセンスのない
int a1 = a >> 1;
int b1 = b >> 1;
if (a1 == b1) {
if (!((a ^ b) & 1)) dame[a1] = true;
continue;
}
if (P[a1] > P[b1]) {
P[b1] += P[a1];
dame[b1] |= dame[a1];
P[a1] = b ^ !(a & 1);
}
else {
P[a1] += P[b1];
dame[a1] |= dame[b1];
P[b1] = a ^ !(b & 1);
}
}
ll x = 0, y = 0, z = 0;
rep1(i, N) {
if (P[i] < 0) {
if (P[i] == -1) z++;
else if (dame[i]) y++;
else x++;
}
}
printf("%lld\n", x * x + (x + y) * (x + y) + 2 * N * z - z * z);
Would you please return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
constexpr ll MOD = 1000000007;
constexpr ll MAX = 1 << 20;
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
//累積XOR
vector<ll> b(N + 1, 0);
for (ll i = 0; i < N; i++) {
b[i + 1] = b[i] ^ A[i];
}
//今いるマスに好きな整数をXとしている場合に累積XORがXとして到達する場合の数
vector<ll> dp(MAX, 1);
//今いるマスに好きな整数をXとしている場合に累積XORがXとして到達する場合の数の累積和
vector<ll> dp_sum(MAX, 0);
//累積XORが0になった回数
ll zero_num = 0;
//前回累積XORがXとなったときのzero_numの値
vector<ll> last_zero_num(MAX, 0);
for (ll i = 1; i < N; i++) {
//累積XORがb[i]としてここに到着する場合の数を次の2通りに分けて計算
//1) 前にb[i]として届くパターンの最後だけをここに入れ替え
// つまり以前のdp[b[i]]そのものなので(2)を+=で足せば良い
//2) b[i]として到達する累積和と前回以降から0が出てきた数との掛け算
(dp[b[i]] += dp_sum[b[i]] * (zero_num - last_zero_num[b[i]])) %= MOD;
//累積和を計算しておく
(dp_sum[b[i]] += dp[b[i]]) %= MOD;
//b[i]となったときの0の出現回数を記録しておき差分を取れるようにする
last_zero_num[b[i]] = zero_num;
//0の出現回数を記録
if (b[i] == 0) {
zero_num++;
}
}
if (b[N]) {
//b[N]として遷移した先のものが答え
cout << (dp[b[N]] + dp_sum[b[N]] * (zero_num - last_zero_num[b[N]])) % MOD << endl;
} else {
//X = 0の場合:累積XORが0になるところで仕切りを入れるか入れないか2通り
ll ans = 1;
for (ll i = 0; i < zero_num; i++) {
(ans *= 2) %= MOD;
}
//X != 0の場合:Xで遷移してくる累積和の和
for (ll X = 1; X < MAX; X++) {
(ans += dp_sum[X]) %= MOD;
}
cout << ans << endl;
}
} | //Δ_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;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{int n;
string s;
cin>>n;
cin>>s;
if(s.size()>n)
{
s.erase(n);
cout<<s+"..."<<endl;}
else cout<<s<<endl;
return 0;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
if(n < 1200) cout << "ABC" << endl;
else if(n < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
} | 0 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s; cin >> s;
for(int bit=0; bit<(1<<3); bit++){
string str = "";
str += s[0];
int cnt = s[0] - '0';
if(bit & (1<<0)){
cnt += s[1] - '0';
str += "+";
}else{
cnt -= s[1] - '0';
str += "-";
}
str += s[1];
if(bit & (1<<1)){
cnt += s[2] - '0';
str += "+";
}else{
cnt -= s[2] - '0';
str += "-";
}
str += s[2];
if(bit & (1<<2)){
cnt += s[3] - '0';
str += "+";
}else{
cnt -= s[3] - '0';
str += "-";
}
str += s[3];
if(cnt == 7){
str += "=7";
cout << str << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int now[4];
char C[4], op[2] = {'+', '-'};
int main(){
for (int i = 0; i < 4; i++){
cin >> C[i];
now[i] = C[i] - '0';
}
for (int i = 0; i < 8; i++){
int val = now[0], num = i;
for (int j = 1; j < 4; j++){
val += pow(-1, num % 2) * now[j];
num /= 2;
}
if (val == 7){
num = i;
cout << now[0];
for (int j = 1; j < 4; j++){
cout << op[num%2] << now[j];
num /= 2;
}
cout << "=7" << endl;
return 0;
}
}
return 0;
}
| 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<cmath>
//#include<>
using namespace std;
typedef pair<int,int> Node;
typedef long long ll;
#define rep(i,j) for(i=0;i<j;i++)
#define rev_rep(i,j) for(i=j;i>=0;i—-)
int INF=1<<30;
class Dijkstra
{
public:
typedef struct Edge{int to,cost;}Edge;
vector< vector<Edge> > Graph;//接続リスト
Dijkstra(int n)
{
vector<Edge> temp;
Graph.resize(n,temp);
}
void add_arc(int x,int y,int c)
{
Edge e={y,c};
Graph[x].push_back(e);
}
vector<int> get_distance(int s)
{
priority_queue< Node ,vector<Node>,greater<Node> > que;//(sからの距離,インデックス)
vector<int>ans;
int i;
ans.resize(Graph.size(),INF);
ans[s]=0;
que.push(Node(0,s));
while(!que.empty()){
Node now=que.top();que.pop();
int now_i=now.second;
//nowへの最小距離でないならスキップ
if(ans[now_i]<now.first)continue;
//nowからの辺全てをみる
rep(i,Graph[now_i].size()){
Edge e=Graph[now_i][i];
//nowから行った方が近かったら更新
if(ans[e.to]>ans[now_i]+e.cost){
ans[e.to]=ans[now_i]+e.cost;
que.push(Node(ans[e.to],e.to));
}
}
}
return ans;
}
};
int main()
{
int n,m,r;
cin>>n>>m>>r;
Dijkstra map(n);
int i;
rep(i,m)
{
int a,b,c;
cin>>a>>b>>c;
map.add_arc(a,b,c);
//map.add_arc(b,a,c);
}
vector<int> ans=map.get_distance(r);
rep(i,ans.size())
if(ans[i]==INF)
cout<<"INF"<<endl;
else
cout<<ans[i]<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int t[110]={};
int N;
cin >> N;
int a,b,c,d;
//得点
for(int i = 0; i < N*(N-1)/2; i++){
cin >> a >> b >> c >> d;
if(c > d) t[a-1] += 3;
else if(c < d) t[b-1] += 3;
else if(c == d){
t[a-1]++;
t[b-1]++;
}
}
//順位
int p = 0,rank[110]={};
for(int j = 1; j < N+1; j+=p){
int max = -1;
for(int i = 0; i < N; i++){
if(max < t[i]){
max = t[i];
}
}
p = 0;
for(int i = 0; i < N; i++){
if(max == t[i]){
rank[i] = j;
p++;
t[i] = -1;
}
}
}
for(int i = 0; i < N; i++){
cout << rank[i] << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
ll n,x;cin>>n>>x;
vector<ll> a(n);
rep(i,n)cin>>a[i];
sort(all(a));
int cnt=0;
rep(i,n){
x-=a[i];
if(x<0)break;
cnt++;
}
if(x>0)cnt--;
cout<<cnt<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase=1;
for(int p=0;p<testcase;p++){
ll n=0,x=0;
cin>>n>>x;
ll array[n]={0};
ll totalsum=0;
for(int i=0;i<n;i++){
cin>>array[i];
totalsum+=array[i];
}
if(totalsum<x){
cout<<n-1;
}
else if(totalsum==x)
cout<<n;
else
{
sort(array,array+n);
ll counter=0;
ll sum=x;
ll i=0;
while(sum>=0){
// cout<<array[i];
sum-=array[i];
if(sum<0)
break;
i++;
counter++;
}
cout<<counter;
}
}
return 0;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.