code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#include<bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
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;
#define os_find(k) find_by_order(k)
#define os_order(k) order_of_key(k)*/
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
#define loop(i,a,b) for(int i=a;i<b;i++)
#define loop1(i,a,b) for(int i=a;i<=b;i++)
#define rloop(i,a,b) for(int i=a;i>b;i--)
#define rloop1(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
//#define mp make_pair
#define pii pair<ll,ll>
#define int long long int
#define double long double
#define min_heap priority_queue <int, vector<int>, greater<int> >
#define ff first
#define ss second
#define ncr(n,r) fact[n]*modInv(fact[r])*modInv(fact[n-r])
#define MOD 1000000007
//#define MOD 998244353
#define inf 1e18
//#define modInv(a) binExp(a,mod-2)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test int t;cin>>t;while(t--)
#define nl "\n"
#define ceill(a,b) ((a)/(b))+(((a)%(b))!=0)
//-------------------------IMPORTANT FUNCTIONS START---------------------
int powr(int x, int y)
{
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
ll power(ll a, ll b, ll mod){
ll x = 1LL, y = a;
while (b > 0LL){
if (b%2LL){
x = (x*y);
if(x>mod) x%=mod;
}
y = (y*y);
if(y>mod) y%=mod;
b /= 2LL;
}
return x;
}
ll mod_inv(ll n, ll mod){
return power(n, mod-2LL, mod);
}
bool isPrime(int n)
{
// Corner case
if (n <= 1)
return false;
// Check from 2 to n-1
for (int i = 2; i <=sqrt(n); i++)
if (n % i == 0)
return false;
return true;
}
int lcm(int a, int b)
{
return (a / __gcd(a, b)) * b;
}
//-------------------------IMPORTANT FUNCTIONS END---------------------
// initialize 2d vector vector<vector<int>> dp(n+1,vector<int>(x+1,0));
// 1/n+2/n+3/n.....n/n=O(logn)
// never use sqrt*sqrt cf compiler chodu hai
// negative value m floor or ceil ulte kam karte equation solve karte waqt dhyan rakh4
// order of 1e8 int 1 sec is ok
void solve(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int x = d*c -b;
if(x<=0)cout<<"-1";
else cout<<ceill(a,x);
}
signed main()
{
fast
//cout<<fixed<<setprecision(13);
//test
solve();
} | #include<cstdio>
#include<algorithm>
#define int long long
const int Q=100005;
const int INF=(1<<30);
using namespace std;
typedef long long ll;
#define rg register int
char buf[1<<21],*p1=buf,*p2=buf;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline bool ig(char c){return c>=48&&c<=57;}
inline void read(int &oi){char c;int f=1,res=0;while(c=gc(),(!ig(c))&&c^'-');c^'-'?res=(c^48):f=-1;while(c=gc(),ig(c))res=res*10+(c^48);oi=f*res;}
inline void print(int oi){if(oi<0)putchar('-'),oi=~oi+1;if(oi>9)print(oi/10);putchar(oi%10+48);}
inline void write(int oi,char c){print(oi);putchar(c);}
int a,b,c,d,res;
signed main(){
read(a);read(b);read(c);read(d);
c*=d;c-=b;if(c>0)res=(a-1)/c+1;else res=-1;write(res,'\n');
return 0;
} |
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#define FF first
#define SS second
#define MP make_pair
#define PB push_back
#define sqr(x) ((x) * (x))
#define all(x) x.begin(),x.end()
#define watch(x) cout<<(#x)<<" = "<<(x)<<'\n'
#define mset(a,v) memset(a,v,sizeof(a))
#define setp(x) cout<<fixed<<setprecision(x)
#define EPS 0.00000000001
#define PI acos(-1)
#define loop(i,b,n) for(int i=b;i<n;++i)
#define rev_loop(i,b,n) for(int i=b;i>=n;--i)
using namespace std;
const int MOD = 1e9 + 7;
const LL MX = 3e3 + 10;
const LL INF = 1e9 + 10;
int main()
{
//ofstream out("output.txt");
//ifstream in("input.txt");
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
string s;
cin>>s;
deque<char> dq;
int f = 0;
for(char ch : s)
{
if(ch == 'R') f ^= 1;
else if(f == 0)
{
if(dq.size() && dq.back() == ch) dq.pop_back();
else dq.push_back(ch);
}
else
{
if(dq.size() && dq.front() == ch) dq.pop_front();
else dq.push_front(ch);
}
}
if(f == 0)
{
while(!dq.empty())
{
char ch = dq.front();
dq.pop_front();
cout<<ch;
}
}
else
{
while(!dq.empty())
{
char ch = dq.back();
dq.pop_back();
cout<<ch;
}
}
cout<<'\n';
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) begin(X), end(X)
#define size(X) (int)std::size(X)
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
void fail()
{
cout << -1 << endl;
exit(0);
}
template<int n>
bitset<n> read_bitset()
{
string str; cin >> str;
reverse(all(str));
return bitset<n>(str);
}
int main()
{ _
constexpr int nmax = 5e5;
int n; cin >> n;
bitset<nmax> s = read_bitset<nmax>(), t = read_bitset<nmax>();
for (int i = 1; i < n; ++i)
{
s[i] = s[i] ^ s[i - 1];
t[i] = t[i] ^ t[i - 1];
}
ll ans = 0;
for (int i = 0, j = 0; i < n; ++i, j = max(j, i))
{
if (s[j] == t[i]) continue;
while (j < n && s[j] != t[i]) s[j++] = t[i];
if (j == n) fail();
ans += j - i;
}
cout << ans << endl;
exit(0);
}
|
#include <bits/stdc++.h>
using namespace std;
class factor{
int size;
vector<int> primes;
vector<int> lp;
public:
explicit factor(int n): size(n){
lp.assign(n+1,-1);
for(int i=2;i<=n;i++){
if(lp[i]==-1){
primes.push_back(i);
lp[i]=i;
}
for(int j=0;primes[j]<=lp[i]&&primes[j]*i<=n&&j<static_cast<int>(primes.size());j++){
lp[primes[j]*i]=primes[j];
}
}
}
vector<pair<int,int> > get(int n){
vector<pair<int,int> > ans;
while(n>1){
int p=lp[n];
int cnt=0;
while(n%p==0){
cnt++;
n/=p;
}
ans.emplace_back(p,cnt);
}
return ans;
}
long long numdivisors(int n){
long long ans=1LL;
while(n>1){
int p=lp[n];
int cnt=0;
while(n%p==0){
cnt++;
n/=p;
}
ans*=cnt+1;
}
return ans;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int k;
cin>>k;
factor Taha(2*100000+1);
long long ans=0LL;
for(int div=1;div<=k;div++){
ans+=Taha.numdivisors(div)*(k/div);
}
cout<<ans;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rint register int
#define int long long
inline int read(){
int x=0,f=1;
char c=getchar();
while(!isdigit(c)){
if(c=='-')
f=-1;
c=getchar();
}
while(isdigit(c)){
x=(x<<3)+(x<<1)+(c^48);
c=getchar();
}
return x*f;
}
const int maxn=1e5+7,moe=1e9+7;
int a[maxn],n,m,p[maxn],le=1,t[maxn];
signed main(){
a[1]=1,a[2]=1;
n=read();
for(m=3;m<=130;m++){
a[m]=a[m-1]+a[m-2];
if(a[m]>n)
break;
}
for(rint i=m-1;i>=1;i--){
if(a[i]<=n){
n-=a[i];
p[++p[0]]=i;
}
}
for(rint i=1;i<p[1];i++){
if(p[1]-i+1==p[le]){
le++;
if(p[1]%2==0){
if(i%2!=0)
t[++t[0]]=2;
else
t[++t[0]]=1;
}else{
if(i%2!=0)
t[++t[0]]=1;
else
t[++t[0]]=2;
}
}
if(p[1]%2==0){
if(i%2!=0)
t[++t[0]]=3;
else
t[++t[0]]=4;
}else{
if(i%2!=0)
t[++t[0]]=4;
else
t[++t[0]]=3;
}
}
for(rint i=0;i<=t[0];i++)
printf("%lld\n",t[i]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else return false;}
// struct Edge { ll to; ll cost; Edge(ll t, ll c) { to = t; cost = c;} };
// using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<ll>>;
// priority_queue<P, vector<P>, greater<P>> q;
int main() {
ll n;
cin >> n;
ll keta = 0;
ll t = n;
while (t) {
t /= 10;
keta++;
}
if (keta <= 3) {
cout << 0 << endl;
}
else if (keta <= 6) {
cout << n - 1000 + 1 << endl;
}
else if (keta <= 9) {
cout << (n - 1000000 + 1)*2 + (999999-1000+1) << endl;
}
else if (keta <= 12) {
cout << (n - 1000000000 + 1)*3 + (999999999-1000000+1)*2 + (999999-1000+1) << endl;
}
else if (keta <= 15) {
cout << (n-1000000000000+1)*4 + (999999999999-1000000000+1)*3 + (999999999-1000000+1)*2 + (999999-1000+1) << endl;
}
else {
cout << 5 + (999999999999999-1000000000000+1)*4 + (999999999999-1000000000+1)*3 + (999999999-1000000+1)*2 + (999999-1000+1) << endl;
}
return 0;
} |
// '-.-'
// () __.'.__
// .-:--:-. |_______|
// () \____/ \=====/
// /\ {====} )___(
// (\=, //\\ )__( /_____\
// __ |'-'-'| // .\ ( ) /____\ | |
// / \ |_____| (( \_ \ )__( | | | |
// \__/ |===| )) `\_) /____\ | | | |
// /____\ | | (/ \ | | | | | |
// | | | | | _.-'| | | | | | |
// |__| )___( )___( /____\ /____\ /_____\
// (====) (=====) (=====) (======) (======) (=======)
// }===={ }====={ }====={ }======{ }======{ }======={
// (______)(_______)(_______)(________)(________)(_________)
//
// Credits :- Joan G. Stark
//|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
//| AUTHOR - KASPAROVIAN |
//|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
#include<bits/stdc++.h>
#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 frr(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fr first
#define sc second
#define mk make_pair
#define endl '\n'
#define MOD 1000000007
#define in insert
#define sz(x) (ll)(x).size()
#define mem(a,b) memset(a,b,sizeof(a))
#define int long long
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << 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
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pi;
typedef pair<int,pi> ppi;
typedef vector<vi> graph;
template<class T> void mxi(T & a, const T & b) { a = max(a, b); }
template<class T> void mni(T & a, const T & b) { a = min(a, b); }
ld EPS=1e-9;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
void solve()
{
int n; cin>>n;
int ans=0,nn=n,k=1;
while(n>=1000)
{
n/=1000;
ans++;
}
ans*=nn;
while(nn>=1000)
{
nn/=1000;
k*=1000;
ans-=(k-1);
}
cout<<ans<<endl;
}
signed main()
{
fast;
int t,tab;
t=1;
tab=t;
while(t--)
{
//cout<<"Case #"<<(tab-t)<<": ";
solve();
}
cerr<<runtime();
}
//APPROACHING A QUESTION
//+ Think of binary search (max of min etc also if n<=2*10^5)
//+ Think of common dp states (Even if it appears as maths but constraints are small)
//+ Check constraints
//+ Keep calm and enjoy the question
//+ Be sure to remove MOD from binpow (if needed)
//+ Try bidirectional analysis for constructive questions
//+ If given some sequence try thinking of prefix sums
//+ If constraints are too large maybe its simple maths
//+ In questions with binary operations think of bits independently and also the change pattern
//+ If two or more binary operations are given mostly there is a relation between them and an arithmatic operator |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
const ll INF = 1e18;
const ll NEGINF = -1 * INF;
/*NOTES: Take care of ll vs int
Never use an iterator after erasing it
*/
const int N = 20;
ll dp[1 << N];
vector<array<int, 2>> arr[N];
int n, m;
ll build(int mask)
{
if (mask == 0)
{
return 1;
}
if (dp[mask] != -1)
{
return dp[mask];
}
int currBits = __builtin_popcountll(mask);
vector<int> a(n + 1, 0);
for (int i = 0; i < n; i++)
{
if (mask & (1 << i))
{
a[i + 1]++;
}
}
for (int i = 1; i <= n; i++)
{
a[i] += a[i - 1];
}
for (auto it : arr[currBits])
{
if (a[it[0]] > it[1])
{
return dp[mask] = 0;
}
}
ll ways = 0;
for (int i = 0; i < n; i++)
{
if (mask & (1 << i))
{
ways += build(mask ^ (1 << i));
}
}
return dp[mask] = ways;
}
// out of the first 'x' elements, at most 'z' elements should be <= 'y'
void solve()
{
cin >> n >> m;
int x, y, z;
for (int i = 0; i < m; i++)
{
cin >> x >> y >> z;
arr[x].push_back({y, z});
}
memset(dp, -1, sizeof(dp));
cout << build((1 << n) - 1) << endl;
}
int main()
{
fast;
#ifndef ONLINE_JUDGE
freopen("/home/kalit/Desktop/Data Structures-Algo-Competitive/src/codeforces/input.txt", "r", stdin);
freopen("/home/kalit/Desktop/Data Structures-Algo-Competitive/src/codeforces/output.txt", "w", stdout);
#endif
int T = 1;
while (T--)
{
solve();
}
//cout<< "Done in " << clock() / CLOCKS_PER_SEC <<"sec"<< endl;
return 0;
} | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("avx2")
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) -> iterator of kth element (in sorted fashion : low - high)
// order_of_key(x) -> #numbers strictly less than x
#define sync ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
#define unq(a) sort(all(a));a.resize(unique(all(a)) - a.begin())
#define fi first
#define se second
//#define endl '\n'
using pii = pair<int , int>;
using ll = long long;
using ld = long double;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//mt19937 rng(0);
// const int N = 3e6 + 5;
// vector<ll> f(N);
// void u(int x, int way){
// for (int i = x; i < N; i += (i & -i)){
// f[i] += way;
// }
// }
// ll gt(int x){
// ll r = 0;
// for (int i = x; i > 0; i -= (i & -i)){
// r += f[i];
// }
// return r;
// }
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
sync
int t = 1;
//cin >> t;
while(t--){
int n;
ll k, gn = 0;
cin >> n >> k;
int smblk = -1;
vector<ll> way2(2 * n + 1);
int l = 2, r = 2 * n, cnt = 0;
while(l <= r){
way2[l] = way2[r] = ++cnt;
l++; r--;
}
vector<ll> df(3 * n + 5);
for (int i = 1; i <= 2 * n; i++){
df[i + 1] += way2[i];
df[i + n + 1] -= way2[i];
}
for (int i = 1; i <= 3 * n; i++){
df[i] += df[i - 1];
}
for (ll sm = 3; sm <= 3 * n; sm++){
if (gn + df[sm] < k){
gn += df[sm];
}
else{
smblk = sm;
break;
}
}
assert(smblk != -1);
int bu = -1, ts = -1;
for (int b = 1; b <= n; b++){
if (smblk - b < 0 or smblk - b > 2 * n) continue;
if (gn + way2[smblk - b] < k){
gn += way2[smblk - b];
}
else{
bu = b;
break;
}
}
assert(bu != -1);
//cout << smblk << " " << bu << endl << flush;
for (int tz = 1; tz <= n; tz++){
if (smblk - bu - tz < 0 or smblk - bu - tz > n) continue;
gn++;
//cout << tz << " " << gn << " " << k << endl << flush;
if (gn == k){
ts = tz;
break;
}
}
assert(ts >= 1 && ts <= n);
cout << bu << " " << ts << " " << smblk - bu - ts << endl;
}
cerr << "processor time: " << clock() / (double) CLOCKS_PER_SEC << "s ";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
template<class T>bool chmax(T& a, const T& b) { if (a<b) { a=b; return 1;} return 0;}
template<class T>bool chmin(T& a, const T& b) { if (b<a) { a=b; return 1;} return 0;}
int main() {
ll N, Q; cin >> N >> Q;
vector<ll> A(N); rep(i, N) cin >> A[i];
vector<ll> sen(100000, 0);
for (int i = 0; i < N; ++i) {
sen[i/1000] ^= A[i];
}
for (int q = 0; q < Q; ++q) {
ll t, x, y;
cin >> t >> x >> y;
--x; --y;
if (t == 1) {
A[x] ^= (y+1);
sen[x/1000] ^= (y+1);
}
else if (t == 2 && y - x > 2100) {
ll res = 0;
ll num = x;
while (num%1000 != 0) {
res ^= A[num];
++num;
}
for (int i = (x+999)/1000; i < y/1000; ++i) {
res ^= sen[i];
}
ll tmp = (y/1000) * 1000;
while (tmp != y+1) {
res ^= A[tmp];
++tmp;
}
cout << res << endl;
}
else {
ll res = 0;
for (int i = x; i <= y; ++i) {
res ^= A[i];
}
cout << res << endl;
}
}
} |
// Problem: F - Range Xor Query
// Contest: AtCoder - AtCoder Beginner Contest 185
// URL: https://atcoder.jp/contests/abc185/tasks/abc185_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define pii pair<int,int>
#define vpp vector<pii>
#define mii map<int,int>
#define pb push_back
#define rep(i,a,bb) for(int i=a;i<bb;i++)
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test int T;cin>>T;while(T--)
#define __sort(v) sort(v.begin(),v.end())
#define __rsort(v) sort(v.rbegin(),v.rend())
#define setbits(x) __builtin_popcount(x)
#define zrobits(x) __builtin_ctzint(x)
#define endl '\n'
#define debug(x) cerr<<"[ "<<#x<<" : "<<x<<" ]"<<endl
#define debugp(x) cerr<<"[ "<<#x<<".ff : "<<x.first<<", "<<#x<<".ss : "<<x.second<<" ]"<<endl
#define debugs(x) cerr<<"[ "; for(auto i:x) cerr<<i<<" "; cerr<<" ]"<<endl;
#define debugm(x) cerr<<"----------"<<endl; for(auto i:x) cerr<<i.ff<<":"<<i.ss<<endl; cerr<<"----------";
#define PI 3.14159265359
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int dxk[]={0,0,1,-1,1,1,-1,-1};
int dyk[]={1,-1,0,0,1,-1,1,-1};
const int inf = 1e+18;
const int mod = 1e+9 + 7;
int cases = 1;
int power(int x, int p, int m){
int res = 1;
while(p){
if(p&1)
res=(res*x)%m;
x = (x*x)%m;
p/=2;
}
return res;
}
int inverse_mod(int x, int p, int m){
// Fermat's little theorem
// a^p = a % p
// a^(p-1) = a % p
// a^(p-2) = (1/a)%p => inverse modulo
return power(x, p-2, m);
}
const int mxN = 1200005;
int tree[mxN];
void update(int v){
tree[v] = tree[2*v] ^ tree[2*v+1];
}
int combine(int l, int r){
return l^r;
}
void build(int v, int tl, int tr, int* a){
if(tl>tr)
return;
if(tl==tr){
tree[v] = a[tl];
return;
}
int mid = (tl+tr)/2;
build(2*v, tl, mid, a);
build(2*v+1, mid+1, tr, a);
update(v);
}
void modify(int v, int tl, int tr, int pos, int val){
if(tl>tr)
return;
if(tl==tr){
tree[v] = tree[v] ^ val;
return;
}
int mid = (tl+tr)/2;
if(pos<=mid)
modify(2*v, tl, mid, pos, val);
else
modify(2*v+1, mid+1, tr, pos, val);
update(v);
}
int mrs(int v, int tl, int tr, int ql, int qr){
if(tl>qr||tr<ql)
{
return 0;
}
if(tl>=ql&&tr<=qr){
return tree[v];
}
int mid = (tl+tr)/2;
return mrs(2*v, tl, mid, ql, qr)^mrs(2*v+1, mid+1, tr, ql, qr);
}
void solve()
{
int n, q;
cin>>n>>q;
int a[n];
rep(i,0,n)
cin>>a[i];
build(1, 0, n-1, a);
rep(i,0,q)
{
int x, y, z;
cin>>x>>y>>z;
if(x==1)
{
modify(1, 0, n-1, y-1, z);
}
else
{
cout<<mrs(1,0,n-1,y-1,z-1)<<endl;
}
}
}
int32_t main()
{
fast;
//test{
// cout<<"Case #"<<cases<<": ";
solve();
//++cases;
//}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#define rmin(a,b) a = min<ll>(a,b)
#define rmax(a,b) a = max<ll>(a,b)
#define fi first
#define se second
int n;
const int N = 2e5+10;
vector<pair<int,ll>> g[N];
ll ib;
ll n0;
void dfs(int no, int from, int cor){
if(cor==0) n0++;
for(auto &[it,c] : g[no]){
if(it==from) continue;
int cc = cor;
if(c&(1ll<<ib)) cc = !cc;
dfs(it,no,cc);
}
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
fr(i,n-1){
int a, b; ll w; cin >> a >> b >> w; a--,b--;
g[a].emplace_back(b,w);
g[b].emplace_back(a,w);
}
ll mod = round(1e9)+7;
ll ans = 0;
fr(ii,63){
ib = ii;
n0 = 0;
dfs(0,-1,0);
ans = (ans+n0*(n-n0)%mod*((1ll<<ib)%mod)%mod)%mod;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll z = 0, mod = 1000000007, MAX = 60;
int main(){
ll N;
cin >> N;
vector<vector<pair<ll, ll>>> G(N + 1, vector<pair<ll, ll>>(0));
for (ll i = 0; i < N - 1; i++){
ll u, v, w;
cin >> u >> v >> w;
G[u].push_back({v, w});
G[v].push_back({u, w});
}
ll root;
for (ll i = 1; i <= N; i++){
if (G[i].size() == 1){
root = i;
break;
}
}
queue<ll> que;
que.push(root);
vector<vector<ll>> ev(MAX, vector<ll>(N + 1, -1));
for (ll i = 0; i < MAX; i++){
ev[i][root] = 0;
}
while (!que.empty()){
ll tar = que.front();
que.pop();
for (pair<ll, ll> next : G[tar]){
if (ev[0][next.first] != -1) continue;
ll nw = next.second;
for (ll i = 0; i < MAX; i++){
if (nw % 2 == 1){
ev[i][next.first] = ev[i][tar] ^ 1;
}
else{
ev[i][next.first] = ev[i][tar];
}
nw /= 2;
}
que.push(next.first);
}
}
ll ans = 0, base = 1;
for (ll i = 0; i < MAX; i++){
ll e = 0, o = 0;
for (ll j = 1; j <= N; j++){
if (ev[i][j] == 1){
e++;
}
else{
o++;
}
}
ans += (((e * o) % mod) * base) % mod;
ans %= mod;
base *= 2;
base %= mod;
//cout << i << ' ' << e << ' ' << o << endl;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
int main(){
int n, l;
std::cin >> n >> l;
std::vector<std::pair<int, int>> vec(n + 2);
vec[0] = std::make_pair(0, 0);
vec[n + 1] = std::make_pair(l - n, l - n);
for(int i = 1; i <= n; i++) std::cin >> vec[i].first, vec[i].first -= i;
for(int i = 1; i <= n; i++) std::cin >> vec[i].second, vec[i].second -= i;
long long res = 0;
for(int i = 1; i <= n;){
if(vec[i].first < vec[i].second){
int iter = std::lower_bound(vec.begin() + i, vec.end(), std::make_pair(vec[i].second, -1)) - vec.begin();
if(vec[i].second == vec[iter].first){
res += (long long)(iter - i);
while(i < iter && vec[i].second == vec[iter].first){
vec[i].first = vec[i].second;
i++;
}
}
else{
std::cout << "-1\n";
return 0;
}
}
else i++;
}
for(int i = n; i >= 1;){
if(vec[i].first > vec[i].second){
int iter = std::upper_bound(vec.begin() + 1, vec.begin() + i + 1, std::make_pair(vec[i].second, 0x7f7f7f7f)) - vec.begin();
iter--;
if(vec[i].second == vec[iter].first){
res += (long long)(i - iter);
while(i > iter && vec[i].second == vec[iter].first){
vec[i].first = vec[i].second;
i--;
}
}
else{
std::cout << "-1\n";
return 0;
}
}
else i--;
}
std::cout << res << "\n";
}
| #include<bits/stdc++.h>
using namespace std;
#define author "Sihare0riginals"
#define ss string
#define lli long long int
#define ld long double
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define I(a,i) memset(a,i,sizeof(a));
#define pb push_back
#define mp make_pair
#define L(i,start,end) for(lli i=start;i<=end;i++)
#define R(i,start,end) for(lli i=start;i>=end;i--)
#define ip(n) cin>>n;lli ip[n+1];L(i,1,n)cin>>ip[i];
const lli LINF = 1e18,mod=1e9+7;
void Bl0ck_M0mb0();
signed main()
{
Bl0ck_M0mb0();
lli t=1;
//cin>>t;
while(t--){
lli n,x;
cin>>n>>x;
x*=100;
lli ip[n+1],ans=0,res=-1;
L(i,1,n)
{
lli a,b;
cin>>a>>b;
ans+=a*b;
if(ans>x)
{
res=i;
break;
}
}
cout<<res<<endl;
}
return 0;
}
void Bl0ck_M0mb0(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("ip.txt","r",stdin);
freopen("op.txt","w",stdout);
#endif
}
/*
#define dbg1D(i,start,end,arr) for(lli i=start;i<=end;i++) cout<<i<<"th : "<<arr[i]<<endl;
#define dbg2D(i,j,s1,e1,s2,e2,arr) for(lli i=s1;i<=e1;i++){cout<<i<<"th :";for(lli j=s2;j<=e2;j++)cout<<arr[i][j]<<" ";cout<<endl;}
#define M map<lli,lli> \n #define sz(s) s.size()-1
#define P pair<lli,lli>
#define V vector<lli>
lli dx[4]={-1, 0, 0, +1};
lli dy[4]={0, -1, +1, 0};
lli power(lli a,lli b,lli m){ if(b==0) return 1; if(b==1) return a%m;
lli t=power(a,b/2,m); t=(t*t)%m; if(b&1) t=(t*a)%m; return t;}
lli modInverse(lli a, lli m) { return power(a, m-2, m); } */ |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ld eps = 1e-14;
int main() {
long double x, y, r;
cin >> x >> y >> r;
r += eps;
ll ans = 0;
for (ll i = (ll)(y-r-1); i <= (ll)(y+r+1); ++i) {
ld p = r * r - (y - i) * (y - i);
if (p < 0.0) continue;
ld dx = sqrt(p + eps);
ans += (floor(x + dx) - ceil(x - dx) + 1);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
struct Point
{
ldouble x, y;
ldouble dist(Point &other) { return sqrt((x - other.x)*(x - other.x) + (y - other.y)*(y - other.y)); }
ldouble dist2(Point &other) { return (x - other.x)*(x - other.x) + (y - other.y)*(y - other.y); }
};
const ldouble inf = 1e9;
const ldouble eps = 1e-12;
ldouble cx, cy, r;
Point center;
bool valid(lli x, lli y)
{
Point curr = {(ldouble)x, (ldouble)y};
return curr.dist2(center) <= r * r || abs(r * r - curr.dist2(center)) <= eps;
}
lli binarySearch(lli y)
{
lli base = ceill(cx);
lli lo = base, hi = inf;
while (lo < hi)
{
lli x = (lo + hi + 1) >> 1;
if (valid(x, y)) lo = x;
else hi = x - 1;
}
return valid(lo, y) ? lo - base + 1 : 0;
}
lli binarySearch2(lli y)
{
lli base = floorl(cx) - (ceill(cx) == floorl(cx));
lli lo = -inf, hi = base;
while (lo < hi)
{
lli x = (lo + hi) >> 1;
if (valid(x, y)) hi = x;
else lo = x + 1;
}
return valid(lo, y) ? base - lo + 1 : 0;
}
int main()
{
while (~scanf("%Lf %Lf %Lf", &cx, &cy, &r))
{
center = Point{cx, cy};
lli ans = 0;
for (lli y = cy - r; y <= cy + r; y++)
{
ans += binarySearch(y);
ans += binarySearch2(y);
}
printf("%lld\n", ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define rep1(i,n) for(int i=1; i<(int)n; i++)
#define repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
#define COUT(x) cout<<(x)<<endl
#define YES(x) cout<<(x?"YES":"NO")<<endl
#define Yes(x) cout<<(x?"Yes":"No")<<endl
#define F first
#define S second
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
const int dx[4] = {1, 0,-1, 0};
const int dy[4] = {0, 1, 0,-1};
int gcd(int a, int b){if(a%b == 0){return(b);}else{return(gcd(b, a%b));}}
int lcm(int a, int b){return a/gcd(a, b)*b;}
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;}
//cout << fixed << setprecision(15);
int N, M, K, H, W, X, Y;
string S,T;
const int INF = 1e18;
// const int mod = 1e9+7;
signed main(){
cin >> N >> K >> M;
int sum = 0;
rep(i,N-1){
int a; cin >> a;
sum += a;
}
int ans = N*M - sum;
if(ans>K)COUT(-1);
else if(ans<=0)COUT(0);
else COUT(ans);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100];
int main(){
ll n;
scanf("%lld",&n);
a[0]=1;a[1]=1;
int i=1;
while(a[i]+a[i-1]<=n)
i++,a[i]=a[i-1]+a[i-2]; //a[i]<=n i的最小值
//cout<<i<<endl;
ll res=i,k=n;
for(int j=i;j>=1;j--){
if(k>=a[j])
k-=a[j],res++; //是否可以插入a[i]
}
printf("%d\n",res);
for(int j=i;j>=1;j--){
if(n>=a[j]){
n-=a[j],printf("%d\n",(j&1)+1); //偶数步进行op1 结束进行op3 x+y->x 奇数步进行op2 结束进行op4 x+y->y
}
printf("%d\n",((j-1)&1)+3);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
const int N = 2e5 + 7;
int p[N], r[N], t[N];
vector <int> ans;
int apply(int x) {
if(r[x] == x) return 0;
if(t[r[x] - 1]) return -1;
int ax = p[r[x]], ay = p[r[x] - 1];
t[r[x] - 1] = true;
ans.push_back(r[x] - 1);
swap(p[r[x]], p[r[x] - 1]);
swap(r[ax], r[ay]);
return 1;
}
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
for(int i = 1; i <= n; i++) {
cin >> p[i];
r[p[i]] = i;
}
for(int i = 1; i <= n; i++) {
while(true) {
int x = apply(i);
if(x < 0) {
cout << -1 << endl;
return 0;
}
if(!x) break;
}
}
if(ans.size() != n - 1) {
cout << -1 << endl;
return 0;
}
for(int x: ans) cout << x << 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;
/*---------------------DEBUGGING--------------------------------------------*/
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
/*-------------------------------------------------------------------------------------*/
//#define mp make_pair
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pcc pair<char,char>
#define F first
#define S second
#define int long long
//#define pi 3.141592653589793238462643383279502
#define M 998244353
#define rep(i,a,n) for(int i=a;i<n;i++)
#define INF 1000000000000000
#define N 200005
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define endl "\n"
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
struct FenwickTree {
std::vector<int> f, cnt;
int n;
FenwickTree(int _n) {
n = _n; f.resize(n+10), cnt.resize(n+10);
}
void update(int i, int x) {
while(i <= n) {
cnt[i] += x, i += i&(-i);
}
}
int sum(int i) {
int ans = 0;
while(i > 0) {
ans += cnt[i], i -= i&(-i);
}
return ans;
}
int sum(int l, int r) {
return sum(r)-sum(l-1);
}
void update_xor(int i, int x) {
while(i <= n) {
f[i] ^= x, i += i&(-i);
}
}
int Xor(int i) {
int ans = 0;
while(i > 0) {
ans ^= f[i], i -= i&(-i);
}
return ans;
}
int Xor(int l, int r) {
return Xor(r)^Xor(l-1);
}
}ft(N);
void solve()
{
int n;
cin>>n;
vi a(n);
rep(i,0,n)cin>>a[i];
for(int i=0;i<n;i++)
{
if(a[i]==(i+1))
{
cout<<-1<<endl;
return;
}
}
int inv=0;
vector<pii>res;
for(int i=(n-1);i>=0;i--)
{ int ad=ft.sum(a[i]-1);
inv+=ad;
res.pb({i,ad});
ft.update(a[i],1);
}
if(inv!=(n-1))
{
cout<<-1<<endl;
return;
}
else
{
for(auto x:res)
{
for(int j=x.F;j<(x.F+x.S);j++)
cout<<(j+1)<<endl;
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
t=1;
for(int i=0;i<t;i++)
{
solve();
}
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 998244353;
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;}
struct modint {
long long x;
modint(long long x=0):x((x%MOD+MOD)%MOD){}
long long val(){
return x;
}
modint operator-() const { return modint(-x);}
modint& operator+=(const modint a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
modint& operator-=(const modint a) {
if ((x += MOD-a.x) >= MOD) x -= MOD;
return *this;
}
modint& operator*=(const modint a) {
(x *= a.x) %= MOD;
return *this;
}
modint operator+(const modint a) const {
modint res(*this);
return res+=a;
}
modint operator-(const modint a) const {
modint res(*this);
return res-=a;
}
modint operator*(const modint a) const {
modint res(*this);
return res*=a;
}
modint pow(long long t) const {
if (!t) return 1;
modint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// must be gcd(x,MOD)==1
modint inv() const {
// a^{-1} = 1/a MOD p (拡張Euclidの互除法)
long long b = MOD, u = 1, v = 0, z = x;
while(b){
long long t = z / b;
z -= t * b; swap(z, b);
u -= t * v; swap(u, v);
}
u %= MOD;
if (u < 0) u += MOD;
return modint(u);
}
//modint inv() const {
// return pow(MOD-2);
//}
modint& operator/=(const modint a) {
return (*this) *= a.inv();
}
modint operator/(const modint a) const {
modint res(*this);
return res/=a;
}
};
using mint = modint;
struct Factorial{
vector<mint> fact, ifact;
Factorial(int N): fact(N+1), ifact(N+1) {
assert(N < MOD);
fact[0] = 1;
for(int i=0; i<N; i++) fact[i+1] = fact[i] * (i+1);
ifact[N] = fact[N].inv();
for(int i=N; i>0; i--) ifact[i-1] = ifact[i] * i;
}
mint C(int n, int k){
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
mint P(int n, int k){
if (k < 0 || k > n) return 0;
return fact[n]*ifact[n-k];
}
mint inv(int n){
assert(n>0);
return fact[n-1]*ifact[n];
}
};
Factorial F(10000);
vector<int> bi(15);
void Main(){
int N,M; cin >> N >> M;
bi[0] = 1; REP(i,15) bi[i+1] = bi[i]*2;
mint dp[13][M+1];
for(int i=0; i<=M; i+=2){
dp[0][i] = F.C(N,i);
}
REP(i,12)REP(j,M+1){
for(int k=0; k<=M-j; k+=2){
if(j+k*bi[i+1] > M) break;
dp[i+1][j+k*bi[i+1]] += dp[i][j] * F.C(N,k);
}
}
int ans = dp[12][M].x;
cout << ans << en;
return;
}
int main(void){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
int t=1; //cin>>t;
while(t--) Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
#ifdef LOCAL
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cerr<<(*i)<<" ";cerr<<endl;}
#else
template<class T>void pv(T a,T b){}
#endif
ll nextLong() { ll x; scanf("%lld", &x); return x;}
int main2() {
ll N = nextLong();
map<ll, ll> count;
REP(i, N) {
count[nextLong()]++;
}
ll ans = N * (N-1)/2;
for (auto p : count) {
ll n = p.second;
ans -= n * (n-1) / 2;
}
cout << ans << endl;
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
}
|
/* In the name of Anton */
/*
* Motto :)
*
*
*
*
*
*/
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repa(i,a,n) for(int i=a;i<=n;i++)
#define repb(i,a,n) for(int i=a;i>=n;i--)
#define trav(x,a) for(auto &x: a)
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
#define fst first
#define snd second
#define pb push_back
#define mp make_pair
#define vt vector
typedef long double ld;
typedef pair <int,int> pii;
typedef vector <int> vi;
typedef long long ll;
template<class A> void read(vt<A>& v);
template<class T> void read(T& x){
cin>>x;
}
void read(double &d){
string t;
read(t);
d=stod(t);
}
void read(long double &d){
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H &h, T&...t){
read(h);
read(t...);
}
template <class A> void read(vt<A> &x){
trav(a,x)
read(a);
}
string to_string(char c){
return string(1,c);
}
string to_string(bool b){
return b?"true":"false";
}
string to_string(const char* s){
return string(s);
}
string to_string(string s){
return string(s);
}
string to_string(vt<bool> v){
string res;
rep(i,sz(v)){
res+=char('0'+v[i]);
}
return res;
}
template<class T> string to_string(T v){
bool f=1;
string res;
trav(x,v){
if(!f)
res+=' ';
f=0;
res+=to_string(x);
}
return res;
}
template<class A> void write(A x){
cout<<to_string(x);
}
template<class H, class...T> void write(const H& h, const T&...t){
write(h);
write(t...);
}
void print(){
write("\n");
}
template<class H, class...T> void print(const H& h, const T&...t){
write(h);
if(sizeof...(t))
write(' ');
print(t...);
}
/* -----------------------------------------------------------------------------------------------*/
void pre(){
}
ll bring(string pat, string txt){
string s=pat+'#'+txt;
ll m=(ll)pat.size();
ll n=(ll)s.size();
vector <ll> pi(n);
ll co=0;
pi[0]=0;
for(ll i=1;i<n;i++){
ll j=pi[i-1];
while(j>0 && s[i]!=s[j])
j=pi[j-1];
if(s[i]==s[j]) j++;
pi[i]=j;
if(pi[i]==m) co++;
}
return co;
}
vector <ll> lao(string pat, string txt){
string s=pat+'#'+txt;
ll n=(ll)s.size();
vector <ll> pi(n);
pi[0]=0;
for(ll i=1;i<n;i++){
ll j=pi[i-1];
while(j>0 && s[i]!=s[j])
j=pi[j-1];
if(s[i]==s[j]) j++;
pi[i]=j;
}
return pi;
}
void solve(){
ll n; read(n);
string pat; read(pat);
string mine="110";
string txt="";
ll j=0;;
for(ll i=0;i<n;i++){
txt+=mine[j];
j++;
if(j==3) j=0;
}
for(ll i=0;i<n;i++){
txt+=mine[j];
j++;
if(j==3) j=0;
}
for(ll i=0;i<n;i++){
txt+=mine[j];
j++;
if(j==3) j=0;
}
ll val=bring(pat,txt);
ll new_n=(ll)txt.size();
txt+=txt;
vector <ll> v1=lao(pat,txt);
ll con=0;
for(ll i=n+1+new_n;i<v1.size();i++){
if(v1[i]==n) con++;
}
con-=val;
ll num=30000000000;
ll tot=num/new_n;
ll lef=num%new_n;
// print(lef);
ll ans=(tot*val);
ans+=(con*(tot-1));
// print(val);
j=0;
ll lo=0;
if(lef!=0){
for(ll i=n+1+new_n;i<v1.size();i++){
if(v1[i]==n) ans++;
j++;
if(j==lef) break;
}
}
print(ans);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
pre();
int t=1;
// read(t);
rep(i,t) solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) { cerr << head; dump(); }
template <typename Head, typename... Tail> void dump(Head &&head, Tail &&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do { cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
/////////////////////////////////////////////////////////////////////
int N;
vector<int> X(210);
vector<int> Y(210);
vector<ll> R(210);
vector<int> a(210);
vector<int> b(210);
vector<int> c(210);
vector<int> d(210);
double calc(int x, int y, ll r, int a, int b, int c, int d)
{
if (x < a || c <= x) return 0;
if (y < b || d <= y) return 0;
ll s = abs(a - c) * abs(b - d);
return 1 - pow(1 - (double)min(r, s)/(double)max(r, s), 2);
}
ll calc_all(const vector<int>& a, const vector<int>& b, const vector<int>& c, const vector<int>& d)
{
double res = 0;
rep(i, N) {
double ret = calc(X[i], Y[i], R[i], a[i], b[i], c[i], d[i]);
res += ret;
}
return roundl(1000000000 * res / N);
}
void output()
{
rep(i, N) {
printf("%d %d %d %d\n", a[i], b[i], c[i], d[i]);
}
}
int main()
{
cin >> N;
rep(i, N) {
cin>>X[i]>>Y[i]>>R[i];
}
rep(i, N) {
a[i] = X[i];
b[i] = Y[i];
c[i] = X[i]+1;
d[i] = Y[i]+1;
}
ll res = calc_all(a, b, c, d);
output();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
REP(i, SZ(v)) {
if (i) os << ", ";
os << v[i];
}
return os << "]";
}
template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << " " << p.second << ")";
}
template<class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;
void solve() {
ll n, a, b; cin >> n >> a >> b;
if(a < b) swap(a, b);
ll tmp1 = 0;
if(n - a - b + 1 >= 1) {
tmp1 = (n - a - b + 1) * (n - a - b + 2) / 2 % MOD;
}
ll tmp2 = (n - b + 1) * (n - b + 2) / 2 % MOD;
//ll tmp22 = (n - b + 1 - (a - b + 1) + 1) * (a - b + 1 + n - b + 1) / 2 % MOD;
ll tmp22 = (n - a + 1) * (a - b + 1 + n - b + 1) / 2 % MOD;
ll tmp3 = tmp1 * tmp22 % MOD;
ll tmp4 = tmp1 * tmp1 % MOD;
ll tmp5 = (n - a + 1) * (a - b + 1) % MOD * tmp1 % MOD;
cout << ((8 * tmp3 % MOD - 4 * tmp4 % MOD + MOD) % MOD - 4 * tmp5 % MOD + MOD) % MOD << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int t; cin >> t;
while(t--) {
solve();
}
return 0;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
using namespace std;
clock_t timeStart, timeFinish;
void timeBegin() {
timeStart = clock();
}
void timeEnd() {
timeFinish = clock();
}
void timeDuration() {
double time_taken = double(timeFinish - timeStart) / double(CLOCKS_PER_SEC);
cout << "Time taken by program is : " << fixed << time_taken << setprecision(5);
cout << " sec " << endl;
}
class InputReader {
public:
InputReader() {
input_file = stdin;
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(int &n) {
while((buffer[cursor] < '0' || buffer[cursor] > '9') && buffer[cursor] != '-') {
advance();
}
int sign = 1;
if (buffer[cursor] == '-') {
sign = -1;
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
n *= sign;
return *this;
}
inline InputReader &operator >>(long long &n) {
while((buffer[cursor] < '0' || buffer[cursor] > '9') && buffer[cursor] != '-') {
advance();
}
int sign = 1;
if (buffer[cursor] == '-') {
sign = -1;
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
n *= sign;
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
};
const int MOD = 1000000007;
int main() {
timeBegin();
//ifstream cin("input.txt");
//ofstream cout("papagali.out");
int tests;
cin >> tests;
for (int test = 1; test <= tests; test++) {
int n, a, b;
cin >> n >> a >> b;
if (a + b > n) {
cout << "0\n";
} else {
int answer = 2LL * (n - a + 1) * (n - b + 1) % MOD * (n - a - b + 1) % MOD * (n - a - b + 2) % MOD
- 1LL * (n - a - b + 1) * (n - a - b + 2) % MOD * (n - a - b + 1) % MOD * (n - a - b + 2) % MOD;
if (answer < 0) {
answer += MOD;
}
cout << answer << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#include <numeric>
#include <cmath>
using namespace std;
int main(){
int X;
cin >> X;
if( X%100 == 0) cout << 100 << endl;
else cout << 100 - X%100 << endl;
} | //#define _GLIBCXX_DEB // Iterator safety; out-of-bounds access for Containers, etc.
//#pragma GCC optimize "trapv" // abort() on (signed) integer overflow.
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout << #x << "=" << x << "\n"
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << "\n"
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.1415926535897932384626
#define INF 1000000000
#define no_of_digits(n) floor(log10(n)) + 1
#define bits(n) __builtin_popcount(n)
#define lsb(n) __builtin_clz(n) // count leading zeroes before 1
#define rsb(n) __builtin_ctz(n) // count trailing zeroes before 1
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
ll g = gcd(a, b);
return a / g * b;
}
int sum_of_digits(int a)
{
int s = 0;
while (a > 0)
{
s += a % 10;
a /= 10;
}
return s;
}
string toBinary(int n)
{
string r;
while (n != 0)
{
r = (n % 2 == 0 ? "0" : "1") + r;
n /= 2;
}
return r;
}
int binaryToDecimal(string n)
{
string num = n;
int dec_value = 0;
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--)
{
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
ll add(ll a, ll b, ll m = mod)
{
if (a >= m)
a %= m;
if (b >= m)
b %= m;
if (a < 0)
a += m;
if (b < 0)
b += m;
ll res = a + b;
if (res >= m or res <= -m)
res %= m;
if (res < 0)
res += m;
return res;
}
ll mul(ll a, ll b, ll m = mod)
{
if (a >= m)
a %= m;
if (b >= m)
b %= m;
if (a < 0)
a += m;
if (b < 0)
b += m;
ll res = a * b;
if (res >= m or res <= -m)
res %= m;
if (res < 0)
res += m;
return res;
}
ll pow_mod(ll a, ll b, ll m = mod)
{
ll res = 1LL;
a = a % m;
while (b)
{
if (b & 1)
res = mul(res, a, m);
b >>= 1;
a = mul(a, a, m);
}
return res;
}
ll fastexp(ll a, ll b)
{
ll res = 1LL;
while (b)
{
if (b & 1)
res = res * a;
b >>= 1;
a *= a;
}
return res;
}
void solve()
{
int x;
cin>>x;
if(x%100==0)
cout<<100;
else
{
double res=(ceil((double)x/100.0))*100.0;
cout<<res-x;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input1.txt", "r", stdin);
// for writing output to output.txt
freopen("output1.txt", "w", stdout);
#endif
int t = 1;
//cin >> t;
while (t--)
{
solve();
}
return 0;
} |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define N 111
#define NN 131000
template <typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) { x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); }
if (flag) x = -x;
}
using namespace std;
int n, K, P;
int ans[N], lmt[N];
int f[2][NN], g[2][NN], sum[NN];
inline void Try(int mid) {
memset(f, 0, sizeof(f));
memset(g, 0, sizeof(g));
memset(sum, 0, sizeof(sum));
int up = min(lmt[mid - 1], lmt[n - mid]);
int nw = 0; f[nw][0] = 1;
for (int i = 1; i < mid; ++i) {
nw ^= 1;
int d = mid - i;
for (int j = 0; j <= up; ++j) {
if (j - d >= 0) sum[j] = (sum[j - d] + f[nw ^ 1][j]) % P;
else sum[j] = f[nw ^ 1][j];
}
for (int j = 0; j <= up; ++j) {
if (j - (K+1) * d < 0) f[nw][j] = sum[j];
else f[nw][j] = (sum[j] - sum[j - (K+1) * d] + P) % P;
}
}
if (nw) memcpy(f[0], f[1], sizeof(f[1]));
nw = 0; g[nw][0] = 1;
for (int i = mid + 1; i <= n; ++i) {
nw ^= 1;
int d = i - mid;
for (int j = 0; j <= up; ++j) {
if (j - d >= 0) sum[j] = (sum[j - d] + g[nw ^ 1][j]) % P;
else sum[j] = g[nw ^ 1][j];
}
for (int j = 0; j <= up; ++j) {
if (j - (K+1) * d < 0) g[nw][j] = sum[j];
else g[nw][j] = (sum[j] - sum[j - (K+1) * d] + P) % P;
}
}
if (nw) memcpy(g[0], g[1], sizeof(g[1]));
for (int j = 0; j <= up; ++j) if (f[0][j] && g[0][j]) {
ans[mid] = (ans[mid] + 1ll * f[0][j] * g[0][j] % P * (K + 1)) % P;
}
}
int main() {
read(n), read(K), read(P);
for (int i = 1; i <= n; ++i) lmt[i] = lmt[i - 1] + K * i;
for (int i = 1; i <= (n + 1) >> 1; ++i) Try(i);
for (int i = 1; i <= n; ++i) if (!ans[i]) ans[i] = ans[n - i + 1];
for (int i= 1; i <= n; ++i) {
printf("%d\n", ((ans[i] - 1 + P) % P + P) % P);
}
return 0;
}
/*
3 1 998244353
//1 3 1
10 8 861271909
100 100 7
*/ | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll dp[101][127501],n,k,m;
void pls(ll &a,ll b){
a+=b;if(a>=m)a-=m;
}
int main(){
dp[0][0]=1;
cin>>n>>k>>m;
for(int j=0;j<n;j++)
for(int l=0;l<=((j+1)*(j+2)/2)*k;l++)
for(int i=0;i<=k&&l+(j+1)*i<127501;i++)
pls(dp[j+1][l+(j+1)*i],dp[j][l]);
for(int i=1;i<=n;i++){
ll L=i-1,R=n-i,ans=0;
for(int l=0;l<=min(L,R)*(min(L,R)+1)/2*k;l++)pls(ans,dp[L][l]*dp[R][l]%m);
cout<<(ans*(k+1)-1)%m<<"\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define forn(i,a,b) for(i=a;i<=b;i++)
#define nfor(i,a,b) for(i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#define si set<int>
#define spii set<pii>
#define usi unordered_set<int>
#define uspii unordered_set<pii>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int,vi,greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define tzbits(x) __builtin_ctzll(x)
#define lzbits(x) __builtin_clzll(x)
#define pbits(x) __builtin_parityll(x)
#define gcd __gcd
#define lcm(x, y) ((x)*(y))/gcd(x,y)
#define endl '\n'
#define sz(s) (int)s.size()
#define sp(x,y) fixed<<setprecision(y)<<x
const int mod = 1000000007;
const int inf = 1000000000000000000;
const ld PI = 3.1415926535897932384626;
const ld eps = 1e-12;
void __print(int32_t x) {cout<<x;}
void __print(int x) {cout<<x;}
void __print(double x) {cout<<x;}
void __print(ld x) {cout<<x;}
void __print(float x) {cout<<x;}
void __print(bool x) {cout<<(x?"true":"false");}
void __print(char x) {cout <<'\''<<x<<'\'';}
void __print(const char *x) {cout <<'\"' <<x<<'\"';}
void __print(const string &x) {cout<<'\"'<<x<<'\"';}
template<typename T,typename V> void __print(const pair<T,V> &x) {cout<<'{';__print(x.first);cout<<',';__print(x.second);cout<<'}';}
template<typename T> void __print(const T &x) {int f=0;cout<<'{';for(auto &i:x)cout<<(f++?",":""),__print(i);cout<<"}";}void _print(){cout<<"]\n";}
template <typename T,typename... V> void _print(T t, V... v) {__print(t);if(sizeof...(v))cout<<", ";_print(v...);}
#define dbg(x...) cout<<"["<<#x<<"]=[";_print(x)
int powerm(int base,int exp) {int res=1;base%=mod;while(exp>0){if(exp&1)res=(res*base)%mod;base=(base*base)%mod;exp=exp>>1;}return res;}
int power(int base,int exp) {int res=1;while(exp>0){if(exp&1)res=res*base;base=base*base;exp=exp>>1;}return res;}
float powerNeg(float base,int exp) {float temp;if(exp==0)return 1;temp=powerNeg(base,exp/2);if(exp%2==0)return temp*temp;else{if(exp>0)return base*temp*temp;else return (temp*temp)/base;}}
int modinv(int exp) {return powerm(exp,mod-2);}
// ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
const int N=2e6+5;
void solve()
{
int i,j;
int n; cin>>n;
vi v;
forn(i,1,sqrt(n)){
if(n%i==0){
if(i*i!=n) v.PB(i), v.PB(n/i);
else v.PB(i);
}
}
sort(all(v));
for(int i: v) cout<<i<<endl;
//cout<<<<endl;
}
int32_t main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t,T=1;
// cin>>T;
forn(t,1,T)
{
// cout<<"Case #"<<i<<": ";
solve();
}
// cout<<endl<<"Times Elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"sec";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
set<long long> S;
for(long long i = 1; i*i<=N; i++){
if(N%i==0){
S.insert(i);
S.insert(N/i);
}
}
for(auto c:S){
cout << c << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pin;
const int N = 1e5 + 5;
const ll P = 1e9 + 7;
int n;
ll a[N], ans;
vector <ll> vec;
template <typename T>
inline void read(T &X) {
char ch = 0; T op = 1;
for (X = 0; ch > '9' || ch < '0'; ch = getchar())
if (ch == '-') op = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
X = (X * 10) + ch - '0';
X *= op;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("sample.in", "r", stdin);
clock_t st_clock = clock();
#endif
read(n);
for (int i = 1; i <= n; i++) {
read(a[i]);
vec.push_back(a[i]);
}
sort(vec.begin(), vec.end());
vector<ll>::iterator end = unique(vec.begin(), vec.end());
vec.erase(end, vec.end());
for (int i = 0; i < vec.size(); i++) a[i] = vec[i] - (i == 0 ? 0LL : vec[i - 1]);
ans = 1;
for (int i = 0; i < vec.size(); i++) {
ans = ans * (a[i] + 1) % P;
}
printf("%lld\n", ans);
#ifndef ONLINE_JUDGE
clock_t ed_clock = clock();
printf("time = %f ms\n", (double)(ed_clock - st_clock) / CLOCKS_PER_SEC * 1000);
#endif
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 1e5 + 10;
const int MAXM = 1e5 + 10;
struct edge {
int u,v;
int next;
}e[MAXM * 2];
int first[MAXN];
int idx;
int n;
void add(int a, int b) {
e[idx].u = a;
e[idx].v = b;
e[idx].next = first[a];
first[a] = idx++;
}
void init() {
fill(first, first + n + 1, -1);
idx = 0;
}
int sz[MAXN];
int dp[MAXN];
struct node {
int val1, val2;
};
bool cmp(node x, node y) {
return x.val1 - x.val2 < y.val1 - y.val2;
}
void dfs(int u) {
sz[u] = 1;
dp[u] = 1;
vector<node> v1, v2;
for (int i = first[u]; i != -1; i = e[i].next) {
int v = e[i].v;
dfs(v);
sz[u] += sz[v];
if (sz[v] % 2) {
v1.push_back({dp[v], sz[v] - dp[v]});
} else {
v2.push_back({dp[v], sz[v] - dp[v]});
}
}
sort(v1.begin(), v1.end(), cmp);
sort(v2.begin(), v2.end(), cmp);
int sz1 = v1.size();
int sz2 = v2.size();
int now = 0;
while (now < sz2 && v2[now].val2 - v2[now].val1 >= 0) {
dp[u] += v2[now].val1;
now++;
}
for (int i = 0; i < sz1; i++) {
if (i % 2 == 0) {
dp[u] += v1[i].val1;
} else {
dp[u] += v1[i].val2;
}
}
for (int i = now; i < sz2; i++) {
if (sz1 % 2 == 1) {
dp[u] += v2[i].val2;
} else {
dp[u] += v2[i].val1;
}
}
}
int main() {
scanf("%d", &n);
init();
for (int i = 2; i <= n; i++) {
int fa;
scanf("%d", &fa);
add(fa, i);
}
dfs(1);
printf("%d\n", dp[1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
// p.real() or real(p) -> x軸, p.imag() or imag(p) -> y軸
using Vector2d = complex<Real>;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;
template<typename T>
int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template<typename T>
int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
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;
}
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template<typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << pair_var.first << ' ' << pair_var.second;
return os;
}
template<typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << ' ';
return os;
}
template<typename T, typename U>
ostream &operator<<(ostream &os, vector<pair<T, U>> &vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << '\n';
return os;
}
template<typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df) os << vec;
return os;
}
template<typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
repi(itr, map_var) {
os << *itr << ' ';
itr++;
itr--;
}
return os;
}
template<typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
repi(itr, set_var) {
os << *itr << ' ';
itr++;
itr--;
}
return os;
}
void print() { cout << endl; }
template<class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
int L, R; cin>>L>>R;
vector<int> dp(R + 10); // dp iは、L以上R以下の数のペアでgcdがiになるものの数
int ans = 0;
for (int i = R; i >= 2; --i) {
int tmp = (R/i - (L-1)/i)*(R/i - (L-1)/i);
int now = i + i;
while(now <= R) {
tmp -= dp[now];
now += i;
}
dp[i] = tmp;
}
ans = SUM(dp);
for (int i = L; i <= R; ++i) {
if(i == 1) continue;
ans -= R/i*2;
}
for (int i = L; i <= R; ++i) {
if(i == 1) continue;
ans++;
}
print(ans);
}
|
// Problem: F - +1-1x2
// Contest: AtCoder - AtCoder Beginner Contest 188
// URL: https://atcoder.jp/contests/abc188/tasks/abc188_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sz(a) signed(a.size())
using namespace std;
map<ll,ll> dp,vis;
ll rec(ll x, ll y){
if(y == 1){
dp[y] = abs(y-x);
return dp[y];
}
if(vis[y])
return dp[y];
vis[y] = 1;
if(y%2){
dp[y] = min({abs(y-x),2+rec(x,(y+1)/2),2+rec(x,(y-1)/2)});
}
else{
dp[y] = min(abs(y-x),rec(x,y/2)+1);
}
return dp[y];
}
void solve(){
ll x,y;
cin >> x >> y;
ll ans = rec(x,y);
cout << ans ;
}
int main() {
FAST;
ll t=1;
//cin>>t;
while(t--) solve();
return 0;
} |
#include <algorithm>
#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cmath>
#include <climits>
#include <queue>
#include <bitset>
#include <set>
#include <assert.h>
#include <map>
using namespace std;
typedef vector<vector<long> > dim2veclo;
typedef vector<vector<int> > dim2vecin;
typedef vector<vector<double> > dim2vecdo;
typedef vector<vector<long long> > dim2vecll;
typedef vector<int> vecin;
typedef vector<long> veclo;
typedef vector<double> vecdo;
typedef vector<long long> vecll;
typedef vector<bool> vecbo;
typedef vector<vector<bool> > dim2vecbo;
typedef long long ll;
typedef vector < pair<ll, ll> > vecpa;
typedef vector<string> vecst;
typedef pair<ll, ll> pail;
typedef pair<int, int> pain;
typedef vector<vecpa > dim2vecpa;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = { -1, 0, 1, 0 };
int dy[4] = { 0, 1, 0, -1 };
vecpa black;
ll res = 1;
vecbo isOK;
ll n, m;
ll now = n;
vector<pair<ll, bool>> nw;
bool solve(pail hoge) {
ll Y = hoge.second;
if (isOK[Y]) {
if (Y == 0) {
if (!isOK[Y + 1]) {
nw.push_back(make_pair(Y, false));
res--;
}
}
else if (Y == 2 * n) {
if (!isOK[Y - 1]) {
nw.push_back(make_pair(Y, false));
res--;
}
}
else if (!isOK[Y - 1] && !isOK[Y + 1]) {
nw.push_back(make_pair(Y, false));
res--;
}
return true;
}
else {
if (Y != 2 * n && isOK[Y + 1]) {
nw.push_back(make_pair(Y, true));
res++;
}
else if (Y != 0 && isOK[Y - 1]) {
nw.push_back(make_pair(Y, true));
res++;
}
return true;
}
}
int main() {
cin >> n >> m;
black = vecpa(m);
isOK = vecbo(2 * n + 1, false);
rep(i, m) {
ll x, y; cin >> x >> y;
black[i] = make_pair(x, y);
}
sort(black.begin(), black.end(), [](pail a, pail b) {
if (a.first != b.first) return a.first < b.first;
return abs(n - a.second) < abs(n - b.second);
});
isOK[n] = true;
rep(i, m) {
solve(black[i]);
if (i < m - 1 && black[i].first == black[i + 1].first) continue;
rep(j, nw.size()) {
isOK[nw[j].first] = nw[j].second;
}
nw = vector<pair<ll, bool>>();
}
cout << res;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
long long int n,i,j,x,y,z,k,z1,c1=0,sum=0,c=0,d,m,x1,y1,x2,y2;
string o,p;
cin>>o>>p;
for(i=0;i<o.size();i++)
{
sum=sum+(o[i]-'0');
}
for(i=0;i<p.size();i++)
{
c=c+(p[i]-'0');
}
cout<<max(c,sum);
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll Max=3*1e10;
int main()
{
int n;cin>>n;int i;ll m=9999999999;
string s;cin>>s;
string s1="";
for(int i=1;i<=2*1e5;i++)
{
if(i%3==0)
s1+='0';
else
s1+='1';
}
//cout<<s1<<endl;
if(n==1)
{
if(s[0]=='1')
{
ll f=Max/3*2;
cout<<f<<endl;
}
else
{
ll f=Max/3;
cout<<f<<endl;
}
}
else if(n==2)
{
if(s=="11")
{
ll f=Max/3;
cout<<f<<endl;
}
else if(s=="00")
cout<<"0"<<endl;
else if(s=="10")
{
ll f=Max/3;
cout<<f<<endl;
}
else
cout<<m<<endl;
}
else if(n==3)
{
if(s=="000"||s=="111"||s=="001"||s=="100"||s=="010")
cout<<"0"<<endl;
else if(s=="011")
cout<<"9999999999"<<endl;
else if(s=="101")
cout<<m<<endl;
else
{
ll f=Max/3;
cout<<f<<endl;
}
}
else
{
int sum=0;
for(i=0;i<n;i++)
{
if(s[i]!=s1[i])
break;
}
if(i==n)
sum++;
for(i=0;i<n;i++)
{
if(s[i]!=s1[i+1])
break;
}
if(i==n)
sum++;
for(i=0;i<n;i++)
{
if(s[i]!=s1[i+2])
break;
}
if(i==n)
sum++;
//cout<<sum<<endl;
if(sum==0)
cout<<"0"<<endl;
else
{
if(s[0]=='1')
{
if(s[1]=='1')
{
if(n%3==1)
n+=2;
else if(n%3==2)
n+=1;
ll f=Max;
f-=n;
f/=3;
cout<<f+1<<endl;
}
else
{
n+=1;
if(n%3==1)
n+=2;
else if(n%3==2)
n+=1;
ll f=Max;
f-=n;
f/=3;
cout<<f+1<<endl;
}
}
else
{
n+=2;
if(n%3==1)
n+=2;
else if(n%3==2)
n+=1;
ll f=Max;
f-=n;
f/=3;
cout<<f+1<<endl;
}
}
}
//cout<<s1<<endl;
return 0;
}
//4658179125601
//9999999999
//9999999993
| #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll COPIES = 1e10;
int cnt;
int main () {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, i, flag = 0;
string t;
cin >> n >> t;
string a = "", b = "", tmp = "";
cnt = 0;
for (i=0; i<n && flag < 2; i++) {
tmp += t[i];
if (t[i] == '0') {
if (tmp == "110" && flag < 2) {
flag = 1;
cnt++;
tmp = "";
}
else if (tmp.size() > 2) flag = 2;
else {
if (flag == 0) {
a = tmp;
flag = 1;
tmp = "";
}
else if (flag == 1) {
b = tmp;
flag = 2;
}
}
}
}
if (i < n || tmp.size() > 2 || (tmp.size() && tmp[tmp.size()-1] == '0')) cout << "0\n";
else {
b = tmp;
if (a.size() == 0 && b.size() == 0) cout << COPIES - cnt + 1 << endl;
else if (a.size() == 0 && cnt == 0 && b == "1") cout << 2*COPIES << endl;
else if (a.size() == 0 || b.size() == 0) cout << COPIES - cnt << endl;
else cout << COPIES - cnt - 1 << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define pb push_back
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pi pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define vp vector<pair< int,int> >
#define mpi map<pair<int,int> ,int>
#define endl "\n"
#define fill(A,x) memset(A,x,sizeof A);
void solve()
{
int n;
cin>>n;
vi pos(n+5),ar(n+5);
vi ans;
for(int i=1;i<=n;i++)
{
cin>>ar[i];
pos[ar[i]]=i;
}
if(n==2)
{
if(pos[1]==1)cout<<0<<endl;
else {cout<<1<<endl;cout<<1;}
cout<<endl;
return;
}
for(int i=n;i>0;i--)
{
if(i>n||pos[i]==i)
continue;
int c=pos[i];
if(c%2!=(ans.size())%2)
{
while(pos[i]!=i)
{
int x=ar[pos[i]+1];
ar[pos[i]]=x;ar[pos[i]+1]=i;
ans.pb(pos[i]);
pos[i]++;pos[x]--;
}
}
else
{
if(c%2==0)
{
ans.pb(1);
ans.pb(2);
ans.pb(1);
pos[ar[1]]+=2;pos[ar[3]]-=2;
swap(ar[1],ar[3]);
i++;
}
else
{
ans.pb(2);
ans.pb(1);
ans.pb(2);
pos[ar[1]]+=2;pos[ar[3]]-=2;
swap(ar[1],ar[3]);
i++;
i++;
}
}
}
int x=ans.size();
cout<<x<<endl;
for(auto it:ans)cout<<it<<" ";
cout<<endl;
}
signed main()
{
boost
int test=0,t;
cin >> t ;
//t=1;
while(test++ <t){
// cout<<"Case #"<<test<<": ";
solve();}
} | #line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
std::cout << v[i];
if (i != size - 1)
std::cout << " ";
}
return out;
}
template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
for (auto &el : v) {
std::cin >> el;
}
return in;
}
#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<
using namespace std;
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
}
#line 2 "main.cpp"
double solve(ll N, const std::vector<long long> &A) {
ll sum = accumulate(ALL(A), 0LL);
auto E = [&](double x, double k, double sum) { return x * 2 * k + sum - x * N; };
double ans = 1e20;
REP(k, N + 1) {
if (k == 0) {
chmin(ans, E(0, 0, sum) / N);
sum -= A[k];
} else if (k == N) {
chmin(ans, E((double)A[N - 1] / 2, N, sum) / N);
} else {
chmin(ans, E((double)A[k - 1] / 2, k, sum) / N);
chmin(ans, E((double)A[k] / 2, k, sum) / N);
sum -= A[k];
}
}
return ans;
}
// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
int N;
std::cin >> N;
std::vector<long long> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
sort(ALL(A));
auto ans = solve(N, A);
std::coutd(10) << ans << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define TRAV(i, a) for(auto &i : (a))
#define SZ(x) ((int)(x).size())
#define X first
#define Y second
#define MP std::make_pair
#define PR std::pair
typedef long long ll;
typedef std::pair<int, int> PII;
typedef std::vector<int> VI;
VI a, b;
int main(){
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n;
std::string x, y;
std::cin >> x >> y;
a.resize(n);
b.resize(n);
FOR(i, n) a[i] = x[i]-'0', b[i] = y[i]-'0';
ll ans = 0;
int need = 0;
if(a[0] != b[0]) ans = need = 1;
REP(i, 1, n){
if(need > 0){
if(a[i] == 1){
a[i] = 0;
need--;
}
}
if(a[i] != b[i]) need++;
ans += need;
}
if(need == 0) std::cout << ans << "\n";
else std::cout << -1 << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
#define num_l(a,v) POSL(a,v) //v未満の要素数
#define num_eql(a,v) POSU(a,v) //v以下の要素数
#define num_h(a,v) (a.size() - POSU(a,v)) //vより大きい要素数
#define num_eqh(a,v) (a.size() - POSL(a,v)) //v以上の要素数
// static_cast< long long ll >
int N = 30*30;
int L = 30;
// (i,j) i個下 , j個右
int ind(int a,int b){
return a*L + b;
}
//vector< vector<string> > S(N,vector<string>(N));
vector<vector<long double>> H(L,vector<long double>(L,5000.0));
vector<vector<long double>> V(L,vector<long double>(L,5000.0));
// 上は下より(i,j)のiが小さい 右は左より(i,j)のjが大きい
// 順路正の向きで
const int From_U = 0;//上から来た
const int From_D = 1;//下から来た
const int From_L = 2;//左から来た
const int From_R = 3;//右から来た
// 復元
string make_char = "DURL";
const int dy[] = {-1,1,0,0};
const int dx[] = {0,0,-1,1};
int main(){
int sy,sx,ty,tx;
int s,t;
FOR(k,0,1000){
cin >> sy >> sx >> ty >> tx;
int dir_y = 1;
int dir_x = 1;
if(sy > ty) dir_y = -1;
if(sx > tx) dir_x = -1;
// (i,j) には (i - dir_y , j) or (i , j - dir_x) から行く
vector< vector<long double> > score(L,vector<long double>(L,INF));
vector< vector<int> > from(L,vector<int>(L,-1));
score[sy][sx] = 0;
for(int y=sy;(y-dir_y)!=ty;y+=dir_y){
for(int x=sx;(x-dir_x)!=tx;x+=dir_x){
//cout << y << " " << x << endl;
if(y==sy && x==sx) continue;
long double a = INF,b = INF;
if(y != sy) a = score[y-dir_y][x] + H[min(y-dir_y,y)][x];
if(x != sx) b = score[y][x-dir_x] + V[y][min(x,x-dir_x)];
if(a < b){
from[y][x] = (dir_y == 1 ? From_U : From_D );
score[y][x] = a;
}else{
from[y][x] = (dir_x == 1 ? From_L : From_R );
score[y][x] = b;
}
}
}
//return 0;
//cout << "95" << endl;
string T;
int y=ty,x=tx;
while(y!=sy || x!=sx){
int a = from[y][x];
T += make_char[a];
assert(0 <= a && a <= 3);
y += dy[a];
x += dx[a];
//cout << "from[" << y << "][" << x << "] = " << a << endl;
}
//cout << "106" << endl;
//cout << T << endl;
REV(T);
/*{ // チェック
assert(T.size() == (abs(sy-ty)+abs(sx-tx)));
int ud=0,lr=0;
for(auto c:T){
if(c == 'U' || c == 'D') ud++;
if(c == 'L' || c == 'R') lr++;
}
assert(abs(sy-ty) == ud);
assert(abs(sx-tx) == lr);
}*/
cout << T << endl;
cout << flush;
long double score_now,r;
cin >> score_now;
r = pow( score_now / score[ty][tx] , 1.0 - 1.0*(abs(sy-ty) + abs(sx-tx)) / 110.0 );
y=ty,x=tx;
while(y!=sy || x!=sx){
int a = from[y][x];
int by = y + dy[a],bx = x + dx[a];
if(by != y){
H[min(by,y)][x] *= r;
}else{
V[y][min(bx,x)] *= r;
}
y += dy[a];
x += dx[a];
}
}
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
const int N = 3002;
const int MOD = 998244353;
int n, k;
int dp[N][N];
void fillDP() {
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = i; j > 0; j--) {
dp[i][j] = (dp[i-1][j-1] + dp[i][min(N-1, 2*j)]) % MOD;
}
}
}
int main() {
scanf("%d %d", &n, &k);
fillDP();
printf("%d\n", dp[n][k]);
return 0;
} | #define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef _DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#else
#define debug(...)
#endif
#define rep(index,num) for(int index=0;index<(int)num;index++)
#define rep1(index,num) for(int index=1;index<=(int)num;index++)
#define brep(index,num) for(int index=(int)num-1;index>=0;index--)
#define brep1(index,num) for(int index=(int)num;index>0;index--)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
ll INFl=(ll)1e+18+1;
int INF=1e+9+1;
template<unsigned int mod_>
struct ModInt{
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr static uint mod = mod_;
uint v;
ModInt():v(0){}
ModInt(ll _v):v(normS(_v%mod+mod)){}
explicit operator bool() const {return v!=0;}
static uint normS(const uint &x){return (x<mod)?x:x-mod;} // [0 , 2*mod-1] -> [0 , mod-1]
static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
ModInt operator-() const { return make(normS(mod-v)); }
ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
ModInt operator/(const ModInt& b) const { return *this*b.inv();}
ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
ModInt& operator++(int){ return *this=*this+1;}
ModInt& operator--(int){ return *this=*this-1;}
ll extgcd(ll a,ll b,ll &x,ll &y) const{
ll p[]={a,1,0},q[]={b,0,1};
while(*q){
ll t=*p/ *q;
rep(i,3) swap(p[i]-=t*q[i],q[i]);
}
if(p[0]<0) rep(i,3) p[i]=-p[i];
x=p[1],y=p[2];
return p[0];
}
ModInt inv() const {
ll x,y;
extgcd(v,mod,x,y);
return make(normS(x+mod));
}
ModInt pow(ll p) const {
if(p<0) return inv().pow(-p);
ModInt a = 1;
ModInt x = *this;
while(p){
if(p&1) a *= x;
x *= x;
p >>= 1;
}
return a;
}
bool operator==(const ModInt& b) const { return v==b.v;}
bool operator!=(const ModInt& b) const { return v!=b.v;}
friend istream& operator>>(istream &o,ModInt& x){
ll tmp;
o>>tmp;
x=ModInt(tmp);
return o;
}
friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;
mint dp[3001][3001];
bool alre[3001][3001];
mint calc(int n,int k){
if(n<0||k<0) return 0;
if(n<k) return 0;
if(alre[n][k]) return dp[n][k];
alre[n][k]=1;
dp[n][k]=calc(n-1,k-1)+calc(n,2*k);
return dp[n][k];
}
int main(){
int N,K;
scan(N>>K);
dp[0][0]=1;
alre[0][0]=1;
prin(calc(N,K));
return 0;
}
|
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
void perr0(){}; template<typename H,typename... T> void perr0(H h,T... t){cerr<<h;perr0(t...);}
void perr(){perr0("\n");}; template<typename H,typename... T>void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);}
void ioinit() { cout << fixed << setprecision(2); cerr<<fixed<<setprecision(6); ios_base::sync_with_stdio(0); cin.tie(0); }
// clang-format on
using ld=long double;
struct edge {
int v;
ll cost;
};
struct edg2 {
int v;
ll c;
ll d;
};
class greater_cost {
public:
bool operator()(const edge& lh, const edge& rh) const {
return lh.cost > rh.cost;
}
};
using pq_mincost = priority_queue<edge, vector<edge>, greater_cost>;
const ll LG = 1e17;
vector<vector<edge>> edgcost;
vector<vector<edg2>> edgs;
vector<ll> c;
vector<ll> d;
ll dijkstra() {
ll n = edgs.size();
vector<bool> done(n, false);
pq_mincost pq;
pq.push({0, 0});
while (!pq.empty()) {
edge e = pq.top();
pq.pop();
ll cost = e.cost;
int u = e.v;
if (done[u]) continue;
done[u] = true;
if (u == n - 1) {
return cost;
}
for (auto v : edgs[u]) {
ld eps = 1e-2;
ld left = -eps + cost;
ld right = LG;
while (right-left >= 1.0) {
ld t1 = (left+right) / 2;
ld t2 = t1 + eps;
ld x1 = t1 + v.c + ld(v.d) / (t1 + 1);
ld x2 = t2 + v.c + ld(v.d) / (t2 + 1);
if (x1 < x2) {
right = t2;
} else {
left = t1;
}
}
ll nc = INF;
ll lf=roundl(left-1.1);
ll rg=roundl(right+1.1);
lf = max(cost,lf);
for (ll t = lf; t <= rg; t++) {
ll x = t + v.c + v.d / (t + 1);
nc = min(nc, x);
}
pq.push({v.v, nc});
}
}
return -1;
}
int main() {
// ダイクストラで三分探索(!?)
ioinit();
ll n, m;
cin >> n >> m;
edgcost.resize(n);
edgs.resize(n);
c.resize(m);
d.resize(m);
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b >> c[i] >> d[i];
a--;
b--;
edgs[a].push_back({int(b), c[i], d[i]});
edgs[b].push_back({int(a), c[i], d[i]});
}
ll ans = dijkstra();
print(ans);
}
| #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static int IN(void)
{
int x=0,f=1,c;while(c=getchar(),c<48||c>57){if(c==45)f=-f;}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
static void OUT(long x){if(x<0){putchar('-'),x=-x;}if(x>=10){OUT(x/10);}putchar(x-x/10*10+48);}
typedef struct List{int nx,v,c,d;}edge;
int hsz=0;long minHeap[200001][2],output[2];
static void PUSH(int id,long key)
{
int i=++hsz,j=i>>1;long sw[2];
minHeap[i][0]=id,minHeap[i][1]=key;
while(j)
{
if(minHeap[i][1]<minHeap[j][1])
{
sw[0]=minHeap[j][0],sw[1]=minHeap[j][1];
minHeap[j][0]=minHeap[i][0],minHeap[j][1]=minHeap[i][1];
minHeap[i][0]=sw[0],minHeap[i][1]=sw[1];
i=j;j>>=1;
}else break;
}
}
static void POP(void)
{
int i=1,j=i+1;long sw[2];
output[0]=minHeap[i][0],output[1]=minHeap[i][1];
minHeap[i][0]=minHeap[hsz][0],minHeap[i][1]=minHeap[hsz--][1];
while(j<=hsz)
{
if(j<hsz&&minHeap[j^1][1]<minHeap[j][1]){j^=1;}
if(minHeap[j][1]<minHeap[i][1])
{
sw[0]=minHeap[j][0],sw[1]=minHeap[j][1];
minHeap[j][0]=minHeap[i][0],minHeap[j][1]=minHeap[i][1];
minHeap[i][0]=sw[0],minHeap[i][1]=sw[1];
i=j;j=i<<1;
}else break;
}
return;
}
int main(void)
{
int N=IN(),M=IN(),vis[100000],esz=0,adj[100000];
long dist[100000];edge e[200000];
rep(i,N){dist[i]=9e18;}
rep(i,M)
{
int A=IN(),B=IN(),C=IN(),D=IN();
e[2*i].nx=adj[A-1];adj[A-1]=2*i+1;
e[2*i].v=B;e[2*i].c=C;e[2*i].d=D;
e[2*i+1].nx=adj[B-1];adj[B-1]=2*i+2;
e[2*i+1].v=A;e[2*i+1].c=C;e[2*i+1].d=D;
}
dist[0]=0l;
PUSH(1,0l);
while(hsz)
{
POP();
int u=output[0]-1;long v=output[1];
if(vis[u]){continue;}
for(int i=adj[u];i;i=e[i-1].nx)
{
int c=e[i-1].c,d=e[i-1].d,to=e[i-1].v;long len=0l;
if(d)
{
int x=sqrt(d)-1;
if(d/(x+1)>1+d/(x+2)){x++;}
if(d/(x+1)>1+d/(x+2)){x++;}
if(v>1l*x){len=1l*c+1l*d/(v+1l);}
else{len=1l*c+1l*x-v+1l*d/(1l*x+1l);}
}else{len=1l*c;}
if(dist[to-1]>v+len){dist[to-1]=v+len;PUSH(to,v+len);}
}
vis[u]=1;
}
if(dist[N-1]==9e18){puts("-1");}else OUT(dist[N-1]);
} |
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define rep(i, a, b) for(int i = a; i <= b; ++i)
#define per(i, a, b) for(int i = b; i >= a; --i)
using ll = long long;
using namespace std;
const int N = 5005;
const int P = 998244353;
int n, m;
ll ans, dp[N];
ll pw(ll a, ll b) {
ll c = 1;
for (; b; b /= 2, a = a * a % P)
if (b & 1) c = c * a % P;
return c;
}
int main() {
scanf("%d%d", &n, &m);
ans = n * pw(m, n) % P;
rep(len, 2, n)
rep(x, 1, m)
dp[len] = (dp[len] + pw(m - x, len - 2)) % P;
rep(i, 1, n)
rep(j, i + 1, n)
ans = (ans - dp[j - i + 1] * pw(m, n - (j - i + 1)) % P + P) % P;
printf("%lld\n", ans);
return 0;
}
| #include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const int N = 5e3 + 1;
ll n, m;
ll p[N][N];
ll d[N][N];
ll s[N];
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
fast;
ll T = 1, i, j;
//cin >> T;
while (T--) {
ll mod = 998244353;
cin >> n >> m;
if(m == 1){
cout << 1 << endl;
return 0;
}
p[0][0] = 1;
for(i = 1; i <= m; i++){
p[i][0] = 1;
for(j = 1; j <= n; j++){
p[i][j] = (p[i][j - 1] * i) % mod;
}
}
for(i = 2; i <= n; i++){
for(j = 1; j <= m; j++){
d[i][j] = p[m - 1][i - 2] - p[m - j][i - 2];
d[i][j] %= mod;
d[i][j] += mod;
d[i][j] %= mod;
}
}
for(i = 1; i <= m; i++){
for(j = 2; j <= n; j++){
s[j] += d[j][i];
s[j] %= mod;
}
}
vector<ll> dp(n + 1);
dp[1] = m;
for(i = 2; i <= n; i++){
//cout << i << "##\n";
dp[i] += m * dp[i - 1];
//cout << dp[i] << endl;
dp[i] %= mod;
dp[i] += m * (p[m - 1][i - 1]);
dp[i] %= mod;
// for(j = 1; j <= m; j++){
// dp[i] += (p[m - 1][i - 1]);
// ll l = 0;
// for(ll k = i - 1; k >= 1; k--){
// dp[i] += (p[m][k - 1]) * (p[m - 1][l] - p[m - j][l]);
// dp[i] %= mod;
// l++;
// }
// //cout << dp[i] << endl;
// }
for(j = i - 1; j >= 1; j--){
dp[i] += p[m][j - 1] * s[i - j + 1];
dp[i] %= mod;
}
}
cout << dp[n] << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
long long int sum = 0, a, b;
for (long long int i = 0; i < t; i++)
{
cin >> a >> b;
long long int ans;
ans = ((b - a + 1) * (a + b)) / 2;
sum = sum + ans;
}
cout << sum;
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;
set<P> s;
for(int i = 0; i < N; i++){
int x, y;
cin >> x >> y;
P p;
p.first = x, p.second = y;
s.insert(p);
}
for (set<P>::iterator i = s.begin(); i != s.end(); ++i) {
for (set<P>::iterator j = i; j != s.end();) {
j++;
if(j == s.end()) continue;
for (set<P>::iterator k = j; k != s.end();) {
k++;
if(k == s.end()) continue;
int a = (*j).first - (*i).first, b = (*j).second - (*i).second;
int c = (*k).first - (*i).first, d = (*k).second - (*i).second;
if(a * d == b * c){
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define ALL(x) x.begin(),x.end()
#define sz(a) ((int)a.size())
#define getmid ((l+r)>>1)
#define mst(var,val) memset(var,val,sizeof(var))
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define lowbit(x) x&(-x)
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ls rt<<1
#define rs rt<<1|1
using namespace std;
#ifdef local
#define dbg(args...) cout << #args << " -> ", err(args);
void err(){ cout << endl; }
template<typename T, typename... Args>
void err(T a, Args... args){ cout << a << ' '; err(args...); }
#else
#define dbg(args...)
#endif // local
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <int, ll> pil;
typedef pair <double, double> pdd;
const int inf=0x3f3f3f3f;
const long long INF=0x3f3f3f3f3f3f3f3fLL;
const double PI=acos(-1.0);
const long double eps=1e-8;
const int mod=20000311;
const int maxn=2e5+100;
const int N=2e5+100;
const int M=(1<<20)+10;
const ll mm=(1LL<<32);
template <class T>
inline void read(T &x)
{
x = 0;
char c = getchar();
bool f = 0;
for (; !isdigit(c); c = getchar())
f ^= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ 48);
x = f ? -x : x;
}
template <class T>
inline void write(T x)
{
if (x < 0)
{
putchar('-');
x = -x;
}
T y = 1;
int len = 1;
for (; y <= x / 10; y *= 10)
++len;
for (; len; --len, x %= y, y /= 10)
putchar(x / y + 48);
}
ll qpow(ll a,ll b,ll mod)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%mod;
b>>=1;
a=(a*a)%mod;
}
return ans;
}
int main()
{
#ifdef local
freopen("in.txt","r",stdin);
#endif // local
IOS;//cout.tie(0);
double x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
if(x1>x2) swap(x1,x2),swap(y1,y2);
double ans=(y1*x2+x1*y2)/(y1+y2);
printf("%.9f",ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using vi = vector<int>;
using vv = vector<vi>;
//editorial
int main(){
int n;
string t, x;
cin >> n >> t >> x;
vi s(n);
rep(i,n)s[i] = t[i] - '0';
vv dp(n+1, vi (7, 0));//dp[i][j]: iターン目にjがあれば高橋君が勝つ
dp[n][0] = 1;
for(int i=n-1; i>=0; i--){
if(x[i]=='T'){
rep(r, 7){
if( dp[i+1][ 10*r %7] ) dp[i][r] = 1;
if( dp[i+1][(10*r + s[i])%7] ) dp[i][r] = 1;
}
}
if(x[i]=='A'){
rep(r, 7){
if( dp[i+1][ 10*r %7]
&& dp[i+1][(10*r + s[i])%7] ) dp[i][r] = 1;
}
}
}
cout << (dp[0][0]?"Takahashi":"Aoki") << endl;
return 0;
} |
#include <bits/stdc++.h>
#include <cmath>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<long long,long long>;
//ll INF = 1e18;
//int INF = 1e9;
//printf("%.10f\n",ans);
int main() {
int n;
cin >> n;
int a = 0;
rep(i,n){
int x;
cin >> x;
a = max(a,x);
}
int b = 1000;
rep(i,n){
int y;
cin >> y;
b = min(y,b);
}
if(b < a) cout << 0 << endl;
else cout << b-a+1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main (){
int n;
cin >> n;
set<int> a;
set<int> b;
for(int i=0;i<n;i++){
int x;
cin >>x;
a.insert(x);
}
for(int i=0;i<n;i++){
int x;
cin >>x;
b.insert(x);
}
int ans=*begin(b)-*rbegin(a)+1;
if(ans<=0){
cout << 0 <<endl;
return 0;
}
cout << ans << endl;
}
|
#include <cstdio>
#define int long long
const int N = 3005, P = 1000000007;
int n, a[N], ans, f[N], tub[N], b[N], t[N];
signed main() {
scanf("%lld", &n);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]), a[i] += a[i-1];
for(int i = 1; i <= n; i++) f[i] = 1;
ans = (ans + f[n]) % P;
for(int i = 2; i <= n; i++) {
for(int j = 1; j <= n; j++) b[j] = a[j] % i;
for(int j = 0; j <= n; j++) tub[j] = 0;
for(int j = 1; j <= n; j++) t[j] = f[j];
for(int j = 1; j <= n; j++) {
f[j] = tub[b[j]] % P;
tub[b[j]] = (tub[b[j]] + t[j]) % P;
}
ans = (ans + f[n]) % P;
}
printf("%lld", ans);
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define INF 1000000000000
#define MOD 1000000007
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cout << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define debug_3(x1, x2, x3) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define debug_4(x1, x2, x3, x4) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define debug_5(x1, x2, x3, x4, x5) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#ifdef _DEBUG
#define debug(...) \
CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~)) \
(__VA_ARGS__)
#else
#define debug(...)
#endif
using namespace std;
using ll = long long;
ll gcd(ll x, ll y) {
if (x % y == 0) {
return y;
} else {
return gcd(y, x % y);
// x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼び出す。
}
}
int main() {
ll n, ans, max_cnt = 0;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
// rep(i, 1001) {
// int cnt = 0;
// for (int j = i + 1; j < n; j++) {
// if (gcd(a[i], a[j]) == a[i]) cnt++;
// }
// if (cnt > max_cnt) {
// max_cnt = cnt;
// ans = a[i];
// debug(max_cnt, ans);
// }
// }
for (int i = 2; i < 1001; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
// if (gcd(i, a[j]) == i) cnt++;
if (a[j] % i == 0) cnt++;
}
if (cnt > max_cnt) {
max_cnt = cnt;
ans = i;
debug(max_cnt, ans);
}
}
cout << ans << endl;
return 0;
} |
using namespace std;
#include <iostream>
int main() {
int n, a, b; cin >> n >> a >> b;
cout << n - a + b << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pll pair<ll,ll>
#define pii pair<int,int>
#define vll vector<ll>
#define vi vector<int>
#define sz(v) (ll)v.size()
#define all(v) v.begin(),v.end()
#define pq_max priority_queue<ll>
#define pq_min priority_queue <ll, vector<ll>, greater<ll> >
#define debug(x) cout<<#x<<"->"<<x<<endl
#define debug2(x,y) cout<<#x<<"->"<<x<<", "<<#y<<"->"<<y<<endl
#define debug3(x,y,z) cout<<#x<<"->"<<x<<", "<<#y<<"->"<<y<<","<<#z<<"->"<<z<<endl
#define endl '\n'
#define ff first
#define ss second
const ll INF = 4000000000000000000;
const ll mod = 1000000007;
const ll prime1 = 1999999973, prime2 = 1999999943;
void read(vll& arr,ll n){
for(int i=0;i<n;i++) cin>>arr[i];
}
ll solve(){
vll arr(3);
read(arr,3);
sort(all(arr));
cout<<arr[2]+arr[1];
return 0;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("minima.in","r",stdin);
// freopen("minima.out","w",stdout);
ll T=1;
// cin>>T;
for(int i=1;i<=T;i++){
//cout<<"Case #"<< i <<":";
solve();
//cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define forn(i,n) for(ll i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
void solve(){
int N; cin >> N;
int c = 0;
for(int i = 0; i < N; i++) {
int a; cin >> a;
if(a > 10)
c += (a - 10);
}
cout << c << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_cin();
int t = 1;
//cin >> t;
while(t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define double long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define endl '\n'
#define pii pair<int,int>
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define all(x) x.begin(),x.end()
#define fill(a,b) memset(a,b,sizeof(a))
#define sz(x) (int)x.size()
#define sp(x) setprecision(x)
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n; cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
int x=0,ans=0;
for(int i=0;i<n;i++){
x=max(x,a[i]);
ans=max(ans,b[i]*x);
cout<<ans<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std ;
const int N = 5e3+5 ,mod = 998244353;
long long fac[N]={1} ,inv[N]={1} ;
long long fast_power(long long b,long long p){
long long res=1;
while(p){
if(p%2) res=(res*b)%mod;
b=(b*b)%mod;
p/=2;
}
return res;
}
void prep(){
for(int i=1;i<N;++i){
fac[i]=(fac[i-1]*i)%mod;
inv[i]=fast_power(fac[i],mod-2);
}
}
long long choose(int n,int r){
return ((fac[n]*inv[r])%mod*inv[n-r])%mod;
}
int n ,m ;
int ways[N] ,mem[N][15] ;
int solve(int rem,int bt){
if(rem==0) return 1;
if(rem<0) return 0;
if(bt<0) return 0;
int&ret = mem[rem][bt] ;
if(~ret) return ret ;
ret = 0 ;
int val = 1<<bt ;
for(int cnt=0;cnt<=n;cnt+=2){
long long cur = 1ll * val * cnt ;
if(cur>rem) break ;
ret = (ret + 1ll*solve(rem-cur,bt-1)*ways[cnt]%mod)%mod;
}
return ret ;
}
int main(){
prep();
cin >> n >> m ;
for(int cnt=0;cnt<=n;++cnt) ways[cnt] = choose(n,cnt) ;
memset(mem,-1,sizeof mem);
cout << solve(m,13) ;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<ll,ll>;
const ll INF=1e18;
const ll mod=1e9+7;
const double pi=3.14159265358979323846;
ll modpow(ll a, ll b) { // aのb乗
ll ans=1;
for (ll i=0; i<63; i++) {
if (b & ((ll)1<<i)) {
ans*=a;
ans%=mod;
}
a*=a;
a%=mod;
}
return ans;
}
int main() {
ll h, w, K=0, ans=0;
cin >> h >> w;
vector<vector<char>> S(h, vector<char>(w));
vector<vector<ll>> V(h, vector<ll>(w,0));
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
cin >> S[i][j];
if (S[i][j]=='.') {K++;}
}
}
int tmp=0;
for (int i=0; i<h; i++) {
tmp=0;
int l=0, r=0;
for (int j=0; j<w; j++) {
if (S[i][j]=='.') {
r++;
tmp++;
}
else {
for (int k=l; k<r; k++) {
V[i][k]+=tmp;
}
l=r+1;
r=l;
tmp=0;
}
}
if (S[i][w-1]=='.') {
for (int k=l; k<r; k++) {
V[i][k]+=tmp;
}
}
}
for (int j=0; j<w; j++) {
tmp=0;
int l=0, r=0;
for (int i=0; i<h; i++) {
if (S[i][j]=='.') {
r++;
tmp++;
}
else {
for (int k=l; k<r; k++) {
V[k][j]+=tmp;
}
l=r+1;
r=l;
tmp=0;
}
}
if (S[h-1][j]=='.') {
for (int k=l; k<r; k++) {
V[k][j]+=tmp;
}
}
}
/*
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
cout << V[i][j] << " ";
}
cout << endl;
}
*/
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
if (V[i][j]==0) {continue;}
V[i][j]--;
ans+=modpow(2, K);
ans-=modpow(2, K-V[i][j]);
ans+=mod;
ans%=mod;
}
}
cout << ans << endl;
} |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef long long LL;
typedef long long ll;
inline LL quick_mul(LL a,LL b,LL m) //快速乘
{
ll ans = 0;
a %= m;
b %= m;
while (b) {
if (b & 1) {
ans = (ans + a) % m;
}
a = (a + a) % m;
b >>= 1;
}
return ans;
}
LL quick_pow(LL a,LL b,LL m) //快速幂
{
LL res=1;
a%=m;
while(b)
{
if(b&1) res=quick_mul(res,a,m);
a=quick_mul(a,a,m);
b>>=1;
}
return res;
}
bool Miller_rabin(LL n,int num)
{
//先将特殊情况判断一下
if(n==2||n==3) return true;
if(n%2==0||n==1) return false;
srand((unsigned)time(NULL)); //为接下来a的随机取值用
LL d=n-1;
int s=0;
while(!(d&1)) s++,d>>=1;//若d的二进制的最后一位不是1，则说明d还是偶数
for(int i=0;i<num;i++)
{
LL a=rand()%(n-2)+2;//2~n-1;
LL x=quick_pow(a,d,n), y=0;
for(int j=0;j<s;j++)//一共平方s次
{
y=quick_mul(x,x,n);//先平方
if(y==1&&x!=1&&x!=(n-1)) return false;//验证二次探测原理
x=y;
}
if(y!=1) return false;//不满足费马小定理，那就肯定不是质数
}
return true;
}
ll n;
bool isSqrt(ll t)
{
for (ll i = 1 ;t > 0 ;i += 2 ) t -= i;
return 0 == t;
}
void solve()
{
cin>>n;
if(n % 4 == 0)
{
cout<<"Even"<<'\n';
}
if(n % 2 == 0 && n % 4 != 0)
{
cout<<"Same"<<'\n';
}
if(n % 2 != 0)
{
cout<<"Odd"<<'\n';
}
}
int main(void)
{
int t = 1;
cin>>t;
while(t--)
solve();
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
for(int i=0;i<t;i++){
long long num ;
cin >> num;
if (num%4==0){
cout<<"Even"<<endl;
continue;
}
if(num % 2==1){
cout<<"Odd"<<endl;
continue;
}
else{
cout<<"Same"<<endl;
continue;
}
}
} |
#include<bits/stdc++.h>
#define N 101
int a,b,c,vis[N][N][N];
double f[N][N][N];
inline double F(int x,int y,int z){
if(x>99||y>99||z>99)return 0;
if(vis[x][y][z])return f[x][y][z];vis[x][y][z]=1;
return f[x][y][z]=(F(x+1,y,z)*x+F(x,y+1,z)*y+F(x,y,z+1)*z)/(x+y+z)+1;
}
signed main(void){
int a,b,c;scanf("%d%d%d",&a,&b,&c);printf("%.10lf\n",F(a,b,c));
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, x, y;
cin >> a >> b >> x >> y;
int y_ = min(2*x, y);
cout << abs(2*a-1-2*b) / 2 * y_ + (abs(2*a-1-2*b)%2 == 0 ? 0 : x) << endl;
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define per(i,n) for(ll (i)=(n)-1;(i)>=0;--(i))
#define gg 9223372036854775807
#ifdef LOCAL
#define debug(x) cerr<<__LINE__<<": "<<#x<<"="<<x<<endl;
#define debugALL(x) cerr<<__LINE__<<": "<<#x<<"=";for(auto i=(x).begin();i!=--(x).end();i++)cerr<<*i<<" ";cerr<<*--(x).end()<<endl;
#else
#define debug(x) true
#define debugALL(x) true
#endif
using namespace std;
template<typename T>
struct segment_tree{
function<T(T,T)> f = [](T a, T b){return a+b;};
T inf=0;
vector<T> value;
int N;
segment_tree(int n){
N=1;
while(N<n)N*=2;
value.assign(2*N-1,inf);
}
segment_tree(int n, function<T(T,T)> func, T t1){
N=1;
while(N<n)N*=2;
value.assign(2*N-1,t1);
f=func;
inf=t1;
}
void update(int i,T x){
i+=N-1;
value[i]=x;
while(i>0){
i=(i-1)/2;
value[i]=f(value[i*2+1],value[i*2+2]);
}
}
T query(T a,T b){
return query(a,b,0,0,N);
}
T query(T a,T b, int k, int l, int r){
if(r<=a || b<=l)return inf;
if(a<=l && r<=b){
return value[k];
}else{
ll c1=query(a,b,2*k+1,l,(l+r)/2);
ll c2=query(a,b,2*k+2,(l+r)/2,r);
return f(c1,c2);
}
}
void print(){
for(int i=0;i<ceil(log2(N))+1;i++){
for(int j=0;j<(1<<i);j++){
cout<<value[j+(1<<i)-1]<<((j==(1<<i)-1)?';':',');
}
cout<<endl;
}
}
};
V tmp;
int get(ll val){
return lower_bound(tmp.begin(),tmp.end(),val)-tmp.begin();
}
int main(){
ll n,m,q;
cin>>n>>m>>q;
V t(q),x(q),y(q);
rep(i,q){
cin>>t[i]>>x[i]>>y[i];
x[i]--;
}
tmp=y;
tmp.push_back(0);
sort(tmp.begin(),tmp.end());
segment_tree<ll> sa(3e5);
segment_tree<ll> sb(3e5);
sa.update(0,n);
sb.update(0,m);
segment_tree<ll> ssa(3e5);
segment_tree<ll> ssb(3e5);
ssa.update(0,0);
ssb.update(0,0);
V a(n,0),b(m,0);
ll ans=0;
rep(i,q){
if(t[i]==1){
ll nowvalid=get(a[x[i]]);
ll pval=a[x[i]];
ll prev=sb.query(0,nowvalid);
ll pprev=ssb.query(0,nowvalid);
sa.update(nowvalid,sa.query(nowvalid,nowvalid+1)-1);
ssa.update(nowvalid,ssa.query(nowvalid,nowvalid+1)-a[x[i]]);
a[x[i]]=y[i];
ll nextvalid=get(y[i]);
ll next=sb.query(0,nextvalid);
ll nnext=ssb.query(0,nextvalid);
sa.update(nextvalid,sa.query(nextvalid,nextvalid+1)+1);
ssa.update(nextvalid,ssa.query(nextvalid,nextvalid+1)+a[x[i]]);
ans+=a[x[i]]*next-prev*pval-(nnext-pprev);
}else{
ll nowvalid=get(b[x[i]]);
ll pval=b[x[i]];
ll prev=sa.query(0,nowvalid);
ll pprev=ssa.query(0,nowvalid);
sb.update(nowvalid,sb.query(nowvalid,nowvalid+1)-1);
ssb.update(nowvalid,ssb.query(nowvalid,nowvalid+1)-b[x[i]]);
b[x[i]]=y[i];
ll nextvalid=get(y[i]);
ll next=sa.query(0,nextvalid);
ll nnext=ssa.query(0,nextvalid);
sb.update(nextvalid,sb.query(nextvalid,nextvalid+1)+1);
ssb.update(nextvalid,ssb.query(nextvalid,nextvalid+1)+b[x[i]]);
//ans+=(next-prev)*y[i]+pprev-nnext;
ans+=b[x[i]]*next-prev*pval-(nnext-pprev);
}
cout<<ans<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 100 + 1;
const int K = 1'000'000;
int mod;
int add(int &a, int b) {
a += b;
if (a >= mod) {
a -= mod;
}
return a;
}
int sub(int &a, int b) {
a -= b;
if (a < 0) {
a += mod;
}
return a;
}
int mul(int a, int b) {
return (long long) a * b % mod;
}
int ways[N][K];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m >> mod;
ways[0][0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < K; ++j) {
int prv = j - i;
int prv_prv = j - i * (m + 1);
ways[i][j] = ways[i - 1][j];
if (prv >= 0) {
add(ways[i][j], ways[i][prv]);
}
if (prv_prv >= 0) {
sub(ways[i][j], ways[i - 1][prv_prv]);
}
}
}
for (int i = 0; i < n; ++i) {
int ans = 0;
for (int j = 0; j < K; ++j) {
add(ans, mul(ways[i][j], ways[n - i - 1][j]));
}
ans = mul(ans, m + 1);
sub(ans, 1);
cout << ans << "\n";
}
}
|
// {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define RALL(x) rbegin(x),rend(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
namespace { namespace unolight {
// Read Input
template<class T> void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( int64_t &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }
void R() {}
template<class T, class... U> void R( T& head, U&... tail ) { _R(head); R(tail...); }
// Write Output
template<class T> void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
void _W( const int64_t &x ) { printf("%" PRId64,x); }
void _W( const double &x ) { printf("%.16f\n",x); }
void _W( const char &x ) { putchar(x); }
void _W( const char *x ) { printf("%s",x); }
template<class T> void _W( const vector<T> &x ) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W( const T& head, const U&... tail ) { _W(head); putchar(sizeof...(tail)?' ':'\n'); W(tail...); }
#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif
template<class T> inline bool chmax( T &a, const T &b ) { return b>a ? a=b,true : false; }
template<class T> inline bool chmin( T &a, const T &b ) { return b<a ? a=b,true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template<class T, class F=less<T>> void sort_uniq( vector<T> &v, F f=F() ) {
sort(begin(v),end(v),f);
v.resize(unique(begin(v),end(v))-begin(v));
}
#pragma endregion
// }}}
// {{{ 1-indexed BIT
template<class T>
struct BIT {
int n;
vector<T> bit;
BIT(int n_):n(n_+1), bit(n_+1, 0) {}
void init() { fill(bit.begin(), bit.end(), 0); }
void add(int k, T v) {
for(;k<n; k+=k&-k) bit[k] += v;
}
T get(int k) {
T r=0;
for(;k>0;k-=k&-k) r+=bit[k];
return r;
}
// (l, r]
T get(int l, int r) {
return get(r) - get(l);
}
T operator[](int i) { return get(i-1,i); }
};
const int N=200010;
vector<array<int,4>> events;
LL intersection_points() {
BIT<LL> bit(N);
// for ( int i=0; i<n; i++ ) {
// int a,b,c,d;
// cin >> a >> b >> c >> d; // (x1,y1) (x2,y2)
// if ( a==c ) { // query
// events.push_back({a, 2, b, d});
// } else { // at x1 add, x2 remove
// events.push_back({a, 1, b, 1});
// events.push_back({c, 3, b, -1});
// }
// }
sort(events.begin(), events.end());
long long ans = 0;
for ( int i=0; i<events.size(); i++ ) {
if ( events[i][1]==1 ) {
int y = events[i][2];
bit.add(y, 1);
} else if ( events[i][1]==3 ) {
int y = events[i][2];
bit.add(y, -1);
} else {
int l = events[i][2], r = events[i][3];
ans += bit.get(l-1, r);
}
}
return ans;
}
void main() {
int h,w,m;
R(h,w,m);
vector<int> x(h+1,w+1),y(w+1,h+1);
REP(i,m) {
int a,b;
R(a,b);
chmin(x[a],b);
chmin(y[b],a);
}
LL ans=0;
REP1(i,1,y[1]-1) ans+=x[i]-1;
REP1(i,1,x[1]-1) ans+=y[i]-1;
REP1(i,1,y[1]-1) events.push_back({i,2,1,x[i]-1});
REP1(i,1,x[1]-1) {
events.push_back({1,1,i,-1});
events.push_back({y[i]-1,3,i,-1});
}
// dump(intersection_points());
W(ans-intersection_points());
}
// {{{ main
}}
int main() { unolight::main(); return 0; }
// }}}
| /**
* author: souravrax
* created: 19.06.2021 17:50:09
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define len(x) int((x).size())
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename TC, typename T = typename enable_if<!is_same<TC, string>::value, typename TC::value_type>::type>
ostream& operator<<(ostream &os, const TC &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
struct dbg {
#ifdef LOCAL
~dbg() { cerr << endl; }
template<typename T> dbg& operator<<(const T& args) { cerr << args; return *this; }
#else
template<typename T> dbg& operator<<(__attribute__((unused))const T& args) { return *this; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pi = pair<int, int>;
const int MAXN = (int)2e5 + 5;
bitset<MAXN> visited;
vector<int> graph[MAXN];
int dfs(int u) {
visited[u] = true;
int ans = 1;
for (int& v : graph[u]) {
if (!visited[v]) {
ans += dfs(v);
}
}
return ans;
}
int32_t main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int& i : a) cin >> i;
for (int i = 0, j = n - 1; i < j; i++, j--) {
if (a[i] != a[j]) {
graph[a[i]].push_back(a[j]);
graph[a[j]].push_back(a[i]);
}
}
ll ans = 0;
for (auto& i : a) {
if (!visited[i]) {
ans += dfs(i) - 1;
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
constexpr int INF = 1001001000;
int main() {
int n, k;
cin >> n >> k;
mat t(n, vec(n));
rep(i, n) rep(j, n) cin >> t[i][j];
int res = 0;
vec a(n);
rep(i, n) a[i] = i;
a.push_back(0);
do {
int sum = 0;
rep(i, n) {
sum += t[a[i+1]][a[i]];
}
if (sum == k) res++;
} while (next_permutation(a.begin() + 1, a.end() - 1));
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int ll;
typedef pair<ll,ll> pll;
#define MOD 1000000007
bool visited[10];
ll cities[10][10];
ll n,k,ret = 0;
void go(int c,ll total,int visCount)
{
if(visCount >= n-1)
{
if(total+cities[c][0] == k)
ret++;
return;
}
visited[c] = true;
for(int i = 0;i < n;i++)
{
if(!visited[i])
{
if(total+cities[c][i] < k)
go(i,total+cities[c][i],visCount+1);
}
}
visited[c] = false;
}
void solve(){
cin >> n >> k;
for(int i = 0;i < n;i++)
for(int j = 0;j < n;j++)
{
cin >> cities[i][j];
}
go(0,0,0);
cout << ret;
}
int main(){
#ifdef DEBUG
freopen("i.txt","r",stdin);
freopen("o.txt","w",stdout);
#endif
cin.tie(0);
ios::sync_with_stdio(0);
int q;
//cin >> q;
q = 1;
while(q--){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
#include <string>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#define loop(i,a,b) for (int i = (a); i <= (b); i++)
#define loopr(i, a, b) for(int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define mp(a,b) make_pair(a,b)
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long int
#define mod 1000000007
#define mod1 998244353
using namespace std;
int maxSubArraySum(int a[], int size)
{
int max_so_far = INT_MIN, max_ending_here = 0;
for (int i = 0; i < size; i++)
{
max_ending_here = max_ending_here + a[i];
if (max_so_far < max_ending_here)
max_so_far = max_ending_here;
if (max_ending_here < 0)
max_ending_here = 0;
}
return max_so_far;
}
int main()
{
ll n,x;
cin>>n>>x;
vector<int> a(n),ans;
loop(i,0,n-1)
{
cin>>a[i];
if(a[i]!=x)
{
ans.push_back(a[i]);
}
}
for(auto x : ans)
{
cout<<x<<" ";
}
}
| #include <bits/stdc++.h>
#include <random>
#include <time.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const int Nmax=2e5+1;
const int Nd=61;
const int INF=1e5;
int main(){
int h,w;
cin>>h>>w;
vector<string> s(h);
ll ans=0;
rep(i,h){
cin>>s[i];
//まずは横に並べる方法を考える
rep(j,w-1){
if(s[i][j]=='.' && s[i][j+1]=='.'){
ans++;
}
}
}
//縦にしく場合
rep(j,w){
rep(i,h-1){
if(s[i][j]=='.' && s[i+1][j]=='.'){
ans++;
}
}
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i >-1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a; i > b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
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;
}
ll mypow(ll x, ll n, const ll &p = -1)
{ //x^nをmodで割った余り
if (p != -1)
{
x =(x%p+p)%p;
}
ll ret = 1;
while (n > 0)
{
if (n & 1)
{
if (p != -1)
ret = (ret * x) % p;
else
ret *= x;
}
if (p != -1)
x = (x * x) % p;
else
x *= x;
n >>= 1;
}
return ret;
}
using namespace std;
//using namespace atcoder;
void solve()
{
ll n,k;
cin>>n>>k;
vector<ll>S(n*3+1);
S[0]=1;
S[n]=-3;
S[n*2]=3;
S[n*3]=-1;
rep(i,3){
rep(j,n*3){
S[j+1]+=S[j];
}
}
for(ll sum=3;sum<=n*3;++sum){
ll val=S[sum-3];
if(k-val<=0){
//和がsum
for(ll i=1;i<=n;++i){
ll sub=max<ll>(0,min(n,sum-i-1)-max(1LL,sum-i-n)+1);
if(k-sub<=0){
//1個目がi,残りの和はsum-i
for(ll j=max<ll>(1,sum-i-n);j<=n;++j){
--k;
if(!k){
cout<<i<<" "<<j<<" "<<sum-i-j<<"\n";
return;
}
}
}
k-=sub;
}
}
k-=val;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
#define M 1000000007
#define pii 3.14159265359
#define pb push_back
#define pob pop_back
#define forr(i,n) for(i=0;i<n;i++)
#define fors(i,j,n) for(i=j;i<n;i++)
#define pi pair<int,int>
#define ff first
#define ss second
#define tcase 0
#define all(v) v.begin(),v.end()
typedef long long int ll;
using namespace std;
#define sc(n) scanf("%lld",&n)
#define scn(n) scanf("%d",&n)
#define prt(n) printf("%lld ",n)
#define prtln(n) printf("%lld\n",n)
vector<pi> edges;
vector<vector<int>> v;
vector<int> prt;
vector<ll> val;
vector<ll> ans;
void assign_prt(int node,int p) {
prt[node] = p;
for(auto x : v[node]) {
if(x==prt[node]) continue;
assign_prt(x,node);
}
}
void find_ans(int node,int p,ll c) {
ans[node] += c + val[node];
for(auto x : v[node]) {
if(x==prt[node]) continue;
find_ans(x,node,c+val[node]);
}
}
void solve() {
int n,i;
scn(n);
v.clear(); edges.clear(); prt.clear(); val.clear(); ans.clear();
v.resize(n+1); prt.resize(n+1); val.resize(n+1,0ll);
forr(i,n-1) {
int a,b;
scn(a); scn(b);
edges.pb({a,b});
v[a].pb(b); v[b].pb(a);
}
assign_prt(1,-1);
int q;
scn(q);
forr(i,q) {
int a,b; ll value;
scn(a); scn(b); sc(value);
int v1,v2;
if(a==1) {
v1 = edges[b-1].ff;
v2 = edges[b-1].ss;
}
else {
v1 = edges[b-1].ss;
v2 = edges[b-1].ff;
}
if(v2==prt[v1]) {
val[v1] += value;
}
else {
val[1] += value;
val[v2] += -value;
}
}
ans.resize(n+1,0ll);
find_ans(1,-1,0);
fors(i,1,n+1) prtln(ans[i]);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t = 1;
if(tcase) scn(t);
while(t--) solve();
return 0;
}
|
/*
飲んだ魔剤で家が建つ。
created at: 2020-12-11 15:15:32
*/
#include <bits/stdc++.h>
using namespace std;
map<vector<int>, long double> memo;
long double cnt (int a, int b, int c)
{
long double x, y, z;
x = y = z = 0.0l;
if (a < 100 && b < 100 && c < 100) {
vector<int> p, q, r;
p = {a+1, b, c};
q = {a, b+1, c};
r = {a, b, c+1};
if (memo[p] <= 0.0l) memo[p] = cnt(a+1, b, c);
if (memo[q] <= 0.0l) memo[q] = cnt(a, b+1, c);
if (memo[r] <= 0.0l) memo[r] = cnt(a, b, c+1);
x = (1.0l + memo[p]) * a / (a + b + c);
y = (1.0l + memo[q]) * b / (a + b + c);
z = (1.0l + memo[r]) * c / (a + b + c);
}
return (x + y + z);
}
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << setprecision(15) << cnt(a, b, c) << endl;
return 0;
}
| #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define repr(i, n, s) for (int i = (int)n; (int)s < i; i--)
#define len(a) (int)a.size()
#define all(a) a.begin(), a.end()
/* 1次元ベクトルをスペースでつなぎ、改行をつけて出力 vi, vl, list<int>, list<ll>に対応 */
template<class T> void print_elements(T a) {string str = ""; for (auto itr = a.begin(); itr != a.end(); ++itr) \
str += to_string(*itr) + ' '; str.pop_back(); cout << str << endl;}
const int INF32 = 1 << 30;
const long long INF64 = 1LL << 60;
const double PI = acos(-1);
vector<vector<vector<double>>> dp(101, vector<vector<double>>(101, vector<double>(101, 0)));
int main() {
int a, b, c;
cin >> a >> b >> c;
vector<vector<vector<double>>> dp(101, vector<vector<double>>(101, vector<double>(101, 0)));
dp[a][b][c] = 1.0;
rep(i, a, 101) {
rep(j, b, 101) {
rep(k, c, 101) {
if (i < 100 && j < 100 && k < 100) {
dp[i+1][j][k] += dp[i][j][k] * i / (i + j + k);
}
if (j < 100 && k < 100 && i < 100) {
dp[i][j+1][k] += dp[i][j][k] * j / (i + j + k);
}
if (k < 100 && i < 100 && j < 100) {
dp[i][j][k+1] += dp[i][j][k] * k / (i + j + k);
}
}
}
}
double ans = 0;
rep(i, a, 100) {
rep(j, b, 100) {
int k = 100;
ans += -((a - i) + (b - j) + (c - k)) * dp[i][j][k];
}
}
rep(j, b, 100) {
rep(k, c, 100) {
int i = 100;
ans += -((a - i) + (b - j) + (c - k)) * dp[i][j][k];
}
}
rep(i, a, 100) {
rep(k, c, 100) {
int j = 100;
ans += -((a - i) + (b - j) + (c - k)) * dp[i][j][k];
}
}
cout << fixed << setprecision(9) << ans << endl;
}
|
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
int main(){
ll k;
scanf("%ld", &k);
ll ans = 0;
REP(i, 1, k+1){
for(ll j=1; j*i<=k; j++){
ans += k / (i*j);
}
}
printf("%ld\n", ans);
return 0;
}
| #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<tuple<int,int,int>> v;
for(int i=0;i<n;i++)
{
int p,q,r;
cin>>p>>q>>r;
v.push_back({q,r,p});
}
int c=0;
sort(v.begin(),v.end());
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(get<1>(v[i])>get<0>(v[j]))
{
c++;
// cout<<get<1>(v[i])<<" "<<get<0>(v[j])<<'\n';
continue;
}
if(get<1>(v[i])==get<0>(v[j])&&(get<2>(v[i])==1||get<2>(v[i])==3)&&(get<2>(v[j])==2||get<2>(v[j])==1))
{
//cout<<get<1>(v[i])<<" "<<get<0>(v[j])<<'\n';
c++;
}
}
}
cout<<c<<'\n';
} |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <tuple>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <random>
#include <chrono>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
int N;
scanf("%d", &N);
vector<int> A(N, 0);
for (int i = 0; i < N; i++)
scanf("%d", &A[i]);
vector<LL> psum(N, 0);
for (int i = 0; i < N; i++) {
if (i) psum[i] = psum[i - 1];
int offs = 1;
if (i % 2) offs = -1;
psum[i] += offs * A[i];
}
map<LL, int> cnt;
cnt[0] = 1;
LL ans = 0;
for (int i = 0; i < N; i++) {
LL cur = psum[i];
ans += cnt[cur];
cnt[cur]++;
}
printf("%lld\n", ans);
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
by Benq;
*/
| #include <bits/stdc++.h>
using namespace std;
void solve() {
int m;
cin >> m;
vector<pair<int, int>> edges(m);
int n = 0;
for (auto& edge: edges) {
int u, v;
cin >> u >> v;
--u;
--v;
edge = {u, v};
n = max(n, u + 1);
n = max(n, v + 1);
}
vector<vector<int>> adj_list(n);
for (auto& edge : edges) {
int u, v;
tie(u, v) = edge;
adj_list[u].push_back(v);
adj_list[v].push_back(u);
}
vector<bool> visited(n, false);
function<pair<int, int> (int)> dfs = [&](int u) {
if (visited[u]) {
return make_pair(0, 0);
}
visited[u] = true;
int nodes_seen = 1, edges_seen = 0;
for (int v : adj_list[u]) {
int n0, e0;
tie(n0, e0) = dfs(v);
nodes_seen += n0;
edges_seen += e0 + 1;
}
return make_pair(nodes_seen, edges_seen);
};
int answer = 0;
for (int u = 0; u < n; ++u) {
int nodes_seen, edges_seen;
tie(nodes_seen, edges_seen) = dfs(u);
assert (edges_seen % 2 == 0);
edges_seen /= 2;
answer += min(nodes_seen, edges_seen);
}
cout << answer << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<int>> mod(1 << 8);
for (int i = 1; i < (1 << min(8, n)); i++) {
int sum = 0;
bitset<8> bit(i);
for (int j = 0; j < 8; j++) {
if (bit[j]) {
sum = (sum + a[j]) % 200;
}
}
mod[sum].push_back(i);
}
auto print_ans = [](int x) {
bitset<8> bit(x);
cout << bit.count() << ' ';
for (int i = 0; i < 8; i++) {
if (bit[i]) {
cout << i + 1 << ' ';
}
}
cout << "\n";
};
for (auto vec : mod) {
if (vec.size() >= 2) {
cout << "Yes" << "\n";
print_ans(vec[0]), print_ans(vec[1]);
return 0;
}
}
cout << "No" << "\n";
return 0;
} | // abc190_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()
#define INF (ll)(1e9)
#define MOD (1000000007)
#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int idx=0;idx<(n-1);idx++) cout << (vec)[idx] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << "\n";}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;
typedef pair<ll, int> P;
struct Graph {
struct Edge {
int u, v;
ll w;
Edge() {}
Edge(int u, int v, ll w) : u(u), v(v), w(w) {}
friend ostream& operator<<(ostream& os, const Edge& e) {cout << "(" << e.u << "->" << e.v << "," << e.w << ")"; return os;}
};
int n;
vector<vector<Edge>> edges;
Graph(int n): n(n), edges(n) {}
void add_edge(int u, int v, ll c){
edges[u].emplace_back(u, v, c);
edges[v].emplace_back(v, u, c);
}
ll dijkstra(int s, int t){
priority_queue<P, vector<P>, greater<P> > pq;
pq.push(P(0, s));
vector<ll> dist(n, INF);
dist[s] = 0;
while (!pq.empty()){
P p = pq.top(); pq.pop();
ll cost = p.first;
int u = p.second;
if (u == t) {
return cost;
}
for (auto edge: edges[u]){
ll ncost = cost + edge.w;
if (ncost < dist[edge.v]){
dist[edge.v] = ncost;
pq.emplace(ncost, edge.v);
}
}
}
return INF;
}
};
int main() {
#ifdef LOCAL
ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif
int N, M;
cin >> N >> M;
Graph g(N);
REP(i, M){
int a, b; cin >> a >> b;
a--; b--;
g.add_edge(a, b, 1);
}
int K;
cin >> K;
vector<int> C(K);
REP(i, K) {cin >> C[i]; C[i]--; }
vector<vector<ll>> dist(K, vector<ll>(K, 0));
REP(i, K) REPN(j, i+1, K){
dist[i][j] = g.dijkstra(C[i], C[j]);
dist[j][i] = dist[i][j];
}
// REP(i, K) print(dist[i]);
vector<vector<ll>> dp(1 << K, vector<ll>(K, INF));
REP(i, K) dp[1 << i][i] = 1;
REP(p, 1 << K) {
REP(i, K) REP(j, K) {
if (i == j) continue;
if ((p >> j) & 1) continue;
int q = p | (1 << j);
dp[q][j] = min(dp[q][j], dp[p][i] + dist[i][j]);
}
}
ll ans = INF;
REP(i, K){
ans = min(ans, dp[(1<<K)-1][i]);
}
print(ans == INF ? -1 : ans);
return 0;
}
|
//https://oeis.org/search?q=0%2C0%2C1%2C2%2C4%2C6&language=english&go=Search
//https://smallpdf.com/result#r=dc43c99933feaa1c7f3a2f2e2036bc6a&t=pdf-to-word
#include<iostream>
#include <bits/stdc++.h>
#include<stdio.h>
#include <string.h>
using namespace std;
#define ll long long
#define INF 1000007
#define MAX 500007
#define nl "\n"
#define F first
#define S second
typedef vector<ll> vi;
typedef priority_queue<ll , vector<ll> , greater<ll> > pqmx;
typedef priority_queue<ll> pqmn;
typedef pair<ll , ll> pi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector< pair<int , int> > vpi;
#define fr(i,n) for(i=0;i<n;i++)
#define rep(i,a,n) for(i=a;i<n;i++)
#define yeS(GOOD) GOOD ? cout<<"YES\n" : cout<<"NO\n"
#define all(a) a.begin() , a.end()
#define pb push_back
#define ar array
ll mod = LLONG_MAX;
ll binpow(ll a, ll b){ll res=1;a%=mod;while(b>0){if(b&1)res=(res*a)%mod;a=(a*a)%mod;b>>=1;}return res;}
ll binmul(ll a, ll b){ll res=0;a%=mod;while(b>0){if(b&1)res=(res + a)%mod;a=(a + a)%mod;b>>=1;}return res;}
ll area(pi a, pi b,pi c){return abs(a.F * b.S + b.F * c.S + c.F*a.S - a.S * b.F - b.S * c.F - c.S * a.F);}
ll gcd (ll a,ll b){if(b==0)return a;else return gcd (b, a % b);}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
ll min(ll a,ll b){if(a < b){return a;}return b;}
ll max(ll a,ll b){if(a > b){return a;}return b;}
double intlog(ll n ,ll base){return (double)log(n)/log(base);}
ll n , t , m , temp , temp2, root , p ,q , k , i , j , r , u , v , w;
struct comp {
bool operator()( pair<int, int> const& a, pair<int, int> const& b) {
return a.first < b.first || (a.first == b.first && a.second > b.second);
}
};
void transpose(vector<vi> & a){
vector<vi> temp(n , vi(n));int i,j;
fr(i , n){fr(j , n){temp[i][j] = a[j][i];}}
a = temp;
}
ll solve(vi & a , ll i , ll val , ll p){
if(i == a.size()){return val ^ p;}
return min(solve(a , i + 1 , val , p | a[i]) , solve(a , i + 1 , val^p , a[i] ) );
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt" , "r" , stdin);
freopen("output.txt" , "w" , stdout);
#endif
cin>>n;
vi a(n);
fr(i , n)cin>>a[i];
cout<<solve(a , 0 , 0 , 0)<<nl;;
#ifndef ONLINE_JUDGE
cout << "Running Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s .\n";
#endif
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
int n;
cin >> n;
int arr[n];
int ans = 2000000000;
for(int i = 0; i < n; i++)
{
cin >> arr[i];
}
for(int mask = 0; mask < (1 << (n-1)); mask++)
{
int ore = 0;
int xore = 0;
for(int j = 0; j <= n; j++)
{
if(j < n) ore |= arr[j];
if(j == n || (mask >> j&1))
{
xore ^= ore;
ore = 0;
}
}
ans = min(ans,xore);
}
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#define vll vector<long long>
#define infi INT_MAX
#define infl LONG_LONG_MAX
#define infd LDBL_MAX
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fi(i,a,b) for(ll i=(b-1);i>=a;i--)
#define F first
#define S second
#define G(a,b) get<a>(b)
#define MP make_pair
#define MT make_tuple
#define pll pair<ll,ll>
#define endl "\n"
#define ALL(v) v.begin(),v.end()
#define nl cout<<"\n";
#define pr(x) cout<<x;
#define pr1(x) cout<<x<<" ";
#define pr2(x,y) cout<<x<<" "<<y;
#define pr3(x,y,z) cout<<x<<" "<<y<<" "<<z;
#define pr4(x,y,z,w) cout<<x<<" "<<y<<" "<<z<<" "<<w;
#define deb cout<<"***************************************************************************************\n";
#define moshi cout<<"moshi moshi ! \n";
#define hi cout<<"hi ! \n";
#define bye cout<<"bye bye ! \n";
#define kawai cout<<"O kawai koto ! \n";
#define o_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define number_of_set_bits __builtin_popcountll
#define eb emplace_back
const ld PI=3.1415926535897932384626433;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T> >;
auto clk=clock();
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 <<"\n";
//use cerr if u want to display at the bottom
}
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 trace(...)
#endif
//********************************************************** Code begins ***********************************************
// trick for traversing all submasks
// for (ll j=mask ;j; j=(j-1)&mask) // also include 0 manually
// v.resize(unique(v.begin(), v.end()) - v.begin()); // remove duplicates
void solve()
{
ll a,b,c;
cin>>a>>b>>c;
ll x=a*a+b*b,y=c*c;
if(x<y) cout<<"Yes\n";
else cout<<"No\n";
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cout<<fixed<<setprecision(8);
ll test_cases=1;
//cin>>test_cases;
f(i,1,test_cases+1)
{
solve();
//clr();
}
#ifdef rd
cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll a, b, c;
cin >> a >> b >> c;
if (a * a + b * b < c * c) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
using namespace std;
using ll = long long;
int main(){
ll n,w; cin>>n>>w;
ll size = 200000,s,t,p,fin=0;
vector<ll> time(size,0);
rep(i,n){
cin>>s>>t>>p;
time[s] += p;
time[t] += -p;
if(t>fin) fin=t;
}
rep(i,fin){
time[i+1] += time[i];
}
ll max=time[0];
rep(i,fin){
// cout << time[i] << endl;
if(max<time[i]) max=time[i];
}
if(max>w) cout << "No" << endl;
else cout << "Yes"<< endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
string res;
cin>>n>>m;
if(n > m)
res = m+3 > n ? "Yes" : "No";
else
res = n+3 > m ? "Yes" : "No";
cout<<res;
} |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll a,b,c,d,chk=0;
cin>>a>>b>>c>>d;
if((a==(b+c+d))|| (b==(a+c+d))|| (c==(a+b+d))|| (d==(a+c+b))|| ((a+b)==(c+d))||((a+c)==(b+d))||((a+d)==(c+b)) )chk=1;
if(chk)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(4);
int B=0;
for(int i=0;i<4;i++){
cin>>p[i];
B+=p[i];
}
for(int i=0;i<16;i++){
int q=i,A=0;
for(int j=0;j<4;j++){
if(q%2==1){
A+=p[j];
}
q/=2;
}
if(A*2==B){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll test_case;
test_case=1;
//cin>>test_case;
while(test_case--)
{
ll n;
cin>>n;
ll s=0;
ll i=111;
i=i*9;
while(i<n)
{
s+=n-i;
i/=9;
i=i*10+1;
i=i*10+1;
i=i*10+1;
i*=9;
}
cout<<s<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool is_ok_10(int x)
{
while (0 < x) {
if (x % 10 == 7) {
return false;
}
x = x / 10;
}
return true;
}
bool is_ok_7(int x)
{
while (0 < x) {
if (x % 8 == 7) {
return false;
}
x = x / 8;
}
return true;
}
int main()
{
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if(is_ok_7(i) && is_ok_10(i)) {
cnt++;
}
}
cout << cnt << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
const int mx=1e5+5;
vector<int> adj[mx];
int vis[mx];
int good[mx];
int c[mx+1];
multiset<int> s;
void dfs(int node,int depth){
vis[node]=1;
if(!s.count(c[node])){
//cout<<node;
good[node]=1;
}
s.insert(c[node]);
for(int next:adj[node]){
if(!vis[next]){
dfs(next,depth+1);
}
}
auto it=s.find(c[node]);
s.erase(it);
}
int main() {
fast();
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>c[i];
}
for(int i=1;i<=n-1;i++){
int a,b;
cin>>a>>b;
adj[a].pb(b);
adj[b].pb(a);
}
set<int> s;
dfs(1,1);
vector<int> ans;
for(int i=1;i<=n;i++){
if(good[i]){
cout<<i<<"\n";
}
}
} | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(long long i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) {rep(_,v.size())cout<<" "<<v[_];cout<<endl;}
#define show2d(v) {rep(__,v.size())show1d(v[__]);}
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vt>vvt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const long double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={-1,0,1,0};
int dy[]={0,1,0,-1};
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
int n;
vvi G;
vi color,used,ans;
void dfs(int a,int p){
if(!used[color[a]])ans[a]=true;
used[color[a]]++;
rep(i,G[a].size())if(G[a][i]-p){
dfs(G[a][i],a);
}
used[color[a]]--;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
color=ans=vi(n);
used=vi(100100);
rep(i,n)cin>>color[i];
G=vvi(n);
rep(i,n-1){
int a,b;
cin>>a>>b;
a--;b--;
G[a].pb(b);
G[b].pb(a);
}
dfs(0,-1);
rep(i,n)if(ans[i])cout<<i+1<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define rep(i, j, n) for (ll i = j; i < (n); i++)
#define repr(i, j, n) for (ll i = j; i >= (n); i--)
#define each(i, mp) for (auto &i : mp)
#define all(x) (x).begin(), (x).end()
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x < b)
#define out(ans) cout << ans << endl
typedef pair<ll, ll> P;
const lb pi = acos(-1);
const ll mod = 1e9 + 7;
const ll INF = 1LL << 60;
int main(){
ll n;cin>>n;
ll x[n],y[n];rep(i,0,n)cin>>x[i]>>y[i];
bool ans=false;
rep(i,0,n-2){
rep(j,i+1,n-1){
rep(k,j+1,n){
lb xd1=x[j]-x[i],xd2=x[k]-x[i];
lb yd1=y[j]-y[i],yd2=y[k]-y[i];
if(xd1==0 and xd2==0)ans=true;
else if(yd1/xd1==yd2/xd2)ans=true;
}
}
}
if(ans)out("Yes");
else out("No");
return 0;
}
| #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
pair<int,int>point[1010];
bool online(int i,int j,int k)
{
int x1=point[i].first;
int y1=point[i].second;
int x2=point[j].first;
int y2=point[j].second;
int x3=point[k].first;
int y3=point[k].second;
return (y3-y1)*(x2-x1)==(y2-y1)*(x3-x1);
}
signed main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
//int x,y;
cin>>point[i].first>>point[i].second;
}
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
for(int k=j+1;k<=n;k++)
if(online(i,j,k))
{
cout<<"Yes"<<endl;
return 0;
}
cout<<"No"<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define N 400005
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int T;
int n;
int a[N];
int main()
{
n = read();
string s;
cin >>s;
for(int i=1;i<= n + 1;i++) {
a[i] = read();
}
int k = 1145141;
for(int i=1;i<=n;i++) {
k = min(k, abs(a[i + 1] - a[i]));
}
cout << k << endl;
for (int i = 0; i < k; i += 1) {
for (int j = 1; j <= n + 1; j += 1) {
cout << (a[j] / k) + (i < a[j] % k) << ' ';
}
cout << endl;
}
}
// 1 2 3 4 5 6 7 8
//
| //In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
//#pragma GCC optimize("Ofast")
const int maxn = 1e4 + 5;
int n, a[maxn], ans = maxn, b[maxn][105];
string s;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> s;
for(int i = 0; i <= n; i++)
{
cin >> a[i];
if(i&& (a[i - 1] < a[i]) == (s[i - 1] == '>'))
{
ans = 0;
}
if(i)
ans = min(ans, abs(a[i] - a[i - 1]));
}
cout << ans << '\n';
if(ans == 0)
return 0;
for(int i = 0; i <= n; i++)
{
for(int j = 0; j < a[i] % ans; j++)
b[j][i] = (ans + a[i] - 1) / ans;
for(int j = a[i] % ans; j < ans; j++)
b[j][i] = a[i] / ans;
}
for(int i = 0; i < ans; i++)
{
for(int j = 0; j <= n; j++)
cout << b[i][j] << " ";
cout << '\n';
}
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i = m; i < (n); ++i)
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<double, double>;
using Tiib = tuple<int, int, bool>;
const int INF = 1001001007;
const int mod = 1000000007;
const int MOD = 998244353;
const ll inf = 1e18;
template <typename AT>
void printvec(vector<AT> &ar){
rep(i,ar.size()-1) cout << ar[i] << " ";
cout << ar[ar.size()-1] << endl;
}
template <typename Q>
void printvvec(vector<vector<Q>> &ar){
rep(i,ar.size()){
rep(j,ar[0].size()-1) cout << ar[i][j] << " ";
cout << ar[i][ar[0].size()-1] << endl;
}
}
template <typename S>
bool range(S a, S b, S x){
return (a <= x && x < b);
}
void yes(){
cout << "Yes" << endl;
}
void no (){
cout << "No" << endl;
}
ll cel (ll a, ll b){
if (a % b == 0) return a / b;
else return a / b + 1;
}
ll gcds(ll a, ll b){
ll c = a % b;
while (c != 0){
a = b;
b = c;
c = a % b;
}
return b;
}
// segment tree : node(monoid : (ll,+))
// ar[i] = count(i);
vector<ll> node;
int sz = 1;
// len node : sz = 2べき
void init(int n){
while (sz < n) sz *= 2;
node.resize(2 * sz - 1);
rep(i,2 * sz - 1) node[i] = 1LL;
}
void initv(int n, vector<ll> vec){
while (sz < n) sz *= 2;
node.resize(2 * sz - 1);
rep(i,n) node[i + sz - 1] = vec[i];
rep(i,sz-n) node[sz - 1 + n + i] = 0LL;
rep(i,sz-1) node[sz-2-i] = node[2*sz-3-2*i] + node[2*sz-2-2*i];
}
// update ar[a] -> x
void update(int a){
a += sz - 1;
node[a] = max(0LL, node[a]-1LL);
while (a > 0){
a = (a - 1) / 2;
node[a] = node[2 * a + 1] + node[2 * a + 2];
}
}
// query : min Nth, k : node番号, [l,r) : node[k]の区間
int query(int N, int k=0, int l=0, int r=sz){
assert(N <= node[0]);
if (sz-1 <= k) return k - sz + 1;
if (N <= node[2*k+1]) return query(N,2*k+1,l,(l+r)/2);
if (N > node[2*k+1]) return query(N-node[2*k+1],2*k+2,(l+r)/2,r);
}
int main(){
int n; cin >> n;
vector<int> ans(n);
vector<ll> ar(202020,1LL);
initv(202020,ar);
rep(i,n){
int a; cin >> a;
update(a);
int b = query(1,0,0,sz);
ans[i] = b;
}
//cout << query(1,0,0,sz) << endl;
rep(i,n) cout << ans[i] << endl; //cout << sz << endl; cout << node[sz-1] << endl;
//cout << node[0] << endl; cout << node[sz] << endl;
} | #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; cin >> N;
bool nums[(int)2e5 + 2] = {}; int cur = 0;
REP(i, 0, N) {
int p; cin >> p;
nums[p] = true;
while (nums[cur]) cur++;
cout << cur << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 3000 + 10 ;
int arr[MAX][5] ;
int freq[40] ;
int n ;
bool check(int x)
{
memset(freq , 0 , sizeof(freq)) ;
for(int i = 0 ; i < n ; ++i)
{
int mask = 0 ;
for(int j = 0 ; j < 5 ; ++j)
{
if(arr[i][j] >= x)
mask += (1 << j) ;
}
freq[mask]++ ;
}
for(int mask1 = 0 ; mask1 < 32 ; ++mask1)
{
if(!freq[mask1])
continue ;
for(int mask2 = 0 ; mask2 < 32 ; ++mask2)
{
if(!freq[mask2])
continue ;
for(int mask3 = 0 ; mask3 < 32 ; ++mask3)
{
if(!freq[mask3])
continue ;
int mask = (mask1 | mask2 | mask3) ;
if(mask == 31)
return true ;
}
}
}
return false ;
}
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
for(int i = 0 ; i < n ; ++i)
{
for(int j = 0 ; j < 5 ; ++j)
cin>>arr[i][j] ;
}
int l = 0 , r = 1e9 ;
int ans = 0 ;
while(l <= r)
{
int mid = (l + r) >> 1 ;
if(check(mid))
ans = mid , l = mid+1 ;
else
r = mid-1 ;
}
return cout<<ans<<"\n" , 0 ;
} | #include <bits/stdc++.h>
#include<math.h>
#include<queue>
#include<cstdio>
#include<set>
#include<map>
using namespace std;
using ll = long long;
int main(){
ll N;
cin>>N;
vector<ll> A(N+1,0),B(N+1,0),MB(N+1,0),C(N,0);
ll ans=0;
for(ll i=1; i<=N; i++){
cin >> A.at(i);
}
for(ll i=1; i<=N; i++){
B.at(i)=B.at(i-1)+A.at(i);
if(B.at(i)>MB.at(i-1)) MB.at(i)=B.at(i);
else MB.at(i)=MB.at(i-1);
}
for(ll i=1; i<N; i++){
C.at(i)=C.at(i-1)+B.at(i);
if(C.at(i)+MB.at(i+1)>ans){
ans=C.at(i)+MB.at(i+1);
}
}
if(N==1 && A.at(1)>0) ans=A.at(1);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
//const int mod = 998244353;
signed main(){
int N; cin >> N;
Out(bit(N) - 1);
FOR(i, 1, bit(N)){
string ans(bit(N), 'A');
REP(j, bit(N)) if(__builtin_popcount(i & j) % 2) ans[j] = 'B';
Out(ans);
}
return 0;
}
| #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(){
ll n,count,p;
count=0;
cin>>n;
p=1;
ll q=0;
while(true){
if(p*1000>n){
count+=q*(n-p+1);
cout<<count<<endl;
return 0;
break;
}
count+=q*(p*1000-p);
p=p*1000;
q++;
}
} |
// Problem: B - Insurance
// Contest: AtCoder - Tokio Marine & Nichido Fire Insurance Programming Contest 2021（AtCoder Regular Contest 122)
// URL: https://atcoder.jp/contests/arc122/tasks/arc122_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define pb push_back
#define mp make_pair
const double PI = 4*atan(1);
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;
const int MAX_N = 1e5+10;
int n, a[MAX_N];
void solve()
{
sort(a,a+n);
const int mid = n/2;
double ans = 5e18;
for(int i=mid,j=mid+1,iter=0;(iter<100 && (i>=0 || j<n)) ;i--, j++){
if(i>=0){
double x = 1.0*a[i]/2, cur = 0;
for(int k=0;k<n;++k) cur += x + a[k]-min(1.0*a[k],2*x);
ans = min(ans, cur/n);
}
if(j<n){
double x = 1.0*a[j]/2, cur = 0;
for(int k=0;k<n;++k) cur += x + a[k]-min(1.0*a[k],2*x);
ans = min(ans, cur/n);
}
iter++;
}
printf("%.16lf\n", ans);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin >> n;
for(int i=0;i<n;++i)cin>>a[i];
solve();
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
#define rprintf(fmt, begin, end) do { const auto end_rp = (end); auto it_rp = (begin); for (bool sp_rp=0; it_rp!=end_rp; ++it_rp) { if (sp_rp) putchar(' '); else sp_rp = true; printf(fmt, *it_rp); } putchar('\n'); } while(0)
int N;
char S[10011];
int A[10011];
void MAIN() {
scanf("%d%s", &N, S);
REP (i, N+1) scanf("%d", A+i);
int mi = 1<<29;
REP (i, N) amin(mi, abs(A[i] - A[i+1]));
printf("%d\n", mi);
REP (t, mi) {
REP (i, N+1) {
int q = A[i] / mi;
int r = A[i] % mi;
if (t < r) q++;
printf("%d%c", q, " \n"[i==N]);
}
}
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
//constexpr long long MOD = 998244353LL;
static const ld pi = 3.141592653589793L;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
//グラフ関連
struct Edge {
int to, rev;
ll cap;
Edge(int _to, int _rev, ll _cap) : to(_to), rev(_rev), cap(_cap) {}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) {
G[from].push_back(Edge(to, (int)G[to].size(), cap));
if(revFlag)
G[to].push_back(Edge(from, (int)G[from].size() - 1, revCap));
}
vector<ll> divisor(ll n) {
vector<ll> ret;
sort(ret.begin(), ret.end());
return ret;
}
void solve() {
ll n, m;
cin >> n >> m;
Graph G(n);
vec<ll> C(m), D(m);
REP(i, m) {
ll a, b;
cin >> a >> b >> C[i] >> D[i];
a--;
b--;
add_edge(G, a, b, i, true, i);
}
vec<ll> d(n);
REP(i, d.size())
d[i] = INF;
d[0] = 0;
priority_queue<P, vector<P>, greater<P>> q;
q.push(make_pair(0, 0));
while(!q.empty()) {
auto [t, v] = q.top();
q.pop();
if(d[v] < t)
continue;
for(auto e : G[v]) {
ll cost = INF;
chmin(cost, max(0LL, D[e.cap] - t)); //0にする
chmin(cost, D[e.cap] / (t + 1)); //そのまま
ll T = sqrtl(D[e.cap]);
if(T > 1)
chmin(cost, D[e.cap] / (T - 1) + max(0LL, T - 1 - (t + 1))); //最小の時
if(T != 0)
chmin(cost, D[e.cap] / T + max(0LL, T - (t + 1))); //最小の時
chmin(cost, D[e.cap] / (T + 1) + max(0LL, T + 1 - (t + 1))); //最小の時
cost += C[e.cap];
if(d[e.to] > d[v] + cost) {
d[e.to] = d[v] + cost;
q.push(make_pair(d[e.to], e.to));
//cout << v << "->" << e.to << " " << d[e.to] << en;
}
}
}
if(d[n - 1] == INF)
cout << -1 << en;
else
cout << d[n - 1] << en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//cout << fixed << setprecision(10);
// ll t;
// cin >> t;
// REP(i, t - 1) {
// solve();
// }
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
ll vx[4]={0,1,0,-1};
ll vy[4]={1,0,-1,0};
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break;
else gcdmax%=gcdmin;
swap(gcdmin,gcdmax);
}
return gcdmin;
}
ll pow(ll N,ll P,ll M){
if(P==0)return 1;
else if(P%2==0){
ll t=pow(N,P/2,M);
return t*t%M;
}
else return N*pow(N,P-1,M)%M;
}
vector<ll> find_divisor(ll N){
ll k=1;
while(k*k<=N){
k++;
}
vector<ll> A(1);
rep(i,k){
if(i==1)A.at(0)=1;
else if(i>=2){
if(N%i==0)A.push_back(i);
}
}
ll t=0;
t=A.size();
rep(i,t){
if(A.at(t-i-1)*A.at(t-i-1)!=N)A.push_back(N/A.at(t-1-i));
}
return A;
}
vector<ll> fac;
vector<ll> finv;
vector<ll> inv;
void COMinit(ll N,ll P){
rep(i,N+1){
if(i==0){
fac.push_back(1);
finv.push_back(1);
inv.push_back(1);
}
else if(i==1){
fac.push_back(1);
finv.push_back(1);
inv.push_back(1);
}
else{
fac.push_back(fac.at(i-1)*i%P);
inv.push_back(P-inv.at(P%i)*(P/i)%P);
finv.push_back(finv.at(i-1)*inv.at(i)%P);
}
}
}
ll COM(ll n,ll k,ll P){
if(n<k)return 0;
if(n<0||k<0)return 0;
return fac.at(n)*(finv.at(k)*finv.at(n-k)%P)%P;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll N) : par(N) { //最初は全てが根であるとして初期化
for(ll i = 0; i < N; i++) par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); //xの根をrx
ll ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
int main(){
ll N,K;
cin>>N>>K;
ll d=2;
ll sum=0;
ll suma=0;
while(sum<K){
suma=sum;
d++;
if(d<=N+2){
sum+=(d-1)*(d-2)/2;
}
else if(d>=2*N+1){
sum+=(3*N+2-d)*(3*N+1-d)/2;
}
else {
sum+=(d-1)*(d-2)/2;
sum-=3*(d-N-2)*(d-N-1)/2;
}
}
ll e=0;
ll L=K-suma;
sum=0;
suma=0;
while(sum<L){
suma=sum;
e++;
if(d-e<N+1){
sum+=d-e-1;
}
else if(d-e<=2*N){
sum+=2*N-d+e+1;
}
}
ll f,g;
if(d-e>N+1){
g=N-(L-suma)+1;
f=d-e-g;
}
else{
f=L-suma;
g=d-e-f;
}
cout<<e<<" "<<f<<" "<<g<<endl;
} |
#include<bits/stdc++.h>
#include<chrono>
using namespace std;
#define FASTio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define all(v) (v).begin(), (v).end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define printarr(v) {for(auto x : v) cout<<x<<" ";cout<<"\n";}
#define mp make_pair
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define lcm(a, b) ((a) * (b)) / __gcd(a, b)
#define umpit unordered_map<ll,ll>::iterator
#define mpit map<ll,ll>::iterator
#define setit set<ll>::iterator
#define mx(a) *max_element(all(a))
#define mn(a) *min_element(all(a))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
const ll INF = LLONG_MAX / 2;
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// designed by Sebastiano Vigna and found on Neal's blog
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
// unordered_map<int,int,custom_hash> M;
};
int main()
{
FASTio;
#ifndef ONLINE_JUDGE //file start
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif //file end
ll t=1,i,j;
//cin>>t;
while(t--)
{
ll n;
cin>>n;
vector<ll>arr(n);
for(i=0;i<n;i++)
cin>>arr[i];
ll ans = 0;
ll sum = accumulate(all(arr),0ll);
vector<vector<bool>>dp(n+1,vector<bool>(sum+1,false));
for(i=0;i<=n;i++)
dp[i][0] = true;
for(i=1;i<=sum;i++)
dp[0][i] = false;
for(i=1;i<=n;i++)
{
for(j=1;j<=sum;j++)
{
dp[i][j] = dp[i-1][j];
if(arr[i-1] <= j)
dp[i][j] = dp[i][j] | dp[i-1][j-arr[i-1]];
}
}
for(i=(sum+1)/2;i<=sum;i++)
{
if(dp[n][i])
{
ans = i;
break;
}
}
cout<<ans<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <typename T>
void print_vec(const vector<T>& v, bool newline = true) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
if (newline) {
cout << "\n";
}
}
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
const int maxn = (int)2e5+105;
const int mod = (int)998244353 ;
#define sz(x) ((int)(x.size()))
#define pb push_back
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repr(i,a,b) for (int i = (a); i >= (b); i--)
using vi = vector<int>;
int fact_setup=0; int * fact;
int ex (int a, int b){
if(b==0)return 1; int e = ex(a,b/2); e=(1ll*e*e)%mod; if(b&1)e=(1ll*e*a)%mod; return e;
}
int inv (int a){
return ex(a, mod - 2);
}
int choose (int a, int b){
if(!fact_setup){
fact_setup=1;
fact = new int [maxn];
fact[0]=1; rep (i,1,maxn-1) fact[i]=(i*fact[i-1])%mod;
}
if(a<b)return 0;
int num = fact[a];
int denom = (fact[b] * fact[a - b]) % mod;
return (num * inv(denom)) % mod;
}
#define pii pair <int, int>
#define pvi pair <vector <int>, int>
#define pai array <int,2>
#define pdi array <double, 2>
#define pdt array <double, 3>
#define pti array <int,3>
#define pfi array <int,4>
#define all(v) v.begin(), v.end()
bool pos [maxn], pos2[maxn];
int t[maxn];
main(){
cin.tie(0); ios_base::sync_with_stdio(0);
int n; cin >> n;
int tot=0;
rep (i,1,n){cin>>t[i]; tot+=t[i];}
pos[0] = 1;
rep (i,1,n){
memset(pos2,0,sizeof(pos2));
rep (j,0,maxn-1){
if(pos[j]) pos2[j+t[i]]=pos2[abs(j-t[i])]=1;
}
rep (j,0,maxn-1)pos[j]=pos2[j];
}
rep (j,0,maxn-1){
if (pos[j]){
cout<<(tot-j)/2 + j << '\n'; return 0;
}
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define endl "\n"
#define fst first
#define snd second
const int UNDEF = -1;
const int INF=1<<30;
template<typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; }
template<typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; }
typedef pair<ll,ll> pll;typedef vector<ll> vll;typedef pair<int,int> pii;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<pii> vpii;typedef vector<pll> vpll;
template<typename T> void makeunique(vector<T> &vx) {sort(vx.begin(),vx.end());auto it=unique(vx.begin(),vx.end());vx.resize(std::distance(vx.begin(),it));}
int h[128];
int win(int x, int y) {
if ((x+1)%3==y) return x;
else return y;
}
void solve(int n, int klim, std::string inp){
memset(h,-1,sizeof h);
h['R']=0; h['S']=1; h['P']=2;
vi a[2];
a[0].resize(n);a[1].resize(n);
for (int i=0;i<n;i++) a[0][i]=h[inp[i]];
int cur=0,nxt=1;
for (int k=0;k<klim;k++) {
for (int i=0;i<n;i++) {
a[nxt][i]=win(a[cur][(i*2)%n],a[cur][((i*2)+1)%n]);
}
swap(cur,nxt);
}
char ans;
for (int x=0;x<128;x++) if (h[x]==a[cur][0]) ans=x;
printf("%c\n",ans);
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
long long n;
scanf("%lld",&n);
long long k;
scanf("%lld",&k);
std::string s;
std::cin >> s;
solve(n, k, s);
return 0;
}
| /*@author Vipen Loka*/
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define deb(x) cout << #x << ':' << x << '\n';
#define int long long
using namespace std;
template<class T>void show(vector<T> &a) {cerr << "[ "; for (int ij = 0; ij < (int)a.size(); ij++) {cerr << a[ij] << " ";} cerr << "]\n";}
template<class T>void show(T a) {cerr << a << endl;}
int r, c;
int mat[2005][2005], dp[2005][2005];
bool visited[2005][2005];
int find(int x, int y) {
if (x == r - 1 && y == c - 1) {
return 0;
}
if (visited[x][y]) {
return dp[x][y];
}
visited[x][y] = 1;
int res = -1e9;
if (x + 1 < r) {
res = max(res, mat[x + 1][y] - find(x + 1, y));
}
if (y + 1 < c) {
res = max(res, mat[x][y + 1] - find(x, y + 1));
}
dp[x][y] = res;
return res;
}
void solve() {
int i, j;
cin >> r >> c;
for (int i = 0; i < r; ++i)
{
for (int j = 0; j < c; ++j)
{
char t; cin >> t;
mat[i][j] = (t == '+') ? 1 : -1;
}
}
int ans = find(0, 0);
if (ans > 0) {
cout << "Takahashi" << endl;
}
else if (ans < 0) {
cout << "Aoki" << endl;
}
else {
cout << "Draw" << endl;
}
}
int32_t main(int32_t argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int T = 1;
// cin >> T;
while (T--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
} |
#include<iostream>
using namespace std;
int main(){
int n,ans;
ans=0;
cin>>n;
for(int i=0;i<n;i++){
int a,p,x,t;
cin>>a>>p>>x;
t=ans;
if(a<=0.5+x-1){
if(ans==0){
ans=p;
}else if(ans!=0&&t<=p){
ans=t;
}else if(ans!=0&&t>=p){
ans=p;
}
}
}
if(ans==0){
cout<<"-1";
}else{
cout<<ans;
}
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100000+10;
int main(){
int n;
int a[N][3];
int k=0;
int min=1e9+10;
int b[N];
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>a[i][j];
}
}
for(int i=0;i<n;i++){
if(a[i][2]-a[i][0]>0){
b[k]=a[i][1];
k++;
}
else{
continue;
}
}
if(k==0){
cout<<"-1";
}
else{
for(int i=0;i<k;i++){
if(b[i]<min){
min=b[i];
}
}
cout<<min;
}
return 0;
} |
#include <iostream>
using namespace std;
int main ()
{
int a,b,c;
cin>>a>>b>>c;
if(a-b==(b-c) || a-c==c-b || c-a==a-b)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <vector>
#include <iostream>
#include <set>
#include <map>
#include <unordered_set>
#include <queue>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <math.h>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i,n) for (int i=0; i<(n);++i)
//ll mod=998244353,fac[1000001],finv[1000001],inv[1000001];
int INF = 1e9+7,n,m,p,q,k,s;
vector<int> an(3,-1);
unordered_set<char> tops;
const double PI = acos(-1);
vector<vector<int>> dir = {{0,1},{1,0},{0,-1},{-1,0}};
ll power(ll a,ll b){
ll ans=1;
for(ll i=0;b>=(1<<i);++i){
if(b&(1<<i)) ans=ans*a%INF;
a=a*a%INF;
//cout << "ans " << ans << endl;
}
return ans;
}
/*
int rec(int S,int v,vector<int> &x,vector<vector<int>> &dp){
//cout << "s " << S << " v " << v << endl;
if(dp[S][v]>0) return dp[S][v];
if(v==n-1) return dp[S][v]=0;
int res=INF;
rep(u,m){
if(!(S>>u & 1)){
if(x[u]==1) res = min(res,rec(S|1<<u,u,x,dp)+p);
else res = min(res,rec(S|1<<u,u,x,dp)+q);
}
}
return dp[S][v]=res;
}*/
int main(){
vector<string> s(3);
cin >> s[0] >> s[1] >> s[2];
set<char> se;
rep(i,3){
for(char a:s[i]){
if(!(se.count(a))) se.insert(a);
}
}
rep(i,3) tops.insert(s[i][0]);
if(se.size()>10){
cout << "UNSOLVABLE" << endl;
return 0;
}
int n = se.size();
ll indexes[10];
map<char,int> ma;
int id=0;
for(auto x:se){
ma[x]=id;
id++;
}
rep(i,10) indexes[i]=i;
int cnt=0;
do{
//rep(i,10) cout << indexes[i] << endl;
//cout << endl;
int go=0;
for(auto x:tops){
if(indexes[ma[x]]==0) go=1;
}
if(go==1) continue;
vector<ll> v(3,0);
rep(i,3){
rep(j,s[i].size()){
v[i]=v[i]*10+indexes[ma[s[i][j]]];
}
}
//rep(i,3) cout << v[i] << ' ';
//cout << endl;
if(v[0]+v[1]==v[2]){
rep(i,3) cout << v[i] << endl;
return 0;
}
}while(next_permutation(indexes,indexes+10));
cout << "UNSOLVABLE" << endl;
} |
/*
© 2021-03-28 06:53:10 Franco1010 All Rights Reserved
*/
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
#define deb(x) cout << #x": " << (x) << endl;
using uint=unsigned;
using ull=unsigned long long;
struct modinfo{uint mod,root;};
template<modinfo const&ref>
struct modular{
static constexpr uint const &mod=ref.mod;
static modular root(){return modular(ref.root);}
uint v;
//modular(initializer_list<uint>ls):v(*ls.bg){}
modular(lli vv=0){s(vv%mod+mod);}
modular& s(uint vv){
v=vv<mod?vv:vv-mod;
return *this;
}
modular operator-()const{return modular()-*this;}
modular& operator+=(const modular&rhs){return s(v+rhs.v);}
modular&operator-=(const modular&rhs){return s(v+mod-rhs.v);}
modular&operator*=(const modular&rhs){
v=ull(v)*rhs.v%mod;
return *this;
}
modular&operator/=(const modular&rhs){return *this*=rhs.inv();}
modular operator+(const modular&rhs)const{return modular(*this)+=rhs;}
modular operator-(const modular&rhs)const{return modular(*this)-=rhs;}
modular operator*(const modular&rhs)const{return modular(*this)*=rhs;}
modular operator/(const modular&rhs)const{return modular(*this)/=rhs;}
modular pow(int n)const{
modular res(1),x(*this);
while(n){
if(n&1)res*=x;
x*=x;
n>>=1;
}
return res;
}
modular inv()const{return pow(mod-2);}
friend modular operator+(int x,const modular&y){
return modular(x)+y;
}
friend modular operator-(int x,const modular&y){
return modular(x)-y;
}
friend modular operator*(int x,const modular&y){
return modular(x)*y;
}
friend modular operator/(int x,const modular&y){
return modular(x)/y;
}
friend ostream& operator<<(ostream&os,const modular&m){
return os<<m.v;
}
friend istream& operator>>(istream&is,modular&m){
lli x;is>>x;
m=modular(x);
return is;
}
bool operator<(const modular&r)const{return v<r.v;}
bool operator==(const modular&r)const{return v==r.v;}
bool operator!=(const modular&r)const{return v!=r.v;}
explicit operator bool()const{
return v;
}
};
extern constexpr modinfo base{998244353,3};
// extern constexpr modinfo base{1000000007,0};
//modinfo base{1,0};
using mint=modular<base>;
//COMBI
const int vmax=(1<<21)+10;
mint fact[vmax],finv[vmax],invs[vmax];
void initfact(){
fact[0]=1;
fore(i,1,vmax)fact[i]=fact[i-1]*i;
finv[vmax-1]=fact[vmax-1].inv();
for(int i=vmax-2;i>=0;i--)finv[i]=finv[i+1]*(i+1);
for(int i=vmax-1;i>=1;i--)invs[i]=finv[i]*fact[i-1];
}
mint choose(int n,int k){
return fact[n]*finv[n-k]*finv[k];
}
mint binom(int a,int b){
return fact[a+b]*finv[a]*finv[b];
}
mint catalan(int n){
return binom(n,n)-(n-1>=0?binom(n-1,n+1):0);
}
const lli N = 2e5 + 5;
lli p[N];
vi primes;
lli n, m;
set<vi> st;
void dfs(vi& v, lli cur){
if(sz(v) == n){
st.insert(v);
return;
}
lli foo = cur;
while(foo <= m){
v.pb(foo);
dfs(v, foo);
v.pop_back();
foo += cur;
}
}
mint f(lli x){
mint res = 1;
while(x > 1){
lli foo = p[x];
lli cnt = 0;
while(p[x] == foo){
x /= p[x];
cnt++;
}
res *= choose(n - 1 + cnt, cnt);
}
return res;
}
int main(){ _
p[0] = p[1] = 1;
for(lli i = 2; i < N; i++) if(!p[i]) for(lli j = i; j < N; j += i) p[j] = i;
// fore(i, 0, N) if(!p[i]) primes.pb(i);
// freopen("file.in","r",stdin);
// freopen("file.out","w",stdout);
initfact();
cin >> n >> m;
mint ans = 0;
fore(i, 2, m + 1){
ans += f(i);
}
cout << ans + mint(1) << ENDL;
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n;
cin >> n;
vector<int>a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
long long ans = n*(n-1);
long long cnt=0;
for(int i=1; i<n; i++){
if(a[i]!=a[i-1]){
ans -= cnt*(cnt+1);
cnt = 0;
}else{
cnt++;
}
}
ans -= cnt*(cnt+1);
cout << ans/2 << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define LL long long
#define p 998244353
int n,m,er[21];
int jc[10001],ny[10001];
int f[20][5001];
int ksm(int x,int y){
if(x==1)return y;
LL u=ksm(x/2,y);
u=(LL)u*u%p;
if(x&1)u=(LL)u*y%p;
return u;
}
LL ans=0;
int read(){
int u=0;
char c=getchar();
while(c>'9'||c<'0'){
c=getchar();
}
while(c>='0'&&c<='9'){
u=u*10+c-48;
c=getchar();
}
return u;
}
int C(int x,int y){
if(y>x)return 0;
return (LL)jc[x]*ny[y]%p*ny[x-y]%p;
}
int main(){
n=read();
m=read();
jc[0]=ny[0]=1;
fo(i,1,m+n)jc[i]=(LL)jc[i-1]*i%p;
ny[n+m]=ksm(p-2,jc[n+m]);
fod(i,n+m,2)ny[i-1]=(LL)ny[i]*i%p;
er[0]=1;
fo(i,1,20)er[i]=er[i-1]*2;
f[0][0]=1;
fo(i,1,20){
if(er[i]<=m){
fo(j,0,m){
if(f[i-1][j]){
fo(k,0,(m-j)/er[i]){
// if(j+k*er[i]==20&&i==3)cout<<j<<endl;
f[i][j+k*er[i]]=(f[i][j+k*er[i]]+(LL)C(n,2*k)*f[i-1][j]%p)%p;
}
}
}
// fo(j,0,m)if(f[i][j])cout<<i<<" "<<j<<" "<<f[i][j]<<endl;
ans=f[i][m];
}
}
printf("%lld",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 1e15
#define mod 1000000007
#define N 100001
#define ll long long int
#define vint vector<int>
#define vll vector<ll>
#define vstr vector<string>
#define vvint vector<vector<int> >
#define vvll vector<vector<ll> >
#define vint_pair vector<pair<int,int> >
#define input(arr) for(auto &x:arr) cin>>x;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
int main() {
int a,b; cin>>a>>b;
int mul = 1;
if(a<b){
int tmp = a;
a = b;
b = tmp;
mul = -1;
}
for(int i=1;i<=a;++i){
cout<<(i*mul)<<" ";
}
int m = (a*(a+1))/2;
int n = (b*(b-1))/2;
for(int i=1;i<b;++i){
cout<<(-i * mul)<<" ";
}
cout<<(n-m)*mul;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll k, n, m;
cin >> k >> n >> m;
vector<pair<ll,ll>> S(k);
vector<ll> A(k);
vector<ll> B(k);
for(ll i=0; i<k; i++) cin >> A[i];
ll count = 0;
for(ll i=0; i<k; i++){
ll b = m*A[i]/n;
if(m*A[i]%n >= n/2) b++;
B[i] = b;
count += b;
S[i].first = n*b - m*A[i];
S[i].second = i;
}
sort(S.begin(),S.end());
if(count<=m){
for(ll i=0; i<(m - count); i++){
B[S[i].second] += 1;
}
}else{
for(ll i=0; i<(count - m); i++){
B[S[k-1-i].second] -= 1;
}
}
for(ll i=0; i<k; i++) cout << B[i] << " ";
cout << endl;
return 0;
} | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int CM = 1 << 17, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
if ((tmp & ma0) ^ ma0) {
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
}
else {
tmp = tmp & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 8;
if ((ct = *ci++) >= '0') {
tmp = tmp * 10 + ct - '0';
if (*ci++ == '0') {
tmp = tmp * 10;
ci++;
}
}
}
return tmp;
}
int tmp[100000], P[50000], Q[50000];
void pakuri_sort(int N, int A[]) {
const int b = 8;
rep(k, 4) {
int kazu[1 << b] = {}, kazu2[1 << b] = {};
rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];
for (int i = N - 1; i >= 0; i--) tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];
k++;
rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];
for (int i = N - 1; i >= 0; i--) A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];
}
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
int N = getint();
ll kotae = 0;
rep(i, N) {
tmp[i] = getint();
kotae += tmp[i];
}
rep(i, N) {
int b = getint();
if (i & 1) P[i >> 1] = (b - tmp[i] + 1000000000);
else Q[i >> 1] = (b - tmp[i] + 1000000000);
}
pakuri_sort(N / 2, P);
pakuri_sort(N / 2, Q);
int k = N / 2 - 1;
while (k >= 0) {
int a = P[k] - 1000000000;
int b = Q[k] - 1000000000;
if (a + b <= 0) break;
kotae += a + b;
k--;
}
printf("%lld\n", kotae);
Would you please return 0;
} |
/*
* Author : Andrew J
*/
#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 rall(x) x.rbegin() , x.rend()
#define vz(x) x.size()
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 105;
const int INF = 1e9 + 50;
const int MOD = 1e9 + 7;
double dp[N][N][N];
bool vis[N][N][N];
double ddiv(double a, double b) {
return a / b;
}
double f(int gold, int silver, int bronze) {
if (gold == 100 || silver == 100 || bronze == 100) return 0;
double &sol = dp[gold][silver][bronze];
if (vis[gold][silver][bronze]) return sol;
vis[gold][silver][bronze] = 1;
sol = 1;
sol += ddiv(gold, gold + silver + bronze) * f(gold + 1, silver, bronze);
sol += ddiv(silver, gold + silver + bronze) * f(gold, silver + 1, bronze);
sol += ddiv(bronze, gold + silver + bronze) * f(gold, silver, bronze + 1);
return sol;
}
int main() {
int a, b, c; scanf("%d%d%d", &a, &b, &c);
memset (vis, false, sizeof vis);
printf("%.10lf\n", f(a, b, c));
return 0;
}
void in(int &x){
bool neg = false;
register int c;
x = 0;
c = getchar();
if(c == '-'){
neg = true;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg) x *= -1;
}
| #include <bits/stdc++.h>
using namespace std;
string s,t;
int main()
{
long long n;
cin>>n;
cin>>s>>t;
vector<int> ss,tt;
for(int i=0;i<n;i++)
{
if(s[i]=='0')
{
ss.push_back(i);
}
if(t[i]=='0')
{
tt.push_back(i);
}
}
if(ss.size()!=tt.size())
{
cout<<-1<<endl;
}
else{
long long ans=0;
for(int i=0;i<ss.size();i++)
{
if(ss[i]!=tt[i]) ans++;
}
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h> /*Fuck ratings Feel the magic in the code...*/
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template<typename T>
// using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/* in log(n) time...
find_by_order() - Returns an iterator to the k-th largest element (counting from zero)
order_of_key() - The number of items in a set that are strictly smaller than our item
// Rest same as set
*/
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mod 1000000007
#define inf 2e18
#define minf -2e18
#define PI 3.141592653589793238462
#define ll long long
#define all(x) x.begin(), x.end()
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define sz(v) (int)v.size()
#define nline "\n"
ll powr(ll a, ll b, ll p) { if(b == 0) return 1; else if(b == 1) return a; else if(!(b & 1)) return powr((a * a) % p, b / 2, p); else return (a * powr(a, b - 1, p)) % p; }
ll gcd(ll a, ll b){ if(b == 0) return a; else return gcd(b, a % b); }
ll lcm(ll a, ll b){ return a * b / gcd(a, b); }
void extendgcd(ll a, ll b, ll *v) {if (b == 0) {v[0] = 1; v[1] = 0; v[2] = a; return ;} extendgcd(b, a % b, v); ll x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return;} //pass an arry of size1 3
ll mminv(ll a, ll b) {ll arr[3]; extendgcd(a, b, arr); return arr[0]; } //for non prime b
ll mod_inv(ll a, ll p){ return powr(a,p-2,p); } /*For prime p "Fermet lill theorem"*/
ll mod_add(ll a, ll b, ll m) { a = a % m; b = b % m; return ((a + b) % m + m) % m; }
ll mod_mul(ll a, ll b, ll m) { a = a % m; b = b % m; return ((a * b) % m + m) % m; }
ll mod_sub(ll a, ll b, ll m) { a = a % m; b = b % m; return ((a - b) % m + m) % m; }
ll mod_div(ll a, ll b, ll m) { a = a % m; b = b % m; return (mod_mul(a, mod_inv(b, m), m) + m) % m; } /*For prime p*/
// void swap(int &a, int &b) { int temp = a; a = b; b = temp; }
ll spf(ll n) { for(int i = 2; i * i <= n; i++) { if(n % i == 0) return i; } return n; }/* spf in sqrt(n) time... */
vector<ll> fact_modp(ll n, ll p) { vector<ll> fact(n + 1); fact[0] = 1; for(int i = 1; i <= n; i++){ fact[i] = (i * fact[i - 1]) % p; } return fact; }
/*For prime p "Fermet lill theorem..."*/
ll nCr_modp(ll n, ll r, ll p, vector<ll> fact) { if(n < r) return 0; if(r == 0) return 1; else { return ((fact[n] * mod_inv(fact[r], p)) % p * mod_inv(fact[n - r], p)) % p; } }
vector<ll> prime_sieve(ll n) { /*Returns vector of prime <= n in nloglogn time*/
vector<ll> t;
vector<bool> a(n + 1, true);
a[0] = a[1] = false;
for(int i = 2; i * i <= n; i++) {
if(a[i]) {
for(int j = i * i; j <= n; j += i)
a[j] = false;
}
}
for(int i = 0; i <= n; i++) {
if(a[i])
t.push_back(i);
}
return t;
}
vector<ll> spf_sieve(ll n) { /*Returns vector of spf[n] in nloglogn time*/
vector<ll> a(n + 1, -1);
for(int i = 2; i * i <= n; i++) {
if(a[i] == -1) {
a[i] = i;
for(int j =i * i; j <= n; j += i) { if(a[j] == -1) a[j] = i;}
}
}
for(int i = 2; i <= n; i++) { if(a[i] == -1) a[i] = i;}
return a;
}
/* --------------------------------------Template ends, Dee codes---------------------------------------*/
int main()
{
fastio();
int tests = 1;
// cin >> tests;
while(tests--)
{
int n;
cin >> n;
vector<int> a(n);
ll res = 0;
map<int, ll> mp;
for(int i = 0; i < n; i++) {
cin >> a[i];
int r1 = (200 - (a[i] % 200));
if(r1 != 200) {
res += mp[200 - r1];
}
mp[a[i] % 200]++;
}
res += ((mp[0] * (mp[0] - 1)) / 2);
cout << res << nline;
}
return 0;
}
| #include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <fstream>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define FORD(i,a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-9
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define sq5(x) ((x) * (x) * (x) * (x) * (x))
#define N 400005
ll t[N * 4];
void push(int v) {
if (t[v]) {
t[v * 2] += t[v];
t[v * 2 + 1] += t[v];
t[v] = 0;
}
}
void upd(int v, int tl, int tr, int l, int r, ll val) {
if (l > r) {
return;
}
if (tl == l && tr == r) {
t[v] += val;
return;
}
push(v);
int tm = (tl + tr) / 2;
upd(v * 2, tl, tm, l, min(tm, r), val);
upd(v * 2 + 1, tm + 1, tr, max(tm + 1, l), r, val);
}
ll get(int v, int tl, int tr, int pos) {
if (tl == tr) {
return t[v];
}
push(v);
int tm = (tl + tr) / 2;
if (pos <= tm) {
return get(v * 2, tl, tm, pos);
}
else {
return get(v * 2 + 1, tm + 1, tr, pos);
}
}
vector<vi>g;
int tIn[N], tOut[N];
int tt = 0;
void dfs(int v, int p = -1) {
tIn[v] = tt++;
REP(i, sz(g[v])) {
int u = g[v][i];
if (u != p) {
dfs(u, v);
}
}
tOut[v] = tt++;
}
bool inner(int a, int b) {
return tIn[b] <= tIn[a] && tOut[a] <= tOut[b];
}
int main(void) {
int n;
scanf("%d", &n);
g.resize(n);
CL(tIn, -1);
CL(tOut, -1);
vii edges;
REP(i, n - 1) {
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
g[x].pb(y);
g[y].pb(x);
edges.pb(mp(x, y));
}
dfs(0);
int q;
scanf("%d", &q);
REP(i, q) {
int type, e;
ll x;
scanf("%d%d%lld", &type, &e, &x);
e--;
if (type == 1) {
if (inner(edges[e].X, edges[e].Y)) {
upd(1, 0, n * 2 - 1, tIn[edges[e].X], tOut[edges[e].X], x);
}
else {
upd(1, 0, n * 2 - 1, 0, n * 2 - 1, x);
upd(1, 0, n * 2 - 1, tIn[edges[e].Y], tOut[edges[e].Y], -x);
}
}
else {
if (inner(edges[e].Y, edges[e].X)) {
upd(1, 0, n * 2 - 1, tIn[edges[e].Y], tOut[edges[e].Y], x);
}
else {
upd(1, 0, n * 2 - 1, 0, n * 2 - 1, x);
upd(1, 0, n * 2 - 1, tIn[edges[e].X], tOut[edges[e].X], -x);
}
}
}
REP(i, n) {
printf("%lld\n", get(1, 0, n * 2 - 1, tIn[i]));
}
}
|
#define G 3
#include<map>
#define AK goto
#include<cmath>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
#define md ((l+r)>>1)
#define cht 1000000007
#define inf 1145141919810
#define mem(i,j)memset(i,j,sizeof(i))
#define F(i,j,n)for(int i=j;i<=n;i++)
#define D(i,j,n)for(int i=j;i>=n;i--)
using namespace std;
namespace sky_chen{
// char buf[1<<23],*p1=buf,*p2=buf,obuf[1<<23],*O=obuf;
// #define gc() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline ll read(){ll ans=0,f=1;char a=getchar();while(a>'9'||a<'0'){if(a=='-')f=-1;a=getchar();}while(a>='0'&&a<='9')ans=ans*10+(a^48),a=getchar();return ans*f;}
inline char red(){char a=getchar();while(a>'z'||a<'a')a=getchar();return a;}
// inline void print(ll x){if(x>9)print(x/10);*O++=x%10+'0';}
inline void cadd(ll &x,ll y){x=(x+y)%cht;}
inline void cmin(ll &x,ll y){x=min(x,y);}
inline void cmax(ll &x,ll y){x=max(x,y);}
ll qpow(ll n,ll base=cht-2){ll ans=1;while(base){if(base&1)ans=ans*n%cht;n=n*n%cht;base>>=1;}return ans;}
const int maxn = 1e6+5;
const int maxc = 3e5+5;
ll n,x[maxn],y[maxn];
struct node{
ll a=0,b=0,c=0;
}p1,p2,t,f[maxn],g[maxn];
int yyds(){
n=read();
F(i,1,n)x[i]=read(),y[i]=read();
ll m=read();
p1.a=1;p2.b=1;
f[0]=p1;g[0]=p2;
F(i,1,m){
ll opt=read();
if(!(opt-1)){
t=p1;p1=p2;p2.a=-t.a;p2.b=-t.b;p2.c=-t.c;
f[i]=p1;g[i]=p2;
}
else if(!(opt-2)){
t=p2;p2=p1;p1.a=-t.a;p1.b=-t.b;p1.c=-t.c;
f[i]=p1;g[i]=p2;
}
else if(!(opt-3)){
p1.c=2*read()-p1.c;p1.b=-p1.b;p1.a=-p1.a;
f[i]=p1;g[i]=p2;
}
else{
p2.c=2*read()-p2.c;p2.b=-p2.b;p2.a=-p2.a;
f[i]=p1;g[i]=p2;
}
}
// F(i,0,m)cout<<f[i].a<<' '<<f[i].b<<' '<<f[i].c<<' '<<g[i].a<<' '<<g[i].b<<' '<<g[i].c<<endl;
ll q=read();
F(i,1,q){
ll sb1=read(),sb2=read();
ll za=x[sb2],zb=y[sb2];
ll nza=f[sb1].a*za+f[sb1].b*zb+f[sb1].c,nzb=g[sb1].a*za+g[sb1].b*zb+g[sb1].c;
printf("%lld %lld\n",nza,nzb);
}
return 0;
}
}
int main(){return sky_chen::yyds();}
//sky_chen txdy! | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
typedef long long ll;
struct node{
ll a,b,c,d,e,f;
}op[N];
ll x[N],y[N];
int main(){
int n;
cin>>n;
for (int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
int m,t;
ll p;
node now;
cin>>m;
op[0]={1,0,0,0,1,0};
for (int i=1;i<=m;i++){
cin>>t;
now=op[i-1];
if (t==1){
op[i]={now.d,now.e,now.f,-now.a,-now.b,-now.c};
}
else if (t==2){
op[i]={-now.d,-now.e,-now.f,now.a,now.b,now.c};
}
else if (t==3){
cin>>p;
op[i]={-now.a,-now.b,-now.c+2*p,now.d,now.e,now.f};
}
else{
cin>>p;
op[i]={now.a,now.b,now.c,-now.d,-now.e,2*p-now.f};
}
}
int q,a,b;
cin>>q;
for (int i=1;i<=q;i++){
cin>>a>>b;
now=op[a];
printf("%lld %lld\n",x[b]*now.a+y[b]*now.b+now.c,x[b]*now.d+y[b]*now.e+now.f);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &x){
x = 0; int f = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
x *= f;
}
inline void write(int x){if (x > 9) write(x/10); putchar(x%10+'0'); }
const int N = 1005;
struct Union_Find_Set{
int fa[N*N]; bool val[N*N];
inline void init(){
for (int i = 1; i <= 1000005; ++i) fa[i] = i,val[i] = 0;
}
inline int F(int x){
return x == fa[x] ? x : (fa[x] = F(fa[x]));
}
inline void Merge(int x,int y){
x = F(x),y = F(y); if (x == y) return;
fa[x] = y,val[y] |= val[x];
}
inline void tag(int x){
val[F(x)] = 1;
}
}S;
int n,m;
char mp[N][N]; int id[N][N],cntid;
int solve(){
int i,j; int ans = 0;
cntid = 0,S.init();
for (i = 1; i <= n; ++i) for (j = 1; j <= m; ++j) id[i][j] = 0;
for (i = 1; i <= n; ++i){
bool flag = 1; int lst = -1;
for (j = 1; j <= m; ++j) if (mp[i][j] == '#'){
flag = 0,id[i][j] = ++cntid;
if (lst != -1) S.Merge(id[i][j],id[i][lst]);
lst = j;
if (i==1||j==1||i==n||j==m) S.tag(id[i][j]);
}
if (flag && i > 1 && i < n) ++ans;
}
for (j = 1; j <= m; ++j){
int lst = -1;
for (i = 1; i <= n; ++i) if (id[i][j]){
if (lst != -1) S.Merge(id[i][j],lst);
lst = id[i][j];
}
}
for (i = 1; i <= cntid; ++i) if (i == S.F(i)){
if (S.val[i]) ; else ++ans;
}
return ans;
}
int main(){
int i,j;
cin >> n >> m;
for (i = 1; i <= n; ++i) cin >> mp[i] + 1;
int ans1 = solve();
swap(n,m);
static char mp2[N][N];
for (i = 1; i <= n; ++i) for (j = 1; j <= m; ++j) mp2[i][j] = mp[j][i];
for (i = 1; i <= n; ++i) for (j = 1; j <= m; ++j) mp[i][j] = mp2[i][j];
cout << min(ans1,solve()) << '\n';
return 0;
} | #include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random>
#include<stdlib.h>
#define rip(i,n) for(int i=0;i<n;i++)
#define Rip(i,n) for(int i=1;i<=n;i++)
#define RIP(i,a,b) for(int i=a;i<b;i++)
#define all(V) V.begin(),V.end()
#define sec setprecision;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops");
constexpr double eps = 1e-9;
constexpr double pi = 3.141592653589793238462643383279;
using namespace std;
using ll = long long;
using ld = long double;
using Pa = pair<ll, ll>;
const ll MOD = 998244353;
ll gcd(ll a, ll b)
{
if (a % b == 0) return(b);
else return(gcd(b, a % b));
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
ll pow(ll a, ll b) {
ll ans = 1;
if (b < 0)return 1;
else if (b % 2 == 0)return(pow(a * a, b / 2));
else return (a * pow(a, b - 1));
}
ll modpow(ll x, ll n, ll mod) {
x %= mod;
if (n == 0)
return 1;
if (n % 2 == 0)
return (modpow((x * x) % mod, n / 2, mod) % mod);
else
return (x * modpow(x, n - 1, mod)) % mod;
}
template<typename T>
vector<T> primes(T n) {//primes[i]でiを割り切る最初の素数を返す
vector<T> spf(n + 1);
for (int i = 0; i <= n; i++) spf[i] = i;
for (T i = 2; i * i <= n; i++) {
if (spf[i] == i) {
for (T j = i * i; j <= n; j += i) {
if (spf[j] == j) {
spf[j] = i;
}
}
}
}
return spf;
}
void solveA() {
int v, t, s, d; cin >> v >> t >> s >> d;
if (v * t <= d && d <= v * s)cout << "No" << endl;
else cout << "Yes" << endl;
}
void solveB() {
int n, x; cin >> n >> x;
vector<int>a(n);
rip(i, n)cin >> a[i];
rip(i, n) {
if (a[i] != x)cout << a[i] << endl;
}
}
void solveC() {
int h, w; cin >> h >> w;
vector<string>s(h);
rip(i, h)cin >> s[i];
ll sum = 0;
rip(i, h) {
rip(j, w) {
if (s[i][j] == '#') {
int count = 0;
if (s[i + 1][j] == '#')count++;
if (s[i - 1][j] == '#')count++;
if (s[i][j + 1] == '#')count++;
if (s[i][j - 1] == '#')count++;
sum += 4 - count;
}
}
}
cout << sum << endl;
}
void solveD() {
ll n; cin >> n;
//正のみで考えて弐倍すればok
int count = 0;
for (int i = 1; (ll)i * i + i <= 2 * n; i++) {
if ((2 * n) % i == 0 && ((2 * n / i) + 1 - i) % 2 == 0) {
count += 2;
}
}
cout << count << endl;
}
void solveE() {
int n, m; cin >> n >> m;
vector<int>a(m); vector<int>b(m);
rip(i, m)cin >> a[i] >> b[i];
int k; cin >> k;
vector<int>c(k);
rip(i, k)cin >> c[i];
}
void solveF() {
}
int main() {
solveA();
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
ll n;
cin >> n;
ll m = n;
ll b2 = 1;
ll ans = 1e18+1;
for(int b = 0;b2<=n;b++){
ll a = n/b2;
ll c = n%b2;
ans = min(ans,a+b+c);
b2 *= 2;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long n;
cin >> n;
long long sum=n;
long long a=n,b=0,c=0;
long long count2=1;
while(a>1) {
if(a%2==0) {
b++;
a/=2;
count2*=2;
}
else {
c=c+count2;
a-=1;
}
if(sum>=a+b+c) {
sum=a+b+c;
}
}
cout << sum << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)(x.size())
#define all(x) x.begin(), x.end()
#define rep(x) for (int ii = 0; ii < x; ii++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<int, vector<int>> M;
rep(n) {
int x, id;
cin >> x >> id;
M[id].push_back(x);
}
for (const auto& [k, v] : M) sort(all(M[k]));
ll ans = 0;
vector<int> keys;
for (const auto& [k, v] : M) {
keys.push_back(k);
for (int i = 1; i < sz(v); i++) {
ans += v[i] - v[i - 1];
}
}
int m = sz(M);
vector<vector<ll>> dp(m, vector<ll>(2, 0));
dp[0][0] = abs(M[keys[0]][0]);
dp[0][1] = abs(M[keys[0]].back());
for (int i = 1; i < m; i++) {
int k = keys[i];
dp[i][0] = min(
dp[i - 1][0] + abs(M[k][0] - M[keys[i - 1]].back()),
dp[i - 1][1] + abs(M[k][0] - M[keys[i - 1]][0]));
dp[i][1] =
min(dp[i - 1][0] +
abs(M[k].back() - M[keys[i - 1]].back()),
dp[i - 1][1] +
abs(M[k].back() - M[keys[i - 1]][0]));
}
ans += min(dp[m - 1][0] + abs(M[keys.back()].back()),
dp[m - 1][1] + abs(M[keys.back()][0]));
cout << ans;
} | #include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <bitset>
//#include<unordered_map>
#define INT_MINs -2000000000
#define INT_MAXs 1000000001
#define MID int mid=(l+r)/2
#define REP1(i,x,y) for(int i=x;i<y;i++)
#define REP2(i,x,y) for(int i=x;i<=y;i++)
#define ls (2*k)
#define rs (2*k+1)
#define lson l,mid,2*k
#define rson mid+1,r,2*k+1
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define IOS ios::sync_with_stdio(0);cin.tie(NULL);
#define pb(a) push_back(a)
#define pi acos(-1)
#define endl '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod=1e9+7;
const ll ba=131;
//ll qk(ll x,ll y){ll ans=1;while(y){if(y&1) ans=ans*x;y>>=1;x=x*x;}return ans;}
const int dx[8] = { 0,-1,0,1,-1,-1,1,1}, dy[8] = { -1,0,1,0,-1,1,-1,1};
const int dxx[8]= {2,1,-1,-2,-2,-1, 1, 2},dyy[8]= {1,2,2,1, -1,-2,-2,-1};
ll n;
ll a[200005],b[200005],l[200005],r[200005];
ll dp[200005][2];
void solve(){
cin>>n;
ll maxx=0,minn=INF;
for(int i=1;i<=200000;i++){
r[i]=-INF;
l[i]=INF;
}
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
l[b[i]]=min(l[b[i]],a[i]);
r[b[i]]=max(r[b[i]],a[i]);
//cout<<l[b[i]]<<' '<<r[b[i]]<<' '<<1111<<endl;
minn=min(minn,b[i]);
maxx=max(maxx,b[i]);
}
ll sum1=0,sum2=0;
l[minn-1]=r[minn-1]=0;
for(int i=minn;i<=maxx;i++){
if(r[i]==-INF) { l[i]=l[i-1],r[i]=r[i-1],dp[i][0]=dp[i-1][0],dp[i][1]=dp[i-1][1];continue;}
dp[i][0]=min(dp[i-1][0]+r[i]-l[i]+abs(l[i-1]-r[i]),dp[i-1][1]+r[i]-l[i]+abs(r[i-1]-r[i]));
dp[i][1]=min(dp[i-1][0]+r[i]-l[i]+abs(l[i-1]-l[i]),dp[i-1][1]+r[i]-l[i]+abs(r[i-1]-l[i]));
}
cout<<min(dp[maxx][0]+abs(l[maxx]),dp[maxx][1]+abs(r[maxx]))<<endl;
}
int main(){
IOS;
solve();
return 0;
}
|
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int,int>;
using PL = pair<ll,ll>;
using PPL = pair<pair<ll,ll>,ll>;
#define INF 1000000000
#define INFLL 1000000000000000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
#define tp make_tuple
#define ALL(vec) vec.begin(), vec.end()
ll mod = 1000000007;
ll mod2 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ld a,b;cin>>a>>b;
cout<<(a-b)/a*100<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
double c=(a-b)*100.0/a;
cout<<fixed<<setprecision(3)<<c<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <int> vi;
typedef pair <int,int> ii;
const int mod = 1e9 + 7;
const ll INF = 3e18;
const double EPSILON = 1e-9;
const int N = 2e6+5;
int main(){
fastio;
int n;
cin >> n;
double ans = 0;
for(int i = n-1; i >= 1; i--){
ans += (double)n/(double)i;
}
cout << fixed << setprecision(9) << ans << '\n';
return 0;
}
// DOES IT HAVE OVERFLOW ?
// DOES IT HAVE INVALID MEMO ACESS ? | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pf push_front
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x) __builtin_ctz(x)
#define setbitsll(x) __builtin_popcountll(x)
#define zerobitsll(x) __builtin_ctzll(x)
#define ps(x,y) fixed<<setprecision(y)<<x
typedef vector<int> vi;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
typedef map<int,int> mii;
const int MOD = 1e9+7;
const ld PI = acos((ld)-1);
void solve () {
int x;
cin >> x;
if (x < 0) {
cout << 0 << '\n';
} else {
cout << x << '\n';
}
}
int main () {
#ifndef ONLINE_JUDGE
freopen("input1.txt","r",stdin);
freopen("output1.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
vector<vector<int>> cyancheck(51, vector<int>(51));
cyancheck.at(x).at(y) = 1;
int k = 2;
vector<vector<int>> cyanmond(51, vector<int>(51));
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 50; j++) {
cin >> cyanmond.at(i).at(j);
if(!(j == 0)){
if(cyanmond.at(i).at(j) == cyanmond.at(i).at(j - 1)){
cyancheck.at(i).at(j) = k;
cyancheck.at(i).at(j - 1) = k;
k++;
}
}
if(!(i == 0)){
if(cyanmond.at(i).at(j) == cyanmond.at(i - 1).at(j)){
cyancheck.at(i).at(j) = k;
cyancheck.at(i - 1).at(j) = k;
k++;
}
}
}
}
if(x > 25 && y < 25){
if(!(cyanmond.at(x).at(y) == cyanmond.at(x - 1).at(y)) && !(cyancheck.at(x - 1).at(y) == 1)){
cout << "U";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x - 1).at(y) = 1;
x = x - 1;}
if(!(cyanmond.at(x).at(y) == cyanmond.at(x).at(y + 1)) && !(cyancheck.at(x).at(y + 1) == 1)){
cout << "R";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x).at(y + 1) = 1;
y = y + 1;
}
}
if(x <= 25 && y < 25){
if(!(cyanmond.at(x).at(y) == cyanmond.at(x + 1).at(y)) && !(cyancheck.at(x + 1).at(y) == 1)){
cout << "D";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x + 1).at(y) = 1;
x = x + 1;}
if(!(cyanmond.at(x).at(y) == cyanmond.at(x).at(y + 1)) && !(cyancheck.at(x).at(y + 1) == 1)){
cout << "R";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x).at(y + 1) = 1;
y = y + 1;
}
}
if(x > 25 && y >= 25){
if(!(cyanmond.at(x).at(y) == cyanmond.at(x - 1).at(y)) && !(cyancheck.at(x - 1).at(y) = 1)){
cout << "U";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x - 1).at(y) = 1;
x = x - 1;}
if(!(cyanmond.at(x).at(y) == cyanmond.at(x).at(y - 1)) && !(cyancheck.at(x).at(y - 1) == 1)){
cout << "L";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x).at(y + 1) = 1;
y = y + 1;
}
}
if(x <= 25 && y >= 25){
if(!(cyanmond.at(x).at(y) == cyanmond.at(x + 1).at(y)) && !(cyancheck.at(x + 1).at(y) == 1)){
cout << "D";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x + 1).at(y) = 1;
x = x + 1;}
if(!(cyanmond.at(x).at(y) == cyanmond.at(x).at(y - 1)) && !(cyancheck.at(x).at(y - 1) == 1)){
cout << "L";
cyancheck.at(x).at(y) = 1;
cyancheck.at(x).at(y - 1) = 1;
y = y - 1;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int beamwidth = 300;
const double TL=1.9;
double start;
int n=50;
int sx, sy;
VVI t(n,VI(n));
VVI p(n,VI(n));
struct status{
int x;
int y;
int score;
int eval;
VI path;
VI used;
bool operator<(const status &another) const {return eval < another.eval;};
};
vector<status> search(const status &base){
vector<status> res;
REP(i,4){
int tox=base.x+dx[i];
int toy=base.y+dy[i];
if(tox<0||tox>=n||toy<0||toy>=n)
continue;
if(base.used[t[tox][toy]])
continue;
int anotp=p[tox][toy];
REP(j,4){
int toox=tox+dx[j];
int tooy=toy+dy[j];
if(toox<0||toox>=n||tooy<0||tooy>=n)
continue;
if(t[tox][toy]==t[toox][tooy]){
anotp=p[toox][tooy];
break;
}
}
int newscore=base.score+p[tox][toy]+max(0,p[tox][toy]-anotp);
int dlx=min(tox,49-tox), dly=min(toy,49-toy);
int neweval=newscore-(3*(dlx+dly)+min(dlx,dly))*100;
res.push_back((status){tox,toy,newscore,neweval,base.path,base.used});
res[res.size()-1].used[t[tox][toy]]=1;
res[res.size()-1].path.push_back(i);
}
return res;
}
int main(){
start=clock();
cin >> sx >> sy;
int maxt=0;
REP(i,n)REP(j,n){
cin >> t[i][j];
maxt=max(maxt,t[i][j]);
}
REP(i,n)REP(j,n) cin >> p[i][j];
priority_queue<status> que;
VI initused(maxt+1,0); initused[t[sx][sy]]=1;
que.push({sx,sy,p[sx][sy],0,VI(0),initused});
int maxscore=0; VI ans;
while(1){
priority_queue<status> nxtque;
VVI mxs(n,VI(n,0));
while(nxtque.size()<beamwidth){
if(que.empty())
break;
if(que.top().score>maxscore){
maxscore=que.top().score;
ans=que.top().path;
}
vector<status> res=search(que.top());
for(auto j:res){
if(mxs[j.x][j.y]<10){
mxs[j.x][j.y]++;
nxtque.push(j);
}
}
que.pop();
}
que=nxtque;
double tim=(double)(clock()-start)/CLOCKS_PER_SEC/TL;
if(tim>=1.0||que.empty())
break;
}
string dir="DRUL";
for(auto i:ans)
cout << dir[i];
cout << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define PI 3.141592653589793238462
#define sz(x) ((int)(x).size())
#define mod 1000000007
#define forn(i,n) for(ll i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double lld;
//////////////////////////////////// DEBUGGER ///////////////////////////////////////////
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; debugger(x); cerr << endl;
#else
#define debug(x)
#endif
void debugger(ll t) {cerr << t;}void debugger(int t) {cerr << t;}void debugger(string t) {cerr << t;}void debugger(char t) {cerr << t;}void debugger(lld t) {cerr << t;}void debugger(double t) {cerr << t;}void debugger(ull t) {cerr << t;}template <class T, class V> void debugger(pair <T, V> p);template <class T> void debugger(vector <T> v);template <class T> void debugger(set <T> v);template <class T, class V> void debugger(map <T, V> v);template <class T> void debugger(multiset <T> v);template <class T, class V> void debugger(pair <T, V> p) {cerr << "{"; debugger(p.pf); cerr << ","; debugger(p.ps); cerr << "}";}template <class T> void debugger(vector <T> v) {cerr << "[ "; for (T i : v) {debugger(i); cerr << " ";} cerr << "]";}template <class T> void debugger(set <T> v) {cerr << "[ "; for (T i : v) {debugger(i); cerr << " ";} cerr << "]";}template <class T> void debugger(multiset <T> v) {cerr << "[ "; for (T i : v) {debugger(i); cerr << " ";} cerr << "]";}template <class T, class V> void debugger(map <T, V> v) {cerr << "[ "; for (auto i : v) {debugger(i); cerr << " ";} cerr << "]";}
ll gcd(ll a,ll b) {if(b==0 || a==0) return max(a,b);return gcd(b,a%b);}
//////////////////////////////////// JAI SHREE RAM /////////////////////////////////////
const ll N=1e5+5;
void JAISHREERAM()
{
ll n,ans=0;
cin>>n;
vector<pair<double,double>> a(n);
forn(i,n)
{
ll x;
cin>>x>>a[i].pf>>a[i].ps;
if(x==2) a[i].ps-=0.000001;
else if(x==3) a[i].pf+=0.000001;
else if(x==4) a[i].pf+=0.000001,a[i].ps-=0.000001;
}
n=sz(a);
sort(all(a));
forn(i,n)
{
for(int j=i+1;j<n;j++)
{
if(a[j].pf>a[i].ps) continue;
ans++;
}
}
cout<<ans;
}
int main()
{
fast;
int T=1;
// cin>>T;
for(int t=1;t<=T;t++)
{
// codejam
JAISHREERAM();
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cinttypes>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<stack>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vpii=vector<pii>;
#define PI 3.1415926535897932384626433832795
template<typename X>
bool max_u(X&m, X v)
{
if(m<v)
{
m=v;
return true;
}
return false;
}
template<typename X>
bool min_u(X&m, X v)
{
if(m>v)
{
m=v;
return true;
}
return false;
}
struct solve
{
solve(){}
ll operator()() {
return 0;
}
};
struct range_t
{
int l, r;
};
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
for(;;)
{
cin >> n;
if(cin.fail()) break;
vpii range(n);
for(int i=0;i<n;i++)
{
int t, l, r;
cin >> t >> l >> r;
l*=2;
r*=2;
switch(t)
{
case 1: break;
case 2: r--; break;
case 3: l++; break;
case 4: l++; r--; break;
}
range[i]=make_pair(l, r);
}
sort(range.begin(), range.end());
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(range[i].second>=range[j].first) ans++;
}
}
cout << ans << "\n";
}
return 0;
}
|
// Enjoy your stay. Code by evima
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using lll = __int128;
using vl = vector<ll>;
using LOOPVAR_TYPE = ll;
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define sz(x) ll((x).size())
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rep1(i, n) rep2(i, 0, n)
#define rep2(i, a, b) for(LOOPVAR_TYPE i = LOOPVAR_TYPE(a); i < LOOPVAR_TYPE(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define eb emplace_back
#define fir first
#define sec second
#define mp make_pair
#define mt make_tuple
const ld EPS = 1e-9;
const ld PI = 3.14159265358979323846L;
const ll INF = 1070000000LL;
const ll MOD = 998244353LL;// 1000000007LL;
void fast_io() { cin.tie(NULL); ios_base::sync_with_stdio(false); }
ll lin() { ll x; cin >> x; return x; }
string input() { string s; cin >> s; return s; }
vl vin(int n) { vector<ll> v(n); rep(i, n) cin >> v[i]; return v; }
template<class T> bool chmin(T& a, const T& b) { return (b < a) ? (a = b, true) : false; }
template<class T> bool chmax(T& a, const T& b) { return (a < b) ? (a = b, true) : false; }
template<class T> map<T, ll> freq(const vector<T>& v){ map<T, ll> ret; for(T x: v) ++ret[x]; return ret; }
template<class T> vector<T> reversed(vector<T> v) { reverse(all(v)); return v; }
template<class T> vector<T> sorted(vector<T> v) { sort(all(v)); return v; }
template<class T> vector<T> sub(const vector<T>& v, int from, int to) { vector<T> ret; copy(&v[from], &v[to], back_inserter(ret)); return ret; }
template<class T> string str(const T& x, int prec = 20) { stringstream ss; ss << setprecision(prec) << x; return ss.str(); }
template<class T> string str(const vector<T>& v, int prec = 20) { stringstream ss; ss << setprecision(prec); rep(i, sz(v)) ss << v[i] << (i < sz(v) - 1 ? " " : ""); return ss.str(); }
template<class T> void print1(T&& x, const string& end) { cout << str(x) << end; }
void print() { print1("", "\n"); }
template<class T, class... U> void print(T&& head, U&&... tail) { print1(head, " "); print(forward<U>(tail)...); }
template<class T> void eprint1(T&& x, const string& end) { cout << str(x) << end; }
void eprint() { eprint1("", "\n"); }
template<class T, class... U> void eprint(T&& head, U&&... tail) { eprint1(head, " "); eprint(forward<U>(tail)...); }
template<class... T> void quit(T&&... x) { print(forward<T>(x)...); exit(0); }
void yn(bool cnd, const string& yes = "Yes", const string& no = "No") { if(cnd) print(yes); else print(no); }
void zip(vl& v) { vl w = v; sort(all(w)); int n = unique(all(w)) - w.begin(); for(ll& x: v) x = lower_bound(&w[0], &w[n], x) - &w[0]; }
vl zipped(vl v) { zip(v); return v; }
map<ll, ll> zipmap(vl v) { map<ll, ll> ret; sort(all(v)); v.erase(unique(all(v)), v.end()); rep(i, sz(v)) ret[v[i]] = i; return ret; }
ll N, M, w[8], l[100010], v[100010];
pair<ll, ll> p[100010];
ll dp[8];
ll solve(vl u){
fill(dp, dp + N, 0);
rep(i, N){
ll sum = u[i];
rep(j, i + 1, N){
sum += u[j];
int pos = lower_bound(v, v + M + 1, sum) - v - 1;
chmax(dp[j], dp[i] + l[pos]);
}
}
return dp[N - 1];
}
void solveOne(){
cin >> N >> M;
rep(i, N) cin >> w[i];
ll maxw = *max_element(w, w + N);
rep(i, M){
cin >> l[i] >> v[i];
if(v[i] < maxw) quit(-1);
}
rep(i, M) p[i] = {v[i], l[i]};
sort(p, p + M + 1);
rep(i, M) chmax(p[i + 1].sec, p[i].sec);
rep(i, M + 1) v[i] = p[i].fir, l[i] = p[i].sec;
ll ans = INF;
vl perm(N);
rep(i, N) perm[i] = i;
do{
vl u(N);
rep(i, N) u[i] = w[perm[i]];
chmin(ans, solve(u));
}while(next_permutation(all(perm)));
print(ans);
}
int main(){
fast_io();
int num_tc = 1;
// cin >> num_tc;
rep(tc, 1, num_tc + 1){
// cout << "Case #" << tc << ": " ;// << endl;
solveOne();
}
} | #include <random>
#include "bits/stdc++.h"
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld eps = 1e-12;
constexpr int inf = numeric_limits<int>::max() / 2;
constexpr ll mod = 1e9 + 7;
mt19937_64 rnd{random_device()()};
template <typename T>
void printv(const vector<T> &v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v[i] << " \n"[i == sz - 1];
}
}
const int MAX_L = 100000010;
vector<int> cap(MAX_L, inf);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
sort(w.begin(), w.end());
for (int i = 0; i < m; i++) {
int l, v;
cin >> l >> v;
cap[l - 1] = min(cap[l - 1], v);
}
for (int i = MAX_L - 2; i >= 0; i--) {
cap[i] = min(cap[i], cap[i + 1]);
}
{
auto ma = *max_element(w.begin(), w.end());
if (cap[0] < ma) {
cout << -1 << endl;
return 0;
}
}
ll ans = 1e15;
do {
vector<vector<ll>> sum(n, vector<ll>(n));
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
for (int k = i; k <= j; k++) sum[i][j] += w[k];
}
}
vector<vector<ll>> dp(n, vector<ll>(n, 0));
for (int len = 1; len <= n - 1; len++) {
for (int x = 0; x + len < n; x++) {
int y = x + len;
ll mi = 0;
for (int k = x + 1; k < y; k++) {
mi = max(mi, dp[x][k] + dp[k][y]);
}
auto itr = lower_bound(cap.begin(), cap.end(), sum[x][y]);
int pos = distance(cap.begin(), itr);
dp[x][y] = max(mi, ll(pos));
}
}
ans = min(ans, dp[0][n - 1]);
} while (next_permutation(w.begin(), w.end()));
cout << ans << endl;
}
|
//Har Har Mahadev
using namespace std;
#include <bits/stdc++.h>
#define booga cerr << "booga" << endl
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define safai(...) Clearing_out(__VA_ARGS__)
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(char c) {
string s;
s += c;
return s;
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "1" : "0");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
void Clearing_out() { return; }
template <typename Head, typename... Tail>
void Clearing_out(Head &H, Tail & ... T) {
H.clear();
Clearing_out(T...);
}
int dp[61][61];
int NCR(int n, int r)
{
if(dp[n][r] != -1) return dp[n][r];
if (r == 0) return dp[n][r] = 1;
/*
Extra computation saving for large R,
using property:
N choose R = N choose (N-R)
*/
if (r > n / 2) return dp[n][r] = NCR(n, n - r);
int res = 1;
for (int k = 1; k <= r; ++k)
{
res *= n - k + 1;
res /= k;
}
return dp[n][r] = res;
}
void testcase(){
memset(dp, -1, sizeof(dp));
for(int i = 1; i <= 60; i++){
for(int j = 1; j <= i; j++){
NCR(i, j);
}
}
//cout << NCR(3, 2);
dp[0][0] = 1;
int a, b, k;
cin >> a >> b >> k;
string ans;
int sz = a+b;
function<void()> solve = [&](){
if(sz == ans.size()) return;
int sub = 0;
int i = 0;
for(i = 1; i <= a; i++){
if(sz == ans.size()) return;
int lol = dp[a+b-i][b];
if(i == 30) debug(k, lol, a+b-i, b);
// debug(lol, k, a+b-i, b);
if(k <= lol) ans.push_back('a');
else{
sub = lol;
break;
}
}
a -= (i-1);
k -= sub;
if(ans.size() == sz) return;
ans.push_back('b'), b--;
//debug(a, b);
solve();
};
solve();
//debug(nb, ans.size());
cout << ans << '\n';
}
int32_t main(){
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
// cin >> tt;
while(tt--){
testcase();
}
return 0;
}
| #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,avx512f,avx512bw,avx512bitalg")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define rep(x,start,end) for(int x=start;x!=end;x++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int B,m;
bool bad[25][25];
int ind[1050000];
int ahat[1050000][21];
int bhat[1050000][21];
ll hat[1050000][21];
void conv(){
for (int x=0;x<1048576;x++) {
ahat[x][__builtin_popcount(x)]=ind[x];
bhat[x][__builtin_popcount(x)]=ind[x];
}
rep(bit,0,20){
for (int x=0;x<1048576;x++) if (x&(1<<bit)){
rep(cnt,0,21){
ahat[x][cnt]+=ahat[x^(1<<bit)][cnt];
bhat[x][cnt]+=bhat[x^(1<<bit)][cnt];
}
}
}
for (int x=0;x<1048576;x++){
rep(cnt,0,21){
rep(cnt2,0,cnt+1){
hat[x][cnt]+=(ll)ahat[x][cnt2]*bhat[x][cnt-cnt2];
}
}
}
rep(bit,0,20){
for (int x=0;x<1048576;x++) if (x&(1<<bit)){
rep(cnt,0,21){
hat[x][cnt]-=hat[x^(1<<bit)][cnt];
}
}
}
memset(ahat,0,sizeof(ahat));
memset(bhat,0,sizeof(bhat));
for (int x=0;x<1048576;x++){
ahat[x][__builtin_popcount(x)]=ind[x];
bhat[x][__builtin_popcount(x)]=hat[x][__builtin_popcount(x)];
}
memset(hat,0,sizeof(hat));
rep(bit,0,20){
for (int x=0;x<1048576;x++) if (x&(1<<bit)){
rep(cnt,0,21){
ahat[x][cnt]+=ahat[x^(1<<bit)][cnt];
bhat[x][cnt]+=bhat[x^(1<<bit)][cnt];
}
}
}
for (int x=0;x<1048576;x++){
rep(cnt,0,21){
rep(cnt2,0,cnt+1){
hat[x][cnt]+=(ll)ahat[x][cnt2]*bhat[x][cnt-cnt2];
}
}
}
rep(bit,0,20){
for (int x=0;x<1048576;x++) if (x&(1<<bit)){
rep(cnt,0,21){
hat[x][cnt]-=hat[x^(1<<bit)][cnt];
}
}
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>B>>m;
int a,b;
rep(x,0,m){
cin>>a>>b;
a--,b--;
bad[a][b]=bad[b][a]=true;
}
ind[0]=1;
rep(x,1,1<<B){
int temp=__builtin_ctz(x);
int nx=x^(1<<temp);
ind[x]=ind[nx];
rep(bit,0,B) if (nx&(1<<bit) && bad[temp][bit]){
ind[x]=0;
}
}
conv();
cout<<hat[(1<<B)-1][B]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int (1e9) + int (1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 + 7;
const double EPS = 1e-9;
#define FOR(i,n) for (int i=0;i<(n);++i)
#define ROF(i,x) for(int i = (x) ; i >= 0 ; --i)
#define MP make_pair
#define all(a) (a).begin(),(a).end()
#define ODD(x) ( ((x)&1)==0?0:1 )
#define SIGN(x) ( ((x) > 0) - ((x) < 0) )
#define dbg(...) cerr << #__VA_ARGS__ << ": " << (__VA_ARGS__) << endl
std::mt19937_64 generator(std::chrono::system_clock::now().time_since_epoch().count());
inline ll powmod(ll a,ll b,ll mod) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll lcm(ll a, ll b) { return a / __gcd(a,b) * b; }
void READ(bool _local){
ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef _DEBUG
if (_local)
freopen ("in.txt", "r", stdin);
#endif
}
#define SI() (cout << "Yes\n")
#define NO() (cout << "No\n")
void solve(){
}
int main() {
READ(0);
int n,k;cin>>n>>k;
vvi a(n,vi(n));
vi b(n*n);
FOR(i,n){
FOR(j,n) {
cin>>a[i][j];
b[i*n+j]=a[i][j];
}
}
sort(all(b));
int lo=0,hi=n*n-1;
const int A=(k*k+1)/2;
while(lo<hi){
int mid=(lo+hi)/2;
vvi x(n,vi(n));
FOR(i,n)FOR(j,n) x[i][j]=a[i][j]<=b[mid];
for(int j=1;j<n;++j) x[0][j] += x[0][j-1];
for(int i=1;i<n;++i) x[i][0] += x[i-1][0];
for(int i=1;i<n;++i){
for(int j=1;j<n;++j){
x[i][j] += x[i-1][j] + x[i][j-1] - x[i-1][j-1];
}
}
int cnt=-1;
for(int i=k-1;i<n && cnt<A;++i){
for(int j=k-1;j<n;++j){
cnt = x[i][j];
if (i-k>=0) cnt -= x[i-k][j];
if (j-k>=0) cnt -= x[i][j-k];
if (i-k>=0 && j-k>=0) cnt += x[i-k][j-k];
if (cnt>=A) break;
}
}
if (cnt>=A) hi=mid;
else lo=mid+1;
}
cout << b[lo];
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <vector <int> > a(n, vector <int> (n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> a[i][j];
int left = -1, right = 1000000000, mid;
while (left < right - 1)
{
mid = (left + right) / 2;
vector <vector <int> > b(n, vector <int> (n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
b[i][j] = a[i][j] <= mid;
vector <vector <int> > pref_sum(n, vector <int> (n));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i == 0 && j == 0)
pref_sum[0][0] = b[0][0];
else if (i == 0)
pref_sum[i][j] = pref_sum[i][j - 1] + b[i][j];
else if (j == 0)
pref_sum[i][j] = pref_sum[i - 1][j] + b[i][j];
else
pref_sum[i][j] = pref_sum[i - 1][j] + pref_sum[i][j - 1] - pref_sum[i - 1][j - 1] + b[i][j];
int flag = 0;
for (int i = 0; i + k <= n; i++)
for (int j = 0; j + k <= n; j++)
{
int cur_sum;
if (i == 0 && j == 0)
cur_sum = pref_sum[k - 1][k - 1];
else if (i == 0)
cur_sum = pref_sum[k - 1][j + k - 1] - pref_sum[k - 1][j - 1];
else if (j == 0)
cur_sum = pref_sum[i + k - 1][k - 1] - pref_sum[i - 1][k - 1];
else
cur_sum = pref_sum[i + k - 1][j + k - 1] - pref_sum[i - 1][j + k - 1] - pref_sum[i + k - 1][j - 1] + pref_sum[i - 1][j - 1];
if (cur_sum >= (k * k + 1) / 2)
flag = 1;
}
if (flag)
right = mid;
else
left = mid;
}
cout << right;
} |
#include <bits/stdc++.h>
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
struct Iter {
usize itr;
constexpr Iter(const usize pos) noexcept : itr(pos) {}
constexpr void operator++() noexcept { ++itr; }
constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
constexpr usize operator*() const noexcept { return itr; }
};
const Iter first, last;
public:
explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
constexpr Iter begin() const noexcept { return first; }
constexpr Iter end() const noexcept { return last; }
};
template <class T> using Vec = std::vector<T>;
void main_() {
usize N;
std::cin >> N;
Vec<usize> P(N);
for (auto& x : P) {
std::cin >> x;
x -= 1;
}
if (std::is_sorted(P.begin(), P.end())) {
std::cout << 0 << '\n';
std::cout << '\n';
return;
}
if (N == 2) {
std::cout << 1 << '\n';
std::cout << 1 << '\n';
return;
}
Vec<usize> ans;
ans.reserve(N * N);
const auto add = [&](const usize i) {
assert(ans.size() % 2 == i % 2);
assert(i + 1 < N);
ans.push_back(i);
std::swap(P[i], P[i + 1]);
};
for (const auto i : rep(0, N - 3)) {
usize k = 0;
while (P[k] != i) {
k += 1;
}
if (k == i) {
continue;
}
std::cerr << k << std::endl;
if (ans.size() % 2 != (k - 1) % 2) {
if (k == N - 1) {
add(k - 2);
} else {
add(k);
add(k - 1);
k += 1;
}
}
while (k != i) {
add(k - 1);
k -= 1;
}
}
std::array<usize, 2> idx;
idx[0] = N - 3;
idx[1] = N - 2;
if (idx[0] % 2 != ans.size() % 2) {
std::swap(idx[0], idx[1]);
}
while (!std::is_sorted(P.begin(), P.end())) {
add(idx[0]);
std::swap(idx[0], idx[1]);
}
assert(std::is_sorted(P.begin(), P.end()));
assert(ans.size() <= N * N);
std::cout << ans.size() << '\n';
for (const auto i : rep(0, ans.size())) {
if (i > 0) {
std::cout << ' ';
}
std::cout << ans[i] + 1;
assert(ans[i] % 2 == i % 2);
}
std::cout << '\n';
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
usize cases;
std::cin >> cases;
while (cases--) main_();
return 0;
}
| #include<bits/stdc++.h>
#define LL long long
#define DB double
#define pb push_back
#define mkp make_pair
#define LB lower_bound
#define UB upper_bound
#define rint register int
#define MS(x,y) memset(x,y,sizeof(x))
#define rep(i,a,b) for(rint i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(rint i=a,i##end=b;i>=i##end;--i)
#define cms printf("%.2lf\n",(&o2-&o1)/1024.0/1024)
using namespace std;bool o1;
char IO;
inline int Rd(){
int _s_=0;
bool _f_=0;
while(!isdigit(IO=getchar()))
IO=='-'&&(_f_=1);
do _s_=(_s_<<1)+(_s_<<3)+(IO^48);
while(isdigit(IO=getchar()));
return _f_?-_s_:_s_;
}
int n,p,o,ans[250004],a[505],t,tt;
void DO(int x){
ans[++o]=x;
swap(a[x],a[x+1]);
p^=1;
}
bool o2;int main(){
rep(T,1,Rd()){
n=Rd();
rep(i,1,n)
a[i]=Rd();
if(n==2){
if(a[1]==1)
printf("0\n\n");
else printf("1\n1\n");
continue;
}
p=1;
o=0;
rep(i,1,n-2){
if(a[i]==i)
continue;
rep(j,i+1,n)
if(a[j]==i)
t=j;
if(t%2==p){
if(t>i+1)
DO(t-2);
else {
DO(t),DO(t-1);
t++;
}
}
drep(j,t-1,i)
DO(j);
}
if(a[n]!=n){
if(n%2==p){
DO(n-2);
DO(n-1);
DO(n-2);
DO(n-1);
DO(n-2);
}
else DO(n-1);
}
printf("%d\n",o);
rep(i,1,o)
printf("%d ",ans[i]);
puts("");
}
return 0;
} |
/*
Author : Ritesh Singh
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ff first
#define ss second
#define f(i,n) for (int i=0;i<n;i++)
#define fa(i,a,b) for (int i=a;i<b;i++)
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define vi vector<int>
#define vll vector<long long>
#define pi pair<int,int>
#define all(x) x.begin(),x.end()
const ll inf = 1e9;
const ll mod = 1000000007;
typedef tree<pair<ll, int>, null_type, less<pair<ll, int>>, rb_tree_tag, tree_order_statistics_node_update> pbds;
//Ordered set
//pbds s1
int32_t main()
{
fast;
ll T;
T = 1;
// cin>>T;
while(T--){
ll n; cin>>n;
ll arr[n];
f(i, n) cin>>arr[i];
ll ans = 0;
f(i, n){
ll x = arr[i], j;
for(j = i; j<n; j++){
x = min(x, arr[j]);
ans = max(ans, x*(j-i+1));
}
}
cout<<ans<<"\n";
}
return 0;
} | #include <bits/stdc++.h>
#define N 200005
using namespace std;
void solve(){
int n;
cin >> n;
int arr[n];
for(int i=0;i<n;i++){
cin >> arr[i];
}
int ans = 0;
for(int i=0;i<n;i++){
int now = 0;
for(int j=i;j>=0;j--){
if(arr[j]>=arr[i])
now+=arr[i];
else
break;
}
for(int j=i+1;j<n;j++){
if(arr[j]>=arr[i]){
now+=arr[i];
}
else{
break;
}
}
ans = max(ans,now);
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t=1;
//cin>>t;
while(t--){
solve();
}
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
} |
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=1e2+10;
int arr[maxn];
string s;
int n;
bool judge(int x){
for(int i=0;i<n;i++){
int a=arr[i]/x,b=arr[i+1]/x;
int aa=arr[i]%x,bb=arr[i+1]%x;
if(s[i]=='<'){
if(a>=b) return false;
if(b-a==1){
if(aa>bb) return false;
}
}
else{
if(a<=b) return false;
if(a-b==1){
if(aa<bb) return false;
}
}
}
return true;
}
int main()
{
cin>>n;
cin>>s;
for(int i=0;i<=n;i++) scanf("%d",arr+i);
int l=0,r=20000;
int x=0;
while(l<=r){
int mid=(l+r)>>1;
//cout<<l<<","<<r<<":"<<mid<<endl;
if(!mid||judge(mid)){
x=max(x,mid);
l=mid+1;
}
else r=mid-1;
}
printf("%d\n",x);
for(int i=0;i<x;i++){
for(int j=0;j<=n;j++)
printf("%d ",arr[j]/x+(i<arr[j]%x));
putchar('\n');
}
return 0;
}
/*
3
<><
3 8 6 10
3
<><
8 3 6 10
*/
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
#define sq(n) (n)*(n)
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using pi=pair<int,int>;
using vp=vector<pi>;
const int mod=1e9+7;
// const int mod=998244353;
const string sp=" ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(12);
}
signed main(){
init();
run();
return 0;
}
void run(){
int n;
string s;
cin>>n>>s;
n++;
vi a(n);
rep(i,n)cin>>a[i];
int k=inf;
rep(i,n-1)k=min(k,abs(a[i]-a[i+1]));
cout<<k<<endl;
vvi b(k,vi(n));
rep(j,n){
rep(i,k)b[i][j]=a[j]/k;
int t=a[j]%k;
rep(i,t)b[i][j]++;
}
rep(i,k){
rep(j,n)cout<<b[i][j]<<sp;cout<<endl;
}
} |
/*Author-Nilesh Chandra(isocyanide7)*/
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define dd double
#define pb push_back
#define ff first
#define ss second
#define Mp make_pair
const ll Mod=1000000007;
const ll INF=999999999999999999;
const ll NN=(ll)(1e6+5);
ll min(ll x,ll y){if(x<y) return x;return y;}
ll max(ll x,ll y){if(x>y) return x;return y;}
ll power(ll x,unsigned ll y)
{
if (y==0)
return 1;
else if (y%2==0)
return power(x,y/2)*power(x,y/2);
else
return x*power(x,y/2)*power(x,y/2);
}
ll hcf(ll a,ll b)
{
if(b==0)
return a;
return hcf(b,a%b);
}
int main()
{
fio;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif*/
ll TT=1;
//cin>>TT;
while(TT--)
{
ll n,i,j,ans=0;
cin>>n;
vector <ll> v(n);
map <ll,ll> mp;
for(auto &u:v)
cin>>u,mp[u+200]++;
for(i=0;i<=400;i++)
for(j=i+1;j<=400;j++)
ans+=mp[i]*mp[j]*(i-j)*(i-j);
cout<<ans;
}
} | //https://atcoder.jp/contests/zone2021/tasks/zone2021_c
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool chk(vector<vector<int>> &arr, int mid)
{
int n=arr.size();
set<int> st;
for (int i = 0; i < n; i++)
{
int c=0;
for (int j = 0; j < 5; j++)
{
int bit=0;
if(arr[i][j]>=mid) bit=1;
c+=(bit<<j);
}
st.insert(c);
}
for(auto e:st)
for(auto f:st)
for(auto g:st)
{
if((e|f|g)==31)
return 1;
}
return 0;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(5, 0));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 5; j++)
cin >> arr[i][j];
}
int l = 1, r = 1e9 + 1;
while (l < r)
{
int mid = (l + r)/2;
if(chk(arr,mid)) l=mid+1;
else r=mid;
}
cout<<l-1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
struct IOSetup{
IOSetup(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(12);
}
} iosetup;
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
for(T &x:v)is>>x;
return is;
}
signed main(){
int H,W,A,B;
cin>>H>>W>>A>>B;
int D=H*(W-1)+(H-1)*W;
vector<vector<int>> v(H,vector<int>(W,0));
int res=0;
for(int bit=0;bit<(1<<D);bit++){
if(__builtin_popcount(bit)!=A) continue;
rep(i,H)rep(j,W) v[i][j]=0;
rep(j,W-1)rep(i,H){
int idx=(W-1)*i+j;
if((bit>>idx)&1){
v[i][j]++;
v[i][j+1]++;
}
}
rep(i,H-1)rep(j,W){
int idx=H*(W-1)+W*i+j;
if((bit>>idx)&1){
v[i][j]++;
v[i+1][j]++;
}
}
bool f=true;
rep(i,H)rep(j,W)if(v[i][j]>1) f=false;
res+=f;
}
cout<<res<<endl;
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>;
// vector<vector<bool>> used;
int h, w, a, b;
vector<vector<bool>> used;
int rec(int i, int j, vector<vector<bool>> &used, int a, int b) {
if (j == w) return rec(i+1, 0, used, a, b);
if (i == h) return 1;
if (used[i][j]) return rec(i, j+1, used, a, b);
int res = 0;
used[i][j] = true;
if (j+1 < w && !used[i][j+1] && a!=0) {
used[i][j+1] = true;
res += rec(i, j+1, used, a-1, b);
used[i][j+1] = false;
}
if (i+1 < h && !used[i+1][j] && a!=0) {
used[i+1][j] = true;
res += rec(i, j+1, used, a-1, b);
used[i+1][j] = false;
}
if (b!=0) {
res += rec(i, j+1, used, a, b-1);
}
used[i][j] = false;
return res;
}
int main() {
cin >> h >> w >> a >> b;
used.assign(h,vector<bool>(w));
int ans = rec(0, 0, used, a, b);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}
template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
for(auto &e:u) fill_v<T>(e,v...);
}
template <typename F>
class
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
FixPoint final : private F
{
public:
template <typename G>
explicit constexpr FixPoint(G&& g) noexcept
: F{std::forward<G>(g)}
{}
template <typename... Args>
constexpr decltype(auto)
operator()(Args&&... args) const
#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9
noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))
#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9
{
return F::operator()(*this, std::forward<Args>(args)...);
}
}; // class FixPoint
#if defined(__cpp_deduction_guides)
template <typename F>
FixPoint(F&&)
-> FixPoint<std::decay_t<F>>;
#endif // defined(__cpp_deduction_guides)
namespace
{
template <typename F>
#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)
# if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)
_Check_return_
# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)
inline constexpr decltype(auto)
makeFixPoint(F&& f) noexcept
{
return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};
}
} // namespace
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int64 H, W;
cin >> H>> W;
vector<string> A(H);
REP(i, H) {
cin >> A[i];
}
auto dp = make_v<int64>(H, W);
fill_v<int64>(dp, -INF_LL);
auto visited = make_v<int>(H, W);
auto valid = [&](int y, int x) {
return 0<=y&&y<H&&0<=x&&x<W;
};
auto dfs = makeFixPoint([&](auto &&dfs, int y, int x) -> int64 {
if (visited[y][x]) return dp[y][x];
if (y == H-1 && x == W-1) {
return 0;
}
visited[y][x] = 1;
if (valid(y + 1, x)) chmax(dp[y][x], -dfs(y + 1, x) + (A[y+1][x] == '+' ? 1 : 0));
if (valid(y, x + 1)) chmax(dp[y][x], -dfs(y,x + 1) + (A[y][x + 1] == '+' ? 1 : 0));
// cout << y << " " << x << ": " << dp[y][x] << endl;
return dp[y][x];
});
int64 res = dfs(0, 0);
// cout << res << endl;
if (res > 0) {
cout << "Takahashi" << endl;
} else if (res < 0) {
cout << "Aoki" << endl;
} else {
cout << "Draw" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define mxn 1005
#define mxm 105
#define f first
#define s second
#define pb push_back
#define es " "
#define endl '\n'
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define ll long long
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
typedef pair<ll, ll> pii;
typedef pair<pii, int> pip;
int n, m, a, b, memo[20][20];
int solve(int i, int j, int x, int y, int cont){
if(cont==n*m){
return 1;
}
if(j>m){
return solve(i+1, 1, x, y, cont);
}
if(i>n || x+y<=0){
return 0;
}
ll resp=0;
if(memo[i][j]){
return solve(i, j+1, x, y, cont);
}
if(!memo[i][j+1] && j+1<=m && x){
memo[i][j]=1;
memo[i][j+1]=1;
resp+=solve(i, j+2, x-1, y, cont+2);
memo[i][j]=0;
memo[i][j+1]=0;
}
if(!memo[i+1][j] && i+1<=n && x){
memo[i][j]=1;
memo[i+1][j]=1;
resp+=solve(i, j+1, x-1, y, cont+2);
memo[i][j]=0;
memo[i+1][j]=0;
}
if(y){
memo[i][j]=1;
resp+=solve(i, j+1, x, y-1, cont+1);
memo[i][j]=0;
}
return resp;
}
int main(){
fastio;
cin >> m >> n >> a >> b;
cout << solve(1, 1, a, b, 0) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll mod = 1000000007;
const double pi = 3.14159265358979;
const ll INF = 1e18;
int main() {
string s; cin >> s;
int a, b, c; a = b = c = 0;
rep(i, 10) {
if (s[i] == 'o') a++;
else if (s[i] == '?') b++;
else c++;
}
if (a > 4) {cout << 0 << endl; return 0;}
if (a == 4) cout << 24 << endl;
else if (a == 3) cout << 24 * b + 36 << endl;
else if (a == 2) cout << 36 * b + (24 * b * (b - 1) / 2) + 14 << endl;
else if (a == 1) cout << 14 * b + (36 * b * (b - 1) / 2) + (24 * b * (b - 1) * (b - 2) / 6) + 1 << endl;
else if (a == 0) cout << b + (14 * b * (b - 1) / 2) + (36 * b * (b - 1) * (b - 2) / 6) + (24 * b * (b - 1) * (b - 2) * (b - 3) / 24) << endl; return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
string s;
long long n=10,a[11],b[11],c[5],ans,p;
int main(){
long long i,j,u,v;
cin>>s;
for(i=0;i<n;i++){
if(s[i]=='o') a[i]=1;
if(s[i]=='x') a[i]=-1;
}
for(i=0;i<=9999;i++){
u=i;
memset(b,0,sizeof(b));
c[1]=u%10;u/=10;b[c[1]]=1;
c[2]=u%10;u/=10;b[c[2]]=1;
c[3]=u%10;u/=10;b[c[3]]=1;
c[4]=u%10;u/=10;b[c[4]]=1;
p=0;
for(j=0;j<n;j++){
if(a[j]==1 && b[j]==0){
p=1;
break;
}
if(b[j]==1 && a[j]==-1){
p=1;
break;
}
}
if(!p) ans++;
}
cout<<ans<<endl;
return 0;
} |
// #include<bits/stdc++.h>
// using namespace std;
// #define ll long long int
// #define ft first
// #define sd second
// #define pb push_back
// #define pob pop_back
// #define str string
// #define map map<ll, ll>
// #define mmap multimap<ll, ll>
// #define FIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL)
// #define stk stack<ll>
// #define vt vector<char>
// #define set set<ll>
// #define mset multiset<ll>
// int main()
// {
// ll n,m;
// cin>>n>>m;
// ll gap=m-n+1;
// ll t1=n/(gap-1);
// for(ll i=m;i>=1;i--)
// {
// if((i*t1>=n &&i*(t1+1)<=m)||(i*(t1+1)>=n && i*(t1+2)<=m))
// {
// cout<<i;
// break;
// }
// }
// }
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int findMaxGCD(ll arr[], ll n)
{
ll high = 0;
for (ll i = 0; i < n; i++)
high = max(high, arr[i]);
ll count[high + 1] = {0};
for (ll i = 0; i < n; i++)
count[arr[i]]++;
ll counter = 0;
for (ll i = high; i >= 1; i--)
{
ll 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()
{
ll a,m;
cin>>a>>m;
ll n = m-a+1;
ll arr[n];
ll k=a;
for(ll i=0;i<n;i++)
{
arr[i]=k;
k++;
}
cout << findMaxGCD(arr, n);
return 0;
} | #include <bits/stdc++.h>
using ll =long long;
using namespace std;
using Graph =vector<vector<ll> >;
int main(){
int A,B;
cin>>A>>B;
vector<int>vb(B+1);
for(int i=A;i<=B;i++){
for(int j=1;j*j<=i;j++){
if(i%j==0){
vb[j]++;
if(i/j!=j)vb[i/j]++;
}
}
}
int ans=0;
for(int i=1;i<=B;i++){
if(vb[i]>=2){
ans=max(ans,i);
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
//cout<<fixed<<setprecision(10);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//以降 cin の入力元が 'input.txt' になる
//std::ifstream in("input.txt");
//std::cin.rdbuf(in.rdbuf());
signed main() {
gearup;
ll n; cin >> n;
vpii p;
rep(i,n){
int X,Y; cin >> X >> Y;
p.push_back({X,Y});
}
sort(all(p));
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
int x1 = p[i].first;
int y1 = p[i].second;
int x2 = p[j].first - x1;
int y2 = p[j].second - y1;
int x3 = p[k].first - x1;
int y3 = p[k].second - y1;
if(x2 == 0 && x3 == 0);
else if(x2 == 0 || x3 == 0)continue;
if(y2 == 0 && y3 == 0);
else if(y2 == 0 || y3 == 0)continue;
if(y2*x3 == x2*y3){
out("Yes");
return 0;
}
}
}
}
out("No");
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all(v) v.begin(), v.end()
const string YES = "Yes";
const string NO = "No";
void solve(long long N, std::vector<long long> x, std::vector<long long> y) {
for(int i = 0; i < N; ++i) {
for(int j = 0; j < N; ++j) {
for(int k = 0; k < N; ++k) {
if(i == j || j == k || i == k) continue;
bool flag = false;
if(x[i] == x[j] || x[i] == x[k]) {
if(x[i] == x[j] && x[i] == x[k]) { flag = true; }
} else if(y[i] == y[j] || y[i] == y[k]) {
if(y[i] == y[j] && y[i] == y[k]) { flag = true; }
} else if((x[k] - x[j]) * (y[j] - y[i]) == (y[k] - y[j]) * (x[j] - x[i])) {
flag = true;
}
if(flag) {
cout << YES << endl;
return;
}
}
}
}
cout << NO << endl;
}
struct IoSetup {
IoSetup() {
// cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> x(N);
std::vector<long long> y(N);
for(int i = 0; i < N; i++) {
scanf("%lld", &x[i]);
scanf("%lld", &y[i]);
}
solve(N, std::move(x), std::move(y));
return 0;
}
|
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
template <typename T> bool chmin(T &a, const T &b) {if(a > b){a = b; return true;} return false;}
template <typename T> bool chmax(T &a, const T &b) {if(a < b){a = b; return true;} return false;}
template<typename T> void print(T a) {ll x = a; cout << x << ' ';}
template<typename A, size_t N, typename T> void Fill (A (&array)[N], const T & val) {fill ((T*)array, (T*)(array+N), val);}
V<ll> dx = {-1, 1, 0, 0, -1, -1, 1, 1};
V<ll> dy = { 0, 0, -1, 1, -1, 1, -1, 1};
ll f (string s) {
ll n = s.size();
V<ll> p(n); rep(i, n) p[i] = s[i] - '0';
sort(allr(p));
ll g1 = 0;
ll a = 1;
for (ll i = n-1; i >= 0; i--) {
g1 += p[i] * a;
a *= 10;
}
sort(all(p));
ll g2 = 0;
a = 1;
for (ll i = n-1; i >= 0; i--) {
g2 += p[i] * a;
a *= 10;
}
return g1 - g2;
}
int main () {
string s; cin >> s;
ll k; cin >> k;
if (k == 0) {
cout << s << endl;
return 0;
}
ll t;
while (k--) {
t = f(s);
s = to_string(t);
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <list>
#include <algorithm>
#define eps 10e-14
//cout<<fixed<<setprecision(15)<<
//s=to_string(100);
//vector<vector<char>>c(h,vector<char>(w));
//next_permutation(orig.begin(),orig.end());
using namespace std;
int gcd(int x,int y){
while(y>0){
int r=x%y;
x=y;
y=r;
}
return x;
}
int lcm(int a,int b){
int r=gcd(a,b);
return a*b/r;
}
template<typename T, typename U>
void primeFactorization(map<T, U> &primes, T N) {
T n=N;
U num=0;
while(n%2==0){
num++;
n/=2;
}
if(num!=0){
primes.emplace(2,num);
}
for(T i=3;i*i<=N;i+=2) {
num=0;
while(n%i==0){
num++;
n/=i;
}
if(num!=0){
primes.emplace(i, num);
}
}
if(n!=1){
primes.emplace(n,1);
}
}
template<typename TypeInt>
string Itoa(const TypeInt v, int base){
static const char table[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string ret;
static numeric_limits<TypeInt> t;
TypeInt n=v;
if(t.is_signed){
if(v<0)n*=-1;
}
while(n>=base){
ret+=table[n%base];
n/=base;
}
ret+=table[n];
if(t.is_signed){
if(v<0&&base==10)ret+='-';
}
reverse(ret.begin(),ret.end());
return ret;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main(){
unsigned long long n,a,ans=0;
map<unsigned long long,unsigned long long>m;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
m[a]++;
}
ans=(n*(n-1));
for(auto p:m)ans-=(p.second*(p.second-1));
cout<<ans/2<<endl;
} |
//wtrl,everybody hangbeat me
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,pii> piiii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef queue<char> qc;
typedef queue<string> qs;
typedef vector<char> vc;
typedef vector<string> vs;
typedef map<char,int> mpci;
typedef map<int,int> mpii;
typedef map<string,int> mpsi;
typedef set<int> sei;
typedef set<char> sec;
typedef set<string> ses;
typedef stack<ll> si;
typedef stack<char> sc;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef vector<pll> vpll;
typedef vector<pdd> vdd;
typedef unsigned int uint;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vii> vvii;
/*=====================================================================*/
#define pb push_back
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define sz(a) (int)(a.size())
#define len(a) (int)(a.length())
#define all(s) (s).begin(),(s).end()
#define fi first
#define se second
#define be begin
#define en end
#define m_p make_pair
#define repd(i,n) for(int i=n-1;i>=0;i--)
#define forn(i,p,n) for(int i=p;i<=n;i++)
#define ford(i,p,n) for(int i=n;i>=p;i--)
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();++i)
#define zero(a) memset(a,0,sizeof(a))
#define number(a,num) memeset(a,num,sizeof(a))
#define INF 1e9
#define PI acos(-1)
/*=====================================================================*/
string int_to_string(ll n)
{
string s="";
while(n)
{
ll now=n%10;
s+=now+'0';
n/=10;
}
reverse(s.begin(),s.end());
return s;
}
ll string_to_int(string s)
{
ll n=0;
rep(i,s.size())
{
n*=10;
n+=s[i]-'0';
}
return n;
}
/*======================================================================*/
ll lcm(int a,int b)
{
return a/__gcd(a,b)*b;
}
bool prime(int n)
{
if(n==0||n==1)
return false;
for(int i=2;i*i<=n;i++)
if(n%i==0)
return false;
return true;
}
string turn(int n,int k)
{
string s="";
while(n)
{
s+=(char)(n%k+'0');
n/=k;
}
reverse(s.begin(),s.end());
return s;
}
const string turn16(int n)
{
string s="";
while(n!=0)
{
if(n%16>9)
s+=(char)('A'+n%16-10);
else
s+=(char)('0'+n%16);
n/=16;
}
reverse(s.begin(),s.end());
return s;
}
/*======================================================================*/
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
const int month[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
ll h,w,k,ans,inv=1,dp[5010][5010],mod=998244353;
char a[5010][5010];
/*======================================================================*/
int main()
{
std::ios::sync_with_stdio(false);
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/
/*====================================================================*/
cin>>h>>w>>k;
int r,c;
char x;
rep(i,k)
{
cin>>r>>c>>x;
a[--r][--c]=x;
}
while(inv%3)
{
inv+=mod;
}
inv/=3;
dp[0][0]=1;
rep(i,h)
{
rep(j,w)
{
if(a[i][j]!='R'&&i+1<h)
{
dp[i+1][j]+=dp[i][j]*(a[i][j]==0?2*inv:1);
dp[i+1][j]%=mod;
}
if(a[i][j]!='D'&&j+1<w)
{
dp[i][j+1]+=dp[i][j]*(a[i][j]==0?2*inv:1);
dp[i][j+1]%=mod;
}
}
}
ans=dp[h-1][w-1];
rep(i,h*w-k)
{
ans=ans*3%mod;
}
cout<<ans<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define MOD 998244353
#define f first
#define s second
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const ll inf=1e18+5;
const int maxN=1e6+1;
ll power(ll a,int n){
if(n==0){
return 1ll;
}
if(n==1){
return a%MOD;
}
ll p=power(a,n/2);
p=(p*p)%MOD;
if(n%2==1){
p=(p*a)%MOD;
}
return p;
}
int main(){
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int h,w,k;
cin>>h>>w>>k;
int u,v,c;
char ch;
vector<vector<int>> a(h,vector<int>(w,0));
for(int i=0;i<k;i++){
cin>>u>>v>>ch;
u--;
v--;
if(ch=='R'){
c=1;
}
else if(ch=='D'){
c=2;
}
else{
c=3;
}
a[u][v]=c;
}
vector<vector<ll>> dp(h,vector<ll>(w,0));
ll inv3=power(3ll,MOD-2);
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(i==0 && j==0){
dp[i][j]=power(3ll,h*w-k);
}
if(i>0){
if(a[i-1][j]==0){
dp[i][j]=(dp[i][j]+((dp[i-1][j]*inv3)%MOD)*2)%MOD;
}
else if(a[i-1][j]==2 || a[i-1][j]==3){
dp[i][j]=(dp[i][j]+(dp[i-1][j])%MOD)%MOD;
}
}
if(j>0){
if(a[i][j-1]==0){
dp[i][j]=(dp[i][j]+((dp[i][j-1]*inv3)%MOD)*2)%MOD;
}
else if(a[i][j-1]==1 || a[i][j-1]==3){
dp[i][j]=(dp[i][j]+(dp[i][j-1])%MOD)%MOD;
}
}
}
}
cout<<(dp[h-1][w-1]+MOD)%MOD<<endl;
} |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mp make_pair
int MOD = 1e9 + 7;
int mul(int a, int b) {
return (1LL * a * b) % MOD;
}
int add(int a, int b) {
int s = (a+b);
if (s>=MOD) s-=MOD;
return s;
}
int sub(int a, int b) {
int s = (a+MOD-b);
if (s>=MOD) s-=MOD;
return s;
}
int po(int a, ll deg)
{
if (deg==0) return 1;
if (deg%2==1) return mul(a, po(a, deg-1));
int t = po(a, deg/2);
return mul(t, t);
}
int inv(int n)
{
return po(n, MOD-2);
}
mt19937 rnd(time(0));
/*
const int LIM = 1000;
vector<int> facs(LIM), invfacs(LIM);
void init()
{
facs[0] = 1;
for (int i = 1; i<LIM; i++) facs[i] = mul(facs[i-1], i);
invfacs[LIM-1] = inv(facs[LIM-1]);
for (int i = LIM-2; i>=0; i--) invfacs[i] = mul(invfacs[i+1], i+1);
}
int C(int n, int k)
{
if (n<k) return 0;
if (n<0 || k<0) return 0;
return mul(facs[n], mul(invfacs[k], invfacs[n-k]));
}*/
/*struct DSU
{
vector<int> sz;
vector<int> parent;
void make_set(int v) {
parent[v] = v;
sz[v] = 1;
}
int find_set(int v) {
if (v == parent[v])
return v;
return find_set(parent[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
parent[b] = a;
sz[a] += sz[b];
}
}
DSU (int n)
{
parent.resize(n);
sz.resize(n);
for (int i = 0; i<n; i++) make_set(i);
}
};*/
bool cmp(ll a, ll b)
{
//a vs b*phi
//cout<<"Comparing: "<<a<<' '<<b<<endl;
if (a==0) return false;
if (b==0) return true;
if (a<=b) return false;
if (a>=2*b) return true;
return (!cmp(b, a-b));
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
ll n; cin>>n;
ld kek = ((ld)(1) + sqrt(5))/(ld)(2);
ll n1 = n/kek;
//cout<<n<<' '<<n1<<endl;
while (cmp(n, n1+1)) n1++;
while (!cmp(n, n1-1)) n1--;
//cout<<n<<' '<<n1<<endl;
vector<int> ops;
while (n>0 && n1>0)
{
//cout<<n<<' '<<n1<<endl;
if (n>=n1)
{
if (cmp(n-1, n1))
{
n--; ops.push_back(1);
continue;
}
else if (!cmp(n, n1-1))
{
n1--; ops.push_back(2);
continue;
}
n-=n1; ops.push_back(3);
}
else
{
if (cmp(n1-1, n))
{
n1--; ops.push_back(2);
continue;
}
else if (!cmp(n1, n-1))
{
n--; ops.push_back(1);
continue;
}
n1-=n; ops.push_back(4);
}
}
while (n>0)
{
n--; ops.push_back(1);
}
while (n1>0)
{
n1--; ops.push_back(2);
}
reverse(ops.begin(), ops.end());
cout<<ops.size()<<endl;
for (auto it: ops) cout<<it<<endl;
}
/*
(x, y) ->
(x+1, y)
(x, y+1)
(x+y, y)
(x, x+y)
(0, 0):
988988988988988988
*/
| #include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
vector<int> ans;
long long INF = 1000000000000000000;
vector<long long> fib(87, INF);
fib[0] = 1;
fib[1] = 1;
for(int i = 2; i < 87; i++){
fib[i] = fib[i - 1] + fib[i - 2];
}
vector<int> ind;
for(int i = 86; i >= 0; i--){
if(N >= fib[i]) {
N -= fib[i];
ind.push_back(86 - i);
}
}
int id = 0;
for(int i = 0; i < 86; i++){
if(i > 0){
if(i % 2 == 0){
ans.push_back(3);
}
else{
ans.push_back(4);
}
}
while(id < ind.size() && ind[id] == i){
if(i % 2 == 0){
ans.push_back(1);
}
else ans.push_back(2);
id++;
}
}
long long x = 0, y = 0;
ans.push_back(3);
for(int i = 0; i < ans.size(); i++){
if(ans[i] == 1) x++;
else if(ans[i] == 2) y++;
else if(ans[i] == 3) x = x + y;
else y = x + y;
}
cout << ans.size() << endl;
for(int t: ans) cout << t << endl;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
#include <time.h>
#include <set>
using namespace std;
int64_t mod = 998244353 ;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
vector<int> getprime(int n){
vector<int> p(0) ;
vector<bool> table(n+1,0) ;
for (int i = 2; i <= n; i++)
{
if (table.at(i) == 0)
{
p.push_back(i) ;
for (size_t j = 2; j < n/i ; j++)
{
table.at(i*j) = 1 ;
}
}
}
return p ;
}
/*
int getnum(vector<int> &array, vector<char> &c, char a){
for (int i = 0; i < c.size(); i++)
{
if (a == c.at(i))
{
return array.at(i) ;
}
}
}
int64_t repeatmod(int64_t n, int64_t pow, int64_t p){
if (pow == 1)
{
return n%p ;
}
if (pow % 2)
{
return (repeatmod(n, pow-1,p) * n) % p ;
}else
{
return (repeatmod(n,pow/2,p) * repeatmod(n,pow/2,p)) % p ;
}
}
*/
int prod(pair<int,int> a,pair<int,int> b){
return a.first * b.first + a.second * b.second ;
}
int main(){
int n ;
cin >> n ;
if (n == 1)
{
cout << "Yes" << endl ;
return 0 ;
}
vector<pair<int,int> > s(n) ;
vector<pair<int,int> > t(n) ;
for (int i = 0; i < n; i++)
{
cin >> s.at(i).first >> s.at(i).second ;
}
for (int i = 0; i < n; i++)
{
cin >> t.at(i).first >> t.at(i).second ;
}
int a0 = s.at(0).first ;
int b0 = s.at(0).second ;
for (int i = 0; i < n; i++)
{
s.at(i).first -= a0 ;
s.at(i).second -= b0 ;
}
pair<int,int> kitei1 = make_pair(s.at(1).first,s.at(1).second) ;
pair<int,int> kitei2 = make_pair(-s.at(1).second,s.at(1).first) ;
set <pair<pair<int,int>,pair<int,int> > > svec ;
for (int i = 0; i < n; i++)
{
int size = prod(s.at(i),s.at(i)) ;
svec.insert(make_pair(make_pair(size*size,prod(s.at(i),kitei1)),make_pair(size*size,prod(s.at(i),kitei2)))) ;
}
for (int onum = 0; onum < n; onum++)
{
vector<pair<int,int> > copy = t ;
int c0 = copy.at(onum).first ;
int d0 = copy.at(onum).second ;
for (int i = 0; i < n; i++)
{
copy.at(i).first -= c0 ;
copy.at(i).second -= d0 ;
}
for (int knum = 0; knum < n; knum++)
{
pair<int,int> kitei11 = make_pair(copy.at(knum).first,copy.at(knum).second) ;
pair<int,int> kitei22 = make_pair(-copy.at(knum).second,copy.at(knum).first) ;
set <pair<pair<int,int>,pair<int,int> > > tvec ;
for (int i = 0; i < n; i++)
{
int size = prod(copy.at(i),copy.at(i)) ;
tvec.insert(make_pair(make_pair(size*size,prod(copy.at(i),kitei11)),make_pair(size*size,prod(copy.at(i),kitei22)))) ;
}
if ( svec == tvec)
{
cout << "Yes" << endl ;
return 0 ;
}
}
}
cout << "No" << endl ;
} | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353
vector<pair<ll, ll>> v[5];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n;
cin >> n;
vector<pair<ll, ll>> v[5];
ll data[n][5];
for(int x=0;x<n;x++){
for(int y=0;y<5;y++){
cin >> data[x][y];
v[y].push_back({data[x][y], x});
}
}
for(int x=0;x<5;x++){
sort(v[x].begin(), v[x].end());
}
ll ans = 0;
for(int x=0;x<n;x++){
for(int y=x+1;y<n;y++){
vector<pair<ll, ll>> tmp;
for(int z=0;z<5;z++){
tmp.push_back({max(data[x][z], data[y][z]), z});
}
sort(tmp.begin(), tmp.end());
for(int i=1;i<=3;i++){
int idx = v[tmp[0].second][n-i].second;
if(idx == x || idx == y) continue;
tmp[0].first = max(tmp[0].first, v[tmp[0].second][n-i].first);
break;
}
ll mn = inf_ll;
for(int z=0;z<5;z++) mn = min(mn, tmp[z].first);
ans = max(ans, mn);
}
}
cout << ans << "\n";
return 0;
}
// Santai
// Pikirin dengan benar-benar |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << '=' << x << endl
#define rep(i, b, e) for (int i = b; i <= e; i++)
char s1[512345], s2[512345];
vector<int> a(512345);
vector<int> b(512345);
signed main(void) {
int n, cnt = 0;
cin >> n;
scanf("%s%s", s1 + 1, s2 + 1);
rep (i, 1, n) {
if (s1[i] == '0') {
cnt++;
}
if (s2[i] == '0') {
cnt--;
}
}
if (cnt != 0) {
puts("-1");
return 0;
}
int ans = 0;
rep (i, 1, n) {
if (s1[i] == '0') {
a.push_back(i);
}
if (s2[i] == '0') {
b.push_back(i);
}
}
rep (i, 0, min(a.size(), b.size()) - 1) {
if (a[i] != b[i]) {
ans++;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
/*
ll fac[100000+1];
ll power(ll x,ll y)
{
ll res = 1; // Initialize result
x = x % k; // Update x if it is more than or
// equal to p
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % k;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) %k;
}
return res;
}
// Returns n^(-1) mod p
ll modInverse(ll n)
{
return power(n, k - 2);
}
// Returns nCr % p using Fermat's little
// theorem.
ll nCr(ll n,ll r)
{
// If n<r, then nCr should return 0
if (n < r)
return 0;
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (fac[n] * modInverse(fac[r]) % k
* modInverse(fac[n - r]) % k)
% k;
}
*/
ll gcd(ll a,ll b)
{
if(a==0)
return b;
return gcd(b%a,a);
}
ll countDivisors(ll n)
{
ll cnt = 0;
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
cnt++;
else
cnt = cnt + 2;
}
}
return cnt;
}
/*ll binexp(ll a,ll b)
{
if(a==0||a==1) return a;
if(b==0) return 1;
ll ret= binexp(a,b/2);
if(b%2) return (((ret*ret)%M)*a)%M;
else return (ret*ret)%M;
}
*/
ll smallestDivisor(ll n)
{
// if divisible by 2
if (n % 2 == 0)
return 2;
// iterate from 3 to sqrt(n)
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0)
return i;
}
return n;
}
ll maxPrimeFactor(ll n)
{
ll maxPrime = -1;
while (n % 2 == 0) {
maxPrime = 2;
n >>= 1;
}
for (ll i = 3; i <= sqrt(n); i += 2) {
while (n % i == 0) {
maxPrime = i;
n = n / i;
}
}
if (n > 2)
maxPrime = n;
return maxPrime;
}
ll isPrime(ll n)
{
if(n==1) return 0;
if (n <= 3) return (1);
if (n%2 == 0 || n%3 == 0) return (0);
for (ll i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return (0);
return (1);
}
ll no_of_digits(ll n)
{
ll k=0;
while(n)
{
k++;
n/=10;
}
return k;
}
ll sum_of_digits(ll n)
{
ll k=0;
while(n)
{
k+=n%10;
n/=10;
}
return k;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*ll fac[11];
fac[0] = 1;
for (int i = 1; i <=10; i++)
fac[i] = (fac[i - 1] * i);*/
ll t=1;
// cin>>t;
while(t--){
int n;
cin>>n;
string s,t;
cin>>s>>t;
vector<int> v1,v2,v3,v4;
for(int i=0;i<n;i++)
{
if(s[i]=='0')
v1.push_back(i);
else
v3.push_back(i);
if(t[i]=='0')
v2.push_back(i);
else
v4.push_back(i);
}
// cout<<v1.size()<<" "<<v2.size();
if(s==t)
cout<<0;
else if(v1.size()!=v2.size())
cout<<-1;
else{
int count1=0,count2=0;
int i=0;
while(i<v1.size())
{
if(v1[i]==v2[i])
count1++;
i++;
}
/* int j=v1.size()-1;
while(j>=0 && v1[j]==v2[j])
{
count2++;
j--;
}*/
// cout<<count1<<" "<<count2;
ll ans1=v1.size()-count1-count2;
count1=0,count2=0;
i=0;
while(i<v3.size() && v3[i]==v4[i])
{
count1++;
i++;
}
int j=v3.size()-1;
while(j>=0 && v3[j]==v4[j])
{
count2++;
j--;
}
// ll ans2=v3.size()-count1-count2;
cout<<ans1;
}
cout<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpll vector<pll>
#define vpii vector<pii>
#define umap unordered_map
#define uset unordered_set
#define PQ priority_queue
#define printa(a, L, R) \
for (int i = L; i < R; i++) \
cout << a[i] << (i == R - 1 ? '\n' : ' ')
#define printv(a) printa(a, 0, a.size())
#define print2d(a, r, c) \
for (int i = 0; i < r; i++) \
for (int j = 0; j < c; j++) \
cout << a[i][j] << (j == c - 1 ? '\n' : ' ')
#define pb push_back
#define eb emplace_back
#define UB upper_bound
#define LB lower_bound
#define F first
#define S second
#define mem(a, x) memset(a, x, sizeof(a))
#define inf 1e18
#define E 2.71828182845904523536
#define gamma 0.5772156649
#define nl "\n"
#define lg(r, n) (int)(log2(n) / log2(r))
#define rev(v) reverse(v.begin(), v.end())
#define srt(v) sort(v.begin(), v.end())
#define grtsrt(v) sort(v.begin(), v.end(), greater<ll>())
#define all(v) v.begin(), v.end()
#define mnv(v) *min_element(v.begin(), v.end())
#define mxv(v) *max_element(v.begin(), v.end())
#define toint(a) atoi(a.c_str())
#define BeatMeScanf ios_base::sync_with_stdio(false)
#define one(x) __builtin_popcount(x)
#define Unique(v) v.erase(unique(all(v)), v.end())
#define fout(x) fixed << setprecision(x)
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
deb(_it, args); \
}
void deb(istream_iterator<string> it)
{
}
template <typename T, typename... Args>
void deb(istream_iterator<string> it, T a, Args... args)
{
cout << *it << " = " << a << endl;
deb(++it, args...);
}
const int mod = 1e9 + 7;
const int N = 3e5 + 9;
const ld eps = 1e-9;
const ld PI = acos(-1.0);
ll gc(ll a, ll b)
{
while (b)
{
ll x = a % b;
a = b;
b = x;
}
return a;
}
ll lc(ll a, ll b) { return a / gc(a, b) * b; }
ll qpow(ll n, ll k)
{
ll ans = 1;
assert(k >= 0);
n %= mod;
while (k > 0)
{
if (k & 1)
ans = (ans * n) % mod;
n = (n * n) % mod;
k >>= 1;
}
return ans % mod;
}
void solve()
{
ll n;
cin>>n;
ll x=sqrt((double) n);
while((x+1)*(x+2)/2<=(n+1)) x++;
// debug(x);
ll y=x*(x+1);
// debug(y);
cout<<n-x+1<<nl;
}
int main()
{
BeatMeScanf;
int t=1;
// cin>>t;
int cs=0;
while(t--){
// cout<<"Case "<<++cs<<": ";
solve();
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,t=0,i=1,k=0;
cin>>n;
while(t<=n+1){
t=t+i;
i++;
k++;
}
printf("%lld\n",n-k+2);
return 0;
} |
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <utility>
#include <map>
#include <list>
#include <climits>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <string>
// #define cerr if(false)cerr
#define watch(x) cerr << "> " << #x << ": " << x << "\n";
using namespace std;
template <typename T>
std::ostream &operator <<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator <<(std::ostream &out, vector<pair<T, N> > &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, vector<vector<T> > &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> present(2e5 + 1);
int min_valid = 0;
int p;
for (int i = 0; i < n; ++i) {
cin >> p;
present[p] = 1;
while (present[min_valid]) {
++min_valid;
}
cout << min_valid << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
int n;
vector<int> x(210),y(210),r(210);
vector<int> a(210,-1),b(210,-1),c(210,-1),d(210,-1);
void input(){
cin>>n;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i]>>r[i];
}
}
void output(){
rep(i,n){
cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<" "<<d[i]<<endl;
}
}
int main(){
input();
rep(i,n){
a[i]=x[i];
b[i]=y[i];
c[i]=x[i]+1;
d[i]=y[i]+1;
}
output();
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <vector>
#include <list>
#include <cmath>
#include <map>
#include <deque>
#include <utility>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <string>
#include <stack>
#include <set>
#include <functional>
#include <iterator>
#include <algorithm>
using namespace std;
typedef long long ll;
class UnionFind {
private:
vector<int> f;
int _components;
public:
explicit UnionFind(int sz): f(sz), _components(sz) {
for (int i = 0; i < sz; i++) {
f[i] = i;
}
}
int find(int x) {
if (x == f[x]) return x;
int fa = f[x];
return f[x] = find(fa);
}
void add(int x, int y) {
int fx = find(x), fy = find(y);
if (fx != fy) {
_components--;
}
f[fx] = fy;
}
int components() const {
return _components;
}
};
ll gcd(ll a, ll b) {
if (b == 0)return a;
else return gcd(b, a%b);
}
ll lucas(ll n, ll m, ll mod, const vector<vector<ll>>& c) {
if (m == 0) {
return 1;
} else {
return c[n % mod][m % mod] * lucas(n / mod, m / mod, mod, c);
}
}
int main(int argc, char *argv[]) {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
const int mod = 1e9+7;
int n;
cin >> n;
string s;
cin >> s;
unordered_map<char, int> dict{{'B', 0}, {'W', 1,}, {'R', 2}};
unordered_map<char, int> reversedict{{0, 'B'}, {1, 'W'}, {2, 'R'}};
vector<vector<ll>> c(3, vector<ll>(3, 0));
c[0][0] = 1;
c[1][0] = 1;
c[1][1] = 1;
c[2][0] = 1;
c[2][1] = 2;
c[2][2] = 1;
int sum = 0;
for (int i = 0; i < n; i++) {
ll mult = lucas(n - 1, i, 3, c);
//cout << mult << ' ';
sum += mult * dict[s[i]];
sum %= 3;
}
if (n % 2 == 0) {
sum = -sum;
}
sum %= 3;
if (sum < 0) {
sum += 3;
}
cout << char(reversedict[sum]);
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 4e5 + 5;
int n;
int f[maxn], g[maxn];
string a;
int C(int i, int j){
if(f[i] == f[j] + f[i-j])
return g[i] * g[j] * g[i-j] % 3;
else
return 0;
}
string col = "BWR";
int id(char c){
for(int i = 0;i < 3;i++){
if(c == col[i])
return i;
}
}
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
f[0] = 0;
g[0] = 1;
for(int i = 1;i <= n;i++){
int c = 0;
int j = i;
while(j % 3 == 0){
j /= 3;
c++;
}
f[i] = f[i-1] + c;
g[i] = g[i-1] * j % 3;
}
cin >> a;
int ans = 0;
for(int i = 0;i < n;i++){
ans += C(n-1, i) * id(a[i]);
}
ans %= 3;
if(n % 2 == 0){
ans = (3 - ans) % 3;
}
cout << col[ans] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define T() long long t;cin>>t;for(long long o=1;o<=t;o++)
#define INF INT_MAX
#define INFS INT_MIN
#define mod 1000000007
#define FOR(a, b, n) for(int a = b; a < n; a++)
#define REP(a,c, b) for(int a = c; a < b; a++)
#define FORD(a, b, c) for(int a = b; a >= c; a--)
#define REPR(a, c,b) for(int a = b-1; a >= c; a--)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define RESET(a, b) memset(a, b, sizeof a)
#define EPS 1e-9
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define rall(x) x.rbegin(), x.rend()
#define all(x) x.begin(), x.end()
#define ALL(x, y) x, x+y
#define SZ(x) ((int)x.size())
#define pi(a) pair<a, a>
#define vi(a) vector<a>
#define vii(a) vector<pi(a)>
#define vs vector<string>
template<class T> T sqr(T x){ return x*x; }
template<class T> T binPow(T p, int q, int MOD) {
if(q == 1) return p % MOD;
if(q & 1) return p*(binPow(p, q-1, MOD) % MOD) % MOD;
else return sqr(binPow(p, q/2, MOD) % MOD) % MOD;
}
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << endl;
//use cerr if u want to display at the bottom
}
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 trace(...)
#endif
ll nxt() {
ll temporaryVariable;
cin >> temporaryVariable;
return temporaryVariable;
}
const double PI = acos(-1.0);
#define MAXN 100001
const int G = 2e5 + 5;
int N=10000000;
int main(){
IOS
int n;cin>>n;
if(n>0)
cout<<n<<endl;
else
cout<<0<<endl;
#ifdef HOHOHOa
fprintf(stderr, "%.3lf\n", clock() / (double) CLOCKS_PER_SEC );
#endif
} | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const double TL = 1.5 * CLOCKS_PER_SEC;
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
#define clr(x, y) memset(x, y, sizeof(x))
#define forn(i, n) for (int i = 0; i < n; i++)
#define LL long long
const double pi = acos(-1.0);
int main() {
#ifdef LOCAL
auto start_clock = clock();
freopen("in", "r", stdin);
#endif
int x;
scanf("%d", &x);
if (x < 0) x = 0;
printf("%d\n", x);
#ifdef LOCAL
auto end_clock = clock();
cout << "Time:" << (end_clock - start_clock) * 1.0 / CLOCKS_PER_SEC << endl;
#endif
return 0;
} |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define repe(i,n) repie(i,0,n)
#define repie(i,a,n) for(ll i=a;i<=(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
void YN(bool a) { cout << (a ? "Yes" : "No") << endl; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void show(){ cout << endl; }
template <class Head, class... Tail>
void show(Head&& head, Tail&&... tail){ cout << head << " "; show(std::forward<Tail>(tail)...); }
template<class T> inline void show(T& begin, T& end) { for(auto itr = begin; itr != end; ++itr) cout<<(*itr)<<" "; cout<<endl; }
template<class T> inline void showall(T& a) { for(auto v:a) cout<<v<<" "; cout<<endl; }
void solve()
{
ll n;
cin >> n;
ll a, p, x;
ll ans = 1LL<<60;
rep(i, n)
{
cin >> a >> p >> x;
if (x - a > 0) chmin(ans, p);
}
if (ans == 1LL<<60) ans = -1;
show(ans);
}
int main()
{
fastio;
solve();
return 0;
} | // Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED) ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy() int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll) (coll.find(el) != coll.end())
#define FOR(i, a, b) for(int i=a; i<=b; i++)
#define FORD(i, a, b) for(int i=a; i>=b; i--)
#define MP make_pair
#define PB push_back
#define ff first
#define ss second
#define deb(X) X;
#define M 1000000007
#define INF 1000000007LL
using namespace std;
int n, m, a;
char slowo[1000007];
int main()
{
testy()
{
scanf("%d", &n);
scanf("%s", slowo);
scanf("%s", slowo);
scanf("%s", slowo);
printf("1");
forr(i, n)
printf("0");
forr(i, n)
printf("1");
printf("\n");
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <time.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define vd vector<double>
#define vvd vector<vd>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdi pair<double, int>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using namespace std;
constexpr int n = 20;
int m;
vector<string> s;
vector<deque<string>> ss(n + 1);
set<string> cnt;
vvi board(n, vi(n));
int score = 0;
void setset(){
rep(i, n){
string t = "";
rep(j, n) t += board[i][j] + 'A';
rep(j, n){
for(int k = 2; (k + j <= n && k <= 12); k++) cnt.insert(t.substr(j, k));
}
}
rep(j, n){
string t = "";
rep(i, n) t += board[i][j] + 'A';
rep(i, n){
for(int k = 2; (k + i <= n && k <= 12); k++) cnt.insert(t.substr(i, k));
}
}
}
int calc_score(){
cnt.clear();
setset();
int v = 0;
rep(i, m) if(cnt.count(s[i])) v++;
return v;
}
void random_select(){
int num = rand() % 2 + 1;
vector<tuple<int,int,int>> info;
rep(_, num){
int i = rand() % n;
int j = rand() % n;
int k = rand() % 8;
info.push_back({i,j,board[i][j]});
board[i][j] = k;
}
int val = calc_score();
//もとに戻す
if(score >= val) rep(i, num){
int a,b,c;
tie(a, b, c) = info[i];
board[a][b] = c;
}
else score = val;
}
void tekitou_sort(){
rep(i, n){
int nokori = n;
while(true){
bool found = false;
for(int j = nokori; j >= 0; j--) if(!ss[j].empty()){
found = true;
rep(k, j) board[i][n-nokori+k] = ss[j][0][k] - 'A';
nokori -= j;
ss[j].pop_front();
break;
}
if(!found) break;
}
}
}
void inputs(){
cin >> m >> m;
s.resize(m);
rep(i, m) cin >> s[i];
}
int main(){
srand(time(NULL));
inputs();
rep(i, m) ss[s[i].size()].push_back(s[i]);
rep(i, n) rep(j, n) board[i][j] = rand() % 8;
tekitou_sort();
score = calc_score();
rep(i, 100) random_select();
rep(i, n){
rep(j, n) printf("%c", board[i][j] + 'A');
printf("\n");
}
} | #include <iostream>
using namespace std;
const int INF = 100000000;
int b[10005][102];
bool judge(int k, int n, int *a){
for(int i = 0; i < k; i++){
for(int j = 0; j <= n; j++){
b[i][j] = a[j] / k;
if(a[j] % k > i) b[i][j]++;
}
}
for(int i = 0; i < k; i++){
for(int j = 0; j < n; j++){
if(b[i][j] == b[i][j + 1]) return false;
}
}
return true;
}
int main()
{
int n;
cin >> n;
string s;
cin >> s;
int a[102];
for(int i = 0; i <= n; i++) cin >> a[i];
int left = 1, right = 10001;
while(right - left > 1){
int mid = (right + left) / 2;
if(judge(mid, n, a)) left = mid;
else right = mid;
}
cout << left << endl;
judge(left, n, a);
for(int i = 0; i < left; i++){
for(int j = 0; j <= n; j++) cout << b[i][j] << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int arr[3];
for(int i=0;i<3;i++) cin>>arr[i];
sort(arr,arr+3);
cout<<arr[2]+arr[1];
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,m,n) for (int i = (m); i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define RREP(i,m,n) for (int i = (n)-1; i >= (m); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long int;
using vec = vector<int>;
using P = pair<int,int>;
const int INF = 1e9+7;
int main() {
int a, b, c; cin >> a >> b >> c;
cout << max(max(a+b, b+c), a+c) << 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;
#define int long long int
#define ld long double
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define vi vector<int>
#define vld vector<ld>
#define pii pair<int,int>
#define mii map<int,int>
#define fi first
#define se second
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) { cerr << " "<< name << " : " << arg1 <<'\n'; }
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...);
}
typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds;
//order_of_key (k) : Number of items strictly smaller than k .
//find_by_order(k) : K-th element in a set (counting from zero) (returns an iterator)
void inp_out()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
int32_t main()
{
fastIO
inp_out();
int n, m;
cin >> n >> m;
map < pii, int > mp;
mp[{1, n + 1}] = 1;
vector < pii > a(m);
for(int i = 0; i < m; ++ i)
cin >> a[i].fi >> a[i].se;
mii last;
last[n + 1] = 1;
sort(a.begin(), a.end());
for(int i = 0; i < m;)
{
int val = a[i].fi, j = i;
while(a[j].fi == val)
{
mp[{a[j].fi + 1, a[j].se + 1}] = mp[{last[a[j].se], a[j].se}] | mp[{last[a[j].se + 2], a[j].se + 2}];
++ j;
}
for(int k = i; k < j; ++ k)
last[a[k].se + 1] = a[k].fi + 1;
i = j;
}
int ans = 0;
for(auto i : last)
ans += mp[{i.se, i.fi}];
cout << ans;
return 0;
} | #include<bits/stdc++.h>
#define INF 1e9
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
int main(){
int n,m,q;
scanf("%d %d %d",&n,&m,&q);
vector<bool> caja,prod;
vector<pi> a(n),b(m);
for(int i = 0; i < n; i++)
scanf("%d %d",&a[i].second,&a[i].first);
sort(a.begin(), a.end());
for(int i = 0; i < m; i++){
scanf("%d",&b[i].first);
b[i].second = i;
}
sort(b.begin(), b.end());
while(q--){
int l,r;
scanf("%d %d",&l,&r);
caja.assign(m,true);
prod.assign(n,true);
l--;r--;
for(l; l <= r; l++)
caja[l]=0;
ll ans = 0;
for(int i = 0; i < m; i++){
if(caja[b[i].second]){
for(int j = n-1; j >= 0; j--){
if(prod[j] && a[j].second <= b[i].first){
ans += a[j].first;
prod[j] = 0;
caja[b[i].second]=0;
break;
}
}
}
}
printf("%lld\n", ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int>a(n);
char c;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>c;
if(c=='1'){
a[i]|=1<<j;
}
}
}
int64_t even=0,odd=0;
for(int i=1;i<n;i++){
if(__builtin_popcount(a[0]^a[i])%2==0)even++;
else odd++;
}
cout<<odd+even*odd<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef map<ll, ll> ml;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {return (a % b + b) % b;}
ll quo(ll a, ll b) {return (a - mod(a, b)) / b;}
template <typename T, typename U> bool chmin(T &a, const U b) {if(a > b) {a = b; return 1;} return 0;}
template <typename T, typename U> bool chmax(T &a, const U b) {if(a < b) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
ll c = min(a, b);
vl ans;
rep2(i, 1, c-1) {
ans.push_back(i);
ans.push_back(-i);
}
if(a < b) {
ll tmp = 0;
rep2(i, c, c+b-a) {
tmp += i;
ans.push_back(-i);
}
ans.push_back(tmp);
}
if(a == b) {
ans.push_back(c);
ans.push_back(-c);
}
if(a > b) {
ll tmp = 0;
rep2(i, c, c+a-b) {
tmp += i;
ans.push_back(i);
}
ans.push_back(-tmp);
}
for(ll num: ans) cout << num << ' ';
cout << newl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.