code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string t; cin >> t;
string s = "";
while ((int)s.size() < 2 * n)
s += "110";
long long res = 0;
if (s.find(t) != string::npos) {
if (t == "1") res = 2e10;
else if (t == "11") res = 1e10;
else {
int k = 0;
for (int i = 0; i < n; i++)
if (t[i] == '0')
k++;
if (t[n-1] == '0') res = 1e10 - k + 1;
else res = 1e10 - k;
}
}
cout << res << '\n';
return 0;
}
| #include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i=0; i<(int)n; i++)
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
while(true){
if(n-1 >= 1){
count++;
n--;
}
else
break;
}
cout << count << endl;
return 0;
}
|
#include <cstdio>
int main()
{
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
if(C==0)
{
if(A>B)
{
printf("Takahashi\n");
}
else
printf("Aoki\n");
}
else
{
if(B>A)
printf("Aoki\n");
else
printf("Takahashi\n");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string slot;
getline(cin,slot);
int flag=0;
for(unsigned int i=1;i<slot.length();i++){
if(slot[i]!=slot[i-1]){
flag=1;
break;
}
}
flag==0?cout<<"Won":cout<<"Lost";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
mt19937 mt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
mt.seed(time(nullptr));
int n, m;
cin >> n >> m;
vector<string> v(m);
for (auto& i : v) {
cin >> i;
}
//sort(v.begin(), v.end(), [](string a, string b){return a.size() < b.size();});
shuffle(v.begin(), v.end(), mt);
char a[N][N];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
a[i][j] = '.';
}
}
int i = 0, j = 0;
for (auto s : v) {
if (j + s.size() >= n) {
j = 0;
++i;
}
if (i >= n) {
break;
}
for (int k = 0; k < s.size(); ++k, ++j) {
a[i][j] = s[k];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cout << a[i][j];
}
cout << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr char LF = '\n';
template <typename T = int>
constexpr T INF()
{
return numeric_limits<T>::max();
}
template <typename InputIterator>
void print(InputIterator first, InputIterator last)
{
if (first != last) {
cout << *first;
for (auto p = next(first); p != last; p = next(p)) {
cout << ' ' << *p;
}
}
cout << LF;
}
void trace() { cout << LF; }
template <typename Head, typename... Tail>
void trace(Head head, Tail... tail)
{
cout << head << ' ';
trace(tail...);
}
class Problem {
static constexpr size_t ML = 12;
size_t N_, M_;
vector<string> s_;
vector<vector<pair<string, bool>>> v_;
private:
void fill(string &t)
{
for (size_t j = ML; j > 1; --j) {
auto p = v_.at(j).begin();
while (p != v_.at(j).end() && N_ - t.size() > +j) {
if (p->second) {
t += p->first;
p->second = false;
}
++p;
}
}
if (t.size() < N_) t += string(N_ - t.size(), '.');
}
public:
Problem()
{
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cin >> N_ >> M_;
s_.assign(M_, string());
for (auto &&si : s_) cin >> si;
}
void solve()
{
v_.assign(ML + 1, vector<pair<string, bool>>());
for (auto si : s_) {
v_.at(si.size()).emplace_back(si, true);
}
vector<string> ans(N_);
for (auto ans_it = ans.begin(); ans_it != ans.end(); ++ans_it) {
fill(*ans_it);
}
string t;
fill(t);
for (size_t i = 0; i < N_; ++i) {
ans.at(i).at(N_ - 1) = t.at(i);
}
for (auto r : ans) cout << r << LF;
}
};
int main()
{
Problem problem;
problem.solve();
}
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin >> s;
if ((s.at(0) == s.at(1)) && (s.at(1) == s.at(2)))
{
cout << "Won\n";
}
else
{
cout <<"Lost\n";
}
return 0;
} | #include <bits/stdc++.h>
#include<iostream>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lli unsigned long long int
#define forit(it, a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define fori(i,n) for(int j=i;j<n;j++)
#define pb push_back
#define ff first
#define ss second
#define pp pair<int,int>
#define mod 1000000007
using namespace std;
bool isV(char ch)
{
return(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u');
}
void tc()
{
int n,m,x;
string s;
cin>>s;
n=s.size();
string t="ZONe";
int cnt=0;
for(int i=0;i<n-3;i++)
{
if(t==s.substr(i,4))
cnt++;
}
cout<<cnt;
}
int main()
{
IOS;
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
//lli q; cin>>q; while(q--)
tc();
return 0;
} |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); ++i)
ll INF = 1ll << 60;
int main(){
int a, b;
cin >> a >> b;
cout << 2*a+100-b << endl;
return 0;
} | #include<ctime>
#include<cstdio>
#include<cctype>
using namespace std;
int read(){
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
return x;
}
int a,b;
int main(){
#ifndef ONLINE_JUDGE
freopen("A.in","r",stdin);
freopen("A.out","w",stdout);
#endif
clock_t t1=clock();
//--------
a=read();
b=read();
printf("%d",2*a+100-b);
//--------
fprintf(stderr,"%0.3lfs",1.0*(clock()-t1)/CLOCKS_PER_SEC);
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
int a, b;
int aBoard[1010];
int bBoard[1010];
int main(void)
{
scanf("%d%d", &a, &b);
if (a >= b) {
for (int i = 0 ; i < a ; i++) {
aBoard[i] = i + 1;
}
int left = a;
for (int i = 0 ; i < b ; i++) {
bBoard[i] = left;
left--;
}
while (left > 0) {
for (int i = 0 ; i < b ; i++) {
bBoard[i] = bBoard[i] + left;
left--;
if (left <= 0)
break;
}
}
} else {
for (int i = 0 ; i < b ; i++) {
bBoard[i] = i + 1;
}
int left = b;
for (int i = 0 ; i < a ; i++) {
aBoard[i] = left;
left--;
}
while (left > 0) {
for (int i = 0 ; i < a ; i++) {
aBoard[i] = aBoard[i] + left;
left--;
if (left <= 0)
break;
}
}
}
for (int i = 0 ; i < a ; i++) {
printf("%d ", aBoard[i]);
}
for (int i = 0 ; i < b ; i++) {
printf("%d ", -bBoard[i]);
}
printf("\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef int ll;
#define F first
#define S second
#define pb(x) push_back(x)
//cout.flush()
ll q, n, k, a[200001], c[20], c1, c2;
string s;
int main(){
// ios_base::sync_with_stdio(0);
// cin.tie(0);
cin >> c1 >> c2;
c[1]=0;
c[2]=0;
if(c1>=c2){
for(int i=1; i<=c1; i++){
cout << i << " ";
c[1]+=i;
}
for(int i=1; i<c2; i++){
cout << -i << " ";
c[2]+=i;
}
cout << c[2]-c[1] << " ";
}
else{
for(int i=1; i<c1; i++){
cout << i << " ";
c[1]+=i;
}
for(int i=1; i<=c2; i++){
cout << -i << " ";
c[2]+=i;
}
cout << c[2]-c[1] << " ";
}
return 0;
}
|
#include<bits/stdc++.h>
// no of bits to store no 2e5 is 19
// 2e5 ka 5 times square root lene se 2 or 3 ke pass pahunch jate hai
using namespace std;
#define int long long
#define mod 1000000007
#define MOD 1000000007
#define MAX 1000000000
#define inf 2e18
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define mii map<int, int>
#define all(x) (x).begin(), (x).end()
#define fill(a,b) memset(a, b, sizeof(a))
#define sp(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcount(x)
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define endl '\n'
// powermod(a,b,m) == powermod(a,b%(m-1),m) when m is prime fermat's theorem a^(p-1) %p=1 p is prime
int powermod(int a,int b,int c) // gives (a^b)%c
{
int ans = 1,tempans=a%c;
while(b>0)
{
if((b&1)==1)
{
ans=(ans*tempans)%c;
}
tempans=(tempans*tempans)%c;
b=b>>1;
}
return ans;
}
int modinverse(int a,int m) // gives a inverse wrt m and m is prime
{
return powermod(a,m-2,m);
}
ll add(ll x, ll y) {
x += y;
if (x >= mod) return x - mod;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0) return x + mod;
return x;
}
ll mult(ll x, ll y) {
return (x * y) % mod;
}
ll inv(ll x)
{
return powermod(x, MOD - 2,mod);
}
ll divide(ll x, ll y)
{
return mult(x, inv(y));
}
// my template m
// prime factorization pf
// ncr and factorials ncr
// matrix exponentiation of fibonacci series in log(n) matexpofib
// cycles in a graph cycle
// prime factorization in log(n) spf
// disjoint set union dsu
void solve()
{
int x,y;
cin>>x>>y;
if(x==y){
cout<<x<<endl;
}
else{
cout<<3-x-y;
}
}
int32_t main()
{
fast_in_out;
int t=1;//cin>>t;
int count=0;
while(t--)
{
count++;
solve();
}
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(x!=y && x+y==1)cout<<"2"<<endl;
else if(x!=y && x+y==3)cout<<"0"<<endl;
else if(x!=y && x+y==2)cout<<"1"<<endl;
else if(x==y)cout<<x<<endl;
return 0;
} |
#define ll long long
#define dd long double
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
//#include<bits/stdc++.h>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<utility>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<bitset>
dd pi = acos(-1) ;
ll z = 998244353 ;
ll inf = 100000000000000000 ;
ll p1 = 37 ;
ll p2 = 53 ;
ll mod1 = 202976689 ;
ll mod2 = 203034253 ;
ll fact[100] ;
ll gdp(ll a , ll b){return (a - (a%b)) ;}
ll ld(ll a , ll b){if(a < 0) return -1*gdp(abs(a) , b) ; if(a%b == 0) return a ; return (a + (b - a%b)) ;} // least number >=a divisible by b
ll gd(ll a , ll b){if(a < 0) return(-1 * ld(abs(a) , b)) ; return (a - (a%b)) ;} // greatest number <= a divisible by b
ll gcd(ll a , ll b){ if(b > a) return gcd(b , a) ; if(b == 0) return a ; return gcd(b , a%b) ;}
ll e_gcd(ll a , ll b , ll &x , ll &y){ if(b > a) return e_gcd(b , a , y , x) ; if(b == 0){x = 1 ; y = 0 ; return a ;}
ll x1 , y1 ; e_gcd(b , a%b , x1 , y1) ; x = y1 ; y = (x1 - ((a/b) * y1)) ; return e_gcd(b , a%b , x1 , y1) ;}
ll power(ll a ,ll b , ll p){if(b == 0) return 1 ; ll c = power(a , b/2 , p) ; if(b%2 == 0) return ((c*c)%p) ; else return ((((c*c)%p)*a)%p) ;}
ll inverse(ll a ,ll n){return power(a , n-2 , n) ;}
ll max(ll a , ll b){if(a > b) return a ; return b ;}
ll min(ll a , ll b){if(a < b) return a ; return b ;}
ll left(ll i){return ((2*i)+1) ;}
ll right(ll i){return ((2*i) + 2) ;}
ll ncr(ll n , ll r){if(n < r|| (n < 0) || (r < 0)) return 0 ; return ((((fact[n] * inverse(fact[r] , z)) % z) * inverse(fact[n-r] , z)) % z);}
void swap(ll&a , ll&b){ll c = a ; a = b ; b = c ; return ;}
//ios_base::sync_with_stdio(0);
//cin.tie(0); cout.tie(0);
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>
// ordered_set s ; s.order_of_key(val) no. of elements strictly less than val
// s.find_by_order(i) itertor to ith element (0 indexed)
//__builtin_popcount(n) -> returns number of set bits in n
//ll seed;
//mt19937 rnd(seed=chrono::steady_clock::now().time_since_epoch().count()); // include bits
ll dp[3001][3001] ;
ll get_ans(ll n , ll k)
{
if(n == k)
return 1 ;
if(n < k)
return 0 ;
if(k == 0)
return 0 ;
if(dp[n][k] == -1)
{
ll a = get_ans(n , 2*k) ;
ll b = get_ans(n-1 , k-1) ;
dp[n][k] = (a+b)%z ;
return dp[n][k] ;
}
else
return dp[n][k] ;
}
void solve()
{
ll n , k ;
cin >> n >> k ;
fo(i , 3001)
{
fo(j , 3001)
dp[i][j] = -1 ;
}
cout << get_ans(n , k) << endl ;
return ;
}
int main()
{
/* ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("inputf.txt" , "r" , stdin) ;
freopen("outputf.txt" , "w" , stdout) ;
freopen("error.txt" , "w" , stderr) ;
#endif*/
ll t ;
//cin >> t ;
t = 1 ;
//int arr[100000000] ;
while(t--)
{
solve() ;
}
//cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
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...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const ll mod = 998244353;
int sum(int a, int b){return (a+b) % mod;}
int sub(int a, int b){return (a + mod - b) % mod;}
int mul(int a, int b){return (1ll * a * b) % mod;}
int power(int a,int b){
int res = 1;
while(b){
if(b&1)res = mul(res,a);
b >>= 1;
a = mul(a,a);
}
return res;
}
const int maxn = 5010;
char A[maxn][maxn];
int N,M,K,inv3,memo[maxn][maxn];
int dp(int i,int j){
if(i >= N || j >= M)return 0;
if(i == N-1 && j == M-1)return power(3,N*M-K);
int &res = memo[i][j];
if(res != -1)return res;
res = 0;
if(A[i][j] == 'X'){
res = sum(res,dp(i,j+1));
res = sum(res,dp(i+1,j));
}else if(A[i][j] == 'R'){
res = sum(res,dp(i,j+1));
}else if(A[i][j] == 'D'){
res = sum(res,dp(i+1,j));
}else{
int tmp = mul(2,inv3);
res = sum(res,mul(tmp,dp(i+1,j)));
res = sum(res,mul(tmp,dp(i,j+1)));
}
return res;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
forn(i,0,maxn)forn(j,0,maxn)memo[i][j] = -1;
cin >> N >> M >> K;
forn(i,0,N)forn(j,0,M)A[i][j] = '.';
forn(i,0,K){
int h,w; cin >> h >> w; h--; w--;
cin >> A[h][w];
}
inv3 = power(3,mod-2);
int res = dp(0,0);
if(res < 0)res += mod;
cout << res << '\n';
return 0;
}
/*
__builtin_mul_overflow(x,y,&x)
-fsplit-stack
*/
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T, class U>
inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U>
inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr int INF = 1000000000;
constexpr ll llINF = 1000000000000000000;
constexpr int mod = 1000000007;
constexpr double eps = 1e-10;
const double pi = acos(-1);
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int Random(int mi, int ma) {
random_device rnd;
mt19937 mt(rnd()); // 32bit
//[mi,ma]
uniform_int_distribution<int> engine(mi, ma);
return engine(mt);
}
/*
vector<vector<ll>>C,sC;
void init_comb(int n,int m){
C.resize(n+1,vector<ll>(m+1,0));
sC.resize(n+1,vector<ll>(m+1,0));
C[0][0]=1;
for(int i=1;i<=n;i++){
C[i][0]=1;
for(int j=1;j<=m;j++){
C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
}
}
rep(i,n+1){
rep(j,m){
sC[i][j+1]=(sC[i][j]+C[i][j])%mod;
}
}
}*/
bool prime(int a) {
if (a == 1) return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0) return false;
}
return true;
}
vector<int> primes;
void init_prime(int n) {
primes.push_back(2);
for (int i = 3; i <= n; i += 2) {
bool f = true;
for (int j : primes) {
if (j * j > i) break;
if (i % j == 0) {
f = false;
break;
}
}
if (f) primes.push_back(i);
}
}
ll modpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res *= a;
res %= mod;
}
a *= a;
a %= mod;
b >>= 1;
}
return res;
}
vector<ll> inv, fact, factinv;
void init_fact(int n) {
inv.resize(n + 1);
fact.resize(n + 1);
factinv.resize(n + 1);
inv[0] = 0;
inv[1] = 1;
fact[0] = 1;
factinv[0] = 1;
for (ll i = 1; i <= n; i++) {
if (i >= 2) inv[i] = mod - ((mod / i) * inv[mod % i] % mod);
fact[i] = (fact[i - 1] * i) % mod;
factinv[i] = factinv[i - 1] * inv[i] % mod;
}
}
ll _inv(ll a, ll m = mod) {
// gcd(a,m) must be 1
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll comb(int a, int b) {
if (a < b) return 0;
if (a < 0) return 0;
return fact[a] * factinv[a - b] % mod * factinv[b] % mod;
}
ll multicomb(int a, int b) { return comb(a + b - 1, b); }
void solve() {
ll n, ans = llINF;
cin >> n;
for (ll b = 0; b <= 60; b++) {
chmin(ans, b + (n / (1LL << b)) + (n % (1LL << b)));
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// int t;cin>>t;while(t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
int main(){
int res = INF;
for (int i = 0; i < 4; ++i) {
int a;
cin >> a;
chmin(res, a);
}
cout << res << endl;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,a[101],b[101],k,c[16],d[16];
int ans,mark[101],tot;
signed main()
{
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++)
scanf("%d %d",&a[i],&b[i]);
scanf("%d",&k);
for(int i=0;i<k;i++)
scanf("%d %d",&c[i],&d[i]);
for(int i=0;i<(1<<k);i++)
{
memset(mark,0,sizeof(mark));
for(int j=0;j<k;j++)
if(((i>>j)&1)==0)
mark[c[j]]++;
else
mark[d[j]]++;
tot=0;
for(int j=0;j<m;j++)
if(mark[a[j]]&&mark[b[j]])
tot++;
ans=max(ans,tot);
}
printf("%d",ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
o<<"{";
for(const T& v:vc) o<<v<<",";
o<<"}";
return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
os<<t<<" ~ ";
dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {"; \
for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif
int main(){
cin.tie(0);
ios::sync_with_stdio(false); //DON'T USE scanf/printf/puts !!
cout << fixed << setprecision(20);
int N,K; cin >> N >> K;
V<int> cnt(N+1);
rep(i,N){
int x; cin >> x; cnt[x]++;
}
int ans = 0;
rep(k,K){
rep(i,N+1){
if(cnt[i]){
cnt[i]--;
}else{
ans += i;
break;
}
}
}
cout << ans << endl;
}
|
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define N 103
#define NN 128000
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[N][NN], sum[NN];
inline void work() {
f[0][0] = 1;
for (int i = 1; i < n; ++i) {
int up = lmt[n >> 1];
for (int j = 0; j <= up; ++j) {
if (j - i >= 0) sum[j] = (sum[j - i] + f[i - 1][j]) % P;
else sum[j] = f[i - 1][j];
}
for (int j = 0; j <= up; ++j) {
if (j - (K+1) * i < 0) f[i][j] = sum[j];
else f[i][j] = (sum[j] - sum[j - (K+1) * i] + P) % P;
}
}
}
int main() {
read(n), read(K), read(P);
for (int i = 1; i <= n >> 1; ++i) lmt[i] = lmt[i - 1] + K * i;
work();
for (int i = 1; i <= n - i + 1; ++i) {
for (int j = 0; j <= NN - 100; ++j)
ans[i] = (ans[i] + 1ll * f[i - 1][j] * f[n - i][j]) % P;
ans[i] = (1ll * ans[i] * (K + 1) - 1) % P;
ans[n - i + 1] = ans[i];
}
for (int i = 1; i <= n; ++i) printf("%d\n", (ans[i] % P + P) % P);
return 0;
}
/*
3 1 998244353
//1 3 1
10 8 861271909
100 100 7
*/ | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N, K, M, MAX = 50 * 51 * 100 / 2;
cin >> N >> K >> M;
long dp[N][MAX];
rep(i, N){
if(!i){
fill(dp[i], dp[i] + K + 1, 1);
fill(dp[i] + K + 1, dp[i] + MAX, 0);
}else{
rep(j, MAX){
if(0 <= j && j < i + 1) dp[i][j] = dp[i - 1][j];
else if(i + 1 <= j && j < (i + 1) * (K + 1)) dp[i][j] = (dp[i][j - i - 1] + dp[i - 1][j]) % M;
else dp[i][j] = ((dp[i][j - i - 1] + dp[i - 1][j]) % M + (M - dp[i - 1][j - (i + 1) * (K + 1)]) % M) % M;
}
}
}
rep(i, N){
if(!i || !(N - 1 - i)) cout << K << endl;
else{
long ans = 0;
rep(j, MAX) ans = (ans + (dp[i - 1][j] * dp[N - 2 - i][j]) % M) % M;
ans = (ans * (K + 1) - 1) % M;
cout << ans << endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
const int maxN = 5005;
char a[maxN][maxN];
int dp[maxN][maxN];
int row[maxN][maxN], col[maxN][maxN];
int add(int x, int y) {return (x + y < mod ? x + y : x + y - mod);}
int mul(int x, int y) {return (1LL * x * y) % mod;}
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
a[i][j] = '.';
}
}
for(int i = 0; i < k; i++) {
int x, y;
char c;
cin >> x >> y >> c;
a[x][y] = c;
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
row[i][j] = row[i][j - 1] + (a[i][j] == '.');
}
}
for(int j = 1; j <= m; j++) {
for(int i = 1; i <= n; i++) {
col[i][j] = col[i - 1][j] + (a[i][j] == '.');
}
}
int pw[maxN];
pw[0] = 1;
for(int i = 1; i < maxN; i++) {
pw[i] = mul(pw[i - 1], 3);
}
dp[1][1] = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(i > 1 && a[i - 1][j] != 'R') {
dp[i][j] = add(dp[i][j], mul(dp[i - 1][j], mul((a[i - 1][j] == '.' ? 2 : 1), pw[row[i][j - 1]])));
}
if(j > 1 && a[i][j - 1] != 'D') {
dp[i][j] = add(dp[i][j], mul(dp[i][j - 1], mul((a[i][j - 1] == '.' ? 2 : 1), pw[col[i - 1][j]])));
}
}
}
if(a[n][m] == '.') dp[n][m] = mul(dp[n][m], 3);
cout << dp[n][m];
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define ppi pair<pii,int>
#define pip pair<int,pii>
#define ll long long
#define pll pair<ll,ll>
#define rep(i,n) for(int i=0;i<n;i++)
#define repd(i,n) for(int i=n-1;i>=0;i--)
#define inf 1000000001
#define inf1 1000000000000000001
#define mod 998244353
#define pie 3.14159265358979323846
#define N 1000005
#define mid(l,r) l+(r-l)/2
#define removeduplicates(vec) vec.erase( unique( vec.begin(), vec.end() ), vec.end() )
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int ddx[8]={1,1,0,-1,-1,-1,0,1},ddy[8]={0,1,1,1,0,-1,-1,-1};
void mad(ll &a,ll b){a=(a+b)%mod;if(a<0)a+=mod;}
ll gcd(ll a,ll b){ if(!a)return b;return gcd(b%a,a);}
int n,m;
ll dp[5005][5005];
char s[5005][5005];
ll inv3;
long long powmod(long long a,long long po){
if(po==0)return 1;
if(po==1)return a;
long long int p1=powmod(a,po/2ll);
long long int p2=p1*p1;
long long p3=powmod(a,po%2ll);
return ((p2%mod)*(p3%mod))%mod;
}
ll rec(int i,int j){
if(i==n&&j==m)return 1;
if(i==n+1||j==m+1)return 0;
if(dp[i][j]!=-1)return dp[i][j];
if(s[i][j]=='R')return dp[i][j]=rec(i,j+1);
else if(s[i][j]=='D')return dp[i][j]=rec(i+1,j);
else if(s[i][j]=='X')return dp[i][j]=(rec(i+1,j)+rec(i,j+1))%mod;
return dp[i][j]=2ll*inv3%mod*(rec(i,j+1)+rec(i+1,j))%mod;
}
void solve(){
cin>>n>>m;
int k;
cin>>k;
rep(i,n+1)rep(j,m+1)s[i][j]='.';
rep(i,k){
int x,y;
char ch;
cin>>x>>y>>ch;
s[x][y]=ch;
}
inv3=powmod(3,mod-2);
memset(dp,-1,sizeof(dp));
cout<<rec(1,1)*powmod(3ll,(n*m-k))%mod;
//rep(i,n+1){rep(j,n+1)cout<<dp[i][j];cout<<"\n";}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin>>t;
while(t--){
solve();
}
} |
#ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define unless(x) if(!(x))
#define until(x) while(!(x))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define mybit(i,j) (((i)>>(j))&1)
/*---------type/const---------*/
const int big=1000000007;
//const int big=998244353;
const double EPS=1e-8; //適宜変える
typedef long long ll;
typedef unsigned long long ull;
typedef std::string::const_iterator state; //構文解析
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const char newl='\n';
struct{
constexpr operator int(){return -int(1e9)-10;}
constexpr operator ll(){return -ll(1e18)-10;}
}neginf;
struct{
constexpr operator int(){return int(1e9)+10;}
constexpr operator ll(){return ll(1e18)+10;}
constexpr auto operator -(){return neginf;}
}inf;
/*---------debug---------*/
#ifdef LOGX
#include <template/debug.hpp>
#else
#define dbg(...) ;
#define dbgnewl ;
#define prt(x) ;
#define _prt(x) ;
#endif
/*---------function---------*/
template<typename T> T max(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=max(ans,elem);}return ans;}
template<typename T> T min(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=min(ans,elem);}return ans;}
template<typename T,typename U> bool chmin(T &a,const U b){if(a>b){a=b;return true;}return false;}
template<typename T,typename U> bool chmax(T &a,const U b){if(a<b){a=b;return true;}return false;}
bool valid(int i,int j,int h,int w){return (i>=0 && j>=0 && i<h && j<w);}
template<class T,class U>T expm(T x,U y,const ll mod=big){T res=1;while(y){if(y&1)(res*=x)%=mod;(x*=x)%=mod;y>>=1;}return res;}
template<class T,class U>T exp(T x,U y){T res=1;while(y){if(y&1)res*=x;x*=x;y>>=1;}return res;}
int main(){
//std::ios::sync_with_stdio(false);
//std::cin.tie(nullptr);
std::cout.precision(10);
/*------------------------------------*/
int n;
cin >> n;
vector<int> t(n);
rep(i,n)cin >> t[i];
//dp[i][j]=i個処理して左がj分の時右の最速.
vector<vector<int>> dp(n+1,vector<int>(1000001,inf));
dp[0][0]=0;
rep(i,n)rep(j,100001){
chmin(dp[i+1][j+t[i]],dp[i][j]);
chmin(dp[i+1][j],dp[i][j]+t[i]);
}
int ans=inf;
rep(j,100001){
chmin(ans,max(j,dp[n][j]));
}
cout << ans << newl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long sum = 0;
for(int i = 1 ; i < 100000000 ; i++ ) {
sum += i;
if(sum >= n) {
cout << i << endl;
break;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans = 0;
void Main(){
int n, m;
cin >> n >> m;
vector<int> a(m);
For(i,0,m) cin >> a[i];
a.push_back(0);
a.push_back(n+1);
m += 2;
sort(ALL(a));
int k = n + 1;
For(i,0,m-1){
if(a[i] + 1 == a[i+1]) continue;
k = min(k, a[i+1] - a[i] - 1);
}
For(i,0,m-1){
ans += (a[i+1] - a[i] - 1 + k - 1) / k;
}
cout << ans << endl;
}
int main(){
Main();
/*
東方風神録は神が出てくるので当然神ゲー
*/
return 0;
} |
/**
* Coded by : lucky_21
* --------Lokesh Singh
**/
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define fix fixed<<setprecision(10)
#define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
#define repb(i,b,a) for(int i=int(b);i>=int(a);i--)
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0)
typedef double db;
typedef long long ll;
const int N=2005;
const int mod=1e9+7;
int h,w,dis[N][N];
vector<pii>v[26];
char g[N][N];
bool inside(int x,int y){
if(g[x][y]=='#') return 0;
if(x>0 and y>0 and x<=h and y<=w) return 1;
return 0;
}
int bfs(pii p){
queue<pii>q;
q.push(p);
rep(i,1,h) rep(j,1,w) dis[i][j]=1e9;
dis[p.F][p.S]=0;
while(!q.empty()){
p=q.front();
q.pop();
if(g[p.F][p.S]=='G') return dis[p.F][p.S];
if(islower(g[p.F][p.S])){
for(pii t:v[g[p.F][p.S]-'a']) if(t!=p and dis[t.F][t.S]>dis[p.F][p.S]+1){
q.push(t);
dis[t.F][t.S]=dis[p.F][p.S]+1;
}
v[g[p.F][p.S]-'a'].clear();
}
rep(i,-1,1) rep(j,-1,1) if(abs(i)+abs(j)<=1 and dis[p.F+i][p.S+j]>dis[p.F][p.S]+1 and inside(p.F+i,p.S+j)){
dis[p.F+i][p.S+j]=dis[p.F][p.S]+1;
q.push({p.F+i,p.S+j});
}
}
return -1;
}
signed main(){
FastIO;
cin>>h>>w;
pii st;
rep(i,1,h) rep(j,1,w){
cin>>g[i][j];
if(islower(g[i][j])) v[g[i][j]-'a'].pb({i,j});
if(g[i][j]=='S') st={i,j};
}
cout<<bfs(st);
return 0;
}
|
#include <stdio.h>
#include <stdbool.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (int i = 0; i < n; i++) a[i] = ri();
int b[n];
for (int i = 0; i < n; i++) b[i] = ri();
int res = 0;
for (int i = 1; i <= 1000; i++) {
bool ok = true;
for (int j = 0; j < n; j++) if (i < a[j] || i > b[j]) ok = false;
if (ok) res++;
}
printf("%d\n", res);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int64_t n;
cin >> n;
int len = to_string(n).size();
int ans = 0;
if (len % 2 == 0) {
int n1 = n / pow(10, len / 2);
int n2 = n % (int64_t)pow(10, len / 2);
if (n1 > n2) ans--;
ans += (n1 - pow(10, len / 2 - 1) + 1);
}
for (int i = 2; i <= 12; i += 2) {
if (n >= pow(10, i)) ans += (9 * pow(10, i / 2 - 1));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int ans=0;
ans+=(7-a);
ans+=(7-b);
ans+=(7-c);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define cio ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define mod 1000000007
typedef long long ll;
//ll aa[6]={}
int main()
{
cio;
ll a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c<<endl;
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<iostream>
#include<bitset>
#include<stack>
const int inf = 0x3f3f3f3f;//1.06e9大小
const double PI = acos ( -1 );
const double eps = 1e-6;
typedef unsigned long long ull;
typedef long long ll;
#define pii pair<int ,int>
#define X first
#define Y second
#define lowbit(a) a&(-a)
using namespace std;
typedef long long ll;
const int mod=998244353;
const int N=2e5+5;
map<int,stack<int>> mp;
int n;
int f[N],a[N];
void add(int x){
for (int i=x;i<=n;i+=lowbit(i))
f[i]++;
}
int query(int x){
int res=0;
for (int i=x;i;i-=lowbit(i))
res+=f[i];
return res;
}
int main(){
scanf("%d",&n);
int x;
for (int i=1;i<=n;i++){
scanf("%d",&x);
x+=i;
mp[x].push(i);
}
int flg=0;
ll ans=0;
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
a[i]+=i;
}
for (int i=n;i;i--){
if (!mp[a[i]].empty())
{
int num=mp[a[i]].top();
mp[a[i]].pop();
add(num+1);
num-=query(num);
ans+=i-num;
}
else
{
flg=1;
break;
}
}
if (flg) printf("-1\n");
else printf("%lld\n",ans);
return 0;
}
| #include <bits/stdc++.h>
#define fu(a, b, c) for (ll a = b; a <= c; ++a)
#define fd(a, b, c) for (ll a = b; a >= c; --a)
#define mx(a, b) a = max(a, b)
#define mn(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
const ll N = 2e5 + 1, M = 998244353;
ll t, n, m, k, a, b, c, ans;
ll x[N], y[N];
set<pair<ll, ll>> s;
set<ll> s1;
int Tree[N << 2];
void Update(int l, int r, int x, int rt) {
if (l == r) {
Tree[rt]++;
return;
}
int mid = (l + r) >> 1;
if (x <= mid)
Update(l, mid, x, rt << 1);
else
Update(mid + 1, r, x, rt << 1 | 1);
Tree[rt] = Tree[rt << 1] + Tree[rt << 1 | 1];
}
int Query(int ql, int qr, int l, int r, int rt) {
if (l >= ql && r <= qr) {
return Tree[rt];
}
int mid = (l + r) >> 1;
int ans = 0;
if (ql <= mid)
ans += Query(ql, qr, l, mid, rt << 1);
if (qr > mid)
ans += Query(ql, qr, mid + 1, r, rt << 1 | 1);
return ans;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
fu(i, 1, n) cin >> x[i], s.emplace(x[i] + i, i);
fu(i, 1, n) cin >> y[i];
fu(i, 1, n) {
auto j = s.lower_bound({y[i] + i, 0});
if (j->first ^ y[i] + i) {
ans = -1;
break;
}
ll k = j->second;
ans += Query(k, n, 1, n, 1) + k - i;
Update(1, n, k, 1);
s.erase(j);
}
cout << ans;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int mxn = 500000;
int n;
int a[mxn], b[mxn];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++){
char c;
cin >> c;
a[i] = c & 1;
}
for(int i = 0; i < n; i++){
char c;
cin >> c;
b[i] = c & 1;
}
ll ret = 0;
for(int i = 0, j = 0; i < n; i++) if(a[i] != b[i]){
j = max(j, i + 1);
while(j < n && !a[j]) j++;
if(j == n){
ret = -1;
break;
}
a[j] = 0, ret += j - i;
}
cout << ret << endl;
return 0;
} | /*
author: Maksim1744
created: 14.11.2020 15:10:32
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
template<typename T> vector<T>& operator-- (vector<T>& v){for (auto& i : v) --i; return v;}
template<typename T> vector<T>& operator++ (vector<T>& v){for (auto& i : v) ++i; return v;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){for (auto& i : v) is >> i; return is;}
template<typename T> ostream& operator<<(ostream& os, vector<T>& v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p){is >> p.first >> p.second; return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>& p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}
#ifdef HOME
#define TAG_LENGTH 25
#define LR_LEFT left
#define LR_RIGHT right
#define LR_VALUE value
#define LR_SECOND_VALUE mn
#include "C:/C++ libs/print.cpp"
#else
#define showl 42;
#define shows 42;
#define show(...) 42;
#define showm(...) 42;
#define showt(...) 42;
#define printTree(...) 42;
#define printGraph(...) 42;
#define printLRTree(...) 42;
#define printMatrix(...) 42;
#define printWGraph(...) 42;
#define debug if (false)
#endif
const int inf = 1e9;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
string s, t;
cin >> s >> t;
vector<int> s1, t1;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') {
s1.pb(i);
}
if (t[i] == '1') {
t1.pb(i);
}
}
if (s1.size() % 2 != t1.size() % 2 || s1.size() < t1.size()) {
cout << -1 << '\n';
return 0;
}
vector<int> with(t1.size());
int ind = 0;
int last = -1;
vector<bool> u(s1.size(), false);
for (int i = 0; i < t1.size(); ++i) {
while (ind < s1.size() && (s1[ind] < t1[i] || (ind - last) % 2 != 1))
++ind;
if (ind == s1.size()) {
cout << -1 << '\n';
return 0;
}
with[i] = ind;
u[ind] = true;
last = ind;
}
ll ans = 0;
last = -1;
for (int i = 0; i < t1.size(); ++i) {
ans += s1[with[i]] - t1[i];
}
for (int i = 0; i < s1.size(); ++i) {
if (u[i]) continue;
if (last == -1) {
last = s1[i];
} else {
ans += s1[i] - last;
last = -1;
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
const int MOD=1000000007;
signed main(){
int n,m;cin>>n>>m;
vector<set<int>> edge(n);
rep(i,m){
int a,b;cin>>a>>b;
--a;--b;
edge[a].insert(b);
edge[b].insert(a);
}
lint res=0;
auto binary_graph=[&](vector<int>const& h,int& sm)->bool{
int hn=h.size();
vector<int> memo(hn,0);
vector<vector<int>> edge2(hn);
rep(i,hn){
for(int j=i+1;j<hn;++j){
if(edge[h[i]].find(h[j])!=edge[h[i]].end()){
edge2[i].push_back(j);
edge2[j].push_back(i);
}
}
}
rep(st,hn){
if(memo[st]>0)continue;
queue<int> que;
que.push(st);
++sm;
memo[st]=1;
while(!que.empty()){
int no=que.front();que.pop();
for(auto& e:edge2[no]){
if(memo[e]==0){
memo[e]=3^memo[no];
que.push(e);
}
else if(memo[e]==memo[no])return false;
}
}
}
return true;
};
rep(bit,(1<<n)){
vector<int> g,h;
rep(i,n){
if(bit&(1<<i))g.push_back(i);
else h.push_back(i);
}
bool flag=false;
rep(i,g.size()){
for(int j=i+1;j<g.size();++j){
if(edge[g[i]].find(g[j])!=edge[g[i]].end())flag=true;
}
}
if(flag)continue;
int cnt=0;
if(binary_graph(h,cnt)){
res+=(1<<cnt);
//debug(bit);
//debug((1<<cnt));
}
}
cout<<res<<"\n";
return 0;
}
/*
5 4
1 2
2 3
3 4
4 5
18
*/ | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int mod = 1e9 + 7;
int dp[4][100][100];
int AB[200], *A = AB, *B = AB + 100;
constexpr ll modpow(ll A, ll B) {
ll kotae = 1;
while (B > 0) {
if (B & 1) kotae = kotae * A % mod;
A = A * A % mod;
B >>= 1;
}
return kotae;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, K;
cin >> N >> M >> K;
rep(i, N) {
cin >> A[i];
}
auto mae1 = dp[0], mae2 = dp[1], ato1 = dp[2], ato2 = dp[3];
rep(i, N) mae1[i][i] = 1;
int are = modpow(2 * M, mod - 2);
rep(i, M) {
int x, y;
cin >> x >> y;
x--;
y--;
(mae1[x][x] += mod - are) %= mod;
(mae1[x][y] += are) %= mod;
(mae1[y][x] += are) %= mod;
(mae1[y][y] += mod - are) %= mod;
}
rep(x, N) rep(y, N) mae2[y][x] = mae1[x][y];
rep(i, 30) {
if (K >> i & 1) {
rep(i, N) {
ll tmp = 0;
rep(j, N) tmp += (ll)mae1[i][j] * A[j] % mod;
B[i] = tmp % mod;
}
swap(A, B);
}
rep(x, N) rep(y, N) {
auto tmp1 = mae1[x];
auto tmp2 = mae2[y];
unsigned long long tmp = 0;
rep(z, N) {
tmp += *tmp1++ * (ll)*tmp2++;
if (!(z & 15)) tmp %= mod;
}
ato2[y][x] = (ato1[x][y] = tmp % mod);
}
swap(mae1, ato1);
swap(mae2, ato2);
}
rep(i, N) co(A[i]);
Would you please return 0;
} |
#include<bits/stdc++.h>
using namespace std;
/*Uzumaki Naruto
Mesut Ozil
Harry Potter*/
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define HarryPotter ios::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
#define MAX 100000000LL
#define mod 1000000007LL
#define inf 1000000000000000000LL
#define mI2 500000004LL
inline ll add(ll a, ll b){ return ((a%mod) + (b%mod))%mod;}
inline ll mul(ll a, ll b){ return ((a%mod) * (b%mod))%mod;}
inline ll sub(ll a, ll b){ return ((a%mod) - (b%mod) + mod)%mod;}
void Ojas(){
ll n;
cin>>n;
ll ar[n];
for(ll i=0;i<n;i++){
cin>>ar[i];
}
ll mini = LLONG_MAX;
for(ll i=0;i<pow(2,n);i++){
ll *nar = new ll[n]();
ll temp = i,j=0,prev_bit=temp%2;
ll num = ar[j],curr=0;
while(temp){
if(temp%2==1){
nar[j] = 1;
}
j++;
temp = temp>>1;
}
j = 0;
while(j<n){
if(nar[j]==prev_bit){
num = num|ar[j];
}else{
prev_bit = 1-prev_bit;
curr = curr^num;
num = ar[j];
}
j++;
}
mini = min(mini,curr^num);
}
cout<<mini;
}
int main(){
int t=1;
//cin>>t;
for(int i=1;i<=t;++i){
Ojas();
}
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n, a[1000];
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a, a + n);
for(int i = 1; i <= n; i++){
if(i != a[i - 1]){
cout << "No" << endl;
break;
}
if(i == n){
cout << "Yes" << endl;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define li long int
#define fi first
#define se second
#define ve vector<ll>
#define mp make_pair
#define pr pair<ll,ll>
#define rep(i,n) for(ll i=0;i<n;i++)
#define repji(j,i,n) for(ll j=i;j<n;j++)
#define rev(i,n) for(ll i=n;i>=0;i--)
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL)
int main()
{
speed;
ll a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if(a[1]-a[0]==a[2]-a[1])
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
int aa = a1;
if (a2 > aa)aa = a2;
if (a3 > aa)aa = a3;
int ss = a1;
if (a2 < ss)ss = a2;
if (a3 < ss)ss = a3;
int dd = a1 + a2 + a3 - aa - ss;
if (aa - dd == dd - ss)cout << "Yes";
else cout << "No";
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>
#include <csignal>
#include <chrono>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <limits>
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-7
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define N 200005
vector<vi> g;
int c[N];
int cycles = 0;
void dfs(int v) {
c[v] = 1;
REP(i, sz(g[v])) {
int u = g[v][i];
if (c[u] == 1) {
cycles++;
} else
if (c[u] == 0) {
dfs(u);
}
}
c[v] = 2;
}
ll mod = 998244353ll;
ll binpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
n /= 2;
}
return res;
}
int main(void) {
CL(c, 0);
int n;
scanf("%d", &n);
g.resize(n);
REP(i, n) {
int x;
scanf("%d", &x);
x--;
g[i].pb(x);
}
REP(i, n) {
if (c[i] == 0) {
dfs(i);
}
}
ll res = binpow(2ll, cycles);
res = (res - 1 + mod) % mod;
printf("%lld\n", res);
}
| #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i, s, n) for (int i = s; i < (int)(n); ++i)
#define print(x) cout << x << "\n"
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
typedef long long ll;
using namespace std;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vector<int> >;
int main(){
ll n; cin >> n;
// cout << n << endl;
vector<int> a;
while(n>10){
int b;
b = n%10;
a.push_back(b);
n /= 10;
}
a.push_back(n);
int bs;
bs = a.size();
// rep(i,bs) cout << a[i] << endl;
int amod = accumulate(ALL(a),0);
amod %= 3;
if(amod==0) cout << 0 << endl;
if(amod==1&&bs!=1){
int aa=0;
bool bb=false;
rep(i,bs){
if(a[i]%3==1) {cout << 1 << endl;bb=true;break;}
else if(a[i]%3==2) aa++;
}
if(!bb){
if(aa==bs) cout << -1 << endl;
else if(aa==1) cout << 1 << endl;
else cout << 2 << endl;
}
}
if(amod==1 && bs==1) cout << -1 << endl;
if(amod==2 && bs!=1){
int aa=0;
bool bb=false;
rep(i,bs){
if(a[i]%3==2) {cout << 1 << endl;bb=true;break;}
if(a[i]%3==1) aa++;
}
if(!bb){
if(aa == bs) cout << -1 << endl;
else cout << 2 << endl;
}
}
if(amod==2&&bs==1) cout << -1 << endl;
} |
#include<stdio.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline int Max(size_t a,size_t b){return a>b?(int)a:(int)b;}
static inline int Min(size_t a,size_t b){return a<b?(int)a:(int)b;}
int main()
{
int T;if(!scanf("%d",&T)){return -1;}
while(T--)
{
char S[1001];int aa=1;
if(!scanf("%s",S)){return -1;}
if(strncmp("atcoder",S,Max(strlen(S),7))<0){puts("0");continue;}
else
{
if(S[0]=='a'&&S[1]>'a'){puts("1");continue;}
rep(i,6)
{
if(S[i+1]>'t'){printf("%d\n",i);goto jump;}
if(S[i+1]>'a'){printf("%d\n",i+1);goto jump;}
if(i==(int)strlen(S)-1){break;}
}
rep(i,(int)strlen(S)-1){if(S[i+1]!='a'){aa=0;break;}}
if(aa){puts("-1");continue;}
rep(i,(int)strlen(S)-1)
{
if(S[i+1]>'t'){printf("%d\n",i);goto jump;}
if(S[i+1]>'a'){printf("%d\n",i+1);goto jump;}
}
puts("-1");jump:continue;
}
}
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
vector<pair<int, pair<int, int>>> v(n);
for(int i = 0; i < n; ++i) {
cin >> v[i].second.first >> v[i].first >> v[i].second.second;
}
sort(v.begin(), v.end());
for(int i = 0; i < n; ++i) {
if(v[i].second.first < v[i].second.second) {
cout << v[i].first;
return;
}
}
cout << "-1";
}
int main() {
int t = 1;
// cin >> t;
while(t--) {
solve();
}
} |
#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7,INF=1e18;
#define ll long long
#define pll pair<ll,ll>
#define x first
#define y second
#define p_all(arr) for(auto i:arr){cout<<i<<" ";}cout<<"\n";
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll t=1;
// cin>>t;
while(t--)
{
ll n,s;
cin>>n>>s;
s*=100;
ll sum=0;
ll flag=-1;
for(int i=0;i<n;i++)
{
ll u,v;
cin>>u>>v;
sum+=u*v;
if(flag==-1&&sum>s)
flag=i+1;
}
cout<<flag<<"\n";
}
return 0;
} | #include <vector>
#include <string>
#include <iostream>
using namespace std;
int main(void)
{
long long n;
cin >> n;
long long sum = 0;
vector<long long>a(n), b(n);
for (long long i = 0; i < n; i++) {
cin >> a.at(i) >> b.at(i);
sum += b.at(i)*(b.at(i) + 1) / 2 - a.at(i)*(a.at(i) - 1) / 2;
}
cout << sum << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 1500010;
int a[N], ct[N];
int main(){
int n, m, res = 1e9;
scanf("%d %d", &n, &m);
if(n == 1){
cout<<1<<endl;
return 0;
}
for(int i = 0; i < n; i ++){
scanf("%d", &a[i]);
if(i < m)
ct[a[i]] ++;
}
for(int i = 0; i <= n; i ++){
if(ct[i] == 0){
res = i;
break;
}
}
for(int i = m; i < n ; i ++){
int cnt = -1;
ct[a[i - m]] --;
ct[a[i]] ++;
if(ct[a[i - m]] == 0)
res = min(res, a[i - m]);
// if(a[i - m] < res && ct[a[i - m]] == 0)
// cnt = a[i - m];
// // else if(a[i] == res)
// // for(int j = res + 1; j < n; j ++)
// // if(ct[j] == 0){
// // cnt = j;
// // break;
// // }
// if(cnt != -1) res = min(res, cnt);
if(res == 0){
cout<<res<<endl;
return 0;
}
}
cout<<res<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int n,m;
cin >> n >> m;
int a[n];
rep(i,n) cin >> a[i];
set<int> b;
map<int,int> c;
rep(i,1.5*1e6+1) b.insert(i);
rep(i,m){
c[a[i]]++;
b.erase(a[i]);
}
int ans = *begin(b);
for(int i=0;i+m<n;i++){
c[a[i]]--;
c[a[i+m]]++;
if(c[a[i]]==0) b.insert(a[i]);
if(0<c[a[i+m]]) b.erase(a[i+m]);
ans = min(ans,*begin(b));
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
int N;
vector<pii> V, X;
signed main()
{
cin >> N;
rep(i, N)
{
int x, c;
cin >> x >> c;
V.push_back({c, x});
}
sort(V.begin(), V.end());
pii now = {0, 0};
X.push_back(now);
rep(i, N)
{
if(i == 0 || V[i - 1].first != V[i].first)now.first = V[i].second;
if(i == N - 1 || V[i].first != V[i + 1].first)
{
now.second = V[i].second;
X.push_back(now);
}
}
X.push_back({0, 0});
int l = 0, r = 0;
for(int i = 0; i < X.size() - 1; i++)
{
pii now = X[i], next = X[i + 1];
int nl = min(l + abs(now.first - next.second) + abs(next.first - next.second),
r + abs(now.second - next.second) + abs(next.first - next.second));
int nr = min(l + abs(now.first - next.first) + abs(next.first - next.second),
r + abs(now.second - next.first) + abs(next.first - next.second));
l = nl, r = nr;
}
cout << min(l, r) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
const int MOD = 1e9+ 7;
const int INF = numeric_limits<int>::max() - (int)1e8;
const ll INFLL = numeric_limits<ll>::max() - (ll)1e17;
int main() {
int N;
cin >> N;
vector<vector<ll>> A(N + 1);
for (int i = 0; i < N; i++) {
ll X, C;
cin >> X >> C;
A[C].push_back(X);
}
for (int i = 1; i <= N; i++) {
sort(A[i].begin(), A[i].end());
}
// 0: under, 1: upper
vector<vector<pair<ll, int>>> dp(N + 1, vector<pair<ll, int>>(2, {INFLL, -1}));
dp[0] = vector<pair<ll, int>>(2, {0, 0});
for (int i = 1; i <= N; i++) {
if (A[i].empty()) {
dp[i] = dp[i - 1];
continue;
}
dp[i][0].second = *A[i].begin();
dp[i][1].second = *A[i].rbegin();
ll dif = dp[i][1].second - dp[i][0].second;
for (int a = 0; a <= 1; a++) {
for (int b = 0; b <= 1; b++) {
ll tmp = dif + abs(dp[i - 1][a].second - dp[i][b^1].second);
dp[i][b].first = min(dp[i][b].first, dp[i - 1][a].first + tmp);
}
}
}
cout << min(dp[N][0].first + abs(dp[N][0].second), dp[N][1].first + abs(dp[N][1].second)) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long double n;cin>>n;
long double a,b,c,d;cin>>a>>b>>c>>d;
const long double alp=2*M_PI/n;
long double x=(a+c)/2,y=(b+d)/2;
long double ansx=(a-x)*cos(alp)-(b-y)*sin(alp)+x;
long double ansy=(a-x)*sin(alp)+(b-y)*cos(alp)+y;
cout<<setprecision(16)<<ansx<<" "<<ansy<<endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <complex>
using namespace std;
typedef long double ld;
ld pi = acos(-1);
ld x[2],y[2];
int main(){
cout.precision(20);
int i,n; cin >> n;
for(i=0;i<2;i++) cin >> x[i] >> y[i];
complex<ld> c1(x[0],y[0]),c2(x[1],y[1]),c3(cos((ld)2*pi/(ld)n),sin((ld)2*pi/(ld)n));
complex<ld> c4 = (c1 - c2)*c3/(ld)2 + (c1 + c2)/(ld)2;
cout << c4.real() << " " << c4.imag() << endl;
} |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
ll dp[18];
char S[200200];
int suuji(char c) {
if (c < 'A') return c - '0';
else return c - ('A' - 10);
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
fread(S, 1, 200200, stdin);
int K = 0;
int N = 200200 - 1;
while (S[N] != ' ') N--;
int tmp = N + 1;
while (S[tmp] >= '0') K = K * 10 + S[tmp++] - '0';
const int mod = 1e9 + 7;
int k = suuji(S[0]);
dp[1] = k - 1;
int kazu = 1 << 15 - k;
rep1(i, N - 1) {
if (!(i & 7)) for (int j = 2; j <= 16; j++) dp[j] %= mod;
for (int j = 16; j >= 1; j--) {
dp[j + 1] += (16 - j) * dp[j];
dp[j] = j * dp[j];
}
dp[1] += 15;
int k = suuji(S[i]);
int k1 = __builtin_popcount(kazu >> 16 - k);
int kazu0 = __builtin_popcount(kazu);
dp[kazu0] += k1;
dp[kazu0 + 1] += k - k1;
kazu |= 1 << 15 - k;
}
ll kotae = dp[K];
kotae += (__builtin_popcount(kazu) == K);
printf("%lld", kotae % mod);
Would you please return 0;
} | #include<bits/stdc++.h>
using namespace std;
int cvrt(string s){
int res=0;
for(auto &c : s){if(c=='1'){res++;}}
return res%2;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m;
cin >> n >> m;
vector<string> s(n);
vector<long long> mem(2);
for(int i=0;i<n;i++){
cin >> s[i];
mem[cvrt(s[i])]++;
}
cout << mem[0]*mem[1] << '\n';
return 0;
}
|
#include <iostream>
using namespace std;
#define ll long long
int main()
{
ll int arr[4] , sum =0 ;
for(int i=0;i<4;i++)
{
cin>>arr[i];
sum+=arr[i];
}
for(int i=1;i<=15;i++)
{
ll int s = 0;
for(int j=0;j<4;j++)
{
if( i & (1<<j))
{
s+=arr[j];
}
}
if(2*s == sum)
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
fast
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a + b == c + d || a + c == b + d || a + d == b + c || a == b + c + d || b == a + c + d || c == a + b + d || d == a + b + c){
cout << "Yes\n";
}else cout << "No\n";
} |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int main(){
cin>>n>>m;
cout<<n*(1+m)*m/2+m*(1+n)*n/2*100;
}
| #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b; cin>>a>>b;
int ans = 0;
for(int floor = 1; floor<=a; floor++) {
for(int room = 1; room<=b; room++) {
ans+=(floor * 100 + room);
}
}
cout<<ans;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int a,b,c,i,j,k;
scanf("%d %d %d",&a,&b,&c);
c=c*1000;
i=b-a;
if(c%b==0)
printf("%d ",c/b);
else {
k=c/b+1;
j=b*k-c;
if((double)j/i>k) {
printf("UNSATISFIABLE");
return 0;
} else
printf("%d ",k);
}
if(c%a==0)
printf("%d",c/a);
else {
k=c/a;
j=c-a*k;
if((double)j/i>k)
printf("UNSATISFIABLE");
else
printf("%d",k);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long a b;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define MOD 1000000007
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")
int main()
{
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int mini = INT_MAX, maxi = 0;
if (W%A==0) {
maxi = W / A;
}
if (W%B==0) {
mini = W / B;
}
if (maxi>0&&mini>0) {
doublece(mini,maxi)
}
else {
if (W/A==W/B) {
ce("UNSATISFIABLE")
}
else {
doublece(W / B+1, W / A)
}
}
return 0;
} |
#include <iostream>
#include <cstdlib>
#include <bitset>
#include <map>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
#include <sstream>
using namespace std;
#define ll long long
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define vecdouble vector<double>
#define vecchar vector<char>
#define vecstr vector<string>
#define vec2str vector<vector<string>>
#define vecbool vector<bool>
#define vec2bool vector<vector<bool>>
#define pairll pair<ll,ll>
#define vecpairll vector<pair<long long,long long>>
#define forll(s,a,b) for(long long s = a;s < b;s++)
#define forllde(s,a) for(long long s = a;s >= 0;s--)
#define INF 1000000000000
#define Pi 3.1415926535897932384626
int main() {
ll x,y,a,b, ans = 0;
string s = "No";
bool flag = false;
cin >> x >> y >> a >> b;
while (x < y)
{
if (x*a >= y && x + b >= y)
break;
else if ((double)x*(double)a < (double)x + (double)b)
{
ans++;
x *= a;
}
else
{
ll buf = (y - 1 - x) / b;
ans+=buf;
x += b * buf;
break;
}
}
cout << ans;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
#define vll vector<ll>
#define vvl vector<vll>
#define pll pair<ll,ll>
#define F first
#define S second
#define MOD 1000000007
ll max(ll a,ll b){if (a>b) return a; else return b;}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b, a%b);}
ll lcm(ll a, ll b){return a*b/gcd(a, b);}
ll fexp(ll a, ll b){ll ans = 1;while(b){if(b&1) ans = ans*a%MOD; b/=2;a=a*a%MOD;}return ans;}
ll inverse(ll a, ll p){return fexp(a, p-2);}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll T=1;
//cin >> T;
ll t=0;
while(t++<T){
ll N;
cin >> N;
vll a(N),b(N);
fo(i,N) cin >> a[i];
fo(i,N) cin >> b[i];
ll s=0;
fo(i,N) s+=a[i]*b[i];
if(s==0) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
} |
#include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);}
const int N=105,mod=1000000007,inv2=(mod+1)/2;
typedef long long ll;
template<typename _Tp1,typename _Tp2>inline void add(_Tp1 &a,_Tp2 b){(a+=b)>=mod&&(a-=mod);}
template<typename _Tp1,typename _Tp2>inline void sub(_Tp1 &a,_Tp2 b){(a-=b)<0&&(a+=mod);}
ll ksm(ll a,ll b=mod-2){ll res=1;while(b){if(b&1)res=res*a%mod;a=a*a%mod,b>>=1;}return res;}
int a[N],b[N];
int X[N*N],Y[N*N],n;
struct mat{
int a[N][N];
mat operator * (const mat &o)const{
mat c;memset(c.a,0,sizeof(c.a));
for(int i=0;i<n;++i)for(int k=0;k<n;++k)for(int j=0;j<n;++j)add(c.a[i][j],1ULL*a[i][k]*o.a[k][j]%mod);
return c;
}
}I,M,orig;
mat ksm(mat a,int b){
mat res=I;
while(b){
if(b&1)res=res*a;
a=a*a,b>>=1;
}
return res;
}
int main(){
int m,k;read(n,m,k);
for(int i=0;i<n;++i)I.a[i][i]=1;
for(int i=0;i<n;++i)read(orig.a[i][0]);
for(int i=1;i<=m;++i)read(X[i],Y[i]);
ll inv=ksm(m);
for(int i=0;i<n;++i)M.a[i][i]=1;
for(int i=1;i<=m;++i){
int x=X[i]-1,y=Y[i]-1;
add(M.a[x][x],1LL*inv*(mod-inv2)%mod),add(M.a[x][y],1LL*inv*inv2%mod);
add(M.a[y][y],1LL*inv*(mod-inv2)%mod),add(M.a[y][x],1LL*inv*inv2%mod);
}
mat o=ksm(M,k)*orig;
for(int i=0;i<n;++i)printf("%d\n",o.a[i][0]);
return 0;
} | //全力以赴
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll extGcd(ll a, ll b, ll &x, ll &y) { // solves for x and y where ax+by=gcd(a,b)
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll modInv(ll a, ll p) { // solve for x=a^-1 where ax + py = 1 % p
if(gcd(a, p) != 1) return -1; // modInv only exists if a and p are coprime (gcd(a, p) = 1)
ll x, y;
extGcd(a, p, x, y);
x = (x % p + p) % p;
return x;
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a,b);
}
/*
a^b:
if b is even -> a^b = a^(b/2) * a^(b/2)
if b is odd -> a^b = a * a^(b-1/2) * a^(b-1/2)
*/
ll modPow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * a) % mod;
a = (a * a) % mod;
n >>= 1;
}
return res;
}
int find(int x) {
return x == parent[x] ? x : parent[x] = find(parent[x]);
}
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if(xPar != yPar) parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for(ll i=1;i<=r;i++) {
res = res * (n - r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
int msbPos(int n) {
if(n == 0) return 0;
int msbPos = 0;
n /= 2;
while(n != 0) {
n /= 2;
msbPos++;
}
return msbPos;
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m), c;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<m;i++) cin >> b[i];
set_symmetric_difference(a.begin(), a.end(), b.begin(), b.end(), back_inserter(c));
for(auto x : c) cout << x << ' ';
cout << endl;
}
int main()
{
IOS
//int t;
//cin >> t;
//while(t--) solve();
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li n;
vector<li> edges[111];
unordered_map<bitset<110>, double> memo;
inline set<li> visit(li root) {
queue<li> q;
q.push(root);
set<li> res;
while (!q.empty()) {
li now = q.front();
q.pop();
if (res.count(now) > 0) {
continue;
}
res.insert(now);
for (auto next : edges[now]) {
q.push(next);
}
}
return res;
}
int main() {
cin >> n;
rin{
string s;
cin >> s;
rep(j, n) {
if (s[j] == '1') {
edges[i].pb(j);
}
}
}
vector<li> deletable(n);
rin{
for (auto v : visit(i)) {
deletable[v]++;
}
}
double res = 0.0;
rin{
res += 1.0 / deletable[i];
}
printf("%.12f\n", res);
return 0;
} | #pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)(x).size()
#define X first
#define Y second
#define mp make_pair
#define pii pair<int , int>
#define vec vector
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
ll poww(ll a, ll b, ll md) {
return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
const int maxn = 100+5 ;
const ll inf = 9223372036854775807 ;
const ll mod = 1e9 + 7 ;
ll n , cnt , mark[maxn] ;
vec<int> adj[maxn] ;
string s[maxn] ;
long double ans ;
void dfs(int v){
cnt++ ;
mark[v] = 1 ;
for(auto u : adj[v]) if(!mark[u]) dfs(u) ;
}
int main()
{
migmig ;
cin>>n ;
for(int i = 1 ; i <= n ; i ++ ){
cin>>s[i] ;
s[i] = '#' + s[i] ;
for(int j = 1 ; j <= n ; j ++ ){
if(s[i][j] == '1'){
adj[j].pb(i) ;
}
}
}
for(int i = 1 ; i <= n ; i ++ ){
dfs(i) ;
ans += 1/(long double)(cnt) ;
cnt = 0 ;
memset(mark , 0 , sizeof mark) ;
}
cout<<fixed<<setprecision(9)<<ans ;
}
|
#include <bits/stdc++.h>
using namespace std;
#define w(x) int x;cin>>x;while(x--)
#define ll long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define vi vector<int>
#define fr(a,b) for(int i=a;i<=b;i++)
#define inf 1e18
#define mod 1000000007
int main()
{
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r",stdin);
freopen("output.txt", "w",stdout);
#endif*/
fast;
ll a,b;
cin>>a>>b;
ll k=(a+b)/2;
cout<<k<<" "<<(a-k)<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
cout << (a+b)/2 << " " << (a-b)/2;
return 0;
} |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
class DisjointSet {
public:
DisjointSet(int n) : N(n), sz(n), pars(n, -1) {
}
void reset() { sz = N, fill(pars.begin(), pars.end(), -1); }
int find(int x) { return pars[x] < 0 ? x : pars[x] = find(pars[x]); }
int size() { return sz; }
int count(int x) { return -pars[find(x)]; }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y) { return false; }
--sz;
if (pars[x] < pars[y]) { swap(x, y); }
pars[y] += pars[x];
pars[x] = y;
return true;
}
bool isSame(int x, int y) { return find(x) == find(y); }
private:
int N, sz;
vector<int> pars;
};
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
int n;
cin >> n;
int m;
cin >> m;
vector<int> A(m);
vector<int> B(m);
for (int i = 0; i < m; ++i) {
cin >> A[i] >> B[i];
--A[i], --B[i];
}
vector<int> C(n);
for (int i = 0; i < n; ++i) {
cin >> C[i];
}
auto cmp = [&](int l, int r) {
return C[l] < C[r];
};
vector<int> ord(n, 0);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), cmp);
DisjointSet ds(n);
vector<vector<bool>> E(n, vector<bool>(n, false));
for (int i = 0; i < m; ++i) {
int u = A[i], v = B[i];
E[u][v] = E[v][u] = true;
if (C[u] == C[v]) {
ds.unite(u, v);
}
}
vector<int> dirs(m, 0);
for (int i = 0; i < m; ++i) {
int u = A[i], v = B[i];
if (C[u] != C[v]) {
dirs[i] = C[u] < C[v];
}
}
map<pair<int,int>, int> M;
for (int i = 0; i < m; ++i) {
M.emplace(make_pair(A[i], B[i]), i);
}
vector<bool> visited(n, false);
function<void(int,int,int)> dfs = [&](int u, int p, int s) {
visited[u] = true;
for (int v = 0; v < n; ++v) {
if (v == p) {
continue;
}
if (E[u][v] && ds.find(v) == s) {
auto it = M.find(make_pair(u, v));
int ans = 0;
int idx = -1;
if (it == M.end()) {
it = M.find(make_pair(v, u));
if (it != M.end()) {
ans = 1;
idx = it->second;
M.erase(it);
}
} else {
idx = it->second;
M.erase(it);
}
// cout << u << "," << v << " : " << idx << " " << ans << endl;
if (idx >= 0) {
dirs[idx] = ans;
}
if (!visited[v]) {
dfs(v, u, s);
}
}
}
};
for (int i = 0; i < n; ++i) {
if (ds.count(i) > 1 && ds.find(i) == i) {
dfs(i, -1, i);
}
}
vector<string> DIRS{"->", "<-"};
for (int i = 0; i < m; ++i) {
cout << DIRS[dirs[i]] << '\n';
}
return 0;
} | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> void fin(T a) { cout << a << '\n'; exit(0); }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
INT(n, m);
vvp G(n);
vi a(m), b(m);
rep(i, m) {
scan(a[i], b[i]);
a[i]--;
b[i]--;
}
vi c(n);
cin >> c;
vi ans(m, -1);
int cnt = 0;
auto direct = [&](int id, int from, int to) {
if (a[id] == from) ans[id] = 0;
else ans[id] = 1;
};
rep(i, m) {
if (c[a[i]] > c[b[i]]) direct(i, a[i], b[i]);
else if (c[a[i]] < c[b[i]]) direct(i, b[i], a[i]);
else {
G[a[i]].eb(b[i], i);
G[b[i]].eb(a[i], i);
cnt++;
}
}
vb seen(n);
auto dfs = [&](auto &self, int u, int p) -> void {
seen[u] = true;
for (auto[v, id] : G[u]) {
if (v == p) continue;
if (ans[id] < 0) direct(id, u, v);
if (!seen[v]) {
self(self, v, u);
}
}
};
rep(i, n) {
if (seen[i]) continue;
dfs(dfs, i, -1);
}
rep(i, m) {
assert(ans[i] >= 0);
cout << (ans[i] ? "<-" : "->") << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,ans;
int a[N],cnt[N],ch1[N],ch2[N],dp[N],sto1[N],sto2[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i]%=200;
if(!a[i])a[i]=200;
}
dp[0]=1;
for(int i=1;i<=n;i++)
for(int j=1e4;j>=a[i];j--)
{
dp[j]+=dp[j-a[i]];
if(dp[j-a[i]])
{
if(ch1[j])ch2[j]=ch1[j];
ch1[j]=i;
}
}
for(int i=1;i<=1e4;i++)
{
if(dp[i]>=2)
{
ans=i;
break;
}
if(dp[i])cnt[i%200]++;
}
if(ans)
{
int cnt1=0,cnt2=0,x=ans,y=ans;
// cout<<ans<<endl;
// cout<<ch2[31]<<endl;
while(x)
{
sto1[++cnt1]=ch1[x];
x-=a[ch1[x]];
}
while(y)
{
if(!ch2[y])ch2[y]=ch1[y];
sto2[++cnt2]=ch2[y];
y-=a[ch2[y]];
// printf("%d ",ch2[y]);
}
sort(sto1+1,sto1+cnt1+1);
sort(sto2+1,sto2+cnt2+1);
sto1[0]=cnt1;sto2[0]=cnt2;
printf("Yes\n");
for(int i=0;i<=cnt2;i++)printf("%d ",sto2[i]);
cout<<endl;
for(int i=0;i<=cnt1;i++)printf("%d ",sto1[i]);
}
else
{
ans=-1;
for(int i=0;i<=200;i++)
{
if(cnt[i]>=2)
{
ans=i;
break;
}
}
if(ans==-1)
{
printf("No");
return 0;
}
int ans1=-1,ans2=-1;
for(int i=0;i<=200;i++)
{
if(dp[i*200+ans]&&ans1==-1)
{
ans1=i*200+ans;
}
else if(dp[i*200+ans]&&ans2==-1)
{
ans2=i*200+ans;
break;
}
}
int cnt1=0,cnt2=0;
while(ans1)
{
sto1[++cnt1]=ch1[ans1];
ans1-=a[ch1[ans1]];
}
while(ans2)
{
sto2[++cnt2]=ch1[ans2];
ans2-=a[ch1[ans2]];
}
sort(sto1+1,sto1+cnt1+1);
sort(sto2+1,sto2+cnt2+1);
sto1[0]=cnt1;sto2[0]=cnt2;
printf("Yes\n");
for(int i=0;i<=cnt2;i++)printf("%d ",sto2[i]);
cout<<endl;
for(int i=0;i<=cnt1;i++)printf("%d ",sto1[i]);
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
void rec(int *idx, int s, int baki, function<void(int *)> fun)
{
if (baki == 0) fun(idx);
else
{
if (s < 0) return;
rec(idx, s - 1, baki, fun);
idx[baki - 1] = s;
rec(idx, s - 1, baki - 1, fun);
}
}
void cmb(int n, int k, function<void(int *)> fun)
{
int idx[k];
rec(idx, n - 1, k, fun);
}
ll ok;
vector<ll> a;
vector<vector<vector<ll>>> vec;
int main()
{
fast_io;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
a = vector<ll>(n);
vec = vector<vector<vector<ll>>>(200);
for (int i = 0; i < n; i++)
{
cin >> a[i];
a[i] %= 200;
}
for (int i = 1; i <= n; i++)
{
ok = i;
cmb(n, i, [](int *ind)
{
vector<ll> t;
ll ts = 0;
for (int j = 0; j < ok; j++)
{
t.push_back(ind[j] + 1);
ts += a[ind[j]];
}
if (vec[ts % 200].size() <= 0) vec[ts % 200].push_back(t);
else
{
cout << "YES" << endl;
cout << vec[ts % 200][0].size();
for (auto pl : vec[ts % 200][0]) cout << " " << pl;
cout << endl;
cout << t.size();
for (auto pl : t) cout << " " << pl;
cout << endl;
exit(0);
}
});
}
cout << "NO" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;;
int a[N * N], b[N * N], c[N], mp[N][N];
int n, m;
bool vis[N];
string ans[N*N];
void dfs(int u) {
vis[u] = true;
for (int i = 1; i <= n; i++) {
if (mp[u][i]) {
mp[i][u] = false;
if (!vis[i]) dfs(i);
}
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++)
cin >> a[i] >> b[i];
for (int i = 1; i <= n; i++)
cin >> c[i];
for (int i = 1; i <= m; i++) {
if (c[a[i]] > c[b[i]]) ans[i] = "->";
else if (c[b[i]] > c[a[i]]) ans[i] = "<-";
else mp[a[i]][b[i]] = mp[b[i]][a[i]] = true;
}
for (int i = 1; i <= n; i++)
if (!vis[i]) dfs(i);
for (int i = 1; i <= m; i++) {
if (mp[a[i]][b[i]]) ans[i] = "->";
else if (mp[b[i]][a[i]]) ans[i] = "<-";
}
for (int i = 1; i <= m; i++)
cout << ans[i] << endl;
return 0;
} | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<pair<int, int>> E[101];
rep1(i, M) {
int a, b;
cin >> a >> b;
E[a].pb({ b, i });
E[b].pb({ a, -i });
}
int C[101];
rep1(i, N) cin >> C[i];
int vis[101] = {};
int kotae[10000];
rep1(i, N) {
if (!vis[i]) {
pair<int, int> Q[10000];
int a = 0;
Q[a++] = { i, 0 };
while (a) {
int fr = Q[--a].first;
int mae = Q[a].second;
if (vis[fr]) continue;
vis[fr] = 1;
for (auto p : E[fr]) {
int to = p.first;
int dotti = p.second;
if (!vis[to]) {
if (C[fr] == C[to]) {
kotae[abs(dotti)] = dotti;
Q[a++] = { to, fr };
}
}
else if (mae != to) {
kotae[abs(dotti)] = dotti;
}
}
}
}
for (auto p : E[i]) {
int to = p.first;
int dotti = p.second;
if (C[i] < C[to]) kotae[abs(dotti)] = -dotti;
else if (C[i] > C[to]) kotae[abs(dotti)] = dotti;
}
}
rep1(i, M) {
if (kotae[i] > 0) co("->");
else co("<-");
}
Would you please return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 505;
char en = '\n';
ll inf = 1e16;
ll mod = 998244353;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
using namespace __gnu_pbds; //(or pb_ds)
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
char arr[N][N];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n + 5];
ll b[n + 5];
map<ll, vector<ll>> indices;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
indices[i + a[i]].push_back(i);
}
for (ll i = 1; i <= n; i++) {
cin >> b[i];
}
for (auto &it : indices) {
reverse(it.second.begin(), it.second.end());
}
pbds X;
ll res = 0;
for (ll i = 1; i <= n; i++) {
ll req = b[i] + i;
if (indices.find(req) == indices.end()) {
cout << -1 << en;
return 0;
}
vector<ll> &vect = indices[req];
ll indx = vect.back();
vect.pop_back();
if (vect.empty()) {
indices.erase(req);
}
// adjust for changes
// find indices > indx
ll change = (i - 1) - X.order_of_key(indx);
X.insert(indx);
res += indx + change - i;
}
cout << res << en;
return 0;
}
| #include<unordered_map>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ll
#define HgS 1000000007
#define ll long long
#define reg register
#define opr operator
#define ret return
#define gc getchar
#define pc putchar
#define cst const
#define db double
#define il inline
il ll rd()
{
reg ll res=0,lab=1;
reg char ch=gc();
while((ch<'0'||ch>'9')&&ch!=EOF)
{if(ch=='-')lab=-lab;ch=gc();}
while(ch>='0'&&ch<='9')
res=(res<<3)+(res<<1)+(ch&15),ch=gc();
return res*lab;
}
il void prt(ll x,char t='\n')
{
static char ch[40];reg int tp=0;
if(!x){fputs("0",stdout);if(t)pc(t);return;}
if(x<0)pc('-'),x=-x;
while(x)ch[++tp]=(x%10)^48,x/=10;
while(tp)pc(ch[tp--]);
if(t)pc(t);
}
il ll umax(ll a,ll b){return a>b?a:b;}
il ll umin(ll a,ll b){return a<b?a:b;}
il ll uabs(ll x){return x>0?x:-x;}
il ll qpow(ll n,ll e=HgS-2,ll p=HgS)
{
reg ll res=1;
while(e){if(e&1)res=res*n%p;n=n*n%p;e>>=1;}
return res;
}
ll n,a[200005],b[200005],ans,rf[200005],res[200005],cnt,bit[200005];
unordered_map<ll,ll>tmp,tmp2;
queue<ll>q[200005];
//void m_sort(int l,int r)
//{
// if(l==r)return;
// int mid=(l+r)>>1,i=l,j=mid+1,k=l;
// m_sort(l,mid);m_sort(mid+1,r);
// while(i<=mid&&j<=r)
// if(a[i]<=a[j])res[k++]=a[i++];
// else res[k++]=a[j++],ans+=mid-i+1;
// while(i<=mid)res[k++]=a[i++];
// while(j<=r)res[k++]=a[j++];
// for(int t=l;t<=r;++t)a[t]=res[t];
//}
il int lowbit(int x){return x&(-x);}
void add(int x){while(x<=n)++bit[x],x+=lowbit(x);}
int query(int x)
{
int res=0;
while(x)res+=bit[x],x-=lowbit(x);
return res;
}
int main()
{
n=rd();
for(int i=1;i<=n;++i)++tmp[a[i]=rd()-n+i];
for(int i=1;i<=n;++i)--tmp[b[i]=rd()-n+i];
for(int i=1;i<=n;++i)if(tmp[a[i]]||tmp[b[i]]){puts("-1");return 0;}
// for(int i=1;i<=n;++i)cerr<<a[i]<<' ';
// cerr<<endl;
// for(int i=1;i<=n;++i)cerr<<b[i]<<' ';
// cerr<<endl;
for(int i=1;i<=n;++i)
{
if(tmp2.find(b[i])==tmp2.end())tmp2[b[i]]=++cnt,rf[cnt]=b[i];
q[tmp2[b[i]]].push(i);
// cerr<<tmp2[b[i]]<<' ';
}
// cerr<<endl;
// for(int i=1;i<=n;++i)a[i]=q[tmp2[a[i]]].front(),q[tmp2[a[i]]].pop();
// for(int i=1;i<=n;++i)cerr<<a[i]<<' ';
// cerr<<endl;
// m_sort(1,n);
for(int i=1;i<=n;++i)
{
int val=q[tmp2[a[i]]].front();q[tmp2[a[i]]].pop();
ans+=query(n)-query(val);add(val);
}
prt(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(n,k) cout<<fixed<<setprecision(k)<<n<<endl
#define LL_MAX LLONG_MAX
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define maxa(v) *max_element(v, v + v.size())
#define mina(v) *min_element(v, v + v.size())
int exp(int x,int y){int res=1;x=x%mod;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int modinv(int x){return exp(x,mod-2);}
int add(int a,int b){a%=mod,b%=mod;a=((a+b)%mod+mod)%mod;return a;}
int sub(int a,int b){a%=mod,b%=mod;a=((a-b)%mod+mod)%mod;return a;}
int mul(int a,int b){a%=mod,b%=mod;a=((a*b)%mod+mod)%mod;return a;}
int gcd(int a, int b){if (b == 0)return a; return gcd(b, a % b);}
int Log2n( int n){ return (n > 1) ? 1 + Log2n(n / 2) : 0;}
int fac[100009];int ncr_mod(int n,int k){int ans=fac[n];ans*=modinv(fac[k]);ans%=mod;ans*=modinv(fac[n-k]);ans%=mod;return ans;}
vector<int>v_prime;void Sieve(int n){bool prime[n + 1];memset(prime,true,sizeof(prime));for (int p = 2; p*p <=n;p++){if(prime[p] ==true) {for(int i = p*p; i<= n; i += p)prime[i]=false;}}for(int p = 2;p<= n;p++)if (prime[p])v_prime.pb(p);}
vector<int>v_factor;void factors(int n){ for (int i=1; i<=sqrt(n); i++) {if (n%i == 0) {if (n/i == i) v_factor.pb(i);else { v_factor.pb(i),v_factor.pb(n/i);};} } sort(all(v_factor)); }
void out(vector<int>&a){for(int i=0;i<a.size();i++) cout<<a[i]<<" "; cout<<endl;}
// s.top().second;
signed main()
{
run;
/*
open for mod factorial
fac[0]=1;
for(int i=1;i<100009;i++)
{
fac[i]=fac[i-1]*i;
fac[i]%=mod;
}
*/
/*
for sieve open this and use v_prime
int pp=pow(10,6)+100000;
Sieve(pp);
*/
// USE v_factor For calculating factors
int t=1;
//cin>>t;
while(t--)
{
// vector< pair <int,int> > vp;
// map<int,int>mp; // x.second-->frequency
// set<int>st;
int n,i,x,y,ok=0,sum=0,ans=0,j,k,cnt=0,m,c=0;
int h[100009]={0},a,b;
ans=-LL_MAX;
cin>>a>>b>>x>>y;
for(i=a;i<=b;i++)
{
for(j=x;j<=y;j++)
{
ans=max(ans,i-j);
}
}
cout<<ans;
}
} | #include <iostream>
using namespace std;
#define int long long int
int32_t main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b-c<<endl;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define MOD 998244353
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ordered_set<ll> ors;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ld PI=3.14159265359;
ll power(ll a, ll n, ll m)
{
ll ans=1;
while(n)
{
if(n&1) ans=(ans*a)%m;
n>>=1;
a=(a*a)%m;
}
return ans;
}
ll invmod(ll a, ll m)
{
return power(a,m-2,m);
}
ll fac[1000001];
void init(ll m) {
// prime();
fac[0]=fac[1]=1;
repf(i,2,1000001) fac[i]=(fac[i-1]*i)%m;
}
ll nCr(ll n, ll r, ll m) {
if(n<r || r<0) return 0;
ll nr=fac[n];
ll dr=(fac[n-r]*fac[r])%m;
dr=invmod(dr,m);
ll res=(nr*dr)%m;
return res;
}
void solve(ll tt) {
ll n;
cin>>n;
ld x0,y0,xh,yh;
cin>>x0>>y0>>xh>>yh;
ld angle=2*PI/n;
ld x1,y1;
x1=(x0+xh)+(x0-xh)*cos(angle)-(y0-yh)*sin(angle);
y1=(y0+yh)+(x0-xh)*sin(angle)+(y0-yh)*cos(angle);
x1/=2,y1/=2;
cout<<fixed;
cout<<setprecision(10)<<x1<<" "<<y1<<endl;
}
int main()
{
IOS;
// init(mod);
ll t=1;
// cin>>t;
repf(tt,1,t+1) {
solve(tt);
}
} | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
using Matrix = vector<vector<int>>;
const ll INF = LLONG_MAX;
const ld EPS = 1e-14;
const ll MOD = 1e9+7;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
template<class T> void chmax(T& a, T b) { if (a < b) a = b; }
template<class T> void chmin(T& a, T b) { if (a > b) a = b; }
using C = complex<double>;
C inC() {
double x, y;
cin >> x >> y;
return C(x,y);
}
int main() {
/*
int n, x0, y0, xn2, yn2;
cin >> n >> x0 >> y0 >> xn2 >> yn2;
ld theta = (180.0 / (ld)n) * M_PI / 180.0;
ld a = sqrtl((x0 - xn2) * (x0 - xn2) + (y0 - yn2) * (y0 - yn2));
ld b = a * cosl(theta);
ld c = a * sinl(theta);
*/
int n;
cin >> n;
C s = inC();
C t = inC();
C o = (s + t) / 2.0;
double rad = 2 * M_PI / n;
C r(cos(rad), sin(rad));
C ans = o + (s - o) * r;
cout << fixed << setprecision(10);
cout << ans.real() << " " << ans.imag() << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
struct State {
int begin, end, cost;
State(int begin_, int end_, int cost_) : begin(begin_), end(end_), cost(cost_) { }
};
bool done[1000][1000];
int main() {
int N, M; cin >> N >> M;
vector<vector<int>> G(N);
vector<vector<char>> C(N);
for(int i = 0; i < M; i++) {
int a, b; char c;
cin >> a >> b >> c;
a--; b--;
G[a].push_back(b);
C[a].push_back(c);
G[b].push_back(a);
C[b].push_back(c);
}
queue<State> Q;
Q.emplace(0, N - 1, 0);
done[0][N - 1] = true;
int ans = 1e9;
while(!Q.empty()) {
State s = Q.front();
Q.pop();
for (int i = 0; i < (int)G[s.begin].size(); i++) {
for (int j = 0; j < (int)G[s.end].size(); j++) {
if(C[s.begin][i] != C[s.end][j]) {
continue;
}
int u = G[s.begin][i];
int v = G[s.end][j];
if(u == s.end && v == s.begin) {
ans = min(ans, s.cost + 1);
}
if(u == v) {
ans = min(ans, s.cost + 2);
}
if(done[u][v]) {
continue;
}
done[u][v] = true;
Q.emplace(u, v, s.cost + 2);
// cerr << "(" << u+1 << "," << v+1 << ") = " << s.cost + 2 << endl;
}
}
}
if (ans == 1e9) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
}
| #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 tuple<int,int,int> tpl;
typedef pair<int,tpl> Pair;
#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 = 1000000007; // 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 Edge{
int from, to, id=-1;
int cost=1;
Edge(int from, int to, int cost=1, int id=-1): from(from), to(to), cost(cost), id(id) {}
Edge() {}
friend istream &operator>>(istream &input, Edge &e ){
char c;
input >> e.from >> e.to >> c;
e.from--; e.to--; e.cost = c-'a';
return input;
}
Edge rev(void){
return Edge(to, from, cost, id);
}
};
vector<vector<Edge>> edge(1010);
bool connect[1010][1010];
int d[1010][1010][27];
void Main(){
int N,M; cin >> N >> M;
vector<Edge> edge2[N][26];
REP(_,M){
Edge e; cin >> e;
edge[e.from].emplace_back(e);
edge[e.to].emplace_back(e.rev());
connect[e.from][e.to] = connect[e.to][e.from] = true;
edge2[e.from][e.cost].emplace_back(e);
edge2[e.to][e.cost].emplace_back(e.rev());
}
REP(i,N)REP(j,N){
REP(x,27) d[i][j][x] = INF;
}
if(connect[0][N-1]){
cout << 1 << en;
return;
}
int ans = INF;
priority_queue<Pair,vector<Pair>,greater<Pair>> q;
q.emplace(0,tpl(0,N-1,26));
while(!q.empty()){
auto p = q.top(); q.pop();
int cost = p.first, x, y, c;
tie(x,y,c) = p.second;
if(!chmin(d[x][y][c], cost)) continue;
if(x==y){
chmin(ans, cost);
continue;
}
if(connect[x][y]){
chmin(ans, cost+1);
continue;
}
REP(i,26){
for(auto& ex : edge2[x][i])for(auto& ey : edge2[y][i]){
q.emplace(cost+2, tpl(ex.to,ey.to,i));
}
}
}
cout << (ans<INF ? ans : -1) << 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;
const int N=1e6+50;
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
int read()
{
int s=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
s=s*10+ch-'0';
ch=getchar();
}
return s*f;
}
int u[N],n,k,a[N];
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)
{a[i]=read();u[a[i]]++;}
int ans=0;
for(int j=1;j<=k;j++)
{
for(int i=0;i<=n;i++)
{
if(!u[i]){ans+=i;break;}
u[i]--;
}
}
cout<<ans;
} | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 1e9+10
#define INFL 1e18
#define mod 1000000007
//#define mod 998244353
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
ll power(ll x,ll n){ll res =1;while(n>0){if(n%2==1){res=res*x;}x=x*x;n=n/2;}return res;}
ll powm(ll a,ll b) {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;}
//cout<< fixed << setprecision(10)
//__builtin_popcountll();
//|_2.4_|=2
int main(){
fast;
int n,k,i,j;
cin>>n>>k;
int f[n+10]={0};
for(i=0;i<n;i++)
{
int x;
cin>>x;
f[x]++;
}
int ans=0;
i=0;
while(k!=0)
{
if(f[i]>=k)
{
i++;
continue;
}
else
{
ans=ans+(k-f[i])*i;
k=f[i];
i++;
}
}
cout<<ans;
}
|
#include <bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000000000005
using namespace std;
int main (){
long long ans, n,i;
cin>>n;
i=1000;
ans = 0;
while (i<=n){
ans += n-i+1;
i=i*1000;
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
if(a < b){
a = b;
}
}
template<class T> void chmin(T& a, T b){
if(a > b){
a = b;
}
}
int main()
{
string n;
cin >> n;
int l = n.size();
ll ans = 0;
int com = l/3;
if(l <= 3){
ans = 0;
}
for(int i = 1; i <= 5; i++){
if(l > i*3){
if(l < (i+1)*3+1){
ll N = stol(n);
N -= pow(10,i*3) -1;
ans += N*i;
break;
}
else ans += (pow(10,(i+1)*3) - pow(10,i*3))*i;
}
}
cout << ans << endl;
return 0;
} |
//
// Created by saa on 2021/5/27.
//
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int h=0;
int w=0;
int min=300;
int sum=0;
cin>>h>>w;
vector<int> blocks(h*w);
for(int n=0;n<blocks.size();n++)
{
cin>>blocks[n];
if(blocks[n]<min)
{
min=blocks[n];
}
}
for(int n=0;n<blocks.size();n++)
{
sum+=blocks[n]-min;
}
cout<<sum<<"\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define VREP(s, ite) for (auto ite = s.begin(); ite != s.end(); ++ite)
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define endl "\n"
#define ciosup \
cin.tie(0); \
ios::sync_with_stdio(false);
#define eb emplace_back
#define vint vector<int>
#define vvint vector<vector<int>>
constexpr ll INF = 1e15 + 7LL;
constexpr ll MOD = 998244353LL;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (int i = 0; i < (int)v.size(); ++i) {
is >> v[i];
}
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
if (v.size() == 0) return os;
for (int i = 0; i < (int)v.size() - 1; ++i) {
os << v[i] << " ";
}
os << v[v.size() - 1];
return os;
}
void solve() {
int h,w;
cin >> h >> w;
vvint a(h, vint(w));
REP(i,h) {
cin >> a[i];
}
int val = INT_MAX;
REP(i,h) {
REP(j,w) {
val = min(val, a[i][j]);
}
}
ll ans = 0;
REP(i,h) {
REP(j,w) {
ans += a[i][j] - val;
}
}
cout << ans << endl;
}
int main() {
solve();
char tmp;
while (cin >> tmp) {
cin.putback(tmp);
solve();
}
}
|
// нахуй такие задачи пиздец
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,k,a[15],is[200005];
struct P{
long double k,x;
}f[200005],sum[200005];//f[i]=k*f[1]+x
P operator +(P i,P j){
return {i.k+j.k,i.x+j.x};
}
P operator -(P i,P j){
return {i.k-j.k,i.x-j.x};
}
P operator /(P i,double j){
return {i.k/j,i.x/j};
}
int main(){
cin>>n>>m>>k;
for(int i=1;i<=k;i++)cin>>a[i],is[a[i]]=1;
for(int i=n-1;i>=0;i--){
if(!is[i])f[i]=(sum[i+1]-sum[i+m+1])/m+(P){0,1};
else f[i]=(P){1,0};
sum[i]=sum[i+1]+f[i];
}
if(fabs(f[0].k-1)<1e-6)puts("-1");
else {
long double x=-f[0].x/(f[0].k-1);
printf("%.4Lf\n",x);
}
} | #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, Q; cin >> N;
vector<int> A(N), T(N);
REP(i, 0, N) cin >> A[i] >> T[i];
cin >> Q;
vector<ll> X(Q);
REP(i, 0, Q) cin >> X[i];
set<ll> S;
REP(i, 0, Q) S.insert(X[i]);
ll offset = 0;
REP(i, 0, N) {
if (T[i] == 1) {
offset += A[i];
} else if (T[i] == 2) {
auto itr = S.lower_bound(A[i] - offset);
bool deleted = false;
auto jtr = S.begin();
while (jtr != itr) {
jtr = S.erase(jtr);
deleted = true;
}
if (deleted) {
S.insert(A[i] - offset);
}
} else {
auto itr = S.lower_bound(A[i] - offset);
bool deleted = false;
while (itr != S.end()) {
itr = S.erase(itr);
deleted = true;
}
if (deleted) {
S.insert(A[i] - offset);
}
}
}
// for (auto x : S) cout << x << " ";
// cout << endl;
REP(i, 0, Q) {
auto itr = S.lower_bound(X[i]);
if (itr != S.begin() && (itr == S.end() || *itr > X[i])) itr = prev(itr);
// cout << "# i : " << i << ", X[i] : " << X[i] << ", itr : " << *itr << endl;
cout << *itr + offset << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[15];
bool cmp (int a, int b) {
return a > b;
}
int g2(int x) {
int ind = 0, res = 0;
while (x) {
a[ind ++] = x % 10;
x /= 10;
}
sort(a, a + ind);
for (int i = 0; i < ind; i ++) {
if (a[i] != 0) {
res *= 10;
res += a[i];
}
}
return res;
}
int g1(int x) {
int ind = 0, res = 0;
while (x) {
a[ind ++] = x % 10;
x /= 10;
}
sort(a, a + ind, cmp);
for (int i = 0; i < ind; i ++) {
res *= 10;
res += a[i];
}
return res;
}
int f(int x) {
return g1(x) - g2(x);
}
int main() {
int n, k, tmp, flag = 0;
scanf("%d %d", &n, &k);
for (int i = 0; i < k; i ++) {
tmp = f(n);
if (tmp == n) {
printf("%d\n", tmp);
flag = 1;
break;
}
n = tmp;
}
if (!flag) printf("%d\n", n);
return 0;
} | // Umang_US
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pob pop_back
#define vi vector<ll>
#define mp make_pair
#define sz size()
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep(i,n) for(ll i=0;i<n;i++)
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define maxx 2*100005
#define sec second
#define fi first
#define be begin()
#define en end()
#define sortv(v) sort(v.begin(),v.end());
#define sortr(v) sort(v.rbegin(),v.rend());
#define w() ll _;cin>>_;while(_--)
#define edge pair<ll,ll>
#define pq priority_queue<ll>
#define mod 1000000007
#define Endl "\n"
#define cy cout<<"YES"<<endl;
#define cn cout<<"NO"<<endl;
#define lb(v,x) std::lower_bound(v.begin(),v.end(),x)
#define ub(v,x) std::upper_bound(v.begin(),v.end(),x)
using namespace std;
// multiset<ll>::iterator it=next(s.begin(), i);// iterator for index i
// cout<<fixed<<setprecision(10);
// https://www.youtube.com/watch?v=o2gqyVR7B4I
//------------------------HARDER--------------------------------
int ase(int n)
{
string s=to_string(n);
sortv(s);
n=stoi(s);
return n;
}
int des(int n)
{
string s=to_string(n);
sortr(s);
n=stoi(s);
return n;
}
int main()
{
fast;
int n,k;
cin>>n>>k;
int a[k+3]={0};
int i;
a[0]=n;
for(i=1;i<=k;i++)
{
a[i] = des(a[i-1])-ase(a[i-1]);
}
cout<<a[k]<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define cases long long t; cin>>t; while(t--)
#define ll long long
#define MOD 1000000007
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
ll i,j,flag=0,k,flag2=0;
cin>>s;
for(j=s.size()-1;j>=0;j--){
if(s[j]!='0'){
k=j; flag2=1; break;
}
}
if(flag2==0) cout<<"Yes"<<endl;
else{
if(k%2==0){
j=k;
for(i=0;i<k/2;i++){
if(s[i]!=s[j]){
cout<<"No"<<endl;
flag=1;
break;
}
j--;
}
}
else{
j=k;
for(i=0;i<=k/2;i++){
if(s[i]!=s[j]){
cout<<"No"<<endl;
flag=1;
break;
}
j--;
}
}
if(flag==0) cout<<"Yes"<<endl;
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define pi pair
#define K 1000000007
using namespace std;
ll a[2000000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll test_case=1;//cin>>test_case;
while(test_case--)
{
ll m,h;cin>>m>>h;
if(h%m==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define In inline
#define ll long long
const int N = 2e5;
const ll mod = 998244353;
namespace IO{
In ll read(){
ll s = 0,ww = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')ww = -1;ch = getchar();}
while('0' <= ch && ch <= '9'){s = 10 * s + ch - '0';ch = getchar();}
return s * ww;
}
In void write(ll x){
if(x < 0)putchar('-'),x = -x;
if(x > 9)write(x / 10);
putchar('0' + x % 10);
}
};
using namespace IO;
namespace ModCalc{
In void Inc(ll &x,ll y){
x += y;if(x >= mod)x -= mod;
}
In void Dec(ll &x,ll y){
x -= y;if(x < 0)x += mod;
}
In ll Add(ll x,ll y){
Inc(x,y);return x;
}
In ll Sub(ll x,ll y){
Dec(x,y);return x;
}
};
using namespace ModCalc;
int n;
bool vis[N+5];
vector<int> vc;
vector<int> E[N+5];//i[N+5],Eo[N+5];
queue<int> Q;
In ll power(ll a,ll n){
ll s = 1,x = a;
while(n){
if(n & 1) s = s * x % mod;
x = x * x % mod;
n >>= 1;
}
return s;
}
void bfs(int s){
Q.push(s);vis[s] = 1;
// vc.resize(0);
while(!Q.empty()){
int u = Q.front();
Q.pop();vc.push_back(u);
for(auto v : E[u]){
if(vis[v])continue;
vis[v] = 1;
Q.push(v);
}
}
/* int d = vc.size(),en = 0;
for(auto u : vc)en += E[u].size();
en >>= 1;
cout<<"d="<<d<<" en="<<en<<endl;
if(en == d)return 2;else return power(2,d);*/
}
int main(){
// freopen("B.in","r",stdin);
// freopen("B.out","w",stdout);
n = read();
for(rg int i = 1;i <= n;i++){
int f = read();
if(f == i)continue;
else E[i].push_back(f),E[f].push_back(i);
}
ll ans = 1;
for(rg int i = 1;i <= n;i++)if(!vis[i])bfs(i),ans = ans * 2 % mod;
write(Sub(ans,1)),putchar('\n');
return 0;
} | #line 1 "a.cpp"
#include<iostream>
using namespace std;
#line 1 "/home/kotatsugame/library/datastructure/UF.cpp"
#include<vector>
struct UF{
int n;
vector<int>parent,rank;
UF(int n_=0):n(n_),parent(n_),rank(n_,1)
{
for(int i=0;i<n_;i++)parent[i]=i;
}
int find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}
bool same(int a,int b){return find(a)==find(b);}
bool unite(int a,int b)
{
a=find(a),b=find(b);
if(a==b)return false;
if(rank[a]<rank[b])
{
parent[a]=b;
rank[b]+=rank[a];
}
else
{
parent[b]=a;
rank[a]+=rank[b];
}
return true;
}
int size(int a){return rank[find(a)];}
};
#line 4 "a.cpp"
const long mod=998244353;
int N,P[2<<17];
main()
{
cin>>N;
UF uf(N);
int cnt=N;
for(int i=0;i<N;i++)
{
cin>>P[i];
P[i]--;
cnt-=uf.unite(i,P[i]);
}
long ans=1;
for(;cnt--;)ans=ans*2%mod;
cout<<(ans+mod-1)%mod<<endl;
}
|
// 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>
#include<list>
#define loop(i,a,b) for(int 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"
struct UnionFind{
vector<int> data;
vector<map<int,int> > cl;
UnionFind(int size) : data(size, -1),cl(size) {}
bool unite(int x,int y){
x=root(x);y=root(y);
if(x==y)return 0;
if(data[y]<data[x])swap(x,y);
data[x]+=data[y],data[y]=x;
for(auto i:cl[y]){
cl[x][i.first]+=i.second;
}
return 1;
}
bool find(int x,int y){
return root(x)==root(y);
}
int root(int x){
return data[x]<0 ? x : data[x]=root(data[x]);
}
int size(int x){
return -data[root(x)];
}
};
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,q;
cin>>n>>q;
vi in(n);
rep(i,n)cin>>in[i];
UnionFind uf(n);
rep(i,n)uf.cl[i][in[i]]=1;
while(q--){
int t,a,b;
cin>>t>>a>>b;
if(t==1){
uf.unite(a-1,b-1);
}else{
int r=uf.root(a-1);
cout<<uf.cl[r][b]<<endl;
}
}
}
| #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define hashmap unordered_map
#define hashset unordered_set
#define lb lower_bound
#define ub upper_bound
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ff first
#define ss second
#define foi(n) for(ll i=0;i<n;i++)
#define foj(n) for(ll j=0;j<n;j++)
#define fok(n) for(ll k=0;k<n;k++)
#define forr(i,a,b) for(ll i=a;i<b;i++)
#define forrr(i,b,a) for(ll i=b;i>=a;i--)
#define forrrr(i,a,b,k) for(ll i=a;i<b;i=i+k)
#define graph vector<vector<int>>
#define sz(v) v.size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef pair< ll, pll> plll;
typedef vector<plll> vplll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<char, int> mci;
typedef map<int, string> mis;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef priority_queue <ll> pq;
typedef priority_queue<pii, vector<pii>, greater<pii> > pqq;
const ll MOD = 1000000007;
ll TT = 1;
void solve();
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("error1.txt", "w", stderr);
freopen("output1.txt", "w", stdout);
#endif
//ll t ; cin >> t;
//while (t--)
{
solve();
cout << "\n";
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
ll ceils(ll x, ll y) {
return x / y + ((x % y) != 0);
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
void solve()
{
ll n, d, h;
cin >> n >> d >> h;
vpll x;
foi(n) {
ll y, z;
cin >> y >> z;
x.pb(mp(y, z));
}
ld ans = 0;
foi(n) {
if ((ld)x[i].ss - ((ld)h - (ld)x[i].ss) / ((ld)d - (ld)x[i].ff) * (ld)x[i].ff > 0)
ans = max(ans, (ld)x[i].ss - ((ld)h - (ld)x[i].ss) / ((ld)d - (ld)x[i].ff) * (ld)x[i].ff);
}
cout << fixed << setprecision(10);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
typedef long long ll;
int getint()
{
char ch;
int res = 0, p;
while (!isdigit(ch = getchar()) && (ch ^ '-'));
p = ch == '-'? ch = getchar(), -1 : 1;
while (isdigit(ch))
res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
return res * p;
}
void work()
{
ll x;
scanf("%lld", &x);
int cnt = 0;
while (x & 1 ^ 1) x >>= 1, cnt++;
switch(cnt)
{
case 0: {printf("Odd\n"); break;}
case 1: {printf("Same\n"); break;}
default: {printf("Even\n"); break;}
}
}
int main()
{
int T;
T = getint();
while (T--) work();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
int main(){
int t ;
cin >> t ;
ll a[t] ;
rep(i, t) cin >> a[i] ;
rep(i, t){
if(a[i] % 2 == 0){
a[i] /= 2 ;
if(a[i] % 2 == 0) cout << "Even" << endl ;
else cout << "Same" << endl ;
}
else cout << "Odd" << endl ;
}
} |
#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
#include <unordered_map>
#include <climits>
#include <algorithm>
#include <map>
#include <queue>
#include <random>
#include <chrono>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
typedef map<ll, ll> mll;
typedef unordered_map<ll, ll> umll;
#define randoom mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
//use rng() for random
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define cntbit(x) __builtin_popcount(x)
#define cntBitll(x) __builtin_popcountll(x)
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define rep(i,n) for (int i=1;i <=int(n);i++)
pii a[200001];
int main(){
int n,w; cin >> n >> w;
vector<pair<pii,int>> events;
rep(i,n){
int ppp;
cin >> a[i].fi >> a[i].se >> ppp;
events.pb(mp(mp(a[i].fi,1),ppp));events.pb(mp(mp(a[i].se,-1),ppp));
}
sort(all(events));
int pp=0;
for (auto p:events){
pp+=p.fi.se*p.se;
if (pp>w) {
cout << "No"; return 0;
}
}
cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m);
rep(i,m) cin >> a[i];
sort(all(a));
if(m==0){
cout << 1 << endl;
return 0;
}
int h=mod;
rep(i,m){
if(i!=0){
if(a[i]-a[i-1]-1!=0) h=min(h,a[i]-a[i-1]-1);
}
}
if(a[0]-1!=0) h=min(h,a[0]-1);
if(n-a[m-1]!=0) h=min(h,n-a[m-1]);
ll count=0;
rep(i,m){
if(i!=0){
if(a[i]-a[i-1]-1!=0) count+=(a[i]-a[i-1]-2)/h+1;
}
}
if(a[0]-1!=0) count+=(a[0]-1-1)/h+1;
// cout << count << endl;
if(n-a[m-1]!=0) count+=(n-a[m-1]-1)/h+1;
cout << count << endl;
// cout << h << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long p = sqrt(2 * n + 2);
while ((p + 1) * p <= 2 * n + 2)
p++;
cout << n + 1 - p + 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll ans = 2;
for (ll l = 1; l <= 1e7; l++) {
ll a = (2 * n - l * (l - 1));
ll b = a / (2 * l);
if (a % (2 * l) == 0 && b > 0 && b < n) {
ans += 2;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define int long long int
#define vi vector<int>
#define pb push_back
#define endl "\n"
#define all(v) v.begin(),v.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n-1;i>=0;i--)
#define deb(x) cout<<"["#x<<":"<<x<<"]"<<" ";
#define deb2(x,y) cout<<"["#x<<":"<<x<<" "#y<<":"<<y<<"]";
#define inp int n;cin>>n;int a[n];for(int i=0;i<n;i++)cin>>a[i];
#define out(a) for(int i=0;i<n;i++)cout<<a[i]<<" ";cout<<endl;
using namespace std;
void AKM()
{
int a1,b1,a2,b2;
cin>>a1>>b1>>a2>>b2;
if(a1==a2&&b1==b2){
cout<<0<<endl;
return;
}
if((a1-b1==a2-b2)||(a1+b1==a2+b2)||(abs(a1-a2)+abs(b1-b2)<= 3)){
cout<<1<<endl;
return;
}
if(((a1%2==a2%2)&&(b1%2==b2%2))||((a1%2!=a2%2)&&(b1%2!=b2%2))){
cout<<2<<endl;
return;
}
if((abs((a1+b1)-(a2+b2))<=4)||(abs((a1-b1)-(a2-b2))<=4)){
cout<<2<<endl;
return;
}
cout<<3<<endl;
}
int32_t main()
{
fastio;
cout<<fixed;
cout.precision(15);
int __TESTCASES=1;
//cin>>__TESTCASES;
while(__TESTCASES--){
AKM();
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...) lower_bound(x)
#define ub(x...) upper_bound(x)
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 3000 + 10, inf = 1e9 + 10, K = 5;
int a[N][K];
bool exists[1 << K];
int n;
bool f(int x) {
rep(S, 0, 1 << K) {
exists[S] = 0;
rep(i, 0, n) {
bool ok = 1;
rep(j, 0, K) if (S >> j & 1) ok &= x <= a[i][j];
exists[S] |= ok;
}
}
rep(j, 0, n) {
rep(i, 0, j) {
int T = 0;
rep(k, 0, K) if (x > max(a[i][k], a[j][k])) T |= 1 << k;
if (exists[T]) return 1;
}
}
return 0;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
rep(i, 0, n) rep(j, 0, K) cin >> a[i][j];
int l = 0, r = inf;
while (r - l > 1) {
// [l, r)
int m = (l + r) / 2;
(f(m) ? l : r) = m;
}
cout << l << '\n';
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
int f(int b,int r,int c){
return b*500*500+r*500+c;
}
int main(){
int R,C; cin >> R >> C;
vvi g(500*500*2);
vvi co(500*500*2);
rep(r,R) rep(c,C-1){
int in; cin >> in;
g[f(0,r,c)].pb(f(0,r,c+1));
g[f(0,r,c+1)].pb(f(0,r,c));
co[f(0,r,c)].pb(in);
co[f(0,r,c+1)].pb(in);
}
rep(r,R-1) rep(c,C){
int in; cin >> in;
g[f(0,r,c)].pb(f(0,r+1,c));
co[f(0,r,c)].pb(in);
}
rep(r,R-1) rep(c,C){
g[f(1,r+1,c)].pb(f(1,r,c));
co[f(1,r+1,c)].pb(1);
}
rep(r,R) rep(c,C){
g[f(0,r,c)].pb(f(1,r,c));
co[f(0,r,c)].pb(1);
g[f(1,r,c)].pb(f(0,r,c));
co[f(1,r,c)].pb(0);
}
vector<int> D(500*500*2, -1);
vector<bool> used(500*500*2, false);
priority_queue<pair<int,int>,
vector<pair<int,int>>,
greater<pair<int,int>>> q;
q.push({(int)0,f(0,0,0)});
D[0]=0;
while(!q.empty()){
int d = q.top().first; int to = q.top().second; q.pop();
if(used[to]) continue;
used[to] = true; //D[to] = d;
rep(i,sz(g[to])){
int nxt=g[to][i];
int nd = d+co[to][i];
if(D[nxt] != -1 && D[nxt] <= nd) continue;
D[nxt]=nd;
q.push({nd, nxt});
}
}
int ans = D[f(0,R-1,C-1)];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using T2 = tuple<int,int,int, int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed main(){
int R, C; cin>>R>>C;
vector<vec_int> A(R, vec_int(C-1));
rep(i,R)rep(j,C-1)cin>>A.at(i).at(j);
vector<vec_int> B(R-1, vec_int (C));
rep(i,R-1)rep(j,C)cin>>B.at(i).at(j);
vector<vec_int> visited(R, vec_int(C, 0));
priority_queue<T2, vector<T2>, greater<T2>> pq;
pq.emplace(0, 0, 0, 0);
while(!pq.empty()){
int cost, r, c, type; tie(cost, r, c, type)=pq.top(); pq.pop();
if(visited.at(r).at(c)==1)continue;
if(r==R-1&&c==C-1){
cout<<cost<<endl;
return 0;
}
visited.at(r).at(c) = 1;
if(c<C-1){
if(visited.at(r).at(c+1)==0){
pq.emplace(cost+A.at(r).at(c), r, c+1, 1);
}
}
if(c>0){
if(visited.at(r).at(c-1)==0){
pq.emplace(cost+A.at(r).at(c-1), r, c-1, 1);
}
}
if(r<R-1){
if(visited.at(r+1).at(c)==0){
pq.emplace(cost+B.at(r).at(c), r+1, c, 0);
}
}
if(type==1){
for(int i=0;i<r;i++){
if(visited.at(i).at(c)==0){
pq.emplace(cost+(r-i+1), i, c, 0);
}
}
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
namespace Flandre_Scarlet
{
#define mod 1145141919
#define F(i,l,r) for(int i=l;i<=r;++i)
#define D(i,r,l) for(int i=r;i>=l;--i)
#define Fs(i,l,r,c) for(int i=l;i<=r;c)
#define Ds(i,r,l,c) for(int i=r;i>=l;c)
#define MEM(x,a) memset(x,a,sizeof(x))
#define FK(x) MEM(x,0)
#define Tra(i,u) for(int i=G.st(u),v=G.to(i);~i;i=G.nx(i),v=G.to(i))
#define p_b push_back
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define iter(a,p) (a.begin()+p)
#define PUT(a,n) F(i,1,n) printf("%d ",a[i]); puts("");
int I() {char c=getchar(); int x=0; int f=1; while(c<'0' or c>'9') f=(c=='-')?-1:1,c=getchar(); while(c>='0' and c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar(); return ((f==1)?x:-x);}
template <typename T> void Rd(T& arg){arg=I();}
template <typename T,typename...Types> void Rd(T& arg,Types&...args){arg=I(); Rd(args...);}
void RA(int *p,int n) {F(i,1,n) *p=I(),++p;}
char a[10];
void Input()
{
scanf("%s",a);
}
int n=4; int C[15][15];
int must,may;
int f[15];
int qpow(int a,int b,int m=mod) {int r=1; while(b) {if (b&1) r=r*a%m; a=a*a%m,b>>=1;} return r;}
void Sakuya()
{
C[0][0]=1;
F(i,1,10)
{
C[i][0]=1;
F(j,1,i)
{
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
}
must=may=0;
F(i,0,9)
{
if (a[i]=='o') ++must;
if (a[i]=='?') ++may;
}
f[0]=qpow(may,n);
F(i,1,must)
{
f[i]=qpow(may+i,n);
F(j,0,i-1) f[i]-=C[i][j]*f[j];
}
printf("%d\n",f[must]);
}
void IsMyWife()
{
Input();
Sakuya();
}
}
#undef int //long long
int main()
{
Flandre_Scarlet::IsMyWife();
getchar();
return 0;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+10;
int a[11];
int main()
{
string s;
cin>>s;
memset(a,0,sizeof a);
for(int i=0; i<s.size(); i++)
{
int k=s[i]-'0';
a[k]++;
}
if(s.size()>=3)
{
for(int i=100; i<=999; i++)
{
int x,y,z;
x=i%10;
y=i/10%10;
z=i/100%10;
if(x==y&&x==z)
{
if(a[x]>=3)
{
if(i%8==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
else
continue;
}
else if(x==y)
{
if(a[x]>=2&&a[z]>=1)
{
if(i%8==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
else
continue;
}
else if(y==z)
{
if(a[x]>=1&&a[z]>=2)
{
if(i%8==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
else
continue;
}
else
{
if(a[x]>=1&&a[z]>=1&&a[y]>=1)
{
if(i%8==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
else
continue;
}
}
cout<<"No"<<endl;
return 0;
}
else if(s.size()==2)
{
for(int i=10; i<=99; i++)
{
int x=i%10;
int y=i/10;
if(x==y)
{
if(a[x]>=2)
{
if(i%8==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
else
continue;
}
else
{
if(a[x]>=1&&a[y]>=1)
{
if(i%8==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
else
continue;
}
}
cout<<"No"<<endl;
return 0;
}
else
{
if(a[8])
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
template<class G>
class Fenwick_tree{
vector<G> a;
public:
Fenwick_tree(int n=0){ build(n); }
Fenwick_tree(const vector<G>& a){ build(a); }
void build(int n){
a.assign(n,G{});
}
void build(const vector<G>& a){
this->a=a;
for(int i=1;i<=a.size();i++) if(i+(i&-i)<=a.size()) (this->a)[i+(i&-i)-1]+=(this->a)[i-1];
}
void add(int i,const G& val){
for(i++;i<=a.size();i+=i&-i) a[i-1]+=val;
}
G sum(int l,int r)const{
if(l==0){
G res{};
for(;r>0;r-=r&-r) res+=a[r-1];
return res;
}
return sum(0,r)-sum(0,l);
}
int lower_bound(G val)const{
if(!(G{}<val)) return 0;
int x=0,k;
for(k=1;k<=a.size();k<<=1);
for(k>>=1;k>0;k>>=1) if(x+k<=a.size() && a[x+k-1]<val) val-=a[x+k-1], x+=k;
return x;
}
int upper_bound(G val)const{
if(val<G{}) return 0;
int x=0,k;
for(k=1;k<=a.size();k<<=1);
for(k>>=1;k>0;k>>=1) if(x+k<=a.size() && !(val<a[x+k-1])) val-=a[x+k-1], x+=k;
return x;
}
};
template<class T>
long long inversion_number(const vector<T>& a){
auto X=a;
sort(X.begin(),X.end());
X.erase(unique(X.begin(),X.end()),X.end());
long long res=0;
Fenwick_tree<int> F(X.size());
rep(i,a.size()){
int x=lower_bound(X.begin(),X.end(),a[i])-X.begin();
res+=F.sum(x+1,X.size());
F.add(x,1);
}
return res;
}
int main(){
int n; scanf("%d",&n);
vector<int> a(n),b(n);
rep(i,n) scanf("%d",&a[i]);
rep(i,n) scanf("%d",&b[i]);
map<int,vector<int>> L,R;
rep(i,n){
L[a[i]+i].emplace_back(i);
R[b[i]+i].emplace_back(i);
}
if(L.size()!=R.size()){
puts("-1");
return 0;
}
vector<int> seq(n);
for(auto [x,v1]:L){
if(R.count(x)==0 || R[x].size()!=v1.size()){
puts("-1");
return 0;
}
auto& v2=R[x];
rep(i,v1.size()) seq[v1[i]]=v2[i];
}
printf("%lld\n",inversion_number(seq));
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define N 100005
using namespace std;
int read() {
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
ll n,f[N][2];
int main() {
n = read();f[0][1] = f[0][0] = 1;
for(int i=1; i<=n; ++i) {
char opt[5];
scanf("%s",opt);
if(opt[0] == 'A')f[i][1] = f[i-1][1],f[i][0] = f[i-1][1]+f[i-1][0]*2;
else f[i][1] = f[i-1][0] + f[i-1][1]*2,f[i][0] = f[i-1][0];
}
cout << f[n][1];
} |
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m =0, n = 0, p = 0, q = 0, mod=998244353;
string s;
char moji;
cin >> a;
n=0;
for(int i=1;n<a;i*=2)
{
m++;
for(int j=0;j<i&&n+j<a;j++)
{
cout << m << ' ';
}
n+=i;
}
return 0;
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) {
cout << a;
}
template<typename T, typename F>
void __p(pair<T, F> a) {
cout << "{";
__p(a.first);
cout << ",";
__p(a.second);
cout << "}";
}
template<typename T>
void __p(std::vector<T> a) {
cout << "{";
for (auto it = a.begin(); it < a.end(); it++)
__p(*it), cout << ",}"[it + 1 == a.end()];
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
__p(a1);
__p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cout << name << " : ";
__p(arg1);
cout << endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
int bracket = 0, i = 0;
for (;; i++)
if (names[i] == ',' && bracket == 0)
break;
else if (names[i] == '(')
bracket++;
else if (names[i] == ')')
bracket--;
const char *comma = names + i;
cout.write(names, comma - names) << " : ";
__p(arg1);
cout << " | ";
__f(comma + 1, args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" ", __f(#__VA_ARGS__, __VA_ARGS__);
#else
#define trace(...)
#endif
typedef long long int ll;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
typedef pair<ll , ll> pp;
typedef pair<pair<ll, ll>, ll> ppp;
#define X first
#define Y second
#define getones(n) __builtin_popcountll(n)
#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
#define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define frv(i,a,b) for (ll i = (a), _b = (b); i < _b; i++)
#define frrv(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define fr(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define frr(i,n) for (ll i = n - 1; i >= 0; i--)
#define fordata(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar,val) fr(i,sizeof(ar)/sizeof(ll)) ar[i]=val
#define fill2(ar,val) fr(i,sizeof(ar)/sizeof(ar[0])) fr(j,sizeof(ar[0])/sizeof(ll)) ar[i][j]=val
#define fill0(ar) memset(ar,0,sizeof(ar))
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(ar) ar.begin(), ar.end()
#define INF 1000000000000000000
#define PI 3.14159265358979323846L
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
const ll N = 1e6 + 1;
const ll K = 1e9 + 7;
#define vv vector<ll>
const ll globalmod = 1e9 + 9;
int main() {
ll t = 1;
// cin >> t;
while (t--) {
ll n;
cin >> n;
fr(i, n) {
ll temp = (log2(i + 1) + 1);
cout << temp << " ";
}
}
} |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<queue>
#include<bitset>
#include<cstdlib>
#include<set>
#include<unordered_map>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define low(x) (x&(-x))
#define IL inline
#define reg register
#define LL long long
#define N 500010
#define MOD 998244353
#define MO 1000000007
#define INF 0x3f3f3f3f
using namespace std;
int T,n,m,i,j,k,x,y,z,sum,cnt;
int b[N],p[N],q[N];
struct Data{
int x,y,id,p;
}a[N],Ans[N];
IL int Abs(int x){return (x<0)?-x:x;}
IL void Swap(int &a,int &b){a^=b^=a^=b;}
IL int Min(int a,int b){return (a<b)?a:b;}
IL int Max(int a,int b){return (a>b)?a:b;}
IL bool cmp(const Data a,const Data b){return (a.x==b.x)?a.y<b.y:a.x<b.x;}
IL LL Mi(LL x,LL y){
LL p=x,t=1,Res=1;
for (;t<=y;(t&y)?Res=(Res*p)%MOD:0,p=(p*p)%MOD,t<<=1);
return Res;
}
IL int read(){
int p=0,f=1; char c=getchar();
while (c<48||c>57) {if (c=='-') f=-1; c=getchar();}
while (c>=48&&c<=57) p=(p<<1)+(p<<3)+c-48,c=getchar();
return p*f;
}
int main(){
#ifdef __Marvolo
freopen("zht.in","r",stdin);
freopen("zht.out","w",stdout);
#endif
n=read();
for (i=1;i<=n;i++) a[i].x=read(),a[i].p=i;
for (i=1;i<=n;i++) b[i]=read();
for (i=1;i<=n;i++) a[i].id=read(),a[i].y=b[a[i].id];
for (i=1;i<=n;i++){
if (a[i].id==i) continue;
if (a[i].y>=a[i].x) {
puts("-1"); return 0;
}
}
for (i=1;i<=n;i++) p[a[i].id]=i;
for (i=1;i<=n;i++) q[i]=a[i].id;
sort(a+1,a+1+n,cmp);
for (i=1;i<=n;i++){
x=p[a[i].p]; y=q[a[i].p];
if (x==a[i].p) continue;
p[a[i].p]=q[a[i].p]=a[i].p;
p[y]=x; q[x]=y;
cnt++;
Ans[cnt].x=a[i].p; Ans[cnt].y=x;
}
cout<<cnt<<endl;
for (i=1;i<=cnt;i++)
printf("%d %d\n",Ans[i].x,Ans[i].y);
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define endl ("\n")
#define mp make_pair
#define lb lower_bound
#define ff first
#define ss second
#define cn continue
#define br break
#define ins insert
#define int long long
#define bit(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define up upper_bound
#define read(a,n) rep(i,0,n){cin>>a[i];}
#define print(a,n) rep(i,0,n) cout<<a[i]<<" ";
#define rep(i, a, n) for(int i = a; i < n; i++)
#define mod 1000000007
#define yy cout<<"YES"<<endl;
#define nn cout<<"NO"<<endl;
using namespace std;
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1 ;
//cin >> t ;
while (t--)
{
int n;
cin >> n;
int p = log2(n);
int q = pow(2, p);
int v = n / q, s = n % q;
int a = p + v + s;
while (p > 0) {
a = min(a, p + v + s);
q /= 2; p--;
if (q == 0)
break;
v = n / q; s = n % q;
}
cout << a << endl;
}
return 0;
} |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 400005
struct Edge{
int a,b;
};
ll N = 1;
ll uniformity[6*SIZE],partial[6*SIZE];
int global_index = 0;
int LEFT[SIZE],RIGHT[SIZE];
vector<int> G[SIZE];
Edge edge[SIZE];
void init(ll first_N){
while(N < first_N)N *= 2;
}
void add(ll left,ll right,ll value,ll node_id,ll node_left,ll node_right){
if(right <= node_left || left >= node_right)return;
else if(left <= node_left && right >= node_right){
uniformity[node_id] += value;
}else{
partial[node_id] += (min(right,node_right)-max(left,node_left))*value;
add(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);
add(left,right,value,2*node_id+2,(node_left+node_right)/2,node_right);
}
}
ll getSum(ll left,ll right,ll node_id,ll node_left,ll node_right){
if(right <= node_left || left >= node_right)return 0;
else if(left <= node_left && right >= node_right){
return (node_right-node_left)*uniformity[node_id]+partial[node_id];
}else{
ll sum = (min(right,node_right)-max(left,node_left))*uniformity[node_id];
sum += getSum(left,right,2*node_id+1,node_left,(node_left+node_right)/2);
sum += getSum(left,right,2*node_id+2,(node_left+node_right)/2,node_right);
return sum;
}
}
//オイラーツアーで、ノードのカバー範囲を計算する
void euler_tour(int node_id,int pre_node){
LEFT[node_id] = global_index++;
for(int i = 0; i < G[node_id].size(); i++){
if(G[node_id][i] == pre_node)continue;
euler_tour(G[node_id][i],node_id);
}
RIGHT[node_id] = global_index++;
}
int main(){
ll first_N;
scanf("%lld",&first_N);
int from,to;
for(int i = 0; i < first_N-1; i++){
scanf("%d %d",&from,&to);
from--;
to--;
edge[i].a = from;
edge[i].b = to;
G[from].push_back(to);
G[to].push_back(from);
}
euler_tour(0,-1);
init(RIGHT[0]);
for(ll i = 0; i <= 2*N-2; i++){
uniformity[i] = 0;
partial[i] = 0;
}
int command,tmp;
ll x;
int a,b;
ll Q;
scanf("%lld",&Q);
for(ll i = 0; i < Q; i++){
//printf("クエリ;%lld\n",i);
scanf("%d %d %lld",&command,&tmp,&x);
tmp--;
a = edge[tmp].a;
b = edge[tmp].b;
//printf("a:%d b:%d\n",a,b);
if(command == 1){ //a[tmp]からたどる
if(LEFT[a] < LEFT[b]){ //Aの方が外側
add(LEFT[0],RIGHT[0]+1,x,0,0,N);
add(LEFT[b],RIGHT[b]+1,-x,0,0,N);
}else{ //Aの方が内側
add(LEFT[a],RIGHT[a]+1,x,0,0,N);
}
//printf("%d-%dから引き\n",LEFT[b],RIGHT[b]);
}else{ //command == 2;
if(LEFT[b] < LEFT[a]){ //bの方が外側
add(LEFT[0],RIGHT[0]+1,x,0,0,N);
add(LEFT[a],RIGHT[a]+1,-x,0,0,N);
}else{ //bの方が内側
add(LEFT[b],RIGHT[b]+1,x,0,0,N);
}
}
}
for(int i = 0; i < first_N; i++){
printf("%lld\n",getSum(LEFT[i],LEFT[i]+1,0,0,N));
}
return 0;
}
| #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
using Graph = vector<vector<int>>;
vector<ll> d, sum;
void dfs1(const Graph &G, int v, int p, int D) {
d[v] = D;
for (auto nv : G[v]) {
if (nv == p)continue;
dfs1(G, nv, v, D+1);
}
}
void dfs2(const Graph &G, int v, int p){
for (auto nv : G[v]) {
if (nv == p)continue;
sum[nv] += sum[v];
dfs2(G, nv, v);
}
}
int main() {
int n, q;
cin >> n;
Graph G(n);
vector<ll> a(n-1), b(n-1);
rep(i, n-1){
cin >> a[i] >> b[i];
a[i]--; b[i]--;
G[a[i]].push_back(b[i]);
G[b[i]].push_back(a[i]);
}
d.resize(n);
sum.resize(n);
dfs1(G, 0, -1, 0);
cin >> q;
rep(i, q){
ll t, e, x;
cin >> t >> e >> x; e--;
if(t == 1){
if(d[a[e]] < d[b[e]]){
sum[0] += x;
sum[b[e]] -= x;
}else{
sum[a[e]] += x;
}
}else{
if(d[b[e]] < d[a[e]]){
sum[0] += x;
sum[a[e]] -= x;
}else{
sum[b[e]] += x;
}
}
}
dfs2(G, 0, -1);
rep(i, n)cout << sum[i] << endl;
} |
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;
#define PB push_back
#define For(i, n) for (ll i = 0; i < n; i++)
#define trav(a,x) for (auto& a : x)
#define PYES cout<<"YES\n"
#define PNO cout<<"NO\n"
#define PYes cout<<"Yes\n"
#define PNo cout<<"No\n"
#define endl '\n'
#define sq(x) (x*x)
#define vll vector<ll>
#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<int>())
#define mnv(v) *min_element(v.begin(),v.end())
#define mxv(v) *max_element(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define Fas ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
//--------------------------------------------functions-------------------------------------------------//
ll power(ll a,ll b){ll result=1;while(b>0){if(b%2 == 1){result *= a;} a *= a;b /= 2;}return result;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
ll countSetBits(ll x){ll Count=0;while(x>0){if(x&1) Count++;x=x>>1;}return Count;}
bool isPerfectSquare(ll n){ll sr = sqrt(n);if (sr * sr == n)return true;else return false;}
ll mod(ll x,ll M){return ((x%M + M)%M);}
ll add(ll a, ll b,ll M){return mod(mod(a,M)+mod(b,M),M);}
ll mul(ll a, ll b,ll M){return mod(mod(a,M)*mod(b,M),M);}
ll powerM(ll a,ll b,ll M){
ll res=1ll;
while(b){
if(b%2ll==1ll){
res=mul(a,res,M);
}
a=mul(a,a,M);b/=2ll;
}
return res;
}
//------------------------------------sieve of erantothenes-----------------------------------------------//
//ll MAXN=1e7+100;
//vector<ll> fact(MAXN);
//void sieve_of_erantothenes()
//{
// fact[1] = 1;
// for (ll i = 2; i <= MAXN; i++)
// fact[i] = i;
// for (ll i = 4; i <= MAXN; i += 2)
// fact[i] = 2;
// for (ll i = 3; i * i <= MAXN; i++){
// if (fact[i] == i){
// for (ll j = i * i; j <= MAXN; j += i)
// if (fact[j] == j)
// fact[j] = i;
// }
// }
//}
//----------------------------------------nCr mod------------------------------------------------------//
ll modInverse(ll n,ll M){
return powerM(n,M-2,M);
}
ll nCrM(ll n,ll r,ll M){
if(n<r) return 0;
if(r==0) return 1;
vector<ll> fact(n+1);
fact[0]=1;
for(ll i=1;i<=n;i++){
fact[i]=mul(fact[i-1],i,M);
}
return mul(mul(fact[n],modInverse(fact[r],M),M),modInverse(fact[n-r],M),M);
}
//-----------------------------------------------solve-----------------------------------------------------//
void solve(){
set<ll> sa,sb;
ll n,m;cin>>n>>m;
for(ll i=0;i<n;i++){
ll a;cin>>a;
sa.insert(a);
}
for(ll i=0;i<m;i++){
ll a;cin>>a;
sb.insert(a);
}
set<ll> ans;
trav(w, sa){
if(sb.find(w)==sb.end()){
ans.insert(w);
}
}
trav(w, sb){
if(sa.find(w)==sa.end()){
ans.insert(w);
}
}
trav(w,ans){
cout<<w<<" ";
}
cout<<endl;
}
int main(){
Fas;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ll t=0;
// cin>>t;
// while(t--)
solve();
return 0;
}
| // Problem: E - Divide Both
// Contest: AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc206/tasks/abc206_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define pll pair<ll,ll>
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vvi vector<vector<int>>
#define vs vector<string>
#define vpll vector<pll>
#define vpi vector<pi>
#define pb push_back
#define eb emplace_back
#define fi first
#define sc second
#define all(c) (c).begin(),(c).end()
#define sz(c) int((c).size())
#define MP make_pair
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORI(i, a, b) for(int i = (a); i >= (b); i--)
const int INF = 1e9 + 7;
const long long MOD = 1e9 + 7;
// credits : tourist
string to_string(string s) {return '"' + s + '"';}string to_string(const char* s) {return to_string((string) s);}string to_string(bool b) {return (b ? "true" : "false");}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}void debug_out() { cerr << "\n"; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H) << "\n";debug_out(T...);}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
ll gcd(ll x , ll y){
if(y == 0) return x;
if(x == 0) return y;
if(x < y) swap(x , y);
return gcd(x % y , y);
}
const int N = 1e6 + 8;
ll dp[N]; /* number of pairs with gcd = g*/
ll brute(int L , int R, int g){
ll p = 0;
for(int i = L; i <= R; i++){
for(int j = i + 1; j <= R; j++){
p += gcd(i , j) == g;
}
}
return p;
}
void solve(){
int L , R;
cin >> L >> R;
for(int g = R; g >= 1; g--){
int cnt = 0;
for(int m = g; m <= R; m += g){
if(m != g) {
dp[g] -= dp[m];
}
if(m >= L) cnt++;
}
ll val = 1LL * cnt * (cnt - 1) / 2;
dp[g] += val;
}
ll ans = 0;
for(int g = 2; g <= R; g++){
ll val = dp[g];
ll remove = 0;
if(g >= L) remove = (R / g) - 1;
ans += 2LL * (val - remove);
}
cout << ans << endl;
}
int main(){
ios :: sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int tt = 1;
// cin >> tt;
#ifdef SIEVE
construct();
#endif
#ifdef NCR
compute_combinations_table(MOD);
#endif
#ifdef FACTORIALS
compute_factorials(MOD);
#endif
for(int tc = 1; tc <= tt; tc++){
// cout << "Case #" << tc << ": ";
solve();
}
} |
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// cout << fixed << setprecision(8) << result << endl;
int main() {
ll n;
cin >> n;
ll ans = 0;
rep(i,n){
ll a, b;
cin >> a >> b;
ans += (b - a + 1)*(b+a)/2;
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <string>
#include <iomanip>
#include <iostream>
#include <map>
#include <unordered_map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define fi first
#define sc second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsort(v) sort(v.rbegin(),v.rend())
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
// const int MOD = 998244353;
const int MOD = 1e9+7;
const int MAX = 2147483647; // 1<<31-1
const int MIN = -2147483648; // 1<<31
const ll INF = 1e18;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
#define ts to_string
string ts(char c) { return string(1, c); }
string ts(bool b) { return b ? "0" : "1"; }
string ts(const char* s) { return (string)s; }
string ts(string s) { return s; }
template<class A, class B> string ts(pair<A, B> p) {
return "("+ts(p.fi)+", "+ts(p.sc)+")";
}
template<class T> string ts(T v) { // containers with begin(), end()
string res = "";
for (const auto& x: v) {
res += ts(x) + " ";
}
return res;
}
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#include "../../snippits/debugger.cpp"
#define dbg(...) cerr << "L(" << __LINE__ << "): [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#define print_segtree(...) 0
#endif
const vector<vector<int>> dirs = { {0,1},{1,0},{-1,0},{0,-1} };
// distance from origin
struct cmp {
bool operator()(const pii& lhs, const pii& rhs) const {
return (abs(lhs.fi)+abs(lhs.sc))<((abs(rhs.fi)+abs(rhs.sc)));
}
};
// getline(cin, str) for getting a line of string
// call cin.ignore() BETWEEEN cin >> x and getline()!!!
// don't mod before you sort!!!
// clear global state
// remember to %= the result!
// INITIALIZE CORRECTLY, ARE YOU DOING (i,0,*N+1*) WHEN NEEDED?
// PRIORITY QUEUES ARE SORTED BIG TO SMALL
// NEVER assign element to a reference and then pop!!!!!
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1;
cin >> t;
ll res = 0;
while (t--) {
int a, b;
cin >> a >> b;
res += 1LL*(a+b)*(b-a+1)/2;
}
cout << res << '\n';
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define fs first
#define sc second
#define endl '\n'
int A, B, C;
double mem[100][100][100];
double dp(int a, int b, int c) {
if (a >= 100 || b >= 100 || c >= 100)
return (a - A) + (b - B) + (c - C);
if (mem[a][b][c] >= 0)
return mem[a][b][c];
double ad = (double)a, bd = (double)b, cd = (double)c;
double sm = 0;
if(a > 0)
sm += (ad / (ad + bd + cd)) * dp(a + 1, b, c);
if(b > 0)
sm += (bd / (ad + bd + cd)) * dp(a, b + 1, c);
if(c > 0)
sm += (cd / (ad + bd + cd)) * dp(a, b, c + 1);
return mem[a][b][c] = sm;
}
set<int> generate_sums(vector<int> A, int cap) {
int n = A.size();
set<int> ans;
for (int i = 0; i < (1 << n); i++) {
int sm = 0;
for (int j = 0; j < n; j++) {
if (i & (1 << j) && sm < cap) {
sm += A[j];
}
}
ans.insert(sm);
}
return ans;
}
void solve() {
int n, t;
cin >> n >> t;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
vector<int> F(n / 2), S(n % 2 ? n /2 + 1: n / 2);
for (int i = 0; i < n / 2; i++) {
F[i] = A[i];
}
for (int i = n / 2; i < n; i++)
S[i - n / 2] = A[i];
set<int> fsums = generate_sums(F, t), ssums = generate_sums(S, t);
int ans = 0;
for (int val1 : fsums) {
auto fnd = ssums.upper_bound(t - val1);
if (fnd == ssums.begin())
continue;
fnd--;
ans = max(ans, *fnd + val1);
}
cout << ans << endl;
}
signed main() {
cin.sync_with_stdio(false); cin.tie(nullptr);
/*ll t;
cin >> t;
while (t--)*/
solve();
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long long a[100];
long long n,tog;
vector<long long> v1,v2;
long long res;
void dfs1(long long d,long long sum)
{
if(d==n/2+1)
{
v1.push_back(sum);
res=max(res,sum);
return;
}
if(sum+a[d]<=tog)dfs1(d+1,sum+a[d]);
dfs1(d+1,sum);
}
void dfs2(long long d,long long sum)
{
if(d==n+1)
{
v2.push_back(sum);
res=max(res,sum);
return;
}
if(sum+a[d]<=tog)dfs2(d+1,sum+a[d]);
dfs2(d+1,sum);
}
int main()
{
cin>>n>>tog;
for(long long i=1;i<=n;i++) cin>>a[i];
dfs1(1,0);
dfs2(n/2+1,0);
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
for(long long i=0;i!=v1.size();i++)
{
if(v2.size()==0) break;
long long l=0,r=v2.size()-1;
while(l<r)
{
long long mid=l+r+1>>1;
if(v2[mid]<=tog-v1[i]) l=mid;
else r=mid-1;
}
if(v2[l]+v1[i]<=tog)
{
res=max(res,v2[l]+v1[i]);
}
}
cout<<res;
}
|
/*
** author : Dhiraj Govindvira
** date : 19 June 2021 ~ Saturday
** time : 05:30:08 PM
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DHIRAJ
#include "D:/dhiraj/Programming/debug.h"
#else
#define dbg(...) 1
#define cerr if(0) cerr
#endif
using ll = long long int;
#define endl '\n'
template <typename T, typename U>
inline istream & operator >> (istream &in, pair<T, U> &p) {
in >> p.first >> p.second;
return in;
}
template <typename T>
inline istream & operator >> (istream &in, vector<T> &v) {
for(T &x : v) in >> x;
return in;
}
void solve(ll &tc)
{
ll n;
cin >> n;
n = 1.08 * n;
if(n == 206) {
cout << "so-so" << endl;
}
else if(n < 206) {
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
}
int main()
{
#ifdef DHIRAJ
freopen("D:/dhiraj/Programming/i1.txt", "r", stdin);
freopen("D:/dhiraj/Programming/o1.txt", "w", stdout);
freopen("D:/dhiraj/Programming/e1.txt", "w", stderr);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
ll rep = 3;
while(rep--) {
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
// cout << "Case #" << i << ": ";
cerr << "Case #" << i << "\n";
solve(i);
}
if(dbg()) break;
}
return 0;
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#define all(v) begin(v), end(v)
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
using namespace std;
template <class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return true; } return false; }
template <class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return true; } return false; }
template <class S> using pqg = priority_queue<S, vector<S>, greater<S>>;
template <class S> using pq = priority_queue<S>;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pi = pair<int,int>;
using pl = pair<ll, ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvpi = vector<vpi>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MAX = 500000;
const ll INF = 1000000000;
const ll INFLL = 1000000000000000000;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator+=(const mint& a) {
x += a.x;
if (x >= MOD) x -= MOD;
return *this;
}
mint operator-=(const mint& a) {
if (x < a.x) x += MOD;
x -= a.x;
return *this;
}
mint operator*=(const mint& a) {
x = x * a.x % MOD;
return *this;
}
mint operator/=(const mint& a) { return *this *= a.inv(); }
mint operator+(const mint& a) const { return mint(*this) += a; }
mint operator-(const mint& a) const { return mint(*this) -= a; }
mint operator*(const mint& a) const { return mint(*this) *= a; }
mint operator/(const mint& a) const { return mint(*this) /= a; }
mint inv(void) const { return pow(MOD - 2); }
mint pow(ll a) const {
if (!a) return 1;
mint t = pow(a >> 1);
t *= t;
if (a & 1) t *= (*this);
return t;
}
friend ostream& operator<<(ostream& os, const mint& a) {
os << a.x;
return os;
}
};
struct UnionFind {
vector<int> parent, siz;
UnionFind(int n) : parent(n), siz(n, 1) {
for (int i = 0; i < n; ++i) parent[i] = i;
}
int root(int x) {
if (parent[x] == x) return x;
return parent[x] = root(parent[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] > siz[y]) swap(x, y);
siz[y] += siz[x];
parent[x] = y;
return true;
}
int size(int x) {
return siz[root(x)];
}
bool same(int x, int y) {
return root(x) == root(y);
}
};
int main(void) {
int n;
cin >> n;
int x = n * 1.08;
if (x < 206) cout << "Yay!" << endl;
else if (x == 206) cout << "so-so" << endl;
else cout << ":(" << endl;
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
long long b, c;
long long solve();
int main() {
cin >> b >> c;
cout << solve() << endl;
return 0;
}
long long solve() {
vector<P> v;
v.emplace_back(b - c / 2, b);
v.emplace_back(-b - (c - 1) / 2, -b);
v.emplace_back(-b, -(b - (c - 1) / 2));
if (c >= 2) v.emplace_back(b, b + (c - 2) / 2);
{
vector<P> tmp;
sort(v.begin(), v.end());
for (auto &[l, r] : v)
if (l >= r) swap(l, r);
int len = v.size();
long long l = v[0].first, r = v[0].second;
for (int i = 1; i < len; ++i) {
if (v[i].first <= r)
r = max(v[i].second, r);
else {
tmp.emplace_back(l, r);
l = v[i].first, r = v[i].second;
}
}
tmp.emplace_back(l, r);
swap(v, tmp);
}
long long res = 0;
for (auto [l, r] : v) res += r - l + 1;
return res;
} | #include <bits/stdc++.h>
#define ll long long
#define SZ(vvv) ((int)vvv.size())
#define all(vvv) (vvv.begin(), vvv.end())
#define fastIO cout << fixed << setprecision(7), ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
const int N = 1e5 + 9, M = 1e3 + 3, MOD = 1e9 + 7, OO = 1e9;
const ll INF = 1e15;
void runtestcase() {
int n;
cin >> n;
vector<int> vec(n);
ll total = 0;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i < n; ++i) {
total += n - (upper_bound(vec.begin(), vec.end(), vec[i]) - vec.begin());
}
cout << total;
}
int main() {
// freopen("/home/omar/input.in", "rt", stdin);
// freopen("/home/omar/output.in", "wt", stdout);
#ifdef LOCAL
#endif
fastIO;
int t = 1, tt = 1;
// cin >> t;
while(t--)
runtestcase();
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,b,a) for(int i=b;i>=a;i--)
#define efo(i,u,v) for(int i=BB[u],v=B[BB[u]][1];i;v=B[i=B[i][0]][1])
#define mset(a,x) memset(a,x,sizeof(a))
template<typename T> bool chkmin(T &a,const T &b) {return b<a?a=b,1:0;}
template<typename T> bool chkmax(T &a,const T &b) {return b>a?a=b,1:0;}
using namespace std;
typedef long long ll;
typedef double db;
char ch;
int read(){int n=0,p=1;for(ch=getchar();ch<'0' || '9'<ch;ch=getchar())if(ch=='-') p=-1;for(;'0'<=ch && ch<='9';ch=getchar()) n=n*10+ch-'0';return n*p;}
const int N=105;
int n,a[N][N],fa[N],sz[N];
int getfa(int x)
{
if(!fa[x]) return x;
fa[x]=getfa(fa[x]);
return fa[x];
}
bool vis[N],insta[N];
int sta[N],cnt[N];
void mrg(int x,int y)
{
int fx=getfa(x),fy=getfa(y);
if(fx==fy) return;
fa[fy]=fx;
sz[fx]+=sz[fy],sz[fy]=0;
}
void dfs(int x)
{
if(vis[x])
{
if(insta[x])
for(int i=sta[0];sta[i]!=x;i--)
mrg(sta[i],x);
return;
}
sta[++sta[0]]=x,insta[x]=1;
vis[x]=1;
fo(y,1,n)
if(a[x][y]) dfs(y);
sta[sta[0]--]=0,insta[x]=0;
}
void dfs1(int x)
{
vis[x]=1,++cnt[x];
fo(y,1,n) if(a[x][y] && !vis[y])
{
dfs1(y);
}
}
int main()
{
//freopen("!.in","r",stdin);
//freopen(".out","w",stdout);
scanf("%d\n",&n);
fo(i,1,n)
{
fo(j,1,n) a[i][j]=getchar()-'0';
scanf("\n");
sz[i]=1;
}
fo(i,1,n)
{
mset(vis,0);
dfs(i);
}
fo(i,1,n)
{
mset(vis,0);
dfs1(i);
}
db ans=0;
fo(i,1,n)
if(getfa(i)==i) ans+=sz[i]*1.0/cnt[i];
printf("%.12lf\n",ans);
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int ed[101][101];
int visit[101];
void cle()
{
for(int i = 0; i < 101; i++)visit[i]=0;
}
double cc = 0;
void dfs(int v)
{
visit[v] = 1;
cc++;
for(int i = 1; i < 101; i++)
{
if(ed[i][v] == 1 && visit[i] == 0)
{
dfs(i);
}
}
}
int main()
{
int n;
cin >>n;
for(int i = 1; i <= n; i++)
{
string y; cin >> y;
for(int j = 1; j <= n; j++)
{
ed[i][j]= y[j - 1] - '0';
}
}
double u = 0;
for(int i = 0; i < n; i++)
{
cle();
cc = 0;
dfs(i+1);
u+= 1. /cc;
}
printf("%.14lf", u);
}
|
#include <bits/stdc++.h>
#include <numeric>
// #include <atcoder/modint>
using namespace std;
// using namespace atcoder;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll> > Pd;
const ll INF = 1e18;
const ll fact_table = 32008;
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
// priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop
ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←
/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)
#define all(c) begin(c), end(c)
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec rv(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];
void c3_init() {
fact[0] = rfact[0] = 1;
for (ll i = 1; i <= fact_table; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
for (ll i = fact_table; i >= 1; i--) {
rfact[i - 1] = rfact[i] * i;
rfact[i - 1] %= mod;
}
return;
}
ll c3(ll n, ll r) {
return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
bool icpc = false;
bool multicase = false;
ll n, m;
ll table[200005];
bool solve() {
ll k;
cin >> k;
for (ll i = 1; i <= 200000; i++) {
ll cnt = 0;
for (ll j = 1; j * j <= i; j++) {
if (i % j == 0) {
cnt ++;
if (j * j < i) cnt ++;
}
}
table[i] = table[i - 1] + cnt;
}
ll ans = 0;
for (int i = 1; i <= k; i++) {
ll r = k / i;
ans += table[r];
}
p(ans);
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (icpc) {
while (solve());
return 0;
}
ll q, testcase = 1;
if (multicase) {
cin >> q;
} else {
q = 1;
}
while (q--) {
// pu("Case ");pu("#");pu(testcase);pu(": ");
solve();
testcase++;
}
// solve();
return 0;
} | #include <bits/stdc++.h>
#define li long int
#define lli long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si size()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define lb lower_bound
#define ub upper_bound
#define BS binary_search
#define pll pair < lli, lli >
#define pii pair < int, int>
#define vi vector < int >
#define vvi vector < vector < int > >
#define vlli vector < lli >
#define all(x) x.begin(), x.end()
#define vvlli vector < vector < lli > >
#define vp vector < pll >
#define vvp vector< vector< pll> >
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<lli , null_type, less<lli>, rb_tree_tag,tree_order_statistics_node_update>
#define fill(a,n) for(lli iiii=0;iiii<n;iiii++) cin>>a[iiii];
#define mpii map<int, int>
# define precision(x) cout << fixed << setprecision(x)
#define REP(i, a, b) for (int i=a; i<=b; i++)
using namespace __gnu_pbds;
lli mod=1e9+7;
using namespace std;
#define MAXN 200001
lli spf[MAXN];
void sieve()
{
spf[1] = 1;
for (lli i=2; i<MAXN; i++) spf[i] = i;
for (int i=4; i<MAXN; i+=2) spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
if (spf[i] == i)
{
for (int j=i*i; j<MAXN; j+=i)
if (spf[j]==j)
spf[j] = i;
}
}
}
vector<lli> getFactorization(lli x)
{
vlli ret;
while (x != 1)
{
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
int main()
{
//vlli p = getFactorization(x);
fastio;
sieve();
lli k,i;
cin>>k;
vlli dp(k+1,-1); dp[1]=1;
for(i=2;i<=k;i++)
{
//x+y+x=k; k+2 C 2 = ((k+2)*(k+1))/2;
vlli p = getFactorization(i);
set<lli> VAL;
for(auto ii:p) VAL.insert(ii);
vlli val; lli sz=VAL.si;
for(auto ii:VAL) val.pb(ii);
vlli f(sz,0);
for(auto ii:p)
{
lli ind=lb(all(val),ii) - val.begin();
f[ind]++;
}
dp[i]=1;
for(auto ii:f) dp[i]=dp[i]*(((ii+2)*(ii+1))/2);
}
//for(i=1;i<=10;i++) cout<<"dp["<<i<<"]="<<dp[i]<<"\n";
lli ans=0;
for(i=1;i<=k;i++) ans+=dp[i];
//cout<<"ans= ";
cout<<ans<<"\n";
} |
#include "bits/stdc++.h"
using namespace std;
#define dbg(var) cout<<#var<<"="<<var<<" "
#define nl cout<<"\n"
#define fr(i,n) for(int i=0;i<n;i++)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define fa(v) for(auto &i:v)
#define all(v) v.begin(),v.end()
#define sz(v) (int)(v.size())
//#define int long long
void solve(){
int n; cin >> n;
string s; cin >> s;
s = "#" + s;
int dp[n+4][30];memset(dp,0,sizeof dp);
rep(i,1,n) dp[i][s[i] - 'A']++;
fr(j,30)
rep(i,1,n){
dp[i][j] += dp[i-1][j];
}
int ans = 0;
auto gfr = [&](int l,int r,char c){
return dp[r][c-'A'] - dp[l-1][c-'A'];
};
rep(i,1,n){
for(int j = i+1; j<=n; j+=2){
if(gfr(i,j,'A') == gfr(i,j,'T') and gfr(i,j,'C') == gfr(i,j,'G'))
ans++;
}
}
cout << ans << "\n";
}
int32_t main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// int tst; cin >> tst; while(tst--)
{
solve();
}
} | //Solution By SlavicG
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll pw(ll a,ll b,ll m){a%=m;ll r=1;while(b>0){if(b&1)r=(r*a)%m;a=(a*a)%m;b/=2;}return r;}
ll gcd(ll a, ll b) {if(!b)return a;return gcd(b,a % b);}
ll lcm(ll a,ll b){return(a*b)/gcd(a,b);}
ll fact(ll n, ll mod){ll ret=1;for(ll i=1;i<=n;i++)ret=(ret*i)%mod;return ret;}
bool isPrime(ll n){if(n<=1)return false;if(n<=3)return true;if(n%2==0||n%3==0)return false;for(ll i=5;i*i <= n;i=i+6)if(n%i==0||n%(i+2)==0)return false;return true;}
const int N = 2000;
char c[N][N];
int dist[N][N];
bool vis[N][N];
vector<pair<pair<int,int>,int>> adj[N][N];
void solve() {
int n,m;
cin >> n >> m;
char c[n][m];
int startI = -1, startJ = -1;
int endI = -1, endJ = -1;
vector<pair<pair<int,int>,int>> v[26];
for(int i =0;i < n;i++)
{
string s;
cin >> s;
for(int j= 0;j < m;j++)
{
c[i][j] = s[j];
if(c[i][j] >= 'a' && c[i][j] <= 'z')
{
v[c[i][j] - 'a'].pb({{i,j},1});
}
if(c[i][j] == 'S'){
startI = i, startJ = j;
}
if(c[i][j] == 'G'){
endI = i, endJ = j;
}
}
}
for(int i =0;i < n;i++)
{
for(int j = 0;j < m;j++)
{
if(c[i][j] == '#')continue;
if(j + 1 < m)
{
if(c[i][j+1] != '#')
{
adj[i][j].pb({{i,j + 1},1});
adj[i][j+1].pb({{i,j}, 1});
}
}
if(i +1 < n)
{
if(c[i+1][j] != '#')
{
adj[i][j].pb({{i+1,j},1});
adj[i+1][j].pb({{i,j},1});
}
}
}
}
bool taken[26];
for(int i= 0;i < 26;i++)
taken[i] = false;
priority_queue<pair<int,pair<int,int>>> q;
q.push({0,{startI,startJ}});
for(int i =0;i < n;i++)
for(int j = 0; j < m;j++){
dist[i][j] = 1e8;
}
dist[startI][startJ] = 0;
while(!q.empty())
{
int a = q.top().second.first, b = q.top().second.second;
q.pop();
if(vis[a][b])continue;
vis[a][b] = true;
if(c[a][b] >= 'a' && c[a][b] <='z' && !taken[c[a][b] - 'a'])
{
taken[c[a][b] - 'a'] = true;
for(auto i : v[c[a][b]-'a'])
{
int x = i.first.first;
int y = i.first.second;
int weight = i.second;
if(dist[x][y] > dist[a][b] + weight){
dist[x][y] = dist[a][b] + weight;
q.push({-dist[x][y], {x,y}});
}
}
}
for(auto i : adj[a][b])
{
int x = i.first.first;
int y = i.first.second;
int weight = i.second;
if(dist[x][y] > dist[a][b] + weight){
dist[x][y] = dist[a][b] + weight;
q.push({-dist[x][y], {x,y}});
}
}
}
if(dist[endI][endJ] == 1e8){
cout << -1;
return;
}
cout << dist[endI][endJ];
}
int32_t main()
{
fastio;
int t = 1;
//cin >> t;
while(t--){
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S[3];
cin >> S[0] >> S[1] >> S[2];
int frag[3][10]={};
int count=0;//文字数のカウント
for(int i=0;i<3;i++){
for(int k=0;k<S[i].size();k++){
if(frag[i][k]==0){
count++;
frag[i][k]=count;
}
for(int j=0;j<3;j++){
for(int h=0;h<S[j].size();h++){
if(S[i][k]==S[j][h]) frag[j][h]=frag[i][k];
}
}
}
}
/*for(int i=0;i<3;i++){
for(int j=0;j<S[i].size();j++){
cout << frag[i][j] << " ";
}
cout << endl;
}*/
vector<int> v={0,1,2,3,4,5,6,7,8,9};
bool ok=false;
long long int N[3];
do{
if(count>10) break;
bool mozisuu=true;
for(int i=0;i<3;i++){
N[i]=0;
if(v[frag[i][0]-1]==0) mozisuu=false;
for(int j=0;j<S[i].size();j++){
N[i]+=pow(10,S[i].size()-1-j)*v[frag[i][j]-1];
}
}
if(N[0]+N[1]==N[2] && mozisuu) ok=true;
}while(next_permutation(v.begin(),v.end()) && !ok );
if(ok){
cout << N[0] << endl;
cout << N[1] << endl;
cout << N[2] << endl;
}
else cout << "UNSOLVABLE" << endl;
} | #include <bits/stdc++.h>
using namespace std;
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(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
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...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int mod = 1e9+7;
int sum(int a, int b){return (a+b) % mod;}
int sub(int a, int b){return (a + mod - b) % mod;}
int mul(int a, int b){return (1ll * a * b) % mod;}
int power(int a,int b){
int res = 1;
while(b){
if(b&1)res = mul(res,a);
b >>= 1;
a = mul(a,a);
}
return res;
}
#define no cout << "UNSOLVABLE\n";
vii pos[30];
string str[3],res[3];
vector<char> unicos;
bool can(string tmp){
if(tmp[0] == '0')return 0;
for(auto &c : tmp)if(c < '0' || c > '9')return 0;
return 1;
}
ll conv(string tmp){
stringstream ss(tmp);
ll x; ss >> x;
return x;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
forn(i,0,3){
cin >> str[i];
res[i] = str[i];
forn(j,0,(int)str[i].size()){
unicos.pb(str[i][j]);
pos[str[i][j]-'a'].pb({i,j});
}
}
sort(all(unicos));
unicos.erase(unique(all(unicos)),unicos.end());
//for(auto &x : unicos)cout << x << ' ';
//cout << '\n';
if(unicos.size() > 10){
no;
return 0;
}
vi vals;
forn(i,0,10)vals.pb(i);
do{
forn(k,0,(int)unicos.size()){
for(auto &x : pos[unicos[k]-'a']){
res[x.fi][x.se] = (char)(vals[k]+'0');
}
}
bool es = true;
forn(i,0,3)if(!can(res[i]))es = false;
if(!es)continue;
ll n1 = conv(res[0]);
ll n2 = conv(res[1]);
ll n3 = conv(res[2]);
if(n1+n2 == n3){
cout << n1 << '\n';
cout << n2 << '\n';
cout << n3 << '\n';
return 0;
}
}while(next_permutation(all(vals)));
no;
return 0;
}
/*
__builtin_mul_overflow(x,y,&x)
-fsplit-stack
*/
|
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string t;
cin >> t;
if (n == 1) {
if (t == "1") {
cout << (long long)2e10 << '\n';
} else {
cout << (long long)1e10 << '\n';
}
return 0;
} else if (n == 2) {
if (t == "11") {
cout << (long long)1e10 << '\n';
} else if (t == "10") {
cout << (long long)1e10 << '\n';
} else if (t == "01") {
cout << (long long)(1e10) - 1 << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}
vector<int> a(3);
for (int i = 0; i < 3; i++) {
a[i] = t[i] - '0';
}
if (a[0] + a[1] + a[2] != 2) {
cout << 0 << '\n';
return 0;
}
for (int i = 0; i < n; i++) {
if (a[i % 3] != t[i] - '0') {
cout << 0 << '\n';
return 0;
}
}
int b;
if (a[0] == 0) {
b = 2;
} else if (a[1] == 0) {
b = 1;
} else {
b = 0;
}
long long i = (long long)(3e10) - 1;
i -= n - 1;
while (i % 3 != b) {
i--;
}
cout << i / 3 + 1 << '\n';
return 0;
} | /*
You're my honeybunch, sugar plum
Pumpy-umpy-umpkin
You're my sweetie pie
You're my cuppycake, gumdrop
Snoogums, boogums, you're
The apple of my eye
And I love you so
And I want you to know
That I'm always be right here
And I want to sing
Sweet songs to you
Because you are so dear...
*/
#include <bits/stdc++.h>
#include<iostream>
#define boost ios::sync_with_stdio(0); cin.tie(0);
#define ll long long
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define pai pair<int, int>
#define ar array
using namespace std;
int const nax=2e5;
int const M=1e9;
const int64_t Leng = int64_t(3e10);
void solve(){
int n;
cin >>n ;
ll answer =0 ;
string s;
cin>>s;
for(int i=0;i<3;i++){
bool valid = true;
for(int j=0;j<n;j++){
int index = i+j;
char want = index % 3 < 2 ? '1' : '0';
valid = valid && s[j]==want;
}
if(valid){
int64_t lastindex = Leng - n;
while(lastindex%3!=i)lastindex--;
answer += (lastindex-i)/3 +1;
}
}
cout << answer<< endl;
}
int main(){
boost;
int t=1,z=1;
//cin>>t;
while(t--){
//cout<< "Case #"<< z++ << ": " ;
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
int n;
vector<P> v;
long long solve();
int main() {
cin >> n;
v.resize(n);
for (auto &p : v) cin >> p.first >> p.second;
cout << solve() << endl;
return 0;
}
long long solve() {
vector<int> id(n), p;
iota(id.begin(), id.end(), 0);
sort(id.begin(), id.end(), [](int l, int r) { return v[l] < v[r]; });
for (int i = 0; i < min(4, n); ++i) {
p.push_back(id[i]);
p.push_back(id[n - 1 - i]);
}
for (auto &p : v) swap(p.first, p.second);
sort(id.begin(), id.end(), [](int l, int r) { return v[l] < v[r]; });
for (int i = 0; i < min(4, n); ++i) {
p.push_back(id[i]);
p.push_back(id[n - 1 - i]);
}
sort(p.begin(), p.end());
p.erase(unique(p.begin(), p.end()), p.end());
n = p.size();
vector<int> res;
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
res.push_back(max(abs(v[p[i]].first - v[p[j]].first),
abs(v[p[i]].second - v[p[j]].second)));
sort(res.begin(), res.end());
res.pop_back();
return res.back();
} |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
double xs[200000+10];
double ys[200000+10];
bool g[105][105];
int visited[105];
int counter;
int main(void) {
int n;
scanf("%d", &n);
REP(i, n) {
scanf("%lf%lf", &xs[i], &ys[i]);
}
int start = n;
int goal = n+1;
double left = 0;
double right = 100;
REP(iTry, 100) {
double mid = (left + right) / 2;
REP(i, n) {
g[i][i] = true;
g[i][start] = g[start][i] = (ys[i] + 100) <= 2*mid;
g[i][goal] = g[goal][i] = (100 - ys[i]) <= 2*mid;
REP(j, i) {
g[i][j] = g[j][i] = sqrt((xs[i]-xs[j])*(xs[i]-xs[j]) + (ys[i]-ys[j])*(ys[i]-ys[j])) <= 2*mid;
}
}
++counter;
queue<int> q;
q.push(start);
visited[start] = counter;
while(!q.empty()){
int cur = q.front(); q.pop();
REP(i, n+2) {
if(g[cur][i] && visited[i] != counter) {
q.push(i);
visited[i] = counter;
}
}
}
if(visited[goal] == counter) {
right = mid;
} else {
left = mid;
}
}
printf("%.10f\n", left);
return 0;
}
|
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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
int N;
int to[400001], ne[400001], he[200001];
int Q[200001], vis[200001], p, q;
ll are[200001];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep1(i, N * 2 - 2) {
int a, b;
cin >> a >> b;
to[i] = b;
ne[i] = he[a];
he[a] = i++;
to[i] = a;
ne[i] = he[b];
he[b] = i;
}
Q[q++] = 1;
while (p < q) {
int u = Q[p++];
vis[u] = -1;
for (int i = he[u]; i; i = ne[i]) {
if (vis[to[i]] == 0) {
Q[q++] = to[i];
}
}
}
int tmp = Q[N - 1];
p = 0;
q = 0;
Q[q++] = tmp;
vis[tmp] = 0;
while (p < q) {
int u = Q[p++];
for (int i = he[u]; i; i = ne[i]) {
if (vis[to[i]] < 0) {
vis[to[i]] = u;
Q[q++] = to[i];
}
}
}
ll m = (1ll << 20) - 1, m0 = ~m, m1 = 1ll << 20;
for (int i = N - 1; i >= 0; i--) {
int u = Q[i];
ll kari = (are[u] & m0) + m1 + u;
if (are[vis[u]] < kari) are[vis[u]] = kari;
}
int k = 0;
q = 0;
Q[q++] = tmp;
while (q) {
k++;
int u = Q[q - 1];
if (u < 0) q--;
else {
vis[u] = -k;
Q[q - 1] = -u;
int nanika = are[u] & m;
if(nanika) Q[q++] = nanika;
for (int i = he[u]; i; i = ne[i]) {
int v = to[i];
if (vis[v] >= 0 && v != nanika) {
Q[q++] = v;
}
}
}
}
rep1(i, N) cosp(-vis[i]);
Would you please return 0;
} | #include <iostream>
#include <cstdio>
const int nn = 2e5 + 5;
int n, ans[nn], tot;
int cnt, prev[nn << 1], last[nn], to[nn << 1];
void addedge(int p, int q) {
prev[++cnt] = last[p];
to[last[p] = cnt] = q;
}
int dep[nn], son[nn];
void dfs1(int p, int fa) {
for (int i = last[p]; i; i = prev[i]) {
if (to[i] != fa) {
dfs1(to[i], p);
if (dep[p] < dep[to[i]] + 1) {
dep[p] = dep[to[i]] + 1;
son[p] = to[i];
}
}
}
}
void dfs2(int p, int fa) {
ans[p] = ++tot;
for (int i = last[p]; i; i = prev[i])
if (to[i] != fa && to[i] != son[p])
dfs2(to[i], p);
if (son[p]) dfs2(son[p], p);
++tot;
}
int main() {
scanf("%d", &n);
for (int i = 1, p, q; i < n; i++) {
scanf("%d %d", &p, &q);
addedge(p, q);
addedge(q, p);
}
dfs1(1, 0);
int p = 1;
while (son[p]) p = son[p];
for (int i = 1; i <= n; i++)
dep[i] = son[i] = 0;
dfs1(p, 0); dfs2(p, 0);
for (int i = 1; i <= n; i++)
printf("%d ", ans[i]);
} |
// Problem: A - Star
// Contest: AtCoder - AtCoder Beginner Contest 192
// URL: https://atcoder.jp/contests/abc192/tasks/abc192_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define endl '\n'
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fill(a,b) memset(a, b, sizeof(a))
#define setbits(x) __builtin_popcountll(x)
const int inf=0x3f3f3f3f3f3f3f3f;
int dx[]={0,1,1,1,0,-1,-1,-1};
int dy[]={1,1,0,-1,-1,-1,0,1};
// <--------------------Code Begins Here-------------------->
int32_t main() {
SPEED;
int t = 1;
// cin>>t;
while(t--) {
int n;
cin>>n;
if(n % 100 == 0)cout<<100;
else {
int x = n - (100 * ((n + 99) / 100));
cout<<-x;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using llu = unsigned long long;
using ld = long double;
#define CEIL(x, y) (ll)ceil((ld)(x) / (ld)(y))
#define dbgLST(ds) for(auto it : ds) cout << it << ' ';
#define dbgMP(ds) for(auto it : ds) cout << it.first << ' ' << it.second << '\n';
const double PI = acos(-1.0), g = 9.80665;
const ll unseen = 0, pinf = 1e18 + 505, ninf = -1e18 - 505, md = 1000000007;
ll i, j, k, n, m;
bool is;
void solve(void)
{
ll n;
cin >> n;
ll lb = 1000;
ll sz = 3;
ll ans = 0;
while(lb <= n) {
ans += min((n - lb + 1), (lb * 9)) * (sz / 3);
lb *= 10;
sz++;
}
cout << ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int testcase = 1;
// cin >> testcase;
while(testcase--) {
solve();
}
return 0;
} |
#include <stdio.h>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <functional>
#include <limits.h>
#include <numeric>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define inf INT_MAX
#define linf LLONG_MAX
#define ninf INT_MIN
#define nlinf LLONG_MIN
#define mod 0
ll solve(int now,int h,int w,int a,int b,vector<vector<int>> board){
int y=now/h,x=now%h;
if(now==h*w)return 1;
if(board[x][y]==1)return solve(now+1,h,w,a,b,board);
board[x][y]=1;
ll count=0;
if(board[x+1][y]==0){
board[x+1][y]=1;
if(a>0)count+=solve(now+1,h,w,a-1,b,board);
board[x+1][y]=0;
}
if(board[x][y+1]==0){
board[x][y+1]=1;
if(a>0)count+=solve(now+1,h,w,a-1,b,board);
board[x][y+1]=0;
}
if(b>0)count+=solve(now+1,h,w,a,b-1,board);
return count;
}
int main(){
int h,w;cin>>h>>w;
int a,b;cin>>a>>b;
vector<vector<int>> board(h+1,vector<int>(w+1));
rep(i,h+1)board[i][w]=1;
rep(i,w+1)board[h][i]=1;
cout<<solve(0,h,w,a,b,board)<<endl;
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<vector>
#include<string>
#include<cstring>
#include<ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// <<implemented_sorted_vector>> new_data_set p;
// <<insert_like_set>> insert(key):log(n)
//<<accessing_iterator_by_index>> find_by_order(idx):log(n)
// <<accessing_by_value>> order_of_key(key):log(n)
// << replace less<int> by greater<int> for descending order>>
// find(key), erase(find(key)) works the same!
#ifndef ONLINE_JUDGE // setting up print debugging
template<class K, class V>ostream& operator<<(ostream&s,const pair<K,V>&p){s<<'<'<<p.x<<", "<<p.y<<'>';return s;}
template<class T, class=typename T::value_type, class=typename enable_if<!is_same<T,string>::value>::type>
ostream& operator<<(ostream&s,const T&v){s<<'[';for(auto&x:v){s<<x<<", ";}if(!v.empty()){s<<"\b\b";}s<<']';return s;}
void __prnt(){cerr<<endl;} template<class T, class...Ts>void __prnt(T&&a,Ts&&...etc){cerr<<a<<' ';__prnt(etc...);}
#define print(...) __prnt(__VA_ARGS__)
#else
#define print(...)
#endif
typedef long long ll;
typedef long l;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ERR(x) cout<<#x<<"="<<x<<endl
#define ERR2(x,y) cout<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl;
#define show(v) for(auto e: v) cout<<e<<" ";
#define showArr(A,n) for(int i=0;i<n;i++) cout<<A[i]<<" ";
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define mp make_pair
#define ff first
#define ss second
#define umpit unordered_map<ll,ll>::iterator
#define mpit map<ll,ll>::iterator
#define setit set<ll>::iterator
#define all(v) v.begin(),v.end()
ll ans = 0;
ll H,W,A,B;
void dfs(ll i, ll bit, ll A, ll B){
if(i == H*W){
ans++;
return;
}
if(bit & 1LL << i){
dfs(i+1, bit, A, B);
return;
}
if(B){
dfs(i+1, bit | 1LL << i, A, B-1);
}
if(A){
if(i % W != W-1 && ~bit & 1LL << i+1){
dfs(i+1, bit | 1LL << i | 1LL << i+1, A-1, B);
}
if(i+W < H*W){
dfs(i+1, bit | 1LL << i | 1LL << i+W, A-1, B);
}
}
}
int main()
{
int t;
t = 1;
int Case = 0;
while(t--)
{
cin >> H >> W >> A >> B;
dfs(0,0,A,B);
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int A,B;cin>>A>>B;
map<int,int>mp;
for(int i=A;i<=B;i++){
for(int j=1;j*j<=i;j++){
if(i%j==0){
mp[j]++;
if(j!=i/j){
mp[i/j]++;
}
}
}
}
int ans=0;
for(auto i:mp){
if(i.second>=2){
ans=i.first;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int findMaxGCD(int arr[], int n)
{
int high = 0;
for (int i = 0; i < n; i++)
high = max(high, arr[i]);
int count[high + 1] = {0};
for (int i = 0; i < n; i++)
count[arr[i]]++;
int counter = 0;
for (int i = high; i >= 1; i--)
{
int j = i;
counter = 0;
while (j <= high)
{
if(count[j] >=2)
return j;
else if (count[j] == 1)
counter++;
j += i;
if (counter == 2)
return i;
}
}
}
int main()
{
int a,b;
cin >> a >> b;
int arr[b-a+1];
for(int i = a; i <= b; ++i){
arr[i-a] = i;
}
int n = sizeof(arr) / sizeof(arr[0]);
cout << findMaxGCD(arr, n);
return 0;
} |
#include <bits/stdc++.h>
#define MOD 1000000007LL
#define INF 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-6
#define rep(i, l, r) for (int i = l; i < (int)(r); i++)
#define rrep(i, l, r) for (int i = ((int)(r) - 1); i >= l; i--)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
struct edge { int to, cost; };
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 gcd(int a, int b) { while(b){ int c = b; b = a % b; a = c; } return a; }
int lcm(int a, int b) { if(!a || !b) return 0; return a * b / gcd(a, b); }
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<double> a(N),b(N),c(N),d(N);
for(int _=0; _<2; _++){
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
int x = 0, y = 0;
for(int i=0; i<N; i++){
x += a[i];
y += b[i];
a[i] *= N;
b[i] *= N;
}
for(int i=0; i<N; i++){
a[i] -= x;
b[i] -= y;
}
swap(a,c);
swap(b,d);
}
for(int i=0; i<N; i++){
if(a[i]!=0 || b[i]!=0){
swap(a[i],a[0]);
swap(b[i],b[0]);
}
}
string ans = "No";
const double eps = 1e-6;
for(int i=0; i<N; i++){
double angle = atan2(d[i],c[i])-atan2(b[0],a[0]);
bool flag = true;
for(int j=0; j<N; j++){
double A = a[j]*cos(angle)-b[j]*sin(angle);
double B = a[j]*sin(angle)+b[j]*cos(angle);
bool flag2 = false;
for(int k=0; k<N; k++){
if(std::abs(A-c[k])<=eps && std::abs(B-d[k])<=eps) flag2 = true;
}
flag &= flag2;
}
if(flag) ans = "Yes";
}
cout << ans << endl;
} | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//~ while (clock()<=69*CLOCKS_PER_SEC)
#define ll long long
#define ld long double
#define pi pair<int,int>
#define pd pair<ld,ld>
#define ft first
#define sd second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define FOR(i,a,b) for(int i=(a); i<=(b);i++)
#define F(i,a,b) FOR(i,(a),(b)-1)
#define REV(i,a,b) for(int i=(a); i>=(b);i--)
#define VI vector<int>
#define VPI vector<pi>
#define VPD vector<pd>
#define PI 3.14159265
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)((a).size())
#define int long long
template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long K = 1000;
const long long KK = K*K;
const long long MIL = KK*K;
const long long INF = MIL*MIL;
const long long MOD = 1e9 + 7;
const long long N = 1e5 + 10, M=10;
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2 && c1 == c2) {
cout << "0\n";
return;
}
if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2 || (abs(r1 - r2) + abs(c1 - c2) <= 3)) {
cout << "1\n";
return;
}
if ((r1 + c1) % 2 == (r2 + c2)%2 && ((r1 - c1) % 2 + 2) % 2 == ((r2 - c2 + 2) % 2 + 2) % 2) {
cout << "2\n";
return;
}
FOR(i,-3, 3) {
FOR(j, -3, 3) {
if (abs(i) + abs(j) <= 3) {
int a = r1 + i, b = c1 + j;
if (a + b == r2 + c2 || a - b == r2 - c2 || (abs(a - r2) + abs(b - c2) <= 3)) {
cout << "2\n";
return;
}
}
}
}
FOR(i,-3, 3) {
FOR(j, -3, 3) {
if (abs(i) + abs(j) <= 3) {
int c = r2 + i, d = c2 + j;
if (r1 + c1 == c + d || r1 - c1 == c - d || (abs(r1 - c) + abs(c1 - d) <= 3)) {
cout << "2\n";
return;
}
}
}
}
cout << "3\n";
}
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
// cout.tie(0);
cerr.tie(0);
cout << setprecision(9) << fixed;
cerr << setprecision(6) << fixed;
int test = 1, f;
// cin >> test;
F(_test, 0, test) {
//cout<<"Case #"<<_test + 1<<": ";
solve();
// if(_test == 1)
// return 0;
}
}
/*
*/ |
#include<bits/stdc++.h>
using namespace std;
long long dp[67][2],ara[67];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=1,cnt=0,res=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<string>vst;
set<long long>st,nt,tt; map<long long,long long>mp,nq,qr; string str,ttr,ntr;
long long idx,sta;
scanf("%lld",&n);
for(i=1;i<=n;i++)
{
cin>>str;
if(str=="AND")ara[i]=3;
else{ ara[i]=5; }
}
for(idx=n+1;idx>=0;idx--)
{
for(sta=0;sta<=1;sta++)
{
if(idx==n+1)
{
if(sta==1)dp[idx][sta]=y;
else{ dp[idx][sta]=x; }
}
else
{
if(idx==0)
{
dp[idx][sta]=dp[idx+1][sta];
}
else
{
if(ara[idx]==3){ p=sta&1; q=sta&0; }
else{ p=sta|1; q=sta|0; }
dp[idx][sta]=dp[idx+1][p]+dp[idx+1][q];
}
}
}
}
printf("%lld\n",dp[0][0]+dp[0][1]);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define yes {cout<<"Yes"<<endl;return 0;}
#define no {cout<<"No"<<endl;return 0;}
#define INF 2147483647
#define LINF 9223372036854775807
int main()
{
int i,j,n;
ll int dpt[61],dpf[61];
string x[61];
cin>>n;
for(i=1;i<=n;i++)cin>>x[i];
dpt[0]=1;
dpf[0]=1;
for(i=1;i<n+1;i++)
{
if(x[i]=="AND")
{
dpt[i]=dpt[i-1];
dpf[i]=dpt[i-1]+2*dpf[i-1];
}
else if(x[i]=="OR")
{
dpt[i]=dpt[i-1]*2+dpf[i-1];
dpf[i]=dpf[i-1];
}
}
cout<<dpt[n]<<endl;
} |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
typedef long long ll;
typedef unsigned long long int ull;
typedef long double ldb;
#define PB push_back
#define Fas ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
ll power(ll a,ll b){
int result=1;
while(b>0){
if(b%2 == 1){
result *= a;
}
a *= a;
b /= 2;
}
return result;
}
ll gcd(ll x,ll y){
ll r;
while(y!=0&&(r=x%y)!=0){
x=y;
y=r;
}
return y==0?x:y;
}
void solve(){
ll n;cin>>n;
// ll m=1000000007;
vector<string> v(n);
string A;
A="AND";
string O;
O="OR";
for(auto &w:v) cin>>w;
vector<pair<ll,ll>> sto(n);
sto[0].first=1;
sto[0].second=1;
for(ll i=1;i<n;i++){
if(v[i-1]==A){
sto[i].first=sto[i-1].first;
sto[i].second=sto[i-1].first+(2*sto[i-1].second);
}else{
sto[i].second=sto[i-1].second;
sto[i].first=(2*sto[i-1].first)+sto[i-1].second;
}
}
if(v[n-1]==A){
cout<<sto[n-1].first<<endl;
}else{
cout<<(2*sto[n-1].first)+sto[n-1].second<<endl;
}
}
int main(){
Fas;
// ll t{};
// cin>>t;
//
// while(t--){
solve();
// }
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//#define ll long long
//Functionn for sorting
int main()
{
unordered_map<long long int,long long int>mp;
long long int n;
cin>>n;
vector<long long int>a(n);
for(auto &x: a){
cin>>x;
mp[x]++;
}
long long int c=(n*(n-1))/2;
vector<long long int>freq;
for(auto &x:mp){
freq.push_back(x.second);
}
for(auto &x: freq){
c-=(x*(x-1))/2;
}
cout<<c;
} |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>
using namespace std;
//using namespace atcoder;
#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;
// edit
const int lim = 100000007;
ll v2l[lim]; // 重さがv以上の橋の内、最も短いもの
ll get_l(ll v) {
if (v < lim) return v2l[v];
else return v2l[lim - 1];
}
ll func(const vector<ll> &v) {
vector<ll> dist(v.size(), 0);
dist[0] = 0;
for (int i = 0; i < v.size(); ++i) {
ll sum = 0;
for (int j = i; j < v.size(); ++j) {
sum += v[j];
ll l = get_l(sum - 1);
chmax(dist[j], dist[i] + l);
}
}
return dist.back();
}
void solve() {
int n, m;
cin >> n >> m;
vector<ll> w(n);
REP(i, n) cin >> w[i];
vector<pair<ll, ll>> lv(m);
REP(i, m) {
cin >> lv[i].first >> lv[i].second;
chmax(v2l[lv[i].second], lv[i].first);
}
for (int i = 0; i + 1 < lim; ++i) {
chmax(v2l[i + 1], v2l[i]);
}
{
ll max_w = *max_element(ALL(w));
ll min_v = LINF;
REP(i, m) {
chmin(min_v, lv[i].second);
}
cerr << max_w << " " << min_v << endl;
if (max_w > min_v) {
cout << -1 << endl;
return;
}
}
ll ans = LINF;
sort(ALL(w));
do {
ll val = func(w);
chmin(ans, val);
} while (next_permutation(ALL(w)));
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
solve();
return 0;
}
| #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=100010; //check the limits, dummy
int a[11];
int n, m;
int mp[100000010], mp1[100000010], l[N], v[N];
int main(){
int t;
scanf("%d%d",&n,&m);
int mx1= 0;
for(int i=0; i<n; ++i){
scanf("%d",a+i);
mx1=max(mx1, a[i]);
}
int mx = 0;
bool bl =1;
for(int i=0; i<m; ++i){
scanf("%d%d",&l[i], &v[i]);
mp[v[i]]=max(mp[v[i]], l[i]);
mx=max(mx, v[i]);
if(mx1>v[i]){
bl=0;
}
}
if(!bl){
cout<<"-1"<<endl;
return 0;
}
int tmp = 0;
mp1[0]=0;
++mx;
for(int i=1; i<=mx; ++i){
mp1[i]=max(mp1[i-1], mp[i-1]);
}
sort(a, a+n);
int ans = 1e9;
int cnt = 0;
do{
++cnt;
int dis[10]={0};
for(int i=0; i<n; ++i){
tmp=a[i];
dis[i]=0;
for(int j=i-1; j>=0; --j){
tmp+=a[j];
tmp = min(tmp, mx);
dis[i]=max(dis[i], mp1[tmp]+dis[j]);
}
}
ans=min(ans, dis[n-1]);
}while(next_permutation(a, a+n));
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
#define nl "\n"
#define ll long long
#define vii(N,M,x) vector<vector<long long>> x(N,vector<long long>(M))
#define pb push_back
#define ii pair<int,int>
#define ft first
#define sd second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
const int INF=1e9+5;
const int MOD=1e9+7;
using namespace std;
void solve(/*int caseN*/)
{
int x,y; cin>>x>>y;
if(x==y)
{
cout<<x;
}
else
{
int ans=-1;
for(int i=0;i<3;i++)
{
if(i!=x && i!=y)
{
ans=i;
}
}
cout<<ans;
}
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//int T; cin>>T;
//while(T--)
solve(/*T*/);
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
vector<char> Alphabet = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
vector<char> alphabet = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int main()
{
cout << fixed << setprecision(10);
double n,b;
cin >> n >> b;
double s = n - b;
double x = s/n;
cout << x*100 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
const int INF = 1001001001;
int main(){
string s;
cin >> s;
int n = s.size();
vector<int> c(3);
for(int i = 0; i < n; i++){
c[(s[i] - '0')%3]++;
}
int x = 0;
for(int i = 0; i < 3; i++){
x += c[i]*i;
}
int ans = INF;
for(int i1 = 0; i1 < 3; i1++){
for(int i2 = 0; i2 < 3; i2++){
if(c[1] < i1) continue;
if(c[2] < i2) continue;
if(i1 + i2 == n) continue;
int nx = x;
nx -= i1*1;
nx -= i2*2;
if(nx%3 == 0) ans = min(ans, i1 + i2);
}
}
if(ans == INF){
ans = -1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cctype>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template<typename key, typename val>
//using ordered_tree =
// tree<key, val, std::less<>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
typedef long long int64;
typedef unsigned long long uint64;
typedef complex<double> comp;
const double pi = 3.14159265358979323846;
const int inf = (int)1e+9 + 2;
const int64 inf64 = (int64)1e+18 + 2;
const double dinf = 1e+20;
const int mod = /*1'000'000'007;//*/998244353;
const int base = 2187;
const double eps = 1e-9;
const int N = 500'000;
const int LOGN = 19;
int n, m, k;
void solve(int test) {
int64 n;
cin >> n;
int a[10] = {};
int s = 0, t = 0;
for (; n; n /= 10, ++t) {
++a[n % 10 % 3];
s += n % 10;
}
if (s % 3 == 0) {
cout << "0\n";
return;
}
if (s % 3 == 1) {
if (a[1] && t > 1) {
cout << "1\n";
return;
}
if (a[2] >= 2 && t > 2) {
cout << "2\n";
return;
}
cout << "-1\n";
return;
}
if (a[2] && t > 1) {
cout << "1\n";
return;
}
if (a[1] >= 2 && t > 2) {
cout << "2\n";
return;
}
cout << "-1\n";
}
void precalc() {
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
precalc();
int test = 1;
//cin >> test;
//auto start = chrono::high_resolution_clock::now();
for (int i = 1; i <= test; ++i) {
solve(i);
}
//cerr << chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - start).count() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n , m , t, i , j , k ;
cin >> n ;
ll a[n] ;
for(i=0;i<n;i++)
{
cin >> a[i] ;
}
map<ll, ll> mp ;
ll ct = 0 ;
for(i=0;i<n;i++)
{
ll temp = ((a[i])%200) ;
mp[temp]++ ;
}
for(auto it: mp)
{
if((it.second) >= 2)
{
ct+= ((it.second)*(it.second - 1))/2 ;
}
}
cout << ct ;
return 0 ;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = vector<vll>;
using vs = vector<string>;
using pii = pair<int, int>;
#define pb push_back
#define mp make_pair
#define YESNO(bool) if(bool){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(bool) if(bool){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(bool) if(bool){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define rep(i, n) reps(i, 0, n)
#define rrep(i, n) reps(i, 1, n + 1)
#define repd(i,n) for(ll i=n-1;i>=0;i--)
#define rrepd(i,n) for(ll i=n;i>=1;i--)
#define debug(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << "\033[m" <<endl;
#define kd(x) cerr << "\033[33m" << #x << ": " << x << ", \033[m";
#define kdl(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << ", \033[m";
#define kde(x) cerr << "\033[33m" << #x << ": " << x << ", \033[m" << endl;
inline int in_int() {int x; cin >> x; return x;}
inline ll in_ll() {ll x; cin >> x; return x;}
inline string in_str() {string x; cin >> x; return x;}
template <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}
template <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}
int main()
{
int n = in_int();
vll b(200, 0);
rep(i,n) b[in_int() % 200]++;
ll ans = 0;
rep(i,200) {
if (b[i]>=2) {
ans += b[i] * (b[i] - 1) / 2;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int bs(int a[],int n,int val)
{
if(a[0]>val) return -1;
if(a[n-1]<=val) return n-1;
int l=0;int u=n-2;
while(l<=u)
{
int mid=(l+u)/2;
if(a[mid]<=val && a[mid+1]>val)
return mid;
else if(a[mid]>val)
u=mid-1;
else l=mid+1;
}
}
int main() {
int n,m;
cin>>n>>m;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int p[n];
int nn[n];
nn[n-1]=-a[n-1];
p[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
{
p[i]=a[i]+nn[i+1];
nn[i]=-a[i]+p[i+1];
}
int pf[n];
int nnf[n];
nnf[0]=-a[0];
pf[0]=a[0];
for(int i=1;i<n;i++)
{
pf[i]=a[i]+nnf[i-1];
nnf[i]=-a[i]+pf[i-1];
}
int mini=INT_MAX;
for(int i=0;i<m;i++)
{
int val;cin>>val;
int x=bs(a,n,val);//x is last element less than , equal to val
//cout<<x<<endl;
int ans=INT_MAX;
if((x+1)%2==0)
{
int a=0,b=0;
if(x!=-1) a=pf[x];
if(x+1<n) b=p[x+1];
ans=a-val+b;
}
else
{
int a=0,b=0;
if(x!=-1) a=nnf[x];
if(x+1<n) b=nn[x+1];
ans=a+val+b;
}
mini=min(mini,ans);
}
cout<<mini<<endl;
return 0;
} | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 72 - dig >> 3;
return tmp;
}
const int MAX = 1000;
char C[MAX * 4];
const int dm = 1 << 17;
char* dn = cn, * di = dn, * owad = dn + dm - 20;
void putint(int A) {
if (owad < di) {
fwrite(dn, 1, di - dn, stdout);
di = dn;
}
if (A >= 1000) {
int dig = 1;
if (A >= 100000) dig = 3;
else if (A >= 10000) dig = 2;
memcpy(di, C + A / 1000 * 4 + 3 - dig, dig);
memcpy(di + dig, C + A % 1000 * 4, 4);
di += dig + 4;
}
else {
int dig = 1;
if (A >= 100) dig = 3;
else if (A >= 10) dig = 2;
memcpy(di, C + A * 4 + 3 - dig, dig + 1);
di += dig + 1;
}
}
int N, Q;
int D[200001], dmemo[200001];
int ne[200001], he[200001];
int ne2[200001], he2[200001];
int dcnt[200001];
int que[200001], q, d;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
N = getint();
for (int i = 2; i <= N; i++) {
int a = getint();
ne[i] = he[a];
he[a] = i;
}
Q = getint();
rep1(q, Q) {
int u = getint();
ne2[q] = he2[u];
he2[u] = q;
D[q] = getint();
}
que[q++] = 1;
while (q) {
int p = que[q - 1];
if (p > 0) {
que[q - 1] = -p;
for (int i = he2[p]; i; i = ne2[i]) {
dmemo[i] = dcnt[D[i]];
}
dcnt[d]++;
d++;
for (int i = he[p]; i; i = ne[i]) {
que[q++] = i;
}
}
else {
for (int i = he2[-p]; i; i = ne2[i]) {
dmemo[i] = dcnt[D[i]] - dmemo[i];
}
d--;
q--;
}
}
rep(i, MAX) {
int X = i;
rep(j, 3) {
C[i * 4 + 2 - j] = '0' + X % 10;
X /= 10;
}
C[i * 4 + 3] = ' ';
}
rep1(i, Q) putint(dmemo[i]);
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll OO = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const double pi = 3.14159265359;
//freopen("window.in", "r", stdin);
//freopen("output.out", "w", stdout);
void skrrrt() {
ios_base::sync_with_stdio(0), cin.tie(0);
}
//###############################Spaggetti############################
int n;
int a[22];
ll ans=1e15;
void solve(int ind,ll num){
if(ind==n){
ans=min(ans,num);
return ;
}
int orr=0;
for(int i=ind;i<n;i++){
orr|=a[i];
solve(i+1,orr^num);
}
}
int main(){
skrrrt();
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
solve(0,0);
cout<<ans;
}
| // In god we trust
#include <bits/stdc++.h>
#include <chrono>
#include <algorithm>
#include <signal.h>
#include <thread>
#include <pthread.h>
#include <omp.h>
#define pb push_back
#define fi first
#define se second
#define Vi vector<int>
#define Vb vector<bool>
#define Pi pair<int, int>
#define Si set<int>
#define Ui unordered_map<int, int>
#define MP make_pair
#define MT make_tuple
#define Q queue
#define Qi Q<int>
#define INF 1000000000
#define LINF 1000000000000000000
#define _USE_MATH_DEFINES
#define int long long
using namespace std;
using namespace std::chrono;
int mod_power(int x, int y, int mod){
int ans = 1;
x %= mod;
while(y){
if (y & 1)
ans *= x, ans %= mod;
y /= 2;
x = (x * x) % mod;
}
return ans;
}
int mod_inverse(int n, int mod){
return mod_power(n, mod - 2, mod);
}
// Returns factorial of n
int fact(int n)
{
int res = 1;
for (int i = 2; i <= n; i++)
res = res * i;
}
int ncr(int n, int r)
{
if (r > n)
return 0;
if (r == 0 or r == n)
return 1;
int fact = 1;
for (int i = 1; i <= r; i++)
fact *= i;
int ans = 1;
for (int i = n; i > n - r; i--)
ans *= i;
ans /= fact;
return ans;
}
int mod_ncr(int n, int r, int mod){
if (r > n)
return 0;
if (r == 0 or r == n)
return 1;
int fact = 1;
for (int i = 1; i <= r; i++)
fact *= i, fact %= mod;
int ans = 1;
for (int i = n; i > n - r; i--)
ans *= i, ans %= mod;
ans *= mod_inverse(fact, mod), ans %= mod;
return ans;
}
unordered_map<int, int> factor(int n){
int cnt = 0;
unordered_map<int, int> m;
int nn = n;
while (!(nn & 1))
cnt++, nn /= 2;
if(cnt)
m[2] = cnt;
for (int i = 3; i <= sqrt(n); i++){
cnt = 0;
while(nn % i == 0)
nn /= i, cnt++;
if (cnt)
m[i] = cnt;
}
if (nn > 2)
m[nn] = 1;
return m;
}
Vi divisors(int n){
Vi front;
Vi back;
for (int i = 1; i <= sqrt(n); i++){
if (n % i == 0)
if (i == n / i)
front.pb(i);
else
front.pb(i), back.pb(n / i);
}
for (int i = back.size() - 1; i >= 0 ; i--)
front.pb(back[i]);
return front;
}
int DCNT(int a){
int ans = 0;
while(a)
ans++, a/=10;
return ans;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int min_ = pow(2, 30) + 10;
for (int i = 0; i < pow(2, n - 1); i++){
int ii = i;
Vi v;
while(ii)
v.pb(ii % 2), ii /= 2;
int x = n - 1 - v.size();
for (int j = 0; j < x; j++)
v.pb(0);
int ans = 0;
int p = a[0];
for (int j = 0; j < n - 1; j++){
if (v[j])
ans ^= p, p = 0;
p |= a[j + 1];
}
ans ^= p;
min_ = min(min_, ans);
}
cout << min_ << endl;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <tuple>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p += p & -p;
}
}
E sum(int r) const {
E s = 0;
while (r > 0) {
s += data[r - 1];
r -= r & -r;
}
return s;
}
E sum(int l, int r) const {
return sum(r) - sum(l);
}
};
long long proc(
std::vector<int> &cur,
int x,
int y,
FenwickTree<int> &ftcnt0,
FenwickTree<long long> &ftsum0,
const FenwickTree<int> &ftcnt1,
const FenwickTree<long long> &ftsum1,
const std::vector<int> &arr)
{
int v = cur[x];
long long dem = (long long)ftcnt1.sum(0, v) * arr[v];
long long cre = (long long)ftcnt1.sum(0, y) * arr[y];
long long adj = (long long)ftsum1.sum(y, v);
ftsum0.add(v, -arr[v]);
ftcnt0.add(v, -1);
cur[x] = y;
ftsum0.add(y, arr[y]);
ftcnt0.add(y, 1);
return cre + adj - dem;
}
int main(int argc, char **argv)
{
int n, m, q;
std::cin >> n >> m >> q;
std::vector<std::tuple<int, int, int>> txy;
std::set<int> s = { 0 };
for (int i = 0; i < q; i++) {
int t, x, y;
std::cin >> t >> x >> y;
txy.push_back(std::make_tuple(t, x - 1, y));
s.insert(y);
}
std::vector<int> arr(s.begin(), s.end());
std::map<int, int> map;
int ll = s.size();
for (int i = 0; i < ll; i++) map.emplace(arr[i], i);
FenwickTree<long long> ftsuma(ll);
FenwickTree<long long> ftsumb(ll);
FenwickTree<int> ftcnta(ll);
FenwickTree<int> ftcntb(ll);
std::vector<int> cura(n);
std::vector<int> curb(m);
ftcnta.add(0, n);
ftcntb.add(0, m);
long long sum = 0;
for (const auto&e : txy) {
int cy = map[std::get<2>(e)];
sum += (std::get<0>(e) == 1) ? proc(cura, std::get<1>(e), cy, ftcnta, ftsuma, ftcntb, ftsumb, arr)
: proc(curb, std::get<1>(e), cy, ftcntb, ftsumb, ftcnta, ftsuma, arr);
std::cout << sum << std::endl;
}
return 0;
} | /***************************************************************
File name: HaHa
Author: ljfcnyali
***************************************************************/
#include<bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for ( int i = (a), _end_ = (b); i <= _end_; ++ i )
#define mem(a) memset ( (a), 0, sizeof ( a ) )
#define str(a) strlen ( a )
#define pii pair<int, int>
#define int long long
typedef long long LL;
const int maxn = 1e5 + 10;
const int INF = 1e18;
int K, n, m, a[maxn], b[maxn];
pii p[maxn];
inline bool Check(int x)
{
int sum = 0;
REP(i, 1, K)
{
int r = x + a[i] * m, l = a[i] * m - x;
l = max(l, 0ll);
p[i] = pii((l + n - 1) / n, r / n);
p[i].first = max(p[i].first , 0ll);
if ( p[i].first > p[i].second ) return false;
sum += p[i].first; b[i] = p[i].first;
}
if ( sum > m ) return false;
int i = K;
while ( sum <= m && i >= 1 )
{
int val = min(p[i].second - p[i].first, m - sum);
sum += val; b[i] += val;
if ( sum == m ) return true;
-- i;
}
return false;
}
signed main()
{
scanf("%lld%lld%lld", &K, &n, &m);
REP(i, 1, K) scanf("%lld", &a[i]);
int L = 0, R = INF, ans;
while ( L <= R )
{
int Mid = L + R >> 1;
if ( Check(Mid) ) { ans = Mid; R = Mid - 1; }
else L = Mid + 1;
}
Check(ans);
REP(i, 1, K) printf("%lld ", b[i]); puts("");
return 0;
}
|
#include <bits/stdc++.h>
#define endl '\n'
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef pair<int,int>pii;
int n;
int c[510][510];
int sumr[510],sumc[510];
int a[510],b[510];
bool check(){
for(int i=1;i<=n;i++)if(a[i]<0)return 0;
for(int i=1;i<=n;i++)if(b[i]<0)return 0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
if(c[i][j]!=a[i]+b[j])return 0;
}
return 1;
}
signed main(){
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
cin>>c[i][j];
sumr[i]+=c[i][j];
sumc[j]+=c[i][j];
}
int mn1=INF,mn2=INF;
for(int i=1;i<=n;i++)mn1=min(mn1,c[i][1]);
for(int i=1;i<=n;i++)mn2=min(mn2,c[1][i]);
for(int i=1;i<=n;i++)a[i]=c[i][1]-mn1;
for(int i=1;i<=n;i++)b[i]=c[1][i]-mn2;
int ex=c[1][1]-a[1]-b[1];
// cout<<ex<<endl;
// for(int i=1;i<=n;i++)cout<<a[i]<<' ';
// puts("");
// for(int i=1;i<=n;i++)cout<<b[i]<<' ';
// puts("");
if(ex<0){
puts("No");
return 0;
}
for(int i=1;i<=n;i++)b[i]+=ex;
if(!check()){
puts("No");
return 0;
}
puts("Yes");
for(int i=1;i<=n;i++)cout<<a[i]<<' ';
puts("");
for(int i=1;i<=n;i++)cout<<b[i]<<' ';
puts("");
return 0;
}
/*
a1+b1 a1+b2 a1+b3
a2+b1 a2+b2 a2+b3
a3+b1 a3+b2 a3+b3
sumall=3*(a1+a2+a3+b1+b2+b3)
sumr1=12=3*a1+b1+b2+b3
sumr2=6=3*a2+b1+b2+b3
sumr3=9=3*a3+b1+b2+b3
sumc1=3*b1+a1+a2+a3
a2-a1=(sumr2-sumr1)/3
a3-a2=(sumr3-sumr2)/3
2 0 1
1 0 2
*/
| #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j,k
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(),a.end())
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
/*繰り上げ除算*/ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
/*最大公約数*/ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
/*最小公倍数*/ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
/*n乗*/ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
/*階乗*/ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
/*nCr*/ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
/*nPr*/ll npr(ll n,ll r){return fact(n)/fact(n-r);}
/*primejudge*/bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll ans=0;llfor;///////////////////////////////////////////////////////////
int digit(int n){
if(n < 10) return n;
return digit(n/10) + n%10;
}
int GetDigit(ll num){
return std::to_string(num).length();
}
int main(){
int N;
cin>>N;
vector<vector<int>> data(N, vector<int>(N));
for (int j = 0; j < N; j++) {
cin >> data.at(0).at(j);
}
vector<int> V(N);
for(int i=0;i<N-1;i++){
V[i]=data.at(0).at(i+1)-data.at(0).at(i);
}
bool flag=false;
for (int i = 1; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> data.at(i).at(j);
if(j!=0 && data.at(i).at(j-1)+V[j-1]!=data.at(i).at(j)) flag=true;
}
}
if(flag) cout<<"No"<<endl;
else{
vector<int> V(N);
int M=1000000007;
for(int i=0;i<N;i++){
V[i]=data.at(i).at(0)-data.at(0).at(0);
M=min(M,V[i]);
}
for(int i=0;i<N;i++){
V[i]-=min(M,0);
}
flag=false;
for(int i=0;i<N;i++){
data.at(0).at(i)+=min(M,0);
if(data.at(0).at(i)<0) flag=true;
}
if(flag) cout<<"No"<<endl;
else{
cout<<"Yes"<<endl;
for(int i=0;i<N;i++){
cout<<V[i]<<" ";
}
cout<<endl;
for(int i=0;i<N;i++){
cout<<data.at(0).at(i)<<" ";
}
}
}
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)
template<unsigned MOD_> struct ModInt {
static constexpr unsigned MOD = MOD_;
unsigned x;
void undef() { x = (unsigned)-1; }
bool isnan() const { return x == (unsigned)-1; }
inline int geti() const { return (int)x; }
ModInt() { x = 0; }
ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
ModInt operator-() const { return (x ? MOD-x: 0); }
ModInt inv() const { return pow(MOD-2); }
ModInt pow(long long y) const {
ModInt b = *this, r = 1;
if (y < 0) { b = b.inv(); y = -y; }
for (; y; y>>=1) {
if (y&1) r *= b;
b *= b;
}
return r;
}
friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};
constexpr LL MOD = 1000000007;
using Mint = ModInt<MOD>;
int N;
int A[100011];
void MAIN() {
scanf("%d", &N);
REP (i, N) scanf("%d", A+i);
sort(A, A+N);
Mint ans = 1;
int prv = 0;
REP (i, N) {
ans *= A[i] - prv + 1;
prv = A[i];
}
printf("%d\n", ans.geti());
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repab(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repr(i, n) for (ll i = (ll)(n); i >= 0; i--)
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.rbegin(), v.rend())
//定数
#define INF32 2147483647 // 2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 // 9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007 //問題による
int main() {
ll a, b;
cin >> a >> b;
ll ans = 0;
if (a + b >= 15 && b >= 8) {
ans = 1;
} else if (a + b >= 10 && b >= 3) {
ans = 2;
} else if (a + b >= 3) {
ans = 3;
} else {
ans = 4;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vint> vvint;
typedef pair<ll, ll> iPair;
#define ff first
#define ss second
static ll n;
static vector<iPair> arr;
int main(){
cin >> n;
arr.resize(n);
for(int i = 0; i < n; i++)
cin >> arr[i].ff >> arr[i].ss;
bool res = false;
for(int i = 0; i < n && !res; i++){
for(int j = i+1; j < n && !res; j++){
for(int k = j+1; k < n && !res; k++){
if((arr[i].ff == arr[j].ff) && arr[i].ff == arr[k].ff){
res = true;
}
else if((arr[i].ss == arr[j].ss) && arr[i].ss == arr[k].ss){
res = true;
}
else if((arr[i].ff - arr[j].ff)*(arr[i].ss - arr[k].ss) == (arr[i].ff - arr[k].ff)*(arr[i].ss - arr[j].ss))
res = true;
}
}
}
if(res)
cout << "Yes";
else
{
cout << "No";
}
return 0;
}
| #include<bits/stdc++.h>
#define lint long long int
#define rep(i,n) for(int i=0;i<int(n);i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.begin(),a.end())
#define fill(a,x) fill(a.begin(),a.end(),x)
#define eb(data) emplace_back(data)
#define pb(data) emplace_back(data)
#define mp make_pair
#define ALNUM 26
#define vint vector<int>
#define vlint vector<lint>
#define F first
#define S second
#define ALL(data) data.begin(),data.end()
#define GEts(s) getline(cin,s);
#define UNIQUE(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
template<typename Rast>inline void out(Rast rast){cout<<rast<<"\n";return;}
template<typename Rast>inline void in(Rast& rast){cin>>rast;return;}
template<typename T>istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}
template<typename First, typename... Rest>void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
template<typename First, typename... Rest>void out(First first, Rest... rest){cout << first<<" ";out(rest...);return;}
template<typename T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<typename T>T lcm(T a,T b){return a * b / gcd(a, b);}
template<typename T1,typename T2>bool chmax(T1& a,T2 b){if(a<b){a=b;return true;}else{return false;}}
template<typename T1,typename T2>bool chmin(T1& a,T2 b){if(a>b){a=b;return true;}else{return false;}}
static const double pi = 3.141592653589793;
int modpow(int a,int n,int p){if (n==0)return 1%p; if(n==1)return a%p;if(n%2==1)return (a*modpow(a,n-1,p))%p;lint t=modpow(a,n/2,p);return (t*t)%p;}//a^n%p
lint MOD=1e9+7;
//lint MOD=998244353;
lint inf=pow(2,50);
int intinf=pow(2,30);
/**int dirx[]={1,0};int diry[]={0,1};//*///右、下
/**int dirx[]={0,1,0,-1};int diry[]={-1,0,1,0};//*///四方位
/**int dirx[]={-1,0,1,1,1,0,-1,-1};int diry[]={-1,-1,-1,0,1,1,1,0};//*///八方位
class unionfind{
public:
vector<int> table;
void init(int size){
table.resize(size);
rep(i,size)table[i]=i;
};
int root(int index){
if(table[index]==index)return index;
else{
int hoge=root(table[index]);
table[index]=hoge;
return hoge;
}
};
bool same(int x,int y){
return(root(x)==root(y));
};
int marge(int x,int y){
int yroot=root(y);
int xroot=root(x);
if(xroot==yroot)return 0;
table[yroot]=xroot;
return 0;
}
int getsize(){
set<int> ma;
rep(i,table.size())ma.insert(root(i));
int re=ma.size();
return re;
}
};
lint culc(lint a,lint b){
return((a+b-1)/b);
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);cout<<std::fixed<<std::setprecision(16);
lint n,t;
int m;
in(n,m,t);
vlint a(m),b(m);
rep(i,m)in(a[i],b[i]);
bool flg=true;
lint now=n;
rep(i,m){
if(i==0)now=now-a[i];
else now=now-(a[i]-b[i-1]);
//cout<<i<<" "<<now;
if(now<=0)flg=false;
now=now+(b[i]-a[i]);
now=min(n,now);
//out("",now);
}
if(now-(t-b[m-1])<=0)flg=false;
if(flg)out("Yes");
else out("No");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl '\n'
const int mxN=30001,M=1e9+7;
int main() {
int n,k;
cin>>n>>k;
vector<int>v;
for(int i=1;i <=n;i ++){
int x;cin>>x;
if(x!=k)v.push_back(x);
}
for(int a: v)cout<<a<<" ";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n,q;
cin>>n>>q;
long long int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
long long int b[n]={0};
b[0]=a[0]-1;
for(int i=1;i<n;i++){
b[i]=a[i]-a[i-1]-1;
}
for(int i=1;i<n;i++){
b[i]=b[i]+b[i-1];
}
long long int k;
for(int i=0;i<q;i++){
cin>>k;
int p=lower_bound(b,b+n,k)-b;
if(p==0){
cout<<k;
}
else{
cout<<a[p-1]+(k-b[p-1]);
}
cout<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#define rnfor(i,a,b) for(ll (i) = (b) - 1; (i) >= (a); --(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
#define yes pf("Yes")
#define no pf("No")
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int dx[8]={1,0,-1,0,1,1,-1,-1};
const int dy[8]={0,1,0,-1,1,-1,1,-1};
int multipf(vector<string>& s){
cout << s[0];
rep1(i, s.size() - 1)cout << " " << s[i];
cout << endl;
return 0;
}
int multipf(vector<ll>& n){
cout << n[0];
rep1(i, n.size() - 1)cout << " " << n[i];
cout << endl;
return 0;
}
ll gcd(ll a,ll b){
if(a < b)swap(a, b);
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
ll factorial(ll n){
ll ans = 1;
rep1(i, n){
ans *= i;
ans %= mod;
}
return ans;
}
ll power(ll a, ll b){
ll ans = 1;
while(b) {
if(b & 1LL) ans = ans * a % mod;
ans %= mod;
a = a * a;
a %= mod;
b >>= 1;
}
return ans % mod;
}
string solve(string s){
string t = "";
rep0(i, s.size()){
if(s[i] == s[i + 1]){
t.push_back(s[i]);
}else if(s[i] + s[i + 1] == 163){
t.push_back('S');
}else if(s[i] + s[i + 1] == 165){
t.push_back('R');
}else t.push_back('P');
++i;
}
s = t;
return s;
}
//modの値の確認をすること
int main(){
ll n,k;
string s;
cin >> n >> k >> s;
rep0(i, k)s = solve(s + s);
pf(s[0]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
int main(){
int N;
cin >> N;
vector<vector<string>> S(9,vector<string> (256));
S[1][1] = "AB";
int k = 1;
rep(i,N-1){
rep(j,k){
S[i+2][j+1] = S[i+1][j+1] + S[i+1][j+1];
}
rep(j,k){
string T,R;
T = S[i+1][j+1];
rep(l,T.size()){
if(T.at(l)=='A') R = R+"B";
else R = R+"A";
}
S[i+2][k+j+1] = T + R;
}
rep(j,k+1){
S[i+2][2*k+1] = S[i+2][2*k+1] + "A";
}
rep(j,k+1){
S[i+2][2*k+1] = S[i+2][2*k+1] + "B";
}
k= 2*k+1;
}
cout << k << endl;
rep(i,k){
cout << S[N][i+1] << endl;
}
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include <math.h>
#include<climits>
using namespace std;
#define int long long
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define pii pair<int,int>
#define ff first
#define ss second
#define print(x) cout<<x<<"\n"
#define printt(x,y) cout<<x<<" "<<y<<"\n"
#define printtt(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define pb push_back
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define all(v) v.begin(),v.end()
#define vvi vector<vector<int>>
#define maxq priority_queue<int>
#define minq priority_queue<int,vector<int>,greater<int>>
#define mod 1000000007
#define N 200009
void solve() {
int n;
cin >> n;
if (n < 10) {
cout << "Yes" << endl; return;
}
vi v;
while (n > 0) {
v.pb(n % 10);
n = n / 10;
}
int z = v.size();
int ok = 1;
for (int i = 0; i < z / 2; i++) {
//print(v[i]);
if (v[i] != v[z - i - 1])
ok = 0;
}
if (ok == 1) {
cout << "Yes" << endl;
return;
}
int c = 0;
for (int i = 0; i < z; i++)
if (v[i] != 0)
break;
else
c++;
//print(c);
reverse(all(v));
int i = 0, j = z - 1 - c;
ok = 1;
//printt(i, j);
while (i < j) {
//printt(v[i], v[j]);
if (v[i] != v[j])
ok = 0;
i++, j--;
}
if (ok == 0)
cout << "No";
else
cout << "Yes";
}
int32_t 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 t = 1;
//cin>>t;
while (t--) {
solve();
}
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll ans=-1;
void Exgcd(ll A,ll B,ll &x,ll &y,ll &d)
{
if(B==0)
{
x=1;y=0;d=A;
return;
}
Exgcd(B,A%B,x,y,d);
ll tmp=y;
y=x-(A/B)*y;
x=tmp;
}
void Solve(ll A,ll B,ll C,ll a,ll b)
{
ll x,y,d;
Exgcd(A,B,x,y,d);
if(C%d!=0)return;
x*=C/d;
x=(x%(B/d)+(B/d))%(B/d);
if(ans==-1)ans=A*x+a;
else ans=min(ans,A*x+a);
}
int main()
{
int T;
cin>>T;
while(T--)
{
ans=-1;
ll X,Y,P,Q,A,B;
cin>>X>>Y>>P>>Q;
A=2ll*X+2ll*Y;
B=P+Q;
for(ll a=X;a<X+Y;a++)
for(ll b=P;b<P+Q;b++)Solve(A,B,b-a,a,b);
if(ans==-1)puts("infinity");
else cout<<ans<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define lli long long
#define test int t;cin>>t;while(t--)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define mod 1000000007
using namespace std;
void solve()
{
double n , x , y , ans;
cin >> n >> x >> y;
lli dist = ceil(sqrt(x * x + y * y));
if(dist == n)
{
ans = 1;
}
else
{
if(dist <= 2*n)
{
ans = 2;
}
else
{
ans = ceil(dist / (double)n);
}
}
cout << ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w" , stdout);
#endif
fast_io;
//test
{
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
using P=pair<int,int>;
using T=tuple<LL,int,int,int>;
constexpr LL mod=1000000007;
constexpr LL inf=1e9;
constexpr double eps=1e-13;
constexpr double pi=3.141592653589;
int in(){
int x;
scanf("%d",&x);
return x;
}
int main(){
LL r=in(),x=in(),y=in();
LL d=x*x+y*y,L=0,R=inf/r;
if(r*r>d){
cout<<2<<endl;
return 0;
}
while(R-L>1){
LL mid=(L+R)/2;
if((r*mid)*(r*mid)>=d)R=mid;
else L=mid;
}
cout<<R<<endl;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<int, int, int> T;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
//const ll mod = 1e9 + 7;
const ll mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1);
int r1, c1, r2, c2;
int solve() {
if (r1 == r2 && c1 == c2) return 0;
if (r1+c1 == r2+c2 ||
r1-c1 == r2-c2 ||
abs(r1-r2)+abs(c1-c2) <= 3) {
return 1;
}
if ((r1+c1)%2 == (r2+c2)%2) return 2;
for (int i = -4; i <= 4; i++) {
for (int j = -4; j <= 4; j++) {
if (abs(i)+abs(j)<=3) {
int r3 = r2+i;
int c3 = c2+j;
if (r1+c1 == r3+c3 ||
r1-c1 == r3-c3 ||
abs(r1-r3)+abs(c1-c3) <= 3) {
return 2;
}
}
}
}
return 3;
}
void input() {
cin >> r1 >> c1 >> r2 >> c2;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
}
| /*
Bismillahi-r-Rahmani-r-Rahim
RhIeyAaD
IIT-7th Batch,JU
*/
#include<bits/stdc++.h>
using namespace std;
#define debug(args...){ string _s = #args;replace(_s.begin(),_s.end(),',', ' ');stringstream _ss(_s);istream_iterator<string>_it(_ss);err(_it, args);} cout<<endl;
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {cerr << *it << "=" << a << ", "; err(++it, args...);}
#define ll long long int
#define MAX 2134567891
#define pf(a) printf("%lld", a)
#define sf(a) scanf("%lld", &a)
#define sf2(a,b) scanf("%lld %lld", &a, &b)
#define fr(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(i=1;i<=n;i++)
#define rev(i,a,n) for(i=n;i>=a;i--)
#define FOR(i,a,n) for(i=a;i<=n;i++)
#define ALL(n) n.begin(),n.end()
#define mem(x,n) memset(x,n,sizeof(x))
#define TC(t) printf("Case %lld: ",t)
#define ans(t,c) printf("Case %lld: %lld\n",t,c)
#define SETP(n) cout<<setprecision(n)<<fixed
#define READ freopen("F:\\Project\\Test_Case.txt","r",stdin)
#define WRITE freopen("F:\\Project\\Output_Test.txt","w",stdout)
#define IO ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
#define PAIR pair<ll,ll>
#define MP make_pair
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define NL printf("\n");
#define bug(a) cout<<#a<<" "<<a<<" ";
#define hlw printf("hlw\n");
#define NN 111
#define MOD 1000000007///10^9
#define N 1000007 ///10^6->6 zero after 1 **
ll x[N],y[N],z[N],n;
string s,S;
vector<ll>v;
//bitset<N>B;
//map <ll,ll> mp;
ll fun(ll in,ll cur,ll tot)
{
if(in==n)return cur^tot;
return min(fun(in+1,cur|x[in],tot), fun(in+1,x[in],cur^tot));
}
int main()
{
//IO;
//while(1)
//READ;WRITE;
{
ll a=0,b=0,c=0,d,e,f,g,i,j,k,l,m,p,q,r,u,w,t,tc=1,in,loc,val,sz,lo,hi,mid,mn=MAX,mx=0,sum=0,ans=0;
//cin>>tc;
rep(t,tc)
{
cin>>n;
fr(i,n)cin>>x[i];
cout<<fun(0,0,0)<<endl;
}
}
return 0;
}
/*
*/
/// Check for constraint 0 or 1?
/// Division MOD needs BigMod(a,n-2)
/// long long or double? sqrt or division will work fine??
/// sort(begin(v), end(v), [] (int a, int b) { return a > b; }); /// Lambda Function for manual Sort
|
#include <bits/stdc++.h>
using namespace std;
class DSU {
private:
vector<int> rank, parent;
vector<unordered_map<int, int>> freq;
public:
DSU(vector<int> &init) {
int sz = init.size();
rank = vector<int>(sz, 0);
parent = vector<int>(sz, 0);
iota(parent.begin(), parent.end(), 0);
freq = vector<unordered_map<int, int>>(sz);
for (int i = 0; i < sz; ++i) {
freq[i][init[i]] = 1;
}
}
int Find(int x) {
if (parent[x] != x) {
parent[x] = Find(parent[x]);
}
return parent[x];
}
bool Union(int x, int y) {
int rootX = Find(x), rootY = Find(y);
if (rootX == rootY) {
return false;
}
if (rank[rootX] == rank[rootY]) {
++rank[rootX];
}
if (rank[rootX] < rank[rootY]) {
swap(x, y);
swap(rootX, rootY);
}
// rootX has higher rank
parent[rootY] = rootX;
for (pair<int, int> class_freq : freq[rootY]) {
freq[rootX][class_freq.first] += class_freq.second;
}
return true;
}
int GetCount(int x, int c) {
int root = Find(x);
return freq[root][c];
}
};
int32_t main() {
int N, Q;
cin >> N >> Q;
vector<int> C(N);
for (int i = 0; i < N; ++i)
cin >> C[i];
DSU dsu(C);
for (int q = 0; q < Q; ++q) {
int t;
cin >> t;
if (t == 1) {
int a, b;
cin >> a >> b;
dsu.Union(a - 1, b - 1);
} else {
int x, y;
cin >> x >> y;
cout << dsu.GetCount(x - 1, y) << '\n';
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=2e5+1;
struct BIT{
ll bit[200004];
int dat[200004];
void init(){
for(int i=0;i<=M;i++)bit[i]=dat[i]=0;
}
void add(int id,int a,int b){
for(;id;id-=(id&-id))dat[id]+=a,bit[id]+=b;
}
ll got1(int id){
ll res=0;
for(;id<=M;id+=(id&-id))res+=bit[id];
return res;
}
int got2(int id){
int res=0;
for(;id<=M;id+=(id&-id))res+=dat[id];
return res;
}
}X,Y;
vector<int>all;
int n,m,Q;
ll ans=0;
int a[200005],b[200004];
int x[200004],y[200004],t[200004];
ll gotx(int t){
return Y.got1(t)+(ll)(m-Y.got2(t))*all[t];
}
ll goty(int t){
return X.got1(t)+(ll)(n-X.got2(t))*all[t];
}
int main(){
X.init(),Y.init();
cin>>n>>m>>Q;
all.push_back(0);
for(int i=1;i<=Q;i++){
cin>>t[i]>>x[i]>>y[i],all.push_back(y[i]);
}
all.push_back(-1);
sort(all.begin(),all.end()),all.erase(unique(all.begin(),all.end()),all.end());
for(int i=1;i<=n;i++)a[i]=1,X.add(1,1,0);
for(int i=1;i<=m;i++)b[i]=1,Y.add(1,1,0);
for(int i=1;i<=Q;i++){
y[i]=lower_bound(all.begin(),all.end(),y[i])-all.begin();
if(t[i]==1){
ans-=gotx(a[x[i]]);X.add(a[x[i]],-1,-all[a[x[i]]]);
a[x[i]]=y[i];
ans+=gotx(a[x[i]]);X.add(a[x[i]],1,all[a[x[i]]]);
}else{
ans-=goty(b[x[i]]);Y.add(b[x[i]],-1,-all[b[x[i]]]);
b[x[i]]=y[i];
ans+=goty(b[x[i]]);Y.add(b[x[i]],1,all[b[x[i]]]);
}
cout<<ans<<"\n";
}
} |
//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const long double pi = 4 * atan(1);
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) \
{ \
cout << x << ' '; \
} \
cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
for (T &x : v)
is >> x;
return is;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//g++ yarudake.cpp -std=c++17 -I .
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
//素数判定(O(√n))
bool is_prime(int n)
{
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
return false;
}
return n != 1;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> x(n);
cin >> x;
vector<ll> y;
for (int i = 2; i <= 50; i++)
{
if (is_prime(i))
y.push_back(i);
}
ll ans = LINF;
//cout << y.size() << "\n";
rep(i, (1 << y.size()))
{
ll sum = 1;
rep(j, y.size())
{
if ((1 << j) & i)
{
sum *= y[j];
}
}
bool check = false;
rep(j, n)
{
if (gcd(sum, x[j]) == 1)
{
check = true;
}
}
if (!check)
chmin(ans, sum);
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
//const ll mod = 998244353;
//const ll maxn = 1000000000;
//---------------------------------------------------------------------------------------------------
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vll = vector<ll>; // long longの1次元の型に vll という別名をつける
using vvll = vector<vll>; // long longの2次元の型に vvll という別名をつける
using vs = vector<string>; // stringの1次元の型に vs という別名をつける
using pll = pair<ll, ll>; // これ以降 pll という型名はpair<ll, ll> と同じ意味で使える
//---------------------------------------------------------------------------------------------------
int main() {
ll ans=0;
int h,w;
cin>>h>>w;
vi dx={-1,0,1,0};
vi dy={0,-1,0,1};
vvll a(h,vll(w));
rep(i,h)rep(j,w){
char s;
cin>>s;
if(s=='.')a.at(i).at(j)=0;
else a.at(i).at(j)=1;
}
rep(i,h)rep(j,w){
if(a.at(i).at(j)==1)continue;
else{
int nh,nw;
rep(k,4){
nh=i+dx.at(k);
nw=j+dy.at(k);
if(nh<0||nh>=h||nw<0||nw>=w)continue;
else{
if(a.at(nh).at(nw)==0)ans++;
}
}
a.at(i).at(j)=1;
}
}
cout<<ans<<endl;
//rep(i,h)rep(j,w)cout<<a.at(i).at(j);
}
|
#include<cstdio>
#ifdef WIN64
#define LL "%I64d"
#elif WIN32
#define LL "%I64d"
#else
#define LL "%lld"
#endif
const int mo=998244353;
long long a,b,c;
long long sigma(long long a)
{
if(a%2==0)
return (a/2)*(a+1)%mo;
else
return a*((a+1)/2)%mo;
}
int main()
{
scanf(LL LL LL,&a,&b,&c);
long long ans=sigma(c)%mo*sigma(b)%mo*sigma(a)%mo;
printf(LL,ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int X,Y,Z; cin >> X >> Y >> Z;
double t = (double)Y/X;
for (int i =1000000; i>=0; i--) {
if (t > (double)i/Z) {
cout << i << endl; break; } }
return 0;
} |
#include<cstdio>
int n;
int gao(int x)
{
for (int j=10;j>=0&&x>n;--j)
if (x&(1<<j)) x^=1<<j;
return x?x:1;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i) printf("%d %d\n",gao(i<<1),gao(i<<1|1));
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
/* constant */
/* typedef */
/* global variables */
/* subroutines */
/* main */
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int j0 = i * 2, j1 = i * 2 + 1;
printf("%d %d\n", j0 % n + 1, j1 % n + 1);
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,a[20][20],ok[300000],dp[300000];
int main()
{
cin>>n>>m;
int x,y;
rep(i,m)
{
scanf("%d%d",&x,&y);
--x;
--y;
a[x][y]=a[y][x]=1;
}
rep(i,1<<n)
{
bool b=true;
rep(j,n)
{
for(int k=j+1;k<n;k++)
{
if((i&(1<<j))==0||(i&(1<<k))==0) continue;
if(a[j][k]==0)
{
b=false;
break;
}
}
if(!b) break;
}
ok[i]=(int)b;
}
rep(i,(1<<n)+5) dp[i]=1e9;
dp[0]=0;
rep(i,1<<n)
{
if(dp[i]==1e9) continue;
int lft=(1<<n)-1-i;
for(int sub=lft;sub>0;sub=(sub-1)&lft) if(ok[sub]==1) dp[i|sub]=min(dp[i|sub],dp[i]+1);
}
cout<<dp[(1<<n)-1]<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deque>
#include <functional>
#include <numeric>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define debugA cerr << "AAAAA" << endl
#define debug_ cerr << "-------------" << endl
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
cout << v[i] << " "; \
} \
cout << endl;
#define debug_vec2(v) \
cout << #v << endl; \
for (int i = 0; i < v.size(); i++) \
{ \
for (int j = 0; j < v[i].size(); j++) \
{ \
cout << v[i][j] << " "; \
} \
cout << endl; \
}
template <typename T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T>
void quit(T a)
{
cout << a << endl;
exit(0);
}
using Graph = vector<vector<int> >;
using P = pair<int, int>;
using P1 = pair<int, pair<int, int> >; // クラスカル法とかで、{cost, {from,
// to}}的に使う。
const ll LINF = 10010020030040056ll;
const int INF = 1001001001;
const double pi = acos(-1);
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll n, m;
cin >> n >> m;
if(n == 1){
if(m == 0){
cout << 1 << " " << 2 << endl;
return 0;
}
else{
cout << -1 << endl;
return 0;
}
}
if(abs(m) >= n-1){
cout << "-1" << endl;
return 0;
}
if(m == 0){
ll tmp = 1;
for(int i=0;i<n;i++){
cout << tmp << " ";
tmp++;
cout << tmp << endl;
tmp++;
}
return 0;
}
if(m > 0){
ll tmp = 0;
for(int i=0;i<m+1;i++){
cout << n-m+2*i << " " << n-m+2*i+1 << endl;
tmp = n-m+2*i+1;
}
for(int i=0;i<n-m-1;i++){
tmp++;
cout << n-m-1-i << " " << tmp << endl;
}
}
else{
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 組合せを素数で割った値
const int MAX = 510000;
const ll MOD = 1e9 + 7;
ll fac[MAX], finv[MAX], inv[MAX];
// 前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int r) {
if (n < r || n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
// 繰り返し自乗法(x^nをmで割った余り) O(logn)
ll power(ll x, ll n, ll m) {
ll res = 1;
if (n > 0) {
res = power(x, n / 2, m);
if (n % 2 == 0) res = (res * res) % m;
else res = ((res * res % m) * x) % m;
}
return res;
}
// A*B(行列の掛け算, 各項はmで割った余り)
vector<vector<ll>> mul(const vector<vector<ll>> &A, const vector<vector<ll>> &B, ll m) {
vector<vector<ll>> C(A.size(), vector<ll>(B[0].size(), 0));
for (int i = 0; i < A.size(); i++) {
for (int k = 0; k < B.size(); k++) {
for (int j = 0; j < B[0].size(); j++) {
C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % m;
}
}
}
return C;
}
// A^n(行列累乗, 各項はmで割った余り)
vector<vector<ll>> power_M(vector<vector<ll>> A, ll n, ll m) {
vector<vector<ll>> B(A.size(), vector<ll>(A.size(), 0));
for (int i = 0; i < A.size(); i++) B[i][i] = 1;
while (n > 0) {
if (n & 1) B = mul(B, A, m);
A = mul(A, A, m);
n >>= 1;
}
return B;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll n, m, kk;
cin >> n >> m >> kk;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
vector<ll> x(m), y(m);
for (int i = 0; i < m; i++) {
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
}
ll inv_2 = power(2, MOD - 2, MOD);
vector<vector<ll>> M(n, vector<ll>(n, 0));
for (int k = 0; k < m; k++) {
M[x[k]][y[k]] += inv_2;
M[x[k]][y[k]] %= MOD;
M[x[k]][x[k]] += inv_2;
M[x[k]][x[k]] %= MOD;
M[y[k]][x[k]] += inv_2;
M[y[k]][x[k]] %= MOD;
M[y[k]][y[k]] += inv_2;
M[y[k]][y[k]] %= MOD;
for (int i = 0; i < n; i++) {
if (i == x[k] || i == y[k]) continue;
M[i][i] += 1;
M[i][i] %= MOD;
}
}
vector<vector<ll>> M2 = power_M(M, kk, MOD);
ll keep = power(power(m, kk, MOD), MOD - 2, MOD);
vector<ll> ans(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
// cout << M2[i][j] << " ";
ans[i] += M2[i][j] * a[j] % MOD;
ans[i] %= MOD;
}
// cout << endl;
cout << (ans[i] * keep) % MOD << '\n';
}
} | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long LL;
typedef pair<int,int> PI;
typedef vector<int> VI;
typedef vector<PI> VPI;
template<class T> bool tmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool tmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
#define PB(x) push_back(x)
#define MP(x,y) make_pair(x,y)
#define F first
#define S second
#define SZ(x) (int)(x).size()
#define FOR(i,a,b) for(int _n(b),i(a);i<_n;i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define TRAV(a,x) for (auto& a : x)
void setIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
const int mod = 998244353;
int madd(int a, int b) {
a = a + b;
while (a < 0) a += mod;
while (a >= mod) a -= mod;
return a;
}
int mmul(int a, int b) {
return (a * 1ll * b) % mod;
}
int mpow(int a, int n) {
int r = 1;
for(; n; n >>= 1) {
if (n&1) r = mmul(r, a);
a = mmul(a, a);
}
return r;
}
int minv(int a) {
return mpow(a, mod-2);
}
int mdiv(int a, int b) {
return mmul(a, minv(b));
}
const int MX = 5005;
char g[MX][MX];
int n, m, k;
int mem[MX][MX];
int tot, b3;
int f(int i, int j) {
if (i == n && j == m)
return tot;
if (i > n || j > m)
return 0;
int &r = mem[i][j];
if (r != -1) return r;
if (g[i][j] == 'R')
r = f(i, j+1);
else if (g[i][j] == 'D')
r = f(i+1, j);
else if (g[i][j] == 'X')
r = madd(f(i, j+1), f(i+1, j));
else
r = mmul(mmul(2, madd(f(i, j+1), f(i+1, j))), b3);
return r;
}
int solve() {
tot = mpow(3, n * m - k);
b3 = minv(3);
memset(mem, -1, sizeof mem);
return f(1, 1);
}
int main() {
setIO();
int t=1; // cin>>t;
while(t--) {
cin>>n>>m>>k;
REP(i, n+1) REP(j, m+1) g[i][j] = '?';
REP(l, k) {
int i, j; cin >> i >> j;
cin >> g[i][j];
}
cout<<solve()<<"\n";
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
signed main(){
ll n,x;
cin >> n >> x;
cout << (n/x) << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,w,t=0,cnt=0;
cin>>n>>w;
while(t<=n)
{
t+=w;
cnt++;
}
cout<<cnt-1<<endl;
return 0;
}
|
Subsets and Splits