code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) a ; i >= b ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int; // watch out for overflows in your code
using pii = pair<int,int>;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void debug() { cout << "\n"; };
template <typename T, typename... Targs>
void debug(T t, Targs... args) {
cout << t << " ";
debug(args...);
}
template <typename T1, typename T2>
inline ostream& operator << (ostream& os, const pair<T1,T2>& p) {
return os << "(" << p.F << ", " << p.S << ")";
}
template <typename T>
inline ostream& operator << (ostream& os, const vec<T>& v) {
for(auto& t : v) {
os << t << " ";
}
return os;
}
template <typename T>
inline ostream& operator << (ostream& os, const vec<vec<T>>& m) {
for(auto& v : m) {
for(auto& t : v) {
os << t << " ";
}
os << "\n";
}
return os;
}
template <typename T>
inline ostream& operator << (ostream& os, const set<T>& v) {
for(auto& t : v) {
os << t << " ";
}
return os;
}
template <typename K, typename V>
inline ostream& operator << (ostream& os, const map<K,V>& m) {
for(auto& p : m) {
os << p.F << " -> " << p.S << "\n";
}
return os;
}
int N;
vec<int> A;
vec<int> C;
void color() {
vec<int> B(A.begin(), A.end());
sort(B.begin()+1, B.end());
map<int, deque<int>> idx;
ffor(i, 1, 2*N) {
idx[B[i]].PB(i);
}
C.assign(2*N+1, -1);
ffor(i, 1, 2*N) {
auto& dq = idx[A[i]];
if(dq.front() >= N+1) {
C[i] = 1; // 1 == black
}
else {
C[i] = 0; // 0 == white
}
dq.pop_front();
}
}
vec<char> ans;
void compute() {
ans.assign(2*N+1, '.');
stack<int> s;
ffor(i, 1, 2*N) {
if(s.empty()) {
s.push(i);
}
else if(C[s.top()] != C[i]){
ans[s.top()] = '(';
ans[i] = ')';
s.pop();
}
else {
s.push(i);
}
}
}
////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
A.assign(2*N+1, 0);
ffor(i, 1, 2*N) {
cin >> A[i];
}
color();
compute();
ffor(i, 1, 2*N) {
cout << ans[i];
}
cout << "\n";
}
| #include "bits/stdc++.h"
using namespace std;
typedef long double ld;
typedef long long ll;
#define sz(x) (int)(x).size()
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define f first
#define s second
template<typename T, typename U> bool ckmin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool ckmax(T &a, const U &b){ return b > a ? a = b, true : false; }
int n;
string res;
vector<int> v, pv;
vector<array<int, 2>> a;
map<int, vector<int>> st1, st0;
inline int qry(int l, int r){
return pv[r + 1] - pv[l];
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n; n <<= 1; a.assign(n, {0, 0});
v.assign(n, 0); pv.assign(n + 1, 0);
res.assign(n, '.');
for(int i = 0; i < n; ++i){
cin >> a[i][0]; a[i][1] = i;
}
sort(a.begin(), a.end());
for(int i = 0; i < n; ++i){
if(i < n/2) v[a[i][1]] = 1;
else v[a[i][1]] = -1;
}
for(int i = 0; i < n; ++i){
pv[i + 1] = pv[i] + v[i];
}
assert(qry(0, n - 1) == 0);
for(int i = n - 1; i >= 0; --i){
if(v[i] == -1) st0[qry(0, i)].push_back(i);
else st1[qry(0, i)].push_back(i);
}
for(int i = 0; i < n; ++i){
if(res[i] != '.') continue;
res[i] = '(';
if(v[i] == -1){
int pos = qry(0, i - 1);
res[st1[pos].back()] = ')';
st1[pos].pop_back();
st0[qry(0, i)].pop_back();
}
else{
int pos = qry(0, i - 1);
res[st0[pos].back()] = ')';
st0[pos].pop_back();
st1[qry(0, i)].pop_back();
}
}
cout << res;
return 0;
} |
#include <bits/stdc++.h>
#define poi 100
#define int long long
using namespace std;
typedef long long ll;
typedef double db;
char a[poi], b[poi];
int Ahave[poi], Bhave[poi], tothave[poi];
inline int re()
{
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9')
{
if (c == '-')
k = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + c - '0', c = getchar();
return k * x;
}
void wr(int x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
wr(x / 10);
putchar(x % 10 + '0');
}
inline int ksm(int x, int y)
{
int ans = 1;
for (; y; y >>= 1)
{
if (y & 1)
ans = (ans * x);
x = (x * x);
}
return ans;
}
int getAscore(int x)
{
int ans = 0;
Ahave[x]++;
for (int i = 1; i <= 9; i++)
ans += i * ksm(10, Ahave[i]);
Ahave[x]--;
return ans;
}
int getBscore(int x)
{
int ans = 0;
Bhave[x]++;
for (int i = 1; i <= 9; i++)
ans += i * ksm(10, Bhave[i]);
Bhave[x]--;
return ans;
}
signed main()
{
int k = re();
db winCase = 0, totCase = 0;
scanf("%s%s", a, b);
for (int i = 0; i < 4; i++)
{
Ahave[a[i] - '0']++;
Bhave[b[i] - '0']++;
tothave[a[i] - '0']++;
tothave[b[i] - '0']++;
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
int Ascore = getAscore(i);
int Bscore = getBscore(j);
int thisCase = max(0ll, k - tothave[i]);
thisCase *= max(0ll, k - tothave[j]);
if (i == j)
thisCase = max(0ll, k - tothave[i]) * max(0ll, k - tothave[i] - 1);
if (Ascore > Bscore)
winCase += thisCase;
totCase += thisCase;
}
printf("%.7f", winCase / totCase);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<T> &v){
for(int i=0; i<v.size(); i++) is >> v[i];
return is;
}
#ifdef DBG
void debug_(){ cout << endl; }
template<typename T, typename... Args>
void debug_(T&& x, Args&&... xs){
cout << x << " "; debug_(forward<Args>(xs)...);
}
#define dbg(...) debug_(__VA_ARGS__)
#else
#define dbg(...)
#endif
bool dfs(int u, int c, int s, vector<vector<int>> &a, vector<int> &cs){
int n = a.size();
cs[u] = c;
for(int v=0; v<n; v++){
if(s>>v&1) continue;
if(a[u][v]==0) continue;
if(cs[v]==c) return false;
if(cs[v]<0){
if(!dfs(v, 1-c, s, a, cs)){
return false;
}
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cout << setprecision(20) << fixed;
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(n));
for(int i=0; i<m; i++){
int x, y;
cin >> x >> y;
a[x-1][y-1] = 1;
a[y-1][x-1] = 1;
}
ll ans = 0;
for(int s=0; s<(1<<n); s++){
bool ok = true;
for(int i=0; i<n; i++){
if((s>>i&1)==0) continue;
for(int j=i+1; j<n; j++){
if((s>>j&1)==0) continue;
if(a[i][j]) ok = false;
}
}
if(!ok) continue;
ll x = 1;
vector<int> cs(n, -1);
for(int i=0; i<n; i++){
if(s>>i&1) continue;
if(cs[i]>=0) continue;
if(dfs(i, 0, s, a, cs)){
x *= 2;
} else {
x = 0;
}
}
dbg(s, x);
ans += x;
}
cout << ans << endl;
return 0;
} |
/* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(i,x,y) for(int i = (x) ; i <= (y) ; i++)
#define repD(i,x,y) for(int i = (x) ; i >= (y) ; i--)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define setval(a,val) memset(a,val,sizeof(a))
#define Randomize mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define trav(x , a) for(auto &x : a)
#define sz(a) ((int)a.size())
typedef long long ll ;
#define int ll
using namespace std;
const int N = 3e5 +5 ;
const int mod = 1e9 + 7 ;
const ll inf = 1e18 ;
const int SZ = 101 ;
const double eps = 1e-9 ;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ;
typedef pair<int, int> pii;
typedef pair<int , pii> ipii ;
typedef pair<pii , int> piii ;
typedef unsigned long long ull ;
typedef long double ld;
ll po(ll x,ll y,ll p = mod) {ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
bool cmp(pii& a, pii& b){
return 1LL * (a.ff + 2LL * a.ss) > 1LL * (b.ff + 2LL * b.ss);
}
void solve()
{
int n ;
cin >> n ;
vector<pii> v(n);
rep(i , n) cin >> v[i].ss >> v[i].ff;
sort(all(v) , cmp);
int cur = 0;
rep(i , n) cur -= v[i].ss;
for(int i = 0 ; i < n ; ++i){
cur += v[i].ss * 2 + v[i].ff;
if(cur > 0){
cout << i + 1;
return;
}
}
}
int32_t main(int32_t argc, char *argv[])
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int TC = 1, t = 0;
//cin >> TC ;
while(t++ < TC)
{
//cout << "Case #" << t << ": " ;
solve();
cout << "\n" ;
}
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 pair<int, int> pii;
typedef pair<ll, ll> pll;
#define vt vector
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define sz(x) int(x.size())
#define uset unordered_set
#define umap unordered_map
#define ins insert
const int inf = 0x3f3f3f3f, mod = 1e9+7, mx = 2e5+10;
const ll infll = 0x3f3f3f3f3f3f3f3f;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
vector<array<int, 3>> a;
for(int i=0; i < n; i++){
int t, l, r;cin >> t >>l >> r;
if(t==1){
a.pb({l, r, t});
}else if(t==2){
a.pb({l, r-1, t});
}else if(t==3){
a.pb({l+1, r, t});
}else{
a.pb({l+1, r-1, t});
}
}
int ans =0 ;
sort(all(a));
for(int i=0; i < a.size(); i++){
for(int j=i+1; j < a.size(); j++){
auto [l, r, t]= a[i];auto [L, R, T] = a[j];
if(r >= L){
ans++; continue;
}
int tmp = r, tmp1 = L;
if(t==2 || t==4){
tmp++;
}
if(T==3||T==4)tmp1--;
if(tmp > tmp1)ans++;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
#define pqi priority_queue<int>
#define test int tcase; cin>>tcase; for(int tc = 1; tc <= tcase; tc++)
#define inp(a,n,f) int a[n+f];for(int hh=f;hh<n+f;hh++)cin>>a[hh];
#define printdecimal(k) cout<<fixed<<setprecision(k);
#define mem(a,k) memset(a,k,sizeof(a))
#define ub upper_bound
#define lb lower_bound
#define all(v) v.begin(),v.end()
#define mod (int)(1e9+7)
#define inf LLONG_MAX
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int exp(int x,int y){int res=1;x=x%mod;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int modinv(int x){return exp(x,mod-2);}
int add(int a,int b){a%=mod,b%=mod;a=((a+b)%mod+mod)%mod;return a;}
int sub(int a,int b){a%=mod,b%=mod;a=((a-b)%mod+mod)%mod;return a;}
int mul(int a,int b){a%=mod,b%=mod;a=((a*b)%mod+mod)%mod;return a;}
#define N (int)(2e6+6)
struct segtree
{
int size;
vector<int> values;
void ini(int n)
{
size=1;
while(size<n)
size*=2;
values.assign(2*size,1);
}
void set(int i,int v,int cur,int lx,int rx)
{
if(rx-lx==1)
{
values[cur]=v;
return;
}
int m=(lx+rx)/2;
if(i<m) set(i,v,2*cur+1,lx,m);
else set(i,v,2*cur+2,m,rx);
values[cur]=max(values[2*cur+1],values[2*cur+2]);
}
void set(int i,int v)
{
set(i,v,0,0,size);
}
int cal(int v,int cur,int lx,int rx)
{
if(values[cur]<v) return -1;
if(rx-lx==1) return lx;
int m=(lx+rx)/2;
int val=cal(v,2*cur+1,lx,m);
if(val==-1) return cal(v,2*cur+2,m,rx);
return val;
}
int cal(int v)
{
return cal(v,0,0,size);
}
};
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
for(int i=0;i<100;i++){}
int n,m;
cin>>n>>m;
segtree st;
st.ini(N);
inp(a,n,0);
int h[n+1]={0};
for(int i=0;i<m-1;i++)
st.set(a[i],0),h[a[i]]++;
int ans=inf;
for(int j=m-1,i=0;j<n;j++,i++)
{
if(h[a[j]]==0) st.set(a[j],0);
h[a[j]]++;
int idx=st.cal(1);
ans=min(ans,idx);
h[a[i]]--;
if(h[a[i]]==0) st.set(a[i],1);
}
for(int i=0;i<100;i++){}
cout<<ans;
return 0;
} | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <iomanip> //setprecision
#include <map> // map
#include <unordered_map> //unordered_map
#include <queue> // queue, priority_queue
#include <set> // set,multiset
#include <stack> // stack
#include <deque> // deque
#include <math.h>//pow,,,
#include <cmath>//abs,,,
#include <bitset> // bitset
#include <numeric> //accumulate,,,
#include <sstream>
#define endl "\n";
using namespace std;
using PLL = pair<long long,long long>;
typedef tuple<long long,long long,long long> TUP;
using P = pair<int,int>;
const long long INF = 4000000000000000001;
const int inf = 1001001001;
const long long MOD = 998244353;
//Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M, long long mod) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % mod, M / 2,mod);
//When end-of-a bit is 1, times simple N.
if (M & 1) res = (res * N) % mod;
return res %= mod;
}
long long gcd(long long a, long long b) {
if (b == 0) return a; else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b ;
}
long long get_mod(long long res){
if(res < 0) res += MOD;
return res % MOD;
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int T;T = 1;
vector<long long> ans;
for(int t = 0;t<T;t++){
long long X,Y,A,B,C,D;cin >> X >> Y;
if(X == Y){
ans.push_back(0);
break;
}
A = 1,B = 1,C = 1,D = 1;
map<long long,long long> cost;
cost[Y] = 0;
cost[X] = INF;
priority_queue<PLL,vector<PLL>,greater<PLL>> Q;
Q.push(make_pair((long long)0,Y));
while(!Q.empty()){
long long now = Q.top().second , c = Q.top().first; Q.pop();
if(cost.count(0) && c > cost[X]) break;
//-1繰り返し
if(abs(X-now)*D+c > 0) cost[X] = min(cost[X],abs(X-now)*D + c);
//2倍
long long c2 = now + 2-(now%2);
if(cost.count(c2/2)) {
if(abs(now-c2)*D + c + A > 0){
if(cost[c2/2] > abs(now-c2)*D + c + A) Q.push(make_pair(abs(now-c2)*D + c + A , c2/2));
cost[c2/2] = min(cost[c2/2], (abs(now-c2)*D) + c + A);
}
}
else{
if(abs(now-c2)*D + c + A > 0){
Q.push(make_pair(abs(now-c2)*D + c + A , c2/2));
cost[c2/2] = (abs(now-c2)*D) + c + A;
}
}
c2 -= 2;
if(cost.count(c2/2)) {
if(abs(now-c2)*D + c + A > 0){
if(cost[c2/2] > abs(now-c2)*D + c + A) Q.push(make_pair(abs(now-c2)*D + c + A , c2/2));
cost[c2/2] = min(cost[c2/2], (abs(now-c2)*D) + c + A);
}
}
else{
if(abs(now-c2)*D + c + A > 0){
Q.push(make_pair(abs(now-c2)*D + c + A , c2/2));
cost[c2/2] = (abs(now-c2)*D) + c + A;
}
}
}
/*for(auto P : cost){
cout << P.first << " " << P.second << endl;
}*/
ans.push_back(cost[X]);
}
for(long long OUTPUT : ans) cout << OUTPUT << endl;
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef vector<bool> VB;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) LL((a).size())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define ROF(i,a,b) for(LL i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL LARGE_INT = 1e9+100;
const LL INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const LL MOD = 1e9+7;
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
LL modpow(LL a, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
void Main()
{
LL a,b,c,d;cin>>a>>b>>c>>d;
cout<<b-c<<endl;
return;
}
int main()
{
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b;
cin>>c>>d;
cout<<b-c;
} |
// Author : heyuhhh
// Created Time : 2020/11/11 10:33:54
#include<bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
//head
struct node {
ll i, v;
};
map<ll, ll> mp[51];
void run() {
int n;
ll x;
cin >> n >> x;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
queue<node> que;
que.push({0, x});
mp[0][x] = 1;
ll ans = 0;
while (!que.empty()) {
node cur = que.front(); que.pop();
int i = cur.i;
ll v = cur.v;
if (mp[i].find(v) == mp[i].end()) {
continue;
}
ll res = mp[i][v];
mp[i].erase(v);
if (i + 1 == n) {
ans += res;
continue;
}
// a[i + 1] | (v + k * a[i])
ll nd = a[i + 1];
ll t1 = v / nd * nd, t2 = (v + nd - 1) / nd * nd;
if ((v - t1) % a[i] == 0) {
mp[i + 1][t1] += res;
que.push({i + 1, t1});
}
if (t1 != t2) {
if ((t2 - v) % a[i] == 0) {
mp[i + 1][t2] += res;
que.push({i + 1, t2});
}
}
}
cout << ans << '\n';
}
int main() {
#ifdef Local
freopen("input.in", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(20);
run();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 5e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b%a, a);
}
int lcm(int a, int b) {
return (a*b)/gcd(a,b);
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int find(int x) {
return x == parent[x] ? x : parent[x] = find(parent[x]);
}
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if(xPar != yPar) parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for(ll i=1;i<=r;i++) {
res = res * (n - r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
int msbPos(int n) {
if(n == 0) return 0;
int msbPos = 0;
n /= 2;
while(n != 0) {
n /= 2;
msbPos++;
}
return msbPos;
}
void solve() {
int a, b;
cin >> a >> b;
int y = (a - b) / 2;
int x = a - y;
cout << x << " " << y << endl;
return;
}
int main()
{
IOS
/*int t;
cin >> t;
while(t--) solve();*/
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define N 1005
using namespace std;
int n,m,f[N][N],ans=-1;
struct z{
int to,w;
};vector<z>b[N];
queue<z>q;
bool ok[N][N];
void bfs(){
memset(f,-1,sizeof(f)),f[1][n]=0,q.push((z){1,n});
while(!q.empty()){
int x=q.front().to,y=q.front().w;q.pop();
if(~ans&&ans<=f[x][y]*2)break;
if(x==y){ans=f[x][y]*2;break;}
if(ok[x][y])ans=f[x][y]*2+1;
for(int i=0;i<b[x].size();i++)for(int j=0;j<b[y].size();j++)if(b[x][i].w==b[y][j].w){
int A=b[x][i].to,B=b[y][j].to;
if(f[A][B]<0)f[A][B]=f[x][y]+1,q.push((z){A,B});
}
}cout<<ans;
}
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int x,y;char s[2];
scanf("%d%d%s",&x,&y,s);b[x].push_back((z){y,(int)s[0]}),b[y].push_back((z){x,(int)s[0]});ok[x][y]=1,ok[y][x]=1;
}bfs();
} | #include<bits/stdc++.h>
using namespace std;
const int N=505;
int f[N][N];
int a[N][N],b[N][N];
struct qw{
int x,y,v;
bool operator < (const qw &w) const
{
return v>w.v;
}
};
priority_queue<qw> heap;
int vis[N][N];
int n,m;
int check(int x,int y)
{
if(x<1||x>n||y<1||y>m) return 0;
return 1;
}
void dij()
{
int nx,ny;
while(heap.size())
{
qw t=heap.top();
heap.pop();
int x=t.x,y=t.y;
if(x==n&&y==m) break;
if(vis[x][y]) continue;
vis[x][y]=1;
nx=x,ny=y+1;
if(check(nx,ny)&&f[nx][ny]>f[x][y]+a[x][y])
{
f[nx][ny]=f[x][y]+a[x][y];
heap.push((qw){nx,ny,f[nx][ny]});
}
nx=x,ny=y-1;
if(check(nx,ny)&&f[nx][ny]>f[x][y]+a[x][y-1])
{
f[nx][ny]=f[x][y]+a[x][y-1];
heap.push((qw){nx,ny,f[nx][ny]});
}
nx=x+1,ny=y;
if(check(nx,ny)&&f[nx][ny]>f[x][y]+b[x][y])
{
f[nx][ny]=f[x][y]+b[x][y];
heap.push((qw){nx,ny,f[nx][ny]});
}
for(int i=1;i<x;i++)
if(f[x-i][y]>f[x][y]+i+1)
{
f[x-i][y]=f[x][y]+i+1;
heap.push((qw){x-i,y,f[x-i][y]});
}
}
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m-1;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=n-1;i++)
for(int j=1;j<=m;j++)
scanf("%d",&b[i][j]);
memset(f,0x3f,sizeof(f));
f[1][1]=0;
heap.push((qw){1,1,0});
dij();
cout<<f[n][m];
return 0;
} |
// clang-format off
#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;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef gp_hash_table<int, int> umap;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> oset;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pii> vii;
#define INF 10000000000000000
#define inf 1000000000
// #define MOD 1000000007
#define MOD 998244353
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define all(ar) ar.begin(), ar.end()
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar)) // 0x3f for inf, 0x80 for -INF can also use with pairs
#ifdef godfather
template<typename T>
void __p(T a) { cout << a << " "; }
template<typename T>
void __p(std::vector<T> a) { cout << "{ "; for (auto p : a) __p(p); cout << "}"; }
template<typename T, typename F>
void __p(pair<T, F> a) { cout << "{ "; __p(a.first); __p(a.second); cout << "}"; }
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) { __p(a1); __p(a...); }
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout<<name<<" : ";__p(arg1);cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket=0,i=0;
for(; ;i++)
if(names[i]==','&&bracket==0)
break;
else if(names[i]=='(')
bracket++;
else if(names[i]==')')
bracket--;
const char *comma=names+i;
cout.write(names,comma-names)<<" : ";
__p(arg1);
cout<<"| ";
__f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define trace(...)
#define end_routine()
#endif
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
#define rand(l, r) uniform_int_distribution<int>(l, r)(rng32)
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll modpow(ll b, ll e, ll mod=MOD) {
ll ans=1; for(;e;b=b*b%mod,e/=2) if(e&1) ans=ans*b%mod; return ans; }
ld modp(ld b, ll e) {
ld ans=1; for(;e;b=b*b,e/=2) if(e&1) ans=ans*b; return ans; }
void solve()
{
// START
ll n;
cin>>n;
vi vec(n);
rep(i,n)cin>>vec[i];
sort(all(vec));
ll ans=0;
frr(i,n-1,0){
ll z=vec[i];
ll lg=n-i-1;
ans+=i*z-lg*z;
}
cout<<ans<<"\n";
// END
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0), cout.precision(15); cout<<fixed;
#ifdef godfather
// cin.exceptions(cin.failbit);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
// cin>>t;
fr(i,1,t)
{
solve();
}
end_routine();
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
sort(ALL(a), greater<ll>());
ll ans = 0;
rep(i,n){
ans += a[i]*(n-i-1);
ans -= a[i]*i;
}
cout << ans << endl;
return 0;
} |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀⠀⠀⠹⣿⣷⣄⠀⣿⣿⣿⣿⠀⣠⣾⣿⠏⠀⠀⠀⠀⠀⠀⢸⠀
⠀⠁⠀⠀⠀⠀⠀⠀⠀⠈⠻⢿⢇⣿⣿⣿⣿⡸⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠈⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣼⣿⣿⣿⣿⣧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠐⢤⣀⣀⢀⣀⣠⣴⣿⣿⠿⠋⠙⠿⣿⣿⣦⣄⣀⠀⠀⣀⡠⠂⠀⠀⠀
⠀⠀⠀⠀⠀⠈⠉⠛⠛⠛⠛⠉⠀⠀⠀⠀⠀⠈⠉⠛⠛⠛⠛⠋⠁⠀⠀
**/
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define nl cout<<"\n";
#define ll long long int
#define ld double
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define F(i,a,b) for(ll i=a;i<b;i++)
//#include <ext/pb_ds/assoc_container.hpp> // policy based data structure header files
//#include <ext/pb_ds/tree_policy.hpp> // policy based data structure header files
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
//using namespace __gnu_pbds; // for pbds
//#define ordered_set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> // have functions like order_of_key, find_by_order
const double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781641;
const ll M=1e18;
const ll MAXN=100200;
void solve()
{
vector<ll> v(3);
F(i,0,3) {
cin>>v[i];
}
sort(all(v));
cout<<(v[1]+v[2]);
}
int main()
{
IOS
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif // ONLINE_JUDGE*/
ll test=1;
// cin>>test;
F(t,1,test+1) {
//cout<<"Case #"<<t<<": ";
solve();
nl
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin >> a;
a%=100;
cout << 100-a << endl;
}
|
//----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unordered_set<ll> usll;
typedef unordered_multiset<ll> umsll;
typedef multiset<ll> msll;
typedef set<ll> sll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll> pqll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef unordered_multiset<int> umsi;
typedef unordered_set<int> usi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
typedef priority_queue<int> pqi;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ind_si;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ind_sll;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ind_msi;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ind_msll;
#define in insert
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define be begin
#define en end
#define itr iterator
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define mo 1000000007
#define inf 8222372026854775807
#define ninf -inf
#define ima 1147483647
#define imi -ima
#define oncnt __builtin_popcount
#define zerobegin __builtin_clz
#define zeroend __builtin_ctz
#define parity __builtin_parity
#define all(x) x.be(),x.en()
#define eps 1e-9
#define coutd cout<<setprecision(10)<<fixed
#define mems(dp,x) memset(dp,x,sizeof(dp))
#define fbo find_by_order
#define ook order_of_key
#define upb upper_bound
#define lowb lower_bound
#define lte(v,x) (upb(all(v),x)-v.be())
#define gte(v,x) (v.end()-lowb(all(v),x))
#define gt(v,x) (v.en()-upb(all(v),x))
#define lt(v,x) (lowb(all(v),x)-v.be())
const ld PI= 3.1415926535897932384626433832792884197169399375105820974944;
inline ll modpow(ll x,ll n){if(n==0)return 1;if(x==0)return 0;if(n==1)return(x%mo);ll u=(modpow(x,n/2));u=(u*u)%mo;if(n%2!=0)u=(u*x%mo)%mo;return u;}
inline ll modinv(ll x){return modpow(x,mo-2);}
inline ll mmul(ll a,ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;if(a*b>=mo)return(a*b)%mo;return(a*b);}
inline ll madd(ll a, ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;if(a+b>=mo)return(a+b)%mo;return(a+b);}
inline ll msub(ll a, ll b){if(a>=mo)a=a%mo;if(b>=mo)b=b%mo;return(((a-b)%mo+mo)%mo);}
inline ll mdiv(ll a,ll bb){if(a>=mo)a=a%mo;ll b=modinv(bb);if(b>=mo)b=b%mo;if(a*b>=mo)return(a*b)%mo;return(a*b);}
inline ll gcd(ll a,ll b){return __gcd(a,b);}
inline ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
int main()
{ io
int testcases=1; // cin>>testcases;
/*preprocess begin*//*preprocess end*/
while(testcases--)
{
ll n;
cin>>n;
vll v;
for(ll i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
ll k=n/i;
v.pb(i);
if(k!=i)
v.pb(k);
}
}
sort(all(v));
for(int i=0;i<v.size();i++)cout<<v[i]<<"\n";
}return 0;}
| #include<bits/stdc++.h>
using namespace std;
#define MAXN 300005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x7f7f7f7f;
const LL jzm=2333;
const double Pi=acos(-1.0);
typedef pair<int,int> pii;
const double PI=acos(-1.0);
template<typename _T>
_T Fabs(_T x){return x<0?-x:x;}
template<typename _T>
void read(_T &x){
_T f=1;x=0;char s=getchar();
while(s>'9'||s<'0'){if(s=='-')f=-1;s=getchar();}
while('0'<=s&&s<='9'){x=(x<<3)+(x<<1)+(s^48);s=getchar();}
x*=f;
}
template<typename _T>
void print(_T x){if(x<0){x=(~x)+1;putchar('-');}if(x>9)print(x/10);putchar(x%10+'0');}
int n,a[MAXN];LL ans;
map<LL,int> mp;
signed main(){
read(n);for(int i=1;i<=n;i++)read(a[i]);LL sum=0;mp[0]++;
for(int i=1;i<=n;i++){
if(i&1)sum+=1ll*a[i];else sum-=1ll*a[i];
ans+=mp[sum];mp[sum]++;
}
printf("%lld\n",ans);
return 0;
}
/*
*/
|
// Problem: A - Slot
// Contest: AtCoder - AtCoder Beginner Contest 189
// URL: https://atcoder.jp/contests/abc189/tasks/abc189_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp(aa,bb) make_pair(aa,bb)
#define _for(i,b) for(int i=(0);i<(b);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define X first
#define Y second
#define lowbit(a) (a&(-a))
#define debug(a) cout<<#a<<":"<<a<<"\n"
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
const int N=100010;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-6;
const double PI=acos(-1.0);
void solve(){
string s;
cin>>s;
if(s[0]==s[1]&&s[0]==s[2]) cout<<"Won\n";
else cout<<"Lost\n";
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
// int t;cin>>t;while(t--)
solve();
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
if(s.at(0)==s.at(1)&&s.at(0)==s.at(2))
cout<<"Won";
else
cout<<"Lost";
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define pb push_back
#define f first
#define s second
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#define rep(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int arr[801][801];
int n,k;
bool check(int num)
{
vector<vector<int> >v(n,vector<int>(n,0));
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(arr[i][j]<=num) v[i][j]=1;
}
}
vector<vector<int> >dp(n+1,vector<int>(n+1,0));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]+v[i-1][j-1];
}
}
for(int i=0;i+k<=n;i++){
for(int j=0;j+k<=n;j++){
int total = dp[i+k][j+k] - dp[i][j+k] - dp[i+k][j] + dp[i][j];
if(total >= (k*k+1)/2) return true;
}
}
return false;
}
void solve()
{
cin>>n>>k;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
cin>>arr[i][j];
}
}
int start=0,end=1e9+1,mid;
while(start<end)
{
mid=(start+end)/2;
if(check(mid)) end=mid;
else start=mid+1;
}
cout<<end;
}
int main()
{
fast
int t;
t=1;
//cin>>t;
while(t--)
{
solve();
}
return 0;
}
| //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 800 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////
int N,K,g[MX][MX];
bool check(int k){
int a[N][N];
FOR(i,0,N) FOR(j,0,N) a[i][j]=(g[i][j]<=k);
FOR(i,0,N) FOR(j,0,N){
if(i) a[i][j]+=a[i-1][j];
if(j) a[i][j]+=a[i][j-1];
if(i&&j) a[i][j]-=a[i-1][j-1];
}
FOR(i,K-1,N) FOR(j,K-1,N){
int x=a[i][j];
if(i-K>=0) x-=a[i-K][j];
if(j-K>=0) x-=a[i][j-K];
if(i-K>=0 && j-K>=0) x+=a[i-K][j-K];
if(x>=(K*K+1)/2) return 1;
}
return 0;
}
int32_t main() {
boost; IO();
cin>>N>>K;
FOR(i,0,N) FOR(j,0,N) cin>>g[i][j];
int l=0,r=INF,ans;
while(l<=r){
int m=(l+r)/2;
if(check(m)){
ans=m;
r=m-1;
}
else l=m+1;
}
cout << ans << endl;
return 0;
}
//Change your approach |
#include <bits/stdc++.h>
using namespace std;
//a枚ある金貨がn回で100枚になって終わる確率
long double prob(int n, int a, int b, int c){
int u = 100 - a;
if(u > n) return(0.0);
if(n - u > (99-b) + (99-c)) return(0.0);
long double p = 1.0;
for(int i=0; i<u; i++){ p *= ((long double)(a+i)/(long double)(a+b+c+i)); }
long double ret = 0.0;
for(int v = 0; v<=n-u; v++){
int w = n - u - v;
long double s = 1.0;
if(v+b > 99 || w+c > 99) continue;
for(int j=0; j<v; j++){ s *= ((long double)(b+j)/(long double)(a+b+c+u+j)); }
for(int j=0; j<w; j++){ s *= ((long double)(c+j)/(long double)(a+b+c+u+v+j)); }
long double h = 1.0;
for(int j=v; j>=1; j--){ h *= ((long double)(u-1+j)/(long double)j); }
for(int j=w; j>=1; j--){ h *= ((long double)(u-1+v+j)/(long double)j); }
ret += (p*s*h);
}
return ret;
}
int main(int argc, char* argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C; cin >> A >> B >> C;
long double ans = 0.0;
for(int n=1; n<=300; n++){
long double pa = prob(n, A, B, C);
long double pb = prob(n, B, C, A);
long double pc = prob(n, C, A, B);
ans += n*(pa + pb + pc);
}
printf("%.12Lf\n", ans);
return 0;
} | #include <iostream>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
using namespace std;
const int INF = 1 * (1 << 30);
const int mINF = -1 * (1 << 30);
int main()
{
double ans = 0;
int n, d, h;
cin >> n >> d >> h;
for (int i = 0; i < n; i++)
{
int d_i, h_i;
cin >> d_i >> h_i;
double b = (double)h - (double)d * (double)(h - h_i) / (double)(d - d_i);
ans = max((double)ans, b);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// int/long: -2,147,483,648 - 2,147,483,647 (-2^31 <= int < 2^31)
// long/long long: -9,223,372,036,854,775,808 - 9,223,372,036,854,775,807 (-2^63 <= long < 2^63)
//#define INF (1<<30)
#define INF (2147483647)
// 2^31 -1
//= 1,073,741,824 *2 -1
//= 536,870,912 *4 -1
#define MOD 1000000007
#define Rep0(i, n) for (auto i=0; i<n; i++)
#define Rep1(i, n) for (auto i=1; i<=n; i++)
#define Sort(P) sort(P.begin(), P.end())
#define Rev(P) reverse(P.begin(), P.end())
#define MPl(x, y) ((((x)+(y))%MOD+MOD)%MOD)
#define MMi(x, y) ((((x)-(y))%MOD+MOD)%MOD)
#define MMul(x, y) ((((x)*(y))%MOD+MOD)%MOD)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll H, W;
cin >>H >>W;
vector<vector<int>> S(H+2, vector<int> (W+2, 1));
Rep1(i, H) {
string s;
cin >>s;
Rep1(j, W) {
if ('.'==s.at(j-1))
S.at(i).at(j)=0;
}
}
vector<vector<ll>> DP(H+2, vector<ll> (W+2, 0));
DP.at(1).at(1)=1;
vector<vector<ll>> X(H+2, vector<ll> (W+2, 0));
vector<vector<ll>> Y(H+2, vector<ll> (W+2, 0));
vector<vector<ll>> Z(H+2, vector<ll> (W+2, 0));
Rep1(i, H)
Rep1(j, W) {
if ((1==i)&&(1==j))
continue;
if (1==S.at(i).at(j))
continue;
ll D=DP.at(i).at(j);
// Right
X.at(i).at(j)=MPl(X.at(i).at(j-1), DP.at(i).at(j-1));
// Down
Y.at(i).at(j)=MPl(Y.at(i-1).at(j), DP.at(i-1).at(j));
// RightDown
Z.at(i).at(j)=MPl(Z.at(i-1).at(j-1), DP.at(i-1).at(j-1));
DP.at(i).at(j)=MPl(X.at(i).at(j), MPl(Y.at(i).at(j), Z.at(i).at(j)));
}
cout <<DP.at(H).at(W) <<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#define YES "YES"
#define No "No"
#define NO "NO"
const ll mod = 1e9+7;
struct mint {
ll x;
mint(ll x=0) : x((x%mod+mod)%mod) {}
mint &operator+=(const mint &p) { if((x += p.x) >= mod) x -= mod; return *this; }
mint &operator-=(const mint &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; }
mint &operator*=(const mint &p) { x = x * p.x % mod; return *this; }
mint &operator/=(const mint &p) { *this *= p.inverse(); return *this; }
mint operator-() const { return mint(-x); }
mint operator+(const mint &p) const { return mint(*this) += p; }
friend mint operator+(const int &c,const mint &p) { return mint(c) += p; }
mint operator-(const mint &p) const { return mint(*this) -= p; }
friend mint operator-(const int &c,const mint &p) { return mint(c) -= p; }
mint operator*(const mint &p) const { return mint(*this) *= p; }
friend mint operator*(const int &c,const mint &p) { return mint(c) *= p; }
mint operator/(const mint &p) const { return mint(*this) /= p; }
friend mint operator/(const int &c,const mint &p) { return mint(c) /= p; }
bool operator==(const mint &p) const { return x == p.x; }
friend bool operator==(const int &c,const mint &p) { return mint(c) == p; }
bool operator!=(const mint &p) const { return x != p.x; }
friend bool operator!=(const int &c, const mint &p) { return mint(c) != p; }
mint inverse() const {
ll a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return mint(u);
}
mint pow(ll n) const {
mint ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os,const mint &p) { return os << p.x; }
friend istream &operator>>(istream &is,mint &a) {
ll t;
is >> t;
a = mint(t);
return (is);
}
};
int main() {
int H,W;
cin >> H >> W;
vec<string> S(H);
vec<vec<vec<mint>>> dp(H, vec<vec<mint>>(W, vec<mint>(4)));
dp[H-1][W-1][0]=1;
rep(i,H) {
cin >> S[i];
}
for (int i=H-1; i>=0; i--) {
for (int j=W-1; j>=0; j--) {
if (S[i][j] == '#')
continue;
if (i!=H-1 && S[i+1][j]!='#')
dp[i][j][0] += dp[i+1][j][1];
if (j!=W-1 && S[i][j+1]!='#')
dp[i][j][0] += dp[i][j+1][2];
if (i!=H-1 && j!=W-1 && S[i+1][j+1]!='#')
dp[i][j][0] += dp[i+1][j+1][3];
for (int k=1; k<4; k++)
dp[i][j][k] = dp[i][j][0];
if (i!=H-1 && S[i+1][j]!='#')
dp[i][j][1] += dp[i+1][j][1];
if (j!=W-1 && S[i][j+1]!='#')
dp[i][j][2] += dp[i][j+1][2];
if (i!=H-1 && j!=W-1 && S[i+1][j+1]!='#')
dp[i][j][3] += dp[i+1][j+1][3];
}
}
print(dp[0][0][0]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a, b;
cin >> a >> b;
for (int i = 1; i <= a; ++ i)
{
if ((a - i) * i > b)
{
cout << "No" << endl;
break;
}
if ((a - i) * i == b)
{
cout << "Yes" << endl;
break;
}
}
return 0;
} | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
(*arr)=(T*)(*mem);
(*mem)=((*arr)+x);
}
template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){
walloc1d(arr, x2-x1, mem);
(*arr) -= x1;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
inline void rd(long long &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
struct MY_WRITER{
char buf[1048576];
int s;
int e;
MY_WRITER(){
s = 0;
e = 1048576;
}
~MY_WRITER(){
if(s){
fwrite_unlocked(buf, 1, s, stdout);
}
}
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
MY_WRITER_VAR.s = 0;
}
MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
my_putchar_unlocked(a);
}
inline void wt_L(const char c[]){
int i=0;
for(i=0;c[i]!='\0';i++){
my_putchar_unlocked(c[i]);
}
}
template<class T> int Factor_L(T N, T fac[], int fs[]){
T i;
int sz = 0;
if(N%2==0){
fac[sz] = 2;
fs[sz] = 1;
N /= 2;
while(N%2==0){
N /= 2;
fs[sz]++;
}
sz++;
}
for(i=3;i*i<=N;i+=2){
if(N%i==0){
fac[sz] = i;
fs[sz] = 1;
N /= i;
while(N%i==0){
N /= i;
fs[sz]++;
}
sz++;
}
}
if(N > 1){
fac[sz] = N;
fs[sz] = 1;
sz++;
}
return sz;
}
template<class T> int Divisor_L(T N, T res[], void *mem = wmem){
int i;
int j;
int k;
int s;
int sz = 0;
T*fc;
int*fs;
int fsz;
walloc1d(&fc, 100, &mem);
walloc1d(&fs, 100, &mem);
fsz =Factor_L(N, fc, fs);
res[sz++] = 1;
for(i=(0);i<(fsz);i++){
s = sz;
k = s * fs[i];
for(j=(0);j<(k);j++){
res[sz++] = res[j] * fc[i];
}
}
sort(res, res+sz);
return sz;
}
int ys;
long long y[100000];
int main(){
int i;
wmem = memarr;
long long S;
rd(S);
long long P;
rd(P);
ys =Divisor_L(P, y);
for(i=(0);i<(ys);i++){
if(y[i] + (P/y[i]) == S){
wt_L("Yes");
wt_L('\n');
return 0;
}
}
wt_L("No");
wt_L('\n');
return 0;
}
// cLay version 20201121-1
// --- original code ---
// int ys; ll y[1d5];
// {
// ll @S, @P;
// ys = Divisor(P, y);
// rep(i,ys) if(y[i] + (P/y[i]) == S) wt("Yes"), return 0;
// wt("No");
// }
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
ll t, a, b;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> t;
ll ans = 0;
while (t--) {
cin >> a >> b;
ans += b*(b+1)/2 - (a-1)*a/2;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define rep(i, n) FOR(i,0,n)
#define irep(i, n) IFOR(i,0,n)
#define all(v) begin(v), end(v)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using VI = vector<int>;
using VLL = vector<ll>;
using VB = vector<bool>;
using VP = vector<P>;
using Graph = vector<vector<int>>;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
bool second_compare(P a,P b){if(a.second!=b.second){return a.second<b.second;} else return true;}
int main() {
int n;
cin >> n;
double ans = 0;
FOR(i, 1, n) {
ans += ((double)n / i);
}
printf("%.10f\n", ans);
return 0;
} |
#include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define hashmap unordered_map
#define hashset unordered_set
#define lb lower_bound
#define ub upper_bound
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ff first
#define ss second
#define foi(n) for(ll i=0;i<n;i++)
#define foj(n) for(ll j=0;j<n;j++)
#define fok(n) for(ll k=0;k<n;k++)
#define forr(i,a,b) for(ll i=a;i<b;i++)
#define forrr(i,b,a) for(ll i=b;i>=a;i--)
#define forrrr(i,a,b,k) for(ll i=a;i<b;i=i+k)
#define graph vector<vector<int>>
#define sz(v) v.size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef pair< ll, pll> plll;
typedef vector<plll> vplll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<char, int> mci;
typedef map<int, string> mis;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef priority_queue <ll> pq;
typedef priority_queue<pii, vector<pii>, greater<pii> > pqq;
const ll MOD = 1000000007;
void solve();
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("error1.txt", "w", stderr);
freopen("output1.txt", "w", stdout);
#endif
// ll t ; cin >> t;
// while (t--)
{
solve();
cout << "\n";
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
ll ceils(ll x, ll y) {
return x / y + ((x % y) != 0);
}
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 / gcd(a, b) * b;
}
void solve() {
ll t, n;
cin >> t >> n;
vll ans;
for (ll i = 1; i <= 100; ++i) {
ll a = (100 + t) * (i - 1) / 100;
ll b = (100 + t) * i / 100;
if (b - a == 2)
ans.pb(a + 1);
}
n--;
cout << (100 + t) * (n / t) + ans[n % t];
}
| #include <bits/stdc++.h>
// #define x first
// #define y second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int n, t;
int main()
{
IOS; cin >> t >> n;
cout << (100ll * n + t - 1) / t + n - 1 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, w;
scanf("%d %d", &n, &w);
printf("%d\n", n / w);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 1000000005
#define INFLL (ll)1000000000000000005
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
#define per(a,mod) ((a)%(mod)+(mod))%(mod)
typedef pair<int,int> P;
const int MAX = (1<<20);
const int MOD = 1000000007;
void solve(){
int n,w;
cin>>n>>w;
OUT(n/w);
}
int main(){
solve();
return 0;
}
|
#include<bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
const ld EPS = 1e-9;
signed main() {
cout << fixed << setprecision(15);
ld x, y, r; cin >> x >> y >> r;
if (x >= 0) { x += EPS; } else { x -= EPS; }
if (y >= 0) { y += EPS; } else { y -= EPS; } r+=EPS;
ll bai = 10000, ans = 0;
ll xbai = x * bai, ybai = y * bai, rbai = r * 10000;//rbai++;
//cout<<xbai<<' '<<ybai<<' '<<rbai<<endl;
for (int i = 0 - 200000; i <= 200000; i++) {
if (abs(i - x) > r) { continue; }
ll cnt = 0, ibai = i * bai;
//下をにぶたん
ll ok = -200001, ng = (ll)y + 1, mid = (ok + ng) / 2;
while (ng - ok > 1) {
//cout << i << ' ' << mid << ' ' << (ll)pow(abs(ibai - xbai), 2) << ' ' << (ll)pow(abs(mid * bai - ybai), 2) << ' ' << (ll)pow(rbai, 2) << endl;
if ((ll)pow(abs(ibai - xbai), 2) + (ll)pow(abs(mid * bai - ybai), 2) <= (ll)pow(rbai, 2)) {
ng = mid;
}
else { ok = mid; }
mid = (ok + ng) / 2;
}
cnt = ng;//cout<<i<<' '<<ng<<endl;
//上をにぶたん
ok = (ll)y; ng = 200001; mid = (ok + ng) / 2;
while (ng - ok > 1) {
//cout << i << ' ' << mid << ' ' << (ll)pow(abs(ibai - xbai), 2) << ' ' << (ll)pow(abs(mid * bai - ybai), 2) << ' ' << (ll)pow(rbai, 2) << endl;
if ((ll)pow(abs(ibai - xbai), 2) + (ll)pow(abs(mid * bai - ybai), 2) <= (ll)pow(rbai, 2)) {
ok = mid;
}
else { ng = mid; }
mid = (ok + ng) / 2;
}
ans += ok - cnt + 1;
}
cout << ans << endl;
return 0;
} | #include <vector>
#include <array>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
auto read = [&]() {
string s;
cin >> s;
int n = s.length();
long long res = 0;
int cnt = -12;
for (auto c : s) {
if (c == '.') {
cnt = 0;
} else {
++cnt;
res = res * 10 + (c - '0');
}
}
if (cnt < 0) {
res *= 10000;
} else {
while (cnt < 4) {
res *= 10;
++cnt;
}
}
return res;
};
auto x = read();
auto y = read();
auto r = read();
auto ceil = [&](long long p, long long q) {
if (q < 0) {
p = -p;
q = -q;
}
if (p >= 0) {
return (p + q - 1) / q * q;
} else {
return p / q * q;
}
};
auto floor = [&](long long p, long long q) {
if (q < 0) {
p = -p;
q = -q;
}
if (p >= 0) {
return p / q * q;
} else {
return (p - (q - 1)) / q * q;
}
};
auto calc = [&](long long x, long long y, long long r, long long h) {
__int128 dy = y - h;
dy = dy * dy;
long long lo = 0, hi = r;
__int128 d = r;
d *= r;
while (lo < hi) {
auto mi = (lo + hi + 1) / 2;
__int128 dx = mi;
dx *= mi;
if (dx + dy <= d) {
lo = mi;
} else {
hi = mi - 1;
}
}
__int128 dx = lo;
dx *= lo;
if (dx + dy <= d) {
long long l = x - lo;
long long r = x + lo;
l = ceil(l, 10000) / 10000;
r = floor(r, 10000) / 10000;
if (l <= r) {
return r - l + 1;
}
}
return 0LL;
};
long long t = y + r;
long long b = y - r;
t = floor(t, 10000);
b = ceil(b, 10000);
// cout << t << " " << b << endl;
long long res = 0;
for (long long h = b; h <= t; h += 10000) {
res += calc(x, y, r, h);
}
cout << res << '\n';
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i=int(a);i<int(b);++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i=int(b)-1;i>=int(a);--i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(obj) rbegin(obj), rend(obj)
#define cinv(a) rep(i,(int)a.size()) cin >> a[i]
#define debug(a) rep(i,(int)a.size()) cout << a[i] << " "
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define dame {puts("-1"); return 0;}
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<Pi> vp;
typedef vector<vp> vvp;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
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;}
template<typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int di[] = {0, -1, 0, 1};
const int dj[] = {1, 0, -1, 0};
const int MOD = 1e9+7;
const int INF = 1e9;
const ll LINF = 1e15;
const double eps = 1e-10;
const char nl = '\n';
ll power(ll a, ll b) {return b? power(a*a%MOD, b/2)*(b%2?a:1)%MOD:1;}
ll nCk(int n, int k)
{
ll x = 1, y = 1;
for (int i = 1; i <= k; ++i)
{
x = x*(n-i+1)%MOD;
y = y*i%MOD;
}
return x*power(y, MOD-2)%MOD;
}
struct UF
{
vi d;
UF(int n) : d(n, -1) {}
int root(int x)
{
if (d[x] < 0) return x;
return d[x] = root(d[x]);
}
bool unite(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return -d[root(x)]; }
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
double r, x, y; cin >> r >> x >> y;
double d = sqrt(x*x + y*y);
cout << (d < r ? 2 : ceil(d/r)) << nl;
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <list>
#include <iterator>
#include <set>
#include <map>
#include <stack>
using std::cout;
using std::cin;
using std::string;
using std::vector;
using std::endl;
int main()
{
double r, x, y;
cin >> r >> x >> y;
int ans = (int)std::ceil(sqrt(x * x + y * y)/r);
if (ans == 1 && x * x + y * y != r * r) ans = 2;
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll=long long;
int main(){
int n,x;
cin >> n >> x;
rep(i,n){
int a;
cin >> a;
if(a!=x) cout << a << " ";
}
cout << endl;
} |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#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";
}
#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
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;
ll INF = 1e16;
int inf = 1e9;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%MOD+MOD)%MOD){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator-=(const mint a) {
if ((x += MOD-a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime MOD
mint inv() const {
return pow(MOD-2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
return mint(*this) /= a;
}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n, k;
cin >> n >> k;
vll a(n);
REP(i, n) cin >> a[i];
mint div = 1;
vector<mint> s(k + 1);
s[0] = n;
vector<vector<mint>> p(k + 1, vector<mint>(n, 1));
FOR(i, 1, k + 1) {
div *= i;
REP(j, n) {
p[i][j] = p[i-1][j] * a[j];
s[i] += p[i][j];
}
s[i] /= div;
}
mint f = 2;
FOR(x, 1, k+1) {
mint ans = 0;
mint fact = 1;
REP(i, x + 1) {
ans += s[i] * s[x - i];
if (i > 0) fact *= i;
}
ans *= fact;
REP(i, n) {
ans -= p[x][i] * f;
}
f *= 2;
ans /= 2;
print(ans);
}
}
|
// #include <atcoder/all>
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
/*-------------------------------------------*/
int n;
ll a[200009], b[200009];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) sum += a[i];
vector<int> odd, even;
rep(i, n)(i & 1 ? odd : even).push_back(b[i] - a[i]);
sort(ALL(odd), greater<int>());
sort(ALL(even), greater<int>());
ll ans = sum;
rep(i, n / 2) chmax(ans, sum += odd[i] + even[i]);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
int main() {
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<int> A(n), B(n), C(m), D(m);
vector<vector<int>> g(h + 2, vector<int>(w + 2, 0));
for (int i = 0; i < n; ++i) {
cin >> A[i] >> B[i];
g[A[i]][B[i]] = 1;
}
for (int i = 0; i < m; ++i) {
cin >> C[i] >> D[i];
g[C[i]][D[i]] = -1;
}
auto x = g;
for (int i = 0; i < h; ++i) {
int c = 0;
for (int j = 0; j < w; ++j) {
x[i + 1][j + 1] += c;
if (g[i + 1][j + 1] >= 0) c += g[i+1][j+1];
else c = 0;
}
}
for (int i = 0; i < h; ++i) {
int c = 0;
for (int j = w-1; j >= 0; --j) {
x[i + 1][j + 1] += c;
if (g[i + 1][j + 1] >= 0) c += g[i+1][j+1];
else c = 0;
}
}
for (int j = 0; j < w; ++j) {
int c = 0;
for (int i = 0; i < h; ++i) {
x[i + 1][j + 1] += c;
if (g[i + 1][j + 1] >= 0) c += g[i+1][j+1];
else c = 0;
}
}
for (int j = 0; j < w; ++j) {
int c = 0;
for (int i = h-1; i >= 0; --i) {
x[i + 1][j + 1] += c;
if (g[i + 1][j + 1] >= 0) c += g[i+1][j+1];
else c = 0;
}
}
int ans = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if(g[i+1][j+1] >= 0)ans += x[i+1][j+1] > 0;
}
}
cout << ans << "\n";
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
using namespace std;
int main(){
ll int N;
cin >> N;
ll int count = 0;
ll int kari;
map< ll int, ll int > ma;
for( ll int i = 2; i*i <= N; i++){
kari = i;
kari *= i;
while( kari <= N && ma[kari] != 1 ){
ma[kari]=1;
count += 1;
kari *= i;
}
}
cout << N - count;
return 0;
}
| #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define all(x) begin(x), end(x)
#define Done(x) cout<<x<<endl; return;
#define endl '\n'
void solve(){
int n; cin>>n;
int m; cin>>m;
map<int,int>occur;
for(int i=0;i<n;i++){
int a; cin>>a;
int b; cin>>b; b++;
int c; cin>>c;
occur[a]+=c;
occur[b]-=c;
}
int ans=0;
int curr=0;
int last=0;
for(auto p:occur){
int dist=p.first-last;
ans+=dist*min(curr,m);
last=p.first;
curr+=p.second;
}
cout<<ans<<endl;
}
int32_t main(){
// Remove for Interactive Problems
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void chmin(int64_t& a, int64_t b) {
if (a > b) a = b;
}
int main() {
int64_t n, m;
cin >> n >> m;
vector<int64_t> h(n);
vector<int64_t> w(m);
for (int64_t i = 0; i < n; i++) cin >> h.at(i);
for (int64_t i = 0; i < m; i++) cin >> w.at(i);
sort(h.begin(), h.end());
sort(w.begin(), w.end());
int64_t ans = 1e16;
vector<int64_t> sum1((n+1)/2, 0), sum2((n+1)/2, 0);
for (int i = 0; i < n-1; i += 2) {
sum1.at(i / 2 + 1) = sum1.at(i / 2) + h.at(i+1) - h.at(i);
}
for (int i = n-2; i > 0; i -= 2) {
sum2.at(i / 2) = sum2.at(i / 2 + 1) + h.at(i+1) - h.at(i);
}
for (int64_t y : w) {
int64_t x = lower_bound(h.begin(), h.end(), y) - h.begin();
if (x & 1) x ^= 1;
chmin(ans, sum1.at(x / 2) + sum2.at(x / 2) + abs(h.at(x) - y));
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> alll;
typedef array<ll,4> allll;
#define pb push_back
#define ff first
#define ss second
#define MAX 300005
#define MOD 1000000007
#define INF 2e9
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<aii>adj[MAX];
int xMove[] = { 0,1,0,-1,1,1,-1,-1, 2, 2, -2, -2, 1, 1, -1, -1 };
int yMove[] = { 1,0,-1,0,1,-1,1,-1, 1, -1, 1, -1, 2, -2, 2, -2 };
int main()
{
//freopen("input.in","r",stdin);
//freopen("output.txt","w",stdout);
cin.tie(0),cout.tie(0);
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(10);
int TC=1;
int n,m,k;
//cin>>TC;
for(int t1=1; t1<=TC; t1++)
{
cin>>n>>m;
int arr[n],w[m];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<m;i++)
cin>>w[i];
sort(arr,arr+n);
ll csum[n][2];
memset(csum,0,sizeof csum);
for(int i=1;i<n;i++)
{
if(i&1)
csum[i][0]=arr[i]-arr[i-1];
csum[i][0]+=csum[i-1][0];
}
for(int i=2;i<n;i++)
{
if(i%2==0)
csum[i][1]=arr[i]-arr[i-1];
csum[i][1]+=csum[i-1][1];
}
ll ans=1e18;
for(int i=0;i<m;i++)
{
int pos=lower_bound(arr,arr+n,w[i])-arr;
if(pos&1)
{
ll cur=w[i]-arr[pos-1];
cur+=csum[pos-1][0];
cur+=csum[n-1][1]-csum[pos-1][1];
ans=min(ans,cur);
}
else
{
ll cur=arr[pos]-w[i];
cur+=csum[pos][0];
cur+=csum[n-1][1]-csum[pos][1];
ans=min(ans,cur);
}
}
cout<<ans<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, w;
cin >> n >> w;
vector<pair<int, int>>sim;
for(int i = 0; i<n; ++i){
int s, t, p;
cin >> s >> t >> p;
sim.push_back(make_pair(s, p));
sim.push_back(make_pair(t, -p));
}
sort(sim.begin(), sim.end());
ll curr = 0;
for(auto i : sim){
curr += i.second;
if(curr > w){
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| /*
https://atcoder.jp/contests/abc200/tasks/abc200_e
## 題意：
## 思路：
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 0x3fffffff;
const ll LINF = 9223372036854775807;
#define dump(x) cout << #x << " = " << (x) << endl
#define ALL(x) begin(x),end(x)
#define rep(i,s,e) for(ll i=(s); i<=(e); ++i)
#define repRev(i,s,e) for(ll i=(s); i>=(e); --i)
#define range(i,s,n) for(ll i=(s), i_stop=(s)+(n); i<i_stop; ++i)
#define rangeRev(i,s,n) for(ll i=(s), i_stop=(s)-(n); i>i_stop; --i)
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 n,m;
list<pair<int,int>> restri[110];
bool check(int msk) {
int l=0; vector<int> tot(n+1, 0);
range(i,0,n) if(msk & (1<<i)) {
++l; ++tot[i];
}
rep(i,1,n-1) tot[i] += tot[i-1];
for(auto &p:restri[l]) {
auto [y,z] = p;
if(tot[y] > z) return false;
}
return true;
}
void solve() {
cin>>n>>m;
range(i,0,m) {
int x,y,z; cin>>x>>y>>z;
restri[x].push_back({y-1,z});
}
vector<ll> dp(1<<n, 0); dp[0] = 1;
range(msk, 0, 1<<n) range(nxt, 0, n) if(!(msk & (1<<nxt))) {
if(check(msk | (1<<nxt)))
dp[msk | (1<<nxt)] += dp[msk];
}
cout<<dp[(1<<n)-1]<<endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll comb(ll a, ll b){
ll ans = 1;
for(int i=1;i<=b;i++){
ans = ans * a / i;
a--;
}
/* for(int i=1;i<=b;i++){
ans = ans / i;
}*/
return ans;
}
int main()
{
ll L; cin >> L;
cout << comb(L-1,11)<< endl;
}
| #include <iostream>
#include <vector>
#include <cstdint>
int main() {
constexpr int N = 12;
int L;
std::cin >> L;
std::vector<std::vector<std::int64_t>> counts(L + 1, std::vector<std::int64_t>(N + 1));
counts[0][0] = 1;
for (int i = 1; i <= L; ++i) {
for (int j = 0; j < i; ++j) {
for (int k = 1; k <= N; ++k) {
counts[i][k] += counts[j][k - 1];
}
}
}
std::cout << counts[L][N] << std::endl;
return 0;
}
|
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL a[303030];
// ※※※ 以下のライブラリを使用(一部改変) ※※※.
// 遅延評価セグメント木をソラで書きたいあなたに.
// http://tsutaj.hatenablog.com/entry/2017/03/30/224339
// http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2236726
struct LazySegmentTree{
private:
int n;
vector<LL> node, lazy;
public:
LazySegmentTree(vector<LL> v){
int sz = (int)v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, 0);
// 元配列 の 値 を, セグメント木のノード に 保存.
rep(i, sz) node[i + n - 1] = v[i];
repr(i, n - 2, 0) node[i] = node[i * 2 + 1] ^ node[i * 2 + 2];
}
void eval(int k, int l, int r){
if(lazy[k] != 0) {
node[k] ^= lazy[k];
if(r - l > 1) {
lazy[2 * k + 1] ^= lazy[k] / 2;
lazy[2 * k + 2] ^= lazy[k] / 2;
}
lazy[k] = 0;
}
}
void update(int a, int b, LL x, int k = 0, int l = 0, int r = -1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] += (r - l) * x;
eval(k, l, r);
}else{
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = node[2 * k + 1] ^ node[2 * k + 2];
}
}
LL query(int a, int b, int k = 0, int l = 0, int r = -1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return 0;
if(a <= l && r <= b) return node[k];
LL vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
LL vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return vl ^ vr;
}
};
int main(){
// 1. 入力情報.
int N, Q;
scanf("%d %d", &N, &Q);
rep(i, N) scanf("%lld", &a[i]);
// 2. 遅延評価セグメント木.
LazySegmentTree seg(vector<LL>(N, 0));
rep(i, N) seg.update(i, i + 1, a[i]);
// 3. クエリ回答.
rep(i, Q){
int t;
scanf("%d", &t);
// t = 1 の 場合.
if(t == 1){
int x;
LL y;
scanf("%d %lld", &x, &y);
x--;
seg.update(x, x + 1, y);
}
// t = 2 の 場合.
if(t == 2){
int x, y;
scanf("%d %d", &x, &y);
x--;
LL ans = seg.query(x, y);
printf("%lld\n", ans);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef pair<int, int> pi;
#define MOD 1000000007LL
int N, Q; int n2;
int stree[1200000]={};
void add(int v, int i) {
i += n2;
for (; i >= 1; i /= 2) stree[i] ^= v;
}
int sum(int a, int b) {
a += n2; b += n2;
int s = 0;
while (a <= b) {
if (a%2 == 1) s ^= stree[a++];
if (b%2 == 0) s ^= stree[b--];
a /= 2; b /= 2;
}
return s;
}
int main() {
//freopen("feast.in", "r", stdin);
//freopen("feast.out", "w", stdout);
//ios_base::sync_with_stdio(false);
//cin.tie(0);
cin >> N >> Q;
n2 = 1; while (n2 <= N) n2 *= 2;
for (int i = 1; i <= N; i++) {
int x; cin >> x; add(x, i);
}
while (Q--) {
int T, X, Y; cin >> T >> X >> Y;
if (T==1) {
add(Y, X);
} else {
cout << sum(X, Y) << endl;
}
}
} |
#include<cstdio>
#include<functional>
#include<utility>
#include<algorithm>
#include<set>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
int N, M;
scanf("%d %d", &N, &M);
pair<int, int> pawn[M];
for (unsigned i = 0; i < M; i++) scanf("%d %d", &pawn[i].first, &pawn[i].second);
set<int> valid_y;
valid_y.insert(N);
sort(pawn, pawn + M);
bool pawn_exists_in_front = false, pawn_exists_in_left;
for(unsigned i = 0;i < M;i++){
pawn_exists_in_left = pawn_exists_in_front;
pawn_exists_in_front = (valid_y.find(pawn[i].second) != valid_y.end()) && i < M-1 && pawn[i+1] == make_pair(pawn[i].first, pawn[i].second + 1);
if(((i && pawn[i-1] == make_pair(pawn[i].first, pawn[i].second - 1)) ? pawn_exists_in_left : (valid_y.find(pawn[i].second - 1) != valid_y.end())) || (valid_y.find(pawn[i].second + 1) != valid_y.end())) valid_y.insert(pawn[i].second);
else valid_y.erase(pawn[i].second);
}
printf("%u\n", valid_y.size());
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
long long n, k;
int arr[9][9] = {0,};
int visited[9]={0,};
int answer=0;
void dfs(int node, long long times){
if(node<0 || node>=n || times>k){return;}
if(visited[node]==1) return ;
for(int i=0; i<n; i++){
if(i == node){continue;}
if(i==0 && visited[i]==1 && times+arr[node][i] == k){
answer++;
continue;
}
if(visited[i]==0){
visited[node] =1;
dfs(i, times+arr[node][i]);
visited[node] = 0;
}
}
return;
}
int main(){
cin>>n>>k;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cin>> arr[i][j];
}
}
dfs(0,0);
cout <<answer<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n), s(n+1, 0);
for(auto &x : a) cin >> x;
sort(a.rbegin(), a.rend());
for(int i = 0; i < n; ++i){
s[i+1] = s[i] + a[i];
}
long long ans = 0;
for(int I = 1; I <= n; ++I){
int i = I-1;
ans += (n-I)*a[i] - (s[n]-s[I]);
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<LD> VLD;
typedef vector<string> VS;
#define rep(i, min, max) for (int i = min; i < (int)(max); i++)
int main()
{
LL N;
cin>>N;
VL X(N);
for(LL& x: X) cin>>x;
LL m = 0;
rep(i,0,N) m += abs(X.at(i));
LD e = 0;
rep(i,0,N) e += X.at(i)*X.at(i);
e = sqrt(e);
LL c = 0;
rep(i,0,N) c = max(c, abs(X.at(i)));
cout<<fixed<<setprecision(0)<<m<<endl;
cout<<fixed<<setprecision(15)<<e<<endl;
cout<<fixed<<setprecision(0)<<c<<endl;
return 0;
}
|
#include<iostream>
#include<iterator>
#include<set>
using namespace std;
int main()
{
long n;
cin >> n;
set<long>ans;
for(long d=1;d*d<=n;d++){
if(n%d==0){
ans.insert(d);
ans.insert(n/d);
}
}
for(auto x:ans)cout << x << endl;
}
| #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 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;}
int n,ans;
signed main()
{
n=read();
for(int i=1;i<=n;++i)
{
int p=i;
int f1=1,f2=1;
while(p)
{
if(p%10==7) f1=0;
p/=10;
}
p=i;
while(p)
{
if(p%8==7) f2=0;
p/=8;
}
if(f1&&f2) ans++;
}
printf("%lld\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
set<int> divisors(int M) {
set<int> r;
for (int i = 1; i * i <= M; ++i) {
if (M % i != 0) continue;
r.insert(i);
r.insert(M / i);
}
return r;
}
int N;
vector<int> A;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int solve() {
int const L = *min_element(A.begin(), A.end());
map<int,int> mp;
for (auto a : A) {
auto ds = divisors(a);
for (auto v : ds) {
if (v > L) continue;
if (mp.count(v)) {
mp[v] = gcd(mp[v],a);
} else {
mp[v] = a;
}
}
}
int ans = 0;
for (auto e : mp) {
int v, a;
tie(v, a) = e;
if (v == a) ++ans;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> N;
A.assign(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
cout << solve() << endl;
return 0;
} | #include <iostream>
#include <map>
using namespace std;
long long int parejas;
long long int n, aux;
map<int, long long int> arre;
int main()
{
cin>>n;
for(int i=1;i<=n;++i){
cin>>aux;
arre[aux]++;
}
aux=0;
for(pair<int, long long int> recorre : arre){
parejas+=((recorre.second*(n-recorre.second))-(aux*recorre.second));
aux+=recorre.second;
}
cout<<parejas;
return 0;
}
|
#pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using PQR = priority_queue<T,vector<T>,greater<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007; // 998244353;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const ld PI = acos((ld)-1);
constexpr ll dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
inline void Yes() { cout << "Yes" << ENDL; }
inline void No() { cout << "No" << ENDL; }
inline void YES() { cout << "YES" << ENDL; }
inline void NO() { cout << "NO" << ENDL; }
template<typename T,typename Y> inline T mpow(T a, Y n) {
T res = 1;
for(;n;n>>=1) {
if (n & 1) res = res * a;
a = a * a;
}
return res;
}
template <typename T>
vector<T> finddivisor(T x) { //整数xの約数(xを含む)
vector<T> divisor;
for(T i = 1; (i * i) <= x; i++) {
if(x % i == 0) {
divisor.push_back(i);
if(i * i != x) { divisor.push_back(x / i);}
}
}
sort(divisor.begin(), divisor.end());
return divisor;
}
template <typename T> V<T> prefix_sum(const V<T>& v) {
int n = v.size();
V<T> ret(n + 1);
rep(i, 0, n) ret[i + 1] = ret[i] + v[i];
return ret;
}
template<typename T>
T rand(T l,T r){
static random_device rd;
static mt19937 g(rd());
return uniform_int_distribution<T>(l,r)(g);
}//[]
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(auto&& x: vec) is >> x;
return is;
}
template<typename T,typename Y>
ostream& operator<<(ostream& os,const pair<T,Y>& p){
return os<<"{"<<p.fs<<","<<p.sc<<"}";
}
template<typename T> ostream& operator<<(ostream& os,const V<T>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<typename ...Args>
void debug(Args&... args){
for(auto const& x:{args...}){
cerr<<x<<' ';
}
cerr<<ENDL;
}
#pragma endregion templates
signed main(){
cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false);
cout<<fixed<<setprecision(20);
ll n;cin>>n;
V<ll> l(n),r(n);
rep(i,0,n){
ll t,a,b;cin>>t>>a>>b;
a*=2;
b*=2;
if(t==1){
l[i]=a;
r[i]=b;
}else if(t==2){
l[i]=a;
r[i]=b-1;
}else if(t==3){
l[i]=a+1;
r[i]=b;
}else{
l[i]=a+1;
r[i]=b-1;
}
}
ll ans=0;
rep(i,0,n){
rep(j,i+1,n){
if(!(r[i]<l[j]||r[j]<l[i])){
++ans;
}
}
}
cout<<ans<<ENDL;
}
//(・_・)(・_・)(・_・)(・_・)
//CHECK overflow,what to output?
//any other simpler approach? | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(auto i = begin; i < (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 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;
const ll INF = 1e9;
const double EPS = 1e-10;
/* #include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
using d32 = mp::number<mp::cpp_dec_float<32>>; */
const ll MOD = 1e9 + 7;
/* #include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007; */
using P = pair<int, int>;
struct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} };
using Graph = vector<vector<int>>;
struct seg{ int t, l, r; };
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<seg> s(n);
for(auto&& [t, l, r] : s) cin >> t >> l >> r;
sort(all(s), [&](seg a, seg b){ return a.r < b.r; });
int ans = 0;
rep(i, 0, n) rep(j, i + 1, n){
if(s[i].r > s[j].l) ans++;
else if(s[i].r == s[j].l && (s[i].t == 1 || s[i].t == 3) && (s[j].t == 1 || s[j].t == 2)) ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(auto i=0;i<n;++i)
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define TEST_CASE int tc;cin>>tc;while(tc--)
#define Clock high_resolution_clock::now()
template<class T>
inline bool chmax(T &a, T b) {if(a < b) {a = b;return true;}return false;}
template<class T>
inline bool chmin(T &a, T b) {if(a > b) {a = b;return true;}return false;}
#ifdef LOCAL
#define cerr cout
#else
#endif
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// #define TIME
/******************************************************************************************************************************/
const ll inf = 2e18;
const ll mod = 1e9+7;
const ll N = 2e6;
int main()
{
auto start_time = Clock;
FASTIO
ll S,ans{0}; cin >> S;
for(ll i=1;i<N;++i) {
ll n = 2*S+i-i*i;
ll d = 2*i;
if(n>0 && n%d==0) ans += 2;
}
cout << ans << "\n";
auto end_time = Clock;
#ifndef TIME
return 0;
#endif
cout << "\nTime elapsed: "
<< (double)duration_cast<milliseconds>(end_time-start_time).count()
<< "ms";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define ld long double
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define vl vector<lli>
#define vll vector<pair<lli,lli>>
#define vlll vector<pair<pair<lli,lli>,lli>>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//////////////////////////////////////////////////////// By: Umang Srivastava
// lli extgcd(lli a, lli b, lli *x , lli *y)
// {
// if(a==0)
// {
// *x=0;
// *y=1;
// return b;
// }
// lli x1 , y1;
// lli gcd = extgcd(b%a , a , &x1 , &y1);
// *x= y1 - (b/a) * x1;
// *y=x1;
// return gcd;
// }
// lli modinv(lli a, lli m)
// {
// lli x,y;
// lli g = extgcd(a,m,&x,&y);
// if(g!=1)
// return -1;
// return (x%m+m)%m;
// }
// lli moddiv(lli a, lli b, lli m)
// {
// a=a%m;
// lli inv = modinv(b,m);
// if(inv!=-1)
// return ((a*inv + m)%m);
// else
// return -1;
// }
// lli binpow(lli a, lli b, lli m)
// {
// lli res=1;
// a=a%m;
// while(b>0)
// {
// if(b & 1)
// {
// res = (res * a)%m;
// }
// b=b>>1;
// a=(a*a)%m;
// }
// return res;
// }
// lli gcd(lli a, lli b)
// {
// // if(b<a)
// // {
// // lli t=a;
// // a=b;
// // b=t;
// // }
// if(a==0)
// return b;
// return gcd(b%a,a);
// }
// lli fac[1000005];
// void calcfac(lli m)
// {
// fac[0]=1;
// for(lli i=1;i<=1000001;i++)
// {
// fac[i]=(fac[i-1]*i)%m;
// }
// }
// lli ncr(lli n,lli r,lli m)
// {
// if(r==0 || r==n)
// return 1;
// return (((fac[n]*binpow(fac[r],m-2,m))%m)*(binpow(fac[n-r],m-2,m)))%m;
// }
/////////////////////////////////////////////////////////
int main()
{
fastio
lli n,m,i,j,k,t,a,b,c,d,x,y,q;
t=1;
// cin>>t;
while(t--)
{
cin>>n;
a=0;
n*=2;
set<lli>st;
for(i=1;i*i<=n;i++)
{
if(n%i!=0)
continue;
a=n/i;
if(a%2 == i%2)
continue;
st.insert(i);
}
cout<<2*st.size()<<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<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define pb push_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define vld vector<long double>
#define pll pair<long long int,long long int>
/* unordered_map<int,int>mp; mp.reserve(1024); mp.max_load_factor(0.25); */
#define mod 1000000007
#define mod2 998244353
#define ll long long int
#define ld long double
#define pi 3.141592653589793238
#define Endl endl
#define endl "\n"
const int N = 1e2 + 15;
const ll inf = 1e18;
vll a[N];
ll ans = 1;
vll done(N);
ll limit;
vll comp;
vll color(N);
void dfs(ll u)
{
done[u] = true;
for(auto v:a[u])
{
if(!done[v])
dfs(v);
}
comp.pb(u);
}
ll recur(ll idx)
{
if(idx == limit)
return 1ll;
ll u = comp[idx];
ll ans = 0;
for(ll col = 0; col < 3; col++)
{
bool chk = true;
for(auto v:a[u])
{
if(color[v] == col)
chk = false;
}
if(chk)
{
color[u] = col;
ans += recur(idx+1);
color[u] = -1;
}
}
return ans;
}
void solve()
{
ll n , m;
cin >> n >> m;
for(ll i=1;i<=m;i++)
{
ll u,v;
cin >> u >> v;
a[u].pb(v);
a[v].pb(u);
}
ll ret = 1;
for(ll i=1;i<=n;i++)
{
if(done[i] == 0)
{
comp.clear();
dfs(i);
reverse(comp.begin(),comp.end());
limit = comp.size();
for(ll i=0;i<N;i++)
color[i] = -1;
ret *= recur(0);
}
}
cout << ret;
}
void debug(ll tt) {}
signed main()
{
FAST;
ll t = 1;
// cin >> t;
while(t--)
{
solve();
}
}
// freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); | // D - RGB Coloring 2
// sample code
// reference: https://atcoder.jp/contests/abc199/submissions/22053625
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using ll = int64_t;
#define rep(i,e) for(int i=0;i<(e);++i)
vec<vi> G;
vi IX; //dfs の順を記録。違う連結成分になら同じ index もある
ll dfs(int now, vi&v){
for(int to:G[now]) if(v[to] == v[now]) return 0;
ll res = 1;
for(int to:G[now]){
if(IX[to] == -1) IX[to] = IX[now] + 1;
if(IX[to] == IX[now] + 1){
ll tmp = 0;
v[to] = (v[now] + 1) % 3;
tmp += dfs(to, v);
v[to] = (v[now] + 2) % 3;
tmp += dfs(to, v);
v[to] = -1;
res *= tmp;
if (tmp == 0) break;
// tmp == 0 の時、早期に return してるので
// IX が振り切れていない事に注意
}
}
return res;
}
int main(){
int n, m; cin>>n>> m;
G.resize(n);
rep(i, m){
int a, b; cin>>a>>b; --a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
IX.resize(n, -1);
vi v(20, -1);
ll ans = 1;
rep(i, n){
if(IX[i] != -1) continue;
IX[i] = v[i] = 0;
ans *= dfs(i, v) * 3;
}
cout<< ans <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template<class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define sqr(a) ll(a) * (a)
#define siz(a) int(a.size())
#define ints(a...) int a; read(a)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define trav(i, v) for (const auto i : v)
#define fill(a, b) memset(a, b, sizeof(a))
#define rep(i, b, n) for (auto i = b; i < n; i++)
#define per(i, b, n) for (auto i = b; i >= n; i--)
#define unify(a) sort(all(a)); a.resize(unique(all(a)) - a.begin())
template <class T> using vec = vector<T>;
template <class... Args> inline void read(Args&... args) { ((cin >> args), ...); }
template <class... Args> inline void show(Args... args) { ((cout << args << " "), ...); }
template <class T1, class T2> inline bool ckmin(T1 &a, T2 b) { return a > b ? a = b, 1 : 0; }
template <class T1, class T2> inline bool ckmax(T1 &a, T2 b) { return a < b ? a = b, 1 : 0; }
template <class T> inline void operator>> (istream& in, vector<T>& v) { rep(i, 0, siz(v)) in >> v[i]; }
template <class T> inline void operator<< (ostream& out, const vector<T>& v) { rep(i, 0, siz(v)) out << v[i] << " \n"[i + 1 == siz(v)]; }
const int MOD = 1e9 + 7;
const int N = 101;
ld dp[N][N][N];
ld f(int a, int b, int c) {
if (a == 100 || b == 100 || c == 100)
return 0;
if (dp[a][b][c] >= 0)
return dp[a][b][c];
ld res = 1, sum = a + b + c;
res += a * f(a + 1, b, c) / sum;
res += b * f(a, b + 1, c) / sum;
res += c * f(a, b, c + 1) / sum;
return dp[a][b][c] = res;
}
void solve() {
ints(a, b, c);
fill(dp, -1);
cout << f(a, b, c);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
int _ = 1;
// cin >> _;
rep(i, 1, _ + 1) {
// printf("Case %d: ", i);
// Solution solve;
solve();
}
return 0;
} | /*
Author : zzugzx
Lang : C++
Blog : blog.csdn.net/qq_43756519
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define SZ(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
//const int mod = 1e9 + 7;
const int mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const int N = 1e2 + 10;
const ll inf = 0x3f3f3f3f;
const ll oo = 8e18;
const int dir[][2]={{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
ll Pow(ll a, ll b){
ll ans = 1;
while(b > 0){
if(b & 1){
ans = ans * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll inv(ll b){
return Pow(b,mod-2)%mod;
}
double dp[110][110][110];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int a, b, c;
cin >> a >> b >> c;
for (int i = 100; i >= a; i--)
for (int j = 100; j >= b; j--)
for (int k = 100; k >= c; k--) {
if (i == 100 || j == 100 || k == 100) continue;
double tmp = 0;
if (i + 1 <= 100) tmp += dp[i + 1][j][k] * i / (i + j + k) + 1.0 / 3;
if (j + 1 <= 100) tmp += dp[i][j + 1][k] * j / (i + j + k) + 1.0 / 3;
if (k + 1 <= 100) tmp += dp[i][j][k + 1] * k / (i + j + k) + 1.0 / 3;
dp[i][j][k] = tmp;
}
cout << fixed << setprecision(9) << dp[a][b][c] << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.fr>>a.sc;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.fr<<" "<<a.sc;return out;}
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;
const int N=0;
void solve(){
int n;
cin>>n;
int ans=0;
for (int i = 1; i <= n; ++i) {
int num=i;
bool flag=1;
while(num){
if(num%10==7)flag=0;
num/=10;
}
num=i;
while(num){
if(num%8==7)flag=0;
num/=8;
}
ans+=(flag);
}
cout<<ans;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#ifdef SIEVE
sieve();
#endif
#ifdef NCR
init();
#endif
int t=1;
//cin>>t;
while(t--) solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int n;
cin >> n;
cout << 10 << ' ' << 6 << ' ' << 15 << ' ';
n -= 3;
int k = 2;
set<int> s;
while(10*k<=10000){
s.insert(10*k);
k++;
}
k = 2;
while(6*k<=10000){
s.insert(6*k);
k++;
}
k = 2;
while(15*k<=10000){
s.insert(15*k);
k++;
}
while(n>0){
cout << *begin(s) << ' ';
s.erase(*begin(s));
n--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
deque<long long> adj;
int main(){
cout.sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
string s, t; cin >> s >> t;
for(long long i = 0; i < n; i++){
char c = s[i];
if(c == '1')
adj.push_back(i);
}
ll res = 0;
for(int i = 0; i < n; i++){
if(s[i] == t[i]) {
if (s[i] == '1') {
adj.pop_front();
}
continue;
}
if(s[i] == '1'){
adj.pop_front();
if(adj.empty()){
cout << -1 << endl;
return 0;
}
res += adj.front() - i;
s[adj.front()] = '0';
adj.pop_front();
}
else{
if(adj.empty()){
cout << -1 << endl;
return 0;
}
res += adj.front() - i;
s[adj.front()] = '0';
adj.pop_front();
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=(ll)1<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll 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 updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}
int main(){
INT(n);
vector<int> a(n);
in(a);
sort(all(a));
rep(i,n){
if(a[i]!=i+1){
out("No");
return 0;
}
}
out("Yes");
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
template <class T = ll> using V = vector<T>;
#define loop(n) while(n--)
#define rep(i,n) for(int i=0; i<(n);++i)
#define repp(i, l, r) for(int i = (l); i < (r); ++i)
#define all(v) (v).begin(), (v).end()
#define LL(n) int n;cin >> n
int main()
{
LL(n);
V<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
ll sum = accumulate(all(a), 0);
sum = (sum+1)/2;
bool dp[110][100010] = {};
rep(i, 110) dp[i][0] = true;
rep(i, n) rep(j, 100010){
if(j - a[i] >= 0) dp[i+1][j] |= dp[i][j-a[i]];
dp[i+1][j] |= dp[i][j];
}
rep(i, 100000){
if(dp[n][i+sum]) {
cout << i+sum << endl;
break;
}
}
return 0;
}
| #include <chrono>
#include <thread>
#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 T top()
#define E end()
#define PS push
#define Q queue
#define PP pop()
#define L0 (LL)0
#define V vector
#define ST stack
#define FI first
#define MAX 4e18
#define MIN -MAX
#define DQ deque
#define SZ size()
#define C clear()
#define B begin()
#define F front()
#define SE second
#define DL double
#define G getline
#define IN insert
#define endl "\n"
#define EM empty()
#define cnn continue
#define MD 1000000007
#define PSB push_back
#define PI acos(-1.00)
#define PPB pop_back()
#define PSF push_front
#define ub upper_bound
#define lb lower_bound
#define PPF pop_front()
#define CF cout.flush()
#define line cout<<endl
#define LL long long int
#define one cout<<1<<endl
#define zer cout<<0<<endl
#define PQ priority_queue
#define kth find_by_order
#define nil cout<<-1<<endl
#define N cout<<"NO"<<endl
#define NN cout<<"No"<<endl
#define Y cout<<"YES"<<endl
#define fndidx order_of_key
#define YY cout<<"Yes"<<endl
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define MAU cout<<"Case "<<mau<<": "
#define SP(pre) fixed<<setprecision(pre)
#pragma GCC optimization ("unroll-loops")
#define MMAU cout<<"Case "<<mau<<":"<<endl
#define __lcm(A1,A2) (A1/(__gcd(A1,A2)))*A2
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
#define UOSMOY v.C;w.C;ww.C;uu.C;uo.C;vo.C;vu.C;ab.C;bc.C;cc.C;uuu.C;a.C;b.C;c.C;u.C
typedef tree<LL, null_type, less<LL>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define remembermeforcenturies using namespace std::chrono_literals;std::this_thread::sleep_for(-4611686018427387904ms);
V<LL>v,w,ab,bc;
set<LL>uo;
map<LL,LL>ww,cc,u;
V<pair<LL,LL> >uu,su;
map<LL,V<LL> >uuu;
map<pair<LL,LL>,LL> vo,vu;
map<LL,pair<LL,pair<LL,LL > > > vs;
priority_queue<LL,V<LL>,greater<LL> > moy;
LL dx[]= {-1,0,1,0,1,1,-1,-1};
LL dy[]= {0,1,0,-1,-1,1,1,-1};
LL dxx[]= {2,1,-1,-2,-2,-1,1,2};
LL dyy[]= {1,2,2,1,-1,-2,-2,-1};
LL dp[101][10001];
LL ar[10][10];
bool mat[110][100010];
void ans()
{
LL sumOfArray = 0;
for(LL i = 0; i < v.SZ; i++)
{
sumOfArray = sumOfArray + v[i];
}
LL sum = sumOfArray / 2;
for(LL i = 0; i < v.SZ; i++)
{
mat[i][0] = true;
}
for(LL j = 0; j <= sum; j++)
{
if(j == v[0])
{
mat[0][j] = true;
}
}
for(LL i = 1; i < v.SZ; i++)
{
for(LL j = 1; j <= sum; j++)
{
if(mat[i - 1][j])
{
mat[i][j] = true;
}
else
{
if(j >= v[i])
{
mat[i][j] = mat[i - 1][j - v[i]];
}
}
}
}
LL lastRow = v.SZ - 1;
LL firstPartitionSum = -1;
for(LL j = sum; j >= 0; j--)
{
if(mat[lastRow][j])
{
firstPartitionSum = j;
break;
}
}
LL secondPartitionSum = sumOfArray - firstPartitionSum;
cout<<max(firstPartitionSum,secondPartitionSum)<<endl;
}
int main()
{
// BRR;
// file;
FAST;
char ch;
string a,b,c;
DL x,y,d,e,f,g,h;
LL n,i,j,k,p,q,o,l,s,tt=1,m,t,z,aa,r=0;
// cin>>tt;
for(LL mau=1; mau<=tt; mau++)
{
UOSMOY;
ordered_set os;
remembermeforcenturies;
cin>>n;
for(i=0; i<n; i++)
{
cin>>o;
v.PSB(o);
}
if(n==1)
{
cout<<v[0]<<endl;
cnn;
}
sort(v.B,v.E);
ans();
}
return 0;
//IN
//AL
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int A, B;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
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;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int a, b;
cin >> a >> b;
cout << ((a+b) >> 1) << " " << ((a-b) >> 1);
return 0;
}
|
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#ifndef LOCAL
#define cerr if(0)cerr
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using pii = pair<int, int>;
const int N = 2e5+1;
int n, m, num[N];
vector<pii> g[N];
bool vis[N];
void dfs(int x, int p, int val) {
vis[x] = 1;
if(!p || num[p] == val) {
num[x] = val%n+1;
}
else {
num[x] = val;
}
for(auto i: g[x]) {
if(!vis[i.st]) {
dfs(i.st, x, i.nd);
}
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>m;
for(int i=0; i<m; ++i) {
int a, b, c; cin>>a>>b>>c;
g[a].push_back(mp(b, c));
g[b].push_back(mp(a, c));
}
dfs(1, 0, 0);
for(int i=1; i<=n; ++i) {
cout<<num[i]<<'\n';
}
}
| #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
struct Edge {
int t, c;
Edge() = default;
Edge(int t, int c) : t(t), c(c) {}
};
int main() {
int N, M; cin >> N >> M;
vector<vector<Edge>> E(N);
REP(i, 0, M) {
int u, v, c; cin >> u >> v >> c; u--; v--; c--;
E[u].push_back({v, c});
E[v].push_back({u, c});
}
vector<int> ans(N, -1);
queue<pair<int, int>> Q;
Q.push({0, -1});
while (!Q.empty()) {
auto q = Q.front(); Q.pop();
int v = q.first;
int p = q.second;
if (ans[v] < 0) ans[v] = -1;
set<int> labels;
for (auto e : E[v]) {
if (ans[e.t] != -1) continue;
if (ans[v] == -1 || ans[v] != e.c) {
ans[e.t] = e.c;
labels.insert(e.c);
} else {
ans[e.t]--;
}
Q.push({e.t, e.c});
}
if (ans[v] < 0) {
int c = 0;
labels.insert(p);
while (labels.count(c)) c++;
ans[v] = c;
}
}
for (auto a : ans) cout << a + 1 << endl;
return 0;
} |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<iterator>
#include<string>
#include<sstream>
#include <unordered_map>
#include<cmath>
using namespace std;
#define ll long long
int __gcd(int a,int b){return b==0 ? a : __gcd(b,a%b);}
ll __gcd(ll a,ll b){return b==0 ? a : __gcd(b,a%b);}
void scan(__int128 &x)//输入
{
x = 0;
int f = 1;
char ch;
if((ch = getchar()) == '-') f = -f;
else x = x*10 + ch-'0';
while((ch = getchar()) >= '0' && ch <= '9')
x = x*10 + ch-'0';
x *= f;
}
void print(__int128 x)//输出
{
if(x < 0)
{
x = -x;
putchar('-');
}
if(x > 9) print(x/10);
putchar(x%10 + '0');
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int _=1;
while(_--){
__int128 x,y,a,b; scan(x); scan(y); scan(a); scan(b);
__int128 ans=0,cnt=0;
//ll x,y,a,b; cin>>x>>y>>a>>b;
//ll ans=0,cnt=0;
while(1){
if(x>=y) break;
ans=max(ans,cnt+(y-1-x)/b);
x*=a; ++cnt;
}
print(ans);
cout<<"\n";
//cout<<ans<<"\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ld=long double;
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int x,y,a,b;
cin >> x >> y >> a >> b;
int ans=0;
while(x*a<=x+b and (ld)x*a+1e-8<(ld)y){
x*=a,ans++;
}
ans+=(y-1-x)/b;
cout << ans;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define deb(x) cout<<#x<<" "<<x<<endl;
#define print(arr,n) for(int i=0;i<n;++i) { cout<<arr[i]<<" "; } cout<<endl;
#define ub(x,el) upper_bound(x.begin(),x.end(),el) - x.begin()
#define lb(x,el) lower_bound(x.begin(),x.end(),el) - x.begin();
#define bs(x,el) binary_search(x.begin(),x.end(),el)
#define MOD 1000000007
#define finish return 0
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<int D, typename T> struct Vec : public vector<Vec<D - 1, T>> { static_assert(D >= 1, "Vector dimension must be greater than zero!"); template<typename... Args> Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) { }}; template<typename T> struct Vec<1, T> : public vector<T> { Vec(int n = 0, T val = T()) : vector<T>(n, val) { } };
inline ll mod(const ll& x) { return (x%MOD + MOD)%MOD; }
ll gcd(ll a, ll b, ll &x, ll &y){if(a == 0){x = 0, y = 1; return b;} ll x1, y1; ll d = gcd(b%a, a, x1, y1); x = y1 - (b/a) * x1; y = x1; return d;}
ll power(ll x,ll y, ll p) { ll res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res*x) % p; y = y>>1; x = (x*x) % p; } return res; }
ll power(ll x,ll y) { ll res = 1; while (y > 0) { if (y & 1) res = (res*x); y = y>>1; x = (x*x); } return res; }
ll mod(ll num, ll den){ return mod(mod(num) * power(den,MOD-2,MOD)); }
vector<ll> primes(ll n) { vector<ll> p; vector<bool> v(n+1,true); for(ll i=2;i*i<=n;++i) { if(v[i]) { for(ll j=i*i;j<=n;j+=i) v[j] = false; } } for(ll i=2;i<=n;++i) if(v[i]) p.push_back(i); return p; }
vector<ll> lpf(ll n){ vector<ll> v(n+1); for(ll i=1;i<=n;++i) v[i] = i; for(ll i=2;i*i<=n;++i) { if(v[i] == i) { for(ll j=i*i;j<=n;j+=i) { v[j] = i; } } } return v; }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
vector<ll> a(n);
vector<ll> b(n);
for(auto& i:a) cin>>i;
for(auto& i:b) cin>>i;
ll sum = 0;
for(ll i=0;i<n;++i)
{
sum += a[i] * b[i];
}
if(sum == 0) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include<stdio.h>
int main()
{
int N,a[100000],b[100000],i,c=0;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d",&a[i]);
for(i=0;i<N;i++)
{ scanf("%d",&b[i]);
c=a[i]*b[i]+c;}
if(c==0)
printf("Yes");
else printf("No");
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int MOD = 998244353;
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
struct DSU{
int S;
struct node{
int parent; ll sum;
};
vector<node> dsu;
DSU(int n){
S = n;
rep(i, n){
node tmp;
tmp.parent = i; tmp.sum = 1;
dsu.pb(tmp);
}
}
int root(int u){
if(dsu[u].parent == u) return u;
dsu[u].parent = root(dsu[u].parent);
return dsu[u].parent;
}
void merge(int u, int v){
u = root(u); v = root(v);
if(u == v) return;
if(getsum(u) < getsum(v)) swap(u, v);
dsu[v].parent = u;
dsu[u].sum += dsu[v].sum;
}
bool sameset(int u, int v){
if(root(u) == root(v)) return true;
return false;
}
ll getsum(int u){
return dsu[root(u)].sum;
}
};
ll mypow(ll a, ll p){
if(p <= 0) return 1LL;
if(p & 1) return (a * mypow(a, p - 1)) % MOD;
ll x = mypow(a, p / 2) % MOD;
return (x * x) % MOD;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
int n;
cin >> n;
vi f(n + 1);
ll cyc = 0LL;
DSU dsu(n + 1);
repn(i, 1, n + 1) cin >> f[i], dsu.merge(i, f[i]);
repn(i, 1, n + 1) if(dsu.root(i) == i) cyc++;
cout << mypow(2, cyc) - 1 << '\n';
return 0;
}
/*
Things to look out for:
- Integer overflows
- Make sure that max is large enough (2e9, 4e18)
- Special cases
Be careful!
*/
| #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
}
const ll N = 2e5 + 5, MOD = 998244353;
ll A[N], sz, par[N];
ll find(ll x) {
if(x == par[x]) {
return x;
}
return par[x] = find(par[x]);
}
void merge(ll x, ll y) {
ll rx = find(x), ry = find(y);
if(rx == ry) {
return;
}
par[ry] = rx;
sz--;
}
ll power(ll a, ll b, ll c) {
ll ret = 1;
while(b) {
if(b & 1) {
ret = (ret * a) % c;
}
b >>= 1;
a = (a * a) % c;
}
return ret;
}
int main() {
localTest();
fastio;
ll n;
cin >> n;
sz = n;
for(ll i = 1; i <= n; ++i) {
par[i] = i;
}
for(ll i = 1; i <= n; ++i) {
cin >> A[i];
merge(A[i], i);
}
cout << (power(2, sz, MOD) - 1 + MOD) % MOD << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define rep(i,j,n) for(int i=j;i<n;i++)
#define scn(a) scanf("%d",&a)
#define scns(a,b) scanf("%d %d",&a,&b)
#define print(a) printf("%d\n",a)
#define vec vector<int>
#define pb push_back
#define pairs pair<int,int>
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define mem(a,b) memset(a,b,sizeof(a))
#define inf INT_MAX
const int mod = 1e9+7;
const int N = 2e5+5;
int n;
int main()
{
int test; test = 1;
while(test--)
{
scn(n);
int a[n],b[n];
vector<pair<ll,pairs>> v1;
ll sum1 = 0, sum2 = 0;
rep(i,0,n)
scns(a[i],b[i]), v1.pb({2LL*a[i]+b[i],{a[i],b[i]}}), sum1 += 1LL*a[i];
sort(all(v1), greater<pair<ll,pairs>>());
int cnt = 0;
rep(i,0,n)
{
if(sum1 >= sum2)
sum2 += 1LL*v1[i].f, cnt++;
else
break;
}
print(cnt);
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k;
cin>>n>>k;
long long int s=k;
vector<pair<long long int,long long int> > v;
///s=k;
//cout<<s;
//int p=k;
for(int i=0;i<n;i++)
{
long long int a,b;
cin>>a>>b;
v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
//s=k;
for(int i=0;i<n;i++)
{
if(s<v[i].first)
break;
s+=v[i].second;
//k=s;
}
cout<<s<<endl;
// for(int i=0;i<v.size();i++)
// cout<<v[i].first<<" "<<v[i].second;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1);
int n;
int a[10010];
int solve() {
int res = 0;
for (int i = 0; i < n; i++) {
int k = 1;
for (int j = i-1; j >= 0; j--) {
if (a[i] <= a[j]) {
k++;
} else {
break;
}
}
for (int j = i+1; j < n; j++) {
if (a[i] <= a[j]) {
k++;
} else {
break;
}
}
res = max(res, a[i] * k);
}
return res;
}
void input() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll i = 0; i < N; i++)
int main()
{
int m=1000000007;
ll n; cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<vector<ll>> f(n+2,vector<ll>(2));
f[0][0]=0; f[0][1]=1;
rep(i,n){
f[i+1][0]=f[i][1]%m;
f[i+1][1]=(f[i][0]+f[i][1])%m;
}
ll ans=0;
rep(i,n){
ans=(ans%m)+(a[i]%m)*(((f[i][1]*f[n-i][1])%m)-((f[i][0]*f[n-i][0])%m))%m;
}
ans%=m;
if (ans < 0) ans += m;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x); rd(args...); }
#define fi first
#define se second
#define mkp std::make_pair
typedef long long ll;
typedef double ff;
typedef std::pair <int, int> pii;
const int kN = 5e5 + 5, kInf = 0x3f3f3f3f;
const ll kMod = 998244353, kInfLL = 0x3f3f3f3f3f3f3f3fLL;
int n, C, cnt; ll ans = 0;
pii d[kN];
int main() {
#ifndef ONLINE_JUDGE
freopen("a.in", "r", stdin);
freopen("a.out", "w", stdout);
#endif
int T = 1; //rd(T);
while(T--) {
rd(n, C);
for(int i = 1; i <= n; ++i) {
int a, b, c; rd(a, b, c);
d[++cnt] = mkp(a, c);
d[++cnt] = mkp(b + 1, -c);
}
std::sort(d + 1, d + cnt + 1);
ll cur_c = 0, ans = 0;
for(int i = 1; i < cnt; ++i) {
cur_c += d[i].se;
ans += std::min(cur_c, (ll)C) * (d[i + 1].fi - d[i].fi);
}
printf("%lld\n", ans);
} return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n,C;
cin>>n>>C;
int a[n],b[n],c[n];
map<int,int> m;
set<int> s;
for(int i=0;i<n;i++) {
cin>>a[i]>>b[i]>>c[i];
m[a[i]]+=c[i];
m[b[i]+1]-=c[i];
s.insert(a[i]);
s.insert(b[i]+1);
}
vector<int> v(s.begin(),s.end());
int size=v.size();
int cost=0,ans=0;
for(int i=0;i<size-1;i++) {
cost+=m[v[i]];
ans+=min(cost,C)*(v[i+1]-v[i]);
}
cout<<ans;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
int a[100000],b[100000],L[100005],R[100005];
int n,l;
map<int,int> M;
int main(){
scanf("%d%d",&n,&l);
fup(i,0,n-1,1)scanf("%d",a+i);
fup(i,0,n-1,1)scanf("%d",b+i);
ll ans=0;
M[1]=-1;
fup(i,0,n-1,1){
if(b[i]<a[i]){
auto it=M.find(b[i]-i);
if(it==M.end())return !printf("-1\n");
L[i]=i-it->Y;
}
M[a[i]-i]=i;
}
int tmp=0;
fdn(i,n-1,0,1){
if(L[i]>tmp){
ans+=L[i];
tmp=max(0,L[i]-1);
}else{
tmp=max(0,tmp-1);
}
}
M.clear();
M[l+1-n]=n;
fdn(i,n-1,0,1){
if(b[i]>a[i]){
auto it=M.find(b[i]-i);
if(it==M.end())return !printf("-1\n");
R[i]=it->Y-i;
}
M[a[i]-i]=i;
}
tmp=0;
fup(i,0,n-1,1){
if(R[i]>tmp){
ans+=R[i];
tmp=max(0,R[i]-1);
}else{
tmp=max(0,tmp-1);
}
}
printf("%lld\n",ans);
} | /*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
#define int long long
using namespace std;
const int N=1e5+100;
int n,l,a[N],b[N],ans;
map <int,vector<int> > mp;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
return x*f;
}
inline void getup(int l,int r)
{
for (int i=l;i<=r;)
{
int j=i,num=b[i]-i,pos=lower_bound(mp[num].begin(),mp[num].end(),i)-mp[num].begin();
while(j<=r&&b[j]-j==b[i]-i) j++;
ans+=mp[num][pos]-i;
i=j;
}
}
inline void getdown(int l,int r)
{
for (int i=r;i>=l;)
{
int j=i,num=b[i]-i,pos=upper_bound(mp[num].begin(),mp[num].end(),i)-mp[num].begin()-1;
while(j>=l&&b[j]-j==b[i]-i) j--;
ans+=i-mp[b[i]-i][pos];
i=j;
}
}
signed main()
{
// freopen("1.txt","r",stdin);
n=read();l=read();
for (int i=1;i<=n;i++) a[i]=read();
for (int i=1;i<=n;i++) b[i]=read();
a[0]=0;a[n+1]=l+1;
for (int i=0;i<=n+1;i++) mp[a[i]-i].push_back(i);
bool bl=1;
for (int i=1;i<=n;i++) if (mp[b[i]-i].empty()) bl=0;
if (!bl)
{
printf("-1\n");
return 0;
}
// for (int i=0;i<(int)mp[0].size();i++) printf("%lld ",mp[0][i]);
// printf("\n");
for (int i=1;i<=n;)
{
int j=i;
while(j<=n&&(b[j]<=a[j])==(b[i]<=a[i])) j++;
if (b[i]<=a[i]) getdown(i,j-1);
else getup(i,j-1);
i=j;
}
printf("%lld\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
void solve() {
int N, M;
cin >> N >> M;
vector<int> A(M);
for (auto &x : A) {
cin >> x;
}
sort(ALL(A));
vector<int> df;
// 左右の幅の最小値
int minv = 1e9, before = 0;
for (auto &x : A) {
if (x - before - 1 >= 1) {
minv = min(minv, x - before - 1);
df.emplace_back(x - before - 1);
}
before = x;
}
if (before != N) {
minv = min(minv, N - before);
df.emplace_back(N - before);
}
int sum = 0;
for (auto x : df) {
sum += CEIL(x, minv);
}
cout << sum << endl;
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
solve();
}
| #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 998244353
#define pll pair<long long,long long>
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long power(long long a,long long b){
long long ans=1;
while(b>0){
if(b&1){ans=(ans*a)%mod;}
a=(a*a)%mod;
b>>=1;
}
return ans;
}
int fact[1000005],fact_inv[1000005];
void pre(){
fact[0]=1;
fact_inv[0]=1;
for(int i=1;i<200005;i++){
fact[i]=fact[i-1]*i;
fact[i]%=mod;
fact_inv[i]=power(fact[i],mod-2);
}
}
long long ncr(long long n,long long r){
if(n<r){return 0;}
if(n==r||r==0){return 1;}
return (((fact[n]*fact_inv[n-r])%mod)*fact_inv[r])%mod;
//return x;
}
//find_by_order() -> iterator to the k-th largest element (counting from zero)
//order_of_key() -> the number items in a set that are strictly smaller than our item aka index in set
//upper bound : strictly greater than x
//lower bound : greater equal to x
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m;
cin>>n>>m;
if(m==0){
cout<<1;
return 0;
}
int a[m];
for(int i=0;i<m;i++){
cin>>a[i];
}
sort(a,a+m);
vector<int>v;
if(a[0]!=1)v.pb(a[0]-1);
if(a[m-1]!=n)v.pb(n-a[m-1]);
for(int i=1;i<m;i++){
if(a[i]==a[i-1]+1)continue;
v.pb(a[i]-a[i-1]-1);
}
if(v.empty()){
cout<<0;
return 0;
}
sort(v.begin(),v.end());
int ans=0;
for(int i=0;i<v.size();i++){
if(v[i]%v[0]==0)ans+=v[i]/v[0];
else ans+=(v[i]/v[0])+1;
}
cout<<ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
template<typename T> void dbg_a(T *a,int l,int r){cerr<<" {";for(int i = l;i<r;i++) cerr<<a[i]<<", ";cerr<<a[r]<<"}"<<endl;}
typedef long long ll;
#define int ll
inline int read(){
int f(1),r(0);char c(getchar());
while(c<'0'||c>'9'){if(c == '-') f = -1; c = getchar();}
while(c>='0'&&c<='9'){ r = (r<<1) + (r<<3) + c - '0';c = getchar();}
return f*r;
}
typedef pair<int,int> PII;
#define fi first
#define se second
#define mst(a,b) memset(a,b,sizeof(a))
#define For(i,a,b) for(int i = a;i<=b;i++)
#define For_(i,a,b) for(int i = a;i>=b;i--)
#define _for(i,a) for(int i = 0;i<a;i++)
#define _sum(a,l,r) accumulate(a + l,a + r + 1,0)
#define All(x) x.begin(),x.end()
#define lowbit(x) ((-x)&x)
// For(i,1,n) For(j,1,m) printf("f[%lld][%lld] = %lld\n",i,j,f[i][j]);
//const ll INF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const int N = 1000 + 6,M = 2e5*2 + 6,Q = 2e6 + 5;
const int mod = 2017;
int n,m;
void solve(){
int R = read();
int X = read(),Y = read();
//dbg_out((X*X + Y*Y)/R*R);
int ans = ceil(sqrt((long double)(X*X + Y*Y)/(long double)(R*R)));
if(R*R > X*X + Y*Y){
ans = 2;
}
cout<<ans<<"\n";
}
signed main(){
int T = 1;
//T = read();
while(T--) solve();
system("pause");
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <iterator>
#include <queue>
#define ll long long int
using namespace std;
bool isOk(ll r,ll x,ll y,ll num){
if( (x*x + y*y) <= (num*num*r*r)){
return true;
}else{
return false;
}
}
int main()
{
ll R,X,Y;
cin>>R>>X>>Y;
if( R*R > X*X + Y*Y){
cout<<2<<endl;
}else{
for(ll i = 0; i < 2000000; i++){
if( X*X + Y*Y <= i*i*R*R){
cout<<i<<endl;
break;
}
}
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n % 2 == 0)
cout<<"White";
else
cout<<"Black";
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#define rep(i,n) for (int i=0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int i;
cin >> i;
if(i < 0){
i = 0;
}
cout << i << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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 main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int t;
cin >> t;
ll l, r;
rep(i, t){
cin >> l >> r;
ll ans = max(0LL,(r-l-l+1))*max(0LL,(r-l-l+1+1))/2;
cout << ans << endl;
}
return 0;
}
| #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12
//priority_queue<int,vector<int>, greater<int> > q2;
int solve(int L, int R) {
int res = 0;
int tmp = R - L;
if (tmp < L)return 0;
int ans = tmp - L + 1;
//cout << ans << endl;
res = ans * (ans + 1) / 2;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t; cin >> t;
while (t--) {
int A, B, C; cin >> A >> B;
cout << solve(A, B) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define PI pair<int,int>
using namespace std;
const int maxm=2e6+5;
struct Mat{
int a[3][3];
void init(){
memset(a,0,sizeof a);
}
Mat operator*(const Mat& x){
Mat ans;ans.init();
for(int k=0;k<3;k++){
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
ans.a[i][j]+=a[i][k]*x.a[k][j];
}
}
}
return ans;
}
};
int x[maxm],y[maxm];
Mat T[maxm];
int n,m,q;
void solve(){
cin>>n;
for(int i=1;i<=n;i++)cin>>x[i]>>y[i];
cin>>m;
T[0]={1,0,0,0,1,0,0,0,1};//T[0]是单位矩阵
for(int i=1;i<=m;i++){
int op;cin>>op;
Mat t;
if(op==1){//顺时针旋转90度
t={0,1,0,-1,0,0,0,0,1};
}else if(op==2){//逆时针旋转90度
t={0,-1,0,1,0,0,0,0,1};
}else if(op==3){//关于x=p对称
int p;cin>>p;
t={-1,0,2*p,0,1,0,0,0,1};
}else if(op==4){//关于y=p对称
int p;cin>>p;
t={1,0,0,0,-1,2*p,0,0,1};
}
T[i]=t*T[i-1];
}
cin>>q;
for(int i=1;i<=q;i++){
int a,b;cin>>a>>b;
Mat t={x[b],0,0,y[b],0,0,1,0,0};
t=T[a]*t;
cout<<t.a[0][0]<<' '<<t.a[1][0]<<endl;
}
}
signed main(){
ios::sync_with_stdio(0);
solve();
return 0;
}
/*
1.顺时针旋转90度:
(x,y)->(y,-x)
2.逆时针旋转90度:
(x,y)->(-y,x)
3.关于x=p对称:
(x,y)->(2p-x,y)
4.关于y=p对称:
(x,y)->(x,2p-y)
*/
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
P op1(P v) {
return make_pair(v.second, -v.first);
}
P op2(P v) {
return make_pair(-v.second, v.first);
}
P op3(P v, ll p) {
return make_pair(2 * p - v.first, v.second);
}
P op4(P v, ll p) {
return make_pair(v.first, 2 * p - v.second);
}
int main() {
int N;
cin >> N;
vector<ll> X(N), Y(N);
rep(i, N) cin >> X[i] >> Y[i];
int M;
cin >> M;
vector<vector<P> > transformed(M + 1, vector<P>(3));
transformed[0][0] = make_pair(0, 0);
transformed[0][1] = make_pair(1, 0);
transformed[0][2] = make_pair(0, 1);
rep(i, M) {
int op;
cin >> op;
if (op == 1) {
transformed[i + 1][0] = op1(transformed[i][0]);
transformed[i + 1][1] = op1(transformed[i][1]);
transformed[i + 1][2] = op1(transformed[i][2]);
} else if (op == 2) {
transformed[i + 1][0] = op2(transformed[i][0]);
transformed[i + 1][1] = op2(transformed[i][1]);
transformed[i + 1][2] = op2(transformed[i][2]);
} else {
ll p;
cin >> p;
if (op == 3) {
transformed[i + 1][0] = op3(transformed[i][0], p);
transformed[i + 1][1] = op3(transformed[i][1], p);
transformed[i + 1][2] = op3(transformed[i][2], p);
} else if (op == 4) {
transformed[i + 1][0] = op4(transformed[i][0], p);
transformed[i + 1][1] = op4(transformed[i][1], p);
transformed[i + 1][2] = op4(transformed[i][2], p);
}
}
}
int Q;
cin >> Q;
rep(i, Q) {
int A, B;
cin >> A >> B;
cout << X[B - 1] * (transformed[A][1].first - transformed[A][0].first) + Y[B - 1] * (transformed[A][2].first - transformed[A][0].first) + transformed[A][0].first << ' ' << X[B - 1] * (transformed[A][1].second - transformed[A][0].second) + Y[B - 1] * (transformed[A][2].second - transformed[A][0].second) + transformed[A][0].second << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
// URL: https://atcoder.jp/contests/abc190/tasks/abc190_c
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repll(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repsll(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define pb push_back
#define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
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; }
const ll INFL = 1e18;
const int INF = 1e9;
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, 1, -1, 0};
int main(){
optimize_cin();
int N, M;
cin >> N >> M;
vi A(M), B(M);
rep(i, M){
cin >> A.at(i) >> B.at(i);
}
int K;
cin >> K;
vi C(K), D(K);
rep(i, K){
cin >> C.at(i) >> D.at(i);
}
ll pattern = 1, diff = 0;
rep(i, K) pattern *= 2;
diff = pattern;
pattern *= 2;
int max = 0;
repsll(i, diff, pattern){
int cnt = 0, ord = 0, tmp = i;
vi dish(N, 0);
while(tmp > 0){
if(tmp % 2 == 0) dish[C[ord] - 1]++;
else dish[D[ord] - 1]++;
tmp /= 2;
ord++;
if(ord == K) break;
}
rep(j, M){
if(dish[A[j] - 1] > 0 && dish[B[j] - 1]) cnt++;
}
chmax(max, cnt);
}
cout << max << endl;
return 0;
} | # pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rep2(i,a,b) for(int i = (b) - 1; i >= (a); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define em emplace
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define x first
#define y second
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using pl = pair<ll, ll>;
using tl = tuple<ll, ll, ll>;
const int MOD = 998244353;
int N, W[111], tot;
template<class T> struct mi {
T val;
mi() { val = 0; }
mi(const ll& v) {
val = (-MOD <= v && v <= MOD) ? v : v % MOD;
if (val < 0) val += MOD;
}
mi operator + (const mi& m) {
T tmp = (val + m.val) % MOD;
return tmp + (tmp < 0 ? MOD : 0);
}
mi operator - (const mi& m) {
T tmp = (val - m.val) % MOD;
return tmp + (tmp < 0 ? MOD : 0);
}
mi operator * (const mi& m) {
T tmp = (val * m.val) % MOD;
return tmp;
}
mi& operator += (const mi& m) {
if ((val += m.val) >= MOD) val -= MOD;
return *this;
}
mi& operator -= (const mi& m) {
if ((val -= m.val) < 0) val += MOD;
return *this;
}
mi& operator *= (const mi& m) {
val = (val * m.val) % MOD;
return *this;
}
};
mi<ll> f[111], dp[111][11111], ans;
int main() {
cin.tie(0) -> sync_with_stdio(false); cout.tie(0);
cin >> N;
rep(i, 0, N) {
cin >> W[i];
tot += W[i];
}
if(tot & 1){cout << "0\n"; return 0;}
tot >>= 1;
f[0] = 1;
rep(i, 1, N + 1) f[i] = f[i - 1] * i;
dp[0][0] = 1;
rep(i, 0, N) rep2(j, 0, i + 1) rep(k, W[i], 100 * N + 1) {
dp[j + 1][k] += dp[j][k - W[i]];
}
rep(j, 0, N + 1) ans += f[j] * f[N - j] * dp[j][tot];
cout << ans.val << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll r,x,y;
cin >> r >> x >> y;
ll po = x*x + y*y;
ll res = 0;
r *= r;
res = po / r;
//cout << res << endl;
//cout << pow((ll)(sqrt(res)),2) << endl;
if(pow((ll)(sqrt(res)),2) == res && po % r == 0){
res = sqrt(res);
}
else {
res = sqrt(res);
res += 1;
res = max(res,(ll)2);
}
cout << res << endl;
} | # include <cstdio>
int t[100],t_n=0;
bool b[12];
void work(int x) {
int now=x;
t[t_n++]=now; b[now]=true;
while(!b[now*x%10]) now=now*x%10, b[now]=true, t[t_n++]=now;
}
int qpow(int x,int p,int mod) {
int res=1;
while(p) {
if(p&1) res=1ll*res*x%mod;
x=1ll*x*x%mod; p>>=1;
}
return (res-1+mod)%mod;
}
int main() {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
work(a%10);
printf("%d",t[qpow(b,c,t_n)]);
return 0;
} |
#include <string>
#include <iostream>
#include <stack>
#include <queue> // priority_queue も入ってる
#include <set> // 要素数は size() で取得 multisetもある
#include <map>
#include <array> // sizeはコンパイル時定数で固定
#include <vector>
#include <numeric> // accumulate, gcd
#include <algorithm> // count_ifに必要
#include <iomanip> // cout << setprecision(15) << x で小数の出力精度を指定
#include <tuple>
#include <utility> //pair
#include <cmath>
#include <random>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// BIT
// Binary Indexed Tree
// Fenwick Tree
// Inverse Semigroup で使えますが、普通は群でしょう。
// 可逆でなく、単なるモノイドの場合はセグメントツリーを使うこと。
// 0番は空けて、1-indexedです。
// 3 1 4 1 5 9 2 6 5 3 5を1回更新して1回区間和を出す例題になってます。
// 更新メソッド
// incrementは増分。新しい値そのものではないので注意！
int updateTree(vector<ll> &tree, int index, ll increment)
{
while (index < tree.size())
{
tree[index] = tree[index] ^ increment;
// 1110 = 1110 + 0010 → 10000 みたいな。一番下位の1を足す。
index += (index & (-index));
}
return 0;
}
// 累積和取得メソッド。区間和の取得はこれの差で。
ll getSum(vector<ll> &tree, int index)
{
ll result = 0;
while (index > 0)
{
result = result ^ tree[index];
index -= (index & (-index));
}
return result;
}
int main()
{
// TODO: 入力を受け取る。
ll n, q;
cin >> n >> q;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> T(q), X(q), Y(q);
rep(i, q) cin >> T[i] >> X[i] >> Y[i];
// 構築。
vector<ll> tree(n + 1, 0);
for (int i = 1; i <= n; ++i)
{
updateTree(tree, i, a[i - 1]);
}
// TODO: クエリの処理
rep(i, q)
{
// 0 <= i <= q-1
if (T[i] == 1)
{
// update
updateTree(tree, X[i], Y[i]);
}
else
{
// output
ll result = getSum(tree, Y[i]) ^ getSum(tree, X[i] - 1);
cout << result << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define isz(x) (int)(x).size()
struct Fenwick {
std::vector<int> data;
Fenwick(int n) : data(n,0) { }
void inc(int p, int x) {
for (int i = p; i < isz(data); i |= i+1)
data[i] += x;
}
void inverse(int i) {
int oldValue = get(i,i);
int newValue = 1-oldValue;
inc(i,newValue-oldValue);
}
int get(int r) {
int res(0);
while (r >= 0) {
res += data[r];
r = (r & (r+1)) - 1;
}
return res;
}
int get(int l, int r) {
return get(r) - get(l-1);
}
};
int main() {
int n,q;
scanf("%d %d", &n, &q);
std::vector<Fenwick> fenw(30,Fenwick(1+n));
for (int i = 1, a; i <= n; i++) {
scanf("%d", &a);
for (int bit = 0; bit < 30; bit++)
if((a >> bit)&1)fenw[bit].inverse(i);
}
while (q --> 0) {
int t,x,y; scanf("%d %d %d", &t, &x, &y);
if (t == 1) {
for (int bit = 0; bit < 30; bit++)
if ((y >> bit) & 1) fenw[bit].inverse(x);
} else {
int answ{0};
for (int bit = 0; bit < 30; bit++)
answ |= (fenw[bit].get(x,y)&1) << bit;
printf("%d\n", answ);
}
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 == 0)
cout << "White" << endl;
else
cout << "Black" << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long lint;
#define int lint
const int MOD = 1e9 + 7;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i
signed main()
{
int n;
cin >> n;
if (n % 2 == 0)
cout << "White" << endl;
else
cout << "Black" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
ll x;
map<ll, ll> sv;
ll f(ll y){
if (sv.find(y) != sv.end()) return sv.find(y)->second;
sv[y] = 0LL;
ll &ans = sv[y];
if (y>x){
if (y&1){
ll ri = y+1LL;
ll le = y-1LL;
return ans = min(f(ri)+1LL, f(le)+1LL);
}else{
ll ab = y-x;
ll divi = y/2;
return ans = min(f(x) + ab, f(divi) + 1);
}
}else if (y<x){
return ans = x-y + f(x);
}else return ans = 0LL;
}
void solve(){
ll y; cin >> x >> y;
cout << f(y) << '\n';
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1; //cin >> t;
while(t--) solve();
return 0;
}
// NK
| #include<bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define elif else if
#define INF 1000000007
using namespace std;
int a,b,k,m,n,cnt=0,aa[110000];
string s,t;
char c;
signed main()
{
cin>>n>>k>>m;
rep(i,n-1){
cin>>aa[i];
cnt+=aa[i];
}
if(n*m-cnt>k){
cout<<-1;
}elif(n*m-cnt<0){
cout<<0;
}else{
cout<<n*m-cnt;
}
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, w, n, m;
cin >> h >> w >> n >> m;
map<P, int> ab;
rep(i, 0, n) {
int a, b;
cin >> a >> b;
ab[P(a - 1, b - 1)] = 0;
}
map<P, int> cd;
rep(i, 0, m) {
int c, d;
cin >> c >> d;
cd[P(c - 1, d - 1)] = 0;
}
Field(bool) yoko(h, vector<bool>(w, false));
bool l = false;
rep(i, 0, h) {
int s = 0;
l = false;
rep(j, 0, w) {
if (ab.find(P(i, j)) != ab.end()) {
rep(k, s, j + 1) {
yoko[i][k] = true;
}
l = true;
s = j + 1;
} else if (cd.find(P(i, j)) != cd.end()) {
if (l) {
l = false;
rep(k, s, j) { yoko[i][k] = true; }
s = j + 1;
} else {
rep(k, s, j) { yoko[i][k] = false; }
s = j + 1;
}
}
}
if (l) {
rep(k, s, w) {
yoko[i][k] = true;
}
}
}
Field(bool) tate(h, vector<bool>(w, false));
l = false;
rep(i, 0, w) {
int s = 0;
l = false;
rep(j, 0, h) {
if (ab.find(P(j, i)) != ab.end()) {
rep(k, s, j + 1) {
tate[k][i] = true;
l = true;
}
s = j + 1;
} else if (cd.find(P(j, i)) != cd.end()) {
if (l) {
l = false;
rep(k, s, j) { tate[k][i] = true; }
s = j + 1;
} else {
rep(k, s, j) { tate[k][i] = false; }
s = j + 1;
}
}
}
if (l) {
rep(k, s, h) {
tate[k][i] = true;
}
}
}
int ans = 0;
rep(i,0,h) rep(j,0,w){
if (yoko[i][j] || tate[i][j]) ans++;
}
cout << ans << endl;
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} | #include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
struct edge {ll to, cost, k;};
//=============dijkstra============================
vector<ll> dijkstra(ll s, ll V, vector<vector<edge>>& G)
{
vector<ll> d(V, INF);
typedef pair<ll, ll> P;// first は最短距離 second は頂点の番号
priority_queue<P, vector<P>, greater<P>> que;
d.at(s) = 0;
que.push(P(0, s));
while (!que.empty())
{
P p = que.top();
que.pop();
ll v = p.second;
if (d.at(v) < p.first) continue;
for (ll i = 0; i < G.at(v).size(); ++i)
{
edge e = G.at(v).at(i);
if (d.at(e.to) > ((d.at(v) + e.k - 1) / e.k) * e.k + e.cost)
{
d.at(e.to) = ((d.at(v) + e.k - 1) / e.k) * e.k + e.cost;
que.push(P(d.at(e.to), e.to));
}
}
}
return d;
}
//=================================================
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, M, X, Y;
cin >> N >> M >> X >> Y;
X -= 1, Y -= 1;
vector<vector<edge>> connection(N);
for (ll i = 0; i < M; ++i) {
ll a, b, t, k;
cin >> a >> b >> t >> k;
a -= 1, b -= 1;
connection.at(a).push_back({b, t, k});
connection.at(b).push_back({a, t, k});
}
vector<ll> d = dijkstra(X, N, connection);
if (d.at(Y) == INF) {
cout << -1 << "\n";
}
else {
cout << d.at(Y) << "\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
int a=0,fh=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')fh=-1;c=getchar();}
while('0'<=c&&c<='9'){
a=a*10+c-48;
c=getchar();
}
return a*fh;
}
#define MN 200005
#define pii pair<int,int>
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define vc vector
int n,k;
int id[MN],DEP[MN],dep[MN],fa[MN],w[MN],sec[MN];
int vis[MN],dfn[MN],cnt,ID[MN],siz[MN];
bool cmp(int a,int b){return dep[a]<dep[b];}
vector<int>e[MN];
void dfs(int x){
dfn[x]=++cnt;
ID[cnt]=x;
dep[x]=dep[fa[x]]+1;
siz[x]=1;
for(int i=0;i<e[x].size();++i){
int v=e[x][i];
if(fa[x]==v)continue;
fa[v]=x;dfs(v);
if(DEP[v]>DEP[w[x]]){
sec[x]=DEP[w[x]]+1;
w[x]=v;
}
else sec[x]=max(sec[x],DEP[v]+1);
siz[x]+=siz[v];
}
DEP[x]=DEP[w[x]]+1;
}
int mid,st[MN],top,FA[MN];
void DFS(int x){
st[++top]=x;
if(dep[x]>mid)FA[x]=st[top-mid];
else FA[x]=1;
for(int i=0;i<e[x].size();++i){
int v=e[x][i];
if(fa[x]==v)continue;
DFS(v);
}
top--;
}
int mx[MN<<2];
#define Ls (x<<1)
#define Rs (x<<1|1)
void pushup(int x){
mx[x]=max(mx[Ls],mx[Rs]);
}
void build(int x,int l,int r){
if(l==r){mx[x]=dep[ID[l]];return;}
int mid=l+r>>1;
build(Ls,l,mid);
build(Rs,mid+1,r);
pushup(x);
}
void del(int x,int l,int r,int loc){
if(l==r){mx[x]=0;return;}
int mid=l+r>>1;
if(loc<=mid)del(Ls,l,mid,loc);
else del(Rs,mid+1,r,loc);
pushup(x);
}
int ask(int x,int l,int r,int b,int e){
if(b<=l&&r<=e)return mx[x];
if(l>e||r<b)return 0;
int mid=l+r>>1;
if(e<=mid)return ask(Ls,l,mid,b,e);
if(b>mid)return ask(Rs,mid+1,r,b,e);
return max(ask(Ls,l,mid,b,e),ask(Rs,mid+1,r,b,e));
}
void fk(int x){
if(vis[x])return;
del(1,1,n,dfn[x]);
vis[x]=1;
for(int i=0;i<e[x].size();++i){
int v=e[x][i];
if(fa[x]==v)continue;
if(!vis[v]){
fk(v);
}
}
}
bool chk(){
build(1,1,n);
DFS(1);
for(int i=1;i<=n;++i)vis[i]=0;
int tot=0;
for(int i=1;i<=n;++i){
int x=id[i];
if(!vis[x]){
tot++;
int u=FA[x],t=mid;
fk(u);
while(t&&fa[u]&&ask(1,1,n,dfn[fa[u]],dfn[fa[u]]+siz[fa[u]]-1)-dep[fa[u]]+1<=t){
t--;u=fa[u];
fk(u);
}
}
}
return tot<=k;
}
signed main(){
n=read();k=read();
for(int i=1;i<n;++i){
int u=read(),v=read();
e[u].pb(v);e[v].pb(u);
}
dfs(1);for(int i=1;i<=n;++i)id[i]=i;
sort(id+1,id+1+n,cmp);reverse(id+1,id+1+n);
int l=-1,r=n;
while(l+1<r){
mid=(l+r)>>1;
if(chk())r=mid;
else l=mid;
}
printf("%lld\n",r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(v) int((v).size())
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define int ll
int n, k;
vector<int> tree[222'222];
int cnt = 0;
int dfs(int now, int before, int U)
{
int x = 0;
for (int nxt: tree[now])
{
if (nxt == before) continue;
int y = dfs(nxt, now, U);
if (x > y) swap(x, y);
if (x <= 0 && y > 0 && y - x <= U)
x = y;
}
if (x == -U)
{
++cnt;
x = 1;
}
else if (x <= 0)
{
--x;
}
else ++x;
return x;
}
bool test(int U)
{
cnt = 0;
int cur = dfs(0, 0, U);
if (cur < 0) ++cnt;
return cnt <= k;
}
void solve()
{
cin>>n>>k;
forn(_, n-1)
{
int a, b; cin>>a>>b; --a, --b;
tree[a].push_back(b);
tree[b].push_back(a);
}
int lf = 0, rg = 222'222;
while(lf < rg)
{
int mid =( lf + rg) / 2;
if (test(mid)) rg = mid;
else lf = mid + 1;
}
cout << lf << endl;
}
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0);
signed T = 1; // cin >> T;
for(int i=1;i<=T;++i)
{
solve();
}
return 0;
} |
// -- //
#include <bits/stdc++.h>
#define pll pair<ll, ll>
#define x first
#define y second
using namespace std;
typedef long long ll;
const ll N = 808;
ll a[N][N];
ll p[N][N];
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll n, k;cin >> n>>k;
for(ll i = 0;i<n;i++){
for(ll j = 0;j<n;j++){
cin >> a[i][j];
}
}
ll l = -1, r=1e9; //(l;r]
while(r-l>1){
ll m = (l+r)>>1;
bool ok =0;
for(ll i = 0;i<n&&!ok;i++){
for(ll j = 0;j<n&&!ok;j++){
p[i][j] = (a[i][j]>m?-1:1);
if(i) p[i][j]+=p[i-1][j];
if(j) p[i][j]+=p[i][j-1];
if(i&&j) p[i][j]-=p[i-1][j-1];
if(i>=k-1&&j>=k-1){
ll e = p[i][j];
if(i-k>=0) e-=p[i-k][j];
if(j-k>=0) e-=p[i][j-k];
if(i-k>=0&&j-k>=0) e+=p[i-k][j-k];
if(e>=0) ok=1;
}
}
}
// ok=1 if exists square with median <= m
if(ok) r=m;
else l=m;
}
cout<<r;
}
| #include <bits/stdc++.h>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr),cout.precision(12)
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<int, int, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_map;
#define sbc __builtin_popcount
#define pb push_back
#define pbk pop_back
#define em emplace
#define emb emplace_back
#define ff first
#define ss second
#define ll long long
const ll mod = 1e9 + 7;
template<typename T> void smax(T& a, T b) { if(a<b) a=b; }
template<typename T> void smin(T& a, T b) { if(a>b) a=b; }
template<typename T> T pw(T a,T b) { T p=1,one=1; while(b) { if(b&one) p=p*a; a=a*a; b >>=1; } return p; }
template<typename T> T pwm(T a,T b,T md=mod) { T p=1,one=1; while(b) { if(b&one) p=p*a%md; a=a*a%md; b >>=1; } return p; }
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &it:v)
is >> it;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &it) {
os << it.first << ' ' << it.second;
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const array<T, 2> &v) {
for (auto &it : v) os << it << ' ';
return os;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto &it : v)
os << it << ' ';
return os;
}
#ifndef ONLINE_JUDGE
class Timer { chrono::high_resolution_clock::time_point start_t, end_t; public: Timer() { start_t=chrono::high_resolution_clock::now(); } ~Timer() { end_t = chrono::high_resolution_clock::now(); auto duration = chrono::duration_cast<chrono::milliseconds>(end_t-start_t); cerr<<"\nRunTime: "<<duration.count()<<"ms"<<'\n'; } };
void debug() { cerr << '\n'; }
template<typename T, typename... Args>
void debug(T print, Args... args) {
cerr << ' ' << print;
debug(args...);
}
#define deb(...) cerr << "[" << #__VA_ARGS__ << "]" << " --> ", debug(__VA_ARGS__)
#else
#define deb(...) void(0)
#endif
void solve() {
int n;
int64_t c;
cin>>n>>c;
map<int,pair<int64_t,int64_t>> mp;
for(int i=0,x,y,z;i<n;++i) {
cin>>x>>y>>z;
mp[x].ff+=z;
mp[y].ss+=z;
}
int64_t ans=0;
int p=mp.begin()->ff-1;
int64_t s=0;
for(auto& it:mp) {
int pos=it.ff;
int64_t add=it.ss.ff, sub=it.ss.ss;
if(pos-p>1)
ans+=min(s,c)*(pos-p-1);
s+=add;
ans+=min(s,c);
s-=sub;
p=pos;
}
cout<<ans<<'\n';
}
int main() {
speedup;
//int t; cin >> t; while (t--)
solve();
}
/**Vim
*
*
*
*
*
*
*
*
*/
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001;
void solve() {
int N, Q; cin >> N >> Q;
vl A(N); F0R(i, N) cin >> A[i];
while(Q--) {
ll K; cin >> K;
ll lo = 0, hi = 3e18;
while (lo < hi) {
ll mid = (lo+hi)/2;
ll num = ub(all(A), mid) - A.begin();
if (mid-num >= K) {
hi = mid;
} else {
lo = mid+1;
}
}
cout << lo << nl;
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int T = 1;
// cin >> T;
while(T--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N, K; cin >> N >> K;
vector<vector<int>> A(N, vector<int>(N));
for (auto &a : A) for (auto &v : a) cin >> v;
int l = -1, h = 1e9, m;
while (h - l > 1) {
m = l + (h - l) / 2;
// cout << "# m : " << m << endl;
vector<vector<int>> acc(N + 1, vector<int>(N + 1));
REP(i, 0, N) {
REP(j, 0, N) {
acc[i + 1][j + 1] = acc[i + 1][j] + acc[i][j + 1] - acc[i][j] + (A[i][j] <= m);
}
}
bool ok = false;
REP(i, 0, N) {
if (i + K > N) continue;
REP(j, 0, N) {
if (j + K > N) continue;
if (acc[i + K][j + K] - acc[i + K][j] - acc[i][j + K] + acc[i][j] >= (K * K + 1) / 2) ok = true;
}
}
if (ok) h = m;
else l = m;
}
cout << h << endl;
return 0;
}
|
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int > pii;
const ll maxn = 1005;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);
#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll q_pow(ll a,int k)
{
ll ans=1;
while(k)
{
if(k&1)
ans=(ans*a)%mod;
a=(a*a)%mod;
k>>=1;
}
return ans;
}
int n;
char aa, ab, ba, bb;
ll dp[maxn];
int32_t main()
{
cin >> n >> aa >> ab >> ba >> bb;
if(n <= 3)
dokme(1);
if(ab == 'B')
{
if(bb == 'B')dokme(1);
if(ba == 'A')dokme(q_pow(2ll, n - 3));
dp[2]=1;
dp[3]=1;
for(int i=4; i<=n; i++)
dp[i]=(dp[i-1]+dp[i-2])%mod;
dokme(dp[n]);
}
else
{
if(aa == 'A')dokme(1);
if(ba == 'B')dokme(q_pow(2ll, n - 3));
dp[2]=1;
dp[3]=1;
for(int i=4; i<=n; i++)
dp[i]=(dp[i-1]+dp[i-2])%mod;
dokme(dp[n]);
}
return(0);
}
| /*
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
*/
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define db double
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<<"; "<<#b<<" = "<<b<<endl
using namespace std;
const ll INF = 1LL<<60;
const int inf = 1<<30;
const int maxn = 2e5+5;
inline void fastio() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
int a[maxn],p[maxn],x[maxn];
int main()
{
fastio();
int n; cin >> n;
rep(i,1,n) cin >> a[i] >> p[i] >> x[i];
int ans = inf;
rep(i,1,n){
if(a[i] <= (x[i]-1) ) ans = min(ans,p[i]);
}
if(ans==inf) cout << -1 << endl;
else cout <<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vs = vector<string>;
using vl = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvl = vector<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 all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define dame { puts("No"); return 0;}
#define y_n {puts("Yes");}else{puts("No");}
#pragma endregion
#pragma region debug for var, v, vv
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){cout << endl;int cnt = 0;for(const auto& v : vv){cout << cnt << "th : "; view(v); cnt++;} cout << endl;}
#pragma endregion
const ll mod = 1000000007;
const int inf = 1001001001;
const ll INF = 1001001001001001001;
const int MAX = 2000005;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
template<class T>bool chmax(T &a, const T b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T b) { if (b<a) { a=b; return 1; } return 0; }
ll modpow(ll a, ll p){ll ret = 1; while(p){if(p & 1){ret = ret * a % mod;} a = a * a % mod; p >>= 1;} return ret;}
/*--------------------------------------------------------------------------------------------------------------------------------*/
ll dist[20][20];
ll dp[(1<<20) + 1][21];
int n;
ll rec(int bit, int v)
{
// すでに探索済みだったらリターン
if (dp[bit][v] != -1) return dp[bit][v];
// 初期値
if (bit == (1<<v)) {
return dp[bit][v] = 0;
}
// 答えを格納する変数
ll res = INF;
// bit の v を除いたもの
int prev_bit = bit & ~(1<<v);
// v の手前のノードとして u を全探索
for (int u = 0; u < n; ++u) {
if (!(prev_bit & (1<<u))) continue; // u が prev_bit になかったらダメ
// 再帰的に探索
if (res > rec(prev_bit, u) + dist[u][v]) {
res = rec(prev_bit, u) + dist[u][v];
}
}
return dp[bit][v] = res; // メモしながらリターン
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vl x(n), y(n), z(n);
rep(i,n) cin >> x[i] >> y[i] >> z[i];
rep(i,n) rep(j,n) dist[i][j] = abs(x[i] - x[j]) + abs(y[i] - y[j]) + max(0ll, z[j] - z[i]);
for (int bit = 0; bit < (1<<n); ++bit){
for (int v = 0; v < n; ++v){
dp[bit][v] = -1;
if(__builtin_popcount(bit) == 1 && (bit & (1 << v))){
dp[bit][v] = dist[0][v];
}
}
}
ll res = rec((1<<n)-1, 0);
cout << res << endl;
}
| #include<stdio.h>
#include<algorithm>
#define nmax 18
#include<cstring>
#define INF 0x3f3f3f3f
using namespace std;
int n; //城市数
struct City{
int x, y, z;
}city[nmax];
int dp[nmax][1<<nmax]; //到城市，状态的最小花费
int dis[nmax][nmax]; //城市之间的花费
int ans=INF;
int dist(City a, City b);
void read();
void create_dis();
void dpprocess();
int main()
{
read();
create_dis();
dpprocess();
printf("%d", ans);
return 0;
}
void read()
{
scanf("%d", &n);
for( int i=1; i<=n; i++ )
scanf("%d%d%d", &city[i].x, &city[i].y, &city[i].z);
}
int dist(City a, City b)
{
return abs(a.x-b.x)+abs(a.y-b.y)+max(0, b.z-a.z);
}
void create_dis()
{
for( int i=1; i<=n; i++ )
for( int j=1; j<=n; j++ )
dis[i][j] = dist(city[i], city[j]);
}
void dpprocess()
{
memset(dp[0], INF, sizeof(dp)); //fill函数用错了，要加【0】
// for( int i=1; i<=n; i++ )
// for( int j=1; j<(1<<n); j++ )
// dp[i][j] = INF;
dp[1][1]=0;
for( int i=1; i<(1<<n); i++ ) //现在的状态
for( int j=1; j<=n; j++ ) //到哪个城市
{
if( i&( 1<<(j-1) ) ) //如果这个状态经过了这个城市
{
for( int k=1; k<=n; k++ )
{
if( i&( 1<<(k-1) ) && j!=k ) //试试这个状态其他的经过的城市
dp[j][i] = min( dp[j][i], dp[k][i^( 1<<(j-1) )]+dis[k][j] );
}
}
}
for( int i=2; i<=n; i++ )
ans = min( ans, dp[i][(1<<n)-1]+dis[i][1] );
} |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int> > sunuke(N, vector<int>(3));
for(int i = 0; i < N; i++){
cin >> sunuke[i][0];
cin >> sunuke[i][1];
cin >> sunuke[i][2];
}
set<int> st;
for(int i = 0; i < N; i++){
if(sunuke[i][2] - sunuke[i][0] > 0) st.insert(sunuke[i][1]);
}
cout << (st.empty() ? -1 : *st.begin()) << endl;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmds
#define y0 hNNNNy_yNNNNNN_sNh
#define y1 mNNNNNdtdNNNNNNtsNNm
#define yn mNNNNNNNNy___smNNNms
#define tm oooooosyysooooot
#define read tyhyt
#define rank ytmNmo
#define index yyy
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i,a,b) for(int i = (b); i >= (a); i--)
#define rall(x,a) for(auto x : a)
#define MOD 1000000007
#define endl "\n"
typedef long long ll;
using namespace std;
int solve() {
int n;
cin >> n;
int ans = -1;
rep(i, 1, n) {
int a, p, x;
cin >> a >> p >> x;
if(a >= x) continue;
if(ans == -1 || p < ans) {
ans = p;
}
}
cout << ans << endl;
return 0;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
while(t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define x first
#define y second
#define all(v) (v).begin(),(v).end()
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, x, y;
cin >> a >> b >> x >> y;
int ans = 0;
if(2 * x <= y) {
if(a <= b) ans = (2 * (b - a) + 1) * x;
else ans = (2 * (a - b) - 1) * x;
}
else {
if(a <= b) ans = x + (b - a) * y;
else ans = x + (a - b - 1) * y;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
typedef pair<int, int> P;
struct edge {
ll to, cost;
};
vector<vector<edge>> G(300);
vector<ll> dijkstra(ll s, ll N)
{
vector<ll> value(N, INF);
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
value[s] = 0;
while (!que.empty())
{
P p = que.top();
que.pop();
ll v = p.second;
if (value[v] < p.first)
{
continue;
}
rep(i, G[v].size())
{
edge e = G[v][i];
if (value[e.to] > value[v] + e.cost)
{
value[e.to] = value[v] + e.cost;
que.push(P(value[e.to], e.to));
}
}
}
return value;
}
int main()
{
int a, b, x, y;
cin >> a >> b >> x >> y;
rep(i, 100) {
G[i].push_back({i + 100, x});
G[i + 100].push_back({i, x});
if (i != 99) {
G[i].push_back({i + 1, y});
G[i + 1].push_back({i, y});
}
if (i != 0) {
G[i].push_back({i + 99, x});
G[i + 99].push_back({i, x});
}
}
auto res = dijkstra(a - 1, 200);
cout << res[b + 99] << endl;
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace __gnu_pbds;
using namespace std;
int n;
string s[200000];
int main(){
//IO("input.txt", "output.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 0; i < n; i++) cin >> s[i];
set<string> cov;
sort(s, s + n);
for(int i = 0; i < n; i++)
if(s[i][0] == '!') cov.insert(s[i]);
else{
s[i] = "!" + s[i];
if(cov.find(s[i]) != cov.end()){
cout << s[i].substr(1, s[i].length() - 1) << '\n';
return 0;
}
}
cout << "satisfiable\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
set<string> st;
rep(i, n) st.insert(s[i]);
rep(i, n) {
if (st.count('!' + s[i])) {
cout << s[i] << endl;
return 0;
}
}
cout << "satisfiable" << endl;
return 0;
} |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
#define int long long int
// quoted from beet-aizu
template <typename T,typename E, typename F, typename G, typename H>
struct LazySegmentTree{
//using F = function<T(T,T)>;
//using G = function<T(T,E)>;
//using H = function<E(E,E)>;
int n,height;
F f;
G g;
H h;
T ti;
E ei;
vector<T> dat;
vector<E> laz;
LazySegmentTree(F f,G g,H h,T ti,E ei):
f(f),g(g),h(h),ti(ti),ei(ei){}
void init(int n_){
n=1;height=0;
while(n<n_) n<<=1,height++;
dat.assign(2*n,ti);
laz.assign(2*n,ei);
}
void build(const vector<T> &v){
int n_=v.size();
init(n_);
for(int i=0;i<n_;i++) dat[n+i]=v[i];
for(int i=n-1;i;i--)
dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
}
inline T reflect(int k){
return laz[k]==ei?dat[k]:g(dat[k],laz[k]);
}
inline void eval(int k){
if(laz[k]==ei) return;
laz[(k<<1)|0]=h(laz[(k<<1)|0],laz[k]);
laz[(k<<1)|1]=h(laz[(k<<1)|1],laz[k]);
dat[k]=reflect(k);
laz[k]=ei;
}
inline void thrust(int k){
for(int i=height;i;i--) eval(k>>i);
}
inline void recalc(int k){
while(k>>=1)
dat[k]=f(reflect((k<<1)|0),reflect((k<<1)|1));
}
void update(int a,int b,E x){
thrust(a+=n);
thrust(b+=n-1);
for(int l=a,r=b+1;l<r;l>>=1,r>>=1){
if(l&1) laz[l]=h(laz[l],x),l++;
if(r&1) --r,laz[r]=h(laz[r],x);
}
recalc(a);
recalc(b);
}
void set_val(int a,T x){
thrust(a+=n);
dat[a]=x;laz[a]=ei;
recalc(a);
}
T query(int a,int b){
thrust(a+=n);
thrust(b+=n-1);
T vl=ti,vr=ti;
for(int l=a,r=b+1;l<r;l>>=1,r>>=1) {
if(l&1) vl=f(vl,reflect(l++));
if(r&1) vr=f(reflect(--r),vr);
}
return f(vl,vr);
}
};
signed main() {
string s; cin >> s;
int n = s.size();
using P = pair<int, int>;
auto f = [](P a, P b){ return P(a.first + b.first, a.second + b.second); };
auto g = [](P a, int b){ return P(a.second * b, a.second); };
auto h = [](int a, int b){ return b != INT_MAX ? b : a; };
using SG = LazySegmentTree<P, int, decltype(f), decltype(g), decltype(h)>;
vector<SG> sg(26, SG(f, g, h, P(0, 0), INT_MAX));
for (int i = 0; i < 26; i++) {
sg[i].build(vector<P>(n, P(0, 1)));
}
// sg.build(vector<P>(n, P(0, 1)));
// for(int i = 0; i < q; i++){
// int com; cin >> com;
// if(!com){
// int s, t, x; cin >> s >> t >> x;
// sg.update(s, t + 1, x);
// }else{
// int s, t; cin >> s >> t;
// cout << sg.query(s, t + 1).first << endl;
// }
// }
for (int i = 0; i < s.size(); i++) {
sg[s[i] - 'a'].update(i, i + 1, 1);
}
int ans = 0;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] != s[i + 1]) continue;
ans += n - i - sg[s[i] - 'a'].query(i, n).first;
for (int j = 0; j < 26; j++) {
if ((int)(s[i] - 'a') == j) {
sg[j].update(i, n, 1);
} else {
sg[j].update(i, n, 0);
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#define ss second
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define mod 4
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define vpii vector<pair<int,int> >
#define all(x) x.begin(),x.end()
#define matrixprint(arr,a,b,c,d) for(int i=a;i<=c;i++){for(int j=b;j<=d;j++){cout<<arr[i][j]<<" ";}cout<<"\n";}
#define show(arr,x,y) for(int i=x;i<=y;i++){cout<<arr[i]<<" ";}cout<<"\n"
#define sz(x) (int)x.size()
#define db(x) cout<<x<<"\n";
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//insert,find_by_order,order_of_key,lower_bound,upper_bound;
#define TRACE
#ifdef TRACE
#define deb(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
#else
#define deb(...)
#endif
//////////////////////////////code//////////////////////////////
const int N = 200;
int power(int a, int b = mod - 2) {
int x = 1 % mod;
a %= mod;
b %= mod - 1;
while (b) {
if (b & 1) x = (x * a)%mod;
a = (a * a)%mod;
b >>= 1;
// deb(x);
}
return x;
}
void solve()
{
int ans = 0;
string s;
cin >> s;
int n = sz(s);
char prev = '/';
int f = 0;
int fr[26] = {0};
for(int i = n - 1;i >= 0; i--)
{
if(s[i] == s[i + 1])
{
for(int j = 0;j < 26; j++)
{
if(j == (int)(s[i] - 'a'))
continue;
ans += fr[j];
fr[s[i] - 'a'] += fr[j];
fr[j] = 0;
}
}
fr[s[i] - 'a']++;
}
db(ans)
}
int32_t main()
{
LETS_GET_SCHWIFTY;
#ifndef ONLINE_JUDGE
freopen("INP.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t = 1;
//cin >> t;
while (t--)
solve();
}
// check out for following mistakes-
// if using pb operation on vector and then trying to access index..check if sizeof that vec could remain 0 only
// is using prime sieve make sure it fits
// when using factorial template or combinatorics make sure that you edit fillfac fun values and array values
|
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll INF = (1LL << 61);
ll extgcd(ll a, ll b, ll& x, ll& y){
if (b > a) return extgcd(b, a, y, x);
if (b == 0){
x = 1; y = 0;
return a;
}
int g = extgcd(b, a % b, y, x);
y -= (a / b) * x;
return g;
}
ll gcd(ll a, ll b){
if (b > a) return gcd(b, a);
if (b == 0) return a;
return gcd(b, a % b);
}
ll solve(ll& X, ll& Y, ll& P, ll& Q){
ll ret = INF;
ll Z = 2 * (X + Y);
ll R = P + Q;
ll _n, _m;
ll g = extgcd(Z, R, _n, _m);
Z /= g; R /= g;
for (int i = -Q + 1; i < Y; ++i){
if ((X + i + g) % g != P % g)
continue;
ll tmp = (P / g) - ((X + i) / g);
ll n = _n * tmp;
ll m = _m * tmp;
ll t = max(-n / R, m / Z) - 5;
n += R * t;
m -= Z * t;
while (n < 0 || m > 0){
n += R;
m -= Z;
}
ret = min(ret, 2 * (X + Y) * n + X + max(i, 0));
}
return ret;
}
int main(void){
int T; cin >> T;
while (T--){
ll X, Y, P, Q;
cin >> X >> Y >> P >> Q;
ll ret = solve(X, Y, P, Q);
if (ret == INF) cout << "infinity" << endl;
else cout << ret << endl;
}
return 0;
} |
#include <set>
#include <map>
#include <iostream>
using namespace std;
long long check(multiset<long long>& M1, multiset<long long>& M2) {
auto m1 = M1.begin();
long long ret = 1000000000000000000;
while (m1 != M1.end()) {
long long d1 = -1;
long long d2 = -1;
auto m2 = M2.lower_bound(*m1);
if (m2 != M2.end()) {
d1 = abs(*m1 - *m2);
}
long long cm2 = *m2;
while (m2 != M2.begin() && *m2 == cm2) {
m2--;
if (d2 == -1 || d2 > abs(*m1 - *m2)) {
d2 = abs(*m1 - *m2);
}
}
if (d1 != -1 && d1 < ret) {
ret = d1;
}
if (d2 != -1 && d2 < ret) {
ret = d2;
}
m1++;
}
return ret;
}
int main(void){
// Your code here!
long long N;
multiset<long long> R;
multiset<long long> G;
multiset<long long> B;
cin>> N;
for (int i = 0; i < 2 * N; i++) {
long long a;
char c;
cin >> a >> c;
if (c == 'R') {
R.insert(a);
} else if (c == 'G') {
G.insert(a);
} else if (c == 'B') {
B.insert(a);
}
}
if (R.size() % 2 == 1 && G.size() % 2 == 1) {
long long ret1 = check(R, G);
long long ret2 = check(R, B) + check(G, B);
if (ret1 < ret2) {
cout << ret1;
} else {
cout << ret2;
}
return 0;
}
if (R.size() % 2 == 1 && B.size() % 2 == 1) {
long long ret1 = check(R, B);
long long ret2 = check(R, G) + check(B, G);
if (ret1 < ret2) {
cout << ret1;
} else {
cout << ret2;
}
return 0;
}
if (G.size() % 2 == 1 && B.size() % 2 == 1) {
long long ret1 = check(G, B);
long long ret2 = check(G, R) + check(B, R);
if (ret1 < ret2) {
cout << ret1;
} else {
cout << ret2;
}
return 0;
}
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n = 0;
cin >> n;
vector<double> p0(2), p2n(2), pc(2), pc0(2);
cin >> p0.at(0) >> p0.at(1) >> p2n.at(0) >> p2n.at(1);
double theta = (2.0 * M_PI) / (double)n;
pc.at(0) = (p0.at(0) + p2n.at(0)) / 2;
pc.at(1) = (p0.at(1) + p2n.at(1)) / 2;
pc0.at(0) = p0.at(0) - pc.at(0);
pc0.at(1) = p0.at(1) - pc.at(1);
double ans_real = 0.0, ans_imagine = 0.0;
ans_real = pc0.at(0) * cos(theta) - pc0.at(1) * sin(theta) + pc.at(0);
ans_imagine = pc0.at(1) * cos(theta) + pc0.at(0) * sin(theta) + pc.at(1);
printf("%0.9f %0.9f", ans_real, ans_imagine);
return 0;
}//main | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
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;}
vector<long long> divisor(long long n){vector<long long> res;long long i = 1;while (i*i<=n){if(n%i==0){res.push_back(i);}i++;}if(res.size()==0)return res;for(long long i = res.size()-1-(res.back()*res.back()==n);i>=0;--i){res.push_back(n/res[i]);}return res;}
long long safe_mod(long long x,long long m){x%=m;if(x<0){x+=m;}return x;}
long long modpow(long long x,long long n,long long mod){long long ans=1;while(n>0){if(n&1){ans*=x;ans%=mod;}n>>=1;x*=x;x%=mod;}return ans;}
long long intpow(long long x,long long n){long long ans=1;while(n>0){if(n&1){ans*=x;}n>>=1;x*=x;}return ans;}
//template<typename T>T intpow(T x,T n){T ans=1;while(n>0){if(n&1){ans*=x;}n>>=1;x*=x;}return ans;}
vector<pair<long long,long long>> factor_lst(long long n){vector<pair<long long,long long>> factor_lst;long long d=2;while(d*d<=n){if(n%d==0){long long num=0;while(n%d==0){num+=1;n/=d;}factor_lst.push_back({d,num});}d+=1;}if(n!=1){factor_lst.push_back({n,1});}return factor_lst;}
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
int msb(int x){return x==0 ? -1:32-__builtin_clz(x);}//1-indexed
int lsb(int x){return x==0 ? 32:__builtin_ctz(x)+1;}//1-indexed
int popcnt(int x){return __builtin_popcount(x);}
int popcnt(long long x){return __builtin_popcount(x);}
bool ingrid(int i,int j,int H,int W){
return 0<=i&&i<H&&0<=j&&j<W;
}
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
template<typename T> void print(vector<T> &v){for(int i=0;i<v.size();++i){if(i)cout<<" ";cout<<v[i];}cout<<endl;}
template<typename T> void print(T* v,int size){for(int i=0;i<size;++i){if(i)cout<<" ";cout<<v[i];}cout<<endl;}
template<typename T,typename S>void print(pair<T,S>&p){cout<<p.first<<" "<<p.second<<endl;}
const ll LINF=4*1e18;
const ll MINF=5*1e15;
const int INF=1e9+5;
const ld PI=acosl(-1);
const ld DINF=INF;
void Main();
int main(){cout<<fixed<<setprecision(15);Main();}
void Main(){
int N;cin>>N;
vector<int> A(N);
rep(i,N)cin>>A[i];
int ans=0;
rep(i,N)ans+=max(A[i],10)-10;
cout<<ans<<endl;
}
|
//Bismillahir Rahmanir Raheem
#ifdef ONLINE_JUDGE
#include<bits/stdc++.h>
#endif
#include<iostream>
#include<numeric>
#include<tuple>
#include<iomanip>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<math.h>
#include<vector>
#include<climits>
#include<algorithm>
#include<string>
#include<sstream>
#include<string.h>
#include<deque>
#include<set>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(cnt, x) memset((cnt), (x), sizeof(cnt))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pair<int,int> > vii;
typedef pair<int, int> pii;
typedef vector<bool> vbl;
typedef vector<pair<ll,ll> > vll;
typedef pair<ll, ll> pll;
#define PQ priority_queue
#define ff first
#define ss second
#define MP make_pair
#define MT make_tuple
#define mxN (int)2e5 + 2
#define sz(n) (int)(n).size()
#define fasterIO ios::sync_with_stdio(0); cin.tie(0);
#define forc(cn) for(auto &x : (cn))
#define findc(cn, abc) ((cn).find(abc) != (cn).end())
#define PI 2*acos(0)
#define forc(cn) for(auto &x : (cn))
#define MAX 200010
const ll inf = INT_MAX;
const int mod = 1e9 + 7;
bool cmp(const pii x, const pii y) {
return 2ll * x.ff + x.ss < 2ll * y.ff + y.ss;
}
void solve()
{
int n;
cin >> n;
vii a(n);
forc(a)
cin >> x.ff >> x.ss;
sort(all(a), cmp);
ll sa = 0, sb = 0, ans = 0;
forc(a) sa += x.ff;
for(int i = n - 1; i >= 0; i--) {
pii &x = a[i];
sb += x.ff + x.ss;
sa -= x.ff;
ans++;
if(sb > sa) break;
}
cout << ans << endl;
}
int main()
{
fasterIO
#ifndef ONLINE_JUDGE
freopen("input.txt", "r+", stdin);
freopen("output.o", "w+", stdout);
#endif
int t = 1;
//cin >> t;
while(t--) {
solve();
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
//#Rohitpratap311
//#Keep Calm And Stay Happy
using ll = long long;
using ld = long double;
#define loop(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
ll mod=1e9;
ll binpow(long long a, long long b) {
a %= mod;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
bool ifprime(ll n)
{
if(n==2||n==3) { return true ; }
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0) { return false; }
}
return true;
}
vector<ll> prime(1000001,1);
void seive()
{
prime[0]=0;
prime[1]=0;
for(ll i=2;i*i<=1000000;i++)
{
if(prime[i])
{
for(ll j=i*i;j<=1000000;j+=i)
{
prime[j]=0;
}
}
}
}
ll nCr[1001][1001];
void NcR()
{
loop(i,0,1001)
{
loop(j,0,1001)
{
nCr[i][j] = 0;
}
nCr[i][0] = 1;
}
loop(i,1,1001)
{
loop(j,1,i+1)
{
nCr[i][j]=(nCr[i-1][j]+nCr[i-1][j-1])%mod;
}
}
}
ll gcd(ll a,ll b)
{
if(b==0) { return a; }
return gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
bool good(ll n)
{
n=abs(n);
while(n)
{
if(n%10==8) return 1;
n/=10;
}
return false;
}
void solveCP311()
{
ll n,m;
cin>>n>>m;
vector<ll>v(n);
for(ll i=0;i<n;++i) cin>>v[i];
set<ll>s;
vector<ll>cnt(n+1);
for(ll i=0;i<m;++i) cnt[v[i]]++;
for(ll i=0;i<=n;++i) if(cnt[i]==0) s.insert(i);
ll ans=*s.begin();
for(ll i=1;i<=n-m;++i){
s.insert(n);
cnt[v[i-1]]--;
if(cnt[v[i-1]]==0) s.insert(v[i-1]);
if(s.find(v[i+m-1])!=s.end()) s.erase(v[i+m-1]);
cnt[v[i+m-1]]++;
ans=min(ans,*s.begin());
}
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll t=1;
//cin>>t;
NcR();
seive();
while(t--)
{
solveCP311();
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#define re register
#define X first
#define Y second
#define mp std::make_pair
#define pb push_back
#define ohh(hhh...) fprintf(stderr,hhh)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int,int> pii;
template<class T1> inline bool cmax(T1 &x,T1 y) {return x<y?(x=y,1):0;}
template<class T1> inline bool cmin(T1 &x,T1 y) {return x>y?(x=y,1):0;}
template<class T1> inline T1 dmax(T1 x,T1 y) {return x>y?x:y;}
template<class T1> inline T1 dmin(T1 x,T1 y) {return x<y?x:y;}
const int MAXN=110,mod=998244353;
int n,a[MAXN],fac[MAXN],f[MAXN][MAXN][MAXN*MAXN/2],ans;
int read()
{
int x=0,w=0;
char ch=0;
while(ch<'0'||ch>'9') w|=ch=='-',ch=getchar();
while('0'<=ch&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return w?-x:x;
}
int main()
{
re int sm=0;
n=read();
for(re int i=1;i<=n;i++) a[i]=read(),sm+=a[i];
if(sm%2==1) {printf("0\n");return 0;}
re int up=sm/2;
fac[0]=1;
for(re int i=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mod;
f[0][0][0]=1;
for(re int i=1;i<=n;i++)
{
for(re int j=0;j<=i;j++)
for(re int k=0;k<=up;k++) f[i][j][k]=f[i-1][j][k];
for(re int j=1;j<=i;j++)
for(re int k=a[i];k<=up;k++) f[i][j][k]=(f[i][j][k]+f[i-1][j-1][k-a[i]])%mod;
}
for(re int i=1;i<=n;i++) ans=(ans+1ll*f[n][i][up]*fac[i]%mod*fac[n-i])%mod;
printf("%d\n",ans);
return 0;
} | #include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define ll long long
#define rep(i,n) for(int i = 0;i < (int)n;i ++)
#define mod % 998244353
using namespace std;
int main(void){
ll n;
cin >> n;
ll A[n+1];
A[0] = 1;
rep(i,n){
A[i+1] = (A[i]*(i+1))mod;
}
vector<ll> w(n);
ll S = 3;
rep(i,n){
cin >> w[i];
S += w[i];
}
sort(w.begin(),w.end());
ll Q = S;
vector<vector<vector<ll>>> P(n+1,vector<vector<ll>>(Q,vector<ll>(n+1,0)));
P[0][Q/2][0] = 1;
rep(i,n){
rep(j,Q){
rep(k,n+1){
P[i][j][k] = P[i][j][k] mod;
if(P[i][j][k] > 0){
if(j+w[i]<Q)P[i+1][j+w[i]][k+1] = (P[i+1][j+w[i]][k+1]+P[i][j][k]) mod;
if(j-w[i]>=0)P[i+1][j-w[i]][k] = (P[i+1][j-w[i]][k]+P[i][j][k]) mod;
}
}
}
}
vector<ll> ans = P[n][Q/2];
ll sum = 0;
rep(i,n){
ll M = (A[i]*A[n-i]) mod;
sum = (sum+ans[i]*M) mod;
}
cout << sum << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <random>
#include <ctime>
#include <map>
#include <set>
using grid = std::vector<std::vector<int64_t>>;
std::random_device rng_seed;
std::mt19937_64 rng(rng_seed());
int n, m, longest;
std::map<std::pair<int64_t, int>, int> s_map;
int64_t calc_hash(const std::string &s)
{
int64_t hash = 0;
for (int i = 0; i < static_cast<int>(s.size()); i++)
{
hash += (s.at(i) - 'A') << (3 * i);
}
return hash;
}
int calc_score(const grid &a)
{
std::set<std::pair<int64_t, int>> s;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
int64_t hx = 0, hy = 0;
for (int k = 0; k < longest; k++)
{
hx += a.at(i).at((j + k) % n) << (3 * k);
hy += a.at((i + k) % n).at(j) << (3 * k);
s.emplace(hx, k + 1);
s.emplace(hy, k + 1);
}
}
}
int res = 0;
for (auto &&x : s)
{
res += s_map[x];
}
return round(1e8 * res / m);
}
int main()
{
clock_t start = clock();
auto progress = [&]()
{
return (clock() - start) / (2.5 * CLOCKS_PER_SEC);
};
std::cin >> n >> m;
for (int i = 0; i < m; i++)
{
std::string si;
std::cin >> si;
s_map[std::make_pair(calc_hash(si), si.size())]++;
longest = std::max<int>(longest, si.size());
}
grid best(n, std::vector<int64_t>(n)), ans = best;
int maxscore = 0, t = 0;
while (progress() < 1)
{
for (auto &&[k, v] : s_map)
{
auto [hash, len] = k;
int sx = rng() % n, sy = rng() % n, dx = t, dy = 1 - t;
for (int i = 0; i < len; i++)
{
ans.at((sx + i * dx) % n).at((sy + i * dy) % n) = hash >> (3 * i) & 7;
}
}
int score = calc_score(ans);
if (score > maxscore)
{
maxscore = score;
best = ans;
}
t = 1 - t;
}
std::cerr << maxscore << std::endl;
// 出力
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
putchar('A' + best.at(i).at(j));
}
puts("");
}
return 0;
}
| #include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define mod 1000000007LL
#define endl "\n"
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define inp(V,n) for(int i=0;i<n;i++){cin >> V[i];}
#define oup(V,n) {for(int i=0;i<n;i++){cout << V[i] << " " ;} cout << endl;}
#define pll pair<long long,long long>
#define pi 3.141592653589793238
using namespace std;
//vector<ll> adj[5005];
//vector<bool> vis(5005,false);
ll factorial(ll n)
{
return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b)
{
return (a*b)/gcd(a, b);
}
bool sortByVal(const pair<ll,ll> &a,
const pair<ll,ll> &b)
{
if(a.fi == b.fi)
return a.se < b.se;
else
return a.fi > b.fi;
}
ll Powb(ll b,ll n)
{
if(n==0) return 1LL;
if(n==1) return b;
ll temp = Powb(b,n/2);
if(n%2==0){return (temp*temp)%mod;}
else{return (b*((temp*temp)%mod))%mod;}
}
ll root(vector<ll> &a,ll i)
{
while(a[i] != i)
{
a[i]=a[a[i]];
i=a[i];
}
return i;
}
void wunion(vector<ll> &a,vector<ll> &size,ll i,ll j)
{
ll root_i=root(a,i);
ll root_j=root(a,j);
if(root_i == root_j)
return;
if(size[root_i]<size[root_j])
{
a[root_i]=a[root_j];
size[root_j] += size[root_i];
size[root_i]=0;
}
else
{
a[root_j]=a[root_i];
size[root_i] += size[root_j];
size[root_j]=0;
}
}
int main()
{
fast;
int t=1;
//cin>>t;
while(t--)
{
ll i,j,m,n,k,sum=0,c=0,d=0,e=0,f=0,g=0,h=0,maxi=0;
cin>>n;
string a;
for(i=1;i<=1000000;i++)
{
a=to_string(i);
d=a.size();
c=Powb(10,d)*i;
e=c+i;
//cout<<e<<endl;
if(e<=n)
sum++;
else
break;
}
cout<<sum<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 8e5+5;
int a[sz];
pair <int,int> b[sz];
bool cut[sz];
int main() {
int n;
cin >> n;
n <<= 1;
for(int i=0; i<n; i++) scanf("%d", &a[i]), b[i] = {a[i], i};
sort(b, b+n);
for(int i=0; i<n/2; i++) cut[b[i].second] = 1;
for(int i=0, z=0, f=0; i<n; i++) {
if(cut[i]) {
if(f and z) printf(")"), z--;
else printf("("), z++, f = 0;
}
else {
if(!f and z) printf(")"), z--;
else printf("("), z++, f = 1;
}
}
}
| #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()
using ll=long long;
typedef pair<int,int> P;
signed main(){
int n;cin>>n;
vector<int> v(2*n);
REP(i,2*n)cin>>v[i];
vector<P> w(2*n);
REP(i,2*n)w[i]=P(v[i],i);
sort(ALL(w));
vector<int> a(2*n);
REP(i,n)a[w[i].second]=1;
REP(i,n)a[w[i+n].second]=-1;
ll now=0;
string ans;
REP(i,2*n){
if(abs(now)>abs(now+a[i]))ans.push_back(')');
else ans.push_back('(');
now+=a[i];
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=2009;
int H,W,r[Nmax],c[Nmax],cnt,ans;
string S;
vector <int> adj[Nmax];
void Conn(int a, int b) {
adj[a].push_back(b); adj[b].push_back(a);
}
void DFS_r(int curr, int prev) {
r[curr]=cnt;
// cout<<curr<<endl; getchar();
for (auto next : adj[curr]) {
if (next==prev) continue;
if (!r[next]) DFS_r(next,curr);
}
}
void DFS_c(int curr, int prev) {
c[curr]=cnt;
for (auto next : adj[curr]) {
if (next==prev) continue;
if (!c[next])DFS_c(next,curr);
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>H>>W;
Conn(1,H+1); Conn(1,H+W);
Conn(H,H+1); Conn(H,H+W);
REP(i,1,H) {
cin>>S;
REP(j,1,W) {
if (S[j-1]=='#') Conn(i,H+j);
}
}
// cout<<"OK"<<endl;
REP(i,1,H) {
if (!r[i]) {
++cnt; DFS_r(i,0);
}
}
// cout<<"OK2"<<endl;
ans=cnt-1; cnt=0;
REP(j,1,W) {
if (!c[H+j]) {
++cnt; DFS_c(H+j,0);
}
}
ans=min(ans,cnt-1);
cout<<ans;
return 0;
} | #define George_Plover
#include <queue>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <iomanip>
#include <algorithm>
#define MAXN 1100
#define LL long long
using namespace std;
int n,m;
bool visr[MAXN],visc[MAXN];
bool vis[MAXN][MAXN];
char s[MAXN][MAXN];
int fa[MAXN*MAXN];
queue<pair<int,int> >q;
int num(int x,int y)
{
return (x-1)*m+y;
}
int find(int x)
{
return fa[x]==x?x:fa[x]=find(fa[x]);
}
void BFS(int x,int y)
{
vis[x][y]=1;
q.push(make_pair(x,y));
while(!q.empty())
{
int ux=q.front().first;
int uy=q.front().second;
q.pop();
if(s[ux][1]=='#'||s[ux][m]=='#'||s[1][uy]=='#'||s[n][uy]=='#')
{
fa[find(num(ux,uy))]=0;
}
for(int j=2;j<m && !visr[ux];j++)
{
if(j!=uy && s[ux][j]=='#' && !vis[ux][j])
{
q.push(make_pair(ux,j));
fa[find(num(ux,j))]=find(num(ux,uy));
vis[ux][j]=1;
}
}
for(int i=2;i<n && !visc[uy];i++)
{
if(i!=ux && s[i][uy]=='#' && !vis[i][uy])
{
q.push(make_pair(i,uy));
fa[find(num(i,uy))]=find(num(ux,uy));
vis[i][uy]=1;
}
}
visr[ux]=visc[uy]=1;
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%s",s[i]+1);
for(int i=1;i<=n*m;i++)fa[i]=i;
if(n==2||m==2)
{
cout<<0<<endl;
return 0;
}
int ans=0;
for(int i=2;i<n;i++)
for(int j=2;j<m;j++)
{
if(s[i][j]=='#' && !vis[i][j])
{
BFS(i,j);
if(find(num(i,j)))
{
//cout<<i<<" "<<j<<endl;
ans++;
}
}
}
for(int i=2;i<n;i++)
if(s[i][1]=='#'||s[i][m]=='#')
visr[i]=1;
for(int j=2;j<m;j++)
if(s[1][j]=='#'||s[n][j]=='#')
visc[j]=1;
int ansr=0,ansc=0;
for(int i=2;i<n;i++)
if(!visr[i])
ansr++;
for(int j=2;j<m;j++)
if(!visc[j])
ansc++;
//cout<<ans<<endl;
printf("%d\n",min(ansc,ansr)+ans);
return 0;
}
|
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 3e3 + 10;
ll H, W, Par[MXN], Sz[MXN];
vector<ll> R[MXN], C[MXN];
string s[MXN];
ll f1, f2, f3;
ll Find(ll x){
return (x == Par[x] ? x : Par[x] = Find(Par[x]));
}
bool Union(ll u, ll v){
u = Find(u), v = Find(v);
if(u == v) return 0;
if(Sz[v] > Sz[u]) swap(u, v);
Sz[u] += Sz[v], Par[v] = u;
return 1;
}
void Build(){
for(int i = 1; i <= H + W; i ++){
Par[i] = i, Sz[i] = 1;
}
for(int i = 1; i <= H; i ++){
for(int j = 1; j <= W; j ++){
if(s[i][j] == '#') Union(i, j + H);
}
}
}
int main(){
//ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
cin >> H >> W;
if(min(H, W) <= 2) return cout << 0, 0;
for(int i = 1; i <= H; i ++){
cin >> s[i];
s[i] = "$" + s[i];
}
s[1][1] = s[1][W] = s[H][1] = s[H][W] = '#';
Build();
for(int i = 1; i <= H + W; i ++){
if(Find(i) != i) continue;
f1 += Union(i, 1);
}
Build();
for(int i = 1; i <= H; i ++){
f2 += Union(1, i);
}
Build();
for(int j = 1; j <= W; j ++){
f3 += Union(1, j + H);
}
for(int i = 1; i <= 100; i ++) Build();
cout << min({f1, f2, f3}) << '\n';
return 0;
}
| #include<bits/stdc++.h>
#define MAX 1000000007
#define MOD 998244353
#define ll long long int
#define fo(i,a,n) for(int i=a;i<n;i++)
#define ull unsigned long long int
#define pb push_back
#define eb emplace_back
#define in insert
#define cl clear
#define ld long double
#define mp make_pair
#define ii pair<int,int>
const ll inf = 10e16+7;
using namespace std;
typedef vector<vector<int>> vvi;
void print(int arr[], int n){
fo(i,1,n+1){
cout<<arr[i]<<" ";
}
cout<<endl;
}
int gc(int arr[], int n) {
int high = 0;
for (int i = 0; i < n; i++)
high = max(high, arr[i]);
int count[high + 1] = {0};
for (int i = 0; i < n; i++)
count[arr[i]]++;
int counter = 0;
for (int i = high; i >= 1; i--) {
int j = i;
counter = 0;
while (j <= high) {
if(count[j] >=2)
return j;
else if (count[j] == 1)
counter++;
j += i;
if (counter == 2)
return i;
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
// int t;
// cin>>t;
// while(t--){
// }
int a,b;
cin>>a>>b;
int arr[b-a+1];
int n=a;
fo(i,0,b-a+1){
arr[i]=n++;
}
cout<<gc(arr,b-a+1);
return 0;
} |
//---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
//---------------------------------------------------------------
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rrep(i, n) for (long long i = 1; i <= (long long)(n); i++)
#define srep(i, s, n) for (long long i = (s); i <= (long long)(n); i++)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define SIZE 100005
#define INF 1e18
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define vec vector
using pint = pair<int,int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//---------------------------------------------------------------
//↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll a,b,c;
cin>>a>>b>>c;
bool ok = 0;
if(a+b == 2*c) ok = 1;
if(a+c == 2*b) ok = 1;
if(c+b == 2*a) ok = 1;
if(ok){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = (int) 1e9 + 7;
int d[200 + 7][200 + 7];
int a(int x) {
return x;
}
int b(int x) {
return 100 + x;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
for (int i = 1; i <= 200; i++) {
for (int j = 1; j <= 200; j++) {
d[i][j] = INF;
}
d[i][i] = 0;
}
int x, y, c1, c2;
cin >> x >> y >> c1 >> c2;
for (int i = 1; i < 100; i++) {
d[i][i + 1] = d[i + 1][i] = c2;
d[b(i)][b(i + 1)] = d[b(i + 1)][b(i)] = c2;
d[a(i + 1)][b(i)] = d[b(i)][a(i + 1)] = c1;
}
for (int i = 1; i <= 100; i++) {
d[a(i)][b(i)] = d[b(i)][a(i)] = c1;
}
for (int k = 1; k <= 200; k++) {
for (int i = 1; i <= 200; i++) {
for (int j = 1; j <= 200; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
cout << d[a(x)][b(y)] << "\n";
}
|
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int X;
cin >>X;
int A= X%100;
cout <<100-A;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define vi vector<int>
#define vll vector<ll>
#define vstr vector<string>
#define PI 2*acos(0.0)
#define test ll tc;cin>>tc; while(tc--){solve();}
#define MAX3(a,b,c) max(a,max(b,c))
#define MIN3(a,b,c) min(a,min(b,c))
#define MAX 99999999
#define INF 1<<30
#define EPS 1e-9
#define MOD 1000000007
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void solve()
{
int n;
cin >> n;
int ans;
//if(n%100==0)
ans = ((n / 100) + 1) * 100;
ans = ans - n;
cout << ans << endl;
}
int main()
{
faster;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rf(i,a,b) for(ll i=a-1;i>=b;i--)
#define pb push_back
#define pob pop_back
#define eb emplace_back
#define ins insert
#define mp make_pair
#define ff first
#define ss second
#define pf push_front
#define bs binary_search
#define lb lower_bound
#define ub upper_bound
#define sz(a) (ll)a.size()
#define dec(x) fixed<<setprecision(x)
#define lcm(a,b) (a*b/__gcd(a,b))
typedef priority_queue<ll> pq;
typedef priority_queue<ll,vector<ll>,greater<ll> > pqmn;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<ll> > vvll;
typedef vector<string> vs;
typedef set<ll> sll;
typedef set<pll> spll;
typedef map<ll,ll> mll;
const ll inf=LLONG_MAX;
const ll mod=1e9+7;
const ld pi=acos(-1);
const ll N=100001;
void solution()
{
ll n,m;
cin>>n>>m;
char arr[n][m];
for(ll i=0;i<n;i++) {
for(ll j=0;j<m;j++) {
cin>>arr[i][j];
}
}
ll vertex=0;
for(ll i=0;i<n-1;++i) {
for(ll j=0;j<m-1;j++) {
ll ans=(arr[i][j]=='#')+(arr[i][j+1]=='#')+(arr[i+1][j]=='#')+(arr[i+1][j+1]=='#');
if(ans & 1) vertex++;
}
}
cout<<vertex;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t;
t=1;
//cin>>t;
while(t--){
solution();
cout<<"\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define V vector
#define debug(v) {for(auto i: v) cout << i << " "; cout << endl;}
#define vcin(v) rep(i, v.size()) cin >> v[i]
#define wcin(v, w) rep(i, v.size()) cin >>v[i] >>w[i]
int main(){
ll n,k;
cin >>n >>k;
ll ans=0;
for(ll i=1;i<=n;i++)for(ll j=1;j<=k;j++){
ans+=100*i+j;
}
cout <<ans;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n-1); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr int N = 2000;
vector<vector<int>> g(N);
int bfs(int start, int n) {
vector<int> dist(N, -1);
queue<int> q;
dist[start] = 0;
q.push(start);
while (!q.empty())
{
int v = q.front();
q.pop();
for (int nv : g[v]) {
if (dist[nv] != -1) continue;
dist[nv] = dist[v] + 1;
q.push(nv);
}
}
int r = 0;
rep(i,n) {
if (dist[i] >= 0) r++;
}
return r;
}
int main() {
int n, m;
cin >> n >> m;
rep(i,m) {
int a, b;
cin >> a >> b;
a--; b--;
g[a].push_back(b);
}
int ans = 0;
rep(i,n) {
ans += bfs(i, n);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = int(2e5) + 2;
int cnt;
bool cycle, vis[2*N];
vector<int> G[2*N];
void DFS(int u, int par)
{
vis[u] = 1;
++cnt;
int chk = 1;
for(const int &v : G[u]) {
if(v == par && chk) {
--chk;
continue;
}
if(!vis[v]) DFS(v, u);
else cycle = true;
}
}
int main()
{
//freopen("input", "r", stdin);
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; ++i) {
int u, v;
cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
int res = 0;
for(int i = 1; i < 2 * N; ++i) {
if(!vis[i]) {
cnt = 0;
cycle = false;
DFS(i, i);
if(cycle) res += cnt;
else res += cnt - 1;
}
}
cout << res;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}
else{
return par[a]=find(par[a]);
}
}
bool same(ll a,ll b){
return (find(a)==find(b));
}
ll size(ll a){
return -par[find(a)];
}
void unite(ll a,ll b){
ll c=find(a),d=find(b);
if(c==d)
return;
if(size(c)<size(d)){
swap(c,d);
}
par[c]+=par[d];
par[d]=c;
}
};
ll euclidean_gcd(ll a, ll b) {
if(a < b) return euclidean_gcd(b, a);
ll r;
while ((r=a%b)) {
a = b;
b = r;
}
return b;
}
ll euclidean_lcm(ll a, ll b) {
return a/euclidean_gcd(a,b)*b;
}
class smart_sieve {
intmax_t L, R, M;
std::vector<int> small; // 小さい篩
std::vector<std::vector<intmax_t>> large; // 大きい篩
std::vector<intmax_t> aux; // aux[i] := large[i] の素因数の積
public:
smart_sieve(intmax_t L, intmax_t R): L(L), R(R), M(sqrt(R)+1) {
small.resize(M);
std::iota(small.begin(), small.end(), 0);
large.resize(R-L);
aux.assign(R-L, 1);
for (intmax_t i = 2; i*i < R; ++i) {
if (small[i] < i) continue;
small[i] = i;
for (intmax_t j = i*i; j < M; j += i)
if (small[j] == j) small[j] = i;
for (intmax_t j = (L+i-1)/i*i; j < R; j += i) {
intmax_t k = j;
do {
// aux[j-L] > M で判定した方がいいかも？
// j / aux[j-L] < M の方がいい？（割り算したくない）
if (aux[j-L] * aux[j-L] > R) break;
large[j-L].push_back(i);
aux[j-L] *= i;
k /= i;
} while (k % i == 0);
}
}
}
std::vector<intmax_t> factor(intmax_t n) {
assert(L <= n && n < R);
std::vector<intmax_t> res = large[n-L];
n /= aux[n-L];
if (n >= M) {
// この場合，n は素数となることが示せる（はず）
// n*n >= R だとオーバーフローしそう？
res.push_back(n);
return res;
}
while (n > 1) {
res.push_back(small[n]);
n /= small[n];
}
return res;
}
};
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n+n);
rep(i,n)cin >> a[i];
ll m=99999999999999999,p,j,k;
for (ll bit = 0; bit < (1<<n); ++bit) {
p=0;
j=0;
k=0;
b[0]=0;
for (ll i = 0; i < n; ++i) {
if (bit & (1<<i)){ // 列挙に i が含まれるか
j++;
b[j]=a[i];
}
else{
b[j]=b[j]|a[i];
}
}
for (ll i = 0; i < j+1; ++i) {
p=p^b[i];
}
if(m>p)m=p;
}
cout << m << endl;
} | #include <iostream>
#include <vector>
#define int long long
using namespace std;
const int N = 30;
typedef long long LL;
int n;
LL seq[N];
signed main(){
#ifndef ONLINE_JUDGE
freopen("tpl.txt","r",stdin);
#endif
cin >> n;
for(int i = 0; i < n; i ++) cin >> seq[i];
int ans = 0x7f7f7f7f;
for(int i = 0; i <= (1 << n) -1; i ++){
vector<LL > vc;
for(int j = i ,l = 0 , r = 0; r != n ;j >>= 1, r ++){
int t = 0;
if( j & 1 == 1 || r == n-1){
t = seq[l];
while(l <= r){
//cout << seq[l] << ' ';
t |= seq[l];
l++;
}
vc.push_back(t);
}
}
//cout << endl;
int tt = vc[0];
for(int k = 1; k < vc.size();k++){
tt ^= vc[k];
}
ans = min(tt,ans);
}
int t = 0;
for(int i = 0; i < n; i ++){
t ^= seq[i];
//cout << seq[i] << ' ';
}
//cout << endl;
ans = min(t,ans);
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,ans=0;
bool dt[20][20];
char str[20];
inline int read()
{
int x=0,w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return w?-x:x;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++){
scanf("%s",str+1);
for(int j=1;j<=m;j++)
dt[i][j]=(str[j]=='#');
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if((dt[i-1][j]==0||dt[i-1][j-1]==1)&&(dt[i][j]==1&&dt[i][j-1]==0))ans++;
if((dt[i-1][j]==0||dt[i-1][j+1]==1)&&(dt[i][j]==1&&dt[i][j+1]==0))ans++;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if((dt[i][j-1]==0||dt[i-1][j-1]==1)&&(dt[i][j]==1&&dt[i-1][j]==0))ans++;
if((dt[i][j-1]==0||dt[i+1][j-1]==1)&&(dt[i][j]==1&&dt[i+1][j]==0))ans++;
}
}
cout<<ans<<'\n';
} | //#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<vector>
#define swap(x,y) (y -= (x = ((y += x) - x)))
#define max(a,b) (((a) > (b)) ? (a) : (b))
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define reps(i,n) for(int i = 1, i <= (int)(n); 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 all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
using ll = long long;
using namespace std;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
int digit(ll n, int a) { int s = 0; for (int i = 0; n > 0; i++) { s++; n /= a; } return s; }
int imax(int a[], int n) { int s = a[0]; rep(i, n) { s = max(s, a[i]); } return s; }
int imin(int a[], int n) { int s = a[0]; rep(i, n) { s = min(s, a[i]); } return s; }
int cmax(string a, int n) { int s = 0; rep(i, n) { s = max(s, (int)a[i] - '0'); } return s; }
int cmin(string a, int n) { int s = 9; rep(i, n) { s = min(s, (int)a[i] - '0'); } return s; }
//quick sort(int)
int ascfunc(const void* n1, const void* n2) {
if (*(int*)n1 > *(int*)n2) {
return 1;
}
if (*(int*)n1 < *(int*)n2) {
return -1;
}
if (*(int*)n1 == *(int*)n2) {
return 0;
}
}
int main(void) {
int h, w; cin >> h >> w;
string* s = new string[h];
rep(i, h) {
cin >> s[i];
}
int ans = 0;
rep(i, h) {
rep(j, w) {
if (i < h - 1 && j < w - 1) {
int bn = 0;
rep(k, 2) {
rep(l, 2) {
if (s[i + k][j + l] == '#') {
bn++;
}
}
}
if (bn == 1 || bn == 3) {
ans++;
}
}
}
}
cout << ans << endl;
return 0;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b){a=max(a,b);}
void rd(int&x){scanf("%i",&x);}
void rd(ll&x){scanf("%lld",&x);}
void rd(char*x){scanf("%s",x);}
void rd(ldb&x){scanf("%lf",&x);}
void rd(string&x){scanf("%s",&x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&i:x)rd(i);}
template<typename T,typename...A>void rd(T&x,A&...args){rd(x);rd(args...);}
template<typename T>void rd(){T x;rd(x);return x;}
int ri(){int x;rd(x);return x;}
template<typename T>vector<T> rv(int n){vector<T> x(n);rd(x);return x;}
template<typename T>void ra(T a[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]);}
template<typename T1,typename T2>void ra(T1 a[],T2 b[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]),rd(b[st+i]);}
template<typename T1,typename T2,typename T3>void ra(T1 a[],T2 b[],T3 c[],int n,int st=1){for(int i=0;i<n;++i)rd(a[st+i]),rd(b[st+i]),rd(c[st+i]);}
void re(vector<int> E[],int m,bool dir=0){for(int i=0,u,v;i<m;++i){rd(u,v);E[u].pb(v);if(!dir)E[v].pb(u);}}
template<typename T>void re(vector<pair<int,T>> E[],int m,bool dir=0){for(int i=0,u,v;i<m;++i){T w;rd(u,v,w);E[u].pb({v,w});if(!dir)E[v].pb({u,w});}}
const int N=500050;
char s[N],t[N];
queue<int> A,B;
int main(){
int n=ri();
rd(s+1);rd(t+1);
for(int i=1;i<=n;i++){
if(s[i]=='1')A.push(i);
if(t[i]=='1')B.push(i);
}
ll ans=0;
while(A.size()||B.size()){
if(B.empty()){
if(A.size()==1)return 0*printf("-1\n");
int i=A.front();A.pop();
int j=A.front();A.pop();
ans+=j-i;
}else{
if(A.empty())return 0*printf("-1\n");
if(A.front()<B.front()){
if(A.size()==1)return 0*printf("-1\n");
int i=A.front();A.pop();
int j=A.front();A.pop();
ans+=j-i;
}else{
int i=B.front();B.pop();
int j=A.front();A.pop();
ans+=j-i;
}
}
}
printf("%lld\n",ans);
return 0;
} | #include<cstdio>
#include<algorithm>
#include<set>
using namespace std;
int n,s[500005],t[500005],tops,topt;
long long ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
char tmp;
scanf(" %c",&tmp);
if(tmp=='1') s[++tops]=i;
}
for(int i=1;i<=n;i++)
{
char tmp;
scanf(" %c",&tmp);
if(tmp=='1') t[++topt]=i;
}
reverse(s+1,s+tops+1);
reverse(t+1,t+topt+1);
while(tops!=0 || topt!=0)
{
if(tops==0)
{
printf("-1\n");
return 0;
}
if(topt==0)
{
while(tops!=0)
{
if(tops==1)
{
printf("-1\n");
return 0;
}
ans+=s[tops-1]-s[tops];
tops-=2;
}
break;
}
while(s[tops]<t[topt])
{
if(tops==1)
{
printf("-1\n");
return 0;
}
ans+=s[tops-1]-s[tops];
tops-=2;
}
ans+=s[tops]-t[topt];
tops--;
topt--;
}
printf("%lld\n",ans);
} |
#include <iostream>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if(x + y> 14 and y > 7){
cout << "1";
} else if (x + y > 9 and y > 2){
cout << "2";
} else if (x + y > 2 and y >= 0){
cout << "3";
} else {
cout << "4";
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
#include <typeinfo>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i,a,b) for(lli i=a;i<b;i++)
#define bfr(i,a,b) for(lli i=a;i>=b;i--)
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL),cout.tie(NULL);
#define tc int t;cin>>t;while(t--)
//#define mod 1000000007LL
#define mod2 998244353LL
#define PI 3.14159265359
#define all(vec) vec.begin(),vec.end()
#define ld long double
#define pb push_back
#define ordered_set tree<lli, null_type,less<lli>, rb_tree_tag,tree_order_statistics_node_update>
lli pmod(lli x,lli y,lli mod){lli res=1;while(y>0){if(y&1)res = ((res%mod)*(x%mod))%mod;y>>=1;x= ((x%mod)*(x%mod))%mod;}return res;}
lli power(lli x,lli y){lli res=1;while(y>0){if(y&1)res=res*x;y>>=1;x=x*x;}return res;}
lli gcd(lli a , lli b)
{
if(b==0) return a;
a%=b;
return gcd(b,a);
}
int main()
{
fio
lli 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;
return 0;}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,c=0;
vector<bool>vis;
vector<vector<int>>adj;
void dfs(int node)
{
vis[node]=true;
for(auto child: adj[node])
{
if (!vis[child])
{
c++;
dfs(child);
}
}
}
int main() {
int i,j;
cin>>n>>m;
adj.resize(n);
vis.resize(n);
for(i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
a--;b--;
adj[a].push_back(b);
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
vis[j]=false;
dfs(i);
}
cout<<c+n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); ++i)
ll INF = 1ll << 60;
vi G[2010];
bool ck[2010];
void init(){
rep(i, 0, 2010){
ck[i] = false;
}
}
void dfs(int v){
ck[v] = true;
for(auto nv : G[v]){
if(ck[nv]){
continue;
}
dfs(nv);
}
}
int main(){
int n, m;
cin >> n >> m;
rep(i, 0, m){
int a, b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
ll ans = 0;
rep(i, 0, n){
init();
ll cnt = 0;
dfs(i);
rep(i, 0, 2010){
if(ck[i]){
cnt++;
}
}
ans += cnt;
}
cout << ans << endl;
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
const int MOD = 998244353;
class Solution {
public:
void execute(int test, istream &in) {
int n;
string s, t;
in >> n >> s >> t;
int i = 0, j = 0;
int cnts = 0, cntt = 0;
int answer = 0;
while (i < n || j < n) {
while (i < n && s[i] != '0')
i++;
while (j < n && t[j] != '0')
j++;
if (i < n && j < n) {
if (i != j)
answer++;
}
if (i < n) {
cnts++;
i++;
}
if (j < n) {
cntt++;
j++;
}
}
if (cnts != cntt)
answer = -1;
printf("%d\n", answer);
}
};
int main(int argc, char* argv[])
{
#ifdef VLAD_LOCAL
//FILE *f = fopen("in.txt", "r");
ifstream f("in.txt");
auto start = std::chrono::steady_clock::now();
#else
//FILE *f = stdin;
istream &f = cin;
#endif
//std::ios_base::sync_with_stdio(false);
int tests = 1;
//f >> tests;
for (int test = 0; test < tests; test++) {
Solution sol;
sol.execute(test, f);
}
#ifdef VLAD_LOCAL
auto end = std::chrono::steady_clock::now();
double seconds = (double)std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count() / 1000;
printf("\n%.3lf seconds\n", seconds);
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 3e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll extGcd(ll a, ll b, ll &x, ll &y) { // solves for x and y where ax+by=gcd(a,b)
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll modInv(ll a, ll p) { // solve for x=a^-1 where ax + py = 1 % p
if(gcd(a, p) != 1) return -1; // modInv only exists if a and p are coprime (gcd(a, p) = 1)
ll x, y;
extGcd(a, p, x, y);
x = (x % p + p) % p;
return x;
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a,b);
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return res;
}
int find(int x) {
return x == parent[x] ? x : parent[x] = find(parent[x]);
}
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if(xPar != yPar) parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for(ll i=1;i<=r;i++) {
res = res * (n - r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
int msbPos(int n) {
if(n == 0) return 0;
int msbPos = 0;
n /= 2;
while(n != 0) {
n /= 2;
msbPos++;
}
return msbPos;
}
string toOct(int n) {
string res;
while(n > 0) {
res = to_string(n % 8) + res;
n /= 8;
}
return res;
}
void solve() {
ll n, s, k;
cin >> n >> s >> k;
ll c = n - s;
ll d = gcd(gcd(k, c), n);
k /= d;
c /= d;
n /= d;
if(modInv(k, n) == -1) {
cout << -1 << endl;
}
else {
cout << (modInv(k, n) * c) % n << endl; // solving x = (b * a^-1) % n. here kx = (n - s) % n -> x = (k^-1 * (c = n - s)) % n;
}
}
int main()
{
IOS
int t;
cin >> t;
while(t--) solve();
//solve();
return 0;
} |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dx[] = { 0, 1, -1, 0, 1, -1, 1, -1 }; // i<4:4way i<8:8way
int dy[] = { 1, 0, 0, -1, 1, -1, -1, 1 };
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int n,m;
vector<vector<pair<int,int>>> g;
void rec(int v,int c,vector<int> &res){
res[v] = c;
for(auto e: g[v]){
if(res[e.first] != -1)continue;
if(e.second == c)rec(e.first,(e.second+1)%n,res);
else rec(e.first,e.second,res);
}
}
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
cin >> n >> m;
g.resize(n);
rep(i,m){
int a,b,c;
cin >> a >> b >> c;
a--;b--;c--;
g[a].push_back({b,c});
g[b].push_back({a,c});
}
vector<int> res(n,-1);
rec(0,0,res);
for(auto v:res)cout << v + 1 << endl;
} | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=400005;
int fa[N],rk[N];
int h[N],nxt[N],to[N],ww[N],cnt=0;
int n,m;
int ans[N];
int getfa(int x) {
if (fa[x]==x) return x;
return fa[x]=getfa(fa[x]);
}
void SetUnion(int fx,int fy) {
if (rk[fx]>rk[fy]) swap(fx,fy);
fa[fx]=fy;
rk[fy]+=rk[fx];
}
void add_e(int u,int v,int w) {
to[++cnt]=v;
ww[cnt]=w;
nxt[cnt]=h[u];
h[u]=cnt;
}
void dfs(int cur,int f,int path) {
if (cur!=1) {
if (ans[f]==path) {
ans[cur]=1;
if (ans[cur]==path) ans[cur]++;
} else ans[cur]=path;
}
for (int i=h[cur]; i; i=nxt[i]) {
int v=to[i];
if (v==f) continue;
dfs(v,cur,ww[i]);
}
}
int main() {
scanf("%d%d",&n,&m);
for (int i=1; i<=n; i++) {
rk[i]=1;
fa[i]=i;
}
for (int i=1; i<=m; i++) {
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
int fx=getfa(u),fy=getfa(v);
if (fx!=fy) {
add_e(u,v,w);
add_e(v,u,w);
SetUnion(fx,fy);
}
}
ans[1]=1;
dfs(1,0,0);
int flag=1;
for (int i=1; i<=n; i++)
if (ans[i]==0) flag=0;
if (flag==1)
for (int i=1; i<=n; i++)
printf("%d\n",ans[i]);
else
printf("No");
return 0;
} |
//Name : Rupa Dey
//Date : 1st November 2020 //happy birthday Mhamuda
//joi sri gour hori gobindo...
//gobindo ja hobe vlor jonnoi hobe..
#include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define n0 cout<<"No\n"<<endl
#define test cin>>t; while(t--)
#define for(i,a,n) for(i=a;i<n;i++)
#define mp make_pair
#define ft first
#define sc second
#define gp ' ';
#define MAX 9999999
#define MOD 1000000007
#define nd endl
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
if(n%2==0) cout<<"White"<<nd;
else cout<<"Black"<<nd;
}
//hare krishna...
//hey gobindo kripa koro......
//only gobindo exists..^..
| #include<bits/stdc++.h>
using namespace std;
int n;
int main(){
cin >> n;
int t;
vector<tuple<int, int, int>> v;
while(cin >> t){
int a, b;
cin >> a >> b;
v.push_back(make_tuple(t, a, b));
}
int ans = 0;
for(int i=0; i<(int)v.size()-1; i++){
for(int j=i+1; j<(int)v.size(); j++){
bool hoge = false;
bool temp0, temp1;
if(get<0>(v.at(i))<=2 && get<0>(v.at(j))%2==1){
temp0 = (get<1>(v.at(i)) <= get<2>(v.at(j))? true: false);
}else{
temp0 = (get<1>(v.at(i)) < get<2>(v.at(j))? true: false);
}
if(get<0>(v.at(i))%2==1 && get<0>(v.at(j))<=2){
temp1 = (get<2>(v.at(i)) >= get<1>(v.at(j))? true: false);
}else{
temp1 = (get<2>(v.at(i)) > get<1>(v.at(j))? true: false);
}
ans+= temp0&&temp1;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;
const int maxn = 1e5 + 10;
int a[maxn], b[maxn], n;
int main()
{
cin >> n;
int ans = INT32_MAX;
for (int i = 1; i <= n; ++i)
{
cin >> a[i] >> b[i];
ans = min(a[i]+b[i], ans);
}
for (int i = 1; i <= n; ++i)
for (int j = i+1; j <= n; ++j)
ans = min(ans, min(max(a[i], b[j]), max(a[j], b[i])));
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <time.h>
using namespace std;
//typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
//define
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
int main(){
int n;
cin >> n;
vector<ll> a(n),b(n);
rep(i,n) cin >> a.at(i) >> b.at(i);
ll x=1e6,y=1e6;
rep(i,n){
rep(j,n){
if(i==j){
x=min(x,a.at(i)+b.at(j));
}else{
x=min(x,max(a.at(i),b.at(j)));
}
}
}
cout << x << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ull unsigned long long
void testcase(){
ll n,ans=0;
cin>>n;
for(int i=1;i<=n;i++){
bool st=true;
int j=i;
while(j){
if(j%10==7){
st=false;
break;
}
j/=10;
}
j=i;
while(j){
if(j%8==7){
st=false;
break;
}
j/=8;
}
if(st){
ans++;
}
}
cout<<ans;
}
int main() {
ll t=1;
//cin>>t;
while(t--){
testcase();
//cout<<'\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define F first
#define S second
#define pll pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define decimal(n) cout << fixed << setprecision(n)
#define mod 1000000007
// #define mod 998244353
#define pi 3.14159265358979323846
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1, tc;
//cin >> t;
for (tc = 1; tc <= t; tc++)
{
ll n, i;
cin >> n;
ll ans = 0, val = 7;
set<ll> s;
for (i = 1; i <= n; i++)
{
ll x = i;
while (x > 0)
{
if (x % 10 == 7)
{
s.insert(i);
break;
}
x /= 10;
}
x = i;
while (x > 0)
{
if (x % 8 == 7)
{
s.insert(i);
break;
}
x /= 8;
}
}
cout << n - s.size();
}
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
int f(int b,int r,int c){
return b*500*500+r*500+c;
}
int main(){
int R,C; cin >> R >> C;
vvi g(500*500*2);
vvi co(500*500*2);
rep(r,R) rep(c,C-1){
int in; cin >> in;
g[f(0,r,c)].pb(f(0,r,c+1));
g[f(0,r,c+1)].pb(f(0,r,c));
co[f(0,r,c)].pb(in);
co[f(0,r,c+1)].pb(in);
}
rep(r,R-1) rep(c,C){
int in; cin >> in;
g[f(0,r,c)].pb(f(0,r+1,c));
co[f(0,r,c)].pb(in);
}
rep(r,R-1) rep(c,C){
g[f(1,r+1,c)].pb(f(1,r,c));
co[f(1,r+1,c)].pb(1);
}
rep(r,R) rep(c,C){
g[f(0,r,c)].pb(f(1,r,c));
co[f(0,r,c)].pb(1);
g[f(1,r,c)].pb(f(0,r,c));
co[f(1,r,c)].pb(0);
}
vector<int> D(500*500*2, -1);
vector<bool> used(500*500*2, false);
priority_queue<pair<int,int>,
vector<pair<int,int>>,
greater<pair<int,int>>> q;
q.push({(int)0,f(0,0,0)});
while(!q.empty()){
int d = q.top().first; int to = q.top().second; q.pop();
if(used[to]) continue;
used[to] = true; D[to] = d;
rep(i,sz(g[to])){
int nxt=g[to][i];
if(D[nxt] != -1 && D[nxt] <= D[to] + co[to][i]) continue;
q.push({D[to] + co[to][i], nxt});
}
}
int ans = D[f(0,R-1,C-1)];
cout << ans << endl;
return 0;
}
| #include <queue>
#include <cstdio>
#include <cstring>
#pragma GCC optimize(2)
#define int long long
const int N = 505;
struct twt {
int x, y, d;
bool operator < (twt b) const {
return d > b.d;
}
};
std::priority_queue<twt> que;
int R, C, a[N][N], b[N][N], dis[N][N];
void Dijkstra() {
memset(dis, 0x3f, sizeof dis);
que.push((twt){1, 1, 0});
dis[1][1] = 0;
while(!que.empty()) {
register twt now = que.top(); que.pop();
register int x = now.x, y = now.y, d = now.d;
if(x == R && y == C) return ;
if(now.d != dis[x][y]) continue;
if(y < C && d + a[x][y] < dis[x][y+1]) {
dis[x][y+1] = d + a[x][y];
que.push((twt){x, y+1, dis[x][y+1]});
}
if(y > 1 && d + a[x][y-1] < dis[x][y-1]) {
dis[x][y-1] = d + a[x][y-1];
que.push((twt){x, y-1, dis[x][y-1]});
}
if(x < R && d + b[x][y] < dis[x+1][y]) {
dis[x+1][y] = d + b[x][y];
que.push((twt){x+1, y, dis[x+1][y]});
}
for(register int i = 1; i < x; i++) {
if(d + i+1 < dis[x-i][y]) {
dis[x-i][y] = d+i+1;
que.push((twt){x-i, y, dis[x-i][y]});
}
}
}
}
signed main() {
scanf("%lld%lld", &R, &C);
for(register int i = 1; i <= R; i++)
for(register int j = 1; j < C; j++) scanf("%lld", &a[i][j]);
for(register int i = 1; i < R; i++)
for(register int j = 1; j <= C; j++) scanf("%lld", &b[i][j]);
Dijkstra();
printf("%lld", dis[R][C]);
return 0;
} |
/**
* author: ekusiadadus
* created: 03.01.2021 14:00:37
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repn(i,n) for(int i = 1; i <= (n); i++)
#define pb push_back
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const double PI = acos(-1);
const int mod = 1000000007;
class mint {
long long x;
public:
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 {
mint res(*this);
return res+=a;
}
mint operator-(const mint& a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint& a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
return a;
}
// for prime mod
mint inv() const {
return pow(mod-2);
}
mint& operator/=(const mint& a) {
return (*this) *= a.inv();
}
mint operator/(const mint& a) const {
mint res(*this);
return res/=a;
}
friend ostream& operator<<(ostream& os, const mint& m){
os << m.x;
return os;
}
};
#pragma endregion
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin >> n;
vector<int> a(n-1), b(n-1);
vector<vector<int>> g(n);
for(int i = 0; i < n-1; ++i){
cin >> a[i] >> b[i];
a[i]--,b[i]--;
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
vector<int> p(n,-1);
vector<vector<int>> ch(n);
queue<int> q;
q.push(0);
vector<int> bfs;
while(!q.empty()){
int v = q.front();
q.pop();
bfs.push_back(v);
for(int w:g[v]){
if(w!=p[v]){
p[w] = v;
ch[v].push_back(w);
q.push(w);
}
}
}
int t;
cin >> t;
ll sum = 0;
vector<ll> c(n,0);
while(t--){
int t,e,x;
cin >> t >> e >> x;
e--;
int a1,b1;
if(t == 1){
a1 = a[e];
b1 = b[e];
}else{
a1 = b[e];
b1 = a[e];
}
if(b1 == p[a1]) c[a1] += x;
else{
sum += x;
c[b1] -= x;
}
}
for(int v:bfs){
for(int w:ch[v]){
c[w] += c[v];
}
}
for(int i = 0; i < n; ++i){
cout << sum + c[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int MAXN = 2E5 + 5;
const int MOD = 1E9 + 7;
int n, m, k;
LL x[MAXN], y[MAXN];
LL mixh[MAXN], miyh[MAXN];
LL ans = 0;
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') f = (ch == '-' ? -1 : 1), ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
x *= f;
}
template <class T, class... Args>
void read(T& x, Args&... args) {
read(x), read(args...);
}
template <class T>
void write(T x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
#define lid id << 1
#define rid id << 1 | 1
struct node {
int l, r;
LL sum;
} tr[MAXN << 2];
void update(int id) { tr[id].sum = tr[lid].sum + tr[rid].sum; }
void build(int id, int l, int r) {
tr[id].l = l, tr[id].r = r;
if (l == r) {
tr[id].sum = 1;
return;
}
int mid = l + r >> 1;
build(lid, l, mid);
build(rid, mid + 1, r);
update(id);
}
int query(int id, int l, int r) {
if (tr[id].l == l && tr[id].r == r) return tr[id].sum;
int mid = tr[id].l + tr[id].r >> 1;
if (r <= mid)
return query(lid, l, r);
else if (l > mid)
return query(rid, l, r);
else
return query(lid, l, mid) + query(rid, mid + 1, r);
}
void modify(int id, int x) {
if (tr[id].l == x && tr[id].r == x) {
tr[id].sum = 0;
return;
}
int mid = tr[id].l + tr[id].r >> 1;
if (x <= mid)
modify(lid, x);
else
modify(rid, x);
update(id);
}
vector<int> s[MAXN];
signed main() {
// freopen("1.in", "r", stdin);
ios::sync_with_stdio(false);
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) mixh[i] = m + 1;
for (int i = 1; i <= m; i++) miyh[i] = n + 1;
for (int i = 1; i <= k; i++) {
cin >> x[i] >> y[i];
mixh[x[i]] = min(mixh[x[i]], y[i]);
miyh[y[i]] = min(miyh[y[i]], x[i]);
s[x[i]].push_back(y[i]);
}
for (int i = 1; i < miyh[1]; i++) ans += mixh[i] - 1;
for (int i = 1; i < mixh[1]; i++) ans += miyh[i] - 1;
// cout << ans << endl;
build(1, 1, m + 2);
for (int i = 1; i < miyh[1]; i++) {
ans -= query(1, 1, min(mixh[i] - 1, mixh[1] - 1));
for (auto& y : s[i]) modify(1, y);
}
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(ll x, ll y)
{
if (x >= y)
return x - y;
ll ans = y - x;
queue<pair<ll, int>> q;
map<ll, int> mp;
q.push({y, 0});
while (q.size())
{
auto p = q.front();
q.pop();
ll cur = p.first;
ll cnt = p.second;
ans = min(ans, cnt + abs(x - cur));
if (cur <= x)
continue;
if (mp[cur] != 0)
continue;
mp[cur] = cnt;
if (cur % 2 == 0)
{
q.push({cur / 2, cnt + 1});
}
else
{
q.push({cur + 1, cnt + 1});
q.push({cur - 1, cnt + 1});
}
}
return ans;
}
int main()
{
ll x, y;
cin >> x >> y;
cout << solve(x, y) << endl;
}
// x > y
// -> x - y
// x <= y
// -> + or - -> x -> + or -
// 3 20
// 3 4 5 10 20
// 4 30
// 4 5 6 7 14 28 29 30
// 4 5 6 7 8 16 32 31 30
// 5 16
// 5 6 7 14 15 16
// 5 4 8 16
// 5 6 7 8 16
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000000000000
#define MOD 998244353
using ll=long long;
using Graph=vector<vector<int>>;
int main(){
ll X,Y;
cin>>X>>Y;
if(X>=Y){
cout<<X-Y<<endl;
}else{
ll ans=Y-X;
vector<map<ll,ll>> m(64);
m[0][Y]=0;
for(int i=0;i<63;i++){
for(auto p:m[i]){
ll y=p.first;
ll cnt=p.second;
ll yy=X-y;
if(yy<0){
yy=-yy;
}
ans=min<ll>(ans,cnt+yy);
if(y%2==0){
if(m[i+1].count(y/2)==0){
m[i+1][y/2]=cnt+1;
}else{
m[i+1][y/2]=min<ll>(cnt+1,m[i+1][y/2]);
}
}else{
if(m[i+1].count((y-1)/2)==0){
m[i+1][(y-1)/2]=cnt+2;
}else{
m[i+1][(y-1)/2]=min<ll>(cnt+2,m[i+1][(y-1)/2]);
}
if(m[i+1].count((y+1)/2)==0){
m[i+1][(y+1)/2]=cnt+2;
}else{
m[i+1][(y+1)/2]=min<ll>(cnt+2,m[i+1][(y+1)/2]);
}
}
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
#define all(v) (v).begin(),(v).end()
const double pi = acos(-1.0);
const double eps = 1e-12;
using namespace std;
const int N = 1e8 + 10;
int a[N][2];
ll sum(unordered_map<int, ll> &t, int i, int id) {
ll res = 0;
for (; i >= 0; i -= (i + 1) & -(i + 1))
if (t.count(i)) res += t[i];
return res;
}
void inc(unordered_map<int, ll> &t, int i, int value, int id) {
for (; i < N; i += (i + 1) & -(i + 1))
t[i] += value;
}
ll sum (unordered_map<int, ll> &t, int l, int r, int id){
ll res = 0;
if (r > 0) res = sum (t, r, id);
if (l - 1 >= 0) res -= sum (t, l - 1, id);
return res;
}
int n, m, q;
void solve(){
unordered_map <int, ll> t[4];
cin >> n >> m >> q;
inc(t[0], 0, n, 0);
inc(t[1], 0, m, 1);
ll ans = 0;
while (q--){
int type, x, y;
cin >> type >> x >> y;
type--;
inc(t[type], a[x][type], -1, type);
inc(t[type], y, 1, type);
inc(t[type + 2], a[x][type], -a[x][type], type + 2);
inc(t[type + 2], y, y, type + 2);
ll prefSumx = sum(t[type ^ 1], 0, a[x][type], type ^ 1);
ll prefSumy = sum(t[type ^ 1], 0, y, type ^ 1);
ll delta = sum(t[(type + 2) ^ 1], a[x][type] + 1, y, (type + 2) ^ 1);
ans -= prefSumx * a[x][type];
ans += prefSumy * y;
ans -= delta;
a[x][type] = y;
//cout << ans << " " << prefSumx << " " << prefSumy << " " << delta << endl;
cout << ans << "\n";
}
//cout << ans << endl;
}
int main(){
ios::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
cout.setf(ios::fixed), cout.precision(6);
//freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout);
//freopen("exercise.in","r",stdin); freopen("exercise.out", "w", stdout);
int step;
step = 1;
//cin >> step;
for (int i = 1; i <= step; i++){
solve();
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int n,x;
string s;
cin>>n>>x>>s;
int ans=x;
rep(i,n){
if(s[i]=='o') ans++;
else{
if(ans>0) ans--;
}
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using ll= long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define INF (ll)1e9 //10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9+7) //10^9+7:合同式の法
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second
#define __MAGIC__ ios::sync_with_stdio(false);cin.tie(nullptr);
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define Graph vector<vector<int>>
#define PII pair<int,int>
#define VI vector<int>
#define VVI vector<vector<int>>
#define VPII vector<pair<int,int>>
#define DDD fixed<<setprecision(10)
#define endl "\n"
using namespace std;
/*..................DEFINE GLOBAL VARIABLES...................*/
/*.....................DEFINE FUNCTIONS ......................*/
/*.........................kemkemG0...........................*/
signed main() {
__MAGIC__
int N;
string S;
cin>>N>>S;
stack<int> stc;
REP(i,N){
if(stc.size()>=2 && S[i]=='x'){
char oo=stc.top();stc.pop();
char ff=stc.top();stc.pop();
if(oo=='o' && ff=='f')continue;
else {
stc.push(oo);
stc.push(ff);
stc.push(S[i]);
}
}
else stc.push(S[i]);
}
cout<<stc.size()<<endl;
return 0;
}
| #include <bits/stdc++.h>
std::string b,t="fox";int a,i;main(){for(std::cin>>a>>b;i<a-2;i++)if(b.substr(i,3)==t)b.erase(i,3),i=std::max(-1,i-3),a-=3;std::cout<<a;}
|
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define pb push_back #define po pop_back
#define YES cout<<"YES\n" #define Yes cout<<"Yes\n" #define NO cout<<"NO\n" #define No cout<<"No\n"
#define for00 for(int i=1;i<=n;i++) cin>>a[i];
#define for0 for(int i=0;i<n;i++)
#define for1 for(int i=1;i<=n;i++)
#define for2(i,a,b) for(int i=a; i<=b;i++)
#define for3(i,a,b) for(int i=a; i>=b;i--)
#define cn change_number_tostring
#define cs change_string_tonumber
#define pri init_prime_distance
#define all(a) begin(a), end(a)
#define SUM(a) accumulate(all(a), 0LL)
#define MIN(a) (*min_element(all(a)))
#define MAX(a) (*max_element(all(a)))
#define lb(a, x) distance(begin(a), lower_bound(all(a), (x)))
#define ub(a, x) distance(begin(a), upper_bound(all(a), (x)))
#define gcd __gcd
#define debug(x) cout<<"x="<<x<<endl
using namespace std;
const int N = 2e5+10;
inline string change_number_tostring(int i) { stringstream ss; ss<<i; return ss.str(); }
inline int change_string_tonumber(string s) { int num; stringstream ss(s); ss>>num; return num; }
map<pair<int,int>,int> mp;
int ans;
struct ss{
int x,y;
}a[N];
set<pair<int,int>> s;
void solve()
{
int n; cin>>n;
for(int i=1;i<=n;i++)
{
int x; cin>>x;
a[i].x = x/100;
a[i].y = x%100;
mp[{a[i].x%2,a[i].y}]++;
s.insert({a[i].x%2,a[i].y});
}
for(int i=1;i<=n;i++)
{
pair<int,int> x = {a[i].x%2,a[i].y};
if(s.find(x)!=s.end())
{
if(mp[x]<2)continue;
else ans+= mp[x]*(mp[x]-1)/2;
auto q = s.find(x);
s.erase(q);
}
}
cout<<ans<<endl;
}
signed main()
{
ios;
solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; (i) >= (int)(a); (i)--)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> using V = vector<T>;
template <class T> using VV = vector<V<T>>;
/* 提出時これをコメントアウトする */
#define LOCAL true
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
constexpr char endl = '\n';
ll n;
cin >> n;
V<ll> a(n);
rep(i,0,n) cin >> a[i];
V<ll> cnt(210);
rep(i,0,n) {
cnt[a[i] % 200]++;
}
ll ans = 0;
rep(i,0,200) {
ll k = cnt[i];
ans += k * (k - 1) / 2;
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = (1LL << 60);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main(){
ll T;cin>>T;
string seq0,seq1;
rep(i,100000)seq0+="0";
rep(i,100000)seq1+="1";
rep(i,T){
ll N;
cin >> N;
rep(j,3){
string t;cin>>t;
}
string ans;
ans=seq0.substr(0,N)+seq1.substr(0,N)+"0";
cout<<ans<<endl;
}
} | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
const ll inf = 2e18;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll t; cin >> t;
rep(i,t){
ll n; string s; cin >> n >> s >> s >> s;
cout << string(n,'0') << string(n,'1') << '0' << endl;
}
} |
#include<bits/stdc++.h>
const int N=200010;
int n,m;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin>>n>>m;
if(m>0){
if(m+2>n){
std::cout<<"-1\n";
return 0;
}
for(int i=1;i<=m+1;++i){
std::cout<<i*2<<' '<<i*2+1<<'\n';
}
std::cout<<1<<' '<<(m+2)*2<<'\n';
for(int i=1+(m+2)*2;i<=(m+2)*2+2*(n-(m+2));i+=2){
std::cout<<i<<' '<<i+1<<'\n';
}
}else{
if(m==0){
for(int i=1;i<=n;++i){
std::cout<<i*2<<' '<<i*2+1<<'\n';
}
}else{
std::cout<<"-1\n";
}
}
return 0;
} | #include <cstdio>
#include <cctype>
using namespace std;
#define gc getchar
inline int read()
{
int c = gc(), t = 1, n = 0;
while (isspace(c)) { c = gc(); }
if (c == '-') { t = -1, c = gc(); }
while (isdigit(c)) { n = n * 10 + c - '0', c = gc(); }
return n * t;
}
#undef gc
int main()
{
int n = read(), m = read();
if (m < 0)
{
puts("-1");
return 0;
}
if (n == 1)
{
if (m != 0)
{
puts("-1");
return 0;
}
puts("1 2");
return 0;
}
if (m >= n - 1)
{
puts("-1");
return 0;
}
for (int i = 1; i < n; i++)
printf("%d %d\n", i * 4 - 2, i * 4);
printf("1 %d\n", (m + 1) * 4 + 1);
return 0;
} |
//author: hitch_hiker42;
#include<bits/stdc++.h>
using namespace std;
//solution:
#define int int64_t
#define span(a) begin(a), end(a)
constexpr int mod = 1e9 + 7;
void hike() {
int n; cin >> n;
vector<int> a(n);
for(int& i: a) {
cin >> i;
}
if(n == 1) {
cout << a[0] << "\n";
return;
}
int dp[n][2], p[n][2];
memset(dp, 0, sizeof dp);
memset(p, 0, sizeof p);
dp[1][0] = a[0] - a[1];
dp[1][1] = a[0] + a[1];
p[1][0] = p[1][1] = 1;
for(int i = 2; i < n; ++i) {
dp[i][0] = ((dp[i - 1][1] - p[i - 1][1] * a[i] % mod) % mod + mod) % mod;
dp[i][1] = ((dp[i - 1][0] + dp[i - 1][1]) % mod + (p[i - 1][0] + p[i - 1][1]) * a[i] % mod) % mod;
p[i][0] = p[i - 1][1];
p[i][1] = (p[i - 1][0] + p[i - 1][1]) % mod;
}
cout << (dp[n - 1][0] + dp[n - 1][1]) % mod << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1; //cin >> t;
while(t--) hike();
return 0;
} //farewell, until we meet again.. | #include <bits/stdc++.h>
using namespace std;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using isize = ptrdiff_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using usize = size_t;
using f32 = float_t;
using f64 = double_t;
template <typename T> using vec = vector<T>;
template <typename T> using vec_deq = deque<T>;
template <typename T> using linked_list = list<T>;
template<typename T> using hash_set = unordered_set<T>;
template<typename T> using btree_set = set<T>;
template<typename K, typename V> using hash_map = unordered_map<K, V>;
template<typename K, typename V> using btree_map = map<K, V>;
template<typename T> using max_heap = priority_queue<T>;
template<typename T> using min_heap = priority_queue<T, vec<T>, greater<T>>;
template<typename T> using fn = function<T>;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
namespace mod {
template<typename Tp>
inline Tp pow(Tp x, u64 y) {
Tp r = (Tp)1;
while (y) {
if (y & 1) r = r * x;
x = x * x, y >>= 1;
}
return r;
}
constexpr bool is_prime(i64 n) {
if (n == 1) return false;
if ((n & 1) == 0) return n == 2;
for (i64 i = 3; i * i <= n; i += 2) {
if (n % i == 0) return false;
}
return true;
}
template<i64 M>
class modular {
private:
static_assert(is_prime(M) == true, "M is not a prime number");
i64 value;
modular inv() const { return pow(*this, M - 2); }
public:
modular() : value(0) {}
modular(i64 rr) : value(rr) { value %= M; if (value < 0) value += M; }
inline modular operator * (const modular& t) const { return (value * t.value) % M; }
inline modular operator / (const modular& t) const { return *this * t.inv(); }
inline modular operator + (const modular& t) const { return modular(*this) += t; }
inline modular operator - (const modular& t) const { return modular(*this) -= t; }
inline modular operator += (const modular& t) { value += t.value; if (value >= M) value -= M; return *this; }
inline modular operator -= (const modular& t) { value -= t.value; if (value < 0) value += M; return *this; }
inline modular operator *= (const modular& t) { return *this = *this * t; }
inline modular operator /= (const modular& t) { return *this = *this / t; }
inline bool operator == (const modular& t) const { return value == t.value; }
inline bool operator != (const modular& t) const { return value != t.value; }
inline operator i64() const { return value; }
};
}
typedef mod::modular<1000000007> mint;
// typedef mod::modular<998244353> MInt;
auto main() -> i32 {
ios::sync_with_stdio(false), cin.tie(nullptr);
i32 n;
cin >> n;
vec<mint> pls(n + 1), mis(n + 1);
vec<i32> a(n + 1);
pls[0] = 1;
mis[0] = 0;
for (i32 i = 1; i <= n; i++) {
cin >> a[i];
pls[i] = pls[i - 1] + mis[i - 1];
mis[i] = pls[i - 1];
}
mint ans = 0;
for (i32 i = 1; i <= n; i++) {
if (i > 1) {
ans += mint(a[i]) * (pls[n - i] + mis[n - i]) * (pls[i - 2] + mis[i - 2]);
if (i > 2 && i < n)
ans -= mint(a[i]) * (pls[n - i - 1] + mis[n - i - 1]) * (pls[i - 3] + mis[i - 3]);
if (n > 2) {
if (i == 2)
ans -= mint(a[i]) * (pls[n - i - 1] + mis[n - i - 1]) * (mint(1));
else if (i == n)
ans -= mint(a[i]) * (pls[n - 3] + mis[n - 3]);
}
else {
ans -= mint(a[i]);
}
}
else {
ans += mint(a[i]) * (pls[n - 1] + mis[n - 1]);
}
}
cout << i64(ans);
cout << "\n";
return 0;
} |
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
ll n_odd = 0;
bool odd;
cin >> n >> m;
string s;
for(int i = 0; i < n; i++) {
cin >> s;
odd = 0;
for(char c : s) {
if(c == '1') {
odd = !odd;
}
}
n_odd += odd;
}
cout << n_odd * (n - n_odd);
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
const ll MOD = 1e9 + 7;
const ll INF = 1e17;
//#######################################################################
vector<vector<ll>> input(ll N, ll width) {
string str;
vector<vector<ll>> vec(N, vector<ll>(width));
for (ll i = 0; i < N; ++i) {
cin >> str;
reverse(ALL(str));
for (ll j = 0; j < width; ++j) {
vec[i][j] = str.back();
str.pop_back();
}
}
return vec;
}
void op(vector<ll> vec) {
ll size = (ll)vec.size();
for (ll i = 0; i < size - 1; ++i) cout << vec[i] << " ";
cout << vec.back() << endl;
}
void op(vector<vector<ll>> vec) {
ll height = (ll)vec.size();
ll width = (ll)vec[0].size();
for (ll i = 0; i < height; ++i) {
for (ll j = 0; j < width - 1; ++j) cout << vec[i][j] << " ";
cout << vec[i].back() << endl;
}
}
//########################################################################
int solve(){
ll N,M;
cin>>N>>M;
vector<pair<ll,string>> dict;
rep(i,0,M){
string s;
cin>>s;
dict.emplace_back(s.size(),s);
}
grid<char> res(N,vector<char>(N,'.'));
sort(ALL(dict));
string use=dict.front().second;
for(ll i=0;i<N;++i) {
ll iter=0;
ll start=0;
while(true){
rep(j,0,dict[0].first) {
res[i][start+j]=dict[0].second[j];
}
start+=dict[0].first;
if(start+dict[0].first>=N-1) break;
}
}
rep(i,0,N) {
rep(j,0,N) cout<<res[i][j];
cout<<endl;
}
return 0;
}
int main(void){
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
solve();
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define disp(x) cout << #x << " : " << x << endl
#else
#define disp(x)
#endif
using namespace std;
using ll = int64_t;
ll mod_pow(ll x, ll n, const ll mod){
ll ans = 1;
while(n){
if(n & 1) ans = ans*x%mod;
x = x*x%mod;
n >>= 1;
}
return ans;
}
int main(){
ll n, m; cin >> n >> m;
const ll mod = m*m;
ll ans = mod_pow(10, n, mod);
ans /= m;
ans %= m;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
ll max = 1e8;
if(n==1 && m==0){
cout << 1 <<" " << 2 << endl;
}
else if(n==m || n-1==m || m<0){
cout << -1 << endl;
}
else {
int l = 2;
int ok_cnt=2;
rep(i,n-1){
cout << l <<" " << l+1 << endl;
if(n-m==ok_cnt){
cout << l-1 << " " << max << endl;
}
else if(i==n-2 && n-m>ok_cnt){
cout << max-10 <<" " << max << endl;
}
l+=3;
ok_cnt++;
}
}
return 0;
}
|
Subsets and Splits