code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <bits/stdc++.h>
#ifdef LILY
#include "Debug.h"
#else
#define var(...) (0)
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= (n); ++i)
#define tfor(i, n) for (int i = 0; i < (n); ++i)
#define INF 0x3f3f3f3f
#define EPS 1e-5
#define M 1000000007
int n;
int p;
int pow(int base, int ex)
{
int ret = 1;
while (ex)
{
if (ex & 1) ret = ret * base % M;
ex >>= 1;
base = base * base % M;
}
return ret;
}
void reals()
{
}
public:
Solution()
{
cin >> n >> p;
int t = pow(p - 2, n - 1);
cout << t * (p - 1) % M << endl;
}
#undef int
#undef tfor
#undef sfor
};
int32 main()
{
#ifdef LILY
while (1)
#endif
Solution();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
vector< int > divisor(int n) {
vector< int > ret;
for(int 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));
reverse(begin(ret), end(ret));
return (ret);
}
signed main(){
int A; cin>>A;
int B; cin>>B;
int ans = 1;
for(int i=A;i<=B;i++){
vec_int temp = divisor(i);
for(auto num: temp){
if(i+num<=B){
ans = max(num, ans);
break;
}
}
}
cout<<ans<<endl;
return 0;
} |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using p_qi = priority_queue<int>;
const int INF = 1001001001;
// Input
int n;
vi a;
int main() {
cin >> n;
a = vi(n);
rep(i, n) cin >> a[i];
set<int> s;
rep(i, n) s.insert(a[i]);
if (s.size() != n) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define vi vector<int>
#define ii pair<int,int>
#define all(v) v.begin(),v.end()
#define getunique(v) {v.erase(unique(v.begin(),v.end()),v.end());}
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
const int MS=1000001;
const lli INF=1e9+7;
template<class T>
bool comp(T a, T b){
if(a.ss<b.ss)
return true;
return false;
}
int main(){
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
fast_io;
int n;
cin>>n;
vi v(n),ch(n+1,0);
for(int i=0; i<n; i++)
cin>>v[i],ch[v[i]]++;
bool ans=true;
for(int i=1; i<=n; i++){
if(ch[i]>1 || ch[i]==0)
ans=false;
}
if(ans)
cout<<"Yes";
else cout<<"No";
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
#define rep(i,n) for (int i=0;i<(n);++i)
#define REP(i,n) for (int i=1;i<=(n);++i)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define RI(x) scanf("%d",&x)
#define RII(x,y) scanf("%d%d",&x,&y)
int n;
char con[105][105];
vector<int> R[105];
int up[105];
bool vis[105];
inline void dfs(int u,int rt){
++up[rt];vis[u]=1;
for (int i=0;i<R[u].size();++i) if (!vis[R[u][i]]) dfs(R[u][i],rt);
}
double ans=0;
int main(){
ios::sync_with_stdio(false);
cin>>n;
REP(i,n) cin>>con[i]+1;
REP(i,n) REP(j,n) if (con[i][j]=='1') R[j].pb(i);
REP(i,n){
memset(vis,0,sizeof(vis));
dfs(i,i);//--up[i];
//cerr<<i<<' '<<up[i]<<endl;
ans+=double(1.0)/up[i];
}
printf("%0.10lf",ans);
return 0;
} | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
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
char cn[1200010];
char *ci = cn, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
ll tmp = *(ll*)ci;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 72 - dig >> 3;
return tmp;
}
char tc[200002], *di = tc + 100000, *di2 = tc + 200000;
const char d[2] = "0";
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
rep(i, 100000) tc[i] = '0';
rep(i, 100000) di[i] = '1';
di2[0] = '0';
di2[1] = '\n';
fread(cn, 1, 1200010, stdin);
int T = getint();
//while ((ct = *ci++) >= '0') T = T * 10 + ct - '0';
rep(t, T) {
int N = getint();
//while ((ct = *ci++) >= '0') N = N * 10 + ct - '0';
fwrite(di - N, 1, N, stdout);
fwrite(di2 - N, 1, N + 2, stdout);
ci += 6 * N + 3;
}
Would you please return 0;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define lowbit(x) ((x) & -(x))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr double eps = 1e-8;
constexpr int NINF = 0xc0c0c0c0;
constexpr int INF = 0x3f3f3f3f;
constexpr ll mod = 1e9 + 7;
constexpr ll N = 3e5 + 5;
int n, a[N], bit[N], ans[N], l[N], r[N];
void add(int k, int v) {
for (; k <= n; k += lowbit(k)) bit[k] += v;
}
ll sum(int k) {
ll ans = 0;
for (; k; k -= lowbit(k)) ans += bit[k];
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i], a[i]++;
ll res = 0;
for (int i = n; i; i--) {
int x = sum(a[i]);
res += x;
r[i] = x;
add(a[i], 1);
}
for (int i = 0; i <= n; i++) bit[i] = 0;
for (int i = 1; i <= n; i++) {
int x = sum(a[i]);
l[i] = x;
add(a[i], 1);
}
for (int i = 1; i <= n; i++) {
cout << res << '\n';
// res = res - (a[i] - 1) + (n - a[i]);
res = res - r[i] + (n - i - r[i]) - l[i] + (i - 1 - l[i]);
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr << " [" << #a << "->" << a << "] "
#define next_line cerr << '\n'
#define all(a) a.begin(), a.end()
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define setbits(x) __builtin_popcountll(x)
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
bool invalid(vector<double> &i){
if(i[0] > i[1])
return true;
return false;
}
bool inter(vector<double> &i1, vector<double> &i2){
if(invalid(i1) || invalid(i2))
return false;
double nw_s = max(i1[0], i2[0]);
double nw_e = min(i1[1], i2[1]);
return (nw_s <= nw_e);
}
void solve()
{
int n;
cin >> n;
vector<vector<double> > interv;
F(int,i, 0, n - 1, 1){
double t, st, end;
cin >> t >> st >> end;
if(t == 1){
}else if(t == 2){
end -= 0.2;
}else if(t == 3){
st += 0.2;
}else{
end -= 0.2;
st += 0.2;
}
// deb(st);deb(end);next_line;
interv.push_back(vector<double>{st, end});
}
int ans = 0;
F(int, i, 0, n - 1, 1){
F(int, j, i + 1, n - 1, 1){
ans += inter(interv[i], interv[j]);
}
}
cout << ans << '\n';
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// freopen("Debug.txt", "w", stderr);
#else
#endif
// cout << fixed << setprecision(10);
int _t = 1;
// cin>>_t;
F(int, i, 1, _t, 1){
// cout << "Case #" << i << ": ";
solve();
}
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<string> f(int n){
if(n == 1) return vector<string>{"AB"};
vector<string> ans = f(n - 1);
int sz = ans.size();
for(int t = 0; t < sz; ++t){
ans[t] = ans[t] + ans[t];
string s = ans[t];
int siz = s.size();
for(int i = siz / 2; i < siz; ++i) s[i] = "AB"[s[i] == 'A'];
ans.emplace_back(s);
}
string s(1 << (n - 1), 'A'), ss(1 << (n - 1), 'B');
ans.emplace_back(s + ss);
return ans;
}
int n;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
vector<string> s = f(n);
cout << s.size() << "\n";
for(auto &v : s) cout << v << "\n";
return 0;
} | #include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
//using vec = vector<ll>;
//using mat = vector<vec>;
ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);
template<class T> bool chmin(T &a, const T &b){
if(a > b) {a = b; return true;}
else return false;
}
template<class T> bool chmax(T &a, const T &b){
if(a < b) {a = b; return true;}
else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
if(!v.empty()){
for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
std::cout<<v.back();
}
if(endline) std::cout<<std::endl;
}
using vec = vector<bool>;
using mat = vector<vec>;
mat solve(int n){
mat res((1<<n) - 1, vec(1<<n, false));
rep(i, (1<<(n - 1))) res[0][i] = true;
if(n == 1){
return res;
}else{
auto lastres = solve(n - 1);
reps(i, 1, (1<<n) - 1){
vec &now = res[i], &last = lastres[(i-1)/2];
rep(j, (1<<(n-1))) now[j] = last[j];
if(i&1){
reps(j, (1<<(n-1)), 1<<n) now[j] = last[j - (1<<(n-1))];
}else{
reps(j, (1<<(n-1)), 1<<n) now[j] = !last[j - (1<<(n-1))];
}
}
return res;
}
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin>>N;
K = (1<<N) - 1;
cout<<K<<endl;
auto res = solve(N);
rep(i, K){
rep(j, 1<<N) cout<<(res[i][j] ? 'A' : 'B');
cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=1000000007,MAX=3000005,INF=1<<30;
ll dp[MAX][4],sum[MAX][4];
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int N;ll K;cin>>N>>K;
K--;
dp[0][0]=1;
sum[0][0]=1;
for(int i=1;i<=3*N;i++){
for(int j=1;j<=3;j++){
dp[i][j]+=sum[i-1][j-1];
if(i-(N+1)>=0) dp[i][j]-=sum[i-(N+1)][j-1];
}
for(int j=0;j<=3;j++){
sum[i][j]=dp[i][j]+sum[i-1][j];
}
}
for(ll s=3;s<=3*N;s++){
//cout<<dp[s][3]<<endl;
if(K>=dp[s][3]) K-=dp[s][3];
else{
for(ll i=1;i<=N;i++){
ll rem=s-i;
if(rem<2||rem>2*N) continue;
ll can=N-abs(N+1-rem);
if(K>=can) K-=can;
else{
for(ll j=1;j<=N;j++){
ll k=s-i-j;
if(1<=k&&k<=N){
if(K==0){
cout<<i<<" "<<j<<" "<<k<<endl;
return 0;
}
K--;
}
}
}
}
}
}
}
| /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void solve(){
ll N,K;
cin >> N >> K;
ll cur = K;
ll sum = -1;
ll mid = (N*3 + 3) / 2;
rep(n,3,N*3+1){
ll idx, val;
if(n <= mid){
idx = n - 2;
val = idx * (idx+1) / 2;
if(n > N+2){
ll j = n - (N+2);
ll pena = 3 * j * (j+1) / 2;
val -= pena;
}
}else{
if((N*3+3) % 2 == 0){
ll diff = n - mid;
ll m = mid - diff;
idx = m-2;
val = idx * (idx+1) / 2;
if(m > N+2){
ll j = m - (N+2);
ll pena = 3 * j * (j+1) / 2;
val -= pena;
}
}else{
ll diff = n - mid;
ll m = (mid+1) - diff;
idx = m-2;
val = idx * (idx+1) / 2;
// print("m",n,m);
if(m > N+2){
ll j = m - (N+2);
ll pena = 3 * j * (j+1) / 2;
val -= pena;
}
}
}
// print(n ,val);
if(cur <= val){
sum = n;
break;
}else{
cur -= val;
}
}
// print(sum, cur);
rep(n,1,sum-1){
ll nokori = sum - n;
if(nokori > 2 * N) continue;
ll start = nokori - N;
if(start <= 1) start = 1;
ll num = min(N, nokori-1) - start + 1;
if(cur <= num){
ll second_val = start + cur-1;
print(n, second_val, sum-n-second_val);
return;
}else{
cur -= num;
}
}
// typedef struct{ll x,y,z;} P;
// vector<P> v;
// map<ll,ll> mp;
// rep(i,0,N){
// rep(j,0,N){
// rep(k,0,N){
// v.push_back({i+1, j+1, k+1});
// mp[i+j+k+3]++;
// }
// }
// }
// sort(v.begin(), v.end(), [](P p1, P p2){
// if(p1.x+p1.y+p1.z == p2.x+p2.y+p2.z){
// if(p1.x == p2.x){
// return p1.y < p2.y;
// }
// return p1.x < p2.x;
// }
// return p1.x+p1.y+p1.z < p2.x+p2.y+p2.z;
// });
// // for(auto &e: v) print(e.x,e.y,e.z);
// for(auto &e: mp){
// ll n = e.first - 2;
// // print(e.first, e.second, n*(n+1)/2, n*(n+1)/2 - e.second);
// }
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
vector<ll> enum_div(ll n){//yakusu
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);
}
}
return ret;
}
int main(){
ll N;
cin >> N;
auto ans = enum_div(N);
SORT(ans);
for(auto x:ans){
cout << x << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ll N;
cin >> N;
set<ll> ans;
ll bk=sqrt(N);
for(ll i=1;i<=bk;i++){
if(N%i == 0){
ans.insert(i);
if(N%(N/i)==0)ans.insert(N/i);
}
}
for(ll i:ans)cout << i << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR(i,a,b) for(i= a ; i < b ; ++i)
#define rep(i,n) FOR(i,0,n)
#define rev(i,n) for(i=n-1;i>=0;i--)
#define INF INT_MAX
#define pb push_back
#define tc int t;cin>>t;while(t--)
#define mod (int)(1e9 + 7)
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define endl "\n"
#define si set<int>
#define lld unsigned long long int
void factors(ll x) {
vector <ll> result;
ll i = 1;
while(i*i <= x) {
if(x % i == 0) {
result.push_back(i);
if(x/i != i) {
result.push_back(x/i);
}
}
i++;
}
sort(result.begin(),result.end());
for(ll i=0; i<result.size(); i++) {
cout << result[i] <<endl;
}
//cout << endl;
}
int main()
{
fastio;
ll n;
cin>>n;
factors(n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
vector<long int> t(0);
int f=2;
for (long int i = 1; i <= sqrt(n); i++)
{
if (n%i==0)
{
t.push_back(i);
if(i!=n/i){
t.push_back(n/i);
}
}
}
sort(t.begin(), t.end());
/*while (f<=n)
{
if(n%f==0){
n=n/f;
t.push_back(f);
}
else
{
f++;
}
}
*/
for (int i = 0; i < t.size(); i++)
{
cout<<t[i]<<endl;
}
} |
//@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)
#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)
#define FOR(i, a) for (auto &i: a)
#define ALL(obj) begin(obj), end(obj)
#define _max(x) *max_element(ALL(x))
#define _min(x) *min_element(ALL(x))
#define _sum(x) accumulate(ALL(x), 0LL)
const int MOD = 1000000007;
// const int MOD = 998244353;
const int INF = 10000000000007; // 1e13 + 7
const int INF2 = LLONG_MAX; // 9.2e18
const double EPS = 1e-8;
const double PI = 3.14159265358979;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
template <class T> using VVV = vector<vector<vector<T>>>;
template <class T, class S> using P = pair<T, S>;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}
int _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
template<class T> T chmod(T &a, T mod=MOD) {a = a >= 0 ? a % mod : a - (mod * _ceil(a, mod)); return a;};
int _mod(int a, int mod=MOD) {return a >= 0 ? a % mod : a - (mod * _ceil(a, mod));}
int _pow(int a, int b) {int res = 1;for (a %= MOD; b; a = a * a % MOD, b >>= 1)if (b & 1) res = res * a % MOD;return res;}
struct mint {long long x;mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) { (x *= a.x) %= MOD;return *this; }mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; } mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long t) const {if (!t) return 1;mint a = pow(t >> 1);a *= a;if (t & 1) a *= *this;return a;}mint inv() const { return pow(MOD - 2); }mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }};istream &operator>>(istream &is, mint &a) { return is >> a.x; }ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// clang-format on
class ALongCommonSubsequence {
public:
static void solve(istream &cin, ostream &cout) {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int t;
cin >> t;
rep(_, t) {
int N;
string S1, S2, S3;
cin >> N >> S1 >> S2 >> S3;
cout << string(N, '0') + string(N, '1') + '0' << endl;
}
}
};
signed main() {
ALongCommonSubsequence solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n;
cin>>n;
string s1,s2,s3;
cin>>s1>>s2>>s3;
for(int i=0;i<n;i++) cout<<"0";
for(int i=0;i<n;i++) cout<<"1";
cout<<"0";
cout<<"\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
// freopen("timber_input.txt", "r", stdin);
// freopen("timber_output.txt", "w", stdout);
int t=1;
cin>>t;
for(int i=1;i<=t;i++){
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} |
#ifdef GCC_VERSION
#include<bits/stdc++.h>
#endif
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <tuple>
#include <algorithm>
#include <functional>
#include <deque>
#include <queue>
#include <cstring>
#include <chrono>
#include <numeric>
#ifdef _DEBUG
#define DEBUG_INPUT
#endif
#ifdef DEBUG_INPUT
#include "../__common/Helper.h"
#endif
using ll = long long int;
using ld = long double;
static const ll INF = 6'000'000'000'000'000'000; // -INF for min value
template<typename T> using Vec = std::vector<T>;
template<typename T> using VecVec = std::vector<std::vector<T>>;
#define fe(e,cont) for(auto& e : cont) // others loop types by snippets
#define all(v) std::begin(v),std::end(v)
// only for md-arrays
template<class T> void unsafe_clear(T& val) { auto sz = sizeof(val); std::memset(&val, 0, sz); }
template<class T1, class T2> bool isMemEqual(const T1& v1, const T2& v2) { static_assert(sizeof(v1) == sizeof(v2)); return std::memcmp(&v1, &v2, sizeof(v1)) == 0; }
ll ipow(ll v, ll p) { ll res = 1; while (p--) { res *= v; } return res; }
ll div_ceil(ll a, ll b) { ll res = a / b; if (res * b != a) res++; return res; }
class Timer { // Sometimes measurement is required...
using sc = std::chrono::steady_clock; sc::time_point start;
public:
Timer() :start(sc::now()) {}
ll elapsedMs() { return std::chrono::duration_cast<std::chrono::milliseconds>(sc::now() - start).count(); }
};
extern const char* INPUT_DATA;
#ifdef DEBUG_INPUT
static Helper helper(INPUT_DATA);
#endif
template<class T>
T __get() {
#ifdef DEBUG_INPUT
return helper.get<T>();
#else
T val; std::cin >> val; return val;
#endif
}
ll get() { return __get<ll>(); }
std::tuple<ll, ll> get2() { return { get(), get() }; } std::tuple<ll, ll, ll, ll, ll> get5() { return { get(), get(), get(), get(), get() }; }
std::tuple<ll, ll, ll> get3() { return { get(), get(), get() }; } std::tuple<ll, ll, ll, ll> get4() { return { get(), get(), get(), get() }; }
std::string gets() { return __get<std::string>(); }
template<class T> void print(const T& val) { std::cout << val << " "; }
template<class T, class ... Types> void print(const T& var, const Types&...var2) { print(var); print(var2...); }
void endl() { std::cout << "\n"; }
void onetime(); void prepare() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr); onetime(); }
void task(); void tcase() { ll t = get(); while (t--) task(); }
int main() {
Timer timer; prepare();
//tcase();
task();
#ifdef DEBUG_INPUT
while (helper.hasInput()) task();
//print("Execution time:", timer.elapsedMs());
#endif
return 0;
}
//-------------------------------------------------------------
void onetime()
{
}
const char* INPUT_DATA = R"(
2 2 1
)";
void task()
{
auto [a, b, c] = get3();
bool win;
if (c == 0)
{
win = a > b;
}
else
{
win = a >= b;
}
print(win ?"Takahashi":"Aoki");
}
| #include <iostream>
using namespace std;
int main(){
int A, B, C;
cin >> A;
cin >> B;
cin >> C;
if (A == 0 && B > 0) cout << "Aoki";
if (B == 0 && A > 0) cout << "Takahashi";
if (A == 0 && B == 0){
if (C == 0){
cout << "Aoki";
}
else cout << "Takahashi";
}
while (A > 0 && B > 0){
if (C == 0){
A--;
if (A == 0){
cout << "Aoki";
break;
}
B--;
if (B == 0){
cout << "Takahashi";
break;
}
}
else{
B--;
if (B == 0){
cout << "Takahashi";
break;
}
A--;
if (A == 0){
cout << "Aoki";
break;
}
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll,ll>
#define pii pair<int ,int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x,y) memset(x,y,sizeof(x))
#define all(x) (x).begin(),(x).end()
#define forn(i,s,e) for(int i = s; i < (e); ++i)
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FILEIO \
freopen("./input.txt", "r", stdin); \
freopen("./output.txt", "w", stdout);
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) \
for ( \
auto blockTime = make_pair(chrono::high_resolution_clock::now(), true); \
blockTime.second; \
debug("%s : %lld ms\n ", d, chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - blockTime.first).count()), blockTime.second = false)
const int M = 1e9 + 7;
template <class T> T ABS(const T &x) {return x>0? x:-x;}
ll gcd(ll n1, ll n2) {return n2==0? ABS(n1) : gcd(n2,n1%n2);}
ll lcm(ll n1, ll n2) {return n1==0 && n2==0? 0 : ABS(n1*n2)/gcd(n1,n2);}
ll ceil2(ll a, ll b) {return (a + b - 1) / b;}
// int dx[4] = {1,-1,0,0};
// int dy[4] = {0,0,1,-1};
int main()
{
FASTIO
#ifdef LOCAL
FILEIO
#endif
int n,m;
cin >> n >> m;
vector<unsigned> to(n);
while(m--){
int a,b;
cin >> a >> b;
--a,--b;
to[a] |= 1 << b;
to[b] |= 1 << a;
}
vector<unsigned> cs(3);
ll res = 0;
auto dfs = [&](auto &&self, int curr) -> void {
if(curr == n){
++res;
return;
}
if(to[curr] == 0){
self(self,curr+1);
}
else{
forn(i,0,3){
cs[i] += 1 << curr;
if((to[curr] & cs[i]) == 0) self(self, curr+1);
cs[i] -= 1 << curr;
}
}
};
dfs(dfs,0);
for(auto j : to) if(!j) res *= 3;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
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; }
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert
#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}
using namespace std;
template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
/* Some Libraries */
//-------------------------------------------------
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N,M; cin>>N>>M;
vector<vi> G(N);
rep(i,M){
int a,b; cin>>a>>b; a--; b--;
G[a].pb(b);
G[b].pb(a);
}
vector<bool> seen(N);
auto dfs = [&](auto &dfs, vi &vec, int v)->void{
seen[v] = true;
vec.pb(v);
for(auto u:G[v]){
if (seen[u]) continue;
dfs(dfs,vec,u);
}
};
ll ans=1;
rep(v,N)if(!seen[v]){
vi vec;
dfs(dfs,vec,v);
int sz = vec.size();
ll sum=0;
vi color(N,-1);
auto dfs2 = [&](auto &dfs, int idx)->void{
if (idx==sz){
sum+=3;
return;
}
const int &v = vec[idx];
if (idx==0){
color[v]=0;
dfs(dfs,idx+1);
color[v]=-1;
return;
}
int mask=0b111;
for(auto u:G[v]){
if (color[u]==-1) continue;
mask &= ~(1<<color[u]);
}
rep(i,3)if(mask>>i&1){
color[v]=i;
dfs(dfs,idx+1);
color[v]=-1;
}
};
dfs2(dfs2,0);
ans*=sum;
}
cout<<ans<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define rrep(i,a,b) for(ll i=a;i>=b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323846
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const ll mod = 1e9+7;
const ll INF = 1e18;
const ll MAXN = 40;
ll poww(ll a, ll b) {
if(b<0) return 0LL;
ll ans = 1;
while (b) {
if (b & 1)ans = ans * a;
a = a * a;
b >>= 1;
}
return ans;
}
ll binpow(ll a, ll b)
{
if (b < 0) return 0LL;
if (a <= 0)return 0LL;
a %= mod;
ll ans = 1LL;
while (b) {
if (b & 1)ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll modinv(ll n) {
return binpow(n, mod - 2);
}
ll spf[MAXN];
void sieve()
{
spf[1] = 1;
for (ll i=2; i<MAXN; i++) spf[i] = i;
for (ll i=4; i<MAXN; i+=2) spf[i] = 2;
for (ll i=3; i*i<MAXN; i++) {
if (spf[i] == i) {
for (ll j=i*i; j<MAXN; j+=i) {
if (spf[j]==j) spf[j] = i;
}
}
}
}
vector<ll> getFactorization(ll x)
{
vector<ll> ret;
while (x != 1)
{
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
void solve() {
ll n; cin>>n;
ll ans = 1;
map<ll,ll> mt;
sieve();
for(ll i =2; i<=n; i++) {
map<ll,ll> temp;
vector<ll> v = getFactorization(i);
for(ll x : v) {
temp[x]++;
}
for(auto it = temp.begin(); it!=temp.end(); it++) {
mt[it->fi] = max(mt[it->fi],it->se);
}
}
for(auto it = mt.begin(); it!=mt.end(); it++) {
ans *= poww(it->fi,it->se);
}
ans++;
cout<<ans;
}
int main() {
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//ll no_of_test_cases; cin>>no_of_test_cases;
ll no_of_test_cases = 1;
for(ll i=1; i<=no_of_test_cases; i++) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
vector<T> ts(n);
for(size_t i=0;i<n;i++) cin>>ts[i];
return ts;
}
//INSERT ABOVE HERE
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
Int n;
cin>>n;
auto as=read(n);
auto bs=read(n);
Int ans=0;
for(Int a:as) ans+=a;
priority_queue<Int> pq[2];
for(Int i=0;i<n;i++)
pq[i&1].emplace(bs[i]-as[i]);
while(!pq[0].empty()){
Int res=pq[0].top()+pq[1].top();
pq[0].pop();pq[1].pop();
if(res>0) ans+=res;
else break;
}
cout<<ans<<newl;
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
T mymod(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
T ret = 1;
while (n > 0)
{
if (n & 1)
{
if (p != -1)
ret = (ret * x) % p;
else
ret *= x;
}
if (p != -1)
x = (x * x) % p;
else
x *= x;
n >>= 1;
}
return ret;
}
ll gcd(ll n, ll m)
{
ll tmp;
while (m != 0)
{
tmp = n % m;
n = m;
m = tmp;
}
return n;
}
ll lcm(ll n, ll m)
{
return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
//using namespace atcoder;
template<int mod>
struct Modint{
int x;
Modint():x(0){}
Modint(int64_t y):x((y%mod+mod)%mod){}
Modint &operator+=(const Modint &p){
if((x+=p.x)>=mod)
x -= mod;
return *this;
}
Modint &operator-=(const Modint &p){
if((x+=mod-p.x)>=mod)
x -= mod;
return *this;
}
Modint &operator*=(const Modint &p){
x = (1LL * x * p.x) % mod;
return *this;
}
Modint &operator/=(const Modint &p){
*this *= p.inverse();
return *this;
}
Modint operator-() const { return Modint(-x); }
Modint operator+(const Modint &p) const{
return Modint(*this) += p;
}
Modint operator-(const Modint &p) const{
return Modint(*this) -= p;
}
Modint operator*(const Modint &p) const{
return Modint(*this) *= p;
}
Modint operator/(const Modint &p) const{
return Modint(*this) /= p;
}
bool operator==(const Modint &p) const { return x == p.x; }
bool operator!=(const Modint &p) const{return x != p.x;}
Modint inverse() const{//非再帰拡張ユークリッド
int a = x, b = mod, u = 1, v = 0;
while(b>0){
int t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return Modint(u);
}
Modint pow(int64_t n) const{//繰り返し二乗法
Modint ret(1), mul(x);
while(n>0){
if(n&1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os,const Modint &p){
return os << p.x;
}
};
using modint = Modint<mod>;
void solve()
{
ll n,k;
cin>>n>>k;
ll ans=0;
for(ll i=2;i<=2*n;++i){
ll y=i-k;
if(y<2||y>n*2)continue;
ans+=(min(n,i-1)-max(1LL,i-n)+1)*(min(n,y-1)-max(1LL,y-n)+1);
}
cout<<ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128_t LL;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
mt19937 rnd;
ll get(int x, int n) {
if (x <= 1) {
return 0;
}
else if (x <= n + 1) {
return x - 1;
}
else {
return n - (x - n) + 1;
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n, k;
cin >> n >> k;
if (k < 0) {
k = -k;
}
ll ans = 0;
for (int i = 2; i <= 2 * n; i++) {
ans += get(i, n) * get(i - k, n);
}
cout << ans << "\n";
#ifdef LOCAL
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
#include<bits/stdc++.h>
#define Woody
#define int long long
#define rep(n) for(int i=0;i<n;i++)
#define mp make_pair
#define eb emplace_back
#define F first
#define S second
#ifdef Woody
#define quick ios::sync_with_stdio(0);cin.tie(0);
#else
#define quick
#endif
#define INF INT64_MAX
#define PI 3.14159265
using namespace std;
const double eps=1e-3;
typedef pair<double,double> p;
bool ok(int n,vector<p> v1,vector<p> v2){
// cout<<"OK\n";
sort(v2.begin(),v2.end());
/* rep(n){
printf("%.5lf %.5lf\n",v1[i].F,v1[i].S);
}//cout<<"\n";
rep(n){
printf("%.5lf %.5lf\n",v2[i].F,v2[i].S);
}cout<<"\n";*/
double disx=v1[0].F-v2[0].F;
double disy=v1[0].S-v2[0].S;
for(int i=1;i<n;i++){
double dx=v1[i].F-v2[i].F;
double dy=v1[i].S-v2[i].S;
if(abs(disx-dx)>eps||abs(disy-dy)>eps) return false;
}
return true;
}
bool solve(){
int n;
cin>>n;
vector<p> v1(n);
vector<p> v2(n);
rep(n){
cin>>v2[i].F>>v2[i].S;
}
rep(n){
cin>>v1[i].F>>v1[i].S;
}
sort(v1.begin(),v1.end());
vector<p> v3(n);
for(double d=0;d<=360;d+=0.0005){
double s=sin(d*PI/180.0);
double c=cos(d*PI/180.0);
rep(n){
double x=v2[i].F;
double y=v2[i].S;
v3[i].F=x*c+y*(-1)*s;
v3[i].S=x*s+y*c;
}
if(ok(n,v1,v3)) return true;
}
return false;
}
signed main(){
quick
bool f=solve();
if(f) cout<<"Yes\n";
else cout<<"No\n";
} | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template < typename Iterator >
void dump(Iterator fst, Iterator lst, string const dm = " ")
{ auto it=fst; for ( it!=lst && cout<<to_string(*it++); it!=lst; ) cout << dm << to_string(*it++);
cout << endl; }
template < typename T >
void dump( T const & v, string const delim = " ")
{ dump(begin(v), end(v), delim); }
ll N;
typedef pair<ll, ll> pll;
vector<ll> A, B;
void solve(void);
int main()
{
cin >> N;
REP(i, N) {
ll a, b;
cin >> a >> b;
A.push_back(a);
B.push_back(b);
}
solve();
}
void solve(void)
{
ll sa = 0;
vector<ll> aa;
REP(i, N) {
sa += A[i];
aa.push_back(2*A[i]+B[i]);
}
ll ans = 0;
ll d = sa;
//cout << sa << endl;
sort(aa.begin(), aa.end(), [](auto const& l, auto const& r){ return l > r; });
for (auto a : aa) {
//cout << "a = " << a << endl;
if (d<0) break;
d -= a;
ans++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define repl(k,n) for(k=0;k<n;++k)
int main() {
int A, B;
cin >> A >> B;
cout << (A + B) / 2<<"\n";
cout << (A - B) / 2;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int A,B;
cin>>A>>B;
cout << (A+B)/2 << " " << A - (A+B)/2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pairI2;
typedef pair<LL, LL> pairLL2;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define shig_for(i, a, b) for(int i = (a); i < (b); ++i)
#define shig_rep(i, n) shig_for(i, 0, n)
#define shig_forB(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define shig_repB(bit,n) shig_forB(bit,0,n)
#define CINLL(a) LL (a); cin >> (a)
#define CINI2(a, b) int a, b; cin >> (a) >> (b)
#define CINLL2(a, b) LL a, b; cin >> (a) >> (b)
#define tmp int temp = 0
#define str string s
struct Rect{
int rightIdx;
int leftIdx;
int height;
};
LL maxHistogramRect(VI &histogram)
{
LL maxArea = 0;
int histogramSize = histogram.size();
stack<Rect> weightStack;
for (int i = 0; i < histogramSize; i++){
Rect newRect;
newRect.height = histogram[i];
//空なのは最初だけ、それ以降は空でないことが保証できる
if (weightStack.empty()){
newRect.leftIdx = i;
weightStack.push(newRect);
maxArea = 1 * newRect.height;
}else{//取り出されたものは戻されることはなく、一方通行だからO(n)
int lastLeftIdx = i;
while (!weightStack.empty() && weightStack.top().height > histogram[i]){
weightStack.top().rightIdx = i - 1;
int area = (weightStack.top().rightIdx - weightStack.top().leftIdx + 1) * weightStack.top().height;
if(maxArea < area)maxArea = area;
lastLeftIdx = weightStack.top().leftIdx;
weightStack.pop();
}
Rect newRect;
newRect.height = histogram[i];
newRect.leftIdx = lastLeftIdx;
weightStack.push(newRect);
}
}
//weightStackに残ったものについての面積を計算する
while (!weightStack.empty()){
weightStack.top().rightIdx = histogramSize - 1;
int area = (weightStack.top().rightIdx - weightStack.top().leftIdx + 1) * weightStack.top().height;
if(maxArea < area)maxArea = area;
weightStack.pop();
}
return maxArea;
}
int main(){
LL N;
cin >> N;
VI A(N);
shig_rep(i, N)cin >> A[i];
LL ans = maxHistogramRect(A);
cout << ans << endl;
//for(string& s : S) cin >> s;
//cout << "Atcoder " << N << endl;
//cout << fixed << setprecision(10) << ans << endl;
return 0;
} | # include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define cauto const auto
# define int long long
# define float long double
# define fi first
# define se second
# define mkp make_pair
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i,n) for(int i=((int)(n)); i>0; --i)
# define repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)
# define reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)
# define all(x) std::begin(x), std::end(x)
# define rall(x) std::rbegin(x), std::rend(x)
# define pb push_back
# define eb emplace_back
# define len(x) ((int)(x).size())
# define contains(x,key) ((x).find(key) != (x).end())
# define lb(v,x) distance(std::begin(v), lower_bound(all(v), (x)))
# define ub(v,x) distance(std::begin(v), upper_bound(all(v), (x)))
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using mii = map<int, int>;
using mci = map<char, int>;
using msi = map<string, int>;
constexpr int INF = (1LL<<62)-(1LL<<31);
constexpr float EPS = 1e-10;
constexpr float PI = 3.1415926535897932385;
constexpr int Flag(int n) { return 1LL << n; }
template<class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template<class T> istream& operator>>(istream& is, vector<vector<T>>& v) { for(auto& x : v) for (auto& y : x) is >> y; return is; }
template<class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.fi >> p.se; }
template<class T> string join(const vector<T> &v){ stringstream s; rep (i, len(v)) s<<' '<<v[i]; return s.str().substr(1); }
template<class T> ostream& operator<<(ostream& os, const vector<T>& v){ if (len(v)) os << join(v); return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){ rep (i, len(v)) { if (len(v[i])) os << join(v[i]) << (i-len(v)+1 ? "\n" : ""); } return os; }
template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ cout << p.fi << " " << p.se; return os; }
void print(){ cout << "\n"; }
template<class T, class... A>void print(const T& v, const A&...args){cout << v; if(sizeof...(args))cout << " "; print(args...);}
void eprint() { cerr << "\n"; }
template<class T, class... A>void eprint(const T& v, const A&...args){cerr << v; if(sizeof...(args))cerr << " "; eprint(args...);}
void drop(){ cout << "\n"; exit(0); }
template<class T, class... A>void drop(const T& v, const A&...args){cout << v; if(sizeof...(args))cout << " "; drop(args...);}
template<class T> inline void Unique(T& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T> inline constexpr bool chmax(T &a, T b) { return a < b && (a = b, true); }
template<class T> inline constexpr bool chmin(T &a, T b) { return a > b && (a = b, true); }
constexpr int ctoi(const char c) { return ('0' <= c and c <= '9') ? (c - '0') : -1; }
const char* YesNo(bool b) { return b ? "Yes" : "No"; }
const char* YESNO(bool b) { return b ? "YES" : "NO"; }
const char* yesno(bool b) { return b ? "yes" : "no"; }
const char* yn(bool b) { return YesNo(b); }
# endif // ngng628_library
int32_t main() {
int n;
cin >> n;
vi a(n);
cin >> a;
int ans = 0;
rep (l, n) {
int mn = INF;
repr (r, l, n) {
chmin(mn, a[r]);
int ln = r - l + 1;
chmax(ans, mn*ln);
}
}
print(ans);
}
|
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
#define MAX_N 200001
using namespace std;
long long MOD = 1000000007;
struct unionSet{
int parent[MAX_N];
int size[MAX_N];
vector<map<int,int>> dict=vector<map<int,int>>(MAX_N,map<int,int>());
unionSet(int num){
for(int i=0; i<num; i++){
size[i]=1;
parent[i]=i;
}
}
//find root of x
int find(int x){
if (x==parent[x]){
return x;
}else{
return parent[x]=find(parent[x]);
}
}
//check if roots of x and y are same
bool same(int x, int y){
return (find(x)==find(y));
}
// unite sets of x and y
void unite(int x, int y){
x=find(x);
y=find(y);
if(x==y)return;
if(size[x]>size[y]){
for(auto kv:dict[y]){
int k=kv.first;
int v=kv.second;
if(dict[x].count(k)>0){
dict[x][k]+=v;
}else{
dict[x][k]=v;
}
}
parent[y]=x;
size[x]+=size[y];
}else{
for(auto kv:dict[x]){
int k=kv.first;
int v=kv.second;
if(dict[y].count(k)>0){
dict[y][k]+=v;
}else{
dict[y][k]=v;
}
}
parent[x]=y;
size[y]+=size[x];
}
}
};
template<typename T>
void cout_vec(vector<T> &vec){
for(int i=0; i<vec.size(); i++){
if (i!=0){
cout << ' ';
}
cout << vec[i];
}
cout << endl;
}
int main(){
int N, Q;
cin >> N >> Q;
unionSet us(N);
vector<int> cls(N,0);
for(int i=0; i<N; i++){
cin >> cls[i];
cls[i]--;
us.dict[i][cls[i]]=1;
}
for(int i=0; i<Q; i++){
int c,x,y;
cin >> c >> x >> y;
x--;y--;
x=us.find(x);
if(c==1){
us.unite(x,y);
}else if(us.dict[x].find(y)!=us.dict[x].end()){
cout << us.dict[x][y] << '\n';
}else{
cout << "0\n";
}
}
/*
for(int i=0; i<N; i++){
cout << us.size[i] << ' ';
}
*/
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>
constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;
//constexpr ll mod = 998244353;
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
void pt(T val) {
cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v) {
ll vs = v.size();
rep(i, vs) {
cout << v[i];
if (i == vs - 1)
cout << "\n";
else
cout << " ";
}
}
ll mypow(ll a, ll n) {
ll ret = 1;
if(n==0) return 1;
if(a==0) return 0;
rep(i, n) {
if (ret > (ll)(9e18 + 10) / a) return -1;
ret *= a;
}
return ret;
}
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;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll digsum(ll n) {
ll res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
struct UnionFind {
vector<ll> par,size;
UnionFind(ll N) : par(N) { //最初はすべてが根であるとして初期化
size.resize(N,1);
for(ll i=0;i<N;i++) par[i] = i;
}
ll root(ll x){ //データxの木の根を再帰で得る
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y){ //xとyの木を併合
ll rx = root(x);
ll ry = root(y);
if(rx == ry) return; //同じ木にあるときはそのまま
if(size[rx]>size[ry]){
par[ry]=rx;
size[rx] += size[ry];
}else{
par[rx] = ry;
size[ry] += size[rx];
}
return;
}
bool same(ll x, ll y){ //2つのデータx,yが属する木が同じならtrue
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll treesize(ll x){return size[root(x)];}
};
int main() {
ll n,m,t,x,y,q,k,ans=0;
cin>>n>>q;
vll c(n);
vector<map<ll, ll>> mp(n);
UnionFind uf(n);
rep(i,n){
cin>>c[i];
c[i]--;
mp[i][c[i]] = 1;
}
rep(i,q){
cin>>t>>x>>y;
if(t==1){
x--;y--;
if(uf.same(x,y)) continue;
x=uf.root(x);
y=uf.root(y);
uf.unite(x,y);
if(y==uf.root(x)) swap(x,y);
for(auto e:mp[y]){
mp[x][e.first] += e.second;
}
}else{
pt(mp[uf.root(x-1)][y-1]);
}
}
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+4;
int vis[N];
int a[N],pos[N],ans[N],cnt;
int main(){
int n;scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]),pos[a[i]]=i;
for(int i=1;i<=n;++i){
for(int j=pos[i];j>i;--j){
if(vis[j-1]) {puts("-1");return 0;}
vis[j-1]=1;
ans[++cnt]=j-1;
swap(a[j],a[j-1]);
pos[a[j]]=j;
pos[a[j-1]]=j-1;
}
}
for(int i=1;i<n;++i){
if(vis[i]!=1) {puts("-1");return 0;}
}
for(int i=1;i<=cnt;++i) cout<<ans[i]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
/**templates**/
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sull(x) scanf("%llu",&x)
#define sf(x) scanf("%lf",&x)
#define ss(x) scanf(" %s",x)
#define sc(x) scanf(" %c",&x)
#define pi acos(-1.0)
#define pb push_back
#define aa first
#define bb second
#define sz(x) (ll)(x).size()
#define cas printf("Case %lld: ",++t)
#define casline printf("Case %lld:\n",++t)
//#define cas cout<<"Case "<<++t<<": "
//#define casline cout<<"Case "<<++t<<":"<<endl;
#define distance(x1,y1,x2,y2)((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))
#define endl "\n"
#define bug cout<<"bugggggggggggg "<<endl;
#define fast ios_base::sync_with_stdio(0);cin.tie(nullptr); ///no printf/scanf
#define clean fflush(stdout)
const ll mod = 1000000007;
const ll inf = 1LL<<62;
const ll mx = 100005;
const double eps = 1e-10;
ll dx[10]={1,0,-1,0};
ll dy[10]={0,-1,0,1};
///ll dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; /// 8 Direction
///ll dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; /// Knight Direction
ll power(ll a,ll b)
{
if(b==0)return 1;
ll x=power(a,b/2);
x=x*x;
if(b%2)x=x*a;
return x;
}
ll bigmod(ll a,ll b)
{
if(b==0)return 1;
ll x=bigmod(a,b/2)%mod;
x=(x*x)%mod;
if(b%2)x=(x*a)%mod;
return x;
}
ll Set(ll N,ll pos){return N=N | (1LL<<pos);}
ll reset(ll N,ll pos){return N= N & ~(1LL<<pos);}
bool check(ll N,ll pos){return (bool)(N & (1LL<<pos));}
/**
...ENDING OF TEMPLATE...
*/
ll arr[2*mx],brr[2*mx];
ll ck[2*mx];
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
// fast; ///no printf/scanf
/** Use "long double"(%Lf) instead of double for precision safety*/
ll tst,a,b,c,k,n,m,res=0,ans=0,t=0;
sl(n);
for(ll i=1;i<=n;i++)
{
sl(arr[i]);
brr[arr[i]]=i;
}
vl v;
res=1;
for(ll i=1;i<=n;i++)
{
while(brr[i]!=i)
{
// cout<<brr[i]<<endl;
a=brr[i]-1;
if(ck[a])
{
res=0;
break;
}
// b=arr[]
v.pb(a);
ck[a]=1;
swap(arr[a],arr[a+1]);
brr[arr[a+1]]=a+1;
brr[arr[a]]=a;
if(sz(v)>n-1)
{
res=0;
break;
}
}
if(res==0)
break;
// for(ll i=1;i<=n;i++)
// {
// cout<<arr[i]<<" ";
// }
// cout<<endl;
}
// cout<<"size "<<sz(v)<<endl;
if(sz(v)!=n-1)
{
cout<<-1<<endl;
return 0;
}
for(ll i=1;i<=n;i++)
{
if(arr[i]!=i)
{
res=0;
break;
}
}
if(res==0)
{
cout<<-1<<endl;
return 0;
}
for(auto i:v)
{
cout<<i<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define SZ(x) ((int)((x).size()))
#define EACH(x, a) for (auto& x: a)
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x,i) ((x)|(1ll<<(i)))
#define FLIP(x,i) ((x)^(1ll<<(i)))
#define CLEAR(x,i) ((x)&~(1ll<<(i)))
const double pi = 4 * atan(1);
using ll = long long;
using pll = pair<ll, ll>;
mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
return uniform_int_distribution<ll>(a, b)(mt_rng);
}
template<class T> bool umin(T& a, const T& b) {
return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) {
return a<b?a=b, 1:0;
}
template<class ForwardIterator> void read(ForwardIterator first,
ForwardIterator last) {
while (first != last) {
cin >> (*first);
++first;
}
}
template<class T> void read(vector<T> &v) {
read(v.begin(),v.end());
}
template<class ForwardIterator> void print(ForwardIterator first,
ForwardIterator last, string sep = " ", string end = "\n") {
bool ft = true;
while (first != last) {
if (!ft) {cout << sep;} else {ft = false;}
cout << (*first);
++first;
}
cout << end;
}
template<typename T> void print(vector<T> &v, string sep = " ", string end = "\n") {
print(v.begin(),v.end(),sep,end);
}
template<typename T1, typename T2>
std::ostream& operator<<(std::ostream &o, const pair<T1, T2> &p) {
return o << p.F << " " << p.S;
}
template<typename T>
vector<int> argsort(const vector<T> &v, function<bool(T,T)> cmp) {
vector<int> indices(v.size());
iota(indices.begin(), indices.end(), 0);
sort(indices.begin(), indices.end(),[&v,&cmp](int left, int right) -> bool {return cmp(v[left],v[right]);});
return indices;
}
template<typename T>
vector<int> argsort(const vector<T> &v) {
return argsort<T>(v, less<T>());
}
template<typename T, typename T2>
vector<int> argsort(const vector<T> &v, function<T2(T)> key) {
vector<T2> v2(v.size());
for(int i = 0; i < SZ(v); i++) v2[i]=key(v[i]);
return argsort<T2>(v2);
}
inline ll floorDiv(ll x, ll y) {
ll d = x / y;
ll r = x % y;
return r ? (d - ((x < 0) ^ (y < 0))) : d;
}
ll ceilDiv(ll x, ll y) {
return -floorDiv(-x, y);
}
ll bin_search(ll lo, ll hi, function<bool(ll)> predicate) {
int sign = lo <= hi ? 1 : -1;
lo *= sign;
hi *= sign;
hi++;
while (lo < hi) {
ll mid = lo + floorDiv(hi-lo, 2);
if (!predicate(sign * mid)) {
lo = mid + 1;
} else {
hi = mid;
}
}
return sign * lo;
}
const ll MOD = 1000000007;
const int MAXN = 200005;
bool solve() {
int n;
cin >> n;
vector<int> v(n);
read(v);
sort(v.begin(),v.end());
for (int i = 0; i < n; i++) {
if (v[i] != i+1) {
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << (solve() ? "Yes" : "No") << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
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; }
const long long INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int main(){
int n;
cin >> n;
ll ans = 1;
REP(i, 2, n){
ans = lcm(ans, (ll)i);
}
ans++;
cout << ans << endl;
return 0;
}
|
//叫んで 藻掻もがいて 瞼まぶたを腫らしても
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e6 + 10;
const ll mod = 1e9+7;
#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
int n , m;
int x[maxn] , y[maxn];
vector < int > v , vc;
priority_queue < pii > pq;
int X(int x){
return lower_bound(v.begin() , v.end() , x) - v.begin();
}
int Y(int x){
return lower_bound(vc.begin() , vc.end() , x) - vc.begin();
}
set < int > ans;
set < pii > kil;
set < int > pos[maxn] , zap[maxn];
int32_t main(){
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin >> n >> m;
for(int i = 1 ; i <= m ; i ++)
cin >> x[i] >> y[i] , v.pb(x[i]) , vc.pb(y[i]) , vc.pb(y[i] - 1) , vc.pb(y[i] + 1);
vc.pb(n);
vc.pb(n+1);
vc.pb(n-1);
v.pb(0);
sort(v.begin() , v.end());
v.resize(unique(v.begin() , v.end()) - v.begin());
for(int i = 1 ; i <= m ; i ++)
x[i] = X(x[i]);
sort(vc.begin() , vc.end());
vc.resize(unique(vc.begin() , vc.end()) - vc.begin());
for(int i = 1 ; i <= m ; i ++)
y[i] = Y(y[i]);
for(int i = 1 ; i <= m ; i ++)
kil.insert({x[i] , y[i]}) , pos[y[i]].insert(x[i]) , zap[y[i]].insert(x[i]);
// x -> satr / y -> sootoon
pq.push({-X(0) , Y(n)});
while(!pq.empty()){
auto [cx , cy] = pq.top();
pq.pop();
cx = -cx;
while(kil.size() and (*kil.begin()).first <= cx){
pos[(*kil.begin()).second].erase((*kil.begin()).first);
if(zap[(*kil.begin()).second].count((*kil.begin()).first))zap[(*kil.begin()).second].erase((*kil.begin()).first);
kil.erase((*kil.begin()));
}
int lim = maxn;
if(pos[cy].empty())ans.insert(cy);
else lim = *pos[cy].begin();
while(zap[cy - 1].size() and *zap[cy-1].begin() <= lim){
int nx = *zap[cy - 1].begin();
pq.push(pii(-nx , cy - 1));
zap[cy - 1].erase(nx);
}
while(zap[cy + 1].size() and *zap[cy+1].begin() <= lim){
int nx = *zap[cy + 1].begin();
pq.push(pii(-nx , cy + 1));
zap[cy + 1].erase(nx);
}
}
cout << ans.size();
return(0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector<vpit> vpitt;
typedef long double ld;
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define mk(a,b) make_pair(a,b)
bool isrange(int y,int x,int n,int m){
if(0<=y&&y<n&&0<=x&&x<m) return true;
return false;
}
int dy[4] = {1,0,-1,0},dx[4]={0,1,0,-1},ddy[8] = {1,0,-1,0,1,1,-1,-1},ddx[8] = {0,1,0,-1,1,-1,1,-1};
const lld INF = 1e18;
struct MCMF{
struct Edge{
int to,r;
lld c,cost;
Edge() : Edge(0,0,0,0){
}
Edge(int a,lld b,int c,lld d) : to(a),c(b),r(c),cost(d){
}
};
vector<vector<Edge> > adj;
vector<pi> par;
int N,S,E;
MCMF(int n,int s,int e){
this->N = n;
this->S = s;
this->E = e;
adj.resize(n);
par.resize(n);
}
void push_edge(int a,int b ,lld c,lld d){
adj[a].push_back({b,c,sz(adj[b]),d});
adj[b].push_back({a,0,sz(adj[a])-1,-d});
}
bool SPFA(){
vector<int> inq;
vector<lld> dst;
inq.resize(N+5,0);
dst.resize(N+5,INF);
inq[S] = 1;
dst[S] = 0;
queue<int> q;
q.push(S);
while(!q.empty()){
int x = q.front();q.pop();
inq[x] = 0;
for(int i=0;i<sz(adj[x]);i++){
auto& e = adj[x][i];
if(e.c<=0) continue;
if(dst[x]<INF&&dst[e.to]>dst[x]+e.cost){
dst[e.to] = dst[x] + e.cost;
par[e.to] = mk(x,i);
if(inq[e.to]==0){
inq[e.to] = 1;
q.push(e.to);
}
}
}
}
return dst[E] != INF;
}
pl flow(){
lld work = 0;
lld money = 0;
while(SPFA()){
lld vv = 0;
lld f = INF;
for(int i = E;i!=S;i=par[i].x){
auto& e = adj[par[i].x][par[i].y];
f = min(f,e.c);
vv += e.cost;
}
work += f;
money += f*vv;
for(int i = E;i!=S;i=par[i].x){
auto& e = adj[par[i].x][par[i].y];
e.c -= f;
adj[e.to][e.r].c += f;
}
}
return mk(work,money);
}
};
const int MAX = 55;
int W[MAX],V[MAX],X[MAX];
void solve(int tc){
int n,m,q;
scanf("%d%d%d",&n,&m,&q);
for(int e=1;e<=n;e++) scanf("%d%d",&W[e],&V[e]);
for(int e=1;e<=m;e++) scanf("%d",&X[e]);
while(q--){
int l,r;
scanf("%d%d",&l,&r);
lld ans = 0;
for(int t=1;t<=m;t++){
int st = 0,ed = n + m + 2;
MCMF gh(n+m+3,st,ed);
gh.push_edge(st,1,t,0);
for(int e=1;e<=m;e++){
if(e>=l&&e<=r){
continue;
}
gh.push_edge(1,e+1,1,0);
for(int p=1;p<=n;p++){
if(X[e]>=W[p]){
gh.push_edge(e+1,m+1+p,1,-V[p]);
}
}
}
for(int p=1;p<=n;p++) gh.push_edge(m+1+p,ed,1,0);
pl now = gh.flow();
ans = max(ans,-now.y);
}
printf("%lld\n",ans);
}
}
int main(void){
/*
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
*/
int tc = 1;
/*
cin >> tc;
*/
for(int test_number=1;test_number<=tc;test_number++){
solve(test_number);
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<unordered_map>
#include<queue>
#include<deque>
#include<cmath>
#include<bitset>
#include<iomanip>
#include<stack>
#include<map>
#include<tuple>
#define ll long long
using namespace std;
bool ck(int n){
int x = n;
while (x > 0){
if (x % 8 == 7) return false;
x /= 8;
}
x = n;
while (x > 0){
if (x % 10 == 7) return false;
x /= 10;
}
return true;
}
int main(){
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++){
if (ck(i)) ans++;
}
cout << ans;
} | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
n %= 100;
n = 100-n;
cout << n << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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; }
mt19937_64 rnd(time(NULL));
i64 mod_pow(i64 x, i64 y, i64 mod){
i64 res = 1;
while(y > 0){
if(y & 1) res = res * x % mod;
x = x*x %mod;
y >>= 1;
}
return res;
}
int h,w;
string s[2020];
int a[2020][2020];
bool used[2020][2020];
void solve(){
cin >> h >> w;
for(int i = 0; i < h; i++){
cin >> s[i];
}
i64 l = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '.') l++;
}
}
for(int i = 0; i < h; i++) fill(a[i],a[i]+w,-1);
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '#') continue;
if(used[i][j]) continue;
int c = j;
while(s[i][j] == '.' && j < w) j++;
for(int k = c; k < j; k++){
a[i][k] += j-c;
}
}
}
for(int i = 0; i < h; i++) fill(used[i],used[i]+w, 0);
for(int j = 0; j < w; j++){
for(int i = 0; i < h; i++){
if(s[i][j] == '#') continue;
if(used[i][j]) continue;
int c = i;
while(s[i][j] == '.' && i < h) i++;
for(int k = c; k < i; k++){
a[k][j] += i-c;
}
}
}
i64 cnt = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '#') continue;
cnt += (mod_pow(2,a[i][j],INF)-1)*mod_pow(2,l-a[i][j],INF);
cnt %= INF;
}
}
cout << cnt << endl;
}
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
} |
#include <cctype>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
long long inv(int a, int p) { return a==1 ? 1 : (1-p*inv(p%a,a))/a+p; }
static const int MODVAL = 1000000007;
struct mint {
int val;
mint():val(0){}
mint(int x):val(x%MODVAL) { if(val<0) val+= MODVAL; }
mint(size_t x):val(x%MODVAL) {}
mint(long long x):val(x%MODVAL) { if(val<0) val+= MODVAL; }
mint& operator+=(mint y) { val+=y.val; if(val>=MODVAL) val-=MODVAL; return *this; }
mint& operator-=(mint y) { val-=y.val; if(val<0) val+= MODVAL; return *this; }
mint& operator*=(mint y) { val=(val*(long long)y.val)%MODVAL; return *this; }
mint& operator/=(mint y) { val=(val*inv(y.val,MODVAL))%MODVAL; return *this; }
};
inline mint operator+(mint x, mint y) { return x+=y; }
inline mint operator-(mint x, mint y) { return x-=y; }
inline mint operator*(mint x, mint y) { return x*=y; }
inline mint operator/(mint x, mint y) { return x/=y; }
mint POW(mint x, long long n) { mint r(1); for(;n;x*=x,n>>=1) if(n&1) r*=x; return r; }
mint FAC(int n) { static vector<mint> FAC_(1,1);
while(int(FAC_.size())<=n) FAC_.push_back(FAC_.back()*FAC_.size()); return FAC_[n]; }
inline mint CMB(int n, int k) { return k<0||n<k ? 0 : FAC(n) / (FAC(k) * FAC(n-k)); }
inline ostream& operator<<(ostream& os, mint a) { return os << a.val; }
char buf[2010][2010];
int ct[2010][2010];
bool used[2][2010][2010];
int main(void) {
int h, w;
scanf("%d%d", &h, &w);
int empty = 0;
REP(i, h) {
scanf("%s", buf[i]);
REP(j, w) {
if(buf[i][j] == '.') {
++empty;
}
}
}
REP(i, h) {
REP(j, w) {
if(buf[i][j] != '.') {
continue;
}
if(!used[0][i][j]) {
int c = 0;
for(int ii = i; ii < h && buf[ii][j] == '.'; ++ii) {
++c;
}
for(int ii = i; ii < h && buf[ii][j] == '.'; ++ii) {
ct[ii][j] += c;
used[0][ii][j] = true;
}
}
if(!used[1][i][j]) {
int c = 0;
for(int jj = j; jj < w && buf[i][jj] == '.'; ++jj) {
++c;
}
for(int jj = j; jj < w && buf[i][jj] == '.'; ++jj) {
ct[i][jj] += c;
used[1][i][jj] = true;
}
}
}
}
mint res = empty * POW(2, empty);
REP(i, h) {
REP(j, w) {
if(buf[i][j] == '#') {
continue;
}
// cerr << ct[i][j] << " ";
// cerr << POW(2, empty-ct[i][j]+1) << " ";
res -= POW(2, empty-ct[i][j]+1);
}
// cerr << endl;
}
cout << res << endl;
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 X, Y, A, B;
cin >> X >> Y >> A >> B;
if (A >= B) {
ll c = (Y - X) / B;
if (c != 0 and (Y - X) % B == 0) c--;
COUT(c);
return 0;
}
ll ans = 0;
while (1) {
ll next1 = X * A;
ll next2 = X + B;
if ((ld)X >= (ld)Y / (ld)A) break;
if (next1 >= Y) break;
if (next1 >= next2) break;
X = next1;
ans++;
}
if (Y - X > B) {
ll count = (Y - X) / B;
if (count != 0 and (Y - X) % B == 0) count--;
ans += count;
}
ANS;
return 0;
} | #pragma warning(disable: 4996)
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <map>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
ll x, y, a, b;
ll ans = 0;
cin >> x >> y >> a >> b;
while ((x + b >= x * a) && a * x < y && (double)a * x <= 2e18) {
x *= a;
ans++;
}
ans += ((y - x - 1) / b);
cout << ans << endl;
return 0;
} |
# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i,n) for(int i=((int)(n)); i>0; --i)
# define repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)
# define reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)
# define all(x) std::begin(x), std::end(x)
# define rall(x) std::rbegin(x), std::rend(x)
# define pb push_back
# define eb emplace_back
# define len(x) ((int)(x).size())
using namespace std;
template<class T> using vec = vector<T>;
using pii = pair<int, int>;
using vi = vec<int>;
using vvi = vec<vi>;
using db = deque<bool>;
using ddb = deque<db>;
using vs = vec<string>;
constexpr int INF = (1LL<<62)-(1LL<<31);
constexpr float EPS = 1e-10;
template<class T> istream& operator>>(istream& is, vec<T>& v) { for (auto& x : v) is >> x; return is; }
template<class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.fi >> p.se; }
template<class T> string join(const vec<T> &v){ stringstream s; rep (i, len(v)) s<<' '<<v[i]; return s.str().substr(1); }
template<class T> ostream& operator<<(ostream& os, const vec<T>& v){ if (len(v)) os << join(v); return os; }
template<class T> ostream& operator<<(ostream& os, const vec<vec<T>>& v){ rep (i, len(v)) if (len(v[i])) os << join(v[i]) << (i-len(v)+1 ? "\n" : ""); return os; }
template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << p.fi << " " << p.se; }
template<class T, class U, class V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t){ return os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t); }
void print(){ cout << "\n"; }
template<class T, class... A>void print(const T& v, const A&...args){ cout << v; if(sizeof...(args))cout << " "; print(args...); }
void eprint() { cerr << "\n"; }
template<class T, class... A>void eprint(const T& v, const A&...args){ cerr << v; if(sizeof...(args))cerr << " "; eprint(args...); }
void drop(){ cout << "\n"; exit(0); }
template<class T, class... A>void drop(const T& v, const A&...args){ cout << v; if(sizeof...(args))cout << " "; drop(args...); }
template<class T> constexpr bool chmax(T &a, const T& b) { return a < b && (a = b, true); }
template<class T> constexpr bool chmin(T &a, const T& b) { return a > b && (a = b, true); }
constexpr int ctoi(const char c) { return ('0' <= c and c <= '9') ? (c - '0') : -1; }
# endif // ngng628_library
int32_t main() {
string s;
cin >> s;
for (char c : s) {
if (c == '.') break;
cout << c;
}
cout << "\n";
}
| #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
long long int N;
cin >> N;
string str = to_string(N);
int size = str.size();
if (size % 2 == 0)
{
int num1 = atoi(str.substr(0, size / 2).c_str());
int num2 = atoi(str.substr(size / 2, size / 2).c_str());
int count = 0;
if (num1 > num2) count = num1 - 1;
else count = num1;
cout << count << endl;
}
else
{
int count = 0;
if (size == 1) count = 0;
else if (size == 3) count = 9;
else if (size == 5) count = 99;
else if (size == 7) count = 999;
else if (size == 9) count = 9999;
else if (size == 11) count = 99999;
else if (size == 13) count = 999999;
cout << count << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#include <ctype.h>
int main(void)
{
char S, T;
cin >> S >> T;
if(S =='Y') {
T = toupper(T);
}
else {
}
cout << T << endl;
return 0;
}
| /* https://codeforces.com/contest/1360/problem/H */
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
using ld = double;
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define ins insert
const int MAX = INT_MAX;
int main() {
char s, t;
cin>>s;
cin>>t;
if (s == 'Y') {
if (t == 'a') cout<<"A"<<endl;
else if (t == 'b') cout<<"B"<<endl;
else cout<<"C"<<endl;
}
else {
if (t == 'a') cout<<"a"<<endl;
else if (t == 'b') cout<<"b"<<endl;
else cout<<"c"<<endl;
}
return 0;
}
|
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define mem(a,v) memset((a), (v), sizeof (a))
#define endl "\n"
#define case(t) cout << "Case #" << (t) << ": "
#define reada(a, n) for (int _i = 0; _i < (n); _i++) read(a[_i])
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
const double eps = 1e-9;
template<class T> void read(T& x) { cin >> x; }
template<class X, class Y> void read(pair<X,Y>& a) { read(a.first), read(a.second); }
template<class T, size_t U> void read(array<T,U>& x) { for (int i = 0; i < U; i++) read(x[i]); }
template<class T> void read(vector<T>& x) { trav(y, x) read(y); }
template<class T, class... O> void read(T& x, O&... y) { read(x), read(y...); }
string to_string(const char& x) { return string(1,x); }
string to_string(const char*& x) { return (string)x; }
string to_string(const string& x) { return x; }
template<class T, class U> string to_string(const pair<T,U>& x) { return to_string(x.first) + " " + to_string(x.second); }
template<class T, size_t U> string to_string(const array<T,U>& x) { string ret = ""; for (int i = 0; i < U; i++) ret += (!i ? "" : " ") + to_string(x[i]); return ret; }
template<class T> string to_string(const vector<T>& x) { string ret = ""; bool f = 0; trav(y, x) ret += (!f ? "" : " ") + to_string(y), f = 1; return ret; }
template<class T> string to_string(const set<T>& x) { string ret = ""; bool f = 0; trav(y, x) ret += (!f ? "" : " ") + to_string(y), f = 1; return ret; }
void print() { cout << endl; }
template<class T> void pr(const T& x) { cout << to_string(x); }
template<class T, class... O> void print(const T& x, const O&... y) { pr(x); if (sizeof...(y)) pr(" "); print(y...); }
vector<string> solve(int n) {
if (n == 1) {
vector<string> ret;
ret.push_back("AB");
return ret;
}
vector<string> ret;
string c = "";
for (int i = 0; i < (1 << (n - 1)); i++)
c.push_back('A');
for (int i = 0; i < (1 << (n - 1)); i++)
c.push_back('B');
ret.push_back(c);
vector<string> lo = solve(n - 1);
trav(x, lo) {
ret.push_back(x + x);
string y = x;
trav(c, y)
if (c == 'A')
c = 'B';
else
c = 'A';
ret.push_back(x + y);
}
return ret;
}
int main() {
FIO
int n; read(n);
vector<string> ans = solve(n);
print(sz(ans));
trav(x, ans)
print(x);
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
vector <int> dy = {0, 1, 0, -1};
vector <int> dx = {1, 0, -1, 0};
const int INF = 1000000000;
const ll INFLL = 100000000000000000;
long long pow(long long x, long long n) {
long long ret = 1;
while (n > 0) {
if (n & 1) ret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける
x *= x;
n >>= 1; // n を1bit 左にずらす
}
return ret;
}
int main(){
ll n; cin >> n;
if(n == 0){
cout << "Yes" << endl;
return 0;
}
while(n % 10 == 0){
n /= 10;
}
string s_n = to_string(n);
string r_n = to_string(n);
reverse(r_n.begin(), r_n.end());
if(s_n == r_n){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} |
#include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define INF 3000000000000001 // 3e15
#define ll_max 9000000000000000000
#define PI 3.14159265358979323846L
#define fill(a, n, x) for(int i = 0; i < n; i++) a[i] = x;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll mod = 1000000007;
const ll N = 10000110;
const ll M = log2(N) + 1;
struct point
{
ll x, y;
};
template<typename T>
T fast_exp(T x,T n)
{
if(n == 0) return 1;
T ans = 1;
if(n % 2 == 0)
{
ans = fast_exp(x, n / 2);
ans = ans * ans % mod;
}
else ans = fast_exp(x, n - 1) * x % mod;
return ans;
}
void update(ll BIT[], ll i, ll x, ll n)
{
if(i <= 0) return;
for(; i <= n; i += i & (-i))
BIT[i] += x;
}
ll query(ll BIT[], ll l, ll r)
{
l--;
ll sum = 0;
while(r > 0)
{
sum += BIT[r];
r = r & (r - 1);
}
while(l > 0)
{
sum -= BIT[l];
l = l & (l - 1);
}
return sum;
}
ll fact[2], infact[2];
void work()
{
fact[0] = fact[1] = infact[0] = infact[1] = 1;
for(ll i = 2; i < N; i++)
{
fact[i] = fact[i - 1] * i % mod;
infact[i] = fast_exp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r)
{
if(r > n || r < 0) return 0;
return fact[n] * infact[n - r] % mod * infact[r] % mod;
}
int main()
{
fast;
int _ = 1, test = 0;
// cin >> _;
while(_--)
{
test++;
ll n, m, x = 0, y = 0, ans = 0, k = 0;
cin >> n;
ll a[n + 1];
for(int i = 1; i <= n; i++) a[i] = 2;
a[1] = 1;
for(int i = 2; i <= n; i++)
{
x = a[i];
for(int j = i + i; j <= n; j += i)
{
a[j] = x + 1;
}
}
for(int i = 1; i <= n; i++) cout << a[i] << " ";
//cout << ans << "\n";
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
ll n;
cin >> n;
vector<int> v;
while (n) {
v.push_back(n % 10);
n /= 10;
}
reverse(v.begin(), v.end());
int m = v.size();
int ans = 1e9;
for (int bit = 1; bit < (1 << m); ++bit) {
ll sum = 0;
int cnt = 0;
for (int i = 0; i < m; ++i) {
if (bit >> i & 1) {
cnt++;
sum *= 10;
sum += v[i];
}
}
if (sum % 3 == 0) {
ans = min(ans, m - cnt);
}
}
cout << (ans == 1e9 ? -1 : ans) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
string base = "atcoder";
while(t--){
string s;
cin >> s;
int at = 0, n = s.size();
while(at < base.size() && at < n && base[at] == s[at]) at++;
if((at < base.size() && at < n && base[at] < s[at]) || (at == base.size() && at < n)) cout << 0 << '\n';
else if(at == 1){
int ans = 1<<30;
while(at < n && s[at] == 'a') at++;
if(at == n) ans = -1;
else {
if(s[at] > 't') ans = at - 1;
else ans = at;
}
cout << ans << '\n';
} else {
assert(at > 1);
cout << 1 << '\n';
}
}
return 0;
}
| #include <iostream>
#include <string>
int main() {
const std::string atcoder = "atcoder";
int T;
std::cin >> T;
for (int t = 0; t < T; ++t) {
std::string S;
std::cin >> S;
if (S > atcoder) {
std::cout << 0 << std::endl;
continue;
}
int index = -1;
for (std::size_t i = 0; i < S.size(); ++i) {
if (S[i] > 'a') {
index = i;
break;
}
}
if (index <= 0) {
std::cout << index << std::endl;
continue;
}
for (int count = 1, i = index - 1; i >= 0; --i, ++count) {
std::swap(S[i], S[i + 1]);
if (S > atcoder) {
std::cout << count << std::endl;
break;
}
}
}
return 0;
}
|
#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main(void){
long long N,Sum,Ans,count;
cin >> N;
int A[N];
count =1;
Sum =0;
Ans =0;
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A,A+N);
for(int j=0;j<N;j++){
if(A[j]==A[j+1]){
count++;
}else{
Sum += count*count;
count=1;
}
}
Ans = (N*N-Sum)/2;
cout << Ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define PI 3.14159265
#define sqr(x) ((x)*(x))
#define vi vector<int>
#define vll vector<long long>
#define vull vector<unsigned long long>
#define all(v) ((v).begin()), ((v).end())
#define rev(v) ((v).rbegin()), ((v).rend())
#define rep(i, st, en) for(int i = st; i < en; i++)
#define endl "\n"
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned long long int ulli;
//int prefix[MAX];
//ll sieve_size;
//bitset<10000010>bs;
//vll p;
//void sieve(ll upperbound) {
// sieve_size = upperbound + 1;
// bs.set();
// bs[0] = bs[1] = false;
// for (ll i = 2; i < sieve_size; i++) {
// if (bs[i]) {
// for (ll j = i * i; j < sieve_size; j += i) bs[j] = false;
// p.push_back(i);
// }
// }
// prefix[0] = prefix[1] = 0;
// for (int p = 2; p <= MAX; p++) {
// prefix[p] = prefix[p - 1];
// if (bs[p])
// prefix[p]++;
// }
//}
bool isPrime(ll n) {
// Corner cases
if (n <= 1) return false;
if (n <= 3) return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
bool bySec(const pair<int,int> &a, const pair<int,int> &b){
return (a.second < b.second);
}
template<typename T>
void takeInput(vector<T>& v)
{
for (auto& value: v)
cin >> value;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vi v(n);
takeInput(v);
int mx = INT_MIN;
rep(i, 0, n){
int x = v[i];
rep(j, i, n){
x = min(x, v[j]);
mx = max(mx, x*(j-i+1));
}
}
cout << mx;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int a,b;cin>>a>>b;
cout<<(a+b)/2<<" "<<a-(a+b)/2;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
int main(){
int a,b; cin>>a>>b;
for(int i=-100; i<=100; ++i){
for(int j=-100; j<=100; ++j){
if(i+j==a && i-j==b){
cout << i <<" "<< j << endl;
return 0;
}
}
}
return 0;
} |
#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <functional>
#include <cassert>
#include <cctype>
#include <string>
#include <sstream>
#include <bitset>
#include <list>
#include <set>
#include <stack>
using namespace std;
typedef long long ll;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((ll)(x).size())
#define LT(x) (x<<1)
#define RT(x) (x<<1|1)
#define MID(x, y) (x + y) >> 1
typedef vector<ll> VI;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const ll mod = 1000000007;
const ll LINF = 1e16 + 10;
const int MAXN = 2e5 + 24;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
char vec[MAXN];
int main() {
#ifdef kirito
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif // kirito
int n, s;
while (~scanf("%d %d", &n, &s)) {
scanf("%s", &vec);
for (int i = 0; i < n; i++) {
if (vec[i] == 'x') {
s--;
s = max(s, 0);
}
else {
s++;
}
}
printf("%d\n", s);
}
return 0;
} | //F - Valid payments
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#define ll long long
#define cl(x, y) memset((x), (y), sizeof(x))
#define rep(i, a, b) for(ll i = a; i <= b; i++)
#define per(i, a, b) for(ll i = a; i >= b; i--)
#define de(x) cerr << #x << " = " << x << " "
#define inc_mod(x, y) x = ((x - y) % mod + mod) % mod
#define add_mod(x, y) x = (x + y) % mod
#define add(x, y) x += y
#define inc(x, y) x -= y
#define Lowbit(x) (x & (-x))
#define inf 0x3f3f3f3f3f3f3f3f
#define mod 998244353
#define rson (x << 1 | 1)
#define lson (x << 1)
using namespace std;
const ll maxn = 100;
ll total, limit, ans;
ll num[maxn];
map<ll, ll> cube;
inline void File() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
signed main() {
// file();
ios::sync_with_stdio(false);
cin >> total >> limit;
rep(i, 1, total) { cin >> num[i]; }
cube[limit] = 1;
rep(i, 1, total-1) {
ll x = num[i+1] / num[i];
map<ll, ll> temp;
map<ll, ll>::iterator iter;
for(iter = cube.begin(); iter != cube.end(); iter++) {
if((*iter).first % x) { temp[(*iter).first / x + 1] += (*iter).second; }
temp[(*iter).first / x] += (*iter).second;
}
swap(cube, temp);
}
map<ll, ll>::iterator iter;
for(iter = cube.begin(); iter != cube.end(); iter++)
ans += (*iter).second;
cout << ans << endl;
// fclose(stdin);
// fclose(stdout);
// system("pause");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr double EPS = 1e-10;
constexpr double PI = M_PI;
void solve() {
int N;
cin >> N;
vector<int> P(N);
for (int i=0; i<N; ++i) cin >> P[i];
for (int i=0; i<N; ++i) --P[i];
vector<int> idx(N);
for (int i=0; i<N; ++i) idx[P[i]] = i;
vector<int> ans;
int cur = 0;
auto sorted = [&P](int s, int t) -> bool {
for (int i=s; i<t; ++i) {
if (P[i] != i + 1) return false;
}
return true;
};
while (cur < N-1) {
int id = idx[cur];
if (id == cur) {
cout << -1 << '\n';
return;
} else if (id == cur + 1) {
ans.push_back(cur);
++idx[P[id-1]];
swap(P[id-1], P[id]);
cur = id;
} else {
if (!sorted(cur, id-1)) {
cout << -1 << '\n';
return;
}
for (int i=id-1; i>=cur; --i) ans.push_back(i);
++idx[P[id-1]];
swap(P[id-1], P[id]);
cur = id;
}
}
if ((int)ans.size() != N-1) cout << -1 << '\n';
else for (int x : ans) cout << x + 1 << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
solve();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
ll n;
vector<pi> v;
int main() {
FAST
cin>>n;
ll mx = -1;
FOR(i,1,n) {
ll a; cin>>a;
if(mx > i && a >= i) {
cout<<"-1\n";
return 0;
}
if(a > i) {
v.eb(i, a);
}
mx = max(mx, a);
}
reverse(all(v));
vector<ll> o;
for(auto i:v) {
FOR(j,i.f,i.s-1) {
o.eb(j);
}
}
if(o.size()!=n-1) {
cout<<"-1\n";
return 0;
}
for(auto i:o) cout<<i<<'\n';
return 0;
}
|
#pragma GCC optimize("O3")
// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }
template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg!=',')cerr<<*sdbg++;
cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}
template<class T> ostream &operator<<(ostream& os, vector<T> V) {
os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
return os << "(" << P.st << "," << P.nd << ")";
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
// using mint = modint998244353;
// ostream& operator<<(ostream& out, mint m){
// out << m.val();
// return out;
// }
const int P = 998244353;
void add(int &a,int b){
a += b;
if(a >= P)
a -= P;
}
void sub(int &a,int b){
a -= b;
if(a < 0)
a += P;
}
int mul(int a,int b){
return a * b % P;
}
int n;
int res = 0;
vector<vector<int>> dp;
vector<int> t;
void add(int x){
int pom = t[x];
int a = SZ(dp);
int b = SZ(dp[0]);
vector<vector<int>> dp2(a + 1,vector<int>(b + pom));
R(i,a)R(j,b){
add(dp2[i + 1][j + pom], mul(dp[i][j], i + 1));
if(j <= pom){
add(dp2[a - i][pom - j], mul(dp[i][j], a - i));
}else{
add(dp2[i][j - pom], mul(dp[i][j], a - i));
}
}
// debug(dp,pom,dp2);
swap(dp,dp2);
}
void licz(int po,int ko){
if(po + 1 == ko){
debug(po,dp);
R(i,SZ(dp)){
R(j,min(SZ(dp[0]), t[po])){
sub(res, dp[i][j]);
}
}
debug(po,t[po],res);
return;
}
int m = (po + ko) / 2;
auto pam = dp;
for(int i = po; i < m; i++)add(i);
licz(m,ko);
swap(dp,pam);
for(int i = m; i < ko; i++)add(i);
licz(po,m);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(11);
cerr << fixed << setprecision(6);
cin >> n;
t.resize(n);
res = 1;
R(i,n){
cin >> t[i];
res = mul(res, i + 1);
}
debug(res);
dp.resize(1,vector<int>(1,1));
licz(0,n);
cout << res << "\n";
}
| #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define ci(x) cin >> x
#define ci2(x, y) cin >> x >> y
#define ci3(x, y, z) cin >> x >> y >> z
#define ci4(w, x, y, z) cin >> w >> x >> y >> z
#define co(x) cout << x << endl
#define co2(x, y) cout << x << " " << y << endl
#define co3(x, y, z) cout << x << " " << y << " " << z << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> PQ;
typedef priority_queue<int, vector<int>, greater<int>> PQG;
typedef priority_queue<P> PQP;
typedef priority_queue<P, vector<P>, greater<P>> PQPG;
const int MAX_N = 2e5, MOD = 1e9 + 7, INF = 1e9;
int n, m, k;
vector<int> to[100];
typedef vector<int> vec;
typedef vector<vec> mat;
int po(int x, int y) {
int ans = 1;
while (y > 0) {
if (y & 1) ans = static_cast<long>(ans) * x % MOD;
x = static_cast<long>(x) * x % MOD;
y >>= 1;
}
return ans;
}
mat mul(mat &A, mat &B) {
mat C(A.size(), vec(B[0].size()));
for (int i = 0; i < A.size(); i++) {
for (int k = 0; k < B.size(); k++) {
for (int j = 0; j < B[0].size(); j++) {
C[i][j] = (C[i][j] + scll(A[i][k]) * B[k][j] % MOD) % MOD;
}
}
}
return C;
}
mat pow(mat A, long n) {
mat B(A.size(), vec(A.size()));
for (int i = 0; i < A.size(); i++) {
B[i][i] = 1;
}
while (n > 0) {
if (n & 1) B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
int main() {
ci3(n, m, k);
mat a(n, vec(1));
rep(i, n) ci(a[i][0]);
rep(i, m) {
int x, y;
ci2(x, y);
to[x - 1].epb(y - 1);
to[y - 1].epb(x - 1);
}
mat PRO(n, vec(n));
rep(i, n) {
rep(j, n) PRO[i][j] = 0;
for (auto &j: to[i]) PRO[i][j] = 1;
PRO[i][i] = (2 * m - to[i].size()) % MOD;
}
mat POPRO = pow(PRO, k);
mat ans = mul(POPRO, a);
int pp = po(po(2 * m, MOD - 2), k);
rep(i, n) co(scll(ans[i][0]) * pp % MOD);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (n-1); i >= 0; i--)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S>S sum(vector<S>& a) {return accumulate(all(a), S());}
template <class S>S max(vector<S>& a) {return *max_element(all(a));}
template <class S>S min(vector<S>& a) {return *min_element(all(a));}
ll max(int a, ll b) { return max((ll)a, b); } ll max(ll a, int b) { return max(a, (ll)b); }
ll min(int a, ll b) { return min((ll)a, b); } ll min(ll a, int b) { return min(a, (ll)b); }
void Main();
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
Main();
return 0;
}
vector<bool> ans;
vector<int> c;
vector<vector<int>> graph;
void dfs(int node, int par, set<int>& used) {
if(!used.count(c[node])) {
ans[node] = true;
}
used.insert(c[node]);
for(int child: graph[node]){
if(child != par) {
dfs(child, node, used);
}
}
if(ans[node]) {
used.erase(c[node]);
}
}
void Main(){
int n; cin >> n;
c.resize(n);
rep(i,n) cin >> c[i];
graph.resize(n);
Rep(n-1) {
int a,b; cin >> a >> b;
a--; b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
ans.resize(n, false);
set<int> used;
dfs(0, -1, used);
rep(i, n){
if(ans[i]) cout << i+1 << endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define f(i,n) for(int i=0;i<n;i++)
#define fp(i,k,n) for(int i=k;i<=n;i++)
#define fr(i,k,n) for(int i=k;i>=n;i--)
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define dbg(x) cout << (#x) << " is " << (x) << '\n'
#define F first
#define S second
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound
#define mems(x) memset(x,0,sizeof(x))
#define all(a) a.begin(),a.end()
/*---------------------------------------------------------------------------------------------------*/
void solve()
{
int m, n, k;
cin >> n;
pair<double, double> a[n];
double x, y;
f (i, n)
{
cin >> x >> y;
a[i] = make_pair(x, y);
}
int ans = 0;
f (i, n)
{
fp (j, i + 1, n - 1)
{
double slope = abs ((double)a[i].F - a[j].F);
if (slope)
{
slope = (abs((double)a[i].S - a[j].S) )/ slope;
if (slope <= 1)
{
ans++;
}
}
}
}
cout << ans;
}
signed main()
{
FAST
int T = 1;
// cin >> T;
while (T--) solve();
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>
#define int long long
#define lowbit(x) (x&(-x))
#define mid ((l+r)>>1)
#define lc (x<<1)
#define rc (x<<1|1)
#define fan(x) (((x-1)^1)+1)
#define max Max
#define min Min
#define abs Abs
using namespace std;
inline int read()
{
int ans=0,f=1;
char c=getchar();
while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){ans=(ans<<1)+(ans<<3)+c-'0';c=getchar();}
return ans*f;
}
inline void write(int x)
{
if(x<0) putchar('-'),x=-x;
if(x/10) write(x/10);
putchar((char)(x%10)+'0');
}
template<typename T>inline T Abs(T a){return a>0?a:-a;};
template<typename T,typename TT>inline T Min(T a,TT b){return a>b?b:a;}
template<typename T,typename TT> inline T Max(T a,TT b){return a>b?a:b;}
const int N=1e6+5;
int n,a[N];
inline int merge(int l,int r);
signed main()
{
n=(1<<read());
for(int i=1;i<=n;++i)
a[i]=read();
merge(1,n);
return 0;
}
inline int merge(int l,int r)
{
if(l==r) return l;
int x1=merge(l,mid);
int x2=merge(mid+1,r);
if(l==1&&r==n) printf("%lld\n",a[x1]<a[x2]?x1:x2);
return a[x1]>a[x2]?x1:x2;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<vector<bool>> a(n + 1, vector<bool>(n + 1, false));
for(int i = 1; i <= m; ++i){
int x, y;
cin >> x >> y;
a[x][y] = true;
a[y][x] = true;
}
const int FULL_MASK = (1 << n) - 1;
vector<bool> isComplete(FULL_MASK + 1, true);
for(int mask = 0; mask <= FULL_MASK; ++mask){
vector<int> nodes;
for(int bit = 0; bit < n; ++bit){
if((mask >> bit) & 1){
nodes.push_back(bit + 1);
}
}
for(int i = 0; i < (int)nodes.size(); ++i){
for(int j = i + 1; j < (int)nodes.size(); ++j){
if(!a[nodes[i]][nodes[j]]){
isComplete[mask] = false;
break;
}
}
}
}
const int INF = n + 5;
vector<int> minCC(FULL_MASK + 1, INF);
for(int mask = 0; mask <= FULL_MASK; ++mask){
if(isComplete[mask]){
minCC[mask] = 1;
}
}
for(int mask = 1; mask <= FULL_MASK; ++mask){
for(int submask = mask; submask >= 1; submask = (submask - 1) & mask){
minCC[mask] = min(minCC[submask] + minCC[submask ^ mask], minCC[mask]);
}
}
cout << minCC[FULL_MASK];
return 0;
} |
#include<iostream>
#include<vector>
#include<math.h>
#include<algorithm>
using namespace std;
main()
{
long long int n,i,j;
vector<long long int>v;
cin>>n;
for(i=1;i<=sqrt(n);i++)
{
if(n%i==0 && i*i!=n)
{
v.push_back(i);
v.push_back(n/i);
}
else if(i*i==n)
{
v.push_back(i);
}
}
sort(v.begin(),v.end());
for(i=0;i<v.size();i++)
{
cout<<v[i]<<endl;
}
} | #include<iostream>
#include<bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include<climits>
#include <algorithm>
using namespace std;
const long long M = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#define endl "\n"
#define pb push_back
#define MP make_pair
#define f first
#define s second
#define rfor(i,b,a) for(int i=b;i>=a;i--)
#define INF 1000000007
long long mod(long long x) {
return ((x % M + M) % M);
}
long long add(long long a, long long b) {
return mod(mod(a) + mod(b));
}
long long mul(long long a, long long b) {
return mod(mod(a) * mod(b));
}
int gcd(int a, int b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
int lcm(int a, int b) {
return (a / gcd(a, b)) * b;
}
int fact(int n) {
if (n == 0 || n == 1) return 1;
else return n * fact(n - 1);
}
int ncr(int n, int r) {
return fact(n) / (fact(n - r) * fact(r));
}
bool isPrime(int n)
{
if (n == 1) return false;
if (n == 2) return true;
for (int i = 2; i <= sqrt(n); i++)
{
if (n % i == 0) return false;
}
return true;
}
void sieve(int *p) {
for (int i = 3; i <= 1000000; i += 2) {
p[i] = 1;
}
for (ll i = 3; i <= 1000000; i += 2) {
if (p[i] == 1) {
for (ll j = i * i; j <= 1000000; j += i) {
p[j] = 0;
}
}
}
p[2] = 1;
p[0] = p[1] = 0;
}
bool sortbysecdec(const pair<int, int> &a, const pair<int, int> &b)
{
return (a.second > b.second);
}
bool sortbysecinc(const pair<int, int> &a, const pair<int, int> &b)
{
return (a.second < b.second);
}
bool equal(pair<int, int> temp, int a) {
return temp.second == a;
}
bool feasible(int mid, vector<int>& arr, int n, int k) {
int pos = arr[0];
int elements = 1;
for (int i = 1; i < n; i++) {
if (arr[i] - pos >= mid) {
pos = arr[i];
elements++;
}
if (elements == k) return true;
}
return false;
}
int check(map<char, int> freq) {
int maxx = -1;
char maxx_element;
for (auto i : freq) {
if (i.second > maxx) {
maxx = i.second;
maxx_element = i.first;
}
}
int ans = 0;
for (auto i : freq) {
if (i.first != maxx_element) ans += i.second;
}
return ans;
}
bool check(int n) {
int n1 = n;
while (n) {
if (n % 10 == 7) return false;
n /= 10;
}
while (n1) {
if (n1 % 8 == 7) return false;
n1 /= 8;
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input_codeforces.txt", "r", stdin);
freopen("output_codeforces.txt", "w", stdout);
#endif
int n;
cin >> n;
int res = 0;
for (int i = 1; i <= n; i++) {
if (check(i)) res++;
}
cout << res << endl;
}
|
// C - Too Heavy
#include<bits/stdc++.h>
#define forn(i,s,t) for(register int i=(s);i<=(t);++i)
using namespace std;
typedef pair<int, int> pii;
const int N = 2e5+3;
int n, a[N], b[N], p[N], rft[N];
bool vis[N];
int main() {
scanf("%d", &n);
forn(i,1,n) scanf("%d", a+i);
forn(i,1,n) scanf("%d", b+i);
forn(i,1,n) scanf("%d", p+i);
static priority_queue<pii> q;
forn(i,1,n) {
if(i == p[i]) {vis[i] = 1; continue ;}
if(a[i] <= b[p[i]]) {puts("-1"); return 0;}
rft[p[i]] = i;
q.push(make_pair(-a[i], i));
}
static int cnt, L[N], R[N];
while(!q.empty()) {
static int cur;
cur = q.top().second;
q.pop();
if(vis[cur]) continue ;
L[++cnt] = cur, R[cnt] = rft[cur];
vis[cur] = 1, rft[p[cur]] = rft[cur];
if(rft[cur] == p[cur]) vis[rft[cur]] = 1;
swap(p[cur], p[rft[cur]]);
}
printf("%d\n", cnt);
forn(i,1,cnt) printf("%d %d\n", L[i], R[i]);
return 0;
} | #import<bits/stdc++.h>
#define endl '\n'
using namespace std;
struct H{int i,x;};
int i,j,k,m,n,u,v,a[200040],b[200040],p[200040],q[200040],x[200040],y[200040];
H w[200040];
int C(H a,H b){return a.x>b.x;}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(;i++<n;)cin>>a[i];
for(i=0;i++<n;)
{
cin>>b[i];
w[i-1]={i,b[i]};
}
for(i=0;i++<n;)
{
cin>>p[i];
q[p[i]]=i;
if(i^p[i]&&a[i]<=b[p[i]])
{
cout<<-1;
return 0;
}
}
sort(w,w+n,C);
for(i=0;i<n;i++)
{
v=w[i].i;
if(q[v]^v)
{
u=q[v];
swap(p[u],p[v]);
q[p[u]]=u;
q[p[v]]=v;
x[++k]=u;
y[k]=v;
}
}
cout<<k<<endl;
for(i=0;i++<k;)cout<<x[i]<<' '<<y[i]<<endl;
} |
#include <vector>
#include <iostream>
#define int long long
#define double long double
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
signed main() {
tezz
vector<int> primes;
for (int i = 2; i < 72; i++) {
bool flag = true;
for (int j = 2; j < i; j++) {
if (i % j == 0) flag = false;
}
if (flag) primes.emplace_back(i);
}
int A, B;
cin >> A >> B;
vector<int> v(B - A + 1);
for (int i = A; i <= B; i++) {
int mask = 0;
for (int j = 0; j < primes.size(); j++) {
if (i % primes[j] == 0) {
mask |= (1 << j);
}
}
v[i - A] = mask;
}
vector<int> dp(1<<primes.size());
dp[0] = 1;
for (int x: v) {
for (int mask = 0; mask < (1 << primes.size()); mask++) {
if (dp[mask]) {
int tmp = mask & x;
if (tmp == 0) dp[mask | x] += dp[mask];
}
}
}
int ans = 0;
for (int i = 0; i < (1 << primes.size()); i++) ans += dp[i];
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
//cout << setprecision(20) <<
int main() {
ll a, b; cin >> a >> b;
cout << (a + b) / 2 << " " << (a - b) / 2 << endl;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
int fib[10000000];
queue<int> st;
void solve(int n,int top)
{
if(!n)
return;
else
{
while(n<fib[top])
top--;
st.push(top);
solve(n-fib[top],top);
}
}
signed main()
{
cin>>n;
fib[1] = 1;
int i = 1;
while(fib[i] < n)
{
i++;
fib[i] = fib[i-1]+fib[i-2];
}
solve(n,i);
queue<int> ans;
int top = st.front();
st.pop();
ans.push(1);
int ans_at = 0;
while(st.size())
{
i = st.front();
while(top>i)
ans.push(2),top--,ans_at ^= 1;
ans.push(1);
st.pop();
}
while(top>1)
ans.push(2),top--,ans_at ^= 1;
cout<<ans.size()<<endl;
int now_at = ans_at^1;
while(!ans.empty())
{
if(ans.front()==1)
{
cout<<2-now_at<<endl;
}
else
{
cout<<3+now_at<<endl;
now_at ^=1;
}
ans.pop();
}
}
| #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define sz(li) (int) (li).size()
#define sum(a) (accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) (min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) (max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) (lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) (upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
#define vvl vector<vl>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpii vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define rep(i, a, b) for(int i = (a); i < (b); i++)
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) { cout << "[ "; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << " ]"; }
template<typename A> ostream& operator<<(ostream &cout, vector<vector<A>> const &v) { cout << "["; for (int i = 0; i < v.size(); i++) { if (i) { cout << " "; } cout << v[i]; if (i < v.size() - 1) { cout << endl; } } return cout << "]"; }
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; }
template<typename T, typename U> void cmin(T& a, U b){ if (a > b) a = b; }
template<typename T, typename U> void cmax(T& a, U b){ if (a < b) a = b; }
const int MX = 5e5 + 55;
void solve() {
int n; cin >> n;
bitset<MX> s, t; cin >> s >> t;
if (s.count() != t.count()) {
cout << -1 << endl;
} else {
deque<int> zero;
int ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 0) zero.push_back(i);
}
for (int i = 0; i < n; i++) {
if (t[i] == 0) {
ans += i != zero.front();
zero.pop_front();
}
}
cout << ans << endl;
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
cerr << "Time: " << 1000.0*clock()/CLOCKS_PER_SEC << " ms\n";
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector<int> sz;
vector<int> parent;
void make_set(int v) {
parent[v] = v;
sz[v] = 1;
}
int find_set(int v) {
if (v == parent[v])
return v;
else
{
auto par = find_set(parent[v]);
parent[v] = par;
return par;
}
}
void merge(int a, int b) {
find_set(a);
find_set(b);
a = find_set(a);
b = find_set(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
parent[b] = a;
sz[a] += sz[b];
};
}
int const MOD = 998244353;
int mul(int a, int b) {
return (a * 1LL * b) % MOD;
}
int add(int a, int b) {
int s = (a + b);
if (s >= MOD) s -= MOD;
return s;
}
int sub(int a, int b) {
int s = (a + MOD - b);
if (s >= MOD) s -= MOD;
return s;
}
ll fast_exp(ll base, ll exp) {
ll res = 1;
while (exp > 0) {
if (exp & 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp >>= 1;
}
return res;
}
int main() {
/*freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);*/
int n;
cin >> n;
parent.resize(n);
sz.resize(n);
for (int i = 0; i < n; i++) make_set(i);
vector<int> adjList(n);
for (int i = 0; i < n; i++) {
cin >> adjList[i];
adjList[i]--;
}
int cnt_cycles = 0;
for (int i = 0; i < n; i++) {
if (find_set(i) == find_set(adjList[i]))
cnt_cycles++;
else
merge(i, adjList[i]);
}
cout << sub(fast_exp(2, cnt_cycles), 1);
} | #include<bits/stdc++.h>
using namespace std;
int n, f;
bool used[200002];
vector<int> g[200002];
main(){
cin >> n;
int ans=1;
for(int i=0;i<n;i++)cin>>f,f--,g[i].push_back(f),g[f].push_back(i);
for(int i=0;i<n;i++){
if(used[i])continue;
queue<int>q;
q.push(i);
used[i]=1;
while(!q.empty()){
int v=q.front();
q.pop();
for(auto to:g[v])
if(!used[to])
q.push(to),used[to]=1;
}
ans=(ans+ans);
if(ans>=998244353)ans-=998244353;
}
ans+=998244352;
if(ans>998244353) ans-=998244353;
cout << ans;
} |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
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> T roundup(T a, T b){ return (a + b - 1) / b; }
const double PI = 3.14159265359;
const vector<int> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const vector<int> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};
using ll = long long;
struct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} };
const ll MOD = (ll)1e9 + 7;
const ll INF = (ll)1e9;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
long double sum = 0;
sum = nextafter(sum, INFINITY);
rep(i, 0, n){
long double v, p;
cin >> v >> p;
v = nextafter(v, INFINITY), p = nextafter(p, INFINITY);
p /= 100.0;
sum += v * p;
if(sum - x > 0.0000001){
cout << i + 1 << endl;
return 0;
}
}
cout << -1 << endl;
}
| //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#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, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
if ((tmp & ma0) ^ ma0) {
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
}
else {
tmp = tmp & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 8;
if ((ct = *ci++) >= '0') {
tmp = tmp * 10 + ct - '0';
if (*ci++ == '0') {
tmp = tmp * 10;
ci++;
}
}
}
return tmp;
}
const int MAX = 100000;
class shuturyoku_unko {
public:
char C[MAX * 5];
constexpr shuturyoku_unko() : C() {
rep(i, MAX) {
int X = i;
rep(j, 5) {
C[i * 5 + 4 - j] = '0' + X % 10;
X /= 10;
}
}
}
};
constexpr shuturyoku_unko f;
const int dm = 1 << 17;
char dn[dm], * di = dn, * owad = dn + dm - 20;
void putint(ll A) {
if (owad < di) {
fwrite(dn, 1, di - dn, stdout);
di = dn;
}
int dig = 1;
if (A >= 100000) {
if (A >= 1000000000) dig = 5;
else if (A >= 100000000) dig = 4;
else if (A >= 10000000) dig = 3;
else if (A >= 1000000) dig = 2;
memcpy(di + dig, f.C + A % 100000 * 5, 5);
A /= 100000;
memcpy(di, f.C + A * 5 + 5 - dig, dig);
di += 5 + dig;
}
else {
if (A >= 10000) dig = 5;
else if (A >= 1000) dig = 4;
else if (A >= 100) dig = 3;
else if (A >= 10) dig = 2;
memcpy(di, f.C + A * 5 + 5 - dig, dig);
di += dig;
}
*di++ = '\n';
}
const int mod = 1e9 + 7;
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int T = getint();
rep(t, T) {
ll N = getint(), A = getint(), B = getint();
ll a = min(A, N - B + 1);
ll b = min(A + B - 1, N - B + 1);
ll are = (a + b) * (b - a + 1) + b * (N - A + 1 - (b - a + 1) * 2);
ll atti = (N - A + 1) * (N - B + 1);
ll kotae = (atti + are) % mod * ((atti - are) % mod) % mod;
putint(kotae);
}
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
} |
// ＵＴＦ−８
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<double>;
/* #include<atcoder/all> */
/* using namespace atcoder; */
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 (a>b ? (a=b,1) : 0); }
template <typename T>
struct SegmentTree {
using F = function<T(T, T)>;
const T e;
const F f;
size_t sz;
vector<T> tree;
SegmentTree(size_t n, const F &f, const T &e = 0) : f(f), e(e) {
sz = 1;
while(sz < n) sz <<= 1;
tree.assign(2*sz, e);
}
void set(typename vector<T>::iterator begin, typename vector<T>::iterator end) {
copy(begin, end, tree.begin() + sz);
for(size_t k=sz-1; k>0; k--)
tree[k] = f(tree[2*k+0], tree[2*k+1]);
}
void update(size_t k, const T &x) {
k += sz;
tree[k] = x;
while(k >>= 1)
tree[k] = f(tree[2*k+0], tree[2*k+1]);
}
T query(size_t a, size_t b) const {
b = min(b, sz);
a = max((size_t)0, a);
T l = e, r = e;
for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if(a & 1) l = f(l, tree[a++]);
if(b & 1) r = f(tree[--b], r);
}
return f(l, r);
}
T operator[](const size_t k) const {
return tree[sz + k];
}
};
int main(void) {
constexpr ll MOD = 0 ? 1e9+7 : 998244353;
const double PI = acos(-1);
constexpr double eps = 1e-10;
cout << fixed << setprecision(32);
cin.tie(0); ios::sync_with_stdio(false);
if(1) {
ll n;
cin >> n;
vector<ll> a(n), b(n), c(n);
for(auto &e: a) cin >> e;
for(auto &e: b) cin >> e;
map<ll,vector<ll>> m;
for(ll i=0; i<n; i++)
m[a[i]+i].push_back(i);
map<ll,ll> idx;
for(ll i=0; i<n; i++) {
ll x = b[i]+i;
auto &v = m[x];
ll y = idx[x]++;
if(y == v.size()) {
cout << -1 << endl;
return 0;
}
c[i] = v[y];
}
ll r = 0;
SegmentTree<ll> st(n, [&](ll a, ll b){return a + b;}, 0);
for(ll i=0; i<n; i++) {
r += i - st.query(0, c[i]);
st.update(c[i], st[c[i]]+1);
}
cout << r << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
typedef long long ll;
typedef pair<int, int> pii;
#define mp(a, b) make_pair(a, b)
int n;
int a[maxn], b[maxn], c[maxn], d[maxn], p[maxn], tree[maxn];
bool cmpa(const int & i, const int & j)
{
return a[i] == a[j] ? i < j : a[i] < a[j];
}
bool cmpb(const int & i, const int & j)
{
return b[i] == b[j] ? i < j : b[i] < b[j];
}
inline int lowbit(int x) { return (x & (-x));}
ll sum(int x) { int ret = 0; for(int i = x; i < maxn; i += lowbit(i)) ret += tree[i]; return ret;}
void add(int x) { for(int i = x; i; i -= lowbit(i)) ++tree[i];}
ll invpair()
{
ll ret = 0;
for(int i = 1; i <= n; ++i)
{
ret += sum(p[i]);
add(p[i]);
}
return ret;
}
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]), a[i] += i, c[i] = i;
for(int i = 1; i <= n; ++i) scanf("%d", &b[i]), b[i] += i, d[i] = i;
sort(c + 1, c + n + 1, cmpa);
sort(d + 1, d + n + 1, cmpb);
for(int i = 1; i <= n; ++i)
if(a[c[i]] != b[d[i]])
{
puts("-1");
return 0;
}
for(int i = 1; i <= n; ++i) p[d[i]] = c[i];
printf("%lld\n", invpair());
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,a,b=0,c=0,p=1,ans=999999999999999999;
cin >> n;
while(p<=n){
a=n/p;
c=n%p;
ans=min(ans,a+b+c);
p*=2;
b++;
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
vector<string> vec_splitter(string s) {
for(char& c: s) c = c == ','? ' ': c;
stringstream ss; ss << s;
vector<string> res;
for(string z; ss >> z; res.push_back(z))
;
return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
if(idx > 0) cerr << ", ";
stringstream ss; ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, T...);
}
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __VA_ARGS__)
void localTest() {
#ifndef ONLINE_JUDGE
freopen("inp", "r", stdin);
freopen("out", "w", stdout);
#endif
}
void solver() {
ll inf = 2e18, ans = inf, n;
cin >> n;
for(ll i = 0; i <= 60; ++i) {
ll po = (1LL << i);
if(po > n) {
break;
}
ll c = n % po, a = (n - c) / po;
ans = min(ans, a + i + c);
}
cout << ans << "\n";
return;
}
int main() {
localTest();
fastio;
int t = 1;
// cin >> t;
while(t--) {
solver();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
if(f) return x;
return ~(--x);
}
il int read(char *s){
int len=0;
register char ch=getchar();
while(ch==' '||ch=='\n') ch=getchar();
while(ch!=' '&&ch!='\n'&&ch!=EOF) s[++len]=ch,ch=getchar();
return len;
}
il void write(const ll &x){if(x>9) write(x/10);putchar(x%10+'0');}
il void print(const ll &x) {x<0?putchar('-'),write(~(x-1)):write(x);putchar('\n');}
il ll max(const ll &a,const ll &b){return a>b?a:b;}
il ll min(const ll &a,const ll &b){return a<b?a:b;}
ll k,a,b,c,ans;
int main(){
k=read();
for(ri i=1;i<=k;++i){
for(ri j=1;i*j<=k;++j){
ans+=k/(i*j);
}
}
print(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define ld long double;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define RREP(i,n) for(int i=int(n)-1; i>=0; i--)
#define FOR(i,f,t) for(ll i=ll(f); i<=ll(t); i++)
#define RFOR(i,f,t) for(int i=int(f); i>=int(t); i--)
#define ALL(vec) (vec).begin(),(vec).end()
#define SORT(vec) sort(ALL(vec))
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define PB(vec) push_back(vec);
#define YES(ans) if(ans) cout<<"YES"<<endl; else cout<<"NO"<<endl;
#define Yes(ans) if(ans) cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define yes(ans) if(ans) cout<<"yes"<<endl; else cout<<"no"<<endl;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const double PI = 3.1415926535897932;
int main() {
int k, ans=0;
cin >> k;
FOR(a, 1, pow(k, 0.34)) {
FOR(b, a, pow(k, 0.50)) {
FOR(c, b, k) {
if( a*b*c<=k ) {
if( a==b && b==c ) ans = ans + 1;
else if( a==b || b==c || c==a ) ans = ans + 3;
else ans = ans + 6;
}
}
}
}
cout << ans << endl;
}
|
#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fori(i,init,end) for(ll i=init;i<end;i++)
/*
1. Create an empty list
2. Destroy a list
3. Determine whether a list is empty
4. Determine the number of items in a list
5. Traverse the list
6. Insert an item at a given position in the list
7. Delete the item at a given position in the list
8. Search for an item
9. Access the item at a given position in the list, etc
*/
void Solveit()
{
ll a,b;
cin>>a>>b;
if(abs(a-b)>2)
cout<<"No\n";
else
cout<<"Yes\n";
}
int main()
{
fastio;
ll t=1;
//cin>>t;
while(t--)
{
Solveit();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 2e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
void solve()
{
char c1,c2,c3;
cin>>c1>>c2>>c3;
if(c1==c2 && c2==c3) cout<<"Won"<<endl;
else cout<<"Lost"<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
//cin>>t;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
while(t--)
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0 ; i < n ; i++)
#define repl(i, n) for (ll i = 0 ; i < n ; i++)
#define Rep(i, n) for (int i = 1 ; i <= n ; i++)
#define Repl(i, n) for (ll i = 1 ; i <= n ; i++)
#define rep3(i, a, n) for (int i = a ; i < n ; i++)
#define pi 3.141592653589793238462643
int main() {
ios::sync_with_stdio(false);
ll x, y, a, b, ans = 0; cin >> x >> y >> a >> b;
while (x < (x + b) / a && x < y / a) {
x *= a;
ans++;
}
ans += ((y - x) / b);
if ((y - x) % b == 0) ans--;
cout << ans;
}
|
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T>
void print(T x) {
cout << x << "\n";
}
template <typename T>
void print(vector<T>& x) {
int N = x.size();
REP(i, N) {
if (i > 0) cout << " ";
cout << x[i];
}
cout << "\n";
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
string _s1, _s2, _s3; cin >> _s1 >> _s2 >> _s3;
vi s1, s2, s3;
for (auto &e: _s1) s1.eb(e - 'a');
for (auto &e: _s2) s2.eb(e - 'a');
for (auto &e: _s3) s3.eb(e - 'a');
vi cnt(26, 0);
for(auto &e: s1) cnt[e] = 1;
for(auto &e: s2) cnt[e] = 1;
for(auto &e: s3) cnt[e] = 1;
if(accumulate(ALL(cnt), 0) > 10) {
print("UNSOLVABLE");
return 0;
}
vi mid(26, -1);
int c = 0;
REP(i, 26) if(cnt[i]) mid[i] = c++;
vi e = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
do {
bool f = true;
ll v1 = 0;
REP(i, s1.size()) {
int id = mid[s1[i]];
int v = e[id];
if (i == 0 && v == 0) {
f = false;
break;
}
v1 *= 10;
v1 += v;
}
if (not f) continue;
ll v2 = 0;
REP(i, s2.size()) {
int id = mid[s2[i]];
int v = e[id];
if (i == 0 && v == 0) {
f = false;
break;
}
v2 *= 10;
v2 += v;
}
if (not f) continue;
ll v3 = 0;
REP(i, s3.size()) {
int id = mid[s3[i]];
int v = e[id];
if (i == 0 && v == 0) {
f = false;
break;
}
v3 *= 10;
v3 += v;
}
if (not f) continue;
if (v1 + v2 == v3) {
print(v1);
print(v2);
print(v3);
return 0;
}
} while(next_permutation(ALL(e)));
print("UNSOLVABLE");
}
|
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long power(long long a, long long b,long long mod) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a %mod;
a = a * a %mod;
b >>= 1;
}
return res;
}
int pre[2005];
int ans[2005][2005];
const int mod=1e9+7;
int pp[4000005];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
pp[0]=1;
for(int i=1;i<=4000000;i++)
pp[i]=pp[i-1]*2%mod;
int n,m;
cin>>n>>m;
string a[n+1];
for(int i=1;i<=n;i++)
{
cin>>a[i];
a[i]="#"+a[i];
}
int fi=0;
for(int i=1;i<=n;i++)
{
int x=0;
for(int j=1;j<=m;j++)
{
if(a[i][j]=='.')
fi++;
if(a[i][j]=='.')
x++;
else
x=0;
ans[i][j]+=x;
}
x=0;
for(int j=m;j>=1;j--)
{
if(a[i][j]=='.')
x++;
else
x=0;
ans[i][j]+=x;
if(a[i][j]=='.')
ans[i][j]--;
}
}
for(int i=1;i<=m;i++)
{
int x=0;
for(int j=1;j<=n;j++)
{
if(a[j][i]=='.')
x++;
else
x=0;
ans[j][i]+=x;
if(a[j][i]=='.')
ans[j][i]--;
}
x=0;
for(int j=n;j>=1;j--)
{
if(a[j][i]=='.')
x++;
else
x=0;
ans[j][i]+=x;
if(a[j][i]=='.')
ans[j][i]--;
}
}
int tot=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(ans[i][j])
{
int z=pp[ans[i][j]]-1+mod;
z%=mod;
z=(z*pp[(fi-ans[i][j])])%mod;
tot+=z;
tot%=mod;
}
}
}
cout<<tot;
} | #include <stdio.h>
#include <vector>
using namespace std;
const long long mod = 998244353;
vector<long long> mem(2,1);
long long sol(int a) {
return mem[a];
}
long long pow(long long a, long long b) {
long long ans = 1;
long long base = a;
while (b) {
if (b%2) ans = ans * base % mod;
base = base * base % mod;
b/=2;
}
return ans;
}
long long inv(long long a) {
return pow(a, mod - 2);
}
long long Comb(int a, int b) {
long long ans = sol(b);//printf("%d %d\n", a, b);
ans *= inv(sol(a));
ans %= mod;
ans *= inv(sol(b-a));
ans %= mod;
return ans;
}
int main()
{
int n,m;
scanf("%d%d", &n, &m);
vector<int> primes(m+1, 0);
for (int i=2 ;i<=m; ++i) {
if (primes[i] == 0) {
for (int j=i; j<=m; j+=i) {
if (primes[j] == 0) {
primes[j] = i;
}
}
}
}
for (int i=2; i<=n+100; ++i) {
mem.push_back(i*mem[i-1]%mod);
}
long long ans = 0;
for (int i=1; i<=m; ++i) {
long long tmp = 1;
int x = i;
while (x > 1) {
int q = 0;
int prime = primes[x];
while (x%prime == 0) {
q++;
x/=prime;
}
tmp *= Comb(n-1, n-1+q);
tmp %= mod;
}
ans = (ans + tmp) % mod;
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P &p) const {
return v > p.v;
}
int v, k;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<array<int, 2>> v(n), u(n);
for (int i = n; --i >= 0;) {
cin >> v[i][0];
}
for (int i = 0; i < n; i++) {
cin >> v[i][1];
}
vector<P> p(n * 2);
for (int i = 0; i < n; i++) {
for (int h = 0; h < 2; h++) {
p[i * 2 + h] = { v[i][h], i * 2 + h };
}
}
sort(p.begin(), p.end());
for (int j = 0; j < n; j++) {
int k = p[j].k;
int i = k / 2, h = k % 2;
u[i][h] = 1;
}
priority_queue<int, vector<int>, greater<>> pq;
for (int i = 0; i < n; i++) {
pq.push(v[i][0]);
pq.push(v[i][1]);
while ((int)pq.size() > i + 1) {
pq.pop();
}
//u[i][v[i][0] > v[i][1]] = 0;
//x--;
//while (1) {
// int k = p[j++].k;
// int i1 = k / 2, h1 = k % 2;
// if (i1 > i && u[i1][h1] == 0) {
// u[i1][h1] = 1;
// break;
// }
//}
}
ll r = 0;
while (!pq.empty()) {
r += pq.top();
pq.pop();
}
//for (int i = 0; i < n; i++) {
// for (int h = 0; h < 2; h++) {
// r += u[i][h] * v[i][h];
// }
//}
cout << r << endl;
//真ん中で分けて、片側だけを取ることはできる
//というか、2列にN個並んでてN回好きな側を取れる
//ただ、それよりもいい戦略は普通にあるので
//高橋君がどこか選ぶと歯抜けになるよね 青木君が取るときは端から
//点数差で考えるか？
//底のを取り合うなら大きいほうを当然取る それよりいい手とは？
//底のどちらかは取られてしまう 下のほうの半分は取られてしまう
//選んだ場所がどこで切ってもそこから下の半分以下なら取れる？
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
signed main(){
int n;cin>>n;
vector<int> v(n*2);
REP(i,n*2)cin>>v[i];
int sum=0;
for(int p:v)sum+=p;
priority_queue<int,vector<int>,greater<int>> que;
REP(i,n){
que.push(v[n-1-i]);
que.push(v[n+i]);
sum-=que.top();que.pop();
}
cout<<sum<<endl;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include <chrono>
/* #include <atcoder/all> */
/* using namespace atcoder; */
using namespace std;
void debug_out(){ cout << "\n"; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = 1000000007;
/* const ll MOD = 998244353; */
const ll INF = 1ll<<60;
const double PI = acos(-1);
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N;
cin >> N;
vector<vector<int>> C(N, vector<int>(N));
REP(i, N) REP(j, N) cin >> C[i][j];
int MIN = C[0][0];
REP(i, N){
chmin(MIN, C[i][0]);
}
vector<int> A(N);
REP(i, N){
A[i] = C[i][0]-MIN;
}
vector<int> B(N);
REP(i, N){
B[i] = C[0][i]-A[0];
}
if(!all_of(ALL(B), [](int x){ return x >= 0; }) || !all_of(ALL(B), [](int x){ return x >= 0; })){
No;
return 0;
}
REP(i, N) REP(j, N){
if(C[i][j] != A[i]+B[j]){
No;
return 0;
}
}
Yes;
REP(i, A.size()){
cout << A[i]; SPBR(i, A.size());
}
REP(i, B.size()){
cout << B[i]; SPBR(i, B.size());
}
return 0;
}
| #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 509
#define mod 998244353
#define f first
#define s second
#define pa pair<ll,ll>
ll arr[sz][sz],brr[sz],crr[sz];
std::vector<pa> v;
int main()
{
/// ios_base::sync_with_stdio(0);cin.tie(0);
int test_case=1;
// scanf("%d",&test_case);
while(test_case--)
{
ll n,m,a=0,b=0;
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%lld",&arr[i][j]);
if(j>1 && i>1 && (arr[i][j]+arr[i-1][j-1])!=(arr[i-1][j]+arr[i][j-1]))
a++;
}
}
if(a)
{
printf("No\n");
return 0;
}
brr[1]=0;
ll mn=0;
for(int i=2;i<=n;i++)
{
brr[i]=brr[i-1]+arr[i][1]-arr[i-1][1];
mn=min(mn,brr[i]);
}
for(int i=1;i<=n;i++)
{
brr[i]-=mn;
crr[i]=arr[1][i]-brr[1];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(brr[i]<0 || crr[j]<0 || (brr[i]+crr[j])!=arr[i][j])
{
printf("No\n");
return 0;
}
}
}
printf("Yes\n");
for(int i=1;i<=n;i++)
printf("%lld ", brr[i]);
printf("\n");
for(int i=1;i<=n;i++)
printf("%lld ",crr[i]);
printf("\n");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll combination(int n, int k) {
ll answer = 1;
for (int i = 1; i <= k; i++) {
answer *= n--;
answer /= i;
}
return answer;
}
// write your code here!
int main() {
double n;
cin >> n;
ll price = n * 1.08;
if (price < 206)
cout << "Yay!" << endl;
else if (price > 206)
cout << ":(" << endl;
else
cout << "so-so" << endl;
}
| /*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define in insert
#define rev reverse
#define all(x) (x).begin(),(x).end()
#define all2(x) (x).rbegin(),(x).rend()
#define sz(v) (int)v.size()
#define yes cout << "YES\n"
#define no cout << "NO\n";
#define take for(auto &it : a) cin >> it;
#define vi vector<int>
#define vii vector<pair<int, int > >
#define vl vector<ll>
#define fi first
#define se second
#define l_b lower_bound
#define u_b upper_bound
#define ed printf("\n")
#define mems(a, b) memset(a, b, sizeof(a))
#define ios ios_base::sync_with_stdio(0);cin.tie();cout.tie();
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void read(T &x) { cin >> x; }
template<class T, class ...U> void read(T &x, U& ... u) { read(x); read(u...); }
template<class T> void print1(const T &x) { cout << x << '\n'; }
template<class T, class ...U> void print1(const T &x, const U& ... u) { print1(x); print1(u...); }
template<class T> void print2(const T &x) { cout << x << ' '; }
template<class T, class ...U> void print2(const T &x, const U& ... u) { print2(x); print2(u...); }
const int N = 2e5 + 5, mod = 1e9 + 7, M = 5e5 + 5;
const ll inf = 9e18;
int cs = 1;
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second);
}
void solve() {
int n;
read(n);
int cost = 1.08 * n;
n = cost;
if(n == 206) print1("so-so");
else if(n < 206) print1("Yay!");
else print1(":(");
}
int main() {
ios;
/*int tc;
read(tc);
while(tc--> 0)*/
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define ci(x) cin >> x
#define ci2(x, y) cin >> x >> y
#define ci3(x, y, z) cin >> x >> y >> z
#define ci4(w, x, y, z) cin >> w >> x >> y >> z
#define co(x) cout << x << endl
#define co2(x, y) cout << x << " " << y << endl
#define co3(x, y, z) cout << x << " " << y << " " << z << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> PQ;
typedef priority_queue<int, vector<int>, greater<int>> PQG;
typedef priority_queue<P> PQP;
typedef priority_queue<P, vector<P>, greater<P>> PQPG;
const int MAX_N = 2e5, MOD = 1e9 + 7, INF = 1e9;
int n;
ll a[3000], sum[3001], dp[3001][3001];
int main() {
ci(n);
rep(i, n) ci(a[i]);
rep(i, n) sum[i + 1] = sum[i] + a[i];
dp[0][0] = 1;
rep(i, n) {
vector<int> v[i + 1];
rep(j, n + 1) v[sum[j] % (i + 1)].epb(j);
rep(j, i + 1) {
ll s = 0;
rep(k, v[j].size() - 1) {
s = (s + dp[v[j][k]][i]) % MOD;
dp[v[j][k + 1]][i + 1] = (dp[v[j][k + 1]][i + 1] + s) % MOD;
}
}
}
int ans = 0;
rep(i, n) ans = (ans + dp[n][i + 1]) % MOD;
co(ans);
return 0;
}
| //ulala
//code by 255
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pll pair<ll, ll>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> yree;
const ll inf = 0x3fff3fff3fff3fff;
const ll N = 3003;
const ll M = 1e9+7;
ll a[N];
ll dp[N][N];
map<ll, ll> ddp;
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
memset(dp, 255, sizeof dp);
ll n;
cin >> n;
for(ll i = 0;i<n;i++){
cin >> a[i];
}
for(ll i = 0;i<n;i++){
dp[1][i]=1;
}
ll res=1;
for(ll kk=2;kk<=n;kk++){
ddp.clear();
ll ec=0;
for(ll i = 0;i<n;i++){
ec=(ec+a[i])%kk;
if(ddp.count(ec)) dp[kk][i]=ddp[ec];
if(dp[kk-1][i]!=-1) ddp[ec]+=dp[kk-1][i], ddp[ec]%=M;
}
if(dp[kk][n-1]!=-1) res+=dp[kk][n-1], res%=M;
}
cout<<res;
} |
// FIRST THINK THEN CODE.
#include<iostream>
#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 ld long double
#define pll pair<ll,ll>
#define cld complex<ld>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vld vector<ld>
#define vvld vector<vector<ld>>
#define vpll vector<pll>
#define vcld vector<cld>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define PI acos(-1)
#define endl "\n"
#define fix(f,n) fixed<<setprecision(n)<<f
#define all(x) x.begin(),x.end()
#define rev(p) reverse(p.begin(),p.end());
#define mset(a,val) memset(a,val,sizeof(a));
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define popcount(x) __builtin_popcountll(x)
#define sz(x) ((ll)x.size())
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORR(i,a,b) for(ll i=a;i>=b;i--)
const ll M = 1000000007;
const ll MM = 998244353;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<pll, null_type,less<>, rb_tree_tag,tree_order_statistics_node_update>
ll begtime = clock();
#define end_routine() cerr << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
template<typename T, typename F>
void chmax( T &a, F b) {
if (b > a)a = b;
}
template<typename T, typename F>
void chmin( T &a, F b) {
if (b < a)a = b;
}
const ll N = 2e5 + 5;
vpll arr[N];
vl self(N, 1e9);
ll dji(ll node) {
vl vis(2005);
vis[node] = 1;
vl dis(2005, 1e18);
set<pll>s;
dis[node] = 0;
ll flag = 0;
s.insert({dis[node], node});
while (sz(s)) {
auto f = *s.begin();
auto n1 = f.ss;
s.erase(s.begin());
for (auto to : arr[n1]) {
ll child = to.ff, d = to.ss;
if (child == node) {
if (!dis[node]) {
dis[node] = 1e9;
}
}
if (dis[child] > dis[n1] + d) {
s.erase({dis[child], child});
dis[child] = dis[n1] + d;
s.insert({dis[child], child});
}
}
}
if (!dis[node])dis[node] = 1e9;
chmin(dis[node], self[node]);
if (dis[node] == 1e9)dis[node] = -1;
return dis[node];
}
void OJ() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
}
int main() {
IOS;
OJ();
ll n; cin >> n;
ll m; cin >> m;
for (ll i = 1; i <= m; i++) {
ll x, y, d;
cin >> x >> y >> d;
if (x == y) {
chmin(self[x], d);
} else {
arr[x].pb({y, d});
}
}
for (ll i = 1; i <= n; i++) {
cout << dji(i) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
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; }
// dijkstra 蟻本
struct edge {ll to, cost;};
typedef pair<ll, ll> P; // firstはsからの最短距離, secondは頂点の番号
const ll INF = 1e17;
const int max_n = 101010;
int n;
vector<edge> g[max_n];
void dijkstra(ll s, vector<ll> &d){
priority_queue<P,vector<P>,greater<P> > que;
que.push(P(0, s));
while(!que.empty()){
P p = que.top();
que.pop();
ll v = p.second;
if(d[v] < p.first) continue; //後から最短パスが見つかった場合、先にqueに入っているものはここではじかれる
for(ll i = 0; i < g[v].size(); i++){
edge e = g[v][i];
if(d[e.to] > p.first + e.cost){
d[e.to] = p.first + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
rep(i, m){
int a, b;
ll c;
cin >> a >> b >> c;
a--; b--;
g[a].push_back({b, c});
}
vector<vector<ll>> dist(n, vector<ll>(n, INF));
rep(i, n) dijkstra(i, dist[i]);
rep(i, n) cout << (dist[i][i] == INF ? -1 : dist[i][i]) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fio() cin.tie(nullptr);ios::sync_with_stdio(false);
#define DEBUG_CTN(v) cerr<<#v<<":";for(auto itr=v.begin();itr!=v.end();itr++) cerr<<" "<<*itr; cerr<<endl
template<class T> bool chmax(T &a, const T &b) {if (a<b) { a = b; return true; } return 0;}
template<class T> bool chmin(T &a, const T &b) {if (a>b) { a = b; return true; } return 0;}
template<class T> void print(const T &t) { cout << t << "\n"; }
const ll INF = 1LL << 60;
ll a, b, ans;
int main() {
fio(); cin>>a>>b;
if(a+b>=15 and b>=8) print(1);
else if(a+b>=10 and b>=3) print(2);
else if(a+b>=3) print(3);
else print(4);
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A+B >= 15 && B >= 8) {
cout << 1;
}
else if (A+B >= 10 && B >= 3)
{
cout << 2;
}
else if (A+B >= 3)
{
cout << 3;
}
else {
cout << 4;
}
} |
#include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) for (int temp = init_val; temp >= end_val; --temp)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> intpair;
int read(){
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9'){if(c == '-') f = -f; c = getchar();}
while (c >= '0' && c <= '9')x = x * 10 + c - '0', c = getchar();
return f * x;
}
inline int lowbit(int x){
return x & (-x);
}
inline int modadd(int x, int y){
return (x + y >= MOD ? x + y - MOD: x + y);
}
inline int sgn(int x){
return (x < 0 ? -1: (x > 0 ? 1: 0));
}
template<typename T>
T gcd(T a, T b){
return (!b) ? a: gcd(b, a % b);
}
int poww(int a, int b){
int res = 1;
while (b > 0){
if (b & 1) res = 1ll * res * a % MOD;
a = 1ll * a * a % MOD, b >>= 1;
}
return res;
}
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
const int ddx[] = {-1, -1, -1, 0, 0, 1, 1, 1}, ddy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
/*--------------------------------------------------------------------*/
/*--------------------------------------------------------------------*/
int n;
double x[105], y[105];
int fa[105], siz[105];
int Find(int x){
return (x == fa[x] ? x: (fa[x] = Find(fa[x])));
}
void Union(int x, int y){
x = Find(x), y = Find(y);
if(x ==y) return;
if (siz[x] > siz[y]) fa[y] = x, siz[x] += siz[y];
else fa[x] = y, siz[y] += siz[x];
}
void init(){
scanf("%d", &n);
REP(i, 1,n) scanf("%lf%lf", &x[i], &y[i]);
}
bool check(double r){
REP(i, 1, n + 2) fa[i] = i, siz[i] = 1;
REP(i, 1, n) if (100.0 - y[i] <= r) Union(n + 1, i);
REP(i, 1, n) if (y[i] + 100.0 <= r) Union(n + 2, i);
REP(i, 1, n)
REP(j, i + 1, n)
if (hypot(x[i] - x[j], y[i] - y[j]) <= r)
Union(i, j);
return Find(n + 1) == Find(n + 2);
}
void solve(){
double l = 0, r = 200;
REP(T, 1, 100){
double mid = (r + l) * 0.5;
if (check(mid)) r = mid;
else l = mid;
}
printf("%.10lf\n", l * 0.5);
}
int main(){
int T = 1;
while (T--){
init();
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define sec second
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
if(nega==-1) return -ans;
return ans;
}
typedef pair<int,int> pii;
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
inline int add(int x,int y) {return x+y>=mod?x+y-mod:x+y;}
inline int add(int x,int y,int z) {return add(add(x,y),z);}
inline int sub(int x,int y) {return x-y<0?x-y+mod:x-y;}
inline int mul(int x,int y) {return 1LL*x*y%mod;}
inline int mul(int x,int y,int z) {return mul(mul(x,y),z);}
int qpow(int x,int y)
{
int ans=1;
while(y)
{
if(y&1) ans=mul(ans,x);
x=mul(x,x);
y>>=1;
}
return ans;
}
int Inv(int x){return qpow(x,mod-2);}
#define N 200005
int a[N],vis[N],n;
int fa[N];
int find(int u) {return fa[u]==u?u:fa[u]=find(fa[u]);}
signed main()
{
int n=read();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<=n;i++) fa[find(i)]=find(a[i]);
int cnt=0;
for(int i=1;i<=n;i++) if(find(i)==i) cnt++;
cout<<qpow(2,cnt)-1<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n;
cin>>n;
int ar[n+5],mark[n+5]={0};
for(int i=0;i<n;i++){
cin>>ar[i];
mark[ar[i]]=1;
}
for(int i=1;i<=n;i++){
if(!mark[i]){
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int inint(istream& in) {int x; in >> x; return x;}
inline ll inll(istream& in) {ll x; in >> x; return x;}
inline string instr(istream& in) {string x; in >> x; return x;}
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
class BPermutationCheck {
public:
void solve(std::istream& in, std::ostream& out) {
int N = inint(in);
vector<int> a(N, 0);
for (int i = 0; i < N; ++i) {
int temp = inint(in) - 1;
a[temp] = 1;
}
int ok = 1;
for(int i: a){
if(i == 0)ok = 0;
}
if(ok == 1){
out << "Yes" << endl;
}else{
out << "No" << endl;
}
}
};
int main() {
BPermutationCheck solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define setbits(x) __builtin_popcountll(x)
#define leadzero(x) __builtin_clz(x)
#define trailzero(x) __builtin_ctz(x)
#define mod 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag ,
tree_order_statistics_node_update> ;
//find_by_order(index) -> value at the index // order_of_key(val) -> gives index of the key
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define int ll
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define popb pop_back
#define endl '\n'
#define all(v) v.begin(), v.end()
#define sz(x) ((int)((x).size()))
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
typedef pair<pii, int> ppi;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
ll power(ll a, ll b) {
if(b<0) return 1;
ll res=1;
while(b) {
if(b&1)
res = (res*a);//%mod;
a = (a*a);//%mod;
b >>= 1;
}
return res;
}
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
bool ispoweroftwo(ll x){ return (x&&!(x&(x-1)));}
ll GCD(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
ll LCM(ll a, ll b) {return a / GCD(a, b) * b;}
const int inf = 1e9;
const ll INF = 1e18;
const ld pi = 3.141592653589793238;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
char MV[] = {'U', 'R', 'D', 'L'};
//integer to char always remember (char+'0')
//----------------------------------------------------------------------------------------
void solve() {
int v, t, s, d; cin >> v >> t >> s >> d;
t *= v;
s *= v;
if(t <= d && d <= s) {
cout << "No";
} else {
cout << "Yes";
}
}
int32_t main() {
FIO;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define bug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int inf = 1e18;
const int mod = 1e9+7;
const int mod1 = 998244353;
int h, w, a, b, ans;
int grid[19][19];
void check()
{
for(int i = 1; i <= h; i++)
for(int j = 1; j <= w; j++)
if(grid[i][j] == 0)
return;
ans++;
}
void calc(int y, int x, int A, int B)
{
if(y > h || x > w || A < 0 || B < 0)
return;
if(y == h && x == w)
{
if(!grid[y][x])
B--;
grid[y][x] = 1;
check();
grid[y][x] = 0;
return;
}
if(grid[y][x])
{
if(x == w)
calc(y + 1, 1, A, B);
else
calc(y, x + 1, A, B);
return;
}
if(x != w && !grid[y][x + 1])
{
grid[y][x] = 2;
grid[y][x + 1] = 2;
calc(y, x + 1, A - 1, B);
grid[y][x] = 0;
grid[y][x + 1] = 0;
}
if(y != h && !grid[y + 1][x])
{
grid[y][x] = 3;
grid[y + 1][x] = 3;
if(x == w)
calc(y + 1, 1, A - 1, B);
else
calc(y, x + 1, A - 1, B);
grid[y][x] = 0;
grid[y + 1][x] = 0;
}
//cerr<<y<<" "<<x<<" "<<grid[y][x]<<END;
grid[y][x] = 1;
if(x == w)
calc(y + 1, 1, A, B - 1);
else
calc(y, x + 1, A, B - 1);
grid[y][x] = 0;
}
void solve()
{
cin>>h>>w>>a>>b;
ans = 0;
calc(1, 1, a, b);
cout<<ans;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin>>t;
while(t--)
solve();
//cerr<<END<<1.0*clock()/CLOCKS_PER_SEC;
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef set<int> si;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define fi first
#define se second
#define pi 3.141592653589793
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define pqmax priority_queue<int>
#define pqmin priority_queue<int,vi,greater<int>>
#define fio ios_base::sync_with_stdio(0), cin.tie(NULL)
#define tc int tt;cin>>tt;for(int ti=1;ti<=tt;ti++)
#define case_g "Case #"<<ti<<": "
#define RED "\033[31m"
#define GREEN "\033[32m"
#define RESET "\033[0m"
#define sleep for (int i = 1, a;i < 100000000;i++, a = a * a)
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> ranked_pairset;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ranked_set;
typedef tree<int, int, less<int>, rb_tree_tag, tree_order_statistics_node_update> ranked_map;
int main() {
fio;
string s;
cin >> s;
int ans = 0;
for (int i = 0;i < 9;i++)
if (s.substr(i, 4) == "ZONe")
ans++;
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i <= 100000; i *= 10) {
bool flag = false;
for (long long j = i; j < i * 10; j++) {
if (j * (i * 10) + j > N) {
flag = true;
break;
}
++ans;
}
if (flag) {
break;
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip> //do setprecision
#include <ctime>
#include <complex>
using namespace std;
#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int,int>
#define pll pair<LL,LL>
#define vi vector<int>
#define vl vector<LL>
#define vii vector<vi>
#define vll vector<vl>
const double pi = 3.14159265358979323846264;
const int mod=1000000007;
//mod演算ライブラリ
//mod=1000000007
LL add(LL a,LL b){
return (a+b)%mod;
}
LL sub(LL a,LL b){
return (a+mod-b)%mod;
}
LL mul(LL a,LL b){
return ((a % mod) * (b % mod)) % mod;
}
LL power(LL x,LL y){//繰り返し二乗法 単品利用可
if(y==0)return 1;
else if(y==1)return x%mod;
else if(y%2==0){
LL tmp=power(x, y/2) % mod;
return tmp*tmp%mod;
}else {
LL tmp=power(x, y/2) % mod;
return ((tmp*tmp)%mod)*x%mod;
}
}
LL dvs(LL a,LL b){
return mul(a,power(b,mod-2));
}
const int SIZE_mod=200005;
int invfact[SIZE_mod];
int fact[SIZE_mod];
void factset(int a){//aまでの階乗%mod表を作成
fact[0]=1;
FORQ(i,1,a){
fact[i]=mul(fact[i-1],i);
}
}
void cmbset(int a){//1~aまでの階乗と階乗数の逆元のmod(mod)を用意 O(a)
factset(a);
invfact[a]=power(fact[a],mod-2);
invfact[0]=1;
FORD(i,a,1){
invfact[i]=mul(invfact[i+1],i+1);
}
}
LL cmb(int n,int r){//nCr%mod (cmbset後に使用)
if(n<r||r<0||n<0)return 0;
return mul(fact[n],mul(invfact[r],invfact[n-r]));
}
LL prm(int n,int r){//nPr%mod
return mul(cmb(n,r),fact[n]);
}
LL homo(int n,int r){//nHr%mod
return cmb(n+r-1,r);
}
int main(){
int tt;
cin>>tt;
FOR(ti,0,tt){
LL n,a,b;
cin>>n>>a>>b;
if(b>a)swap(a,b);
LL all=mul(mul(n-a+1,n-a+1),mul(n-b+1,n-b+1));
LL ta=n-a+1,tb=n-b+1;
LL tt1=max(n-a-b+1,0LL);
LL tt2=sub(mul(ta,tb),mul((tt1+1),tt1));
LL rate=dvs(tt2,mul(ta,tb));
LL t=mul(all,mul(rate,rate));
cerr<<tt1<<" "<<tt2<<" "<<rate<<" "<<t<<endl;
cout<<sub(all,t)<<endl;
}
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
set<pair<ll, ll>> st;
auto consider = [&](ll div) {
ll b = (2 * n / div + div - 1) / 2;
ll a = 2 * n / div - b;
ll tmp = (b - a + 1) * (b + a);
if (tmp == 2 * n) {
st.insert({min(a, b), max(a, b)});
}
};
for (ll i = 1; i * i <= 2 * n; ++i) {
if ((2 * n) % i == 0) {
consider(i);
consider(2 * n / i);
}
}
cout << st.size() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
#ifdef DEBUG
#define debug(args...) _debug(args)
void _debug(const char* format, ...) {
va_list args;
va_start(args, format);
vprintf(format, args);
va_end(args);
}
#else
#define debug(args...)
#endif
#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 1000005
int l, r;
bool isp[MAXN];
int sp[MAXN];
vi primes;
ll ans;
int main() {
scanf("%d%d", &l, &r);
REP (i, 2, MAXN) isp[i] = 1;
for (int i = 2; (ll) i * i <= r; i++) {
if (!isp[i]) continue;
sp[i] = i;
for (int j = i * i; j <= r; j += i) {
if (isp[j]) sp[j] = i;
isp[j] = 0;
}
}
REP (i, 2, r + 1) {
if (isp[i]) {
sp[i] = i;
primes.pb(i);
}
}
REP (i, 2, r + 1) {
int u = i;
int cnt = 0;
int prv = -1;
bool pos = 1;
while (u != 1) {
cnt++;
if (prv == sp[u]) {
pos = 0;
}
prv = sp[u];
u /= sp[u];
}
if (!pos) continue;
int lo = (l - 1) / i, hi = r / i;
ll len = hi - lo;
//debug("%d: %lld\n", i, len);
if (cnt % 2 == 1) {
//debug(" +\n");
ans += len * (len - 1);
} else {
//debug(" -\n");
ans -= len * (len - 1);
}
}
//debug("%d\n", ans);
REP (i, max(l, 2), r + 1) {
int lo = (l - 1) / i, hi = r / i;
ll len = hi - lo;
ans -= (len - 1) * 2;
//debug("%d: %d\n", i, len);
}
printf("%lld\n", ans);
return 0;
}
| // PIGMEISTER™ //
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define sidha(i,x,n) for(int i=(int)(x);i<(int)(n);++i)
#define ulta(i,x,n) for(int i=(int)(x);i>=(int)(n);--i)
#define sab(a) a.begin(),a.end()
#define bas(a) a.rbegin(),a.rend()
#define test int _;cin>>_;while(_--)
#define jaldi ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
//#define MAX 100005
#define PI (ld)3.141592653589793238
#define MOD LLONG_MAX
//#define MOD (ll)1000000007
//#define MOD (ll)998244353
#define N 1000001
int lpf[N], mobius[N], a[N], fre[N];
void least_prime_factor()
{
for (int i = 2; i < N; i++)
if (!lpf[i])
for (int j = i; j < N; j += i)
if (!lpf[j])
lpf[j] = i;
}
void Mobius()
{
for (int i = 1; i < N; i++) {
if (i == 1)
mobius[i] = 1;
else {
if (lpf[i / lpf[i]] == lpf[i])
mobius[i] = 0;
else
mobius[i] = (int)-1 * mobius[i / lpf[i]];
}
}
}
int gcd_pairs(int n)
{
int maxi = 0;
for (int i = 0; i < n; i++) {
fre[a[i]]++;
maxi = max(a[i], maxi);
}
least_prime_factor();
Mobius();
int ans = 0;
for (int i = 1; i <= maxi; i++) {
if (!mobius[i])
continue;
int temp = 0;
for (int j = i; j <= maxi; j += i)
temp += fre[j];
ans += temp * (temp - 1ll) / 2ll * mobius[i];
}
return ans;
}
signed main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
jaldi;
int l, r;
cin >> l >> r;
int n = r-l+1;
int ans = 0;
sidha (i, 0, n) {
a[i] = i+l;
if (i+l == 1) continue;
int cnt = r/(i+l);
ans += 2*(cnt-1);
}
ans += 2 * gcd_pairs(n);
// ulta (i, r-l, 2) {
// ll mn = max(1ll, (l-1)/i);
// ll mx = r/i;
// // cout << i << ' ' << mx << ' ' << mn << '\n';
// ans += (mx-mn)*(mx-mn-1);
// }
cout << n*(n-1) - ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
ll nextLong() { ll x; scanf("%lld", &x); return x;}
struct Edge {
int a, b;
char dir;
};
vector<Edge> es;
vector<vector<int>> g;
vector<int> c;
vector<int> ei;
void dfs(int v) {
while (ei[v] < (int)g[v].size()) {
int i = g[v][ei[v]++];
if (es[i].dir != '-') continue;
int u = v ^ es[i].a ^ es[i].b;
if (u == es[i].b)
es[i].dir = '>';
else
es[i].dir = '<';
dfs(u);
}
}
int main2() {
int N = nextLong();
int M = nextLong();
g.clear();
g = vector<vector<int>>(N);
REP(i, M) {
int a = nextLong() - 1;
int b = nextLong() - 1;
es.push_back((Edge){a, b, '-'});
g[a].push_back(i);
g[b].push_back(i);
}
c = vector<int>(N);
REP(i, N) c[i] = nextLong();
REP(i, M) {
int a = es[i].a;
int b = es[i].b;
if (c[a] < c[b]) { es[i].dir = '<'; }
if (c[a] > c[b]) { es[i].dir = '>'; }
}
ei = vector<int>(N);
REP(i, N)
dfs(i);
REP(i, M) {
if (es[i].dir == '<') cout << "<-" << endl;
else if (es[i].dir == '>') cout << "->" << endl;
else throw 42;
}
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ld sx, sy, gx, gy; cin>>sx>>sy>>gx>>gy;
cout<<setprecision(12)<<sx+sy/(sy+gy)*(gx-sx)<<endl;
return 0;
} |
// Created at 2021/01/30 20:53
// {TODO}WA, {TODO}min, {TODO}diff
// goal: {TODO}min
#include <bits/stdc++.h>
//#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (lint i = 0, i##_len = n; i < i##_len; i++)
#define rep2(i, n) for (lint i = 1, i##_len = n; i <= i##_len; i++)
#define rep3(i, s, e) for (lint i = s, i##_len = e; i < i##_len; i++)
#define all(i) (i).begin(), (i).end()
#define print(s) cout << s << "\n";
#define print2(s1, s2) cout << s1 << " " << s2 << "\n";
#define mk_p make_pair
using namespace std;
//using namespace atcoder;
using lint = long long;
using pi = pair<int, int>;
using pl = pair<lint, lint>;
using vi = vector<int>;
using vl = vector<lint>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using qi = queue<int>;
using ql = queue<lint>;
constexpr int INF = 1 << 30;
constexpr lint INFl = 1LL << 62;
template<class T, class U>
istream &operator>>(istream &is, pair <T, U> &pair) {
is >> pair.first >> pair.second;
return is;
}
template<class T, class U>
ostream &operator<<(ostream &os, pair <T, U> &pair) {
os << pair.first << " " << pair.second;
return os;
}
template<class T>
istream &operator>>(istream &is, vector <T> &vec) {
for (auto &v : vec) is >> v;
return is;
}
template<class T>
ostream &operator<<(ostream &os, const vector <T> &vec) {
os << '[';
for (auto v : vec) os << v << ',';
os << ']';
return os;
}
template<class T>
inline bool chmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// cout << fixed << setprecision(15);
/*----------------------------------------------------*/
int n, s, d; cin >> n >> s >> d;
vpi xy(n); cin >> xy;
for (pi xyi : xy) {
if (xyi.first < s && xyi.second > d) {
print("Yes")
return 0;
}
}
print("No")
}
// 時間? メモリ?
// map->bucket?
// あまり->非負か確認
// set? multiset?
// オーバーフロー確認(最大値を求める)
// 入力確認
// 型確認
// ループ回数確認(TLE)
// 小数の計算は避けよう(割り算)(0割りだめ！絶対！)
// Python を使っては?
// 擬似コードを作っては?
// 汚くてもok
| // Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T>
inline bool chmax(T &x, const T &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct IOSET {
IOSET() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} ioset;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &element : vec) is >> element;
return is;
}
template <typename T>
vector<T> operator--(vector<T> &vec) {
for (T &element : vec) --element;
return vec;
}
// Union-Find
class UnionFind {
std::vector<int> par;
int n_;
public:
UnionFind(int n) {
assert(n >= 0);
par.resize(n, -1);
n_ = n;
}
int root(int x) {
assert(x >= 0 && x < n_);
if (par[x] < 0) return x;
return par[x] = root(par[x]);
}
bool unite(int x, int y) {
assert(x >= 0 && x < n_ && y >= 0 && y < n_);
int rx = root(x), ry = root(y);
if (rx == ry) return false;
if (-par[rx] > -par[ry]) std::swap(rx, ry);
par[ry] += par[rx];
par[rx] = ry;
return true;
}
bool same(int x, int y) {
assert(x >= 0 && x < n_ && y >= 0 && y < n_);
return root(x) == root(y);
}
int size(int x) {
assert(x >= 0 && x < n_);
return -par[root(x)];
}
};
// Main
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n), b(n);
cin >> a >> b;
UnionFind uf(n);
rep(i, m) {
int c, d;
cin >> c >> d;
--c; --d;
uf.unite(c, d);
}
vector<ll> asum(n, 0), bsum(n, 0);
rep(i, n) {
asum[uf.root(i)] += a[i];
bsum[uf.root(i)] += b[i];
}
rep(i, n) if (asum[i] != bsum[i]) {
cout << "No\n";
return 0;
}
cout << "Yes\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#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 REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif
const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;
void GG(){cout<<"0\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) % mo;
}
const int maxn = 1e2+5;
vector<int> g[maxn];
bool sn[maxn];
int c = 0;
void dfs(int v) {
sn[v] = 1; ++c;
for (int u : g[v]) {
if (!sn[u]) {
dfs(u);
}
}
}
signed main(){
IOS();
int n; cin>>n;
REP(i,n) {
REP(j,n) {
char c; cin>>c;
if (c == '1') {
g[j].pb(i);
}
}
}
double re = 0;
REP(i,n) {
memset(sn, 0, sizeof sn);
c = 0;
dfs(i);
double cb = 1;
re += 1/(double)c;
}
cout<<fixed<<setprecision(12)<<re<<endl;
}
| #include<bits/stdc++.h>
#define int long long
using namespace std;
int N;
vector<int> G[110];
signed main(){
cin>>N;
for(int i=0;i<N;i++)
for(int j=0;j<N;j++){
char c;
cin>>c;
if(c=='1')G[j].push_back(i);
}
long double ans=0;
for(int i=0;i<N;i++){
vector<bool> B(N,false);
B[i]=true;
queue<int> Q;
Q.push(i);
int cnt=1;
while(!Q.empty()){
int I=Q.front();
Q.pop();
for(int i:G[I])
if(!B[i]){
B[i]=true;
cnt++;
Q.push(i);
}
}
ans+=(long double)1/(long double)cnt;
}
cout<<fixed<<setprecision(16)<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
const int maxn=2e5+5;
const int mod=1e9+7;
ll dp[105][105][105];
ll a[maxn];
int main(){
int n;
scanf("%d",&n);
ll x;
scanf("%lld",&x);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
ll ans=3e18;
for(int r=1;r<=n;r++){
memset(dp[0],-1,sizeof dp[0]);
dp[0][0][0]=0;
for(int i=1;i<=n;i++){
for(int j=0;j<=r;j++)
for(int k=0;k<r;k++){
dp[i][j][k]=dp[i-1][j][k];
if(j>0&&dp[i-1][j-1][(k-(a[i]%r)+r)%r]!=-1)
dp[i][j][k]=max(dp[i][j][k],dp[i-1][j-1][(k-(a[i]%r)+r)%r]+a[i]);
// printf("%d %d %d ",i,j,k);
// printf("%lld\n",dp[i][j][k]);
}
}
if(dp[n][r][x%r]>=0){
// cout<<"r="<<r<<' '<<"rr="<<x%r<<' ';
// cout<<dp[n][r][x%r]<<endl;
// printf("dp[%d][%d]=%lld\n",r,x%r,dp[n][r][x%r]);
ans=min(ans,(x-dp[n][r][x%r])/r);
}
}
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 rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
vi u,k;
vi dijkstra(int from,vvp g){
vi dis(g.size(),inf);
dis[from]=0;
SPQ(P) pq;
pq.push(P(0,from));
while(!pq.empty()){
auto t=pq.top();pq.pop();
if(t.fi!=dis[t.se])continue;
for(auto x:g[t.se]){
ll cost=t.fi;
if(t.fi%u[x.se])cost+=u[x.se]-t.fi%u[x.se];
cost+=k[x.se];
if(chmin(dis[x.fi],cost))pq.push(P(dis[x.fi],x.fi));
}
}
return dis;
}
int main(){
ll n,x;cin>>n>>x;
vi v(n);rep(i,n)cin>>v[i];
ll ans=inf;
REP(s,1,n+1){
vvi dp(s,vi(n+1,-inf));dp[0][0]=0;
rep(i,n){
vvi ndp=dp;
rep(j,s)rep(k,n)if(dp[j][k]!=-inf){
ll nj=(j+v[i])%s;
chmax(ndp[nj][k+1],dp[j][k]+v[i]);
}
dp=ndp;
}
ll k=dp[x%s][s];
if(k!=-inf)chmin(ans,(x-k)/s);
}
out(ans);
} |
// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll infll = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T>
inline bool chmax(T &x, const T &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &element : vec) is >> element;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
os << vec[i] << (i + 1 == vec_len ? "" : " ");
}
return os;
}
struct IOSET {
IOSET() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} ioset;
// Main
int main() {
int n;
cin >> n;
vector<int> c(n);
cin >> c;
vector<vector<int>> g(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
--a;
--b;
g[a].push_back(b);
g[b].push_back(a);
}
constexpr int cmax = 100000;
array<int, cmax + 1> color;
rep(i, cmax + 1) color[i] = 0;
vector<int> good;
good.reserve(n);
auto dfs = [&](auto &&dfs, int v, int p) -> void {
if (!color[c[v]]++) good.push_back(v);
for (int u : g[v]) {
if (u != p) dfs(dfs, u, v);
}
--color[c[v]];
};
dfs(dfs, 0, -1);
sort(all(good));
for (int v : good) cout << v + 1 << "\n";
} | #include<bits/stdc++.h>
using namespace std ;
#define MAXN 507
int n ;
int a[ MAXN ] ;
vector < int > v ;
void input ( ) {
scanf ( "%d" , &n ) ;
for ( int i = 1 ; i <= n ; ++ i ) {
scanf ( "%d" , &a[ i ] ) ;
}
v.clear ( ) ;
}
void solve ( ) {
if ( n == 2 ) {
if ( a[ 1 ] == 2 ) {
printf ( "1\n1\n" ) ;
return ;
}
else {
printf ( "0\n" ) ;
return ;
}
}
int def_odd = n - 2 ;
int def_even = n - 1 ;
if ( ( def_odd % 2 ) == 0 ) { swap ( def_even , def_odd ) ; }
int len = 0 ;
while ( 1 ) {
bool fl = false ;
for ( int i = 1 ; i < n ; ++ i ) {
if ( a[ i ] > a[ i + 1 ] ) {
fl = true ;
break ;
}
}
if ( fl == false ) { break ; }
++ len ;
int st = 1 ;
if ( ( len % 2 ) == 0 ) { st = 2 ; }
fl = false ;
for ( int i = st ; i < min ( def_odd , def_even ) ; i += 2 ) {
if ( a[ i ] > a[ i + 1 ] ) {
fl = true ;
swap ( a[ i ] , a[ i + 1 ] ) ;
v.push_back ( i ) ;
break ;
}
}
if ( fl == false ) {
if ( ( len % 2 ) == 0 ) {
swap ( a[ def_even ] , a[ def_even + 1 ] ) ;
v.push_back ( def_even ) ;
}
else {
swap ( a[ def_odd ] , a[ def_odd + 1 ] ) ;
v.push_back ( def_odd ) ;
}
}
}
while ( a[ n - 2 ] > a[ n - 1 ] || a[ n - 1 ] > a[ n ] ) {
++ len ;
if ( ( len % 2 ) == 0 ) {
swap ( a[ def_even ] , a[ def_even + 1 ] ) ;
v.push_back ( def_even ) ;
}
else {
swap ( a[ def_odd ] , a[ def_odd + 1 ] ) ;
v.push_back ( def_odd ) ;
}
}
printf ( "%d\n" , len ) ;
for ( int i = 0 ; i < len ; ++ i ) {
printf ( "%d " , v[ i ] ) ;
}
printf ( "\n" ) ;
}
int main ( ) {
ios_base :: sync_with_stdio ( false ) ;
cin.tie ( NULL ) ;
int t ;
// t = 1 ;
// cin >> t ;
scanf ( "%d" , &t ) ;
while ( t -- ) {
input ( ) ;
solve ( ) ;
}
return 0 ;
}
|
#include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5;
int A[MaxN+1]={}; // counting_sort
int B[MaxN+1];
int main(){
int N, a, c;
cin>>N;
for(int i=1;i<=N;i+=1){
cin>>a; A[a]+=1;
}
for(int i=1;i<=N;i+=1)
cin>>B[i];
long ans=0;
for(int i=1;i<=N;i+=1){
cin>>c;
ans+= A[ B[c] ] ;
}
cout<<ans<<'\n';
} | #include <cctype>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <ios>
#include <iostream>
#include <iterator>
#include <string_view>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <climits>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <regex>
#include <set>
#include <bitset>
#include <list>
const int64_t infl = 1LL << 60;
const int64_t cc = pow(10, 9) + 7;
bool sort_pair(std::pair<int64_t, char> origin,std::pair<int64_t, int64_t> another) {return origin.first < another.first; }
template <typename T> bool chmin(T &a, const T& b) {if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b) {if(a < b) {a = b;return true; } return false; }
int main()
{
int64_t q,k,s,h,w,d,m,n;
std::cin>> n;
std::vector< int64_t > list( n );
q = 0;
for( int i = 0; i < n; i++ )
{
std::cin>> list[i];
q += list[i];
}
bool dp[n+1][q+1];
std::memset( dp, 0, sizeof(dp) );
dp[0][0] = true;
for( int r = 0; r < n; r++ )
{
for( int t = 0; t <= q; t++ )
{
dp[r+1][t] |= dp[r][t];
if( list[r] <= t )
{
dp[r+1][t] |= dp[r][t-list[r]];
}
}
}
k = infl;
for( int64_t i = 1; i <= q; i++ )
{
if( dp[n][i] )
{
chmin( k, std::max( i, q - i ) );
}
}
std::cout<< k;
}
|
#include<cstdio>
const int maxh=1505;
const int LEN=(1<<20);
bool lightflag;
int mp[maxh][maxh];
bool tag[maxh][maxh];
int h,w,n,m,a,b,c,d,sum;
inline int nec(){
static char buf[LEN],*p=buf,*e=buf;
if(p==e){
if((e=buf+fread(buf,1,LEN,stdin))==buf)return EOF;
p=buf;
}
return *p++;
}
inline bool read(int&x){
static char neg=0,c=nec();
neg=0,x=0;
while((c<'0'||c>'9')&&c!='-'){
if(c==EOF)return 0;
c=nec();
}
if(c=='-'){
neg=1;
c=nec();
}
do{x=x*10+c-'0';}while((c=nec())>='0');
if(neg)x=-x;
return 1;
}
int main(){
read(h);read(w);read(n);read(m);
while(n--){
read(a);read(b);
mp[a][b]=1;
}
while(m--){
read(c);read(d);
mp[c][d]=2;
}
for(int i=1;i<=h;++i){
lightflag=0;
for(int j=1;j<=w;++j){
if(mp[i][j]==1)
tag[i][j]=lightflag=1;
else if(mp[i][j])
lightflag=0;
else tag[i][j]|=lightflag;
}
lightflag=0;
for(int j=w;j;--j){
if(mp[i][j]==1)
tag[i][j]=lightflag=1;
else if(mp[i][j])
lightflag=0;
else tag[i][j]|=lightflag;
}
}
for(int j=1;j<=w;++j){
lightflag=0;
for(int i=1;i<=h;++i){
if(mp[i][j]==1)
tag[i][j]=lightflag=1;
else if(mp[i][j])
lightflag=0;
else tag[i][j]|=lightflag;
}
lightflag=0;
for(int i=h;i;--i){
if(mp[i][j]==1)
tag[i][j]=lightflag=1;
else if(mp[i][j])
lightflag=0;
else tag[i][j]|=lightflag;
}
}
for(int i=1;i<=h;++i){
for(int j=1;j<=w;++j)
sum+=tag[i][j];
}
printf("%d",sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
//---------------------------------//
int main() {
int H, W, N, M;
cin >> H >> W >> N >> M;
vector<vector<pii>> ylis(H); // [y] := (x座標, 電球:0, ブロック:1)
vector<vector<pii>> xlis(W); // [x] := (y, 同じ)
REP(i, H) {
ylis[i].emplace_back(-1, 1);
ylis[i].emplace_back(W, 1);
}
REP(i, W) {
xlis[i].emplace_back(-1, 1);
xlis[i].emplace_back(H, 1);
}
set<pii> block;
REP(i, N) { // 電球
int A, B;
cin >> A >> B;
--A; --B;
ylis[A].emplace_back(B, 0);
xlis[B].emplace_back(A, 0);
}
REP(i, M) { // ブロック
int A, B;
cin >> A >> B;
--A; --B;
ylis[A].emplace_back(B, 1);
xlis[B].emplace_back(A, 1);
block.emplace(A, B);
}
REP(i, H) sort(ALL(ylis[i]));
REP(i, W) sort(ALL(xlis[i]));
int ans = 0;
REP(i, H) REP(j, W) {
if (block.count({i, j}) == 1) continue;
bool ok = false;
{ // x
auto it = lower_bound(ALL(ylis[i]), pii{j, -1});
if (it->second == 0) ok = true;
--it;
if (it->second == 0) ok = true;
}
{ // y
auto it = lower_bound(ALL(xlis[j]), pii{i, -1});
if (it->second == 0) ok = true;
--it;
if (it->second == 0) ok = true;
}
ans += ok;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define eb emplace_back
#define pb push_back
#define pvec(a) for (int i = 0; i < a.size(); i++) cout << a[i] << " "; cout << '\n'
#define wt(a) cout << a << '\n'
using namespace std;
using ll = long long;
template<class T, class U>bool chmin(T& a, U b) {if (a > b) {a = b; return 1;} return 0;}
template<class T, class U>bool chmax(T& a, U b) {if (a < b) {a = b; return 1;} return 0;}
vector<vector<int>> g(200005);
vector<bool> isl(200005, false);
const int INF = 1001001001;
vector<int> dp(200005, -1);
vector<int> A(200005);
int rec(int v, bool iss) {
if (dp[v] != -1) return dp[v];
int ret = (!iss ? -INF : A[v]);
for (int nv: g[v]) {
chmax(ret, rec(nv, true));
}
return dp[v] = ret;
}
int main() {
int N, M;
cin >> N >> M;
rep (i, 0, N) cin >> A[i];
rep (i, 0, M) {
int X, Y;
cin >> X >> Y;
X--, Y--;
g[X].pb(Y);
}
rep (i, 0, N) if (g[i].size() == 0) isl[i] = true;
int ans = -INF;
rep (i, 0, N) {
if (isl[i]) continue;
chmax(ans, rec(i, false) - A[i]);
}
wt(ans);
return 0;
} | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
int main(void)
{
int n, m;
cin >> n >> m;
vector<vector<ll>> g(n, vector<ll>());
vector<P> a(n), _a;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
a[i] = {x, i};
}
_a = a;
sort(a.begin(), a.end());
for (int i = 0; i < m; i++)
{
int x, y;
cin >> x >> y;
x--, y--;
g[x].push_back(y);
}
vector<bool> searched(n, false);
vector<ll> dp(n, INF);
for (int i = 0; i < n; i++)
{
queue<int> q;
q.push(a[i].second);
ll x = a[i].first;
while (q.size())
{
int p = q.front();
q.pop();
for (auto &&j : g[p])
{
if (searched[j])
{
continue;
}
searched[j] = true;
dp[j] = x;
q.push(j);
}
}
}
ll ans = -INF;
for (int i = 0; i < n; i++)
{
ans = max(ans, _a[i].first - dp[i]);
}
cout << ans << endl;
}
|
//kapi kapi spaghetti
#include <iostream>
#include <iomanip> //setprecision(12)
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
ll K;
cin>>K;
vector<ll> sum(K+1,0);
for(ll i=1; i<=K; i++)
{
ll cnt=0;
for(ll k=1; k*k<=i; k++)
{
if(i%k==0) cnt+=2;
if(k*k==i) cnt--;
}
sum[i]=sum[i-1]+cnt;
}
ll res=0;
for(ll c=1; c<=K; c++)
{
res+=sum[K/c];
}
cout<<res<<endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int a = 1, b = 1, c = 1, cnt = 0;
while(true) {
if(a * b * c <= K) {
c++;
cnt++;
} else if(a * b <= K) {
c = 1;
b++;
} else if(a <= K) {
b = c = 1;
a++;
} else {
break;
}
}
cout << cnt << endl;
return 0;
} |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
int power(int x, int y, int p)
{
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
res = (res*x) % p;
// y must be even now
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
int mod = 1000000007;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
int s= 0 ;
for(int i = 1;i<= n;i++){
int z;
cin>>z;
s+= z;
}
if(m<s ){
cout<<"0\n";return 0 ;
}
int ans = 1;
for(int i =m - s+1 ;i<=n+m;i++ ){
ans*= i;
ans%= mod;
}
for(int i = 1;i<= n+s;i++){
ans = ans*(power(i , mod-2 , mod ) );
ans%= mod;
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_string(char b) { return "'" + string(1, b) + "'"; }
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A>
string to_string(A v) {
string res = "{";
for (const auto& x : v) res += (res == "{" ? "" : ", ") + to_string(x);
return res + "}";
}
void debug() { cerr << endl; }
template <typename Head, typename... Tail>
void debug(Head H, Tail... T) {
cerr << " " << to_string(H);
debug(T...);
}
#define db(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define db(...) 42
#endif
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
struct Mint {
int val;
Mint() { val = 0; }
Mint(const ll& x) {
val = (-MOD <= x && x < MOD) ? x : x % MOD;
if (val < 0) val += MOD;
}
template <typename U>
explicit operator U() const { return (U)val; }
friend bool operator==(const Mint& a, const Mint& b) { return a.val == b.val; }
friend bool operator!=(const Mint& a, const Mint& b) { return !(a == b); }
friend bool operator<(const Mint& a, const Mint& b) { return a.val < b.val; }
Mint& operator+=(const Mint& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
Mint& operator-=(const Mint& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
Mint& operator*=(const Mint& m) { val = (ll)val * m.val % MOD; return *this; }
friend Mint modex(Mint a, ll p) {
assert(p >= 0);
Mint ans = 1;
for (; p; p >>= 1, a *= a) if (p & 1) ans *= a;
return ans;
}
Mint& operator/=(const Mint& m) { return *this *= modex(m, MOD - 2); }
Mint& operator++() { return *this += 1; }
Mint& operator--() { return *this -= 1; }
Mint operator++(int) { Mint result(*this); *this += 1; return result; }
Mint operator--(int) { Mint result(*this); *this -= 1; return result; }
Mint operator-() const { return Mint(-val); }
friend Mint operator+(Mint a, const Mint& b) { return a += b; }
friend Mint operator-(Mint a, const Mint& b) { return a -= b; }
friend Mint operator*(Mint a, const Mint& b) { return a *= b; }
friend Mint operator/(Mint a, const Mint& b) { return a /= b; }
friend ostream& operator<<(ostream& os, const Mint& x) { return os << x.val; }
friend string to_string(const Mint& b) { return to_string(b.val); }
};
int main() {
int n, m;
scanf("%d%d", &n, &m);
int s = 0;
for (int i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
s += a;
}
m += n;
s += n;
Mint ans = 1;
for (int i = 0; i < s; ++i) {
ans *= m - i;
ans /= i + 1;
}
printf("%d\n", ans.val);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> S(N + 1, 0);
int mod = 998244353;
int64_t ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
for (int i = N - 1; i >= 0; i--) {
S.at(i) = (2 * S.at(i + 1) + A.at(i)) % mod;
}
for (int j = N; j > 0; j--) {
ans += (A.at(j - 1) * S.at(j)) % mod;
ans %= mod;
}
for (int j = 0; j < N; j++) {
ans += (A.at(j) * A.at(j)) % mod;
ans %= mod;
}
cout << ans % mod << endl;
return 0;
} | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef vector<vector<int>> graph;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define MOD 998244353
#define MAXX 1.1529215e+18
#define _1 first
#define _2 second
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
template<class t> using vc=vector<t>;
template<class T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<class T>
T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b == 0) {
x = 1;
y = 0;
} else {
d = extgcd(b, a%b, y, x);
y -= (a/b)*x;
}
return d;
}
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p._1<<","<<p._2<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) {
cin >> A[i];
}
SORT(A);
ll tmp = 0;
ll ans = 0;
for (ll i = N-1; i >= 0; i--) {
ans += A[i]*((A[i]+tmp)%MOD)%MOD;
ans %= MOD;
tmp *= 2;
tmp %= MOD;
tmp += A[i];
tmp %= MOD;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1LL<<60;
const int mod = 1000000007;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,x;cin>>n>>x;
rep(i,n){
ll a;cin>>a;
if(a==x)continue;
cout<<a<<" ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(auto x: a){
if(x!=k)cout<<x<<' ';
}
} |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
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; }
const long long INF = 1LL << 60;
typedef pair<int, int> PR;
#define rep(i,n) ;for( int i =0; i < n ; i ++)
#define all(a) a.begin(),a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define fr(i,a,b) for(int i=a;i<b;i++)
#define pri(a) printf("%.14lf\n",a);
#define MOD 1000000007
bool is_int_lround(double x){
return std::lround(x)==x;
}
ll keta(ll x){
ll n=0;
while(x>0){
x /=10 ;
n ++;
}
return n;
}
ll conbi(int n,int m){
cin>>n>>m;
vector<ll> a(100);
a[0] =1;
for(int i=0;i<14;i++){
a[i+1]=a[i]*(i+1);
}
return a[n] /(a[m] *a[n-m]);
}
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;
}
ll kaijo(ll x){
ll z=1;
if(x==0){
return 1;
}
while(x>0){
z *=x;
z %=MOD;
x--;
}
return z;
}
ll yakusu_num(ll n){
vl yakusu(n+1,1);
for(ll i=2;i*i<=n;i++){
while(n%i==0){
n /=i;
yakusu[i]++;
}
}
if(n!=1)yakusu[n]++;
ll num=1;
for(ll i=0;i <=n;i++){
num*=yakusu[i];
}
return num;
}
//cout<<""<<endl;
int main(){
ll A,B;cin>>A>>B;
cout<<max(2*A+100-B,0LL)<<endl;
}
|
#pragma GCC target("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#define int ll
#define f first
#define sz(a) ((int)(a).size())
#define s second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vpii vector<pii>
#define eb emplace_back
#define pb push_back
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define vi vector<int>
using namespace std;
using ll = long long;
using lld = long double;
const int oo = 0x3f3f3f3f;
const ll MOD = 1000000007;
signed main(){
#ifndef ONLINE_JUDGE
//freopen("in.txt" , "r" , stdin);
#endif
ios_base::sync_with_stdio(0);cin.tie(0);
int n , C;
cin >> n >> C;
vi a(n) , b(n) , c(n);
fo(i , n) cin >> a[i] >> b[i] >> c[i];
map<int,int> hm;
int cur = 0 , prev = 0 , ans = 0;
fo(i , n){
hm[b[i] + 1] -= c[i];
hm[a[i]] += c[i];
}
for(auto [k , v] : hm){
ans += min(cur , C) * (k - prev);
cur += v;
prev = k;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t A,B,C;
cin >> A >> B >> C;
constexpr int64_t MOD= 10;
if(B==1){
cout << A% MOD << endl;
return 0;
}
if(B<= MOD and C<= 4){
int64_t B_C= 1;
for(int i=0; i<C; i++){
B_C*= B;
}
int64_t calcA= 1;
for(int i=0; i<B_C; i++){
calcA*= A;
calcA%= MOD;
}
cout << calcA << endl;
return 0;
}
constexpr int64_t nil= -1;
vector<int64_t> memo(MOD, nil);
map<int, int64_t> digit;
int64_t calcA= A% MOD;
int i= 1;
while(memo.at(calcA)==nil){
memo.at(calcA)= i;
digit[i]= calcA;
i++;
calcA*= A;
calcA%= MOD;
}
int64_t offset= memo.at(calcA);
int64_t L= i- memo.at(calcA);
int64_t B_C_MOD_L= 1;
int64_t powB= B;
while(C > 0){
if(C&1){
B_C_MOD_L*= powB;
B_C_MOD_L%= L;
}
powB*= powB;
powB%= L;
C>>= 1;
}
int64_t ans= digit.at((B_C_MOD_L+(L- offset))% L+ 1);
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define em emplaces
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;
const ll Mod = 998244353;
int n, m;
ll f[5010];
ll invf[5010];
ll dp[15][5010];
ll inv(ll a) {
ll b = Mod - 2;
ll ret = 1;
while(b) {
if(b & 1) ret *= a;
b >>= 1;
a *= a;
ret %= Mod;
a %= Mod;
}
return ret;
}
int main() {
fast;
f[0] = 1;
for(int i=1; i<=5000; i++) {
f[i] = f[i-1] * i % Mod;
}
invf[5000] = inv(f[5000]);
for(int i=5000; i>=1; i--) {
invf[i-1] = invf[i] * i % Mod;
}
cin >> n >> m;
dp[12][0] = 1;
for(int i=11; i>=0; i--) {
for(int j=0; j<=m; j++) {
for(int k=0; k * (1<<i) <= j && k <= n; k+=2) {
dp[i][j] += dp[i+1][j - k * (1<<i)] * f[n] % Mod * invf[k] % Mod * invf[n-k] % Mod;
dp[i][j] %= Mod;
}
}
}
cout << dp[0][m];
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end
void solve(int _rot){
// printf("Case #%d: ",_rot);
int n; cin>>n;
string s[3];
rep(i,0,3)cin>>s[i];
string res="0";
rep(_,0,n)res+='1';
rep(_,0,n)res+='0';
cout<<res<<'\n';
}
int main(){
int t; scanf("%d",&t);
rep(rot,0,t)solve(rot+1);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
void solve() {
int n,k; cin>>n>>k;
int ans=0;
for (int i=1; i<=n; i++) {
ans+=i*k*100;
ans+=k*(k+1)/2;
}
cout<<ans;
return;
}
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
#define endl "\n"
typedef pair<int,int> PII;
typedef pair<int,string> PIS;
typedef pair<string,int> PSI;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
int mp[5010][4];
mp[0][0]=mp[0][1]=mp[0][2]=mp[0][3]=0;
cin>>n>>s;
rep(i,s.size() ){
rep(j,4){
mp[i+1][j]=mp[i][j];
}
if(s[i]=='A'){
mp[i+1][0]++;
}
if(s[i]=='T'){
mp[i+1][1]++;
}
if(s[i]=='C'){
mp[i+1][2]++;
}
if(s[i]=='G'){
mp[i+1][3]++;
}
}
/*rep(i,4){
rep(j,4){
cout<<mp[i][j]<<" ";
}
cout<<endl;
}*/
int ans=0;
rep(i,s.size()+1){
repi(j,i+1,s.size()+1 ){
int A=mp[j][0]-mp[i][0],T=mp[j][1]-mp[i][1],C=mp[j][2]-mp[i][2],G=mp[j][3]-mp[i][3];
if(A==T && C==G){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
void solve(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0; i < n; ++i){
vector<int> freq(26, 0);
for(int j = i; j < n; ++j){
++freq[s[j]-'A'];
if(freq['A'-'A']==freq['T'-'A'] && freq['C'-'A']==freq['G'-'A']) ++ans;
}
}
cout << ans << "\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b;
cin, a, b;
print((a + b) / 2, (a - b) / 2);
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
long long int K;
cin >> N >> K;
// div2[i]: i = n1 + n2 の組合わせ数 ( 1<= n1, n2 <= N)
vector<int> div2(2*N+1 , 0);
for (int i = 2; i <= (N + 1); ++i) { div2[i] = i - 1; }
for (int i = (N + 2); i <= (2 * N); ++i) { div2[i] = 2 * N - i + 1; }
// int_div2[i] = div2[0] + .. + div2[i]
vector<long long int> int_div2(2 * N + 1, 0);
for (int i = 1; i <= 2*N; ++i) { int_div2[i] = int_div2[i - 1] + static_cast<long long int>(div2[i]); }
// 合計値の探索
int sum = 0;
long long int rank = 0;
long long int pri_rank = 0;
for (sum = 3; sum <= (3 * N); ++sum)
{
// 2 <= j - i <= 2N and 1 <= j <= N
int b = max(2, sum - N);
int e = min(sum - 1, 2 * N);
long long int div3 = int_div2[e] - int_div2[b-1]; // = div3[i]: i = n1 + n2 + n3 の組合わせ数 ( 1<= n1, n2, n3 <= N)
if (div3 >= K) { break; }
else { K -= div3; }
}
int first_i = max(1, sum - 2 * N);
int last_i = min(N, sum - 2);
int k = 0;
for (k = first_i; k <= last_i; ++k)
{
if (K <= div2[sum - k]) { break; }
else { K -= div2[sum - k]; }
}
int first_o = max(1, sum - k - N);
int o = first_o + static_cast<int>(K) - 1;
int n = sum - k -o;
cout << k << " " << o << " " << n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(5e5)+10;
int n,a[maxn],b[maxn];
ll ans;
char s[maxn],t[maxn];
int main() {
//freopen("1.txt","r",stdin);
read(n);
scanf("%s",s+1); scanf("%s",t+1);
for (int i=1;i<=n;i++) a[i]=s[i]-'0';
for (int i=1;i<=n;i++) b[i]=t[i]-'0';
for (int i=1,j=0;i<=n;i++) {
if (j<=i) j=i+1;
if (a[i]!=b[i]) {
while (j<=n&&a[j]==0) j++;
if (j>n) { puts("-1"); return 0; }
ans+=j-i; a[j]=0;
}
}
printf("%lld\n",ans);
return 0;
}
/*
0. Enough array size? Enough array size? Enough array size? Interger overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/ | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,k,n) for(int i=k;i<=n;i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define newl "\n"
#define vi vector <int>
#define pii pair <int,int>
#define fi first
#define se second
#define st(x) x.begin()
#define en(x) x.end()
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
#define len(x) x.length()
#define MAX *max_element
#define MIN *min_element
#define int long long int
const int MOD = 1e9 + 7;
template <typename T>
void print(T &x){
for (auto &ele : x) cout << ele << ' ';
cout << "\n";
}
void solveforcase(int tc){
int n;
cin>>n;
int a[n];
rep(i,n) cin>>a[i];
int count = 0;
rep(i,n){
if(a[i]>=10){
count += a[i]-10;
}
}
cout << count << "\n";
}
signed main(){
ios ::sync_with_stdio(0);
cin.tie(0);
int T = 1;
for(int tc = 1; tc<=T;tc++){
solveforcase(tc);
}
} |
#pragma gcc optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> G(n + 1);
while (m--) {
int u, v;
cin >> u >> v;
G[u].emplace_back(v);
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
vector<bool> vis(n + 1);
vis[i] = true;
++ans;
queue<int> q;
q.emplace(i);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int& v : G[u]) {
if (vis[v]) continue;
vis[v] = true;
++ans;
q.emplace(v);
}
}
}
cout << ans << '\n';
} | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpll vector<pll>
#define vpii vector<pii>
#define umap unordered_map
#define uset unordered_set
#define PQ priority_queue
#define printa(a, L, R) \
for (int i = L; i < R; i++) \
cout << a[i] << (i == R - 1 ? '\n' : ' ')
#define printv(a) printa(a, 0, a.size())
#define print2d(a, r, c) \
for (int i = 0; i < r; i++) \
for (int j = 0; j < c; j++) \
cout << a[i][j] << (j == c - 1 ? '\n' : ' ')
#define pb push_back
#define eb emplace_back
#define UB upper_bound
#define LB lower_bound
#define F first
#define S second
#define mem(a, x) memset(a, x, sizeof(a))
#define inf 1e18
#define E 2.71828182845904523536
#define gamma 0.5772156649
#define nl "\n"
#define lg(r, n) (int)(log2(n) / log2(r))
#define rev(v) reverse(v.begin(), v.end())
#define srt(v) sort(v.begin(), v.end())
#define grtsrt(v) sort(v.begin(), v.end(), greater<ll>())
#define all(v) v.begin(), v.end()
#define mnv(v) *min_element(v.begin(), v.end())
#define mxv(v) *max_element(v.begin(), v.end())
#define toint(a) atoi(a.c_str())
#define BeatMeScanf ios_base::sync_with_stdio(false)
#define one(x) __builtin_popcount(x)
#define Unique(v) v.erase(unique(all(v)), v.end())
#define fout(x) fixed << setprecision(x)
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
deb(_it, args); \
}
void deb(istream_iterator<string> it)
{
}
template <typename T, typename... Args>
void deb(istream_iterator<string> it, T a, Args... args)
{
cout << *it << " = " << a << endl;
deb(++it, args...);
}
const int mod = 1e9 + 7;
const int N = 3e5 + 9;
const ld eps = 1e-9;
const ld PI = acos(-1.0);
// template <typename T>
// using o_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
//random_device rd;
//mt19937 random(rd());
ll gc(ll a, ll b)
{
while (b)
{
ll x = a % b;
a = b;
b = x;
}
return a;
}
ll lc(ll a, ll b) { return a / gc(a, b) * b; }
ll qpow(ll n, ll k)
{
ll ans = 1;
assert(k >= 0);
n %= mod;
while (k > 0)
{
if (k & 1)
ans = (ans * n) % mod;
n = (n * n) % mod;
k >>= 1;
}
return ans % mod;
}
void solve()
{
ll n, x;
cin>>n>>x;
ll f=-1;
ll tt=0;
for(int i=1;i<=n;i++)
{
ll v, p;
cin>>v>>p;
tt+=v*p;
if(tt>100*x and f==-1) f=i;
}
cout<<f<<nl;
}
int main()
{
BeatMeScanf;
ll t=1;
// cin>>t;
int cs=0;
while(t--){
solve();
}
return 0;
}
|
/**
* █████╗ ██████╗ ██████╗ ██╗ ███████╗
* ██╔══██╗██╔════╝ ██╔══██╗██║ ╚══███╔╝
* ███████║██║ ██████╔╝██║ ███╔╝
* ██╔══██║██║ ██╔═══╝ ██║ ███╔╝
* ██║ ██║╚██████╗▄█╗ ██║ ███████╗███████╗
* ╚═╝ ╚═╝ ╚═════╝╚═╝ ╚═╝ ╚══════╝╚══════╝
*
* @Author: TieWay59
* @Created: 2020/10/28 15:37
* @Link: https://atcoder.jp/contests/arc106/tasks/arc106_c
* @Tags:
*
*******************************************************/
#include <bits/stdc++.h>
#ifdef DEBUG
# include "libs59/debugers.h"
// #define debug(x) cerr <<#x << " = "<<x<<endl;
#else
# define endl '\n'
# define debug(...)
# define max(x,y) ((x)>(y)?(x):(y))
# define min(x,y) ((x)>(y)?(y):(x))
#endif
#define STOPSYNC ios::sync_with_stdio(false);cin.tie(nullptr)
#define MULTIKASE int Kase=0;cin>>Kase;for(int kase=1;kase<=Kase;kase++)
typedef long long ll;
const int MAXN = 2e5 + 59;
const int MOD = 1e9 + 7;
const int INF = 0x3F3F3F3F;
const ll llINF = 0x3F3F3F3F3F3F3F3F;
using namespace std;
using pii = pair<int, int>;
using vint = vector<int>;
ll fpow(ll a, ll b, ll mod = MOD) {
if (a % mod == 0) return 0;
ll ret = 1;
a %= mod;
while (b) {
if (b & 1)ret = ret * a % mod;
a = a * a % mod;
b >>= 1;
}
return ret;
}
int n, m;
const int shuff = 1e6;
void solve(int kaseId = -1) {
cin >> n >> m;
if (m < 0) {
cout << -1 << endl;
} else if (m == 0) {
for (int i = 1; i <= n; ++i) {
cout << i * 2 - 1 << " " << i * 2 << endl;
}
} else if (m < n - 1) {
for (int i = 1; i <= m + 1; ++i) {
cout << shuff + i * 2 - 1 << " " << shuff + i * 2 << endl;
}
int l = -1, r = (m + 1) * 2 + 1;
for (int i = m + 2; i <= n; ++i) {
cout << shuff + l << " " << shuff + r << endl;
l--;
r++;
}
} else {
cout << -1 << endl;
}
}
void solves() {
MULTIKASE {
solve(kase);
}
}
int main() {
#ifdef DEBUG
freopen("input.txt", "r+", stdin);
#endif
STOPSYNC;
solve();
return 0;
}
/*
*/ | /* -*- coding: utf-8 -*-
*
* c.cc: C - Solutions
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
/* constant */
const int MAX_N = 200000;
/* typedef */
/* global variables */
/* subroutines */
/* main */
int main() {
int n, m;
scanf("%d%d", &n, &m);
if (m == 0) {
for (int i = 1; i <= n; i++)
printf("%d %d\n", 2 * i - 1, 2 * i);
return 0;
}
if (m >= n - 1 || m < 0) {
puts("-1");
return 0;
}
printf("1 %d\n", 2 * (m + 2));
for (int i = 1; i <= m + 1; i++)
printf("%d %d\n", 2 * i, 2 * i + 1);
for (int i = m + 3; i <= n; i++)
printf("%d %d\n", 2 * i - 1, 2 * i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e) cerr<<#a<<": "<<a<<" | "<<#b<< ": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define cases int testcases;cin>>testcases; while(testcases--)
const int N = 200005;
#define rep(i, x, y) for (__typeof(x) i = x; i <= y; i ++)
#define repi(i, x, y) for (__typeof(x) i = x; i >= y; i --)
int x;
map<int,int> dp;
int rec(int curr)
{
if(curr <= x)return x-curr;
if(dp.find(curr) != dp.end())return dp[curr];
int ans = curr-x;
if(curr%2 == 0)
{
if(curr/2 > x)ans = min(ans,1 + rec(curr/2));
else ans = min(ans, 1 + x - curr/2);
}
else if(curr + 1 == x or curr - 1 == x)return 1;
else
{
ans = min({ans,2 + rec((curr+1)/2),2 + rec((curr-1)/2)});
}
return dp[curr] = ans;
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int y;
cin >> x >> y;
cout << rec(y);
return 0;
}
| #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define ppi pair<pii,int>
#define pip pair<int,pii>
#define ll long long
#define pll pair<ll,ll>
#define rep(i,n) for(int i=0;i<n;i++)
#define repd(i,n) for(int i=n-1;i>=0;i--)
#define inf 1000000001
#define inf1 1000000000000000001
#define mod 1000000007
#define pie 3.14159265358979323846
#define N 1000005
#define mid(l,r) l+(r-l)/2
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
void mad(ll &a,ll b){a=(a+b)%mod;if(a<0)a+=mod;}
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
map<ll,ll>vis,dp;
ll x,y;
ll rec(ll i){
if(i==1)return abs(i-x);
if(vis[i])return dp[i];
vis[i]=1;
dp[i]=abs(i-x);
if(i%2==0)dp[i]=min(dp[i],1+rec(i/2));
else dp[i]=min(dp[i],1+min(rec(i+1),rec(i-1)));
return dp[i];
}
void solve(){
cin>>x>>y;
if(x>=y){cout<<x-y;return;}
cout<<rec(y);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin>>t;
while(t--){
solve();
}
} |
// Fearless
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define PI (2.0 * acos(0.0))
#define testcase ll T; cin >> T; for (ll tc = 1; tc <= T; tc++)
const long long M = 1e5 + 10, M2 = 1e6 + 10, oo = 1e9 + 7;
int k, n;
string s;
int ara[30][30], ln;
int bigmod (int n, int p) {
if (p == 0) return 1;
int ans = bigmod(n, p / 2);
ans = (ans * ans) % ln;
if (p % 2 == 1) ans = (ans * n) % ln;
return ans;
}
char dp[102][102];
char get (int pos, int sz) {
//cout << pos << " " << sz << endl;
if (dp[pos][sz] != '?') return dp[pos][sz];
if (sz == 0) {
return s[pos];
}
char c1, c2;
int mpos = (pos + bigmod(2, sz - 1)) % n;
c1 = get(pos, sz - 1);
c2 = get(mpos, sz - 1);
if (c1 == c2) return dp[pos][sz] = c1;
return dp[pos][sz] = ara[min(c1 - 'A', c2 - 'A')][max(c1 - 'A', c2 - 'A')] + 'A';
}
void solve () {
cin >> n >> k >> s;
ln = n;
ara['R' - 'A']['S' - 'A'] = 'R' - 'A';
ara['P' - 'A']['R' - 'A'] = 'P' - 'A';
ara['P' - 'A']['S' - 'A'] = 'S' - 'A';
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) dp[i][j] = '?';
}
cout << get(0, k) << endl;
}
int main () {
//freopen("E:/newts/in.txt", "r", stdin);
//freopen("E:/newts/out.txt", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//testcase {
solve ();
//}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
char w[88][88];
int n,k;
string s;
int main(){
cin>>n>>k>>s;
w['R']['R']=w['R']['S']=w['S']['R']='R';
w['S']['S']=w['P']['S']=w['S']['P']='S';
w['P']['P']=w['P']['R']=w['R']['P']='P';
while(k--){
string ss=s+s;
for(int i=0;i<n;i++){
s[i]=w[ss[2*i]][ss[2*i+1]];
}
}
cout<<s[0]<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
random_device rnd;
mt19937 mt(rnd());
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1000000007;
int main()
{
int n;
cin >> n;
vector<pair<ll, int>> xs, ys;
rep(i, n)
{
ll x, y;
cin >> x >> y;
xs.push_back({x, i});
ys.push_back({y, i});
}
sort(ALL(xs));
sort(ALL(ys));
vector<pair<ll, ll>> ans;
ans.push_back({xs[xs.size() - 1].first - xs[0].first, xs[xs.size() - 1].second * 100000ll + xs[0].second});
ans.push_back({xs[xs.size() - 2].first - xs[0].first, xs[xs.size() - 2].second * 100000ll + xs[0].second});
ans.push_back({xs[xs.size() - 1].first - xs[1].first, xs[xs.size() - 1].second * 100000ll + xs[1].second});
ans.push_back({ys[ys.size() - 1].first - ys[0].first, ys[ys.size() - 1].second * 100000ll + ys[0].second});
ans.push_back({ys[ys.size() - 2].first - ys[0].first, ys[ys.size() - 2].second * 100000ll + ys[0].second});
ans.push_back({ys[ys.size() - 1].first - ys[1].first, ys[ys.size() - 1].second * 100000ll + ys[1].second});
sort(ALL(ans), greater<pair<ll, ll>>());
ll id = ans[0].second;
rep(i, ans.size())
{
if (ans[i].second != id)
{
cout << ans[i].first << endl;
return 0;
}
}
}
| #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
using ll = long long;
void push(vector<pair<ll, ll>> vec, vector<pair<ll, ll>>& aft) {
aft.at(0) = vec.at(0);
aft.at(1) = vec.at(1);
aft.at(2) = vec.at(vec.size() - 2);
aft.at(3) = vec.at(vec.size() - 1);
}
int main() {
int n;
cin >> n;
vector<pair<ll, ll>> x(n);
vector<pair<ll, ll>> y(n);
for (int i = 0; i < n; i++) {
cin >> x.at(i).first >> y.at(i).first;
x.at(i).second = i;
y.at(i).second = i;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
vector<pair<ll,ll>> aftx (4);
vector<pair<ll, ll>> afty(4);
push(x, aftx); push(y, afty);
vector<tuple<ll, ll, ll>> ans;
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < 4; j++) {
ans.push_back(make_tuple(
abs(aftx.at(i).first
- aftx.at(j).first),
aftx.at(i).second,
aftx.at(j).second));
}
}
for (int i = 0; i < 3; i++) {
for (int j = i + 1; j < 4; j++) {
ans.push_back(make_tuple(
abs(afty.at(i).first
- afty.at(j).first),
afty.at(i).second,
afty.at(j).second));
}
}
sort(ans.begin(), ans.end());
//2,3番の要素を整列
if (get<1>(ans.at(ans.size() - 1))
< get<2>(ans.at(ans.size() - 1))) {
swap(get<1>(ans.at(ans.size() - 1)),
get<2>(ans.at(ans.size() - 1)));
}
if (get<1>(ans.at(ans.size() - 2))
< get<2>(ans.at(ans.size() - 2))) {
swap(get<1>(ans.at(ans.size() - 2)),
get<2>(ans.at(ans.size() - 2)));
}
if (ans.at(ans.size() - 1)
== ans.at(ans.size() - 2)) {
ans.erase(ans.end() - 2);
}
cout << get<0>(ans.at(ans.size() - 2)) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
#define MAX_V 200001 //10^5
int V,E,depth[MAX_V]; //dは開始ノードからの距離=深さ
typedef long long ll;
ll val[MAX_V];
//numは辺番号。消しても良いし、他の用途に使っても良し
struct edge{
int to,num;
};
vector<edge> G[MAX_V];
struct ED{
int from,to;
};
ED P[MAX_V];
void input_graph(int E){
int s,t;
REP(i,E){
cin>>s>>t;s--;t--;
G[s].push_back({t,i});
G[t].push_back({s,i}); //無向グラフの場合
P[i]={s,t};
}
}
//幅優先探索。引数は開始ノード。
void bfs(int root){
queue<int> q;q.push(root);
vector<bool> used(V,false);used.at(root)=true;
depth[root]=0;
while(!q.empty()){
int now=q.front();q.pop();
REP(i,G[now].size()){
int next=G[now].at(i).to;
if(!used.at(next)){
used.at(next)=true;
depth[next]=depth[now]+1; //距離の追加
//ここに処理を追加
q.emplace(next);
}
}
}
}
//幅優先探索。引数は開始ノード。
void bfs2(int root){
queue<int> q;q.push(root);
vector<bool> used(V,false);used.at(root)=true;
while(!q.empty()){
int now=q.front();q.pop();
REP(i,G[now].size()){
int next=G[now].at(i).to;
if(!used.at(next)){
used.at(next)=true;
val[next]+=val[now];
q.emplace(next);
}
}
}
}
int main(){
cin>>V;E=V-1;
input_graph(E);
bfs(0);
int q;cin>>q;
REP(i,q){
int t,e,x;cin>>t>>e>>x;e--;
int st,en;
if(t==1){
st=P[e].from;
en=P[e].to;
}else{
st=P[e].to;
en=P[e].from;
}
//cout<<"st"<<st<<" "<<en<<endl;
if(depth[st]<depth[en]){
val[0]+=(ll)x;
val[en]-=(ll)x;
}else{
val[st]+=(ll)x;
}
}
bfs2(0);
REP(i,V){
cout<<val[i]<<endl;
}
return 0;
} | #include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#include<queue>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define MOD 1000000007
#define INF 9223372036854775800
using namespace std;
ll int recal(ll int y, ll int x, ll int flag,vector< vector< bool > > bo,ll int A, ll int B,
ll int H, ll int W){
ll int ans = 0;
if( flag == 0 ){
if( A >= 1 ){
if( bo[y][x] ){
if( x != W-1 ){
ans += recal(y,x+1,flag,bo,A,B,H,W);
return ans;
}
else if( y != H-1 ){
ans += recal(y+1,0,flag,bo,A,B,H,W);
return ans;
}
}
else{
A-=1;
bo[y][x] = true;
ll int f=0;
rep(i,H){
rep(j,W){
if( !bo[i][j] ){
f = 1;
}
}
}
if( f == 0 ){
return 1;
}
}
if( x != W-1 ){
ans += recal(y,x+1,0,bo,A,B,H,W);
ans += recal(y,x+1,1,bo,A,B,H,W);
ans += recal(y,x+1,2,bo,A,B,H,W);
}
else if( y != H-1 ){
ans += recal(y+1,0,0,bo,A,B,H,W);
ans += recal(y+1,0,1,bo,A,B,H,W);
ans += recal(y+1,0,2,bo,A,B,H,W);
}
}
else{
return 0;
}
}
else if( flag == 1 ){
if( B >= 1 ){
if( x == W-1 ){
if( !bo[y][x] ){
return 0;
}
else{
ans += recal(y+1,0,flag,bo,A,B,H,W);
return ans;
}
}
else{
if( bo[y][x] ){
if( x != W-1 ){
ans += recal(y,x+1,flag,bo,A,B,H,W);
return ans;
}
else if( y != H-1 ){
ans += recal(y+1,0,flag,bo,A,B,H,W);
return ans;
}
}
else{
if( bo[y][x+1] ){
return 0;
}
B -= 1;
bo[y][x] = true;
bo[y][x+1] = true;
ll int f=0;
rep(i,H){
rep(j,W){
if( !bo[i][j] ){
f = 1;
}
}
}
if( f == 0 ){
return 1;
}
}
if( x != W-1 ){
ans += recal(y,x+1,0,bo,A,B,H,W);
ans += recal(y,x+1,1,bo,A,B,H,W);
ans += recal(y,x+1,2,bo,A,B,H,W);
}
else if( y != H-1 ){
ans += recal(y+1,0,0,bo,A,B,H,W);
ans += recal(y+1,0,1,bo,A,B,H,W);
ans += recal(y+1,0,2,bo,A,B,H,W);
}
}
}
else{
return 0;
}
}
else{
if( B >= 1 ){
if( y == H-1 ){
return 0;
}
else{
if( bo[y][x] ){
if( x != W-1 ){
ans += recal(y,x+1,flag,bo,A,B,H,W);
return ans;
}
else if( y != H-1 ){
ans += recal(y+1,0,flag,bo,A,B,H,W);
return ans;
}
}
else{
if( bo[y+1][x] ){
return 0;
}
B -= 1;
bo[y][x] = true;
bo[y+1][x] = true;
ll int f=0;
rep(i,H){
rep(j,W){
if( !bo[i][j] ){
f = 1;
}
}
}
if( f == 0 ){
return 1;
}
}
if( x != W-1 ){
ans += recal(y,x+1,0,bo,A,B,H,W);
ans += recal(y,x+1,1,bo,A,B,H,W);
ans += recal(y,x+1,2,bo,A,B,H,W);
}
else if( y != H-1 ){
ans += recal(y+1,0,0,bo,A,B,H,W);
ans += recal(y+1,0,1,bo,A,B,H,W);
ans += recal(y+1,0,2,bo,A,B,H,W);
}
}
}
else{
return 0;
}
}
return ans;
}
int main(){
ll int H,W,A,B;
cin >> H >> W >> B >> A;
vector< vector< bool > > bo(H,vector< bool > (W,false) );
ll int ans = 0;
ans += recal(0,0,0,bo,A,B,H,W);
ans += recal(0,0,1,bo,A,B,H,W);
ans += recal(0,0,2,bo,A,B,H,W);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b,c;
cin >> a >> b >> c;
int d = min(a,b);
a -= d;
b -= d;
if(c==0){
if(a-1<0) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
}
if(c==1){
if(b-1<0) cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
}
} | #include<bits/stdc++.h>
#define int long double
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
s.find_by_order(x) xth element in set
x.order_of_key(x) number of elements <x*/
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int,int>
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define pii pair<int,int>
#define extract_word(s) stringstream str(s); while(str>>word)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define SET(s) cout<<fixed<<setprecision(s)
#define set0(a) memset(a,0,sizeof(a))
#define endl "\n"
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define lower_string(s) transform(all(s),s.begin(),::tolower)
#define upper_string(s) transform(all(s),s.begin(),::toupper)
#define len(s) (int)s.size()
#define F first
#define S second
template<typename T,typename U>
bool compare(T x,U y){return(abs(x-y)<=1e-9);}
const int MOD=1e9+7;
void solve()
{
int r,x,y;
cin>>r>>x>>y;
double dist=sqrtl(x*x+y*y);
double k=dist/r;
int ans=ceil(k);
if(dist<r)
cout<<2;
else
cout<<ans;
}
signed main()
{
//code
fastio
int t=1;
//cin>>t;
while(t--)
{
solve();
cout<<endl;
}
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define Pii pair<int,int>
#define Pll pair<long long,long long>
#define fout(num) cout << fixed << setprecision(20) << (num) << endl
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
//vector<vector<ll>> dp(n,vector<ll>(n))
//2-dim:vector<vector<Type>> vv(n, vector<Type>(m, d));
//3-dim:vector<vector<vector<Type>>> vvv(n, vector<vector<Type>>(m, vector<Type>(l, d)));
using namespace std;
vector<ll> a;
int n;
ll x;
map<Pll,ll> memo;
ll dfs(ll val,int k){
Pll p=make_pair(val,k);
if(memo.count(p)) return memo[p];
if(k==n-1){
return 1;
}
if(val%a[k+1]==0){
return memo[p]=dfs(val,k+1);
}else{
val-=val%a[k+1];
return memo[p]=dfs(val,k+1)+dfs(val+a[k+1],k+1);
}
}
signed main(){
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
cin >> n >> x;
a.resize(n);
rep(i,n){
cin >> a[i];
}
cout << dfs(x,0) << endl;
}
// g++ main.cpp -o main.out && ./main.out
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define rept(i,t,n) for(int64_t i = (int64_t)(t);i < (int64_t)(n);i++)
#define all(vec) vec.begin(), vec.end()
int main(){
int64_t n;
int64_t c,m = 0;
cin >> n;
int64_t t = n+1;
rept(i,1,n+2){
c += i;
if(c > n+1){
m = i-1;
break;
}
else if(c == n+1){
m = i;
break;
}
}
cout << n+1-m;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
#define lin(x) ll x; cin>>x;
#define stin(x) string x; cin>>x;
#define yn(x) if(x) { cout<<"Yes"<<endl; } else { cout<<"No"<<endl; }
#define YN(x) if(x) { cout<<"YES"<<endl; } else { cout<<"NO"<<endl; }
#define co(x) cout<<x<<endl;
using ll=long long;
using ld=long double;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll mod=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
return ((a > b) ? (a = b, true) : (false));
}
ll powmod(ll n, ll k, ll m) {
ll r=1;
for(; k>0; k >>=1) {
if(k&1) r=(r*n)%m;
n=(n*n)%m;
}
return r;
}
ll fact(ll n) {
ll a=1;
rep(i,n) {
a=a*(n-i);
}
return a;
}
ll pow(ll a, ll b) {
ll x=1;
rep(i,b) {
x=x*a;
}
return x;
}
ll PS(ll a) {
return a*(a+1);
}
int main() {
lin(N);
ll x=N+1;
ll y=0;
//meguru
ll ng=inf*2,ok=0;
while(ng-ok>1){
ll mid=(ok+ng)/2;
if(mid*(mid+1)<=2*x)ok=mid;
else ng=mid;
}
co(N-ok+1);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const ll mod = 1e9 + 7;
int main(){
ll n;
cin >> n;
ll k=sqrt(n);
for(;k>-1;k++){
ll temp=(k+1)*(k+2)/2;
if(temp>n+1)break;
}
cout << n-(k-1);
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define min_e(v) *min_element(ALL(v))
#define max_e(v) *max_element(ALL(v))
#define acm accumulate
#define SUM(v) accumulate(ALL(v), 0l)
#define SORT(v) sort(ALL(v))
#define P 1000000007
long powP (long a, long b) {
if (b == 1) return a;
else if (b == 0) return 1;
else if (b < 0) return powP(a, P - 1 + b);
else {
long b2 = powP(a, b/2);
b2*=b2;
b2%=P;
return (b2 * powP(a, b%2)) % P;
}
}
template <typename T>
using vec = vector<T>;
template <typename T>
using vvec = vector<vector<T>>;
#define INF INT_MAX
int main() {
int t;
cin>>t;
for (int i = 0; i < t; i++) {
long l, r;
cin>>l>>r;
if (r<2*l) cout<<0<<endl;
else cout<<(r-2*l+1)*(r-2*l+2)/2<<endl;
//long sum = (r-l+1)*(r-l+1)-r*(r+1)/2;
//cout<<sum;
}
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
ll sum(ll a, ll b)
{
return ((a+b)*(b-a+1))/2;
}
void solve()
{
ll l, r;
cin >> l >> r;
ll xc=l ;
ll xm=r-l;
if(xc>xm)
cout<<0<<"\n";
else
cout<< sum(r-xm-l+1,r-xc-l+1)<< "\n";
}
int main()
{
fast_cin();
ll t;
cin >> t;
for (int it = 1; it <= t; it++)
{
// cout << "Case #" << it+1 << ": ";
solve();
}
return 0;
} |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
template<class t> using vc=vector<t>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
a+=b;
if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
int pr[15]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int v[55];
void solve(){
int n; cin >> n;
rep(i, n){
int p; cin >> p;
int mask = 0;
rep(j,15){
if(p%pr[j] == 0) mask|=(1<<j);
}
v[i] = mask;
}
ll ans = 1e18, tmp;
rep(mask,(1<<15)){
rep(i,n) if( (v[i] & mask) == 0 ) goto fail;
tmp = 1;
rep(i,15)if(((mask>>i)&1)) tmp=tmp*pr[i];
chmin(ans,tmp);
fail:;
}
o(ans);
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
int t; t = 1; //cin >> t;
while(t--) solve();
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin >> N;
ll sum = 0;
for( int i=0; i<N; i++){
ll a,b; cin >> a >> b;
sum += ((a+b)*(b-a+1))/2;
}
cout << sum << endl;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int getInt(){int x;scanf("%d",&x);return x;}
template<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("Yes"); return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
struct Solver {
void solve() {
int n,s,d;
scanf("%d%d%d",&n,&s,&d);
rep(i,n) {
int x,y;
scanf("%d%d",&x,&y);
if (x >= s) continue;
if (y <= d) continue;
dame;
}
cout<<"No"<<endl;
}
};
int main() {
int ts = 1;
// scanf("%d",&ts);
rrep(ti,ts) {
Solver solver;
solver.solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<(k) ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=(k) ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef jayinnn
#define TIME(i) Timer i(#i)
#define debug(...) do{\
fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
_do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
_s<<"{";
for(It _it=_ita;_it!=_itb;_it++)
{
_s<<(_it==_ita?"":",")<<*_it;
}
_s<<"}";
return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
class Timer {
private:
string scope_name;
chrono::high_resolution_clock::time_point start_time;
public:
Timer (string name) : scope_name(name) {
start_time = chrono::high_resolution_clock::now();
}
~Timer () {
auto stop_time = chrono::high_resolution_clock::now();
auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
double mlength = double(length) * 0.001;
debug(scope_name, mlength);
}
};
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 100005;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/********** Good Luck :) **********/
int main () {
TIME(main);
IOS();
int a, b;
cin >> a >> b;
if(a > b) swap(a, b);
if(a == b){
cout << a << endl;
} else {
cout << 3 - a - b << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
#define DIV 1000000007
//#define DIV 998244353
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; }
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
typedef vector<ll> vec;
typedef vector<vec> mat;
vector<ll> to[105];
ll N, M, K;
long long modpow(long long ori, long long po){
long long res = 1;
while(po > 0){
if(po&1){
res *= ori;
res %= DIV;
}
ori *= ori;
ori %= DIV;
po >>= 1;
}
return res;
}
// A*Bの計算
mat mul(mat &A, mat&B) {
mat C(A.size(), vec(B[0].size()));
for (int i = 0; i < A.size(); i++) {
for (int k = 0; k < B.size(); k++){
for (int j = 0; j < B[0].size();j++){
C[i][j] =(C[i][j] + A[i][k] * B[k][j]) % DIV;
}
}
}
return C;
}
// A^nの計算
mat pow(mat A, ll n) {
mat B(A.size(),vec(A.size()));
for (int i = 0;i < A.size(); i++) {
B[i][i] = 1;
}
while (n > 0) {
if (n & 1) {
B = mul(B, A);
}
A = mul(A,A);
n >>= 1;
}
return B;
}
int main(){
cin >> N >> M >> K;
vector<ll> base(N);
rep(i, N) cin >> base[i];
rep(i, M) {
ll x, y;
cin >> x >> y;
x--;y--;
to[x].push_back(y);
to[y].push_back(x);
}
mat A(N, vec(N));
rep(i, N) {
ll rest = M - to[i].size();
//そのまま
A[i][i] = rest;
A[i][i] *= modpow(M, DIV-2);
A[i][i] %= DIV;
//繋がってるやつから
for(ll next: to[i]) {
A[i][next] = modpow(2*M, DIV-2);
A[i][i] += modpow(2*M, DIV-2);
A[i][i] %= DIV;
}
}
A = pow(A, K);
rep(i, N) {
ll ans = 0;
rep(j, N) {
ans += A[i][j] * base[j];
ans %= DIV;
}
cout << ans << endl;
}
}
| #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
int mod = 1000000007;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
template<class... T> int add(int x, T... y) { return add(x, add(y...)); }
int mul(int x, int y) { return 1LL * x * y % mod; }
template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
int sub(int x, int y) { return add(x, mod - y); }
int modpow(int a, long long b) {
int ret = 1; while (b > 0) {
if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
} return ret;
}
int modinv(int a) { return modpow(a, mod - 2); }
typedef vector<int> Vec;
typedef vector<Vec> Mat;
Vec mulMatVec(Mat a, Vec b)
{
int n = b.size(); Vec ret(n, 0);
rep(i, 0, n) rep(j, 0, n) ret[i] = add(ret[i], mul(a[i][j], b[j]));
return ret;
}
Mat mulMatMat(Mat a, Mat b)
{
int n = a.size(); Mat ret(n, Vec(n, 0));
rep(i, 0, n) rep(j, 0, n) rep(k, 0, n) ret[i][j] = add(ret[i][j], mul(a[i][k], b[k][j]));
return ret;
}
Mat fastpow(Mat x, ll n)
{
Mat ret(x.size(), Vec(x.size(), 0));
rep(i, 0, x.size()) ret[i][i] = 1;
while (0 < n) { if ((n % 2) == 0) { x = mulMatMat(x, x); n >>= 1; } else { ret = mulMatMat(ret, x); --n; } }
return ret;
}
void printVec(Vec a) { cout << "[\t"; rep(i, 0, a.size()) cout << a[i] << "\t"; cout << "]" << endl; }
void printMat(Mat a) { rep(i, 0, a.size()) printVec(a[i]); }
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i @hamayanhamayan0
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, M, K, A[101];
int X[10101], Y[10101];
int cnt[101];
bool E[101][101];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> M >> K;
rep(i, 0, N) cin >> A[i];
rep(i, 0, M) cin >> X[i] >> Y[i], X[i]--, Y[i]--;
Mat Ma(N, Vec(N));
rep(i, 0, M) {
cnt[X[i]]--;
cnt[Y[i]]--;
E[X[i]][Y[i]] = E[Y[i]][X[i]] = true;
}
rep(to, 0, N) {
int cnt = M;
rep(from, 0, N) if (to != from) {
if (E[to][from]) {
Ma[to][to] = add(Ma[to][to], mul(modinv(M), modinv(2)));
Ma[to][from] = add(Ma[to][from], mul(modinv(M), modinv(2)));
cnt--;
}
}
Ma[to][to] = add(Ma[to][to], mul(cnt, modinv(M)));
}
Vec v(N, 0);
rep(i, 0, N) v[i] = A[i];
Ma = fastpow(Ma, K);
v = mulMatVec(Ma, v);
rep(i, 0, N) cout << v[i] << endl;
}
|
#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;
typedef tree<
pair<int, int>,
null_type,
less<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
#define FAST_IO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define pb push_back
#define pii pair<int,int>
const int M=1e9+7;
const int N=200005;
signed main() {
FAST_IO
int t1=1;
//cin>>t1;
while(t1--){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
cout<<a[2]+a[1]<<endl;
}
}
| #include <iostream>
#include<vector>
#include<algorithm>
#include <queue>
#include <cstdio>
#include <numeric>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int A, B, C,D,E,F,M;
cin >> A >> B >> C;
D = A + B;
E = B + C;
F = C + A;
M = max(D, E);
M = max(M, F);
cout << M;
} |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = j, i##E = k; i <= i##E; i++)
#define R(i, j, k) for(int i = j, i##E = k; i >= i##E; i--)
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int, int>
#define mkp make_pair
using namespace std;
const int N = 2e5 + 7;
const int K = 18;
inline int read() {
int x = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') { if(ch == '-') f = -1; ch = getchar(); }
while('0' <= ch && ch <= '9') x = x * 10 + (ch ^ '0'), ch = getchar();
return x * f;
}
int n, m, k;
int ans, dis[K][K], dp[K][1 << K], c[N];
vector<int> e[N];
int d[N];
void bfs(int s) {
memset(d, 0x3f, sizeof(d));
d[s] = 0;
queue<int> q;
q.push(s);
while(!q.empty()) {
int u = q.front();
q.pop();
for(int v : e[u])
if(d[v] > d[u] + 1) d[v] = d[u] + 1, q.push(v);
}
}
int main() {
n = read(), m = read();
L(i, 1, m) {
int u = read(), v = read();
e[u].push_back(v);
e[v].push_back(u);
}
k = read();
L(i, 1, k) c[i] = read();
L(i, 1, k) {
bfs(c[i]);
L(j, 1, k) dis[i][j] = d[c[j]];
}
memset(dp, 0x3f, sizeof(dp));
L(i, 1, k) dp[i][1 << (i - 1)] = 1;
L(i, 1, (1 << k) - 1) L(j, 1, k) if(i >> (j - 1) & 1)
L(t, 1, k) if(! (i >> (t - 1) & 1)) dp[t][i | (1 << (t - 1))] = min(dp[t][i | (1 << (t - 1))], dp[j][i] + dis[j][t]);
int ans = 1e9;
L(i, 1, k) ans = min(ans, dp[i][(1 << k) - 1]);
if(ans > 1e8) puts("-1");
else printf("%d\n", ans);
return 0;
} | //Bismillahirrahmanirrahim
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define int long long
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100005;
const lo mod = 1000000007;
int n,m,b[li],a[19],k,flag,t,vis[li],dp[19][li],dpp[19][19][(1<<17)+2],us[19];
int cev;
string s;
queue<pair<int,int>> q;
vector<int> v[li];
inline int f(int bir,int son,int mask){
//~ cout<<mask<
//~ cout<<bir<<" :: "<<son<<endl;
int cevv=inf;
if(mask==(1<<k)-1){
//~ if(k>2)return dp[a[bir]][a[son]];
return 0;
}
if(~dpp[bir][son][mask])return dpp[bir][son][mask];
for(int i=0;i<k;i++){
if((mask&(1<<i)))continue;
if(mask==0){
cevv=min(cevv,f(i,i,mask|us[i]));
}
else{
if(dp[son][a[i]]!=inf)
cevv=min(cevv,f(bir,i,mask|us[i])+dp[son][a[i]]);
}
}
return dpp[bir][son][mask]=cevv;
}
int32_t main(void){
memset(dpp,-1,sizeof(dpp));
scanf("%lld %lld",&n,&m);
for(int i=1;i<=m;i++){
int x,y;
scanf("%lld %lld",&x,&y);
v[x].pb(y);
v[y].pb(x);
}
scanf("%lld",&k);
for(int i=0;i<k;i++){
scanf("%lld",&a[i]);
for(int j=1;j<=n;j++){
vis[j]=0;
dp[i][j]=inf;
}
q.push({a[i],0});
while(q.size()){
int co=q.front().se;
int node=q.front().fi;
q.pop();
if(vis[node])continue;
vis[node]=1;
dp[i][node]=co;
for(auto go:v[node]){
q.push({go,co+1});
}
}
}
for(int i=0;i<k;i++)us[i]=(1<<i);
cev=f(0,0,0)+1;
if(cev>inf)cev=-1;
printf("%lld\n",cev);
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#define miu 100007
using namespace std;
template<class T>inline T mmin(T x, T y) {
return x > y ? y : x;
}
int n;
vector<long long> G[3];
char buf[7];
int flag[3], tp = 0;
const long long inf = 0x3f3f3f3f3f3f3f3f;
long long ans = inf, lm = inf, rm = inf;
signed main() {
scanf("%d", &n);
for(int i = 1; i <= 2 * n; ++i) {
long long tmp;
scanf("%lld", &tmp);
scanf("%s", buf + 1);
if(buf[1] == 'R')G[0].push_back(tmp);
if(buf[1] == 'G')G[1].push_back(tmp);
if(buf[1] == 'B')G[2].push_back(tmp);
}
for(int i = 0; i < 3; ++i) {
if(G[i].size() % 2 == 1) {flag[tp] = i; ++tp;}
}
if(tp == 0)return printf("0\n"), 0;
for(int i = 0; i < 3; ++i) if(G[i].size() % 2 == 0) {flag[tp] = i; ++tp;}
sort(G[flag[0]].begin(), G[flag[0]].end());
sort(G[flag[2]].begin(), G[flag[2]].end());
//printf("%d\n", G[flag[0]].size());
//for(vector<long long> :: iterator it = G[flag[0]].begin(); it != G[flag[0]].end(); ++it);
for(vector<long long> :: iterator it = G[flag[1]].begin(); it != G[flag[1]].end(); ++it) {
vector<long long> :: iterator r = lower_bound(G[flag[0]].begin(), G[flag[0]].end(), *it);
//printf("%lld %lld %d %d\n", *r, *it, r - G[flag[0]].begin(), it - G[flag[1]].begin());
if(r != G[flag[0]].end())ans = mmin(ans, (*r) - (*it));
if(r != G[flag[0]].begin())ans = mmin(ans, (*it) - (*(r - 1)));
}
for(vector<long long> :: iterator it = G[flag[1]].begin(); it != G[flag[1]].end(); ++it) {
vector<long long> :: iterator r = lower_bound(G[flag[2]].begin(), G[flag[2]].end(), *it);
//printf("%lld %lld %d %d\n", *r, *it, r - G[flag[0]].begin(), it - G[flag[1]].begin());
if(r != G[flag[2]].end())rm = mmin(rm, (*r) - (*it));
if(r != G[flag[2]].begin())rm = mmin(rm, (*it) - (*(r - 1)));
}
for(vector<long long> :: iterator it = G[flag[0]].begin(); it != G[flag[0]].end(); ++it) {
vector<long long> :: iterator r = lower_bound(G[flag[2]].begin(), G[flag[2]].end(), *it);
//printf("%lld %lld %d %d\n", *r, *it, r - G[flag[0]].begin(), it - G[flag[1]].begin());
if(r != G[flag[2]].end())lm = mmin(lm, (*r) - (*it));
if(r != G[flag[2]].begin())lm = mmin(lm, (*it) - (*(r - 1)));
}
printf("%lld\n", mmin(ans, lm + rm));
return 0;
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
#endif
// clang-format off
void _print() { cerr << "]\033[0m\n"; }
template <typename T> void __print(T x) { cerr << x; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#ifdef LOCAL
#define debug(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m["; _print(x)
#define debug_arr(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m" << (x) << "\033[0m\n"
#else
#define debug(x...)
#define debug_arr(x...)
#endif
// clang-format on
//}}}
const int N = 2e5 + 10;
int head[N], e;
struct E
{
int v, next;
} edge[N << 1];
void addedge(int u, int v)
{
edge[e].v = v, edge[e].next = head[u];
head[u] = e++;
}
// clang-format off
const int NV = 2e5 + 10;
const LL inf = 0x3f3f3f3f3f3f3f3fll;
LL dis[NV];
bool vis[NV];
queue<int> q;
void bfs(int st) {
clr(dis, 0x3f), clr(vis, false);
dis[st] = 0;
while (!q.empty()) q.pop();
q.push(st);
while (!q.empty()) {
int u = q.front();
q.pop();
if (vis[u]) continue;
vis[u] = true;
for (int i = head[u]; ~i; i = edge[i].next) {
int v = edge[i].v;
if(dis[v] > dis[u] + 1)
{
dis[v] = dis[u] + 1;
q.push(v);
}
}
}
} // clang-format on
int n, m;
int k;
int c[22];
LL g[22][22];
LL dp[1 << 17][18];
LL dfs(int st, int cur)
{
assert((1 << cur) & st);
if (dp[st][cur] != -1) return dp[st][cur];
LL ret = inf;
for (int p = 0; p < k; p++)
{
if (p == cur) continue;
if (((1 << p) & st) == 0) continue;
if (g[p][cur] == inf) continue;
assert((1 << p) & st);
int pre_st = st ^ (1 << cur);
LL predis = dfs(pre_st, p);
if (predis == inf) continue;
LL val = predis + g[p][cur];
ret = min(ret, val);
}
return dp[st][cur] = ret;
}
int main()
{
#ifdef LOCAL
freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
while (cin >> n >> m)
{
clr(head, -1), e = 0;
for (int i = 1; i <= m; ++i)
{
int u, v;
cin >> u >> v;
addedge(u, v);
addedge(v, u);
}
cin >> k;
assert(k >= 1);
assert(k <= 17);
for (int i = 0; i < k; i++) cin >> c[i];
clr(g, 0x3f);
for (int i = 0; i < k; i++)
{
int st = c[i];
bfs(st);
for (int j = 0; j < k; j++)
{
int ed = c[j];
g[i][j] = dis[ed];
}
}
// for (int i = 0; i < k; i++)
//{
// for (int j = 0; j < k; j++)
//{
// debug(i, j, g[i][j]);
//}
//}
clr(dp, -1);
for (int i = 0; i < k; i++) dp[1 << i][i] = 1;
LL ans = inf;
int lim = 1 << k;
for (int i = 0; i < k; i++)
{
LL v = dfs(lim - 1, i);
ans = min(ans, v);
}
if (ans >= inf) ans = -1;
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// your code goes here
ll n;
cin>>n;
ll a[n];
ll aa=0,cc=0,bb=0;
cout<<setprecision(20);
for(int i=0;i<n;i++)
{
cin>>a[i];
a[i]=abs(a[i]);
aa+=a[i];
cc=max(a[i],cc);
bb+=(a[i]*a[i]);
}
//bb=sqrt(bb);
cout<<aa<<endl;
cout<<sqrt(bb)<<endl;
//cout<<bb<<endl;
cout<<cc<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include <numeric>
using namespace std ;
#define ll long long int
#define ull unsigned long long int
#define s(a) scanf("%lld",&a)
#define S(a) scanf("%ull",&a)
#define For(i,n) for(i=0;i<n;i++)
#define FOR(i,n) for(i=1;i<=n;i++)
#define pie acos(-1.0)
//#define cin std::cin
//#define cout std::cout
ll test, flag,R ,gcd_,temp,temp1,G,B,a,b, n,i,p,q,sum,S,l,r, m,Y,z,XD,j,j_1,k,k1,res ,min_ ,flag1,max_,XD1,count_,s_size ;
char ch ,ch_1 ;
string s,s3;
//char s[100010] ;
char c2[520][520];
ll pl,x,y,mi,c,d, u,v ,ans,ans1;
char garbage,garbage1 ;
struct vox{
ll a;
ll index ;
ll b ;
} ;
bool comp(vox x, vox y) {
return x.a < y.a ;
}
bool com(vox x, vox y) {
return x.index < y.index ;
}
ll lcm(ull a, ull b)
{
return (a / __gcd(a, b)) * b;
}
int main()
{
//ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin >> n ;
ll arr[100100] ;
sum = 0 ;
double answer = 0 ;
max_ = 0 ;
for(i=0; i<n;i++) {cin >> arr[i] ;
sum +=abs(arr[i]) ;
answer = answer + (double) pow(abs(arr[i]),2);
if(abs(arr[i])>max_) max_ = abs(arr[i]) ;
}
sort(arr,arr+n) ;
//max_ = arr[n-1] ;
printf("%lld\n",sum);
printf("%.15lf\n", sqrt(answer));
printf("%lld\n",max_);
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <cctype>
#include <cmath>
#include<deque>
#include<map>
#include<algorithm>
#include<iomanip>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,begin,end) for(int i = begin; i < end; i++)
#define all(c) c.begin(), c.end()
#define ll long long
#define INF 2e9
#define INFLL 9223372036854775807
#define cout(n) cout << fixed << setprecision(n)
#define pii pair<int,int>
#define pll pair<long long,long long>
template<typename T>pair<T, T> max_idx(vector<T>& a) { T ans = 0; T index = 0; for (int i = 0; i < a.size(); i++) { if (a[i] > ans) { ans = a[i]; index = i; } }pair<T, T> ret = { ans,index }; return ret; }
template<typename T>pair<T, T> min_idx(vector<T>& a) { T ans = INF; T index = 0; for (int i = 0; i < a.size(); i++) { if (a[i] < ans) { ans = a[i]; index = i; } }pair<T, T> ret = { ans, index }; return ret; }
long long Factorial(int n) { ll sum = 1; for (int i = n; i > 0; i--) { sum *= i; }return sum; }
int main() {
int n, q;
string s;
cin >> n >> s >> q;
vector<int> t(q), a(q), b(q);
rep(i, q)cin >> t[i] >> a[i] >> b[i];
rep(i, q) {
--a[i];
--b[i];
}
bool inv = false;
int half = n;
rep(i, q) {
if (t[i] == 1 && inv) {
if (a[i] < half && b[i] >= half) {
swap(s[half + a[i]], s[b[i] - half]);
}
else if (a[i] < half && b[i] < half) {
swap(s[half + a[i]], s[half + b[i]]);
}
else if (a[i] >= half && b[i] >= half) {
swap(s[a[i] - half], s[b[i] - half]);
}
}
else if (t[i] == 1 && !inv) {
swap(s[a[i]], s[b[i]]);
}
else {
inv = !inv;
}
}
if (inv) {
string news = s.substr(0, half);
s.erase(s.begin(), s.begin()+half);
s += news;
}
cout << s << endl;
}
| // Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>
using namespace std;
#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector
// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << "," \
<< SCALE*(y) + OFFSET_Y << "," \
<< SCALE*(a) + OFFSET_X << "," \
<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << "," \
<< SCALE*(y) + OFFSET_Y << "," \
<< SCALE*(r) << ")" << endl;
typedef long long ll;
typedef complex<double> Point;
typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;
typedef vector<int>::iterator vi_itr;
const int IINF = 1 << 28;
const int MOD = 1e9+7;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);
// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };
int main()
{
int v, t, s, d;
cin >> v >> t >> s >> d;
cout << (v*t <= d && d <= v*s ? "No" : "Yes") << endl;
}
|
//Author: A_S_M_M@sud_P@rvez
#include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define Forn(i,n) for(int i=1;i<=n;i++)
#define Fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#define gcd(a, b) __gcd(a , b)
#define lcm(a,b) (a*(b/__gcd(a,b)))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define Max(a) *max_element(a,a+sizeof(a)/sizeof(a[0]))
#define Min(a) *min_element(a,a+sizeof(a)/sizeof(a[0]))
#define End return 0
#define gt greater<int>()
#define ll long long
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define mod 1e9+7 //1000000007
#define sp(n) fixed<<setprecision(n)
#define YES printf("YES\n")
#define NO printf("NO\n")
#define Erase(s) s.erase(unique(s.begin(),s.end()),s.end())
//%%%%%%%%%%%%%p%%%a%%%r%%%v%%%e%%%z%%%%%%%%%%%%%//
int main()
{
MP;
//int T;cin>>T;while(T--)
{
int a[4];
For(i,4) cin >> a[i];
cout << Min(a);
}
cerr<<endl<<(float)clock()/(float)CLOCKS_PER_SEC<<" sec"<<endl;
End;
}
| #include<bits/stdc++.h>
#define MAX 2000
#define MOD 998244353
using namespace std;
vector<int> v[MAX+10];
bool visited[MAX+10];
int ans = 0;
void dfs(int x)
{
visited[x] = true;
++ans;
for(int y:v[x])
{
if(visited[y])
continue;
dfs(y);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>n>>m;
while(m--)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
visited[j] = false;
dfs(i);
}
cout<<ans<<endl;
return 0;
} |
//compiledef
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(n);i++)
#define per(i, n) for(int i=(n);i>0;i--)
#define repx(i, n, x) for(int i=(x);i<(n);i++)
#define xper(i, n, x) for(int i=(n);i>(x);i--)
#define pback push_back
//c++def
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
int main(){
int n, x;
char buf;
cin >> n >> x;
rep(i, n){
cin >> buf;
if(buf =='o')++x;
else if(x <=0);
else --x;
}
cout << x << endl;
}
| #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<iomanip>
using namespace std;
int main(void){
int N, X;
cin >> N >> X;
string S;
cin >> S;
int ans = X;
for(int i=0;i<N;i++){
if(S[i] == 'o') ans++;
else{
if(ans != 0) ans--;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main()
{
ll N;
cin >> N;
vector<ll> A(N), B(N);
vector<ll> type(2*N+1, 0);
// type.at(i)の値が-1ならi階が始点であること、0なら未確定であること、1なら終点であることを表す
vector<vector<ll>> p(2*N+1, vector<ll>(2*N+1, 0));
// p.at(i).at(j)の値が-1ならi階からj階への移動が不可能であること、
// 0なら可能であること、1なら確定していることを表す
set<ll> source; // 終点が不明な始点の集合
set<ll> target; // 始点が不明な終点の集合
rep(i, N){
cin >> A.at(i) >> B.at(i);
if(A.at(i) != -1){
if(type.at(A.at(i)) != 0){
cout << "No" << endl;
return 0;
}
type.at(A.at(i)) = -1;
}
if(B.at(i) != -1){
if(type.at(B.at(i)) != 0){
cout << "No" << endl;
return 0;
}
type.at(B.at(i)) = 1;
}
if(A.at(i) != -1 && B.at(i) != -1 && A.at(i) >= B.at(i)){
cout << "No" << endl;
return 0;
}
if(A.at(i) != -1 && B.at(i) != -1){
p.at(A.at(i)).at(B.at(i)) = 1;
}
if(A.at(i) != -1 && B.at(i) == -1){
source.insert(A.at(i));
}
if(A.at(i) == -1 && B.at(i) != -1){
target.insert(B.at(i));
}
}
rep2(i, 1, 2*N+1){
rep2(j, 1, i+1){
p.at(i).at(j) = -1;
}
}
for(auto i : source){
for(auto j : target){
p.at(i).at(j) = -1;
}
}
rep(i, 2*N+1){
if(type.at(i) == -1){
rep(j, 2*N+1){
p.at(j).at(i) = -1;
}
}
if(type.at(i) == 1){
rep(j, 2*N+1){
p.at(i).at(j) == -1;
}
}
}
rep(i, N){
if(A.at(i) != -1 && B.at(i) != -1){
rep(k, 2*N+1){
if(k == B.at(i)){
continue;
}
p.at(A.at(i)).at(k) = -1;
}
rep(k, 2*N+1){
if(k == A.at(i)){
continue;
}
p.at(k).at(B.at(i)) = -1;
}
}
}
vector<bool> dp(N+1, false);
// dp.at(i)は最後に区切ったのが2*i階であるということが可能かどうかを表す
dp.at(0) = true;
bool failure = false;
rep(i, N){
rep(j, i+1){
if(!dp.at(j)){
continue;
}
// i+1-j階分移動することは可能か
rep(k, i+1-j){
if(p.at(2*j+1+k).at(j+2+i+k) == -1){
failure = true;
break;
}
}
if(failure){
failure = false;
continue;
}
dp.at(i+1) = true;
break;
}
}
if(dp.at(N)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <cstring>
#include <iostream>
using namespace std;
const int maxn = 210;
int n;
int a[maxn], b[maxn];
int p[maxn], w[maxn]; // p[i] = 1 进电梯， p[i] = 2 出电梯
int f[maxn][maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++) {
if (a[i] != -1) {
if (p[a[i]] != 0)
return cout << "No\n", 0;
else
p[a[i]] = 1;
}
if (b[i] != -1) {
if (p[b[i]] != 0)
return cout << "No\n", 0;
else
p[b[i]] = 2;
}
if (a[i] != -1 && b[i] != -1) {
if (a[i] > b[i]) return cout << "No\n", 0;
w[a[i]] = w[b[i]] = b[i] - a[i];
}
}
// cout << 1 << endl;
for (int len = 1; len <= n; len++) {
for (int i = 1; i + 2 * len - 1 <= 2 * n; i += 2) { //区间的长度为偶数，左区间一定是奇数
int j = 2 * len + i - 1;
f[i][j] = 1;
for (int k = i; k < i + len; k++) {
if (p[k] == 2) f[i][j] = 0;
if (w[k] && w[k] != len) f[i][j] = 0;
if (!w[k] && p[k] == 1 && p[k + len] == 2) f[i][j] = 0;
}
for (int k = i + len; k <= j; k++) {
if (p[k] == 1) f[i][j] = 0;
if (w[k] && w[k] != len) f[i][j] = 0;
// if (!w[k] && p[k] == 2 && p[k - len] == 1) f[i][j] = 0;
}
for (int k = i + 1; k < j; k += 2)
if (f[i][k] && f[k + 1][j]) f[i][j] = 1;
}
}
// cout << f[1][4] << f[3][4] << f[5][6] << endl;
if (f[1][2 * n])
cout << "Yes\n";
else
cout << "No\n";
return 0;
} |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template<typename Arg, typename... Args> void my_dbg(Arg A, Args... B)
{ cout << ' ' << A; my_dbg(B...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define ll long long
#define dd double
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define show(a) for(auto xy: a) pri(xy); printf("\n");
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define tc int tt; scf(tt); while(tt--)
#define inf INT_MAX
#define ninf INT_MIN
#define gcd __gcd
#define bitcount(n) __builtin_popcount(n)
const int mod=1e9+7;
const int N = 1e6+7;
int pos[N];
int main()
{
int n; scf(n);
vector<ll>a(n),b(n);
vector<int>ind(n);
iota(all(ind),0);// iterates and fill with increaing values
//0 1 2 3 4.......
ll A=0,B=0,tmp;
rep(i,0,n)
lscf(a[i]),lscf(b[i]);
sort(all(ind),[&](const int &i , const int &j)
{
return (2*a[i]+b[i]>2*a[j]+b[j]);
}); // net effect 2*a[k] + b[k] in town of speech
A=accumulate(all(a),0ll);
int c=0,d=0;
rep(i,0,n)
{
if(B>A)
break;
c++;
int j=ind[i];
B+=b[j]+a[j];
A-=a[j];
}
prin(c);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
//Nの入力
long N=0;
cin >> N;
//町の青木派と高橋派を入力
int64_t A[N],B[N],Total[N];
int64_t sum_A = 0;
int64_t sum_B = 0;
//それぞれの派の合計
for(long i=0; i<N; ++i){
cin >> A[i] >> B[i];
Total[i] = 2*A[i] + B[i];
sum_A += A[i];
sum_B += B[i];
}
//cout << "sum_A:" << sum_A << endl;
//cout << "sum_B:" << sum_B << endl;
long count = 0;
std::sort(Total, Total+N, std::greater<>());
//for(long i=0; i<N; ++i) cout << Total[i] << endl;
long temp_sum = 0;
for(long i=0; i<N; ++i){
//cout << A[i] << endl;
temp_sum += Total[i];
count++;
if(sum_A < temp_sum)break;
}
cout << count << endl;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n,q;
cin>>n>>q;
ordered_set s;
rep(i,0,n){
int x; cin>>x;
s.insert({x,i});
}
rep(i,0,q){
int k;
cin>>k;
int L=1,U=2e18+5,ans;
while(L<=U){
int m=(L+U)/2;
int cnt=s.order_of_key({m+1,-1});
if(m-cnt>=k){
ans=m;
U=m-1;
}else L=m+1;
}
cout<< ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 1000000007;
const double pi = acos(-1);
ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);}
ll lcm(ll a, ll b) {return a*b/gcd(a,b);}
int main() {
int H,W; cin >> H >> W;
vector<string> S(H); REP(i,H) cin >> S[i];
int ans = 0;
REP(i,H) REP(j,W) {
if(i+1 >= H || j+1 >= W) continue;
int cnt = 0;
REP(k,2) REP(l,2) {
if(S[i+k][j+l] == '.') cnt++;
}
if(cnt%2 != 0) ans++;
}
cout << ans << endl;
return 0;
} |
Subsets and Splits