code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <iostream>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
#include <vector>
#include <queue>
#include <numeric>
#define MM (1000000000 + 7)
typedef unsigned long long ull;
int N, Q;
string S;
int T, A, B;
string ans;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int i, j, k;
bool l = false;
int m, n;
cin >> N >> S >> Q;
for (i = 0; i < Q; i++) {
cin >> T >> A >> B;
if (T == 1) {
int m = A - 1;
int n = B - 1;
if (l) {
m += N;
m %= (N << 1);
n += N;
n %= (N << 1);
}
char tmp = S[m];
S[m] = S[n];
S[n] = tmp;
}
else {
l = !l;
}
}
if (l) {
ans = "";
for (i = N; i < 2 * N; i++) {
ans += S[i];
}
for (i = 0; i < N; i++) {
ans += S[i];
}
cout << ans << '\n';
}
else {
cout << S << '\n';
}
return 0;
}
| #include <cassert>
#include <cctype>
#include <cerrno>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#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 <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int main()
{
int n,q,k;
string s;
cin>>n>>s>>q;
k=0;
vector<int> v(3*q);
for(int i=0; i<3*q; i++) cin>>v.at(i);
for(int i=0; i<q; i++){
if(v.at(3*i)==1){
if(k%2==0){
string x;
x=s.at(v.at(3*i+1)-1);
s.at(v.at(3*i+1)-1)=s.at(v.at(3*i+2)-1);
s.at(v.at(3*i+2)-1)=x.at(0);
}
else{
string x;
x=s.at((v.at(3*i+1)-1+n)%(2*n));
s.at((v.at(3*i+1)-1+n)%(2*n))=s.at((v.at(3*i+2)-1+n)%(2*n));
s.at((v.at(3*i+2)-1+n)%(2*n))=x.at(0);
}
}
else k++;
}
if(k%2==1){
s = s.substr(n,n)+s.substr(0,n);
}
cout<<s<<endl;
} |
#include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define read1(v,n) for(int i=1;i<=n;i++)cin>>v[i];
#define trav(a,x) for (auto& a: x)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define cut(x) {cout<<x;return 0;}
#define print(x) {cout<<x<<nl;continue;}
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORB(i,a,b) for(int i=a;i>=b;i--)
#define err1(a) {cout<<#a<<' '<<a<<nl;}
#define err2(a,b) {cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<nl;}
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define nl '\n'
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
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 bpow(ll a, ll b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%MOD;
b/=2;
a=(a*a)%MOD;
}
return ans;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
ll a,b;
cin>>a>>b;
if(a==b)
{
FOR(i,1,a)cout<<-i<<' '<<i<<' ';
return 0;
}
if(a>b)
{
FOR(i,1,b-1)cout<<i<<' '<<-i<<' ';
ll sum=0;
FOR(i,b,a)
{
cout<<i<<' ';
sum+=i;
}
cout<<-sum;
}
else
{
FOR(i,1,a-1)cout<<i<<' '<<-i<<' ';
ll sum=0;
FOR(i,a,b){sum+=i;cout<<-i<<' ';}
cout<<sum;
}
}
| #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define e "\n"
#define fl(x,n) for(ll i=x;i<=n;i++)
#define fl2(x,n) for(ll i=x;i>=n;i--)
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin >> a >> b;
if(a>b)
{
ll s1=(a*(a+1))/2;
b--;
ll s2=(b*(b+1))/2;
fl(1,a)
cout << i << " ";
fl(1,b)
cout << -i << " ";
ll temp=s1-s2;
cout << -temp << e;
}
else if(a<b)
{
ll s1=(b*(b+1))/2;
a--;
ll s2=(a*(a+1))/2;
fl(1,b)
cout << -i << " ";
fl(1,a)
cout << i << " ";
ll temp=s1-s2;
cout << temp << e;
}
else
{
fl(1,a)
cout << i << " ";
fl(1,b)
cout << -i << " ";
cout << e;
}
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
const int MOD = 998244353;
const int N = 55;
int n, z;
int dat[N][N];
ll fact[N];
struct DisjointSet {
int total;
int par[N], subsize[N];
void init(int n) {
total = n;
for (int i = 0; i < n; i++) {
par[i] = i;
subsize[i] = 1;
}
}
int findSet(int x) {
return par[x] == x ? x : par[x] = findSet(par[x]);
}
void uni(int a, int b) {
int x = findSet(a), y = findSet(b);
if (x != y) {
par[y] = x;
subsize[x] += subsize[y];
}
}
};
DisjointSet dsR, dsC;
int main() {
for (int i = 0; i < N; i++) {
if (i == 0) fact[i] = 1;
else fact[i] = (1ll*i*fact[i-1]) % MOD;
}
cin >> n >> z;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> dat[i][j];
}
}
dsR.init(n);
dsC.init(n);
for (int i = 0; i < n-1; i++) {
for (int j = i+1; j < n; j++) {
bool ok = true;
for (int k = 0; k < n; k++) {
if (dat[k][i] + dat[k][j] > z) ok = false;
}
if (ok) {
dsC.uni(i,j);
}
ok = true;
for (int k = 0; k < n; k++) {
if (dat[i][k] + dat[j][k] > z) ok = false;
}
if (ok) {
dsR.uni(i,j);
}
}
}
ll ans = 1;
for (int i = 0; i < n; i++) {
if (dsR.findSet(i) == i) {
ans = (ans * fact[dsR.subsize[i]]) % MOD;
// printf("%d %d\n", i, dsR.subsize[i]);
}
if (dsC.findSet(i) == i) {
ans = (ans * fact[dsC.subsize[i]]) % MOD;
// printf("%d %d\n", i, dsC.subsize[i]);
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--){
int n,k;
cin>>n>>k;
int a[n];
int count[n]={0};
for(int i=0;i<n;i++){
cin>>a[i];
count[a[i]]++;
}
priority_queue<int, vector<int>, greater<int>> p;
int ans=0;
int m=1e9;
int filled=0;
for(int i=0;i<n-1;i++){
m=min(m,count[i]);
count[i]=min(m,count[i]);
count[i+1]=min(m,count[i+1]);
if(count[i]>count[i+1]){
int x=count[i]-count[i+1];
for(int j=0;j<x;j++){
if(filled<k){
filled++;
p.push(i+1);
ans+=i+1;
}
else{
if(p.top()<i+1){
ans+=i+1-p.top();
p.pop();
p.push(i+1);
}
}
}
}
}
cout<<ans;
cout<<endl;
}
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
constexpr int INF = 1e9, MOD = 1e9 + 7;
constexpr int64_t LINF = 5e18, LMOD = 998244353;
// #include <atcoder/all>
// using namespace atcoder;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[]={1,0,-1,0,1,1,-1,-1};
// BEGIN CUT HERE
/**
* @brief セグメント木
* @tparam S 要素モノイド
*/
template<class S>
struct SegmentTree {
public:
/**
* @brief 単位元で初期化
* @param N サイズ
* @param F 二項演算 (S, S) -> S
* @param e 要素モノイドの単位元
*/
SegmentTree(const size_t N, const function<S(S, S)>& F, const S& e) : SegmentTree(vector<S>(N, e), F, e) {}
/**
* @brief 与配列で初期化
* @param v 配列
* @param F 二項演算 (S, S) -> S
* @param e 要素モノイドの単位元
*/
SegmentTree(const vector<S>& v, const function<S(S, S)>& F, const S& e) : F(F), e(e) {
N = 1 << pow2(v.size());
val = vector<S>(N << 1, e);
for(size_t i = 0; i < v.size(); ++i) {
val[N + i] = v[i];
}
for(size_t i = N - 1; i >= 1; --i) {
update(i);
}
}
/**
* @brief 1点更新
*/
void set(size_t idx, const S& _val) {
assert(idx < N);
idx += N;
val[idx] = _val;
while(idx > 1) {
idx >>= 1;
update(idx);
}
}
/**
* @brief 区間取得[l, r)
*/
S get(size_t l, size_t r) {
assert(l < r and r <= N);
S valL = e;
S valR = e;
for(l += N, r += N; l < r; l >>= 1, r >>= 1) {
if(l & 1) {
valL = F(valL, val[l++]);
}
if(r & 1) {
valR = F(val[--r], valR);
}
}
return F(valL, valR);
}
/**
* @brief 1点取得
*/
S get(const size_t idx) {
assert(idx < N);
return val[N + idx];
}
/**
* @brief 1点取得
*/
S operator[](const size_t idx) {
assert(idx < N);
return val[N + idx];
}
private:
const function<S(S, S)> F;
const S e;
size_t N;
vector<S> val;
/**
* @return n <= 2^k なる最小の k
*/
size_t pow2(const size_t n) {
size_t k = 0;
while((1 << k) < n) {
++k;
}
return k;
}
/**
* @brief v[idx]の更新
*/
void update(size_t idx) {
val[idx] = F(val[idx << 1], val[(idx << 1) | 1]);
}
};
// END CUT HERE
int main() {
int n, m, q; cin >> n >> m >> q;
vector<tuple<int, int, int>> query;
vector<int> val;
rep(i,q) {
int t, x, y; cin >> t >> x >> y;
query.emplace_back(t, x - 1, y);
val.emplace_back(y);
}
val.emplace_back(0);
sort(val.begin(), val.end());
val.erase(unique(val.begin(), val.end()), val.end());
int vn = val.size();
SegmentTree<int64_t> seg_a(vn, [](int64_t l, int64_t r) {
return l + r;
}, 0);
SegmentTree<int64_t> seg_b(vn, [](int64_t l, int64_t r) {
return l + r;
}, 0);
SegmentTree<int64_t> seg_a_cnt(vn, [](int64_t l, int64_t r) {
return l + r;
}, 0);
SegmentTree<int64_t> seg_b_cnt(vn, [](int64_t l, int64_t r) {
return l + r;
}, 0);
int64_t ans = 0;
int a[n] = {};
int b[m] = {};
seg_a_cnt.set(0, n);
seg_b_cnt.set(0, m);
for(auto [t, x, y] : query) {
if(t == 1) {
ans -= seg_b.get(a[x], vn);
if(0 < a[x]) ans -= seg_b_cnt.get(0, a[x]) * val[a[x]];
seg_a.set(a[x], seg_a[a[x]] - val[a[x]]);
seg_a_cnt.set(a[x], seg_a_cnt[a[x]] - 1);
a[x] = lower_bound(val.begin(), val.end(), y) - val.begin();
seg_a.set(a[x], seg_a[a[x]] + val[a[x]]);
seg_a_cnt.set(a[x], seg_a_cnt[a[x]] + 1);
ans += seg_b.get(a[x], vn);
if(0 < a[x]) ans += seg_b_cnt.get(0, a[x]) * val[a[x]];
} else {
ans -= seg_a.get(b[x], vn);
if(0 < b[x]) ans -= seg_a_cnt.get(0, b[x]) * val[b[x]];
seg_b.set(b[x], seg_b[b[x]] - val[b[x]]);
seg_b_cnt.set(b[x], seg_b_cnt[b[x]] - 1);
b[x] = lower_bound(val.begin(), val.end(), y) - val.begin();
seg_b.set(b[x], seg_b[b[x]] + val[b[x]]);
seg_b_cnt.set(b[x], seg_b_cnt[b[x]] + 1);
ans += seg_a.get(b[x], vn);
if(0 < b[x]) ans += seg_a_cnt.get(0, b[x]) * val[b[x]];
}
cout << ans << '\n';
}
return 0;
}
| #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
typedef std::vector<std::pair<ll,ll> > pii;
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define forr(i,a,b) for(i=a;i>=b;i--)
#define mp make_pair
#define pb(x) push_back(x)
#define fi first
#define se second
#define print(vec,a,b) for(ll i=a;i<b;i++) cout<<vec[i]<<" ";cout<<endl;
#define all(a) a.begin(),a.end()
#define input(vec,a,b) for(ll i = a;i<b;i++) cin>>vec[i];
#define ms(a,val) memset(a,val,sizeof(a))
using namespace std;
const int N = 2e5+ 5;
ll expo_pow(ll x, ll y) {
if (y == 0)
return 1;
y = y % (mod - 1);
x %= mod;
if (y == 0)
y = mod - 1;
ll res = 1;
while (y) {
if (y & 1)
res = (res * x) % mod;
x = (x * x) % mod;
y >>= 1;
}
return res;
}
ll modInverse(ll a, ll m = mod) {
return expo_pow(a, m - 2);
}
using matrix = vector<vector<ll>>;
matrix matMul(matrix A, matrix B) {
//assert((int)A[0].size() == (int)B.size());
matrix res((ll)A.size(), vector<ll>((ll)B[0].size(), 0));
for (int i = 0; i < (int)A.size(); ++i) {
for (int j = 0; j < (int)B[0].size(); ++j) {
for (int k = 0; k < (int)A[0].size(); ++k) {
res[i][j] += (A[i][k] * B[k][j]) % mod;
res[i][j] %= mod;
}
}
}
return res;
}
matrix matPow(matrix M, int p) {
if (p == 1) return M;
if (p % 2) return matMul(M, matPow(M, p - 1));
matrix X = matPow(M, p / 2);
return matMul(X, X);
}
void solve(){
ll i,j,n,m,k;
cin>>n>>m>>k;
vv a(1,vi(n,0));
input(a[0],0,n);
vv adj(n,vector<ll>(n,0));
vi deg(n,0);
fo(i,0,m)
{
ll x,y;
cin>>x>>y;
x--,y--;
adj[x][y] = 1;
adj[y][x] = 1;
deg[x]++;
deg[y]++;
}
ll inv = modInverse(2*m,mod);
vv M(n,vi(n,0));
if(k == 0)
{
print(a[0],0,n);
return ;
}
fo(i,0,n)
{
fo(j,0,n)
{
if(i == j)
{
M[i][j] = (1 - (deg[i]*inv)%mod + mod)%mod;
}
else
{
M[i][j] = inv*adj[i][j];
}
}
}
M = matPow(M, k);
a = matMul(a,M);
fo(i,0,n)
{
cout<<a[0][i]<<endl;
}
}
int main()
{
IO;
ll t=1,i;
//cin>>t;
while(t--)
{
solve();
}
return 0;
}
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include<bits/stdc++.h>
using namespace std;
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 SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
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; }
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
class EPeddler {
public:
vector<int> graph[200005];
void solve(istream& cin, ostream& cout) {
SPEED;
int n, m; cin >> n >> m;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
}
vector<int> x(m), y(m);
rep(i, m) {
cin >> x[i] >> y[i];
x[i]--; y[i]--;
graph[x[i]].push_back(y[i]);
}
vector<ll> dp(n, LLONG_MIN/2);
vector<ll> lowest(n, LLONG_MAX/2);
for(int i=0; i<n; i++) {
for(auto e: graph[i]) {
chmin(lowest[e], lowest[i]);
chmin(lowest[e], a[i]);
}
}
ll ret = LLONG_MIN/2;
for(int i=0; i<n; i++) {
chmax(ret, a[i] - lowest[i]);
}
cout << ret << endl;
}
};
signed main() {
EPeddler solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 100005;
int n, d;
int a[N], b[N];
int minu[N];
vector<int> v[N];
void solv()
{
scanf("%d%d", &n, &d);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i)
scanf("%d", &b[i]);
a[n + 1] = b[n + 1] = d + 1;
for (int i = 1; i <= n; ++i)
minu[i] = N;
map<int, int> mp;
for (int i = 0; i <= n + 1; ++i)
{
mp[a[i] - i] = i;
if (mp.find(b[i] - i) != mp.end())
{
if (mp[b[i] - i] != i)
v[mp[b[i] - i]].push_back(i);
minu[i] = min(minu[i], i - mp[b[i] - i]);
}
}
mp.clear();
for (int i = n + 1; i >= 0; --i)
{
mp[a[i] - i] = i;
if (mp.find(b[i] - i) != mp.end())
{
if (mp[b[i] - i] != i)
v[mp[b[i] - i]].push_back(i);
minu[i] = min(minu[i], mp[b[i] - i] - i);
}
}
for (int i = 0; i <= n + 1; ++i)
{
if (minu[i] == N)
{
printf("-1\n");
return;
}
}
ll ans = 0;
for (int i = 0; i <= n + 1; ++i)
{
if (v[i].empty())
continue;
sort(all(v[i]));
if (v[i][0] < i)
ans += (i - v[i][0]);
if (v[i].back() > i)
ans += (v[i].back() - i);
}
printf("%lld\n", ans);
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <deque>
#include <iomanip>
#define ll long long
#define ld long double
using namespace std;
void solve() {
ll L, R;
cin >> L >> R;
ll left = R - L;
if (left < L) {
cout << "0\n";
return;
}
ll c = R - L - L + 1;
ll ans = (c + 1) * c / 2;
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int t;
cin >> t;
for (int ij = 0; ij < t; ++ij) {
solve();
}
}
//*/ | /*
Description
@authors Magneto
@date 2021-02-13 17:36:16
@version
*/
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(nullptr);
#define ll long long
#define l long int
#define f(i, a, b) for(int i=a; i<b; i++)
#define fr(i, a, b) for(int i=a; i>=b; i--)
#define endl '\n'
#define pb push_back
#define pf pop.front()
#define all(x) x.begin(),x.end()
#define debug(x) cerr << #x << " = " << x << endl;
#define lcm(a,b) a*b/__gcd(a,b)
//__builtin_popcount = int
//__builtin_popcountl = long int
//__builtin_popcountll = long long
using namespace std;
void solve()
{
int a,b;
cin>>a>>b;
int left = a + a;
int right = b;
if(left > right){
cout<<0<<endl;
return;
}
ll n = right - left + 1;
ll ans = n*(n+1)/2;
cout<<ans<<endl;
}
int32_t main()
{
FAST
l T=1;
cin>>T;
while(T--)
{
solve();
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define real long double
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pi M_PI
#define elif else if
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const int INF = 2e18, MOD = 998244353, RANDOM = chrono::steady_clock::now().time_since_epoch().count();
const real EPS = 1e-12;
mt19937 rng(RANDOM);
struct chash {
int operator() (int x) const { return (x ^ RANDOM) % MOD; }
};
int n;
vector<vector<int>> people;
vector<int> ind;
vector<pair<int, int>> answer;
int search(){
int cnt = 0;
for (int i=0; i<n - 1; ++i){
if (people[i][2] == people[i][3]) continue;
if (people[i][1] >= people[i][0]) return -1;
int j = ind[people[i][3]];
if (people[j][1] >= people[j][0]) return -1;
ind[people[i][2]] = j;
ind[people[i][3]] = people[i][3];
swap(people[i][1], people[j][1]);
swap(people[i][2], people[j][2]);
answer.push_back({people[i][3], people[j][3]});
++cnt;
}
return cnt;
}
void debug(){
cerr << "\n";
cerr << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// cout.precision(6);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n;
people.assign(n, vector<int>(4, 0));
ind.assign(n, 0);
vector<int> b(n);
for (int i=0; i<n; ++i) cin >> people[i][0];
for (int i=0; i<n; ++i) cin >> b[i];
for (int i=0; i<n; ++i){
cin >> people[i][2];
--people[i][2];
people[i][1] = b[people[i][2]];
people[i][3] = i;
}
sort(all(people));
for (int i=0; i<n; ++i) ind[people[i][2]] = i;
int res = search();
cout << res << "\n";
if (res != -1) for (auto i: answer) cout << i.f + 1 << " " << i.s + 1 << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> b(N+1);
vector<vector<int> > iap(N+1, vector<int>(3));
vector<int> who_has(N+1);
vector<int> who_is(N+1);
vector<pair<int, int> > ans;
for (int i = 1; i < 3; i++)
{
for (int j = 1; j < N+1; j++) cin >> iap.at(j).at(i);
if (i == 1)
{
for (int j = 1; j < N+1; j++) cin >> b.at(j);
}
}
for (int i = 1; i < N+1; i++) iap.at(i).at(0) = i;
sort(iap.begin(),iap.end(),[](const vector<int> &alpha,const vector<int> &beta){return alpha[1] < beta[1];});
for (int i = 1; i < N+1; i++)
{
who_has.at(iap.at(i).at(2)) = i;
who_is.at(iap.at(i).at(0)) = i;
}
for (int i = 1; i < N+1; i++)
{
if (iap.at(i).at(0) == iap.at(i).at(2)) continue;
if (iap.at(i).at(1) <= b.at( iap.at(i).at(2) ))
{
cout << -1 << endl;
return 0;
}
ans.push_back(make_pair(iap.at(i).at(0), iap.at(who_has.at( iap.at(i).at(0) )).at(0)));
iap.at(who_is.at( iap.at(who_has.at( iap.at(i).at(0) )).at(0) )).at(2) = iap.at(i).at(2);
who_has.at( iap.at(i).at(2) ) = who_has.at( iap.at(i).at(0) );
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans.at(i).first << " " << ans.at(i).second << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 998244353
int binary_expo(int a,int b)
{
int res=1;
while(b>0)
{
if(b&1>0)
{
res=(((res%M)*(a%M))%M);
}
b=b>>1;
a=(((a%M)*(a%M))%M);
}
return res;
}
int inv(int a,int b)
{
a=(((a%M)*(binary_expo(b,M-2)))%M);
return a;
}
int32_t main()
{
int t=1;
//cin>>t;
while(t--)
{
int n;cin>>n;
vector<int> a(n,0);
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a.begin(),a.end());
int p=0;
int i=n-2;
int s=0;
while(i>=0)
{
s+=((a[i]*(binary_expo(2,p)))%M);
s%=M;
p++;
i--;
}
int c=0;
for(int i=n-1;i>0;i--)
{
int k=((s*a[i])%M);
c+=k;
c%=M;
s=((s-a[i-1]+M)%M);
s=(inv(s,(int)2)%M);
s%=M;
}
for(int i=0;i<n;i++)
{
c+=((a[i]*a[i])%M);
c%=M;
}
cout<<c<<endl;
}
return 0;
}
| //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <inttypes.h>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #include <atcoder/dsu>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;
// using mint = modint;
using namespace std;
using ll = int64_t;
using ull = uint64_t;
[[maybe_unused]] constexpr ll LL_MAX = numeric_limits<ll>::max();
[[maybe_unused]] constexpr ll LL_MIN = numeric_limits<ll>::min();
[[maybe_unused]] constexpr ull ULL_MAX = numeric_limits<ull>::max();
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (a)-1; i >= (b); i--)
template<typename T>
void chmin(T& x, T y) {
x = min(x, y);
}
template<typename T>
void chmax(T& x, T y) {
x = max(x, y);
}
ll csum(ll x, ll y) {
if (x > 0 && y > 0 && x > LL_MAX - y) {
return LL_MAX;
}
if (x < 0 && y < 0 && x < LL_MIN - y) {
return LL_MIN;
}
return x + y;
}
ll readi() {
ll ret;
scanf("%" PRId64 "", &ret);
return ret;
}
vector<ll> readvi(ll n) {
vector<ll> ret(n);
rep(i, 0, n) { ret[i] = readi(); }
return ret;
}
double readf() {
double ret;
scanf("%lf", &ret);
return ret;
}
string reads() {
string s;
cin >> s;
return s;
}
void writei(ll x) {
printf("%" PRId64 "\n", x);
}
void writevi(const vector<ll>& xs) {
rep(i,0,xs.size()) {
if (i < xs.size() - 1) {
printf("%" PRId64 " ", xs[i]);
} else {
printf("%" PRId64 "\n", xs[i]);
}
}
}
void writes(const string& s) {
cout << s.c_str() << endl;
}
void writef(double x) {
printf("%.10f\n", x);
}
template<typename T>
vector<T> make_vec_nd(T init, ll size) {
return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, ll size, Args... rest) {
auto inner = make_vec_nd(init, rest...);
return vector<decltype(inner)>(size, inner);
}
int main() {
ll N = readi();
vector<ll> As(N);
vector<ll> Ts(N);
ll zero_pt = 0;
rep(i,0,N) {
As[i] = readi();
Ts[i] = readi();
if (Ts[i] == 1) {
zero_pt += As[i];
} else if (Ts[i] == 2) {
zero_pt = max(zero_pt, As[i]);
} else {
zero_pt = min(zero_pt, As[i]);
}
}
ll total = 0;
rep(i,0,N) {
if (Ts[i] == 1) {
total += As[i];
} else {
As[i] -= total;
}
}
ll lower = LL_MIN;
ll upper = LL_MAX;
rep(i,0,N) {
if (Ts[i] == 1) {
continue;
} else if (Ts[i] == 2) {
chmax(lower, As[i]);
} else {
chmin(upper, As[i]);
}
}
ll Q = readi();
vector<ll> ans(Q);
rep(i,0,Q) {
ll x = readi();
if (lower <= upper) {
ans[i] = min(upper, max(lower, x)) + total;
} else {
ans[i] = zero_pt;
}
}
rep(i,0,Q) {
writei(ans[i]);
}
}
|
// E - Lamps
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define irep(i,s) for(int i=(int)(s);i>=0;--i)
int main(){
int h, w; cin>>h>>w;
int k = h * w;
vector<string> S(h);
rep(i, h){
cin>>S[i];
rep(j, w) if(S[i][j] == '#') --k;
}
vvi X(h, vi(w+1));
rep(i, h){
rep(j, w) if(S[i][j] == '.') X[i][j+1] += X[i][j] + 1;
int mx = 0;
irep(j, w) mx = X[i][j]? X[i][j] = max(mx, X[i][j]): 0;
}
vvi Y(h+1, vi(w));
rep(j, w){
rep(i, h) if(S[i][j] == '.') Y[i+1][j] += Y[i][j] + 1;
int mx = 0;
irep(i, h) mx = Y[i][j]? Y[i][j] = max(mx, Y[i][j]): 0;
}
int M = 1000000007;
vector<int> pow2(k+1);
pow2[0] = 1; rep(i, k) pow2[i+1] = pow2[i] * 2 % M;
ll ans = (ll)k * pow2[k] % M;
rep(i, h) rep(j, w){
if(S[i][j] == '.'){
ans -= pow2[k - (X[i][j+1] + Y[i+1][j] - 1)];
ans %= M;
}
}
cout<< (ans + M) % M <<endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,x) memset(a,x,sizeof(a))
#define debv(a) for(auto it: a)cout<<it<<" ";newl;
#define deb1(a) cout<<a<<"\n";
#define deb2(a,b) cout<<a<<" "<<b<<"\n";
#define deb3(a,b,c) cout<<a<<" "<<b<<" "<<c<<"\n";
#define deb4(a,b,c,d) cout<<a<<" "<<b<<" "<<c<<" "<<d<<"\n";
#define uniq(a) a.resize(unique(a.begin(), a.end()) - a.begin());
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const ll N = 2e3+5;
const ll M = 4e6+5;
const ll mod = 1e9+7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
ll n, m, p[N][N][4], p2[M];
string s[N];
void solve(){
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> s[i]; s[i] = '#' + s[i] + '#';
}
s[0] = s[n+1] = string(m+2,'#');
int no = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(s[i][j] == '#') continue;
no++;
}
}
for(int i = 1; i <= n; i++){
int prv = 0;
for(int j = 1; j <= m; j++){
if(s[i][j] == '#') prv = j;
else {
p[i][j][0] = prv;
}
}
prv = m+1;
for(int j = m; j >= 1; j--){
if(s[i][j] == '#') prv = j;
else {
p[i][j][1] = prv;
}
}
}
for(int i = 1; i <= m; i++){
int prv = 0;
for(int j = 1; j <= n; j++){
if(s[j][i] == '#') prv = j;
else {
p[j][i][2] = prv;
}
}
prv = n+1;
for(int j = n; j >= 1; j--){
if(s[j][i] == '#') prv = j;
else {
p[j][i][3] = prv;
}
}
}
ll ans = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(s[i][j] == '#') continue;
int tot = p[i][j][1] - p[i][j][0] + p[i][j][3] - p[i][j][2] - 3;
ll res = (p2[no] - p2[no-tot] + mod) % mod;
ans = (ans + res) % mod;
}
}
deb1(ans)
}
int main(){
GODSPEED;
p2[0] = 1;
for(int i = 1; i < M; i++){
p2[i] = p2[i-1] * 2 % mod;
}
int test = 1;
//cin>>test;
for(int i = 1; i <= test; i++){
solve();
}
} |
#include<bits/stdc++.h>
using namespace::std;
const int N = 2000 + 5;
int gcd(int a, int b){
while(b){
a %= b;
swap(a, b);
}
return a;
}
int n;
int a[N];
int solve(){
map<int, int> G;
for(int i = 1; i <= n; i++){
for(int j = 1; j * j <= a[i]; j++){
if(a[i] % j == 0){
if(G.count(j)) G[j] = gcd(G[j], a[i]);
else G[j] = a[i];
if(G.count(a[i] / j)) G[a[i] / j] = gcd(G[a[i] / j], a[i]);
else G[a[i] / j] = a[i];
}
}
}
int ans = 0;
int mini = *min_element(a + 1, a + n + 1);
for(auto e : G){
if(e.first < mini and e.second == e.first) ans++;
}
return ans + 1;
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", a + i);
printf("%d\n", solve());
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
long long gcd(long long a, long long b){return (b == 0)? a : gcd(b, a % b);}
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n; cin >> n;
ll a[n]; zep(i, 0, n)cin >> a[i];
ll mn = a[0]; zep(i, 0, n)mn = min(mn, a[i]);
map<ll, ll> s;
zep(i, 0, n){
for(ll j = 1; j * j <= a[i]; j++){
if(a[i] % j == 0){
if(s.find(j) == s.end()){
s[j] = a[i];
}else{
s[j] = gcd(s[j], a[i]);
}
ll k = a[i] / j;
if(s.find(k) == s.end()){
s[k] = a[i];
}else{
s[k] = gcd(s[k], a[i]);
}
}
}
}
ll ans = 0;
for(auto it = s.begin(); it != s.end(); it++){
if((*it).first <= mn && (*it).first == (*it).second)ans++;
}
print(ans)
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
using ld = double;
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define ins insert
#define nl "\n"
const ll MOD = 998244353;
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;
}
template<typename T> T signum(T a) {
return (a > 0) - (a < 0);
}
template<typename T> T cmp(T a, T b) {
return signum(a-b);
}
template<typename T> bool mins(T& lhs , T& rhs) {
if (rhs < lhs) {
lhs = rhs;
return true;
}
return false;
}
template<typename T> bool maxs(T& lhs , T& rhs) {
if (rhs > lhs) {
lhs = rhs;
return true;
}
return false;
}
const int MAX = INT_MAX;
void gks(int tc) {
printf("Case #%d: ", tc);
};
int main() {
int n;
cin>>n;
cout<<n-1<<nl;
return 0;
}
| //in dp prefix suffix sum helps..
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <iterator>
#include <map>
#include<list>
#include <fstream>
#include<unordered_map>
#include<set>
#include<queue>
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pip pair<int, pair<int, int> >
#define vip vector<pair<int, pii> >
#define vi vector<int>
#define vd vector<double>
#define mii map<int, int>
#define qu queue<int>
#define set set<int>
#define multiset multiset<int>
#define rep(i, a, b) for(int i=a;i<b;i++)
#define rep1(i, a, b) for(int i=a;i>=b;i--)
#define viv vector<vi>
#define stack stack<int>
#define fi first
#define se second
#define reverse(s) reverse(s.begin(), s.end())
#define sort1(v) sort(v.begin(), v.end())
#define it iterator
#define pq priority_queue<int>
#define pq1 priority_queue <pii, vector<pii>, greater<pii> >
#define mem(x, y) memset(x, (int)y, sizeof(x))
#define ps(x,y) fixed<<setprecision(y)<<x
// author :: Anurag Anand.
using namespace std;
//int z= 1e9+7;
int z= 998244353;
int gcd(int a, int b){
if(a==0)return b;
if(b==0)return a;
return gcd(b, a%b);
}
int power(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
{
res=(res*a)%z;
b--;
}
a=(a*a)%z;
b=b>>1;
}
return res;
}
vi sv;
// vi seg;
// void arrange(int i, int v, int x, int lx, int rx){
// if(rx-lx==1){
// seg[x] =v;
// return;
// }
// int m= (lx+rx)/2;
// if(i<m) arrange(i, v, 2*x+1, lx, m);
// else arrange(i, v, 2*x+2, m, rx);
// seg[x]=min(seg[2*x+1], seg[2*x+2]);
// }
// int calc(int l, int r, int x, int lx, int rx){
// if(l>=rx||r<=lx) return 1e9;
// if(lx>=l&&rx<=r) return seg[x];
// int mid=(lx+rx)/2;
// int sl= calc(l, r, 2*x+1, lx, mid), sr= calc(l, r, 2*x+2, mid, rx);
// return min(sl, sr);
// }
// vi v[200001];
// int dist[200001], ans[200001]={0}, vis[200001]={0};
// void dijkstra(int root){
// int a, d;
// dist[root]=0;
// set s;
// s.insert(mp(0, root));
// while(!s.empty()){
// a= (*s.begin()).se, d= (*s.begin()).fi;
// s.erase(s.begin());
// for(int i=0;i<v[a].size();i++){
// if(dist[a]+1<dist[v[a][i]]){
// s.erase(mp(dist[v[a][i]], v[a][i]));
// dist[v[a][i]]=dist[a]+1;
// s.insert(mp(dist[v[a][i]], v[a][i]));
// }
// }
// }
// }
vi pp;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
pp.assign(1000001, 0);
for(int i=2;i<1000;i++){
if(!pp[i]){
for(int j=i*i;j<=1000000;j+=i){
pp[j]=1;
}
}
}
for(int i=2;i<=1000000;i++) if(!pp[i]) sv.pb(i);
int t;
t=1;
//cin>>t;
while(t--){
int n;
cin>>n;
cout<<n-1<<"\n";
}
} |
#include <iostream>
#include <algorithm>
using namespace std;
const int kMaxN = 1e5 + 1;
struct E {
int y, n;
} e[2 * kMaxN];
struct V {
int c, et;
} a[kMaxN];
int n, p, v[kMaxN];
bool s[kMaxN];
void A(int i, int x, int y) {
e[i] = {y, a[x].et};
a[x].et = i;
}
void D(int x, int f) {
s[x] = !v[a[x].c]++;
for (int i = a[x].et; i; i = e[i].n) {
if (e[i].y != f) {
D(e[i].y, x);
}
}
--v[a[x].c];
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i].c;
}
for (int i = 1, x, y; i < n; ++i) {
cin >> x >> y;
A(i, x, y), A(i + n, y, x);
}
D(1, 0);
for (int i = 1; i <= n; ++i) {
if (s[i]) {
cout << i << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,a,b) for(ll i=a;i<b;i++)
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define ce(ele) cout<<ele<<' '
#define CASE(t) int t; cin>>t; while(t--)
#define sor(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define vi vector<ll>
#define cs(ele) cout<<ele<<'\n'
const ll Mod=1e9 +7;const ll M1=998244353;
ll mod(ll n){return ((n%Mod)+Mod)%Mod;}
ll power(ll x,ll y){ll res=1;x=x;while(y>0){if(y&1)res=mod(res*x);x=mod(x*x);y=mod(y>>1);}return mod(res);}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,x;cin>>n>>x;
vector<int> v;
f(i,0,n){
int a;cin>>a;
if(a!=x)v.pb(a);
}
for(auto a:v)ce(a);cout<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
bool mini(int &a, int b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//freopen("input.txt","r",stdin);
int n, m; cin >> n >> m;
vector<vector<int> > adj(n);
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
--u; --v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int k; cin >> k;
vector<int> c(k);
for (int i = 0; i < k; i++) {
cin >> c[i];
--c[i];
}
auto bfs = [&](int s) {
vector<int> cost(n, inf);
cost[s] = 0;
queue<int> q;
q.push(s);
while (q.size()) {
int u = q.front();
q.pop();
for (int v: adj[u]) {
if (mini(cost[v], cost[u] + 1)) q.push(v);
}
}
for (int i = 0; i < k; i++) cost[i] = cost[c[i]];
cost.resize(k);
return cost;
};
vector<vector<int> > cost(k);
for (int i = 0; i < k; i++) cost[i] = bfs(c[i]);
vector<vector<int> > dp(1 << k, vector<int>(k, inf));
for (int i = 0; i < k; i++) dp[1 << i][i] = 1;
for (int mask = 1; mask < (1 << k); mask++) {
for (int i = 0; i < k; i++) {
if (mask & (1 << i)) {
int mask2 = mask ^ (1 << i);
for (int j = 0; j < k; j++) {
if (mask2 & (1 << j)) {
mini(dp[mask][i], dp[mask2][j] + cost[i][j]);
}
}
}
}
}
int ans = *min_element(dp.back().begin(), dp.back().end());
if (ans >= inf) ans = -1;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using pii = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#define pi 3.14159265358979
#define rep(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ci(x) cin >> x
#define cii(x) int x;cin >> x
#define cci(x,y) int x,y;cin >> x >> y
#define co(x) cout << x << endl
void chmax(int &x,int y){x=max(x,y);}
void chmin(int &x,int y){x=min(x,y);}
int main(){
cci(n,m);
int inf=1001001001;
vvi to(n,vi(0));
rep(i,0,m){
cci(a,b);
a--;b--;
to[a].push_back(b);
to[b].push_back(a);
}
cii(r);
vi v(r);
rep(i,0,r)ci(v[i]),v[i]--;
vvi dist(r,vi(r));
// rep(i,0,n)dist[i][i]=0;
rep(i,0,r){
int now=v[i];
vi dis(n,inf);
dis[now]=0;
queue<int> q;
q.push(now);
while(!q.empty()){
int x=q.front();q.pop();
for(int nx:to[x]){
if(dis[nx]==inf){
dis[nx]=dis[x]+1;
q.push(nx);
}
}
}
rep(j,0,r)dist[i][j]=dis[v[j]];
}
// rep(k,0,r){
// rep(i,0,r){
// rep(j,0,r){
// int I=v[i],J=v[j],K=v[k];
// chmin(dist[I][J],dist[I][K]+dist[K][J]);
// }
// }
// }
int r2=1<<r;
vvi dp(r2,vi(r,inf));
rep(i,0,r)dp[1<<i][i]=0;
rep(bn,0,r2){
rep(i,0,r){
if(~bn>>i&1)continue;
rep(j,0,r){
if(bn>>j&1)continue;
chmin(dp[bn|1<<j][j],dp[bn][i]+dist[i][j]);
}
}
}
int ans=inf;
rep(i,0,r)chmin(ans,dp[r2-1][i]);
if(ans==inf)ans=-2;
co(++ans);
} |
/*************************************************************************
> File Name: 2.cpp
> Author: Knowledge_llz
> Mail: [email protected]
> Blog: https://blog.csdn.net/Pig_cfbsl
> Created Time: 2020/10/24 21:01:12
************************************************************************/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define LL long long
using namespace std;
int read(){
char x=getchar(); int u=0,fg=0;
while(!isdigit(x)){ if(x=='-') fg=1; x=getchar(); }
while(isdigit(x)){ u=(u<<3)+(u<<1)+(x^48); x=getchar(); }
return fg?-u:u;
}
const int maxx=2e5+10,mod=998244353;
LL n,k,a[maxx][320],sum[320],ans[320],c[320][320];
void init(){
For(i,0,300) c[0][i]=1;
For(i,1,300) For(j,1,i)
c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
}
LL qpow(LL x,LL y){
LL res=1;
while(y){
if(y&1) res=res*x%mod;
x=x*x%mod;
y>>=1;
}
return res;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
init();
LL inv=qpow(2,mod-2);
n=read(); k=read();
For(i,1,n){
a[i][1]=read();
For(j,2,k) a[i][j]=a[i][j-1]*a[i][1]%mod;
}
For(i,1,k) For(j,1,n) (sum[i]+=a[j][i])%=mod;
For(i,1,k)
For(j,1,k-i){
ans[i+j]=(ans[i+j]+c[i+j][i]*sum[i]%mod*sum[j]%mod)%mod;
}
For(i,2,k){
(ans[i]-=(qpow(2,i)-2)*sum[i]%mod)%=mod;
ans[i]=ans[i]*inv%mod;
}
For(i,1,k){
(ans[i]+=sum[i]*(n-1)%mod)%=mod;
printf("%lld\n",(ans[i]+mod)%mod);
}
return 0;
}
| #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
using namespace std;
const int N = 2e5 + 8;
const int K = 301;
const int MOD = 998244353;
int add(int a, int b) {
if (a + b < MOD) {
return a + b;
}
return a + b - MOD;
}
int sub(int a, int b) {
if (a >= b) {
return a - b;
}
return a - b + MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int binpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = mul(res, a);
a = mul(a, a);
b /= 2;
}
return res;
}
int divv(int a, int b) {
return mul(a, binpow(b, MOD - 2));
}
int a[N];
int s[K];
int ans[K];
int C[K][K];
void init() {
for (int i = 0; i < K; i++) {
C[i][0] = 1;
for (int j = 1; j <= i; j++) {
C[i][j] = add(C[i - 1][j], C[i - 1][j - 1]);
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
init();
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
int c = 1;
for (int j = 0; j < K; j++) {
s[j] = add(s[j], c);
c = mul(c, a[i]);
}
}
for (int i = 0; i < K; i++) {
for (int j = 0; i + j < K; j++) {
int S = mul(s[i], s[j]);
S = sub(S, s[i + j]);
S = divv(S, 2);
ans[i + j] = add(ans[i + j], mul(C[i + j][j], S));
}
}
for (int i = 1; i <= k; i++) {
cout << ans[i] << '\n';
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1000000007;
int main(){
ll N;
cin >> N;
set<ll> P;
for(ll a=2;a*a<=N;a++){
ll j=a*a;
while(j<=N){
P.insert(j);
j*=a;
}
}
cout << N-P.size() << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int inf = 1e9;
const int inf64 = 1e18;
const int MOD = inf + 7;
void solve() {
int n;
cin >> n;
int ans = n;
set<int> s;
for(int i=2 ; i*i<=n ; i++){
if(s.count(i)){
continue;
}
int cnt = 0;
int x = 1;
while(x * i <= n){
cnt++;
x *= i;
s.insert(x);
}
ans -= max(0LL, cnt - 1);
}
cout << ans << "\n";
}
int32_t main() {
fast;
int t = 1;
// cin >> t;
while (t--) solve();
} |
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define INF 9999999999999999
#define rep(i,m,n) for(ll i = m;i < n;i++)
#define rrep(i,m,n) for(ll i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<ll,ll>
#define tint tuple<int, int, int>
#define paf(L,R) pair<L,R>
#define mod 998244353
#define MAX 10000010
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, A, B;
cin >> N >> A >> B;
cout << N - A + B << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define gc c=getchar()
#define r(x) read(x)
#define ll long long
#define db double
template<typename T>
inline void read(T&x){
x=0;T k=1;char gc;
while(!isdigit(c)){if(c=='-')k=-1;gc;}
while(isdigit(c)){x=x*10+c-'0';gc;}x*=k;
}
ll n,k;
inline ll calc(ll x){
if(x<2||x>2*n)return 0;
return min(n,x-1)-max(1ll,x-n)+1;
}
int main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
r(n),r(k);
ll ret=0;
for(int i=2;i<=2*n;++i){
ret+=calc(i)*calc(i-k);
}
printf("%lld\n",ret);
} |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int a,b;
cin >> a >> b;
int mx=0;
for (int k=1; k<=b; k++)
{
int z = (a+k-1)/k;
int first = z*k;
int second = (z+1)*k;
if (first>=a && second<=b) mx = k;
}
cout << mx;
}
int main()
{
int t=1;
//cin >> t;
while (t--) solve();
}
| #if _local
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
using i64 = int64_t;
using pll = std::pair<int64_t,int64_t>;
constexpr char newl = '\n';
template<class T>std::istream&operator>>(std::istream&is,std::vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T>std::ostream&operator<<(std::ostream&os,std::vector<T>const&v){for(auto const& vi:v)os<<vi<<" ";return os;}
template<class T,class U>std::istream&operator>>(std::istream&is,std::pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T,class U>std::ostream&operator<<(std::ostream&os,std::pair<T,U>const&p){os<<p.first<<" "<<p.second;return os;}
#if _local
struct debug_structure{template<class T>debug_structure&operator<<(const T&elm){std::cerr<<elm<<std::flush;return*this;}}dout;
#else
struct debug_structure{template<class T>debug_structure&operator<<(const T&elm){return*this;}}dout;
#endif
int main() {
int n;
cin >> n;
vector<pll> a(n);
cin >> a;
i64 bsum = 0;
for (auto [b, _] : a)
bsum += b;
auto cmp = [](pll a, pll b) {
return a.first * 2 + a.second > b.first * 2 + b.second;
};
sort(begin(a), end(a), cmp);
i64 asum = 0;
int ans = 0;
rep(i, n) {
asum += a[i].first + a[i].second;
bsum -= a[i].first;
ans = i + 1;
if (asum > bsum)
break;
}
dout << asum << " " << bsum << newl;
cout << (ans) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
const int N = 3e5;
const int INF = 1e9;
int n, k;
int st[4*N], lz[4*N];
void prop(int idx, int l, int r) {
if (lz[idx] == 0) return;
st[idx] += lz[idx];
if (l < r) {
lz[2*idx] += lz[idx];
lz[2*idx+1] += lz[idx];
}
lz[idx] = 0;
}
void update(int idx, int l, int r, int x, int y, int val) {
prop(idx,l,r);
if (l > y || r < x) return;
if (l >= x && r <= y) {
lz[idx] += val;
prop(idx,l,r);
return;
}
int m = (l+r)/2;
update(2*idx,l,m,x,y,val); update(2*idx+1,m+1,r,x,y,val);
st[idx] = min(st[2*idx],st[2*idx+1]);
}
int minOf(int idx, int l, int r, int x, int y) {
prop(idx,l,r);
if (l > y || r < x) return INF;
if (l >= x && r <= y) return st[idx];
int m = (l+r)/2;
return min(minOf(2*idx,l,m,x,y),minOf(2*idx+1,m+1,r,x,y));
}
int binser(int l, int r) {
if (minOf(1,0,n,l,r) > 0) return r+1;
if (l == r) return l;
int m = (l+r)/2;
if (l <= m && minOf(1,0,n,l,m) == 0) return binser(l,m);
return binser(m+1,r);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int a; cin >> a;
update(1,0,n,a,a,1);
}
ll ans = 0;
while (k--) {
int mex = binser(0,n);
if (mex == 0) break;
// cout << ">> " << mex << '\n';
ans += mex;
update(1,0,n,0,mex-1,-1);
}
cout << ans << '\n';
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define FOR(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for(ll i = (ll)(a - 1); i >= (ll)(b); i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace std;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<char> vc;
typedef vector<vc> vvc;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge{ll to, cost;};
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N,K;
cin >> N >> K;
vl A(N);
vl cnt(300001);
rep(i,N){
cin >> A[i];
cnt[A[i]]++;
}
ll ans=0;
ll now=K;
rep(i,300001){
chmin(now,cnt[i]);
ans+=now;
}
cout << ans << endl;
} |
/*
_/_/_/_/ _/_/_/_/_/ _/_/_/
_/ _/ _/ _/ _/
_/ _/ _/ _/ _/
_/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/_/
_/_/_/_/ _/_/ _/_/_/_/_/
_/_/_/_/ _/ _/ _/ _/
_/ _/ _/ _/ _/_/ _/_/
_/ _/ _/_/ _/ _/_/ _/
_/ _/ _/ _/ _/ _/
_/ _/ _/_/ _/ _/
_/ _/ _/ _/ _/ _/
_/_/_/_/ _/ _/ _/ _/
_/_/_/_/_/ _/_/_/_/_/ _/_/_/_/_/
_/ _/ _/
_/ _/ _/
_/ _/ _/_/_/_/
_/ _/ _/
_/ _/ _/
_/ _/_/_/_/_/ _/_/_/_/_/
_/_/_/_/_/ _/_/_/_/_/ _/_/_/_/_/
_/ _/ _/
_/ _/ _/
_/ _/ _/_/_/_/
_/ _/ _/
_/ _/ _/
_/ _/_/_/_/_/ _/_/_/_/_/
*/
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cctype>
#include <algorithm>
#include <random>
#include <bitset>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <vector>
#include <chrono>
#include <iostream>
#include <iomanip>
#include <limits>
#include <numeric>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &x : v)
is >> x;
return is;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
if (!v.empty()) {
os << v.front();
for (int i = 1; i < v.size(); ++i)
os << ' ' << v[i];
}
return os;
}
const int P = 998244353;
int norm(int x) { return x >= P ? (x - P) : x; }
void add(int &x, int y) { if ((x += y) >= P) x -= P; }
void sub(int &x, int y) { if ((x -= y) < 0) x += P; }
void exGcd(int a, int b, int &x, int &y) {
if (!b) {
x = 1;
y = 0;
return;
}
exGcd(b, a % b, y, x);
y -= a / b * x;
}
int inv(int a) {
int x, y;
exGcd(a, P, x, y);
return norm(x + P);
}
const int N = 3010, L = 15;
int A[L], B[L];
int f[L][N];
int ans[N], q[N];
int main() {
#ifdef ELEGIA
freopen("test.in", "r", stdin);
int nol_cl = clock();
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
for (int i = 1; i != L; ++i) {
B[i] = (1 << i) - 1;
A[i] = A[i - 1] + B[i];
}
f[0][0] = 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1; A[j] <= i; ++j)
sub(f[0][i], f[j][i - A[j]]);
int j;
for (j = 1; B[j] <= i; ++j)
f[j][i] = norm(P - f[j - 1][i] + f[j][i - B[j]]);
for (; B[j] <= n; ++j)
f[j][i] = norm(P - f[j - 1][i]);
}
{
int C = 0;
for (int i = 0; C <= n; ++i, C = A[i]) {
if (i)
for (int j = B[i]; j <= n; ++j) add(f[0][j], f[0][j - B[i]]);
memset(q, 0, sizeof(q));
if (i & 1)
for (int j = 0; j <= n - C; ++j) sub(q[j + C], f[0][j]);
else for (int j = 0; j <= n - C; ++j) add(q[j + C], f[0][j]);
for (int j = 1; j <= n >> i; ++j)
add(ans[j], q[n - j * (1 << i)]);
}
}
cout << ans[k] << '\n';
#ifdef ELEGIA
LOG("Time: %dms\n", int ((clock()
-nol_cl) / (double)CLOCKS_PER_SEC * 1000));
#endif
return 0;
}
| # include <bits/stdc++.h>
# define ll long long
# define db double
# define ld long double
# define pb push_back
# define fir first
# define sec second
# define rep(i, l, r) for (int i = l; i <= r; i++)
# define per(i, r, l) for (int i = r; i >= l; i--)
using namespace std;
const int N = 200010;
typedef pair <int, int> P;
struct node {
int to, next;
} ed[N * 2];
int sz, head[N], n, k;
set <P, greater <P> > ss;
void addEdge(int from, int to) {
ed[++sz].next = head[from];
ed[sz].to = to;
head[from] = sz;
}
int read() {
int x = 0; char c = getchar(), flag = '+';
while (!isdigit(c)) flag = c, c = getchar();
while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
return flag == '-' ? -x : x;
}
// void dfs2(int u, int dis) {
// ss.erase(P(deep[u], u));
// if (!dis) return;
// for (int i = head[u]; i; i = ed[i].next) {
// int v = ed[i].to;
// // if (v == ff) continue;
// dfs2(v, dis - 1);
// }
// }
P dfs(int u, int ff, int x) {
P ss = P(0, 0);
for (int i = head[u]; i; i = ed[i].next) {
int v = ed[i].to;
if (v == ff) continue;
P tt = dfs(v, u, x);
tt.sec++;
ss.fir += tt.fir;
if (ss.sec + tt.sec < 0) ss.sec = min(ss.sec, tt.sec);
else ss.sec = max(ss.sec, tt.sec);
}
if (ss.sec == x || u == 1 && ss.sec >= 0) ss.fir++, ss.sec = -x - 1;
return ss;
}
bool check(int x){
return dfs(1, 0, x).fir <= k;
}
// void dfs1(int u, int ff) {
// deep[u] = deep[ff] + 1;
// fa[u] = ff;
// for (int i = head[u]; i; i = ed[i].next) {
// int v = ed[i].to;
// if (v == ff) continue;
// dfs1(v, u);
// }
// }
int main() {
n = read(), k = read();
rep (i, 1, n - 1) {
int u = read(), v = read();
addEdge(u, v);
addEdge(v, u);
}
//dfs1(1, 0);
int l = 0, r = n, ans = -1;
while (l <= r) {
int mid = l + r >> 1;
if (check(mid)) ans = mid, r = mid - 1;
else l = mid + 1;
}
cout << ans;
return 0;
}
/* by DT_Kang */ |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> v(n);
for (auto &x : v) cin >> x;
long long ans = 0;
sort(v.begin(), v.end());
for (long long i = 0; i < n; ++i) {
ans += i * v[i] - (n - i - 1) * v[i];
}
cout << ans;
} | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sq(x) (x)*(x)
#define PI acos(-1.0)
#define all(x) x.begin(),x.end()
#define nl '\n'
#define mod 1000000007
typedef long long int ll;
typedef unsigned long long int llu;
int main()
{
ll n;
cin>>n;
ll i,ar[n+2],br[n+3];
ll sum=0;
for(i=0;i<n;i++)cin>>ar[i];
for(i=0;i<n;i++)
{
cin>>br[i];
sum+=(ar[i]*br[i]);
}
if(sum==0)cout<<"Yes"<<nl;
else cout<<"No"<<nl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const unsigned int M = 1e9 + 7;
int32_t main() {
fastio;
int x;
cin >> x;
if(x <= 0) cout << 0;
else cout << x;
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const double pi = 3.14159265358979323846264;
inline bool chmin(ll &a, ll b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
inline bool chmax(ll &a, ll b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
T seinomi(T a)
{
if (a > 0)
{
return a;
}
else
{
return 0;
}
}
//桁数取得
template <typename T>
T ketasuu(T num)
{
return std::to_string(num).length();
}
//整数乗
ll llpow(ll a, ll n)
{
if (n == 0)
{
return 1;
}
else
{
ll rep = a;
for (ll i = 1; i < n; i++)
{
rep *= a;
}
return rep;
}
}
template <class ForwardIt, class T>
void iota(ForwardIt first, ForwardIt last, T value)
{
while (first != last)
{
*first++ = value;
++value;
}
}
template <typename T>
T amarinasi(T a, T b)
{
if (a % b == 0)
{
return a / b;
}
else if (a % b > 0)
{
return a / b + 1;
}
else
{
return a / b - 1;
}
}
//小数点以下10桁テンプレート（main関数内の最初に貼付け）
//std::cout << std::fixed << std::setprecision(10);
//----------------------------------------------------------------
int main()
{
ll x;
cin >> x;
cout << seinomi(x) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
int n,k;
char c[110];
signed main(){
n=read(),k=read();
cin>>(c+1);
for(int i=1;i<=k;i++) {
for(int j=n+1;j<=2*n;j++) c[j]=c[j-n];
for(int j=1;j<=n;j++) {
if(c[j*2-1]=='S'){
if(c[j*2]=='R') c[j]=c[j*2];
else c[j]=c[j*2-1];
}
if(c[j*2-1]=='R'){
if(c[j*2]=='P') c[j]=c[j*2];
else c[j]=c[j*2-1];
}
if(c[j*2-1]=='P'){
if(c[j*2]=='S') c[j]=c[j*2];
else c[j]=c[j*2-1];
}
}
}
cout<<c[1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
string s;
bool winner[4][4] = {{true,false,true,false},{false,false,false,false},{false,false,true,true},{true,false,false,true}};
string win;
cin >> n >> k >> s;
while(k--)
{
int len = s.size();
if(len & 1)
{
len += len;
s += s;
}
win.clear();
for(int i = 0;i < len;i+=2)
{
win += winner[s[i] - 'P'][s[i+1]-'P']?s[i]:s[i+1];
}
s = win;
}
printf("%c\n",win[0]);
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){//main_program
int H,W,X,Y;
int count = 1;
cin >> H >> W >> X >> Y;
vector<vector<char>> data(H, vector<char>(W));
for(int i = 1;i<=H;i++){
for(int l = 1;l<=W;l++){
cin >> data.at(i-1).at(l-1);
}
}
for(int i = X-2 ;i >= 0 ; i--){
if( data.at(i).at(Y-1) == '.'){
count++;
}else{
break;
}
}
//
for(int i = X ;i < H ; i++){
if( data.at(i).at(Y-1) == '.'){
count++;
}else{
break;
}
}
//
//
for(int i = Y-2 ;i >= 0 ; i--){
if( data.at(X-1).at(i) == '.'){
count++;
}else{
break;
}
}
//
for(int i = Y ;i < W ; i++){
if( data.at(X-1).at(i) == '.'){
count++;
}else{
break;
}
}
cout << count << endl;
}
| #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 200005
struct Info{
Info(){
kei = value = 0;
}
Info(double arg_kei,double arg_value){
kei = arg_kei;
value = arg_value;
}
Info operator+(const struct Info& arg) const{
return Info(kei+arg.kei,value+arg.value);
}
Info operator-(const struct Info& arg) const{
return Info(kei-arg.kei,value-arg.value);
}
Info operator/(int div) const{
return Info(kei/div,value/div);
}
double kei,value;
};
int N,M,K;
bool check[SIZE];
Info info[SIZE];
int main(){
scanf("%d %d %d",&N,&M,&K);
for(int i = 0; i <= N; i++){
check[i] = true;
}
int tmp;
for(int i = 0; i < K; i++){
scanf("%d",&tmp);
check[tmp] = false;
}
for(int i = 0; i < M; i++){
info[N+i].kei = 0;
info[N+i].value = 0;
}
Info sum;
for(int i = N-1; i >= 0; i--){
if(!check[i]){
info[i].kei = 1;
info[i].value = 0;
}else{
info[i] = sum/M + Info(0,1);
}
sum = sum+info[i];
sum = sum-info[i+M];
}
double a = info[0].kei;
double b = info[0].value;
if(1-a < EPS){
printf("-1\n");
}else{
printf("%.12lf\n",b/(1.0-a));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long rev(long long num)
{
int digit, rev = 0;
do
{
digit = num % 10;
rev = (rev * 10) + digit;
num = num / 10;
} while (num != 0);
return rev;
}
long long deleteTrail(long long num)
{
num = rev(num);
num = rev(num);
return num;
}
bool palindrom(long long num)
{
return rev(num) == num;
}
int main()
{
long long s;
cin >> s;
if (palindrom(deleteTrail(s)))
{
cout << "Yes";
}
else
{
cout << "No";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main ()
{
int i,f=0,p=0;
string s,s1;
cin>>s;
for(i=s.size()-1; i>=0; i--)
{
if(s[i]!='0')
break;
else if(s[i]=='0')
p++;
}
for(i=1; i<=p; i++)
{
s1+='0';
}
//cout<<s1<<endl;
for(i=0; i<s.size(); i++)
{
s1+=s[i];
}
//cout<<s1;
for(i=0; i < s1.size() ; i++)
{
if(s1[i] != s1[s1.size()-i-1])
{
f = 1;
break;
}
}
if(f==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0 ;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long L,S=1;cin>>L;
for(int X=1;X<12;X++){
S*=L-X;S/=X;
}
cout<<S<<endl;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define one(x) __builtin_popcountll(x)
#define zero(x) __builtin_ctzll(x)
#define pp pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define removeDuplicates(a) a.resize(unique(all(a))-a.begin())
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
typedef long long int ll;
const int mxn = 2e5 + 10;
/*
ll n,q;
ll ar[200001];
ll t[800004];
void build(ll index,ll l, ll r){
if(l==r){
t[index]=ar[l];
return ;
}
ll mid=(l+r)/2 ;
build(index*2,l,mid);
build(index*2+1,mid+1,r);
t[index]=t[index*2]^t[index*2+1];
}
void update(ll index, ll l ,ll r, ll pos, ll val){
if(pos<l || pos>r){
return;
}
if(l==r){
t[index]=val;
ar[l]=val;
return ;
}
ll mid=(l+r)/2 ;
update(index*2,l,mid,pos,val);
update(index*2+1,mid+1,r,pos,val);
t[index]=min(t[index*2],t[index*2+1]);
}
ll query(ll index,ll l, ll r, ll lq, ll rq){
if(rq<l || lq>r){
return 0;
}
if(lq<=l && r<=rq){
return t[index];
}
ll mid=(l+r)/2 ;
return query(index*2,l,mid,lq,rq)^query(index*2+1,mid+1,r,lq,rq);
}*/
//ll a[mxn];
ll dp[12];
void subMain(){
ll n;
cin >> n;
dp[0] = 1;
while(--n){
for(ll i = 10; i >= 0; i--){
dp[i+1]+=dp[i];
}
}
cout << dp[11];
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
/*ll t, i = 0;
cin >> t;
while(t--){
//cout << "Case #" << i+1 << ": ";
subMain();
//i++;
}*/
subMain();
cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define irreps(i, m, n) for (int i = ((int)(n)-1); i > (int)(m); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) (int)(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
using ld = long double;
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; }
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
const ll INF = 1e9+10;
// const ll MOD = 1e9+7;
const ll MOD = 998244353;
const ll LINF = 1e18;
// 以下の操作が行える時、SをTに一致させられるか
// 011..1 :0が連続している区間から始めて登場する1とswap
// 11..10 :逆
// まずこの操作によってある0（1でもよい）は任意の場所に移動できると気付く
// 正確には、0001100みたいに先頭から0が3個、1が2個、0が2個みたいな情報が与えられたとき、0，1の個数が一致するなら必ずそれが作れるということ
// 以下は0，1の個数が一致する場合
// s,tの0のindexをリスト化する(a,bとする)
// a[i]!=b[i]なら、明らかにs[a[i]]はいずれかの1とswapする必要があるが、この時aの他の要素が変化することはない（swapするのは1なので）
// 上記から、少なくともa[i]!=b[i]の個数だけ操作する必要があるとわかる
// どのような場合でも最適に操作すれば、上の個数回だけの操作で一致させられるか？ => 可能
// 今いくつかa[i]!=b[i]であるようなiが存在するとする
// 今移動させられるiとswapできるs[x]==1 && s[x]!=t[x]なるindex xが存在するはずで、これを適切な組合せと順序でswapしていけば（端から処理するイメージ）よい
// s=10111001
// t=01011011
// 上の例なら、今a[0]=1を見ているなら、x=0(前方)となる
// a[i]!=b[i]なるiが存在していて、1手で操作できる範囲にxが存在しないということは有り得ない
// s=101
// t=?1?
// （a,bの長さが一致するなら、0,2のいずれかは0である）tの0,2いずれを0にするとしても必ず s,tは1手で一致させられる
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
int n; cin>>n;
string s,t; cin>>s>>t;
vc<int> a,b;
rep(i,n) {
if(s[i]=='0') a.push_back(i);
if(t[i]=='0') b.push_back(i);
}
if(a.size()!=b.size()) {
cout<<-1<<endl;
return 0;
}
int ans=0;
rep(i,a.size()) if(a[i]!=b[i]) ans++;
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+1;
long long st[maxn], tot;
long long ts[maxn], cnt;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s, t;
cin >> s >> t;
for(int i = 1; i <= n; ++ i) {
if (s[i-1] == '0') st[++tot] = i;
if (t[i-1] == '0') ts[++cnt] = i;
}
if (tot != cnt) {
cout << "-1" << "\n";
}
else {
long long ans = 0;
for(int i = 1; i <= tot; ++ i) {
if (st[i] != ts[i]) ans ++;
}
cout << ans << "\n";
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using P = pair<ll,ll>;
const int mod=998244353;
const int INF=1001001001;
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i&-i) {
x += d[i];
}
return x;
}
T sum(int l, int r) {
return sum(r-1) - sum(l-1);
}
};
int main() {
int N;
cin>>N;
vector<int>a(N);
rep(i,N){cin>>a[i];}
BIT<int>d(N);
ll sum=0;
rep(i,N){
sum+=d.sum(a[i]+1,N);
d.add(a[i]);
}
rep(i,N){
cout<<sum<<endl;
sum=-a[i]+N-1-a[i]+sum;
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#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;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
int main()
{
long long n;
cin>>n;
long long int a[n];
long long int c[200];
for (int i=0;i<200;i++)
c[i]=0;
for (int i=0;i<n;i++)
{
cin>>a[i];
int m=a[i]%200;
c[m]++;
}
long long int count=0;
for (int i=0;i<200;i++)
{
count=count+(c[i]*(c[i]-1)/2);
}
cout<<count<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e3+9;
const int MAX=6e5+9;
const int MAX1=5e6+9;
const int INF=0x3f3f3f3f;
const double ep=1e-8;
const double ep1=1e-4;
const int mod=998244353;
const double inf=1e20;
const double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) cout<<"##"<<(x)<<endl;
#define mk make_pair
#define PII pair<int,int>
#define PDI pair<double,int>
#define PIII pair<int,PII >
#define PIII1 pair<PII,int>
#define PIIII pair<PII,PII >
#define PIL pair<int,ll>
#define PLI pair<ll,int>
#define PLIII pair<PLI,PII >
#define PLL pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dep(i,a,b) for(int i=(a);i>=(b);--i)
#define sd(x) scanf("%d",&(x))
#define slld(x) scanf("%lld",&(x))
#define sdd(x,y) scanf("%d%d",&(x),&(y))
#define sc(s) scanf("%s",(s))
#define pd(x) printf("%d\n",(x))
#define plld(x) printf("%lld\n",(x))
#define pdk(x) printf("%d ",(x))
#define plldk(x) printf("%lld ",(x))
#define pdd(x,y) printf("%d %d\n",(x),(y))
#define PR(x) printf("Case %d: ",(x))
#define INF 0x3f3f3f3f
typedef unsigned long long ull;
/*
*/
struct node{
int to,nex;
ll val;
}a[maxn];
int n,m;
int head[maxn],cnt;
void add(int fro,int to,ll val)
{
a[++cnt].to=to;
a[cnt].val=val;
a[cnt].nex=head[fro];
head[fro]=cnt;
}
ll d[maxn];
void bfs(int x)
{
priority_queue<PLI,deque<PLI >,greater<PLI > >q;
q.push(mk(0,x));
bool ju=0;
while(!q.empty())
{
PLI p=q.top();q.pop();
int cur=p.se;
ll val=p.fi;
if(cur==x&&val)
{
plld(val);
return;
}
// cout<<cur<<' '<<val<<endl;
for(int i=head[cur];i;i=a[i].nex)
{
int to=a[i].to;
// cout<<to<<' '<<a[i].val<<' '<<d[to]<<endl;
if(val+a[i].val<d[to])
{
d[to]=val+a[i].val;
q.push(mk(d[to],to));
// if(to==x)ju=1;
}
}
}
puts("-1");
}
void solve()
{
sdd(n,m);
rep(i,1,m)
{
int u,v;
ll w;
sdd(u,v);
slld(w);
add(u,v,w);
}
rep(i,1,n)
{
memset(d,INF,sizeof d);
bfs(i);
}
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);
int T=1;
// sd(T);
while(T--)solve();
}
| #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = { 0, 1, 0,-1};
const int INF = 1e9;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(),a.end())
#define REVERSE(a) reverse(a.begin(),a.end())
int guki (int a){
if(a%2==0) return 0;
else return 1;
}
int gcd(int a, int b){
if(a%b==0){
return b;
}else{
return (gcd(b,a%b));
}
}
int lcm(int a, int b){
int x = gcd(a,b);
return (a*b/x);
}
using namespace std;
// now
struct UnionFind {
vector<int> d;
UnionFind(int n=0) : d(n,-1){}
int Find (int x){//根の番号を探す
if(d[x] < 0) return x;
return d[x] = Find(d[x]);
}
bool unite (int x, int y){
x = Find(x); y = Find(y);
if(x == y ) return false;
if(d[x] < d[y]){
swap(x,y);
}
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y){
return Find(x) == Find(y);
}
int size(int x) {
return (-d[Find(x)]);
}
};
ll nCr (ll n, ll r){
ll ans = 1;
for(ll i = n ; i > n-r ; i --){
ans *= i;
}
for(ll i = 1 ; i<= r; i ++){
ans /= i;
}
return ans ;
}
int nPr (int n,int r){
int ans = 1;
for(int i = n ; i > n-r ; i --){
ans *= i;
}
return ans ;
}
int main(){
int n,m;
cin >> n >> m;
map<int,int> mp;
REP(i,n){
int x;
cin >> x;
mp[x]++;
}
REP(i,m){
int x;
cin >> x;
mp[x]++;
}
for(auto x:mp){
if(x.second != 2){
cout << x.first << " ";
}
}
cout << endl;
}
//500000500000
//963761198400
//4500001500000
//505013002500
|
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
typedef long long ll;
const ll mod = 1e9 + 7;
string s;
int k, a[N], n;
int work(int x) {
int ans = 0;
while (x) {
if (x & 1) ans++;
x = x / 2;
}
return ans;
}
ll dp[N][20];
ll dfs(int p, int stat, int limit) {
int cnt = work(stat);
// cout << p << " " << cnt << " " << stat << endl;
if (cnt > k) return 0;
if (p == n) {
if (cnt == k) return 1;
return 0;
}
if (!limit && dp[p][cnt] != -1) return dp[p][cnt];
int maxn = 15;
if (limit) {
maxn = a[p];
}
ll ans = 0;
for (int i = 0; i <= maxn; i++) {
ans += dfs(p + 1, stat | (1 << i), limit && i == maxn);
ans = ans % mod;
}
if (!limit) dp[p][cnt] = ans;
return ans;
}
void solve() {
ll ans = 0;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++) {
int maxn = 15;
if (i == 0) {
maxn = a[0];
}
// cout << "Maxn " << maxn << endl;
for (int j = 1; j <= maxn; j++) {
ans += dfs(i + 1, (1 << j), i == 0 && j == maxn);
ans = ans % mod;
}
}
cout << ans << endl;
}
int main() {
cin >> s >> k;
n = s.length();
for (int i = 0; i < s.length(); i++) {
if (s[i] >= '0' && s[i] <= '9') {
a[i] = s[i] - '0';
} else {
a[i] = s[i] - 'A' + 10;
}
}
solve();
}
| #include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll f[200010][17][2][2],ans;int k,n,a[200010];
char s[200010];
int num(int x)
{
if(s[x]<='9'&&s[x]>='0') return s[x]-'0';
return s[x]-'A'+10;
}
ll dfs(int pos,int st,int maxx,bool zero)
{
int cnt=__builtin_popcount(st);
if(pos>n) return cnt==k;
if(cnt>k) return 0ll;
if(pos>n) return cnt==k&&!zero;
if(f[pos][cnt][maxx][zero]!=-1) return f[pos][cnt][maxx][zero];
int to=maxx?a[pos]:15;
ll ans=0;
for(int i=0;i<=to;i++)
if(!i&&zero) ans=(ans+dfs(pos+1,0,0,1))%mod;
else ans=(ans+dfs(pos+1,st|(1<<i),maxx&&i==to,0))%mod;
f[pos][cnt][maxx][zero]=ans;
return ans;
}
int main()
{
scanf("%s %d",s+1,&k);
n=strlen(s+1);
for(int i=1;i<=n;i++)
a[i]=num(i);
memset(f,-1,sizeof(f));
printf("%lld",dfs(1,0,1,1));
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
using C = complex<double>;
C inC() {
double x, y;
cin >> x >> y;
return C(x, y);
}
int main() {
int n;
cin >> n;
C s = inC();
C t = inC();
C o = (s + t) / 2.0; //原点
double PI = acos(-1);
double rad = 2 * PI / n; //ラジアン
C r(cos(rad), sin(rad)); //距離1、偏角?
//(s - o)逆ベクトル?、(*r)反時計回りの角度を足す(距離はそのまま)
//(+o)出来たベクトルを原点に合わせる?
C ans = (s - o) * r + o;
cout << fixed << setprecision(11) << ans.real() << " ";
cout << fixed << setprecision(11) << ans.imag() << endl;
return 0;
}
//難しい! 複素数! ラジアン! それらのライブラリ! ベクトル!
// int main() {
// int n;
// cin >> n;
// double x, y;
// complex<double> a, b;
// cin >> x >> y, a = {x, y}; //複素数オブジェクトの初期化
// cin >> x >> y, b = {x, y};
// auto m = (a + b) / 2.0;
// auto res = m + (a - m) * polar(1.0, M_PI * 2.0 / n);
// // polar(r, t)長さr,角度(ラジアン)tの複素数
// // M_PIでPIが取れる!!
// cout << fixed << setprecision(11) << res.real() << " " << res.imag() <<
// endl;
// }
// using C = complex<double>; //複素数ライブラリ
// C inC() {
// double x, y;
// cin >> x >> y;
// return C(x, y); // C(実部, 虚部)複素数オブジェクト
// }
// int main() {
// int n;
// cin >> n;
// C s = inC();
// C t = inC();
// C o = (s + t) / 2.0; //中心点を取る
// double PI = acos(-1); //これでPIが取れる!!
// // cout << PI << endl;
// double rad = 2 * PI / n;
// // cout << rad << endl;
// // n=4 Π=90° rad=1.5708.. /n=6 Π=60° rad=1.0472..
// C r(cos(rad), sin(rad));
// // cout << "cos(rad) " << cos(rad) << ", sin(rad) " << sin(rad) << endl;
// // n=4 r(6.123.. , 1) / n=6 r(0.5, 0.866..)
// C ans = o + (s - o) * r;
// //
// s-oでoからsへ伸びるベクトルが得られ、それを2π/nだけ回転したベクトルを、mに足す
// cout << fixed << setprecision(11) << ans.real() << " " << fixed
// << setprecision(11) << ans.imag() << endl;
// return 0;
// }
| #define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repr(i, n) for(int i = ((int)(n) - 1); i >= 0; i--)
#define repn(i, n) for(int i = 1; i <= (int)(n); i++)
#define reprn(i, n) for(int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LARGE_PRIME_NUM (1e9+7)
typedef long long ll;
#include <iostream>
#include <array>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * 2 + 100 - b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
#define ll long long
ll pwmd(ll a, ll n) {
if(n == 0) return 1;
ll tmp = pwmd(a, n / 2);
tmp = (tmp * tmp) % MOD;
return (n % 2 == 0 ? tmp : tmp * a % MOD);
}
int main() {
ll n, m, k; cin >> n >> m >> k;
vector<ll> fact(n + m + 2, 1);
for(int i = 1;i < n + m + 2;++i) fact[i] = (fact[i - 1] * i) % MOD;
if(n > m + k) {
cout << 0 << '\n';
return 0;
}
ll ans = fact[m + n] * pwmd(fact[m] * fact[n] % MOD, MOD - 2) % MOD;
if(n == k) {
cout << ans << '\n';
return 0;
}
ans -= fact[m + n] * pwmd(fact[m + k + 1] * fact[n - k - 1] % MOD, MOD - 2) % MOD;
ans %= MOD;
ans = (ans + MOD) % MOD;
cout << ans << '\n';
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 Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;
ll mod = 1000000007;
template< typename flow_t >
struct Dinic {
const flow_t INF;
struct edge {
int to;
flow_t cap;
int rev;
bool isrev;
int idx;
};
vector< vector< edge > > graph;
vector< int > min_cost, iter;
Dinic(int V) : INF(numeric_limits< flow_t >::max()), graph(V) {}
void add_edge(int from, int to, flow_t cap, int idx = -1) {
graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});
graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});
}
bool bfs(int s, int t) {
min_cost.assign(graph.size(), -1);
queue< int > que;
min_cost[s] = 0;
que.push(s);
while(!que.empty() && min_cost[t] == -1) {
int p = que.front();
que.pop();
for(auto &e : graph[p]) {
if(e.cap > 0 && min_cost[e.to] == -1) {
min_cost[e.to] = min_cost[p] + 1;
que.push(e.to);
}
}
}
return min_cost[t] != -1;
}
flow_t dfs(int idx, const int t, flow_t flow) {
if(idx == t) return flow;
for(int &i = iter[idx]; i < graph[idx].size(); i++) {
edge &e = graph[idx][i];
if(e.cap > 0 && min_cost[idx] < min_cost[e.to]) {
flow_t d = dfs(e.to, t, min(flow, e.cap));
if(d > 0) {
e.cap -= d;
graph[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
flow_t max_flow(int s, int t) {
flow_t flow = 0;
while(bfs(s, t)) {
iter.assign(graph.size(), 0);
flow_t f = 0;
while((f = dfs(s, t, INF)) > 0) flow += f;
}
return flow;
}
void output() {
for(int i = 0; i < graph.size(); i++) {
for(auto &e : graph[i]) {
if(e.isrev) continue;
auto &rev_e = graph[e.to][e.rev];
cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << e.cap + rev_e.cap << ")" << endl;
}
}
}
};
//mod逆元
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
//Combination2
//10^6くらいまで
//modはグローバルに定義しておく
vector<ll> fact;
vector<ll> invf;
ll comb(ll n,ll k){
if(n<0||k<0||k>n) return 0LL;
else{
ll a = fact[n]*invf[k]%mod;
a = a*invf[n-k]%mod;
return a;
}
}
int main() {
ll B,W,K; cin >> W >> B >> K;
if(W-B>=K+1){
cout << 0 << endl; return 0;
}
//main関数内に以下ペースト
//N:max
ll N = B+W+2;
fact.assign(N+1,1LL);
invf.assign(N+1,1LL);
rep(i,N) fact[i+1] = fact[i]*(i+1)%mod;
rep(i,N+1) invf[i] = modinv(fact[i],mod);
ll ans = (comb(B+W,B)+1000*mod-comb(B+W,B+K+1))%mod;
if(K==W) ans = comb(B+W,B)%mod;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, k;
vector<int> g[maxn];
int limit;
int used;
// farthest needs, town reach
pair<int,int> dfs(int at, int p=0) {
int needs = 0;
int town = -1;
if (at==1) {
for (int to: g[at]) {
if (to==p) continue;
auto rec = dfs(to, at);
needs = max(needs, rec.first);
town = max(town, rec.second);
}
if (town < needs) {
used++;
}
return {needs, town};
} else {
for (int to: g[at]) {
if (to==p) continue;
auto rec = dfs(to, at);
needs = max(needs, rec.first);
town = max(town, rec.second);
}
if (town >= needs) {
needs = 0;
} else {
if (needs == limit) {
used++;
needs = 0;
town = limit;
} else {
needs++;
}
}
town--;
return {needs, town};
}
}
bool test(int L) {
limit = L;
used = 0;
dfs(1);
return used <= k;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>k;
for (int i=0; i<n-1; i++) {
int u,v; cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
// for (int i=0; i<=n; i++) {
// cout<<i<<": "<<dfs(1,0,i).second<<endl;
// }
int lo = -1;
int hi = n+10;
while (hi-lo>1) {
int mid=(lo+hi)/2;
if (test(mid)) {
hi = mid;
} else {
lo = mid;
}
}
out(hi);
return 0;
}
| /* ** ** ****** ****** ****** ** ****** ***
** ** ** ** ** ** ** ** ** ** ** *********
**\../** ****** ****** ** ** ****** ** ** ***
** ** ** ** ** ** ** ** ** ** ** ** *****
** ** ** ** ** ** ** ****** ****** ****** *****
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define PI 3.14159265358979323846
#define lp(i,n) for(int i = 0; i <n;i++)
#define rlp(i,n) for(int i = int(n);i >= 0;i--)
#define range(i,a,b) for(int i = int(a);i <= int(b);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define MP make_pair
#define fr first
#define sc second
#define vt vector
#define sz(v) ((int)((v).size()))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
template<class T> using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll MOD = 1e9 + 7;
const int OO = (int)1e6;
const int N = (int)1e6;
int dx[] = {0,0,-1,1};
int dy[] = {1,-1,0,0};
void init(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
for(auto& a:x)
read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
for(auto& a:x)
read(a);
}
vector<pair<int,int>>adj[N];
int label[N],vis[N];
void dfs(int u,int l){
label[u]=l;
vis[u]=1;
for(auto child:adj[u]){
int v = child.fr,c = child.sc;
if(!vis[v]){
if(label[u]==c){
if(label[u]==1){
dfs(v,2);
}else{
dfs(v,1);
}
}else{
dfs(v,c);
}
}
}
}
void _run(){
int n,m;
read(n,m);
lp(i,m){
int x,y,c;
read(x,y,c);
adj[x].pb({y,c});
adj[y].pb({x,c});
}
dfs(1,1);
range(i,1,n){
cout<<label[i]<<endl;
}
}
int main() {
# ifdef LOCAL_PROJECT
freopen("in.txt", "r", stdin);
# endif
init();
int t=1;
// read(t);
while(t--)_run();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll minimum = min(a,b);
minimum = min(minimum,c);
minimum = min(minimum,d);
cout<<minimum<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1000000007;
using ll = long long;
long long pow(long long x,long long n){
long long ans = 1;
while(n != 0){
long long a = x;
long long z = 1;
while(z*2 <= n){
a *=a;
a=a%mod1;
z*=2;
}
ans*=a;
ans=ans%mod1;
n-=z;
}
return ans;
}//累乗 x^n
template<typename T>
void input_vec(vector<T> &A,long long N){
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
return;
}//入力を配列で受け取る
template<typename T>
void output_vec(vector<T> &A,long long N){
for(int i = 0; i < N; i++){
if(i != 0){
cout << " ";
}
cout << A.at(i);
}
cout << endl;
return;
}//配列を出力
template<typename T>
long long count_vec(vector<T> &A,T x){
long long counter = 0;
for(int i = 0; i < (int)A.size(); i++){
if(A.at(i) == x){
counter++;
}
}
return counter;
}//配列内のxの個数をreturn
vector<char> change_vec(string s,int n){
vector<char> ans(n);
for(int i = 0; i < n; i++){
ans.at(i) = s.at(i);
}
return ans;
}//文字列を配列に変換
int main(){
vector<ll> a(4);
for(int i = 0; i < 4; i++){
cin >> a.at(i);
}
ll small = mod1;
for(int i = 0; i < 4; i++){
small = min(small,a.at(i));
}
cout << small << endl;
}
|
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1e18+7;
ll ceildiv(ll a, ll b) { return (a+b-1)/b; } // 切り上げ
ll floordiv(ll a, ll b) { return a/b; } // 切り下げ
int show_matrix(vector<vector<int>> &dp) {
loop(0, dp.size(), i) {
loop(0, dp[i].size(), j) {
cout << dp[i][j] << " ";
}
cout << endl;
}
return 0;
}
/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N);
ll cmax = -1;
loop(0, N, i) {
cin >> A[i];
}
vector<ll> C(N+1);
vector<ll> M(N+1);
loop(0, N, i) {
C[i+1] = C[i] + A[i];
M[i+1] = max(M[i], A[i]);
}
ll sum = 0;
loop(0, N, i) {
ll res = sum + C[i+1] + M[i+1] * (i+1);
print(res)
sum = sum + C[i+1];
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const string a = "atcoder";
void solve(){
string s;
cin >> s;
if(s > a){
cout << 0 << endl;
return;
}
string t = s;
sort(t.rbegin(), t.rend());
if(t <= a){
cout << -1 << endl;
return;
}
int ans = 0, i = 0;
while(s[i] == 'a') i++;
while(s <= a){
swap(s[i], s[i-1]);
i--;
ans++;
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
rep(i,t) solve();
} |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
using namespace std;
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
typedef long long lli;
typedef pair<int,int> ii;
typedef vector<int> vi;
#define deb(x) cout << #x": " << (x) << endl;
lli gcd(lli a, lli b){return (b?gcd(b,a%b):a);}
lli lcm(lli a, lli b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
int popcount(lli x) { return __builtin_popcountll(x); }
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// int rnd(int n){return uniform_int_distribution<int>(0, n-1)(rng);}
lli poww(lli a, lli b){
lli res =1;
while(b){ if(b&1) res = res * a; a = a*a; b/=2; }
return res;
}
vvc<int> graph(int n, int m, bool dir=1){
vv(int,v,n+1,0);
fore(i,0,m){
int a,b; cin>>a>>b;
v[a].pb(b);
if(dir)v[b].pb(a);
}
return v;
}
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
// ---- コーディングはここから！ ('-')7
void solve(){
int n,m; cin>>n>>m;
vv(int,v,n,n,inf<int>);
fore(i,0,m){
int a,b,c; cin>>a>>b>>c;a--,b--;
v[a][b]=min(v[a][b],c);
}
vv(ii,g,n+1);
fore(i,0,n)fore(j,0,n)if(v[i][j]!=inf<int>)g[i].pb({j,v[i][j]});
auto dij=[&](int a){
using pp = pair<int,lli>;
priority_queue<pp>q;
q.push({0,n});
g[n]=g[a];
vc<lli>dp(n+1,inf<lli>);
dp[n]=0;
while(!q.empty()){
auto p=q.top(); q.pop();
auto [y,x]=p;
y*=-1;
if(y!=dp[x])continue;
if(x==a)return y;
for(auto [i,j]:g[x])if(dp[i]>y+j){
dp[i]=y+j;
q.push({-dp[i],i});
}
}
return -1;
};
fore(i,0,n)cout<<dij(i)<<ENDL;
}
int main(){_
//int t; cin>>t; while(t--)
solve();
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, x;
cin>>n>>x;
string s;
cin>>s;
for(char c : s){
if(c == 'o'){
x++;
}
else{
x = max(0, x-1);
}
}
cout<<x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inline void RI(i64 &i) {scanf("%lld", &(i));}
inline void RVI(vi &v) { for(i64 i=0;i<sz(v);++i) { RI(v[i]); } }
inline void RVVI(vvi &vv) { for(i64 i=0;i<sz(vv);++i) { RVI(vv[i]); } }
inline void WI(const i64 &i) {printf("%lld\n", i);}
inline void WVI(const vi &v, char sep=' ') { for(i64 i=0;i<sz(v);++i) { if(i != 0){ printf("%c", sep); } printf("%lld", v[i]);} printf("\n"); }
inline void WS(const string &s) { printf("%s\n", s.c_str()); }
inline void WB(bool b, const string &yes, const string &no) { if(b){ WS(yes);} else { WS(no);} }
inline void YESNO(bool b) { WB(b, "YES", "NO"); }
inline void YesNo(bool b) { WB(b, "Yes", "No"); }
#define BUF_LENGTH 1000000
inline void RS(string &s) {static char buf[BUF_LENGTH]; scanf("%s", buf); s = buf;}
template<typename T> inline bool IN(T &S, const typename T::key_type &key) {
return S.find(key) != S.end();
}
template<typename T> inline bool ON(const T &b, i64 idx) {
return ((T(1) << idx) & b) != 0;
}
double sq(double d) {
return d * d;
}
int main(int argc, char *argv[]) {
i64 i, j, k;
i64 N; RI(N);
i64 Ma, Mb, Mc, Md;
Ma = Mb = Mc = Md = 0;
using ppi = pair<pi, pi>;
vector<ppi> P(N);
REP(0, N, i) {
i64 a, b; RI(a); RI(b);
a *= N;
b *= N;
Ma += a;
Mb += b;
P[i].first = {a, b};
}
REP(0, N, i) {
i64 c, d; RI(c); RI(d);
c *= N;
d *= N;
Mc += c;
Md += d;
P[i].second = {c, d};
}
Ma /= N;
Mb /= N;
Mc /= N;
Md /= N;
REP(0, N, i) {
P[i].first.first -= Ma;
P[i].first.second -= Mb;
P[i].second.first -= Mc;
P[i].second.second -= Md;
}
const double eps = 1e-3;
if(N == 1) {
WS("Yes");
return 0;
}
i64 i0;
REP(0, N, i0) {
i64 a = P[i0].first.first;
i64 b = P[i0].first.second;
i64 n1 = a * a + b * b;
if(n1 > 0) {
break;
}
}
assert(i0 != N);
i64 a = P[i0].first.first;
i64 b = P[i0].first.second;
i64 n1 = a * a + b * b;
REP(0, N, i) {
i64 c = P[i].second.first;
i64 d = P[i].second.second;
i64 n2 = c * c + d * d;
// cerr << n1 << " "<< n2 << endl;
if(n1 != n2) {
continue;
}
// cerr << a << " " << b << " " << c << " " << d << " " << endl;
double r1 = atan2(b, a);
double r2 = atan2(d, c);
double delta = r2 - r1;
double cd = cos(delta), sd = sin(delta);
bool valid = true;
// cerr << i << " " << delta << endl;
REP(0, N, j) {
i64 aa = P[j].first.first;
i64 bb = P[j].first.second;
double d_min = 1e10;
double a2c = aa * cd - bb * sd;
double b2d = bb * cd + aa * sd;
REP(0, N, k) {
i64 cc = P[k].second.first;
i64 dd = P[k].second.second;
double d = sq(cc - a2c) + sq(dd - b2d);
d_min = min(d, d_min);
}
if(d_min > eps) {
valid = false;
}
}
if(valid) {
WS("Yes");
return 0;
}
}
WS("No");
return 0;
}
| #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <complex>
#include <ctime>
#include <bitset>
// #include <atcoder/all>
#include <fstream>
#include <random>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
// using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e9;
//マクロ定義
#define vvint(vec,n,m,l) vector<vector<int>> vec(n, vector<int>(m,l)); // lで初期化
#define vvll(vec,n,m,l) vector<vector<ll>> vec(n,vector<ll>(m,l));
#define vint vector<int>
#define pint pair<int,int>
#define rep(i,a) for(ll i=0;i<(a);i++)
#define all(x) (x).begin(),(x).end()
#define debug system("pause") //デバッグ用
#define ret return 0
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
#define ketasitei setprecision(15) //15桁表示
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const double PI = 3.1415926535897932;
using Graph = vector<vector<ll>>;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << ketasitei;
ll m, h;
cin >> m >> h;
if (h % m == 0) {
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
} |
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define DEBUG_PRINT(n) \
(cout << "L" << __LINE__ << " " << #n << " = " << n << endl)
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using std::map;
using std::vector;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b)
cout << c << endl;
else if (a == c)
cout << b << endl;
else if (b == c)
cout << a << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const unsigned int M = 1e9 + 7;
int32_t main() {
fastio;
int n, a, b;
cin >> n >> a >> b;
cout << (n - a) + b;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100006];
int main ()
{
int n,m,k;
cin>>n>>m>>k;
for (int i=1;i<=2*m;i++)
cin>>a[i];
sort(a+1,a+2*m+1);
a[0]=0,a[2*m+1]=k;
int t=2*m+1;
int ans=n;
for (int i=1;i<=t;i++){
if(i%2) ans-=a[i]-a[i-1];
else ans=min(n,ans+a[i]-a[i-1]) ;
if (ans<=0) {
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double N, D, H; //Nこ D離れてHの高さ
cin >> N >> D >> H;
vector<pair<int, int>> dh(N);
for(int i = 0; i < N; i++)
cin >> dh.at(i).first >> dh.at(i).second; //fin
double ans=0;
for(int i = 0;i < N; i++) {
double k;
k = H-((H-dh.at(i).second)/(D-dh.at(i).first))*D;
ans = max(k, ans); }
cout << fixed << setprecision(15) << ans << endl;
} |
#include<bits/stdc++.h>
#include<cstring>
using namespace std;
#define PMax 100000000
#define GNode 100
using ll= long long;
map<string ,int> chk;
int main()
{
ll tc;
cin>>tc;
int flg=0;
string s,ans;
while(tc--){
cin>>s;
if(s[0]=='!'){
s.erase(0, 1);
if(chk[s]==1){
flg=1;
ans=s;}
else{
chk[s]=2;
}
}
else{
if(chk[s]==2){
flg=1;
ans=s;
}
else{
chk[s]=1;
}
}
}
if(flg) {cout<<ans<<endl;}
else {cout<<"satisfiable"<<endl;}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
set<int> a;
rep(i,n) {
int p;
cin >> p;
a.insert(p);
}
while(1){
int max = *a.rbegin();
int min = *a.begin();
if(max == min) break;
a.erase(max);
a.insert(max - min);
/*
cout << " " << endl;
cout << max << endl;
cout << min << endl;
*/
}
cout << *a.begin() << endl;
} |
/*/
Author: _Math.man
"Everything in this world is magic, except to the magician"
/*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for(int i =0 ;i <n;i++)
#define fn1 for( int i =1;i<=n; i++)
#define fm for(int j =0 ;j <m;j++)
#define fm1 for(int j =1;j<=m;j++)
#define fi first
#define se second
#define endl '\n'
#define PI 3.14159265358979323846
#define MOD 1000000007
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
const int N = 2e6+5;
const int INF = 1e18L;
// for all eight directions
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
// for all 4 directions
//int dx[4]={-1,1,0,0};
//int dy[4]={0,0,-1,1};
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/*/-----------------------------Debug begins----------------------------------/*/
vector<string> split(const string& s, char c) {
vector<string> v; stringstream ss(s); string x;
while (getline(ss, x, c)) v.emplace_back(x); return move(v);
}
template<typename T, typename... Args>
inline string arrStr(T arr, int n) {
stringstream s; s << "[";
for(int i = 0; i < n - 1; i++) s << arr[i] << ",";
if(n>0)
s << arr[n - 1] ;
s<< "]";
return s.str();
}
#define trace(args...) {__trace_begin(__LINE__); __trace(split(#args, ',').begin(), args);}
inline void __trace_begin(int line) { cerr << "#" << line << ": "; }
template<typename T> inline void __trace_out_var(vector<T> val) { cerr << arrStr(val, val.size()); }
template<typename T> inline void __trace_out_var(T* val) { cerr << arrStr(val, 10); }
template<typename T> inline void __trace_out_var(T val) { cerr << val; }
inline void __trace(vector<string>::iterator it) { cerr << endl; }
template<typename T, typename... Args>
inline void __trace(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__trace_out_var(a);
cerr << "; ";
__trace(++it, args...);
}
/*/-----------------------------Code begins----------------------------------/*/
int ar[N];
int dp[N];
bool ok(int n){
int m = n;
while(n){
if(n%10==7)return 0;
n/=10;
}
n = m;
while(n){
if(n%8==7)return 0;
n/=8;
}
return 1;
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
IOS;
int T=1;
// cin >> T;
while(T--){
int n;
cin >> n ;
int ans=0;
fn1{
ans+=ok(i);
}
cout << ans <<'\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define sorts(s) sort(s.begin(), s.end())
#define sortu(s) sort(s.begin(), s.end(), greater<>())
typedef long long int ll;
using Graph = vector<vector<int>>;
int main(void) {
int i, j, k;
int N;
cin >> N;
vector<int> T(N); int sum = 0;
rep(i, N) {
cin >> T[i];
sum += T[i];
}
int half = (sum / 2);
vector<vector<int>> dp(N+1, vector<int>(half+1, 0));
rep(i, N) {
for (j = 0; j <= half; ++j) {
if (j >= T[i]) {
dp[i+1][j] = max(dp[i][j-T[i]] + T[i], dp[i][j]);
} else {
dp[i+1][j] = dp[i][j];
}
}
}
int ans = sum - dp[N][half];
cout << ans << endl;
//cout << fixed << setprecision(3) << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#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 Clear(a) a = decltype(a)()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define vec vector
typedef long long ll;
typedef pair<ll,ll> P;
const double PI=acos(-1);
//const ll big=998244353;
const ll big=1000000007LL;
const ll INF=1e18;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll max(ll x,ll y){
if(x>y)return x;
else return y;
}
ll min(ll x,ll y){
if(x<y)return x;
else return y;
}
ll expm(ll x,ll y){
if(y==0)return 1;//0^0=1
if(x==1||x==0)return x;
if(y%2==1)return (expm(x,y-1)*x)%big;
ll t=expm(x,y/2);
return (t*t)%big;
}
ll exp(ll x,ll y){
if(y==0)return 1;//0^0=1
if(x==1||y==0)return x;
if(y%2==1)return exp(x,y-1)*x;
ll t=exp(x,y/2);
return t*t;
}
int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
int n,m;cin >> n >> m;
if(n==1 && m==0){
cout << "1 2" << endl;return 0;
}
if(m==n || m<0 || m+1==n){
cout << -1 << endl;
return 0;
}
if(m==0){
rep(i,n)cout << 3*i+1 << ' ' << 3*i+2 << endl;
return 0;
}
int l=m+1;
int k=n-l-1;
rep(i,k){
cout << 3*i+1+1 << ' ' << 3*i+1+1+1 << endl;
}
rep(i,l){
cout << 3*k+3*i+1+1 << ' ' << 3*k+3*i+1+1+1 << endl;
}
cout << 3*k+1 << ' ' << 100000000 << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(vec) vec.begin(), vec.end()
#define allr(vec) vec.rbegin(), vec.rend()
#define CST(x) cout << fixed << setprecision(x)
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
using ll = long long;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vi = vector<int>;
using vll = vector<ll>;
//------
void _main() {
int a, b; cin >> a >> b;
if (a + b >= 15 && b >= 8) {
cout << 1 << endl;
} else if (a + b >= 10 && b >= 3) {
cout << 2 << endl;
} else if (a + b >= 3) {
cout << 3 << endl;
} else {
cout << 4 << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 2e9;
int main(){
ll n,x;
cin >> n >> x;
vector<pair<ll,ll>> events;
rep(i,n){
ll a,b,c;
cin >> a >> b >> c;
events.emplace_back(a,c);
events.emplace_back(b+1,-c);
}
sort(events.begin(),events.end());
ll ans = 0,s = 0,pre = 0;
for(auto event : events){
ans += min(x,s)*(event.first - pre);
s += event.second;
pre = event.first;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define con(typ) const typ
typedef long long ll;
template<typename T>void sf(T &x){x=0;T f=0;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')f=1;for(;c>='0'&&c<='9';c=getchar())x=(x<<3)+(x<<1)+(c^'0');if(f)x=-x;}
template<typename T>void pf(T x,char l='\n'){static int s[100],t;if(x<0)putchar('-'),x=-x;do s[++t]=x%10,x/=10;while(x);while(t)putchar(s[t--]^'0');putchar(l);}
int main()
{
int a,b,c;
sf(a),sf(b),sf(c);
pf(3*7-a-b-c);
return 0;
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 998244353;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : " << x.second << ")" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "["; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "]"; return o;}
ostream &operator<<(ostream &o, const string &obj) {o << "\""; o << obj.c_str(); o << "\""; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "(" << obj.first << ", " << obj.second << ")"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print_sim_py(void) {cout << endl;}
template <class Head> void print_sim_py(Head&& head) {cout << head;print_sim_py();}
template <class Head, class... Tail> void print_sim_py(Head&& head, Tail&&... tail) {cout << head << " ";print_sim_py(forward<Tail>(tail)...);}
#define print(...) print_sim_py(__VA_ARGS__);
#else
#define print(...);
#endif
template <typename... Ts>
std::istream& IN(Ts&... xs){ return (std::cin >> ... >> xs); }
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rrepr(i, a, b) for (int i = b; i >= a; i--)
#define Rrep(i, n) for (int i = n-1; i >= 0; i--)
bool dfs(ll p, vector<vector<ll>>& v,vector<ll>& fin_list, vector<ll>& cv,ll c, ll depth){
bool closed = false;
if(fin_list[p]){
if(depth >= 3) return true;
else return false;
}
cv[p] = c;
fin_list[p] = 1;
rep(i, v[p].size()){
if(v[p][i]){
closed |= dfs(i, v, fin_list, cv, c, depth+1);
}
}
return closed;
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
IN(n);
vector<ll> t(n);
ll tm_sum = 0;
rep(i,n){
IN(t[i]);
tm_sum += t[i];
}
vector<vector<ll>> dp(n+1,vector<ll>(tm_sum/2+1,0));
rep(i,n){
rep(j,tm_sum/2+1){
if(j >= t[i]) dp[i+1][j] = max(dp[i][j-t[i]]+t[i], dp[i][j]);
else dp[i+1][j] = dp[i][j];
}
}
ll ans = tm_sum - dp[n][tm_sum/2];
//print(dp)
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int mod=1000000007;
#define int long long
#define Fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define endl "\n"
#define vmin *min_element
#define vmax *max_element
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define mp make_pair
#define yy cout<<"YES"<<endl
#define nn cout<<"NO"<<endl
#define nores cout<<"-1"<<endl
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define prec(x) fixed<<setprecision(x)
#define ppb pop_back
#define gcd(a,b) __gcd(a,b)
#define si set<int>
#define maxh priority_queue<int>
#define minh priority_queue<int,vector<int>,greater<int> >
signed main(){
Fastio ;
// int t ; cin>>t;
// while(t--)
// {
int n; cin>>n;
vi v(n);
int s=0;
for(int i=0;i<n;i++){
cin>>v[i];
s=s+v[i];
}
bool dp[n+1][s+1];
for(int i=0;i<=n;i++)
{
for(int j=0;j<=s;j++)
{
if(i==0) dp[i][j]=false;
else if(j==0) dp[i][j]=true;
}
}
dp[0][0]=true;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=s;j++)
{
if(j>=v[i-1])
dp[i][j]=(dp[i-1][j-v[i-1]] or dp[i-1][j]);
else
dp[i][j]=dp[i-1][j];
}
}
int ans;
if(s%2==0)
{
for(int j=s/2;j<=s;j++)
{
if(dp[n][j])
{
ans=j;
break;
}
}
}
else
{
for(int j=(s/2)+1;j<=s;j++)
{
if(dp[n][j])
{
ans=j;
break;
}
}
}
cout<<ans<<endl;
}
|
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int TIME = 2*100000+10;
const int INF = 0x7fffffff;
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
lll ii,jj,kk;
vector<int> ret;
int n,w;
cin >> n >> w;
vector<int> s(n),t(n),p(n);
for(ii=0;ii<n;ii++){
cin >> s[ii] >> t[ii] >> p[ii];
}
vector<lll> preCal(TIME);
vector<lll> waste(TIME);
//cout << "calc waste" << endl;
for(ii=0;ii<n;ii++){
preCal[s[ii]] += p[ii];
preCal[t[ii]] -= p[ii];
}
lll calCost = 0;
for(ii=0;ii<TIME;ii++){
calCost+=preCal[ii];
waste[ii] = calCost;
}
bool flg = true;
//cout << "check waste" << endl;
for(ii=0;ii<TIME;ii++){
if(waste[ii] > w){
flg = false;
}
}
if(flg){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
}
| //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii; typedef vector<ll> VL; const int MD = 1e9+7; //998244353;
void dbg(){cerr<<"\n";} template <class F,class ...S> void dbg(const F& f, const S&...s){cerr <<f <<": "; dbg(s...);}
//using mint = modint1000000007;
int main()
{
cin.tie(0); ios_base::sync_with_stdio(false);
int n; ll w;
cin >>n >>w;
VL dp(200200);
int mx =0;
rep(i, n){
int s,t, p;
cin >>s >>t >>p;
dp[s] += p;
dp[t] -=p;
mx = max(mx, t);
}
rep(i, 200001){
dp[i+1] +=dp[i];
}
//rep(i, mx+1) cerr<<dp[i]<<" ";dbg();
bool ok=1;
rep(i, 200001) if(dp[i] > w) ok=0;
puts(ok? "Yes":"No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for(int i = (a); i <= (b); i++)
#define PER(i, a, b) for(int i = (a); i >= (b); i--)
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define all(S) (S).begin(), (S).end()
#define pb push_back
#define mk make_pair
#define S second
#define F first
typedef long long ll;
typedef long double lf;
typedef pair<int, int> ii;
// Euclides Estendido
ll gcd(ll A, ll B, ll &X, ll &Y) {
if(B == 0) {
X = 1; Y = 0;
return A;
}
ll x1, y1;
ll G = gcd(B, A % B, x1, y1);
X = y1; Y = x1 - (A / B) * y1;
return G;
}
// Acha a primeira vez que dois eventos ocorrem ao mesmo tempo
// Os eventos acontecem a cada:
// A * T1 + Z1 e B * T2 + Z2
ll solve(ll A, ll B, ll Z1, ll Z2) {
if(Z2 > Z1) swap(A, B), swap(Z1, Z2);
ll X, Y, ans = 0;
ll G = gcd(A, B, X, Y), C = Z2-Z1;
if(C%G) return 1LL << 62; // impossivel
C /= G; X *= C; Y *= C;
// Acho o primeiro X positivo
if(X >= 0) {
ll K = (X * G) / B;
ans = A * (X - K * (B / G)) + Z1;
} else {
ll K = (-X * G + B - 1) / B;
ans = A * (X + K * (B / G)) + Z1;
}
// retorna um par na forma (A, Z)
// A -> novo tamanho do ciclo
// Z -> primeira vez que acontece
// return mk(A * (B / G), ans);
return ans;
}
// Anotação importante, Há duas formas de alterar as soluções:
// (1) -> X = X + K * (B / G) e Y = Y - K * (A / G)
// (2) -> X = X - K * (B / G) e Y = Y + K * (A / G)
int main(int argc, char** argv) {
int T, X, Y, P, Q;
scanf("%d", &T);
rep(t, 0, T) {
ll ans = (1LL <<62);
scanf("%d%d", &X, &Y);
scanf("%d%d", &P, &Q);
rep(y, 0, Y) rep(q, 0, Q)
ans = min(ans, solve(2*X+2*Y, P+Q, X + y, P + q));
if(ans != (1LL << 62))
printf("%lld\n", ans);
else puts("infinity");
}
return 0;
}
| #include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef DEBUG
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr<<#x<<": "; for(auto i:x) cerr<<i<<" "; cerr<<endl;}}
#define debugr(l,r,x) {{cerr<<#x<<": "; for(int i=l;i<=r;i++) cerr<<x<<" "; cerr<<endl;}}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define debugr(l,r,x)
#define cerr while(0) cerr
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define priority_queue std::priority_queue
#define F first
#define S second
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
ll euclid(ll a, ll b, ll &x, ll &y) {
if (!b) return x = 1, y = 0, a;
ll d = euclid(b, a % b, y, x);
return y -= a/b * x, d;
}
ll crt(ll a, ll m, ll b, ll n){
if(n>m) swap(a, b), swap(m, n);
ll x, y, g=euclid(m, n, x, y);
if((a-b)%g!=0) return LONG_LONG_MAX;
x=(b-a)%n*x%n/g*m+a;
return x<0 ? x+m*n/g : x;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T;
cin>>T;
while(T--){
ll x, y, p, q;
cin>>x>>y>>p>>q;
ll ans=LONG_LONG_MAX;
for(ll i=x;i<x+y;i++){
for(ll j=p;j<p+q;j++){
ans=min(ans, crt(i, 2*(x+y), j, (p+q)));
}
}
if(ans==LONG_LONG_MAX) cout<<"infinity\n";
else cout<<ans<<"\n";
}
} |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<cstring>
using namespace std;
typedef long long ll;
const int N = 1e6 + 50;
char s[N];
int main(){
scanf("%s", s + 1);
int len = strlen(s + 1);
bool ok = 1;
for(int i = 1; i <= len; i += 2) if(!(s[i] >= 'a' && s[i] <= 'z')) ok = 0;
for(int i = 2; i <= len; i += 2) if(!(s[i] >= 'A' && s[i] <= 'Z')) ok = 0;
puts(ok ? "Yes" : "No");
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=998244353;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
return mod(mod(a)+mod(b));
}
long long mul(long long a, long long b){
return mod(mod(a)*mod(b));
}
ll modPow(ll a, ll b){
if(b==0)
return 1LL;
if(b==1)
return a%M;
ll res=1;
while(b){
if(b%2==1)
res=mul(res,a);
a=mul(a,a);
b=b/2;
}
return res;
}
void solve(){
string s;
cin>>s;
int nb=0;
int cnt[3]={0};
int sum=0;
int n=s.size();
for(int i=0;i<n;i++){
int k=s[i]-'0';
cnt[k%3]++;
sum+=k;
}
sum=sum%3;
if(sum==0){
cout<<0;
return;
}
else if(sum==1){
if(cnt[1]>0 && n>1) cout<<1;
else if(cnt[2]>1 && n>2) cout<<2;
else cout<<-1;
}
else{
if(cnt[2]>0 && n>1) cout<<1;
else if(cnt[1]>1 && n>2) cout<<2;
else cout<<-1;
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
// freopen("timber_input.txt", "r", stdin);
// freopen("timber_output.txt", "w", stdout);
int t=1;
// cin>>t;
for(int i=1;i<=t;i++){
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int h, w;
bool field[16][16];
long long dfs(int x, int y, int a, int b)
{
//畳が足りない時。
if(a < 0 || b < 0)return 0;
//端まで行きついたら
if(y == h) y = 0, x++;//左上に移動
if(x == w)return 1;//右下端まで来たのでこれが一つ
//もう使われてたら
if(field[x][y] == true)return dfs(x, y + 1, a, b);
//流れ
/*
一回おいてから、もっと深くまで探索する。
探索が終わって帰ってきたら、外す。
*/
long long ret = 0;
//横に置く
if(x + 1 < w && field[x + 1][y] == false)
{
field[x][y] = true;
field[x + 1][y] = true;
ret += dfs(x, y + 1, a - 1, b);
field[x][y] = false;
field[x + 1][y] = false;
}
//縦に置く
if(y + 1 < h && field[x][y + 1] == false)
{
field[x][y] = true;
field[x][y + 1] = true;
ret += dfs(x, y + 1, a - 1, b);
field[x][y] = false;
field[x][y + 1] = false;
}
//半畳を置く
field[x][y] = true;
ret += dfs(x, y + 1, a, b - 1);
field[x][y] = false;
return ret;
}
int main()
{
int a, b;
cin >> h >> w >> a >> b;
//横に置く、縦に置く、半畳を置く
cout << dfs(0, 0, a, b) << endl;
} | // I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
const ll MOD = 998244353;
const ll MAX = 5100;
bool can[MAX][MAX][3];
ll dp[MAX][MAX]={};
ll modinv(ll a, ll m){
ll b=m,u=1,v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a,b);
u-=t*v; swap(u,v);
}
u%=m;
if(u<0) u+=m;
return u;
}
signed main(){
init_io();
ll H,W,K,fi=1,mv;
cin >> H >> W >> K;
mv = modinv(3,MOD);
vector<ll> h(K),w(K);
vector<char> c(K);
for(int i=0;i<MAX;i++){
for(int j=0;j<MAX;j++){
for(int k=0;k<3;k++){
can[i][j][k] = true;
}
}
}
for(ll i=0;i<H*W-K;i++){
fi *= 3;
fi %= MOD;
}
for(int i=0;i<K;i++){
cin >> h[i] >> w[i] >> c[i];
h[i]--;
w[i]--;
for(int j=0;j<3;j++){
can[h[i]][w[i]][j] = false;
}
if(c[i]=='R') can[h[i]][w[i]][0] = true;
if(c[i]=='D') can[h[i]][w[i]][1] = true;
if(c[i]=='X') can[h[i]][w[i]][2] = true;
}
dp[0][0] = 1;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
ll nv = dp[i][j];
if(can[i][j][0]&&can[i][j][1]&&can[i][j][2]){
nv = (nv*2*mv);
nv %= MOD;
dp[i][j+1] = (dp[i][j+1]+nv)%MOD;
dp[i+1][j] = (dp[i+1][j]+nv)%MOD;
}else if(can[i][j][0]){
dp[i][j+1] = (dp[i][j+1]+nv)%MOD;
}else if(can[i][j][1]){
dp[i+1][j] = (dp[i+1][j]+nv)%MOD;
}else if(can[i][j][2]){
dp[i][j+1] = (dp[i][j+1]+nv)%MOD;
dp[i+1][j] = (dp[i+1][j]+nv)%MOD;
}
}
}
cout << (dp[H-1][W-1]*fi)%MOD << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 998244353;
#define int __int128
const int inf = (1LL << 60);
const int INF = inf * inf;
template< typename T > inline void get_min(T &x, T y) {if(y < x) x = y;}
template< typename T > inline void get_max(T &x, T y) {if(x < y) x = y;}
inline int read() {
int x = 0, f = 0; char ch = getchar();
while (!isdigit(ch)) f |= ch == '-', ch = getchar();
while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();
return f ? -x : x;
}
template<typename T> inline void print(T x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) print(x / 10);
putchar(x % 10 + '0');
}
void extend_gcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1, y = 0;
return ;
}
extend_gcd(b, a % b, y, x);
y -= a / b * x;
y %= a;
}
void solve() {
int x, y, p, q;
x = read(), y = read(), p = read(), q = read();
int ans = INF;
//print(ans);
for (int i = x; i < x + y; i++) {
for (int j = p; j < p + q; j++) {
int a = 2 * x + 2 * y, b = -(p + q), l, r;
int c = j - i;
int d = __gcd(a, b);
if (c % d) continue; // 无解
extend_gcd(a, b, l, r);
int e = a * b / d; // 最小公倍数
if (e < 0) {
e = -e;
}
l = c / d * l % e;
r = c / d * r % e;
int mem = (a * l + i) % e;
if (mem < 0) mem += e;
//cout << l << ' ' << r << '\n';
ans = min(ans, mem);
}
}
if (ans == INF) {
cout << "infinity\n";
} else {
print(ans);
puts("");
}
}
signed main() {
//ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T = 1; T = read();
while (T--) {
solve();
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ':' << a << endl; }
#define endl '\n'
#define fi first
#define se second
using lint = long long;
using P = pair<int,int>;
template<class T> using V = vector<T>;
template<class T> using priq = priority_queue<T>;
template<class T> using priq_inv = priority_queue<T, vector<T>, greater<T>>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
template<class T> T ceil(const T &a, const T &b) { return (a+b-1)/b; }
template<class T> bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
struct INF { template<class T> operator T() { return numeric_limits<T>::max() / 2; } } INF;
template<class T, class U> istream& operator>>(istream &in, pair<T,U> &p) {
return in >> p.first >> p.second;
}
template<class T, class U> ostream& operator<<(ostream &out, const pair<T,U> &p) {
return out << p.first << ' ' << p.second;
}
template<class T> istream& operator>>(istream &in, vector<T> &v) {
for(auto &&e: v) in >> e;
return in;
}
template<class T> ostream& operator<<(ostream &out, const vector<T> &v) {
for(const auto &e: v) out << e << ' ';
return out;
}
/*----------------------------------------------------------------------------------------------------*/
template<class T>
vector<T> Dijkstra(int s, const vector<vector<pair<T,int>>> &g, vector<int> prev = {}) {
using pi = pair<T,int>;
const T inf = numeric_limits<T>::max()/2;
vector<T> dist(g.size(), inf);
dist[s] = 0;
prev.assign(dist.size(), -1);
priority_queue<pi, vector<pi>, greater<pi>> que;
que.emplace(0,s);
while(!que.empty()) {
P p = que.top(); que.pop();
int now = p.second;
if(dist[now] < p.first) continue;
for(P np : g[now]) {
int next = np.second;
if(dist[next] > dist[now] + np.first) {
prev[next] = now;
dist[next] = dist[now] + np.first;
que.emplace(dist[next], next);
}
}
}
return dist;
}
int main() {
int h, w;
cin >> h >> w;
V<V<int>> a(h,V<int>(w-1)), b(h-1,V<int>(w));
cin >> a >> b;
auto makeId = [&](int y, int x) {
if(h > w) return x*h+y;
else return y*w+x;
};
auto retPoint = [&](int id) {
if(h > w) return make_pair(id/h, id%w);
else return make_pair(id/w, id%h);
};
V<V<P>> g(h*w);
rep(i,h)rep(j,w) {
int id = makeId(i,j);
if(j+1 < w) g[id].emplace_back(a[i][j], makeId(i,j+1));
if(j > 0) g[id].emplace_back(a[i][j-1], makeId(i,j-1));
if(i+1 < h) g[id].emplace_back(b[i][j], makeId(i+1,j));
Rep(k,i) g[id].emplace_back(k+1, makeId(i-k,j));
}
auto dist = Dijkstra(makeId(0,0), g);
int ans = dist[makeId(h-1,w-1)];
cout << ans << endl;
} |
// Problem: D - Powers
// Contest: AtCoder - AtCoder Regular Contest 106
// URL: https://atcoder.jp/contests/arc106/tasks/arc106_d
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
const int N = 2e5+7,M = 305,MOD = 998244353;
ll fx[M],fc[M],fsa[M],fsb[M];
int a[N],b[N];
ll fa[N][M],fb[N][M];
ll qmul(ll a, ll b, ll P)
{
ll L = a * (b >> 25LL) % P * (1LL << 25) % P;
ll R = a * (b & ((1LL << 25) - 1)) % P;
return (L + R) % P;
}
ll qpow(ll a,ll b,ll p)
{
ll res = 1 % p;
while(b)
{
if(b & 1) res = res * a % p;
a = a * a % p;
b >>= 1;
}
return res;
}
ll fact[N],infact[N];
void init()
{
fact[0] = infact[0] = 1;
for (int i = 1; i < N; i ++ )
{
fact[i] = ((ll)fact[i - 1] * i) % MOD;
infact[i] = ((ll)infact[i - 1] * qpow(i, MOD - 2, MOD)) % MOD;
}
}
ll C(int a,int b)
{
return (ll)fact[a]*infact[b]%MOD*infact[a-b]%MOD;
}
int main()
{
init();
int n,k,rev2 = qpow(2,MOD - 2,MOD);scanf("%d%d",&n,&k);
forn(i,1,n) scanf("%d",&a[i]),b[i] = 2 * a[i];
fsa[0] = n,fsb[0] = n;
forn(i,1,n)
{
ll _a = 1,_b = 1;
forn(j,1,k)
{
_a = _a * a[i] % MOD,_b = _b * b[i] % MOD;
fsa[j] = (fsa[j] + _a) % MOD,fsb[j] = (fsb[j] + _b) % MOD;
}
}
forn(x,1,k)
{
ll lf = 0;
forn(i,0,x)
{
ll t = fsa[i] * fsa[x - i] % MOD;
t = t * C(x,i) % MOD;
lf = (lf + t) % MOD;
}
// cout << lf << endl;
lf = ((lf - fsb[x]) % MOD + MOD) % MOD;
printf("%lld\n",rev2 * lf % MOD);
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n , k , a [200005] , fact [303] , sum [303] , mn [303] , pww [200005][303] , pwww [200005][303];
long long pw ( long long x , long long y )
{
if ( y == 0 ) return 1;
long long ans = pw ( x , y / 2 );
ans = ( ans * ans ) % mod;
if ( y % 2 ) ans = ( ans * x ) % mod;
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
cin >> n >> k;
for ( int i = 0 ; i < n ; i ++ ) cin >> a [i];
fact [0] = 1;
for ( int i = 0 ; i < n ; i ++ )
{
pww [i][0] = 1;
pwww [i][0] = 1;
}
for ( int i = 1 ; i <= k ; i ++ )
{
fact [i] = ( fact [ i - 1 ] * i ) % mod;
for ( int j = 0 ; j < n ; j ++ )
{
pww [j][i] = ( pww [j][ i - 1 ] * a [j] ) % mod;
pwww [j][i] = ( pwww [j][ i - 1 ] * ( a [j] + a [j] ) ) % mod;
mn [i] += pwww [j][i];
}
mn [i] %= mod;
}
for ( int i = 0 ; i < n ; i ++ )
{
for ( int j = 0 ; j <= k ; j ++ ) sum [j] += pww [i][j];
}
for ( int i = 0 ; i <= k ; i ++ )
{
sum [i] %= mod;
sum [i] = ( sum [i] * pw ( fact [i] , mod - 2 ) ) % mod;
}
for ( int i = 1 ; i <= k ; i ++ )
{
long long ans = 0;
for ( int j = 0 ; j <= i ; j ++ ) ans += ( sum [j] * sum [ i - j ] ) % mod;
ans %= mod;
ans = ( ans * fact [i] ) % mod;
ans = ( ans - mn [i] + mod ) % mod;
cout << ( ans * pw ( 2 , mod - 2 ) ) % mod << endl;
}
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <pii> vpii;
typedef vector <vi> vvi;
const int N = 2e5 + 5;
const ll infll = (ld)1e18 + 7;
int n, q;
ll l = -infll, r = infll;
ll delta = 0;
// x <= l -> l, x >= r -> r, l < x < r -> x
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
ForE(i, 1, n){
int a, t; cin >> a >> t;
if (t == 1){
delta += a;
}
else if (t == 2){
if (a <= l + delta){
continue;
}
if (a < r + delta){
l = a - delta;
}
else{
l = r = a - delta;
}
}
else{
if (a >= r + delta){
continue;
}
if (a > l + delta){
r = a - delta;
}
else{
l = r = a - delta;
}
}
}
cin >> q;
while (q--){
int x; cin >> x;
if (x <= l) cout << l + delta << endl;
else if (x >= r) cout << r + delta << endl;
else cout << x + delta << endl;
}
}
/*
==================================================+
INPUT: |
--------------------------------------------------|
--------------------------------------------------|
==================================================+
OUTPUT: |
--------------------------------------------------|
--------------------------------------------------|
==================================================+
*/ | #include<bits/stdc++.h>
#define ll long long int
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector< pii >
#define vpll vector< pll >
#define mpii map<int,int>
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define read1(v,n) for(int i=1;i<=n;i++)cin>>v[i];
#define trav(a,x) for (auto& a: x)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define cut(x) {cout<<x;return 0;}
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORB(i,a,b) for(int i=a;i>=b;i--)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define nl '\n'
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
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 pow(ll a, ll b)
{
ll ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%MOD;
b/=2;
a=(a*a)%MOD;
}
return ans;
}
int main()
{
fast
ll n;
cin>>n;
ll p=n+1;
ll k=(-1+sqrt(1+8*p))/2;
k+=10;
while(true)
{
ll fun=k*(k+1)/2;
if(fun<=p){break;}
k--;
}
cout<<n-k+1;
}
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
using namespace std;
#define int long long int
//------------ATCODER TEMPLATE-------------
signed main() {
int N, M; cin >> N >> M;
vector<int> A(N);
REP(i, N) cin >> A[i];
vector<pair<int, int>> ps(M);
REP(i, M) cin >> ps[i].first >> ps[i].second;
sort(ps.begin(), ps.end());
vector<pair<int, int>> nodes(N);
for (auto [a, b] : ps) {
--a, --b;
int x = A[a];
if (nodes[a].second > 0) {
x = min(A[a], nodes[a].second);
}
if (nodes[b].second == 0) {
nodes[b] = {A[b], x};
} else {
nodes[b].second = min(nodes[b].second, x);
}
}
int vmax = -1e18;
for (auto [a, b] : nodes) {
if (a == 0 && b == 0) continue;
vmax = max(vmax, a - b);
}
cout << vmax << endl;
return 0;
}
| #include <bits/stdc++.h>
// ====================================================================
// clang-format off
namespace std {
template <class Fun>
class y_combinator_result {
Fun fun_;
public:
template <class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
template <class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
} // namespace std
// clang-format on
// ====================================================================
signed main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int64_t x, y;
std::cin >> x >> y;
std::map<int64_t, int64_t> map;
auto ans = std::y_combinator([&](auto self, int64_t t) -> int64_t {
if (map.find(t) != end(map)) {
return map[t];
}
else if (t == 1) {
return map[t] = std::abs(x - t);
}
else if (t & 1) {
return map[t] = std::min({
std::abs(x - t),
self((t + 1) / 2) + 2,
self((t - 1) / 2) + 2
});
}
else {
return map[t] = std::min(std::abs(x - t), self(t / 2) + 1);
}
})(y);
std::cout << ans << '\n';
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define que pair<pii,int>
int N, M, Q;
int X[200010][3];
int O[200010], P[200010];
vector<que> V;
int ans[200010][2];
int A[3][3];
int now = 0;
void calc(int a[3][3], int b[3][3])
{
int ret[3][3] = {0};
rep(i, 3)rep(j, 3)rep(k, 3)
{
ret[i][j] += a[i][k] * b[k][j];
}
rep(i, 3)rep(j, 3)A[i][j] = ret[i][j];
}
void update()
{
int o = O[now];
int p = P[now];
if(o == 1)
{
int B[3][3] = {{ 0, 1, 0},
{-1, 0, 0},
{ 0, 0, 1}};
calc(B, A);
}
else if(o == 2)
{
int B[3][3] = {{ 0,-1, 0},
{ 1, 0, 0},
{ 0, 0, 1}};
calc(B, A);
}
else if(o == 3)
{
int B[3][3] = {{-1, 0,2*p},
{ 0, 1, 0},
{ 0, 0, 1}};
calc(B, A);
}
else if(o == 4)
{
int B[3][3] = {{ 1, 0, 0},
{ 0,-1,2*p},
{ 0, 0, 1}};
calc(B, A);
}
now++;
}
void unit(int tk_id, int id)
{
ans[id][0] = X[tk_id][0] * A[0][0] + X[tk_id][1] * A[0][1] + A[0][2];
ans[id][1] = X[tk_id][0] * A[1][0] + X[tk_id][1] * A[1][1] + A[1][2];
}
signed main()
{
A[0][0] = A[1][1] = A[2][2] = 1;
cin >> N;
rep(i, N)
{
cin >> X[i][0] >> X[i][1];
X[i][2] = 1;
}
cin >> M;
rep(i, M)
{
cin >> O[i];
if(O[i] > 2)cin >> P[i];
}
cin >> Q;
rep(i, Q)
{
int a, b;
cin >> a >> b;
V.push_back({{a, b-1}, i});
}
sort(V.begin(), V.end());
for(auto e : V)
{
int op_id = e.first.first;
while(now < op_id)update();
unit(e.first.second, e.second);
}
rep(i, Q)
{
cout << ans[i][0] << " " << ans[i][1] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
// #define mp make_pair
#define ff first
#define ss second
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#define rep(i,n) for(int i=0;i<n;i++)
const int N = 1e6+9;
int fact[N], invfact[N];
inline int add(int x, int y) { x += y; return x % mod;}
inline int sub(int x, int y) { x -= y; x %= mod; x += mod; return x % mod;}
inline int mul(int x, int y) { return (x * y) % mod;}
inline int powr(int a, int b) {
int x = 1 % mod;
b %= (mod - 1);
while (b) {
if (b & 1) x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2);}
void pre() {
fact[0] = invfact[0] = 1;
for (int i = 1; i < N; i++) fact[i] = mul(i, fact[i - 1]);
invfact[N - 1] = inv(fact[N - 1]);
for (int i = N - 2; i >= 1; i--) invfact[i] = mul(invfact[i + 1], i + 1);
assert(invfact[1] == 1);
}
inline int C(int n, int k) {
if(k == 0)
return 1;
if (n < k || k < 0) return 0;
return mul(fact[n], mul(invfact[k], invfact[n - k]));
}
int power(int x, int y, int m)
{
if(y == 0)
return 1;
int temp = power(x,y/2,m);
temp = ((temp%m) * (temp%m))%m;
if(y%2 == 1)
temp = ((x%m) * (temp%m))%m;
return temp;
}
// int dp[5009][5009];
bool isPalindrome(string str) {
int i = 0, j = str.size() - 1;
// traversing from both the ends
while (i < j)
// not palindrome
if (str[i++] != str[j--])
return false;
// palindrome
return true;
}
// function to remove all the palindromic words
// from the given sentence
string removePalinWords(string str) {
// 'final_str' to store the final string and
// 'word' to one by one store each word of 'str'
string final_str = "", word = "";
// add space at the end of 'str'
str = str + " ";
int n = str.size();
// traversing 'str'
for (int i = 0; i < n; i++) {
// accumulating characters of the current word
if (str[i] != ' ')
word = word + str[i];
else {
// if 'word' is not palindrome then a
// add it to 'final_str'
if (!(isPalindrome(word)))
final_str += word + " ";
// reset
word = "";
}
}
// required final string
return final_str;
}
void solve()
{
int t = 1;
// cin>>t;
for(int tc=1;tc<=t;tc++)
{
string s;
cin>>s;
int n = s.size();
deque<char> que;
int c = 0;
for(int i=0;i<n;i++)
{
if(s[i] == 'R')
c = (c+1)%2;
else
{
if(c == 0)
{
if(que.size() != 0)
{
char ch = *que.rbegin();
if(ch == s[i])
que.erase(que.end());
else
que.push_back(s[i]);
}
else
que.push_back(s[i]);
}
else
{
if(que.size() != 0)
{
char ch = *que.begin();
if(ch == s[i])
que.erase(que.begin());
else
que.push_front(s[i]);
}
else
que.push_front(s[i]);
}
}
}
string temp = "";
for(auto it : que)
temp.push_back(it);
if(c == 1)
reverse(temp.begin(),temp.end());
cout<<temp;
}
}
int32_t main(){
// ios_base::sync_with_stdio(0);
// cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int n;
cin >> n;
double ans = 0.0;
for (int i = n - 1; i > 0; i--) {
double p = (double)n / i;
ans += p;
}
printf("%.10f\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
// 最大公約数
ll gcd(ll a, ll b) { return (a % b)? gcd(b, a % b): b; }
ll gcd(ll a, ll b, ll c){ return gcd(a, gcd(b,c)); }
int main(){
int N;cin >> N;
ll result = 0;
rep(i,N){
int temp;
cin >> temp;
if(temp>10){
result += temp-10;
}
}
cout << result << endl;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
int main() {
int N;
cin >> N;
unordered_map<string, int> mp;
rep(i, N) {
string S;
cin >> S;
if (S[0] == '!') {
if (mp.find(S.substr(1, S.size() - 1)) != mp.end()) {
cout << S.substr(1, S.size() - 1) << endl;
return 0;
} else {
mp[S] = i;
}
} else {
if (mp.find("!" + S) != mp.end()) {
cout << S << endl;
return 0;
} else {
mp[S] = i;
}
}
}
cout << "satisfiable" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
const int N = 105;
const ll mod = 998244353;
int n;
string str[maxn], res;
unordered_map<string, int>o;
int main() {
#ifndef ONLINE_JUDGE
freopen("1.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
res = "()";
for (int i = 1; i <= n; ++i) {
cin >> str[i];
if (res != "()")continue;
if (str[i][0] == '!') {
string cur = "";
int sz = str[i].size();
for (int j = 1; j < sz; ++j) {
cur += str[i][j];
}
if (o[cur] == 1) {
res = cur;
} else {
o[cur] = 2;
}
} else {
if (o[str[i]] == 2) {
res = str[i];
} else {
o[str[i]] = 1;
}
}
}
if (res == "()")cout << "satisfiable" << endl;
else cout << res << endl;
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int Mod=998244353;
int n,m,k,ans;
inline int qpow(int a,int b,int m=Mod) {
if (!a) return 0;
int r=1;
while (b) {
if (b&1) r=1ll*r*a%m;
a=1ll*a*a%m,b>>=1;
}
return r;
}
signed main() {
cin>>n>>m>>k;
if (n==1||m==1) cout<<qpow(k,n+m-1);
else {
for (int amax=1; amax<=k; ++amax)
ans=(ans+(amax==1?1ll:(1ll*qpow(amax,n)-qpow(amax-1,n))%Mod)*qpow(k-amax+1,m))%Mod;
cout<<(ans+Mod)%Mod;
}
} | #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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
//const int MOD = 1000000007;
const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
template<int mod>
struct Mod_Int{
int x;
Mod_Int() : x(0) {}
Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
Mod_Int &operator += (const Mod_Int &p){
if((x += p.x) >= mod) x -= mod;
return *this;
}
Mod_Int &operator -= (const Mod_Int &p){
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
Mod_Int &operator *= (const Mod_Int &p){
x = (int) (1LL * x * p.x % mod);
return *this;
}
Mod_Int &operator /= (const Mod_Int &p){
*this *= p.inverse();
return *this;
}
Mod_Int &operator ++ () {return *this += Mod_Int(1);}
Mod_Int operator ++ (int){
Mod_Int tmp = *this;
++*this;
return tmp;
}
Mod_Int &operator -- () {return *this -= Mod_Int(1);}
Mod_Int operator -- (int){
Mod_Int tmp = *this;
--*this;
return tmp;
}
Mod_Int operator - () const {return Mod_Int(-x);}
Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}
Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}
Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}
Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}
bool operator == (const Mod_Int &p) const {return x == p.x;}
bool operator != (const Mod_Int &p) const {return x != p.x;}
Mod_Int inverse() const {
assert(*this != Mod_Int(0));
return pow(mod-2);
}
Mod_Int pow(long long k) const{
Mod_Int now = *this, ret = 1;
for(; k > 0; k >>= 1, now *= now){
if(k&1) ret *= now;
}
return ret;
}
friend ostream &operator << (ostream &os, const Mod_Int &p){
return os << p.x;
}
friend istream &operator >> (istream &is, Mod_Int &p){
long long a;
is >> a;
p = Mod_Int<mod>(a);
return is;
}
};
using mint = Mod_Int<MOD>;
int main(){
int N, M, K; cin >> N >> M >> K;
if(N == 1) {cout << mint(K).pow(M) << '\n'; return 0;}
if(M == 1) {cout << mint(K).pow(N) << '\n'; return 0;}
vector<mint> S(K+1, 0);
rep2(i, 1, K) S[i] = S[i-1]+mint(i).pow(M)-mint(i-1).pow(M);
mint ans = 0;
rep2(i, 1, K){
mint tmp = mint(i).pow(N)-mint(i-1).pow(N);
ans += tmp*S[K+1-i];
//cout << tmp << ' ' << S[K-i] << '\n';
}
cout << ans << '\n';
} |
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);
ll mod_pow(ll x, ll n, ll m = mod) {
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
void solve() {
int n, k; cin >> n >> k;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
}
vector<vector<modint>> rsum(k + 1, vector<modint>(n + 1));
rep(i, n) {
modint p = 1;
rep(j, k + 1) {
rsum[j][i + 1] += rsum[j][i] + p;
p *= a[i];
}
}
rep1(x, k) {
modint ans = 0;
rep(j, x + 1) {
ans += comb(x, j) * rsum[j][n] * rsum[x - j][n];
ans -= comb(x, j) * rsum[x][n];
}
ans *= (1 + mod) / 2;
cout << ans << "\n";
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(15);
init_f();
//init();
//expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
} | /*
Konnichiwaa!!!!
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define REP(i, k, n) for(ll i = k; i < n; ++i)
#define REPI(i, k, n) for(ll i = k; i >= n; --i)
#define vi vector<int>
#define vch vector<char>
#define vstr vector<string>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vi>
#define vpl vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define F first
#define S second
#define el "\n"
#define sz(x) x.size()
#define ld long double
#define sortar(v) sort(v.begin(),v.end())
#define rsort(v) sort(v.rbegin(),v.rend())
#define all(x) x.begin(), x.end()
#define div 1000000007
#define div2 998244353
#define pi 3.14159265358979323846
#define inf 1000000000000000000
#define blk 455
#define pb push_back
#define ppb pop_back
#define print(x) for(auto p:x) cout<<p<<' '; cout<<el;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mod 998244353
#define N 1000005
bool isPrime[N] = {false};
vll prm;
vll SPF(N);
void sieve()
{
isPrime[1] = isPrime[0] = 0;
ll i;
for(i=2;i<N;++i) isPrime[i] = 1;
for(i=2;i*i<N;++i)
{
if(isPrime[i])
{
for(ll j = i*i; j<N; j += i)
isPrime[j] = 0;
}
}
if(!prm.empty())
prm.clear();
REP(i,2,N)
{
if(isPrime[i])
prm.pb(i);
}
}
bool flip(bool f)
{
if(f) return 0;
return 1;
}
ll fastPower(ll a, ll b)
{
if(b == 0) return 1;
ll prod = 1;
while(b > 0)
{
if(b & 1)
prod = prod * a;
b = b >> 1;
a = a * a;
}
return prod;
}
ll fact(ll n) {
ll res = 1;
for(ll i=2;i<=n;i++) {
res*=i;
}
return res;
}
ll nCr(ll n,ll r) {
return (ld)fact(n)/(ld)(fact(r)*fact(n-r));
}
void printa(bool f){
if(f) cout<<"YES"<<el;
else cout<<"NO"<<el;
}
ll value(ll n){
return (n*(n+1))/2;
}
void solve(){
ll n, i;
cin>>n;
vector<pair<ll, ll>> a;
REP(i,0,n){
ll x, y;
cin>>x>>y;
a.pb(make_pair(x, y));
}
sort(all(a));
ll j, k;
REP(i,0,n){
REP(j,i+1, n){
REP(k,j+1,n){
if(a[j].F != a[i].F && a[k].F != a[i].F){
double m1 = 1.0*(a[j].S - a[i].S)/(a[j].F - a[i].F);
double m2 = 1.0*(a[k].S - a[i].S)/(a[k].F - a[i].F);
if(m1==m2){
cout<<"Yes"<<el;
return;
}
} else if(a[j].F == a[i].F && a[k].F == a[i].F){
cout<<"Yes"<<el;
return;
}
}
}
}
cout<<"No"<<el;
}
int main()
{
// fastio();
#ifndef ONLINE_JUDGE
freopen("C:/Users/Lenovo/Desktop/inpOut/input.txt", "r", stdin);
freopen("C:/Users/Lenovo/Desktop/inpOut/output.txt", "w", stdout);
#endif
// ios_base::sync_with_stdio(0);
// cin.tie(0);
int tc = 1, i = 1;
// scanf("%d", &tc);
while(tc--)
{
// cout<<"Case #"<<i<<": ";
solve();
// ++i;
}
return 0;
} |
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include <algorithm>
#include<bits/stdc++.h>
#include <cstdarg>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <math.h>
#include <vector>
// @author : sam000013
#define int long long
#define PI 3.14159265
#define pb(x) push_back(x)
#define all(v) v.begin(), v.end()
#define dbg(x) cout<<#x<<" "<<x<<endl;
#define bye cout<<endl;return
#define uni 1.000000
#define ld long double
using namespace std;
const int mod = 1000000007;
const int hashMod = 29996224275833;
template <typename T>
void show(vector<T> x)
{
for (auto e : x){
cout<<e<<" ";
}
cout<<endl;
}
template <typename T1>
void showPair(vector<pair<T1, T1>> x) {
for(auto e:x){
cout<<e.first<<" "<<e.second<<endl;
}
}
template <typename T2>
void showSet(set<T2> x) {
for(auto e:x){
cout<<e<<" ";
}
cout<<endl;
}
template <typename T3>
void showMultiSet(multiset<T3> x) {
for(auto e:x){
cout<<e<<" ";
}
cout<<endl;
}
/*
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
}
}
*/
void solve(){
int n;
cin>>n;
vector<vector<int>> v(n, vector<int>(n));
for(int i=0; i<n; i++){
for(int j=0;j<n;j++){
cin>>v[i][j];
}
}
for(int i=0; i<n; i++){
vector<int> canbe;
for(int j=0; j<n; j++){
int diff;
bool ok = 1;
for(int k=0; k<n; k++){
if(k == 0){
if(v[j][k] - v[i][k] >= 0){
diff = v[j][k] - v[i][k];
}else{
ok = 0;
break;
}
}else{
if(v[j][k] - v[i][k] != diff){
ok = 0;
break;
}
}
}
if(ok){
canbe.push_back(diff);
}else{
break;
}
}
if(canbe.size() == n){
cout<<"Yes\n";
for(int j=0; j<n; j++){
cout<<canbe[j]<<" ";
}cout<<"\n";
for(int j=0; j<n; j++){
cout<<v[i][j]<<" ";
}cout<<"\n";
return;
}
}
cout<<"No";bye;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(NULL);
int t = 1;
// cin >> t;
for(int i=1; i<=t; i++){
solve();
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define NeedForSpeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);i++)
#define repd(i, l, r) for (int i=(int)(l);i>=(int)(r);i--)
#define clrg(i, l, r) for(int i=(int)(l);i<(int)(r);i++)vis[i]=0,v[i].clear();
int power(int x, unsigned int y){int res = 1;while (y > 0){ if (y & 1){res = res*x;} y = y>>1;x = x*x;}return res;}
int powermod(int x, unsigned int y, int p){int res = 1;x = x % p;while (y > 0){if (y & 1){res = (res*x) % p;}y = y>>1; x = (x*x) % p;}return res;}
#define print2d(mat,n,m){for(int i=0;i<(int)(n);i++){for(int j=0;j<(m);j++){cout<<mat[i][j]<<" ";}cout<< endl;}}
#define clr(a,x) memset(a,x,sizeof(a))
#define rr(v) for(auto &val:v)
#define print(v) for (const auto itr : v){cout<<itr<<' ';}cout<<"\n";
#define len length()
#define sz size()
#define mod 1000000007
#define elif else if
#define filein(x) ifstream fin (x);
#define fileout(x) ofstream fout (x);
int32_t main(){
NeedForSpeed
int n;cin>>n;
int ans=1;
for(int i=n;i>=2;i--){
if(__gcd(i,ans)==1){ans*=i;}
else{
ans*=i/(__gcd(ans,i));
}
}
cout<<(ans+1)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
typedef long long ll;
typedef pair<ll,ll> pl;
typedef tuple<ll,ll,ll> tupl;
int main()
{
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll sum=a,tot=0;
ll cnt=0;
if(b/c>=d) {
cout << -1 << endl;
return 0;
}
while(true) {
sum+=b;
tot+=c;
cnt++;
if(sum<=tot*d) break;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LSOne(S) ((S) & -(S))
typedef vector<long double> vld;
using ld = long double;
class FenwickTree {
private:
vld ft;
public:
FenwickTree(int m) { ft.assign(m+1, 0); }
ld rsq(int j) {
ld sum = 0;
for (; j; j -= LSOne(j))
sum += ft[j];
return sum;
}
ld rsq(int i, int j) { return rsq(j) - rsq(i-1); }
void update(int i, ld v) {
for (; i < (int)ft.size(); i += LSOne(i))
ft[i] += v;
}
};
class RUPQ {
private:
FenwickTree ft;
public:
RUPQ(int m) : ft(FenwickTree(m)) {}
void range_update(int ui, int uj, ld v) {
ft.update(ui, v);
ft.update(uj+1, -v);
}
ld point_query(int i) { return ft.rsq(i); }
};
const ld MOD = 1000000007;
const int MAXN = 100005;
int n, m, k;
bool go_back[MAXN];
double ans[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(5) << "\n";
cin >> n >> m >> k;
int consec = 0;
bool good = true;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
go_back[x]=true;
if (good) {
if(go_back[x-1]){
consec++;
} else {
consec=1;
}
if (consec==m) {
good = false;
}
}
}
if (!good) {
cout << "-1\n";
return 0;
}
RUPQ ft(n);
ld coef0 = m;
ld scalar0 = m;
int limit = n-1;
ft.range_update(1, min(m,limit), -1);
for (int i = 1; i < n; i++) {
ld val = ft.point_query(i);
if (go_back[i]) {
coef0+=val;
} else {
scalar0-=val;
ft.range_update(i+1,min(limit, i+m),val/m);
}
}
cout << (scalar0/coef0) << "\n";
}
|
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define ya cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define ff first
#define sc second
#define inf 999999999
#define pi 3.14159265359
#define printv(v) for(auto x:v)cout<<x<<' ';cout<<endl;
#define takev(v) for(auto &x:v)cin>>x;
inline int random(int a=1,int b=10)
{
return a+rand()%(b-a+1);
}
typedef long long ll;
inline ll lcm(ll a,ll b)
{
return (a*b)/__gcd(a,b);
}
//#define see(x) cout<<endl<<#x<<" : "<<(x)<<endl;
#define see(args...) \
{ \
string _s = #args; replace(_s.begin(), _s.end(), ',', ' ');\
stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);\
}
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cerr<< *it << " = " << a <<",\n"[++it==istream_iterator<string>()];
err(it, args...);
}
#define scc(n) scanf("%lld",&n);
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
const int N=3e6+9,mod=998244353;
ll a[N];
int main()
{
// ios::sync_with_stdio(0);
// cin.tie(NULL);
// cout.tie(NULL);
for(int i=1;i<=2e5;i++)
{
for(int j=1;j<=2e5;j++)
{
if(i*j>2e5)break;
for(int k=1;k<=2e5;k++)
{
if(i*j*k>2e5)break;
a[i*j*k]++;
}
}
}
for(int i=1;i<=2e5;i++)a[i]+=a[i-1];
int p;
cin>>p;
cout<<a[p]<<endl;
return 0;
}
| #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#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 mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int n;
cin >> n;
double sum=0;
for (int i=n-1;i>0;--i)
{
sum+=(double)1/i;
}
cout << setprecision(16) << sum*n << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const char nl = '\n';
const double eps = 1e-6;
const int N = 110;
int n, D, H;
int d[N], h[N];
int main() {
ios::sync_with_stdio(false);
//cin.tie(nullptr);
priority_queue<double, vector<double>, greater<double>> q;
cin >> n >> D >> H;
for (int i = 0; i < n; ++i) {
cin >> d[i] >> h[i];
double t = (double)(H - h[i]) / (D - d[i]);
q.push(t);
}
double k = q.top();
double b = H - k * D;
if (b > 0) cout << b << nl;
else cout << "0.0" << nl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
cout << fixed << setprecision(20);
int n,D,H;
cin >> n >> D >> H;
vector<int> d(n);
vector<int> h(n);
rep(i,n){
cin >> d[i] >> h[i];
}
double ans = 0;
rep(i,n){
double tmpAns = H - D * (double(H-h[i])/double(D-d[i]));
ans = max(ans, tmpAns);
}
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <random>
#include <chrono>
#include <queue>
#include <utility>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <limits>
#define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define showv(v) for(int i : v) cout << i << ' '; cout << '\n';
#define show(begin, end) for(auto it = begin; it != end; it++) cout << *it << ' '; cout << '\n';
#define MAXN 300005
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef long double ld;
int inf = 1e9 + 9;
int mod = 1e9 + 7;
vector<ll> sieve(ll n) {
vector<bool> prime(n, true);
prime[0] = prime[1] = false;
for(int i = 2;i < n;i++)
if(prime[i])
for(int j = 2 * i;j < n;j += i)
prime[j] = false;
vector<ll> primes;
for(ll i = 0;i < n;i++)
if(prime[i]) primes.push_back(i);
return primes;
}
ll bpow(ll a, ll n, ll m) {
if(n == 0)
return 1;
if(n & 1) {
ll res = bpow(a, n - 1, m);
res = (res * a) % m;
return res;
} else {
ll res = bpow(a, n / 2, m);
res = (res * res) % m;
return res;
}
}
void solve() {
ll n, m; cin >> n >> m;
ll mm = m * m;
// (10 ^ n) % m = a
// 10 ^ n = p * m * m + b * m + a
// (10 ^ n( % mm =
ll a = bpow(10, n, m);
ll c = bpow(10, n, mm);
ll b = (c - a) / m;
cout << b << endl;
}
int main() {
faster
auto start = high_resolution_clock::now();
int test; test = 1;
while(test--) {
solve();
}
auto stop = high_resolution_clock::now();
double duration = duration_cast<milliseconds>( stop - start ).count() * 1.0;
// cout << "Time taken by function: " << duration << " ms " << endl;
return 0;
}
| #include "iostream"
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
using namespace:: std;
long long int pow (long long int n, long int k, long int m)
{
if (k == 1)
return n;
else if (k % 2 == 0)
return ((pow (n, k / 2, m) % m * pow (n, k / 2, m) % m) % m);
else
return ((pow (n, k - 1, m) % m * (n % m)) % m);
}
int main()
{
long long int n, m;
cin>>n>>m;
cout<<(pow (10, n, m * m) / m) % m;
return 0;
}
|
// Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED) ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy() int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll) (coll.find(el) != coll.end())
#define FOR(i, a, b) for(int i=a; i<=b; i++)
#define FORD(i, a, b) for(int i=a; i>=b; i--)
#define MP make_pair
#define PB push_back
#define ff first
#define ss second
#define deb(X) X;
#define M 998244353
#define INF 1000000007LL
using namespace std;
int n, m, a, b, k, ilep[5005][5005], iled[5005][5005];
long long pot[5005];
char z[5005][5005];
long long tab[5005][5005];
int main()
{
pot[0] = 1;
FOR(i, 1, 5003)
pot[i] = (pot[i-1]*3)%M;
scanf("%d %d %d", &n, &m, &k);
forr(i, k)
{
scanf("%d %d", &a, &b);
scanf(" %c", &z[a][b]);
}
FORD(i, n, 1)
FORD(j, m, 1)
{
ilep[i][j] = ilep[i][j+1] + (z[i][j] == 0 ? 1 : 0);
iled[i][j] = iled[i+1][j] + (z[i][j] == 0 ? 1 : 0);
}
FORD(i, n, 1)
FORD(j, m, 1)
{
if(i == n && j == m)
{
tab[i][j] = (z[i][j] == 0 ? 3 : 1);
continue;
}
long long d = (z[i][j] == 0 ? 2 : z[i][j] == 'R' ? 0 : 1);
long long r = (z[i][j] == 0 ? 2 : z[i][j] == 'D' ? 0 : 1);
d = d * pot[ilep[i][j+1]] % M;
r = r * pot[iled[i+1][j]] % M;
tab[i][j] = (d * tab[i+1][j] + r * tab[i][j+1]) % M;
//cout << i << ", " << j << " daje " << tab[i][j] << endl;
}
printf("%lld\n", tab[1][1]);
return 0;
}
| #include <unordered_map>
#include <numeric>
#include <vector>
#include <iostream>
using namespace std;
constexpr int M = 998244353;
int main() {
int h, w, k; cin >> h >> w >> k;
long long dp[2][w][3];
int cur = 0, prev = 1;
unordered_map<int, unordered_map<int, char> > f;
auto get = [&f](int i, int j) -> char {
if (f.find(i) == f.end()) return 0;
if (f[i].find(j) == f[i].end()) return 0;
return f[i][j];
};
while (k--) {
int h, w; char c; cin >> h >> w >> c;
f[h-1][w-1] = c;
}
vector<long long> vcount(w, 1);
for (int i = 0; i < h; i++) {
long long hcount = 1;
for (int j = 0; j < w; j++) {
long long val = 0;
if (i > 0) val += (dp[prev][j][1] + dp[prev][j][2]) * hcount % M;
if (j > 0) val += (dp[cur][j-1][0] + dp[cur][j-1][2]) * vcount[j] % M;
if (i == 0 && j == 0) val = 1;
char c = get(i, j);
// c == 'R' ? 0 : c == 'D' ? 1 : 2
if (c == 'R') {
dp[cur][j][0] = val;
dp[cur][j][1] = dp[cur][j][2] = 0;
} else if (c == 'D') {
dp[cur][j][1] = val;
dp[cur][j][0] = dp[cur][j][2] = 0;
} else if (c == 'X') {
dp[cur][j][2] = val;
dp[cur][j][0] = dp[cur][j][1] = 0;
} else {
dp[cur][j][0] = dp[cur][j][1] = dp[cur][j][2] = val;
}
if (c == 0) {
hcount = hcount * 3 % M;
vcount[j] = vcount[j] * 3 % M;
}
// cerr << i << ' ' << j << ' ' << c << ' ' << dp[cur][j][0] << ' ' << dp[cur][j][1] << ' ' << dp[cur][j][2] << endl;
}
swap(cur, prev);
}
cout << accumulate(dp[prev][w-1], dp[prev][w-1]+3, 0LL) % M << endl;
}
|
#include<cstdio>
#define MOD 1000000007
#define MAX_X 2000000
int f[2000006];
int inv_f[2000006];
int pow(int x, int y) {
if (y == 0) {
return 1;
}
if (y % 2 == 0) {
return pow(1ll * x * x % MOD, y / 2);
} else {
return 1ll * x * pow(x, y - 1) % MOD;
}
}
int inv(int x) {
return pow(x, MOD - 2);
}
int nCr(int n, int r) {
if (n < r) {
return 0;
}
return (1ll * f[n] * inv_f[r] % MOD) * inv_f[n - r] % MOD;
}
int n, m, k;
int main() {
f[0] = 1;
for (int i = 1; i <= MAX_X; i++) {
f[i] = 1ll * i * f[i - 1] % MOD;
}
inv_f[MAX_X] = inv(f[MAX_X]);
for (int i = MAX_X; i > 0; i--) {
inv_f[i - 1] = 1ll * i * inv_f[i] % MOD;
}
scanf("%d %d %d", &n, &m, &k);
if (n - m >= k + 1) {
printf("0\n");
return 0;
}
int ans = ((nCr(m + n, n) - nCr(m + n, k + m + 1) % MOD) + MOD) % MOD;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define irreps(i, m, n) for (int i = ((int)(n)-1); i > (int)(m); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) (int)(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
using ld = long double;
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; }
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
const ll INF = 1e9+10;
// const ll MOD = 1e9+7;
const ll MOD = 998244353;
const ll LINF = 1e18;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
(a *= a) %= MOD;
n >>= 1;
}
return res;
}
const ll maxf = 10000000;
ll fact[maxf+5];
ll ifact[maxf+5];
void fact_init(){
fact[0] = 1;
for(ll i=1; i<=maxf; i++) fact[i] = (fact[i-1] * i) % MOD;
ifact[maxf]=modpow(fact[maxf],MOD-2);
for(ll i=maxf; i>=1; i--) ifact[i-1] = (ifact[i] * i) % MOD;
}
ll comb(ll n, ll r){
if(n<r || n<0 || r<0) return 0;
if(fact[0] == 0) fact_init();
return ((fact[n] * ifact[n-r]) % MOD * ifact[r]) % MOD;
}
ll naive_comb(ll n, ll r){
ll res = 1;
for (ll i = n; i > n - r; i--) res = res * i % MOD;
for (ll i = 1; i <= r; i++) res = (res * modpow(i, MOD-2)) % MOD;
return res;
}
// 考えたこと
// sumがmで、xorが0
// bitの重複はない？ => 重複なかったら0にならない
// mのあるbitが立っている => その直前のbitが2個立っている そのbitはsumでは桁上がり and xorでは0になる
// => mの下一桁が1なら作れない
// 16を作りたい
// 8 8 でも良いが 4 4 4 4 でも良い 2 2 2 2 2 2 2 2
// n=4として、24を作ることを考える
// 16を作るのに4を4個にすると、8を作るための4が足りなくなる => 2を4個でも事足りる
// 28を考える
// 4を4個、2を4個、1を4個
// 16を作る 4を2個、2を4個
// あるビットをxorが0にして立たせようとすると二分木っぽくなる
// 各bitを偶数個に分割
// あるbitは
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
int n,m; cin>>n>>m;
int logM=0;
int M=m;
vc<int> a;
while(M){
logM++;
a.push_back(M&1);
M>>=1;
}
// cout<<logM<<endl;
// rep(i,a.size()) cout<<a[i]<<' ';
// cout<<endl;
vc<vc<ll>> dp(logM+1, vc<ll>(n+1));
if(a[0]==1){
cout<<0<<endl;
return 0;
}
dp[0][0]=1;
rep(i,logM-1){
for(int j=0; j<=n; j++){
for(int k=0; k<=n; k+=2){
if((j+k)/2%2==a[i+1])
(dp[i+1][(j+k)/2]+=dp[i][j]*comb(n,k)%MOD)%=MOD;
}
}
}
// rep(i,n+1) cout<<dp[logM-1][i]<<' ';
// cout<<endl;
cout<<dp[logM-1][1]<<endl;
} |
//kapi kapi spaghetti
#include <iostream>
#include <iomanip> //setprecision(12)
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
using pll=pair<ll,ll>;
int main()
{
ll N;
cin>>N;
vector<vector<ll>> edge(N);
for(ll i=1; i<N; i++)
{
ll p;
cin>>p;
--p;
edge[p].push_back(i);
}
auto solve=[&](auto& solve, pll now)->pll//( vertex, turn(1:first,-1:second) )
{
ll from=now.first, turn=now.second;
pll res;
res.first=1*turn;
turn*=-1;
res.second=turn;
vector<pll> w,d,l;
for(auto to:edge[now.first])
{
pll temp=solve(solve,pll(to,-turn));
if(temp.first>0&&temp.second==turn) w.push_back(temp);
else if(temp.first<=0&&temp.second==turn) l.push_back(temp);
else d.push_back(temp);
}
if(turn==1)
{
for(auto a:w) res.first+=a.first;
sort(d.begin(), d.end(), [](pll a, pll b)
{
return a.first>b.first;
});
for(ll i=0; i<d.size(); i++)
{
res.first+=d[i].first*turn;
turn*=-1;
}
res.second=turn;
for(auto a:l) res.first+=a.first*turn;
res.second*=-1;
}
else
{
for(auto a:l) res.first+=a.first;
sort(d.begin(), d.end(), [](pll a, pll b)
{
return a.first<b.first;
});
for(ll i=0; i<d.size(); i++)
{
res.first+=d[i].first*(-turn);
turn*=-1;
}
res.second=turn;
for(auto a:w) res.first+=a.first*(-turn);
res.second*=-1;
}
//cout<<from<<": "<<res.first<<" "<<res.second<<endl;
return res;
};
pll res=solve(solve,pll(0,1));
//cout<<res.first<<" "<<res.second<<endl;
cout<<(N+res.first)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())
void _cin() {} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail) { cin >> head; _cin(forward<Tail>(tail)...); }
#define cin(Type, ...) Type __VA_ARGS__; _cin(__VA_ARGS__)
#define cinv(Type, xs, n) vector<Type> xs(n); rep(i, n) cin >> xs[i]
#define cinv2(Type, xs, ys, n) vector<Type> xs(n), ys(n); rep(i, n) cin >> xs[i] >> ys[i]
#define cinv3(Type, xs, ys, zs, n) vector<Type> xs(n), ys(n), zs(n); rep(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define cinvv(Type, xs, h, w) vector<vector<Type>> xs(h, vector<Type>(w)); rep(i, h) rep(j, w) cin >> xs[i][j]
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail) != 0) cout << " "; print(forward<Tail>(tail)...); }
template <class Type> void print(vector<Type> &vec) { for (auto& a : vec) { cout << a; if (&a != &vec.back()) cout << " "; } cout << endl; }
template <class Type> void print(vector<vector<Type>> &df) { for (auto& vec : df) { print(vec); } }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void yesno(bool b) { cout << (b ? "yes" : "no") << endl; }
template<class Integer>bool chmax(Integer &a, const Integer &b) { if (a < b) { a = b; return 1; } return 0; }
template<class Integer>bool chmin(Integer &a, const Integer &b) { if (b < a) { a = b; return 1; } return 0; }
using ll = long long;
using P = pair<int, int>;
vector<vector<int>> ch(110000);
int calc(int &T, int &A, int p=0) {
T = 1;
A = 0;
int N = 1;
if (len(ch[p]) == 0) return N;
vector<tuple<int, int, int, int>> st;
for (auto c : ch[p]) {
int t, a;
int n = calc(t, a, c);
N += n;
st.emplace_back((n % 2) ? 1 : (a - t > 0) ? 0 : 2, t - a, t, a);
}
sort(all(st));
int i = 0;
for (auto [o, s, t, a] : st) {
if (o) {
if (i % 2) swap(t, a);
if (o == 1) i++;
}
T += t;
A += a;
}
return N;
}
void Main() {
cin(int, n);
for (int i = 1; i < n; i++) {
cin(int, p);
p--;
ch[p].emplace_back(i);
}
int t, a;
calc(t,a);
print(t);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
//cout << fixed << setprecision(16);
//int t; cin >> t; while (t--)
Main();
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int N, p, b=0; cin >> N; int A[200001]={};
REP(i, N){
cin >> p; A[p]=1;
for(int j=b; j<=200000; j++){ if(A[j]==0){ cout << j << "\n"; b=j; break; } }
}
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n" //interactive
#define fi first
#define se second
#define pb push_back
#define int long long
#define ll long long
#define ld long double
#define pii pair<ll,ll>
typedef vector<int> vi;
#define read(t) ll t;cin>>t;
#define all(value) value.begin(),value.end()
#define f(a,b,c) for(ll a=b;a<c;a++)
#define F(i,n) for(ll i=0;i<n;i++)
#define deb(value) cerr << #value << " is =" << value << endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) ;
typedef tree<pair<ll,ll>, null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_statistics_node_update> omultiset; // store ind on sec
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> oset;
typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> oset1; // decreasing
/* member functions :
1. order_of_key(k) : number of elements strictly lesser than k
2. find_by_order(k) : k-th element in the set (counting from zero)*/
//a.erase(unique(a.begin(),a.end()),a.end());
double pi=3.141592653589793238462641;
ll dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
const int mod = 1e9+7 ;
const int mod2 = 998244353;
const int inf = 1e18;
long long binpow(int a,int b,int m)
{
a %= m;int res = 1;
while (b > 0)
{
if (b & 1)res=(res*a)%m;
a=(a*a)%m ; b/=2;
}
return res;
}
int modinv(int n,int m) {return binpow(n,m-2,m);}
const int man=2e5+5;
/*
$ don't apply unnecessary operations
$ do check boundary cases (i==1/n-1/n)
$ change approach / use pen ? paper
$ Don't stuck! :- * re-solve
* check for another sol
* check function , cal
*/
/*......................................................................................................................*/
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int a=(2*i)%n;
if(a==0)a=n;
int b=(2*i+1)%n;
if(b==0)b=n;
cout<<a<<" "<<b<<endl;
}
}
signed main()
{
fast;
int test=1;
// cin>>test;
while(test--)solve();
return 0;
} |
#include <iostream>
#include <vector>
#include<string>
#include <algorithm>
#include <cmath>
#include <map>
#include <utility>
#define ll long long
using namespace std;
int mul(int n){
int ans = 1;
for(int i = 0;i < n;i ++)ans *= 2;
return ans;
}
int main(){
int num,mem;
cin >> num;
cin >> mem;
vector<vector<int>> sat(mem,vector<int>(2));
for(int i = 0;i < mem;i ++){
for(int j = 0;j < 2;j ++){
int a;
cin >> a;
sat[i][j] = a-1;
}
}
int pep;
cin >> pep;
vector<vector<int>> loc(pep,vector<int>(2));
for(int i = 0;i < pep;i ++){
for(int j = 0;j < 2;j ++){
int a;
cin >> a;
loc[i][j] = a-1;
}
}
int ans = 0;
for(int i = 0;i < mul(pep);i ++){
vector<int> dish(num,0);
for(int j = 0;j < pep;j ++){
int f = (i/mul(j)) % 2;
dish[loc[j][f]] = 1;
}
int sum = 0;
for(int j = 0;j < mem;j ++){
if(dish[sat[j][0]] == 1 and dish[sat[j][1]] == 1) sum++;
}
if(sum > ans)ans = sum;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define itn int
#define fi first
#define se second
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h,w;
int a[105][105],sum=0,m;
cin>>h>>w;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
if(i==0&&j==0) m=a[i][j];
}
}
for(int i=0;i<h;i++) for(int j=0;j<w;j++) m=min(m,a[i][j]);
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
sum+=(a[i][j]-m);
}
}
cout<<sum<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define yes "Yes"
#define no "No"
#define rep(i, n) for( int i=0; i<(n); i++)
const long long INF = 1LL << 60;
template<class T> inline bool chmin(T& a, T b) {if(a>b){a=b; return 1;} return 0; }
template<class T> inline bool chmax(T& a, T b) {if(a<b){a=b; return 1;} return 0; }
int main(){
int n,k;
cin >> n >> k;
vector<vector<int>> a(n, vector<int>(n));
rep(i,n) rep(j,n) cin >> a[i][j];
int L = (k*k/2)+1;
ll wa=-1, ac = 1001001000;
while (wa+1 < ac)
{
ll wj = (wa + ac)/2;
bool ok = false;
vector<vector<int>> s((n+1), vector<int>(n+1));
rep(i, n) rep(j ,n) s[i+1][j+1] = a[i][j]>wj?1:0;
rep(i, n+1) rep(j, n) s[i][j+1] += s[i][j];
rep(i, n) rep(j, n+1) s[i+1][j] += s[i][j];
rep(i, n-k+1)rep(j, n-k+1){
int now=s[i+k][j+k];
now -= s[i][j+k];
now -= s[i+k][j];
now += s[i][j];
if(now < L) ok = true;
}
if(ok) ac = wj; else wa = wj;
}
cout << ac << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int N=3000;
int n,k;
int a[N][N],sum[N][N];
bool check(int x)
{
memset(sum,0,sizeof sum);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
if(a[i][j]<=x) sum[i][j]--;
else sum[i][j]++;
}
}
for(int i=k;i<=n;i++)
{
for(int j=k;j<=n;j++)
{
if(sum[i][j]-sum[i-k][j]-sum[i][j-k]+sum[i-k][j-k]<=0) return true;
}
}
return false;
}
int main()
{
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
int l =0,r=1e9;
while(l<r)
{
int mid = l+r>>1;
if(check(mid)) r=mid;
else l=mid+1;
}
printf("%d\n",r);
} |
// Why Stop Now...
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
#define el "\n"
#define n_l "\n"
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
clock_t time_p=clock();
void TLL() {
time_p=clock()-time_p;
cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
template<typename T>
void print(T v){
for(auto i:v){
cout<<i<<" ";
}
cout<<el;
}
int main(){
int t=1; //cin>>t;
while (t--){
string a,b; cin>>a>>b;
ll x1=0,x2=0;
for(auto i:a) x1+=i-'0';
for(auto i:b) x2+=i-'0';
cout<<max(x1,x2)<<el;
}
}
| #include <bits/stdc++.h>
using namespace std;
int dp[1<<18];
int n,m;
int edge[20];
void init(){
for(int i=0;i<n;i++)
edge[i] = edge[i] | (1<<i);
}
int main(){
cin>>n>>m;
init();
while(m--){
int a,b,a1,b1;
cin>>a>>b;
a1=a-1 ,b1=b-1; //二进制从 0 开始 ,点的序列号改为:0~n-1
edge[a1] = edge[a1] | (1<<b1); //将 b-1位改成 1
edge[b1] = edge[b1] | (1<<a1);
}
memset(dp,0x3f,sizeof(dp));
dp[0] = 0;
for(int state = 1; state < (1<<n) ; state++){
//判定集合state是否是完全图
int complete = 1;
for(int j=0;j<n;j++){
if( state>>j&1 && (edge[j]&state) != state){
complete = 0;
}
}
//完全图，则强连通分量为 1
if(complete) dp[state] = 1;
//枚举当前集合的所有子集
//state二进制位上为 0的，j该位必须为 0
for(int j=state; j>0; j=(j-1)&state){
dp[state] = min(dp[state] , dp[state-j]+dp[j]);
}
}
cout<<dp[(1<<n)-1]<<endl;
} |
#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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int N, A[205], mem[205][205][205][2][2][2];
bool dp(int n, int a, int b, bool c, bool d, bool e) {
if (n == 0) return a == b && c && d && e;
if (mem[n][a][b][c][d][e] != -1) return mem[n][a][b][c][d][e];
mem[n][a][b][c][d][e] = (dp(n - 1, (a + A[n]) % 200, b, 1, d, 1) || dp(n - 1, a, (b + A[n]) % 200, c, 1, 1) || dp(n - 1, a, b, c, d, e) || dp(n - 1, (a + A[n]) % 200, (b + A[n]) % 200, 1, 1, e));
return mem[n][a][b][c][d][e];
}
main() {
memset(mem, -1, sizeof mem);
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
A[i] %= 200;
}
if (dp(N, 0, 0, 0, 0, 0)) {
cout << "Yes\n";
vector<int> fst, snd;
for (int a = N, b = 0, c = 0, d = 0, e = 0, f = 0; a; ) {
if (dp(a - 1, (b + A[a]) % 200, c, 1, e, 1)) {
fst.pb(a);
b = (b + A[a]) % 200;
a--;
d = f = 1;
} else if (dp(a - 1, b, (c + A[a]) % 200, d, 1, 1)) {
snd.pb(a);
c = (c + A[a]) % 200;
a--;
e = f = 1;
} else if (dp(a - 1, b, c, d, e, f)) {
a--;
} else {
assert(dp(a - 1, (b + A[a]) % 200, (c + A[a]) % 200, 1, 1, f));
snd.pb(a);
fst.pb(a);
b = (b + A[a]) % 200;
c = (c + A[a]) % 200;
a--;
d = e = 1;
}
}
sort(fst.begin(), fst.end());
sort(snd.begin(), snd.end());
cout << fst.size() << ' ';
for (int i : fst) cout << i << ' ';
cout << '\n';
cout << snd.size() << ' ';
for (int i : snd) cout << i << ' ';
cout << '\n';
} else {
cout << "No\n";
}
}
| #include<bits/stdc++.h>
#define LL long long
#define ull unsigned long long
#define pii pair<int, int>
#define lson (o << 1)
#define rson (o << 1 | 1)
#define mp make_pair
#define fi first
#define se second
using namespace std;
template <class T> T gi() {
T x = 0; bool f = 0; char c = getchar();
while (c != '-' && (c < '0' || c > '9')) c = getchar();
if (c == '-') f = 1, c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return f ? -x : x;
}
const int N = 5010, Mod = 998244353;
void pls(int &x, int y) { x += y; if (x >= Mod) x -= Mod; }
int fpow(int a, int b) {
int res = 1;
for (; b; b >>= 1, a = 1ll * a * a % Mod)
if (b & 1) res = 1ll * res * a % Mod;
return res;
}
int pw[N];
int main() {
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
int n = gi<int>(), m = gi<int>();
int ans = 1ll * fpow(m, n) * n % Mod;
pw[0] = 1; for (int i = 1; i <= n; i++) pw[i] = 1ll * pw[i - 1] * m % Mod;
for (int j = 1; j <= m; j++)
for (int i = 0, t = 1; i <= n - 2; i++, t = 1ll * t * (m - j) % Mod)
pls(ans, Mod - 1ll * (n - i - 1) * t % Mod * pw[n - i - 2] % Mod);
printf("%d\n", ans);
return 0;
}
|
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define maxn 505
#define ll long long
#define mo 998244353
using namespace std;
int n,m,i,j,k,a[maxn][maxn],c[3];
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
char ch=getchar();
while (ch!='R'&&ch!='B'&&ch!='.') ch=getchar();
for(j=1;j<=m;j++) a[i][j]=(ch=='.')?0:((ch=='R')?1:2),ch=getchar();
}
ll ans=1;
for(i=2;i<=n+m;i++){
c[0]=c[1]=c[2]=0;
for(j=1;j<i;j++) if (j>=1&&j<=n&&i-j>=1&&i-j<=m)
c[a[j][i-j]]++;
if (c[1]&&c[2]) printf("0\n"),exit(0);
if (!c[1]&&!c[2]) ans=ans*2%mo;
}
printf("%lld\n",ans);
} | //デバッグ用オプション：-fsanitize=undefined,address
//コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
//FORAは範囲for文(使いにくかったら消す)
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//xにはvectorなどのコンテナ
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
//定数
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
int gcd(int x, int y) {
int m = min(x, y);
for(int d=m; d>0; d--) {
if(x % d == 0 && y % d == 0) {
return d;
}
}
}
signed main(){
//小数の桁数の出力指定
//cout<<fixed<<setprecision(10);
//入力の高速化用のコード
//ios::sync_with_stdio(false);
//cin.tie(nullptr);
int n,max,maxnum;
std::vector<int> a(100),b(1000,0);
cin >> n;
REP(i,n){
cin >> a[i];
}
max = 0;
maxnum = 2;
FOR(i,2,1000){
REP(j,n){
if(a[j]>=i){
if(a[j]%i==0){
b[i]++;
}
}
}
if(max<b[i]){
max = b[i];
maxnum = i;
}
}
cout << maxnum << endl;
return 0;
} |
#include <iostream>
#define ll long long int
#define MN (int)200100
using namespace std;
ll md = 998244353;
ll ncr[MN+2][55];
ll minP[MN+2];
ll sol[MN+2];
int main(){
minP[1] = 1;
//eratosten;
for(int i=2; i<MN; i++)
if(!minP[i]) for(int j=1; j*i<MN; j++) if(!minP[i*j]) minP[i*j]=i;
//ncr
for(int i=1; i<MN; i++)
for(int j=0; j <=min(i, 55); j++){
if(j==0 or j==i) ncr[i][j] = 1;
else ncr[i][j] = (ll)(ncr[i-1][j] + ncr[i-1][j-1]) % md;
}
ll n, m;
cin >> n >> m;
sol[1] = 1;
for(ll i=2; i<MN; i++){
sol[i] = 1;
ll ii = i;
while(ii > 1){
ll j = 0;
ll p = minP[ii];
while(ii%p==0) ii/=p, j++;
sol[i] *= ncr[n - 2 + j][j];
sol[i] = sol[i] % md;
}
sol[i] = (sol[i]+sol[i-1]) % md;
}
ll ans = 0;
for(int i=1; i<=m; i++){
int max = m/i;
ans = ans + sol[max];
ans = ans % md;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
int lg(ll n) {
assert(n > 0);
int ans = -1;
while (n) {
ans++;
n >>= 1;
}
return ans;
}
void solve() {
int A, B;
cin >> A >> B;
if (A > B)
B--;
else
A--;
for (int i = 0; i < A; i++) {
cout << i + 1 << ' ';
}
for (int i = 0; i < B; i++) {
cout << -(i + 1) << ' ';
}
cout << (B * (B + 1) - A * (A + 1)) / 2 << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
double A, B; cin >> A >> B;
cout.precision(10);
cout << A * B * 0.01 << "\n";
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
int A, B;
int main(int argc, const char * argv[]) {
// insert code here...
scanf("%d %d", &A, &B);
double ans = (double)(A * B) / 100;
printf("%f", ans);
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <numeric>
#include <bitset>
#include <functional>
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
{ 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<ll> w(n);
ll max_w = 0LL;
for(int i=0;i<n;++i) {
cin >> w[i];
max_w = max(max_w, w[i]);
}
vector<Pll> wl(m); // {重さ制限, 長さ}
ll min_lim_w = LINF;
for(int i=0;i<m;++i) {
cin >> wl[i].second >> wl[i].first;
min_lim_w = min(min_lim_w, wl[i].first);
}
sort(wl.begin(), wl.end());
if(max_w > min_lim_w) {
cout << -1 << endl;
return 0;
}
set<Pll> st; // {長さ, 重さ制限}
set<Pll> st2; // {重さ制限, 長さ}
// 重さ制限はは今見てる奴が1番緩いはずなので、今まで見た長さで最長だった場合だけ入れる。
st.emplace(wl[0].second, wl[0].first);
st2.insert(wl[0]);
for(int i=1;i<m;++i) {
if(wl[i].second <= 0LL) continue;
ll l_max = st.rbegin()->first;
if(l_max < wl[i].second) {
st.emplace(wl[i].second, wl[i].first);
st2.insert(wl[i]);
}
}
vector<int> v(n);
for(int i=0;i<n;++i) v[i] = i;
ll ans = LINF;
do {
vector<ll> ws(n+1, 0LL);
ws[0] = 0LL;
for(int i=0;i<n;++i) {
ws[i+1] = ws[i] + w[v[i]];
}
vector<ll> xs(n, -1LL);
xs[0] = 0LL;
for(int i=1;i<n;++i) {
ll ng = xs[i-1]-1LL, ok = LINF;
while(ok - ng > 1LL) {
ll mid = (ok + ng) / 2;
bool isok = true;
for(int j=0;j<i;++j) {
auto itr = st.lower_bound(Pll(mid - xs[j] + 1, -LINF));
if(itr == st.end()) continue;
if(ws[i+1] - ws[j] > (itr->second)) {
isok = false;
break;
}
}
if(isok) {
ok = mid;
} else {
ng = mid;
}
}
xs[i] = ok;
}
// for(int i=0;i<n-1;++i) cerr << xs[i] << " ";
// cerr << xs[n-1] << endl;
ans = min(ans, xs[n-1]);
} while(next_permutation(v.begin(), v.end()));
cout << ans << endl;
} | // First of all Naste "_"
// Always check the fast IO is there or not
// always write functions for little things coz u repeat the variables
#include<bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long int ll;
#define endline '\n'
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define pb push_back
#define fr(i,a,b) for(ll i=a;i<(ll)b;i++)
#define rfr(i,a,b) for(int i=a;i>=(int)b;i--)
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
const int N = 29;
const ll mod=1e9+7;
ll mod_exp(ll x,ll y)
{
if(y<=0)
return(1);
else if(y%2==0)
return(mod_exp((x*x),y/2));
else
return((x*mod_exp((x*x),(y-1)/2)));
}
int visi[N];
vi v[N];
int col[N];
int lvl[N];
int dfs(int node)
{
visi[node]=1;
int ans1=1;
for(int it:v[node])
{
if(lvl[it]!=0&&lvl[it]!=lvl[node]+1)
{
if(col[it]==col[node])
{
ans1=0;
}
continue;
}
lvl[it]=lvl[node]+1;
ll temp=0;
fr(i,1,4)
{
if(i!=col[node])
{
col[it]=i;
temp+=dfs(it);
col[it]=0;
}
}
ans1*=temp;
}
return ans1;
}
void clear()
{
fr(i,0,N)
{
v[i].clear();
visi[i]=0;
col[i]=0;
lvl[i]=0;
}
}
int main()
{
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); std::cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w",stdout);
// freopen("debug.txt", "w", stderr);
#endif
int t=1;
// cin>>t;
while(t--)
{
clear();
int n,m; cin>>n>>m;
if(m==0)
{
cout<<mod_exp(3,n);
return 0;
}
while(m--)
{
int x,y; cin>>x>>y;
v[x].pb(y),v[y].pb(x);
}
// ll c=0;
ll ans=1;
fr(i,1,n+1)
{
if(visi[i]==0)
{
col[i]=1;lvl[i]=1;
ans*=3*dfs(i);
}
}
cout<<ans<<endline;
}
#ifndef ONLINE_JUDGE
cout<<"\nTime Elapsed: " << 1.0*clock() / CLOCKS_PER_SEC << " sec\n";
#endif
} |
/*************************************************************************
> File Name: 1.cpp
> Author: Knowledge_llz
> Mail: [email protected]
> Blog: https://blog.csdn.net/Pig_cfbsl
> Created Time: 2020/10/11 22:45:26
************************************************************************/
#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define pb push_back
#define pr pair<int,int>
#define fi first
#define se second
#define LL long long
#define mk(a,b) make_pair(a,b)
using namespace std;
int read(){
char x=getchar(); int u=0,fg=0;
while(!isdigit(x)){ if(x=='-') fg=1; x=getchar(); }
while(isdigit(x)){ u=(u<<3)+(u<<1)+(x^48); x=getchar(); }
return fg?-u:u;
}
const int maxx=1e5+10;
int n,m,sum=0,cnt=0,mx;
int w[10],tmp[10],s[10],dis[10],v[maxx],l[maxx];
int p[10]={0,1,2,3,4,5,6,7,8};
pr a[maxx];
bool cmp(pr x,pr y){
if(x.fi!=y.fi) return x.fi<y.fi;
return x.se>y.se;
}
int iso(int x){
x=lower_bound(v+1,v+cnt+1,x)-v-1;
return l[x];
}
int solve(){
s[0]=0;
For(i,1,n){ tmp[i]=w[p[i]]; s[i]=s[i-1]+tmp[i]; dis[i]=0;}
For(i,2,n) For(j,1,i-1) dis[i]=max(dis[i],dis[j]+iso(s[i]-s[j-1]));
// cout<<dis[3]<<endl;
return dis[n];
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
int u1,u2;
n=read(); m=read();
For(i,1,n){ w[i]=read(); mx=max(w[i],mx);}
For(i,1,m){
u1=read(); u2=read();
a[i]=mk(u2,u1);
if(u2<mx){ printf("-1\n"); return 0; }
}
sort(a+1,a+m+1,cmp);
v[++cnt]=a[1].fi; l[cnt]=a[1].se;
For(i,2,m)
if(a[i].se>l[cnt]){
v[++cnt]=a[i].fi;
l[cnt]=a[i].se;
}
int ans=1e9;
do{
ans=min(ans,solve());
// return 0;
}while(next_permutation(p+1,p+n+1));
printf("%d\n",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
vector<vector<P>> g;
ll a[100 * 100], b[100 * 100];
bool use[100 * 100], ans[100 * 100], usev[100];
void dfs(ll at){
usev[at] = true;
zep(i, 0, g[at].size()){
auto nx = g[at][i];
if(!usev[nx.first]){
if(!use[nx.second]){
use[nx.second] = true;
ans[nx.second] = (a[nx.second] == at);
}
dfs(nx.first);
}else{
if(!use[nx.second]){
use[nx.second] = true;
ans[nx.second] = (a[nx.second] == at);
}
}
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n, m; cin >> n >> m;
zep(j, 0, m){cin >> a[j] >> b[j]; a[j]--; b[j]--;}
ll c[n]; zep(i, 0, n)cin >> c[i];
g.resize(n);
zep(j, 0, m){
if(c[a[j]] > c[b[j]]){
ans[j] = true;
}else if(c[a[j]] < c[b[j]]){
ans[j] = false;
}else{
g[a[j]].push_back(P(b[j], j));
g[b[j]].push_back(P(a[j], j));
}
}
zep(i, 0, n)dfs(i);
zep(j, 0, m){
print(ans[j]? "->" : "<-")
}
return 0;
} |
//Author: Fuadul Hasan([email protected])
//BSMRSTU,Gopalganj
//#include<bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <random>
#include<iomanip>
#include <cassert>
#include <cstring>
#include <sstream>
#include <complex>
#include <numeric>
#include <iostream>
#include <algorithm>
#include <functional>
#include <unordered_set>
#include <unordered_map>
using namespace std;
//debug..........
#define error(args...) {vector<string>_v=split(#args,',');err(_v.begin(),args);cout<<endl;}
vector<string> split(const string &s, char c) {vector<string>v; stringstream ss(s); string x;while (getline(ss, x, c))v.emplace_back(x); return move(v);} void err(vector<string>::iterator it) {}
template<typename T, typename... Args>void err(vector<string>::iterator it, T a, Args...args) {cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " "; err(++it, args...);}
//............ignore it..................//
#define F first
#define S second
#define Pi atan(1)*4
#define mp make_pair
#define pb push_back
const int M = 1e9 + 7;
#define ld long double
#define ll long long int
#define happy cin.tie(0);
#define point(x) cout<<fixed<<setprecision(x)
int length(string s){return (int)s.size();}
#define mem(a) memset(a , 0 ,sizeof a)
#define memn(a) memset(a , -1 ,sizeof a)
#define coding ios::sync_with_stdio(false);
#define Unique(c) (c).resize(unique(all(c))-(c).begin())
#define vout(v) for (auto z: v) cout << z << " "; cout << endl;
int length(long long x){int l = 0;for(long long i=x;i;i/=10)l++;return l;}
int dx[8]= {1,0,-1,0,-1,-1,1,1};
int dy[8]= {0,1,0,-1,-1,1,-1,1};
#define rep(i,b,e) for(__typeof(e) i = (b) ; i != (e + 1) - 2 * ((b) > (e)) ; i += 1 - 2 * ((b) > (e)))
long long Inv_pow(long long a,long long n){ll res = 1;while(n){if(n&1) res = ((res%M)*(a%M))%M;a = ((a%M)*(a%M))%M;n>>=1;}return res%M;}
// suffix_prefix....
std::vector<ll> prefix_sum(std::vector<ll> a){int n = a.size();std::vector<ll> prf(n,0);for(int i=0;i<n;i++){
if(i == 0){prf[i] = a[i];}else{prf[i] = prf[i-1]+a[i];}}return prf;}
std::vector<ll> suffix_sum(std::vector<ll> a){int n = a.size();std::vector<ll>suf(n,0);for(int i=n-1;i>=0;i--){
if(i == n-1){suf[i] = a[i];}else{suf[i] = suf[i+1]+a[i];}}return suf;}
long long Lcm(long long a,long long b){return (((a)*(b)))/__gcd(a,b);}
#define Test cout<<"Case #"<<tc++<<": ";
int tc = 1;
inline void read(std::vector<int> &v){for(int i=0;i<(int)v.size();i++){cin>>(v[i]);}}
inline void readl(std::vector<ll> &v){for(int i=0;i<(int)v.size();i++){cin>>(v[i]);}}
template<class T> bool remin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool remax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
inline void read(int v[],int n){for(int i=0;i<n;i++){cin>>(v[i]);}}
inline void readl(ll v[],int n){for(int i=0;i<n;i++){cin>>(v[i]);}}
inline int add(int a, int b, int mod) {a += b ; return a >= mod ? a - mod : a ;}
inline int sub(int a, int b, int mod) {a -= b ; return a < 0 ? a + mod : a ;}
inline int mul(int a, int b, int mod) {return (ll)a * b % mod ;}
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(),n.end()
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 5e5 + 5;
const int NN = 1e6 + 5;
int solve()
{
//Test
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
if((a[0]+a[2]) == 2*a[1]){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
//error();
}
int main(){
happy coding
int test = 1;
//cin>>test;
while (test--)solve();return 0;
}
/*
Age doesn't make you mature Responsibility makes.
*/
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define powr(x,n,p) for(int axy=0 ; axy<p ; axy++){x=x*n;}
#define YES printf("YES\n")
#define Yes printf("Yes\n")
#define yes printf("yes\n")
#define NO printf("NO\n")
#define No printf("No\n")
#define no printf("no\n")
#define nl printf("\n")
#define fr0(n,q) for(q=0 ; q<n ; q++)
#define fr1(n,q) for(q=1 ; q<=n ; q++)
#define mp make_pair
#define scl(x) scanf("%lld",&x)
#define sci(x) scanf("%d",&x)
#define lst(x) x[x.size()-1]
#define llst(x) x[x.size()-2]
#define md 1000000007
#define check(x,y) (x&(1LL<<y))
#define set(x,y) x=x|(1<<y)
#define pi acos(-1)
#define inf (1<<30)
#include <stdio.h>
using namespace std;
vector < pair<int,int> > sum[5000005];
vector <set<int>> st;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n,m,k,i,j;
cin>>n>>m>>k;
vector < pair<int,int> > arr;
fr0(n,i){
int x,y;
cin>>x>>y;
arr.pb({y,x});
}
sort(arr.begin(),arr.end());
reverse(arr.begin(),arr.end());
int box[m+1];
for(i=1 ; i<=m ; i++) cin>>box[i];
while(k--){
int l,r;
cin>>l>>r;
multiset <int> tmp;
for(i=1 ; i<=m ; i++){
if(i>=l && i<=r) continue;
tmp.insert(box[i]);
}
//sort(tmp.begin(),tmp.end());
int ans=0;
for(i=0 ; i<n ; i++){
auto it=tmp.lower_bound(arr[i].second);
if(it==tmp.end()) continue;
ans+=arr[i].first;
tmp.erase(it);
}
cout<<ans;
nl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v)) //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
#define num_l(a,v) POSL(a,v) //v未満の要素数
#define num_eql(a,v) POSU(a,v) //v以下の要素数
#define num_h(a,v) (a.size() - POSU(a,v)) //vより大きい要素数
#define num_eqh(a,v) (a.size() - POSL(a,v)) //v以上の要素数
// static_cast< long long ll >
int main(){
ll H,W,X,Y;
cin >> H >> W >> X >> Y;
X--;Y--;
vector<string> S(H);
FOR(i,0,H){
cin >> S[i];
}
ll ans = 0;
for(int h = X; h>=0;h--){
if(S[h][Y] == '#')break;
ans++;
}
for(int h = X+1; h<H;h++){
if(S[h][Y] == '#')break;
ans++;
}
for(int w = Y-1; w>=0;w--){
if(S[X][w] == '#')break;
ans++;
}
for(int w = Y+1; w<W;w++){
if(S[X][w] == '#')break;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template<int M>
struct static_mint {
static_assert(0 < M, "Module must be positive");
int val;
static_mint() : val() {}
static_mint(long long x) : val(x % M) { if (val < 0) val += M; }
static_mint pow(long long n) const {
static_mint ans = 1, x(*this);
for (; n > 0; n /= 2) {
if (n & 1) ans *= x;
x *= x;
}
return ans;
}
static_mint inv() const {
return pow(M - 2);
}
static_mint operator+() const {
static_mint m;
m.val = val;
return m;
}
static_mint operator-() const {
static_mint m;
m.val = (val == 0 ? 0 : M - val);
return m;
}
static_mint &operator+=(const static_mint &m) {
if ((val += m.val) >= M) val -= M;
return *this;
}
static_mint &operator-=(const static_mint &m) {
if ((val -= m.val) < 0) val += M;
return *this;
}
static_mint &operator*=(const static_mint &m) {
val = (long long) val * m.val % M;
return *this;
}
static_mint &operator/=(const static_mint &m) {
val = (long long) val * m.inv().val % M;
return *this;
}
friend static_mint operator+(const static_mint &lhs, const static_mint &rhs) {
return static_mint(lhs) += rhs;
}
friend static_mint operator-(const static_mint &lhs, const static_mint &rhs) {
return static_mint(lhs) -= rhs;
}
friend static_mint operator*(const static_mint &lhs, const static_mint &rhs) {
return static_mint(lhs) *= rhs;
}
friend static_mint operator/(const static_mint &lhs, const static_mint &rhs) {
return static_mint(lhs) /= rhs;
}
friend bool operator==(const static_mint &lhs, const static_mint &rhs) {
return lhs.val == rhs.val;
}
friend bool operator!=(const static_mint &lhs, const static_mint &rhs) {
return lhs.val != rhs.val;
}
static_mint &operator++() {
return *this += 1;
}
static_mint &operator--() {
return *this -= 1;
}
static_mint operator++(int) {
static_mint result(*this);
*this += 1;
return result;
}
static_mint operator--(int) {
static_mint result(*this);
*this -= 1;
return result;
}
template<typename T>
explicit operator T() const {
return T(val);
}
friend std::ostream &operator<<(std::ostream &os, const static_mint &m) {
return os << m.val;
}
friend std::istream &operator>>(std::istream &is, static_mint &m) {
long long x;
return is >> x, m = x, is;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
using mint = static_mint<1000000007>;
int n;
cin >> n;
vector<long long> a(n);
for (auto &x : a) cin >> x;
vector<mint> dp(n + 1);
dp[0] = 1;
mint ans = 0;
for (int i = 1; i <= n; i++) {
vector<mint> new_dp(n + 1), sum_dp(i);
long long sum = 0;
sum_dp[0] = dp[0];
for (int j = 1; j <= n; j++) {
sum += a[j - 1];
new_dp[j] = sum_dp[sum % i];
sum_dp[sum % i] += dp[j];
}
dp.swap(new_dp);
ans += dp.back();
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n) for (ll i = 0; i < (ll)(n); i++)
#define fore(x,a) for(auto&(x) : (a))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define ALL(a) (a).begin(), (a).end()
const ll INFL = 1e18;
const int INFI = 1e9;
const int MOD = 1e9 + 7;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = -1;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] < 0) return x;
return par[x] = root(par[x]); //経路圧縮
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
// 要素数を片寄する
int sx = par[rx];
int sy = par[ry];
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
par[ry] = sx + sy;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) { // データxが属する木の根の要素数
return -par[root(x)];
}
};
int main(){
int N;
cin >> N;
vll A(N);
rep(i,N) {
cin >> A[i];
}
vll B,C;
ll M = N;
if(M % 2 == 1) M = (M - 1) /2;
else M /= 2;
B.resize(M);
C.resize(M);
set<ll> S;
repll(i, M){
B[i] = A[i];
C[i] = A[N - 1 - i];
if(B[i] != C[i]) {
S.insert(B[i]);
S.insert(C[i]);
}
}
map<ll, ll> bcmap;
ll cnt = 0;
fore(x, S) {
bcmap[x] = cnt;
cnt++;
}
ll size = S.size();
UnionFind uf(size);
repll(i, M){
if(B[i] != C[i]){
uf.unite(bcmap[B[i]], bcmap[C[i]]);
}
}
map<ll, ll> rmap;
set<ll> root;
repll(i, size){
rmap[uf.root(i)]++;
root.insert(uf.root(i));
}
ll ans = 0;
fore(x, root) {
ans += rmap[x] - 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long int
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vpi vector<pair<int,int>>
#define pii pair<int,int>
#define pb push_back
#define inf 1e18
#define ff first
#define ss second
#define deb(x) cout<<#x<<" "<<x<<endl;
#define all(x) x.begin(),x.end()
#define endl "\n"
const int maxn = 1e5;
void runcases(int T)
{
int n;
cin >> n;
string s;
cin >> s;
vi v(2 * n, 0);
for (int i = 0; i < 2 * n; i++) {
v[i] = i;
}
int q;
cin >> q;
int cnt = 0;
for (int i = 0; i < q; i++) {
int t, a, b;
cin >> t;
if (t == 1)
{ cin >> a >> b;
a--;
b--;
if (cnt)
{
if (a + n >= 2 * n)
{
a -= n;
} else {
a += n;
}
if (b + n >= 2 * n)
{
b -= n;
} else {
b += n;
}
}
swap(v[a], v[b]);
} else if (t == 2)
{
cin >> a >> b;
cnt = (cnt + 1) % 2;
}
}
// fo
string s1, s2;
for (int i = 0; i < n; i++)
{
s1.push_back(s[v[i]]);
}
for (int i = n; i < 2 * n; i++)
{
s2.push_back(s[v[i]]);
}
if (cnt)
{
cout << s2 << s1 << endl;
} else cout << s1 << s2 << endl;
//cout<<"Case #"<<T<<": ";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
//cin >> T;
for (int t = 1; t <= T; t++) {
runcases(t);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
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;}
#define rep(i,n) for(int i=0;i<(n);i++)
#define drep(i,n) for(int i=(n)-1;i>=0;i--)
template<class T> void print(vec<T>& v){rep(i,v.size()) cout << v[i] << (i+1!=(int) v.size()? " ":"\n");}
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr << #x << " = " << (x) << endl;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int M = 200;
vec<ll> cnt(M);
rep(i,N){
int a;
cin >> a;
cnt[a%200]++;
}
ll ans = 0;
rep(i,M) ans += cnt[i]*(cnt[i]-1)/2;
cout << ans << "\n";
} | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
const int MOD = 1'000'000'007;
const int MOD2 = 998'244'353;
const int INF = 1'000'000'000; //1e9
const int NIL = -1;
const long long LINF = 1'000'000'000'000'000'000; // 1e18
const long double EPS = 1E-10;
template<class T, class S> inline bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S> inline bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
int main(){
int N; std::cin >> N;
for(int i(0); i < N; ++i){
int a(2*i % N + 1), b((2*i+1) % N + 1);
std::cout << a << " " << b << "\n";
}
return 0;
}
|
//{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
// clang-format off
void _print() { cerr << "]\033[0m\n"; }
template <typename T> void __print(T x) { cerr << x; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#define debug(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m["; _print(x)
#define debug_arr(x...) cerr << "\033[1;34m[" << #x << "] = \033[1;32m" << (x) << "\033[0m\n"
#else
#define debug(x...)
#define debug_arr(x...)
#endif
// clang-format on
//}}}
int k;
int n;
string s;
const int mod = 1e9 + 7;
inline int ch2dig(char ch)
{
if (ch >= 'A' && ch <= 'F') return ch - 'A' + 10;
return ch - '0';
}
const int N = 2e5 + 10;
LL dp[N][20];
LL cnt[N];
LL dfs(int pos, int st, bool bound, bool zeros)
{
if (pos == -1) return __builtin_popcount(st) == k;
LL ret = 0;
if (bound && zeros)
{
int ed = bound ? ch2dig(s[pos]) : 15;
for (int i = 0; i <= ed; i++)
{
int new_st = st;
if (i) new_st |= (1 << i);
ret += dfs(pos - 1, new_st, bound && i == ed, zeros && i == 0);
ret %= mod;
}
debug(pos, st, bound, zeros, ret);
return ret;
}
if (bound && !zeros)
{
int ed = bound ? ch2dig(s[pos]) : 15;
for (int i = 0; i <= ed; i++)
{
int new_st = st | (1 << i);
ret += dfs(pos - 1, new_st, bound && i == ed, 0);
ret %= mod;
}
debug(pos, st, bound, zeros, ret);
return ret;
}
if (!bound && zeros)
{
for (int i = 0; i <= 15; i++)
{
int new_st = st;
if (i) new_st |= (1 << i);
ret += dfs(pos - 1, new_st, 0, zeros && i == 0);
ret %= mod;
}
debug(pos, st, bound, zeros, ret);
return ret;
}
if (dp[pos][__builtin_popcount(st)] != -1) return dp[pos][__builtin_popcount(st)];
if (!bound && !zeros)
{
for (int i = 0; i <= 15; i++)
{
int new_st = st | (1 << i);
ret += dfs(pos - 1, new_st, 0, 0);
ret %= mod;
}
}
debug(pos, st, bound, zeros, ret);
return dp[pos][__builtin_popcount(st)] = ret;
}
int main()
{
#ifdef LOCAL
freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
while (cin >> s >> k)
{
clr(dp, -1);
n = sz(s);
reverse(all(s));
LL ans = dfs(n - 1, 0, 1, 1);
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)
const int P = 1e9 + 7;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int N = 3e6 + 10;
int main()
{
IOS;
int n;
string str;
vector<int> v;
cin >> str >> n;
for(auto x : str)
if(x >= '0' && x <= '9') v.push_back((int)(x - '0'));
else v.push_back((int)(10 + x - 'A'));
vector<vector<int> > f(str.size() + 1, vector<int>(18, 0));
int state = 0;
for(int i = 0; i < (int)str.size(); ++ i)
{
for(int j = 1; j <= 16; ++ j)
{
f[i + 1][j] = (f[i + 1][j] + (LL)f[i][j] * j % P) % P;
f[i + 1][j + 1] = (f[i + 1][j + 1] + (LL)f[i][j] * (16 - j) % P) % P;
}
f[i + 1][1] = (f[i + 1][1] + (LL)f[i][0] * 15 % P) % P;
f[i + 1][0] = (f[i + 1][0] + f[i][0]) % P;
for(int j = 0; j < v[i]; ++ j)
{
int nstate = state;
if(i || j) nstate |= (1 << j);
f[i + 1][__builtin_popcount(nstate)] += 1;
}
state |= (1 << v[i]);
}
int res = f[str.size()][n] + (__builtin_popcount(state) == n);
cout << res << endl;
return 0;
} |
/*
quid-pro-quo: LOGIC for AC
written by: codercell07
LANG: C++ 11
Problem: random
*/
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(NULL)
#define testcases freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sz(x) (int)x.size()
#define pq priority_queue /*maxim at top(max-heap)*/
#define pqmax priority_queue<int, vector<int>, greater<int>> /*minim at top(min-heap)*/
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define asc(x) sort(all(x))
#define desc(x) sort(all(x), greater<int>())
#define time_el (double)time/CLOCKS_PER_SEC
using namespace std;
const int MAX=2e6; //dummy, make sure change as per constraints
const ll M=1e9+7, inf=1e18;
const char nl='\n';
ll apbmc(ll a, ll b, ll c){ a%=c; ll res=1; while(b){ if(b&1) res=res*a%c; a=a*a%c; b>>=1; } return res;}
ll apb(ll x, ll y){ ll temp; if(y==0) return 1; temp=apb(x, y/2); if(y%2==0) return temp*temp; else return temp*temp*x;}
void solve(){
//clock_t time;
ll n; cin>>n;
vll v(n);
for(ll &i: v)cin>>i;
ll md=0;
for(ll i: v) md+=abs(i);
ll ed=0;
for(ll i: v) ed+=(i*i);
ll cd=INT_MIN;
for(ll i=0; i<n; i++){
ll tmp=abs(v[i]);
cd=max(cd, tmp);
}
cout<<md<<nl;
cout<<sqrt(ed)<<nl;
cout<<cd;
}
int main(){
fastio;
// #ifndef ONLINE_JUDGE
// testcases;
// #endif // !DEBUG
cout<<fixed<<setprecision(15);
//int t; cin>>t; while(t--) solve();
solve();
return 0;
}
//points to check:
// * check for constraints, mainly array!
// * EDGE CASES
// * check for integer overflow, use long long!
// * learn, do, solve, share something, NOW! | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
typedef std::vector<std::vector<int64_t> > Graph;
#define rep(i, n) for (int64_t i = 0; i < n; ++i)
#define rep2(i, n) for (int64_t i = 1; i <= n; ++i)
#define repb(i, l, n) for (int64_t i = l; i < n; ++i)
#define repb2(i, l, n) for (int64_t i = l; i <= n; ++i)
#define repe(a, b) for (auto&(a) : (b))
#define ALL(v) (v).begin(), (v).end()
#define Sort(x) sort(ALL(x))
#define Sort_rev(x) Sort(x);reverse(ALL(x))
#define mp(a, b) make_pair((a), (b))
#define Push_back(a, b) push_back( mp( (a), (b) ) )
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename V,typename T> bool find_num(V v, T num) { if ( find(ALL(v), num) == v.end() ) { return false; } return true; }
const int inf = 0x3fffffff;
const int64_t INF = 0x3fffffffffffffff;
const int64_t MOD = 1e9+7;
int main() {
int64_t n;
cin >> n;
std::vector<int64_t> x(n);
int64_t man = 0, t = 0;
long double euclid = 0;
rep(i, n) {
cin >> x[i];
man += abs(x[i]);
euclid += abs(x[i])*abs(x[i]);
chmax(t, abs(x[i]));
}
euclid = sqrt(euclid);
cout << man << endl;
cout << setprecision(20) << euclid << endl;
cout << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define For(i, a, b) for (ll i = (a); i <= (b); i++)
#define Forx(i, a, b, x) for (ll i = (a); i <= (b); i+=x)
#define debug(x) cout <<" || "<< #x << " is= " << x <<endl; //use for debug
#define read(a) ll a; cin >> a;
#define Ford(i, a, b) for (ll i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define pr pair<ll,ll>
#define vpll vector<pair<ll,ll>>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend() //reverse of above;
#define sz(container) int((container).size())
#define cut(x) {cout<<x<<"\n"; continue;}
#define setprec(x) cout << fixed << showpoint << setprecision(15)<<x<<"\n";
#define time cout << clock() / double(CLOCKS_PER_SEC) << endl;
#define endl '\n';
#define mod 1000000007
#define mod1 998244353
#define pi 3.141592653589793238
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pr,null_type,less<pr>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
//*s.find_by_order() ->returns an iterator to the k-th largest element (counting from zero);
//s.order_of_key() ->number of elements strictly smaller then our item;
//st.rbegin()->second; last element in set
//st.erase(prev(st.end())); delete last element in set;
//sort(a+1,a+n+1,[](ll x,ll y){return abs(x)>abs(y);});
//sort(v.begin(), v.end(), greater<int>()); -> not sure work for first also if second are equal;
//q=lower_bound(all(v[a[i]]),i)-v[a[i]].begin()+1;
// s.substr(start_ind,length);
// vpll shift={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}} ->shift operator;
//bool comp(pr a,pr b){return a.second<b.second;} // use for differentiate order of comparision;
// cntbit(x) __builtin_popcount(x); -> no. of bits in given no.;
// true false; memset(dp,-1,sizeof(dp));
// std::random_shuffle(all(vec));
//░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
const ll MAXN=1e4+5;
const ll inf=1e18;
int main()
{
fast_io;
//“Don’t wish it were easier. Wish you were better.” – Jim Rohn;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n,k; cin>>n>>k;
ll dp[4][3*n+5];
memset(dp,0,sizeof(dp));
dp[0][0]=1;
// dp[i][j]=valid ways of sum j by choosing i no's. from 1 to n;
For(j,1,3*n) dp[0][j]+=dp[0][j-1];
For(i,1,3)
{
For(j,1,3*n)
{
dp[i][j]=dp[i-1][j-1];
if(j>n) dp[i][j]-=dp[i-1][j-n-1]; // as limit is n;
}
For(j,1,3*n) dp[i][j]+=dp[i][j-1];
}
// now we can fix sum for given k;
ll sum;
For(i,1,3*n) if(dp[3][i]>=k)
{
sum=i;
break;
}
ll a,b,c;
ll rem=k-dp[3][sum-1];
For(value,1,n) // now fixing beauty find rem.;
{
ll p=dp[2][sum-value]-dp[2][sum-value-1];
if(p<rem) rem-=p;
else
{
a=value;
b=1,c=sum-value-1;
while(c>n) c--,b++;
rem--;
while(rem--)
{
b++;
c--;
}
break;
}
}
cout<<a<<' '<<b<<' '<<c;
} | #pragma comment (linker, "/STACK:256000000")
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
const long double Ma_PI = 3.1415926535897932384626433832795028841971L;
#define eps 1e-7
#define LONG_INF 2000000000000000000LL
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*2
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long a = 0;a < b;++a)
#define ALL(x) (x).begin(),(x).end()
void init() {
iostream::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
unsigned long xor128() {
static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
unsigned long t = (x ^ (x << 11));
x = y; y = z; z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
typedef struct BigInt{
string s = "0";
BigInt operator +(BigInt obj) {
string c;
while (max(obj.s.length(), this->s.length()) + 1 > c.length()) {
c.pb('0');
}
for (int q = 0; q < obj.s.length(); ++q) {
c[c.length() - 1 - q] = obj.s[obj.s.length() - q - 1];
}
for (int q = 0; q < this->s.length(); ++q) {
c[c.length() - 1 - q] += this->s[this->s.length() - 1 - q] - '0';
if (c[c.length() - 1 - q] > '9') {
c[c.length() - 2 - q]++;
c[c.length() - 1 - q] -= 10;
}
}
if (c.front() == '0') {
c.erase(c.begin());
}
return BigInt{ c };
}
BigInt operator *(BigInt obj) {
BigInt ans;
for (int i = this->s.length() - 1; i >= 0; --i) {
REP(q, this -> s[i] - '0') {
ans = ans + obj;
}
obj.s.pb('0');
}
return ans;
}
}BigInt;
void solve() {
int n, k, m;
cin >> n >> k >> m;
int a = 0;
REP(i, n - 1) {
int b;
cin >> b;
a += b;
}
a = (n) * m - a;
a = max(a, 0);
if (a > k) {
cout << -1 << endl;
}
else {
cout << a << endl;
}
}
int main() {
init();
solve();
} |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout<< #X <<": "<<X<<" ";
#define DEB2(X) cout<<X<<" ";
#define END cout<<endl;
#else
#define DEB(X) {}
#define DEB2(X) {}
#define END {}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
//typedef std::pair<int,int> P;
struct edge{int to,cost;};
const int INF=100000000000000000;
const int INF2=9223372036854775807;
const int MOD=1000000007;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define min(X,Y) (((int)(X)<(int)(Y))?(X):(Y))
#define max(X,Y) (((int)(X)>(int)(Y))?(X):(Y))
#define NP(X,Y) next_permutation(X,Y)
#define setdouble(X,Y) cout<<fixed<<setprecision(X)<<Y
int ceil2(int a,int b){if(a%b==0){return a/b;}else{return a/b+1;}}
int pow2(int a,int b){int r=1;for(int i=1;i<=b;i++){r*=a;}return r;}
int Log2(int a){int t=0;while(1){if(a==0||a==1){break;}a/=2;t++;}return t;}
int N;
int A[200010];
set<int> U;
signed main(){
cin>>N;
REP(i,N){
cin>>A[i];
}
for(int i=0;i<=200010;i++){
U.insert(i);
}
REP(i,N){
U.erase(A[i]);
cout<<*U.begin()<<endl;
}
return 0;
}
| #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
int main() {
ll N, a;
cin >> N;
ll sum = 0, mx = 0, add = 0;
for (ll i = 1; i <= N; i++) {
cin >> a;
sum += a;
mx = max(mx, a);
cout << sum + i * mx + add << endl;
add += sum;
}
}
|
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'\n'
using namespace std; using ll = long long; template<class T>using vv = vector<vector<T>>;
template<class T>auto vvec(int n, int m, T v) { return vv<T>(n, vector<T>(m, v)); }
constexpr int INF = 1 << 29, MOD = int(1e9) + 7; constexpr ll LINF = 1LL << 60;
struct aaa { aaa() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); }; }aaaa;
int main() {
int K, N, M;
cin >> K >> N >> M;
vector<int> A(K);
rep(i, K) cin >> A[i];
vector<ll> B(K);
rep(i, K) {
B[i] = (double)((ll)A[i] * M) / N;
}
ll Bsum = accumulate(all(B), 0LL);
if (Bsum != M) {
vector<pair<ll, int>> x(K);
rep(i, K) {
x[i] = { abs((ll)B[i] * N - (ll)A[i] * M), i };
}
sort(all(x));
reverse(all(x));
rep(i, K) {
B[x[i].second]++;
Bsum++;
if (Bsum == M) break;
}
}
rep(i, K) {
cout << B[i] << (i == K - 1 ? "\n" : " ");
}
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif
template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << s << " = " << x << "\n";}
template <typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << s.substr(0, i) << " = " << x << " | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
long long n, m;
cin >> k >> n >> m;
vector<int> a(k);
for (int i=0; i<k; i++)
cin >> a[i];
long long l = 0, r = 2e18;
while (l < r) {
long long x = (l + r) / 2, lo = 0, hi = 0;
for (int i=0; i<k; i++) {
lo += (max(a[i] * m - x, 0LL) + n - 1) / n;
hi += (a[i] * m + x) / n;
}
if (lo <= m && m <= hi)
r = x;
else
l = x + 1;
}
vector<long long> lo(k), hi(k);
for (int i=0; i<k; i++) {
lo[i] = (max(a[i] * m - l, 0LL) + n - 1) / n;
hi[i] = (a[i] * m + l) / n;
}
m -= accumulate(lo.begin(), lo.end(), 0LL);
for (int i=0; i<k; i++) {
long long change = min(m, hi[i] - lo[i]);
lo[i] += change;
m -= change;
cout << lo[i] << " ";
}
cout << "\n";
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #define int long long
template <class T>
bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
reverse(ALL(s));
string ans = "";
for (char c : s) {
// 0 を 0 に、1 を 1 に、6 を 9 に、8 を 8 に、9 を 6 に変換する。
if (c == '0') ans += "0";
else if (c == '1') ans += "1";
else if (c == '6') ans += "9";
else if (c == '8') ans += "8";
else if (c == '9') ans += "6";
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
for(auto c : s) {
if(c == '6') cout << '9';
else if(c == '9') cout << '6';
else cout << c;
}
cout << endl;
return 0;
}
|
#include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#include<queue>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define MOD 1000000007
using namespace std;
int main(){
ll int N;
string S;
cin >> N;
cin >> S;
if(S.size()==1){
if(S[0]=='0'){
cout << 10000000000;
return 0;
}
else{
cout << 2*10000000000;
return 0;
}
}
if(S.size()==2){
if(S=="11"||S=="10"){
cout << 10000000000;
return 0;
}
else if(S=="01"){
cout << 10000000000-1;
return 0;
}
else{
cout << 0;
return 0;
}
}
int flag=0;
if(S[0]=='1' && S[1]=='1' && S[2] == '0'){
flag=0;
}
else if(S[0]=='1' && S[1]=='0' && S[2] == '1'){
flag=1;
}
else if(S[0]=='0' && S[1]=='1' && S[2] == '1'){
flag=2;
}
else{
cout << 0;
return 0;
}
ll int si=S.size();
ll int co0=0;
for(ll int i=0;i<si;i++){
if(S[i]=='0'){
co0+=1;
}
if(flag==0){
if(S[i]=='0'){
cout << 0;
return 0;
}
flag=1;
}
else if(flag==1){
if(S[i]=='0'){
cout << 0;
return 0;
}
flag=2;
}
else{
if(S[i]=='1'){
cout << 0;
return 0;
}
flag=0;
}
}
if(S[N-1]=='1'){
cout << 10000000000-co0;
return 0;
}
else{
cout << 10000000000-co0+1;
return 0;
}
/*
if(S.size()==1 && S[0]=='1'){
cout << 20000000000;
return 0;
}
else if(S.size()==1 && S[0]=='0'){
cout << 10000000000;
return 0;
}
else if(S.size()==2 &&( (S[0]=='0'&& S[1]=='1')||(S[0]=='1'&& S[1]=='0'))){
cout << 10000000000;
return 0;
}
else if(S.size()==2 && S[1]=='1'&& S[1]=='1'){
cout << 10000000000;
return 0;
}
else if(S.size()==2){
cout << 0;
return 0;
}
int flag=0;
if(S[0]=='1' && S[1]=='1' && S[2] == '0'){
flag=0;
}
else if(S[0]=='1' && S[1]=='0' && S[2] == '1'){
flag=1;
}
else if(S[0]=='0' && S[1]=='1' && S[2] == '1'){
flag=2;
}
else{
cout << 0;
return 0;
}
ll int si=S.size();
for(ll int i=0;i<si;i++){
if(flag==0){
if(S[i]=='0'){
cout << 0;
return 0;
}
flag=1;
}
else if(flag==1){
if(S[i]=='0'){
cout << 0;
return 0;
}
flag=2;
}
else{
if(S[i]=='1'){
cout << 0;
return 0;
}
flag=0;
}
}
if(si==1){
cout << 20000000000;
}
else if(si%3==0&&S[0]=='1'){
cout << 10000000000 - (si/3)+1;
}
else if(si%3==0&&S[0]=='0'){
cout << 10000000000 - (si/3);
}
else if(S[0]=='0'){
cout << 10000000000 - (si/3)-1;
}
else{
cout << 10000000000 - (si/3);
}
*/
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Pint pair<int,int>
#define Pll pair<ll,ll>
#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
#define eb emplace_back
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;}
constexpr int INF=1000000000;
constexpr ll llINF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-8;
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);
}
ll gcd(ll a,ll b){
if(b==0)return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
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;
}
ll modpow(ll a,ll b){
if(b==0)return 1;
if(b%2)return modpow(a,b-1)*a%mod;
ll memo=modpow(a,b/2);
return memo*memo%mod;
}
vector<ll>kaijo,invkaijo;
void init_fact(int n){
kaijo.resize(n+1);
invkaijo.resize(n+1);
kaijo[0]=1;
for(ll i=1;i<=n;i++){
kaijo[i]=kaijo[i-1]*i;
kaijo[i]%=mod;
}
rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
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;
}
}
}
ll comb(int a,int b){
if(a<b)return 0;
if(a<0)return 0;
return kaijo[a]*invkaijo[a-b]%mod*invkaijo[b]%mod;
}
ll inv(ll x){
x=modpow(x,mod-2);
return x;
}
int main(){
int n;
string t;
string a="110";
cin>>n>>t;
if(n==1){
if(t=="0")cout<<10000000000<<endl;
else cout<<20000000000<<endl;
}
else{
int s=0;
if(t[0]=='0'){
if(t[1]=='0'){
cout<<0<<endl;
return 0;
}
else{
//01
s=2;
}
}
else{
if(t[1]=='0'){
//10
s=1;
}
else{
//11
s=0;
}
}
rep(i,n){
if(a[(s+i)%3]!=t[i]){
cout<<0<<endl;
return 0;
}
}
int p=s+n-1;
p/=3;
cout<<10000000000ll-p<<endl;
}
return 0;
} |
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include<chrono>
#include<random>
#include<iterator>
#include<map>
#include<list>
#include<algorithm>
#include<fstream>
#include<unordered_map>
#include<set>
#include<queue>
using namespace std;
#define pb push_back
#define mp make_pair
#define FF first
#define SS second
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define mod 1e9+7
#define all(v) (v).begin(),(v).end()
#define ps(x,y) fixed<<setprecision(y)<<x
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> plpll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
typedef map<ll,ll> mll;
ll gcd(ll a,ll b){ //gives gcd of a,b (a<b)
if(a==0) return b; //Base Case
return gcd(b%a,a);
}
ll lcm(ll a,ll b){ //gives lcm of a,b by (a*b)/gcd(a,b)
return a/gcd(a,b)*b;
}
ll gcd_ext(ll a,ll b,ll&x,ll&y){ //Extended Euclidean Algorithm
if(a==0){ //Base Case
x=0; y=1;
return b;
}
ll x1,y1; //To store recursive call
ll gcd=gcd_ext(b%a,a,x1,y1);
x=y1-(b/a)*x1; //Updating x,y from recursive call
y=x1;
return gcd;
}
ll power_mod(ll a,ll b,ll c=mod){
ll res=1;
while(b){
if(b&1){ //Checking last bit 1
res=(res*a)%c;
b--;
}
a=(a*a)%c; //Updating a
b=b>>1; //Right shift b by 1
}
return res;
}
ll multi_mod_inv(ll a,ll m){
ll x,y;
ll gcd=gcd_ext(a,m,x,y);
if(gcd!=1) return -1;
x=(x%m+m)%m;
return x;
}
ll mod_div(ll a,ll b,ll m){ //(a/b)mod m?
if(multi_mod_inv(b,m)!=-1) return (a%m*multi_mod_inv(b,m)%m)%m;
else return -1;
}
bool str_pall(string str){
ll sz=str.size();
loop(i,0,sz/2) if(str[i]!=str[sz-1-i]) return 0;
return 1;
}
signed main()
{
IOS;
ll test=1;
//cin>>test;
while(test--)
{
ll n;
cin>>n;
vll v(n);
loop(i,0,n) cin>>v[i];
mll m;
m[0]++;
ll sum=0,order=1;
loop(i,0,n){
sum+=order*v[i];
m[sum]++;
order*=-1;
//cout<<"m["<<sum<<"] = "<<m[sum]<<endl;
}
//cout<<endl<<endl;
mll:: iterator it;
ll ans=0;
for(it=m.begin();it!=m.end();it++){
//cout<<"m["<<it->FF<<"] = "<<it->SS<<endl;
ll temp=it->SS;
ans+=(temp*(temp-1)/2);
}
cout<<ans<<endl;
}
}
| #include <iostream>
#include <map>
using namespace std;
long long N, Answer = 0;
long long A[1 << 19], B[1 << 19], C[1 << 19];
map<long long, long long> D;
int main() {
// Step #1. 入力
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
// Step #2. 累積和を取る
for (int i = 1; i <= N; i++) {
if (i % 2 == 1) B[i] = A[i];
if (i % 2 == 0) B[i] = -A[i];
C[i] = C[i - 1] + B[i];
}
// Step #3. 答えを計算する
for (int i = 0; i <= N; i++) {
Answer += D[C[i]];
D[C[i]] += 1;
}
cout << Answer << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
bool flag = true;
for(int i = 0; i < s.length(); i++){
if ( i % 2 == 0){ //奇数番目
if(isupper(s[i])){ //小文字
flag = false;
}
}else{
if(!isupper(s[i])){
flag = false;
}
}
}
if(flag){
cout << "Yes"<< endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool flag = false;
char bool_ans(ll A, ll B){
if(A == B) return '=';
else if(A < B) return '<';
else return '>';
}
int main(){
ll A, B, C;
char ans;
cin >> A >> B >> C;
if(A >= 0 && B >= 0){
ans = bool_ans(A, B);
}
else if(A < 0 && B >= 0){
if(C%2 == 0){
ans = bool_ans(abs(A), B);
}
else{
ans = '<';
}
}
else if(A >= 0 & B < 0){
if(C%2 == 0){
ans = bool_ans(A, abs(B));
}
else{
ans = '>';
}
}
else{
if(C%2 == 0){
ans = bool_ans(abs(A), abs(B));
}else{
ans = bool_ans(A, B);
}
}
cout << ans << endl;
} |
#include<cstdio>
#include<queue>
#include<utility>
#include<vector>
#include<cmath>
using namespace std;
int n, m;
vector<pair<int, pair<int, int>>> v[100005];
long long dis[100005];
priority_queue<pair<long long, int>> pq;
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
v[a].push_back({b, {c, d}});
v[b].push_back({a, {c, d}});
}
for (int i = 2; i <= n; i++) {
dis[i] = 1e18;
}
pq.push({-dis[1], 1});
while (!pq.empty()) {
auto p = pq.top();
pq.pop();
int u = p.second;
if (p.first != -dis[u]) {
continue;
}
for (auto x: v[u]) {
int w = x.first;
int c = x.second.first;
int d = x.second.second;
int t = max(0., floor(sqrt(d) - dis[u] - 1));
if (1 + d / (dis[u] + t + 2) < d / (dis[u] + t + 1)) {
t++;
}
if (dis[w] > dis[u] + t + c + d / (dis[u] + t + 1)) {
dis[w] = dis[u] + t + c + d / (dis[u] + t + 1);
pq.push({-dis[w], w});
}
}
}
if (dis[n] == 1e18) {
printf("-1\n");
} else {
printf("%lld\n", dis[n]);
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned int
#define test int t;cin>>t; while(t--)
#define en '\n'
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(x) (int)x.size()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
// You should only debug a pair of simple data types. For example,
// the debug won't work if one of pair's elements is collection type
// (std::vector, std::map, std::set...).
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// bool check_prime(int n) return whether a number is prime or not O(sqrt(N));
// int BE(int x,int n,int m) return x^n%m; O(logN);
// void sieve() from number 1-1000001 saare prime store kar lega in bool is_prime[1000001] array
// vector<int> z_array(string s) return vector which is Z-array of string s;
// vector<int> lps(string s) return vector which is lps array of string s;
// int power(int x,int n) return x^n; O(logN);
// using_ordered_set (template for using ordered set , replace first 2 lines of this page with this code..);
const int gf = 1e6 + 9;
int dis[gf];
vector<pair<int, pii>> adj[gf];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
//_______________________________-code starts-_______________________________________________
int n, m;
cin >> n >> m;
zip(i, 0, m)
{
int a, b, t, k;
cin >> a >> b >> t >> k;
adj[a].pb({b, {t, k}});
adj[b].pb({a, {t, k}});
}
set<pii>s;
rep(i, 0, gf - 1)dis[i] = INF;
dis[1] = 0;
s.insert({0ll, 1});
while (sz(s))
{
pii temp = *s.begin();
s.erase(temp);
int u = temp.ss;
for (auto x : adj[u])
{
int v = x.ff;
int t = temp.ff;
int lol = sqrt(x.ss.ss);
int var = max(0ll, lol - t - 1ll);
vi a;
a.pb(var); a.pb(var + 1); a.pb(var + 2);
if (var >= 1)
a.pb(var - 1);
int wt = min(max(0ll, x.ss.ss - t) + x.ss.ff, x.ss.ff + x.ss.ss / (t + 1));
zip(i, 0, sz(a))
{
wt = min(wt, x.ss.ff + a[i] + x.ss.ss / (a[i] + t + 1));
}
debug(wt);
if (dis[v] > wt + t)
{
if (dis[v] != INF)
s.erase({dis[v], v});
dis[v] = wt + t;
s.insert({dis[v], v});
}
}
}
if (dis[n] == INF)
cout << -1 << en;
else
cout << dis[n] << en;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n;
int main(){
cin>>t>>n;
ll ans=(n*100+t-1)/t+n-1;
cout<<ans;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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(){
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = n;
string s;
cin >> s;
list<char> l;
rep(i,n) {
l.push_back(s[i]);
}
auto l_itr = l.begin();
while(l_itr != l.end()) {
auto l_itr2 = l_itr;
l_itr2++;
if(l_itr2 == l.end()) break;
auto l_itr3 = l_itr2;
l_itr3++;
if(l_itr3 == l.end()) break;
if(*l_itr == 'f' && *l_itr2 == 'o' && *l_itr3 == 'x') {
ans-=3;
if(l_itr == l.begin()) {
auto l_itr1 = l_itr;
l_itr = l_itr3;
l_itr++;
l.erase(l_itr1);
l.erase(l_itr2);
l.erase(l_itr3);
} else {
auto l_itr1 = l_itr;
l_itr--;
if(l_itr != l.begin()) {
l_itr--;
}
l.erase(l_itr1);
l.erase(l_itr2);
l.erase(l_itr3);
}
continue;
}
l_itr++;
}
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
ll n, k;
ll yama[800][800];
vector<ll> heights;
ll centerNum;
ll num[800][800];
int main()
{
cin >> n >> k;
for (ll y = 0; y < n; y++) {
for (ll x = 0; x < n; x++) {
cin >> yama[x][y];
heights.push_back(yama[x][y]);
}
}
sort(heights.begin(), heights.end());
centerNum = (k * k + 1) / 2;
if (k == 1) {
cout << heights[0] << endl;
return 0;
}
ll l = 0;
ll r = n * n - 1;
while (r - l > 1) {
ll center = (l + r) / 2;
ll height = heights[center];
for (ll y = 0; y < n; y++) {
for (ll x = 0; x < n; x++) {
if (yama[x][y] <= height) {
num[x][y] = 1;
}
else {
num[x][y] = 0;
}
}
}
for (ll y = 0; y < n; y++) {
for (ll x = 0; x < n; x++) {
if (0 < y) {
num[x][y] += num[x][y - 1];
}
if (0 < x) {
num[x][y] += num[x - 1][y];
}
if ((0 < x) && (0 < y)) {
num[x][y] -= num[x - 1][y - 1];
}
}
}
bool isExist = false;
for (ll y = 0; y + k <= n; y++) {
if (isExist) break;
for (ll x = 0; x + k <= n; x++) {
ll areaNum = num[x + k - 1][y + k - 1];
if (0 < x) {
areaNum -= num[x - 1][y + k - 1];
}
if (0 < y) {
areaNum -= num[x + k - 1][y - 1];
}
if ((0 < x) && (0 < y)) {
areaNum += num[x - 1][y - 1];
}
if (centerNum <= areaNum) {
isExist = true;
break;
}
}
}
if (isExist) {
r = center;
}
else {
l = center;
}
}
cout << heights[r] << endl;
}
| #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
inline int my_getchar(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline int rd(char c[]){
int i;
int sz = 0;
for(;;){
i = my_getchar();
if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
break;
}
}
c[sz++] = i;
for(;;){
i = my_getchar();
if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
break;
}
c[sz++] = i;
}
c[sz]='\0';
return sz;
}
inline void rd(string &x){
char*buf = (char *)wmem;
rd(buf);
x = buf;
}
struct MY_WRITER{
char buf[1048576];
int s;
int e;
MY_WRITER(){
s = 0;
e = 1048576;
}
~MY_WRITER(){
if(s){
fwrite(buf, 1, s, stdout);
}
}
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar(int a){
if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
fwrite(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
MY_WRITER_VAR.s = 0;
}
MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
my_putchar(a);
}
inline void wt_L(int x){
int s=0;
int m=0;
char f[10];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
my_putchar('-');
}
while(s--){
my_putchar(f[s]+'0');
}
}
template<class S, class T> inline S chmin(S &a, T b){
if(a>b){
a=b;
}
return a;
}
int dp[100000+10];
int hist[128];
int n;
string s;
int main(){
int i;
wmem = memarr;
memset(dp, 0x7f, sizeof(dp));
memset(hist, 0x7f, sizeof(hist));
rd(n);
rd(s);
if(n == 1){
wt_L(-1);
wt_L('\n');
exit(0);
}
dp[0] = 0;
hist[s[0]] = 0;
for(i=(1);i<(n);i++){
int j;
for(j=('a');j<('z' + 1);j++){
if(j == s[i]){
continue;
}
chmin(dp[i], hist[j]+1);
}
if(i+1 < n){
chmin(hist[s[i+1]], dp[i]);
}
}
if(dp[n-1] <= 100000){
wt_L(dp[n-1]);
wt_L('\n');
}
else{
wt_L(-1);
wt_L('\n');
}
return 0;
}
// cLay version 20210405-1
// --- original code ---
// //no-unlocked
// int dp[1d5+10];
// int hist[128];
// int n;
// string s;
// {
// memset(dp, 0x7f, sizeof(dp));
// memset(hist, 0x7f, sizeof(hist));
//
// rd(n,s);
// if(n == 1){
// wt(-1);
// exit(0);
// }
// dp[0] = 0;
// hist[s[0]] = 0;
// rep(i, 1, n){
// rep(j, 'a', 'z' + 1){
// if(j == s[i]) continue;
// dp[i] <?= hist[j]+1;
// }
// if(i+1 < n) hist[s[i+1]] <?= dp[i];
// }
// if(dp[n-1] <= 1d5){
// wt(dp[n-1]);
// }else{
// wt(-1);
// }
// } |
#include <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf 1e18
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define sz(x) (int)(x).size()
#define mk make_pair
#define deci(x, y) fixed<<setprecision(y)<<x
#define w(t) int t; cin>>t; while(t--)
#define nitin ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define PI 3.141592653589793238
using namespace std;
void solve() {
int n;
cin>>n;
int val=1;
int start=1;
for(int i=n-11;i<=n-1;i++)
{
val*=i;
while(val%start==0 && start<=11)
{
val=val/start;
start++;
}
}
cout<<val<<endl;
}
int32_t main() {
nitin;
solve();
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 1;
for (int i = 1; i < 12; i++) {
ans *= (n-i);
ans /= i;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define Rushia_mywife ios::sync_with_stdio(0);cin.tie(0);
#define rep0(n) rep(i,0,n)
#define rep1(n) rep(i,1,n+1)
#define rep(i,head,n) for(int i=(head);i<n;i++)
#define F first
#define S second
#define FF first.first
#define FS first.second
#define SF second.first
#define SS second.second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define all(x) (x).begin(),(x).end()
#define mem(x,i) memset((x),(i),sizeof((x)))
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<long long,long long>;
using ld = long double;
const int mod = 1000000007;
const int hnum = 998244353;
const ld PI = acos(-1);
#define Bint __int128
#define int long long
int qpow(int x,int powcnt,int tomod){
int res = 1;
for(;powcnt;powcnt>>=1,x=(x*x)%tomod)
if(1&powcnt)res = (res*x)%tomod;
return (res%tomod);
}
int lcm(int aaa,int bbb){
return (aaa/__gcd(aaa,bbb))*bbb;
}
int C(int x){
return x*(x-1)/2;
}
// --------------------------------------**
double a,b,c,d;
void solve(){
cin >> a >> b >> c >> d;
if(a>c){
swap(a,c);
swap(b,d);
}
double aa = c-a;
cout << fixed << setprecision(7) << a+aa/(b+d)*b << '\n';
}
signed main(){
Rushia_mywife
int t = 1;
//cin >> t;
while(t--)
solve();
}
| #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define irreps(i, m, n) for (int i = ((int)(n)-1); i > (int)(m); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) (int)(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
using ld = long double;
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; }
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
const ll INF = 1e9+10;
// const ll MOD = 1e9+7;
const ll MOD = 998244353;
const ll LINF = 1e18;
// どの2数も共通の約数をもつ
// 全ての約数は
// gcd(A)=1
// n個の素数があれば作れるが10000までには1200個程度しかない n<=2500なので足りない
// 素因数は3つあればよい？
// ac ab ab ab ab bc
// こんな感じでサイクルを作れば良さそう
// 2*3331 2*3 2*3*2 ... 3*3331
// 2*3 2*3*2 2*3*3 ... これだと15000くらいになる
// サイクルではなく1個の頂点からの木のようなグラフを考える => 2数が共通の約数をもたない
// 4頂点の完全グラフ => 2190個で足りない
// ad, ab, abc, bcd
// 5頂点 ae ab abc abcd bcde 1973
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
int n; cin>>n;
int a,b,c;
a=2;
b=3;
c=5;
int ac=a*c, ab=a*b, bc=b*c;
vc<int> B;
B.push_back(ac);
B.push_back(ab);
B.push_back(bc);
set<int> s;
s.insert(ac);
s.insert(ab);
s.insert(bc);
int now, x;
now=ac, x=2;
while(now*x<=10000){
while(x%b==0 or s.count(now*x)){
x++;
}
if(now*x>10000) break;
s.insert(now*x);
B.push_back(now*x);
}
now=ab, x=2;
while(now*x<=10000){
while(c%2==0 or s.count(now*x)){
x++;
}
if(now*x>10000) break;
s.insert(now*x);
B.push_back(now*x);
}
now=bc, x=2;
while(now*x<=10000){
while(x%a==0 or s.count(now*x)){
x++;
}
if(now*x>10000) break;
s.insert(now*x);
B.push_back(now*x);
}
// cout<<ngcd(b)<<endl;
if(B.size()<n or B.back()>10000){
cout<<B.size()<<' '<<B.back()<<endl;
exit(-1);
}
rep(i,n){
cout<<B[i]<<endl;
}
} |
#include <iostream>
using namespace std;
long long cnt[200001];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
n <<= 1;
for(int i = 2; i <= n; i++) {
cnt[i] = min(i - 1, n - i + 1);
}
k = abs(k);
long long result = 0;
for(int i = k; i <= n; i++) {
result += cnt[i] * cnt[i - k];
}
cout << result;
return 0;
}
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#define debug(x) cout << #x << " = " << x << endl
#define fori(i, ini, lim) for(int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for(int i = int(ini); i >= int(lim); i--)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
const int MAX = 60 + 6;
ll memo[MAX][2];
string arr[MAX];
int n;
ll roll(int i, bool result) {
if (i == 0) return 1;
ll &ans = memo[i][result];
if (~ans) return ans;
if (arr[i - 1][0] == 'O') {
if (!result) ans = roll(i - 1, false);
else {
ll a = roll(i - 1, false);
ll b = 2 * roll(i - 1, true);
ans = a + b;
}
}
else {
if (!result) {
ll a = 2 * roll(i - 1, false);
ll b = roll(i - 1, true);
ans = a + b;
}
else ans = roll(i - 1, true);
}
return ans;
}
void solve() {
cin >> n;
fori (i, 0, n) cin >> arr[i];
memset(memo, -1, sizeof memo);
cout << roll(n, true) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <stdio.h>
#include <math.h>
#include <string>
#include <string.h>
#include <float.h>
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <climits>
//#include "stdc++.h"
using namespace std;
// Q1
int main()
{
long lA, lB, lC;
cin >> lA >> lB >> lC;
if (0 == lC)
{
if (lA - lB > 0)
cout << "Takahashi";
else
cout << "Aoki";
}
else
{
if (lB - lA > 0)
cout << "Aoki";
else
cout << "Takahashi";
}
return 0;
}
| #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip> // setprecision
#include <complex> // complex
#include <math.h>
#include <cmath>
#include <functional>
#include <cassert>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
// constexpr ll mod = 998244353;
const int dx[8] = {1, 0, -1, 0,1,1,-1,-1};
const int dy[8] = {0, 1, 0, -1,1,-1,1,-1};
template<class T> 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 char eol = '\n';
// --------------------------------------------------------------------------
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int A,B,C;
cin >> A >> B >> C;
while(1){
if(C){
B--;
}else{
A--;
}
C ^= 1;
if(A == -1){
cout << "Aoki" << eol;
return 0;
}
if(B == -1){
cout << "Takahashi" << eol;
return 0;
}
}
return 0;
} |
#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(6), ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
const int N = 5e5 + 9, M = 1e2 + 3, MOD = 1e9 + 7, B = 31;
const ll INF = 1e15;
int x[N], y[N];
int dcmp(double a, double b) {
if(fabs(a - b) <= 1e6)
return 0;
else if(a > b)
return 1;
else
return -1;
}
void runtestcase() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < i; ++j) {
ll nem = (y[i] - y[j]);
ll dem = (x[i] - x[j]);
if(abs(nem) <= abs(dem))
++cnt;
}
}
cout << cnt;
}
int main() {
#ifdef LOCAL
// freopen("input.in", "rt", stdin);
// freopen("output.in", "wt", stdout);
#endif
fastIO;
int t = 1, tt = 1;
//cin >> t;
while(t--) {
runtestcase();
++tt;
}
} | #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define hashmap unordered_map
#define hashset unordered_set
#define lb lower_bound
#define ub upper_bound
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ff first
#define ss second
#define foi(n) for(ll i=0;i<n;i++)
#define foj(n) for(ll j=0;j<n;j++)
#define fok(n) for(ll k=0;k<n;k++)
#define forr(i,a,b) for(ll i=a;i<b;i++)
#define forrr(i,b,a) for(ll i=b;i>=a;i--)
#define forrrr(i,a,b,k) for(ll i=a;i<b;i=i+k)
#define graph vector<vector<int>>
#define sz(v) v.size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef pair< ll, pll> plll;
typedef vector<plll> vplll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<char, int> mci;
typedef map<int, string> mis;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef priority_queue <ll> pq;
typedef priority_queue<pii, vector<pii>, greater<pii> > pqq;
const ll MOD = 1000000007;
void solve();
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("error1.txt", "w", stderr);
freopen("output1.txt", "w", stdout);
#endif
// ll t ; cin >> t;
// while (t--)
{
solve();
cout << "\n";
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
ll ceils(ll x, ll y) {
return x / y + ((x % y) != 0);
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
void solve() {
ll n;
cin >> n;
vpll x;
foi(n) {
ll x1, y;
cin >> x1 >> y;
x.pb(mp(x1, y));
}
ll ans = 0;
foi(n - 1) {
for (ll j = i + 1; j < n; j++) {
if ((ld)(x[i].ss - x[j].ss) / (ld)(x[i].ff - x[j].ff) <= 1 and (ld)(x[i].ss - x[j].ss) / (ld)(x[i].ff - x[j].ff) >= -1)
ans++;
}
}
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 10,mod = 998244353;
int a[N];
int s[N];
int n;
int qpow(int a,int b){
int res = 1;
while(b){
if(b & 1) res = res * a % mod;
a = a * a % mod;
b>>=1;
}
return res;
}
int inv(int a){return qpow(a,mod-2);}
signed main(){
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i];
sort(a+1,a+n+1);
int ans = 0ll;
for(int i=1;i<=n;i++) ans = (ans + a[i] * a[i]) % mod;
for(int i=1;i<=n;i++) s[i] = ((s[i-1] + a[i] * (qpow(2,n-i+1)))%mod + mod) % mod;
for(int i=1;i<=n;i++){
if(i == 1) continue;
int cur = s[i-1] * inv(qpow(2,n-i+2)) % mod;
ans = (ans + cur * a[i]) % mod;
}
cout << (ans%mod+mod)%mod << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<set>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<queue>
#include<stack>
#include<utility>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<list>
#include<tuple>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define FOR(i, a, b) for(ll i=(a); i<(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n+1)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ld INF=1e18;
int main(void){
ll N; cin>>N;
vl A(N);
REP(i,N) cin>>A[i];
sort(A.begin(),A.end());
ld res=INF;
ll cnt=0, sum=0;
for(ll i=N-1; i>=0; --i){
if(i==N-1){
sum=0;
cnt++;
}
else{
sum+=(A[i+1]-A[i])*cnt;
cnt++;
}
ld p=(ld)A[i]/2+(ld)sum/N;
chmin(res,p);
}
cout<<fixed<<setprecision(20);
cout<<res<<endl;
return 0;
} |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <queue>
#define INF 1010101010LL
#define INFLL 1010101010101010101LL
using namespace std;
//const int mod = 1000000007;
//const int mod = 998244353;
class BIT {
public:
BIT(int n) : a(n) {}
void add(int p, long long num)
{
while (p < a.size()) {
a[p] += num;
p |= p + 1;
}
}
/* i から j までの和 [i, j] */
long long sum(int i, int j)
{
long long s = 0, t = 0;
i--;
while (i >= 0) {
s += a[i];
i = (i & (i + 1)) - 1;
}
while (j >= 0) {
t += a[j];
j = (j & (j + 1)) - 1;
}
return t - s;
}
private:
vector<long long> a;
};
vector<int> compress_num, compressed_num;
int find_comp(int x)
{
return lower_bound(compress_num.begin(), compress_num.end(), x) - compress_num.begin();
}
int main()
{
int n, m, q;
cin >> n >> m >> q;
vector<long long> t(q), x(q), y(q);
for (int i = 0; i < q; i++) {
cin >> t[i] >> x[i] >> y[i];
x[i]--;
}
for (int i = 0; i < q; i++) {
compress_num.emplace_back(y[i]);
}
compress_num.emplace_back(0);
sort(compress_num.begin(), compress_num.end());
compress_num.erase(unique(compress_num.begin(), compress_num.end()), compress_num.end());
/*for (int i = 0; i < compress_num.size(); i++) {
compressed_num[i] = lower_bound(compress_num.begin(), compress_num.end(),
compress_num[i]) - compress_num.begin();
}*/
long long sum = 0;
vector<int> a(n), b(m);
BIT bita(q+10), bitb(q + 10);
BIT numa(q+10), numb(q + 10);
numa.add(0, n);
numb.add(0, m);
for (int i = 0; i < q; i++) {
if (t[i] == 1) {
sum -= bitb.sum(find_comp(a[x[i]]), q+5) + a[x[i]] * numb.sum(0, find_comp(a[x[i]]) - 1);
bita.add(find_comp(a[x[i]]), -a[x[i]]);
numa.add(find_comp(a[x[i]]), -1);
a[x[i]] = y[i];
numa.add(find_comp(a[x[i]]), 1);
bita.add(find_comp(a[x[i]]), a[x[i]]);
sum += bitb.sum(find_comp(a[x[i]]), q+5) + y[i] * numb.sum(0, find_comp(a[x[i]]) - 1);
cout << sum << endl;
} else {
sum -= bita.sum(find_comp(b[x[i]]), q + 5) + b[x[i]] * numa.sum(0, find_comp(b[x[i]]) - 1);
bitb.add(find_comp(b[x[i]]), -b[x[i]]);
numb.add(find_comp(b[x[i]]), -1);
b[x[i]] = y[i];
numb.add(find_comp(b[x[i]]), 1);
bitb.add(find_comp(b[x[i]]), b[x[i]]);
sum += bita.sum(find_comp(b[x[i]]), q + 5) + y[i] * numa.sum(0, find_comp(b[x[i]]) - 1);
cout << sum << endl;
}
/*for (int j = 0; j < n; j++) {
cout << a[j] << " ";
}
cout << endl;
for (int j = 0; j < m; j++) {
cout << b[j] << " ";
}
cout << endl;*/
}
return 0;
} | // Jai Shree Ram
#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;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fbo find_by_order
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y second
#define gcd(a,b) __gcd(a,b)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define hell 1000000007
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.x>>a.y;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.x<<" "<<a.y;return out;}
template<typename T,typename T1>T maxs(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T mins(T &a,T1 b){if(b<a)a=b;return a;}
const int N=1e9+5;
const int M=1e7;
struct node{
int l;int r;
int val;
int cnt;
}t[M];
int cnt=0;
int n;
void extend(int v){
if(t[v].l==0){
t[v].l=++cnt;
t[v].r=++cnt;
}
}
void pushup(int v){
t[v].val = t[t[v].l].val + t[t[v].r].val;
t[v].cnt = t[t[v].l].cnt + t[t[v].r].cnt;
}
void update(int v,int l,int r,pii val,int tl=0,int tr=1e9){
if(tl>r || l>tr)return;
if(l<=tl && tr<=r){
assert(tl == tr);
t[v].val += val.x;
t[v].cnt += val.y;
return;
}
extend(v);
int mid=(tl+tr)/2;
update(t[v].l,l,r,val,tl,mid);
update(t[v].r,l,r,val,mid+1,tr);
pushup(v);
}
pii query(int v,int l,int r,int tl=0,int tr=1e9){
if(tl>r || l>tr)return {0,0};
if(l<=tl && tr<=r){
return {t[v].val,t[v].cnt};
}
int mid=(tl+tr)/2;
extend(v);
pii a =query(t[v].l,l,r,tl,mid);
pii b =query(t[v].r,l,r,mid+1,tr);
return {a.x+b.x,a.y+b.y};
}
int solve(){
int n,m,q; cin >> n >> m >> q;
int ans = 0;
int roota = ++cnt;
int rootb = ++cnt;
vector<int>v1(n+1),v2(m+1);
update(roota,0,0,{0,n});
update(rootb,0,0,{0,m});
rep(i,0,q){
int t; cin >> t;
int x,y; cin >> x >> y;
if(t == 1){
if(y > v1[x]){
auto s = query(rootb,0,y);
ans += s.y*y;
s = query(rootb,v1[x]+1,y);
ans -= s.x;
s = query(rootb,0,v1[x]);
ans -= v1[x]*s.y;
}
else if(y < v1[x]){
auto s = query(rootb,0,v1[x]);
ans -= s.y*v1[x];
s = query(rootb,0,y);
ans += s.y*y;
s = query(rootb,y+1,v1[x]);
ans += s.x;
}
update(roota,v1[x],v1[x],{-v1[x],-1});
update(roota,y,y,{y,1});
v1[x] = y;
}
else{
if(y > v2[x]){
auto s = query(roota,0,y-1);
ans += s.y*y;
s = query(roota,0,v2[x]-1);
ans -= s.y*v2[x];
s = query(roota,v2[x],y-1);
ans -= s.x;
}
else if(y < v2[x]){
auto s = query(roota,0,v2[x]-1);
ans -= s.y*v2[x];
s = query(roota,0,y-1);
ans += s.y*y;
s = query(roota,y,v2[x]-1);
ans += s.x;
}
update(rootb,v2[x],v2[x],{-v2[x],-1});
update(rootb,y,y,{y,1});
v2[x] = y;
}
cout << ans << endl;
}
return 0;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#ifdef SIEVE
sieve();
#endif
#ifdef NCR
init();
#endif
int t=1;//cin>>t;
while(t--){
solve();
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#define rep(i, n) reps(i, 0, n)
#define rrep(i, n) rreps(i, n, 0)
#define P pair<int, int>
#define vec vector<int>
#define mat vector<vec>
const ll mod = 1000000007;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
mat x(n, vec(3));
mat dist(n, vec(n));
rep(i, n){
rep(j, 3) cin >> x[i][j];
}
rep(i, n){
rep(j, n){
dist[i][j] = abs(x[i][0]-x[j][0]) + abs(x[i][1]-x[j][1]) + max(0, x[j][2]-x[i][2]);
}
}
mat dp(1<<n, vec(n, INF));
reps(i, 1, n){
dp[(1<<i)][i] = dist[0][i];
}
rep(i, 1<<n){
rep(j, n){
rep(k, n){
if((i>>k)&1){
dp[i|(1<<j)][j] = min(dp[i][k]+dist[k][j], dp[i|(1<<j)][j]);
}
}
}
}
// rep(i, 1<<n){
// rep(j, n){
// cout << dp[i][j] << " ";
// }cout << endl;
// }
cout << dp[(1<<n)-1][0] << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
typedef tuple<LL, LL, LL> TP;
constexpr LL kInf = 1e18;
template<typename T>
auto makeNdVector(int n, const T& v) {
return vector<T>(n, v);
}
template<typename T, typename N, typename... Tail>
auto makeNdVector(const N& n, const Tail&... tail) {
auto vec = makeNdVector<T>(tail...);
vector<decltype(vec)> vecs(n, vec);
return vecs;
}
void chmin(LL& a, LL b) { a = min(a, b); }
LL dist(TP t1, TP t2) {
auto [x1, y1, z1] = t1;
auto [x2, y2, z2] = t2;
return abs(x2 - x1) + abs(y2 - y1) + max(0LL, z2 - z1);
}
int main() {
int N; cin >> N;
vector<TP> tps(N);
for (int i = 0; i < N; ++i) {
int x, y, z; cin >> x >> y >> z;
tps[i] = {x, y, z};
}
auto dp = makeNdVector<LL>(1 << N, N, kInf);
dp[1][0] = 0;
for (int S = 0; S < (1 << N); ++S) {
bitset<18> b(S);
for (int i = 0; i < N; ++i) {
if (b.test(i)) {
for (int j = 0; j < N; ++j) {
LL d = dist(tps[i], tps[j]);
chmin(dp[S | (1 << j)][j], dp[S][i] + d);
}
}
}
}
cout << dp[(1 << N) - 1][0] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
vector<vector<ll>> Culc(vector<ll> x1, vector<ll> y1, vector<ll> z1, vector<ll> x2, vector<ll> y2, vector<ll> z2)
{
vector<vector<ll>> R(3, vector<ll>(3));
R[0][0] = x1[0] * x2[0] + x1[1] * y2[0] + x1[2] * z2[0];
R[0][1] = x1[0] * x2[1] + x1[1] * y2[1] + x1[2] * z2[1];
R[0][2] = x1[0] * x2[2] + x1[1] * y2[2] + x1[2] * z2[2];
R[1][0] = y1[0] * x2[0] + y1[1] * y2[0] + y1[2] * z2[0];
R[1][1] = y1[0] * x2[1] + y1[1] * y2[1] + y1[2] * z2[1];
R[1][2] = y1[0] * x2[2] + y1[1] * y2[2] + y1[2] * z2[2];
R[2][0] = z1[0] * x2[0] + z1[1] * y2[0] + z1[2] * z2[0];
R[2][1] = z1[0] * x2[1] + z1[1] * y2[1] + z1[2] * z2[1];
R[2][2] = z1[0] * x2[2] + z1[1] * y2[2] + z1[2] * z2[2];
return R;
}
int main(void)
{
ll N;
cin >> N;
vector<ll> X(N);
vector<ll> Y(N);
for (ll i = 0; i < N; i++)
{
cin >> X[i] >> Y[i];
}
ll M;
cin >> M;
vector<vector<ll>> x(M+1, vector<ll>(3));
vector<vector<ll>> y(M+1, vector<ll>(3));
vector<vector<ll>> z(M+1, vector<ll>(3));
x[0] = {1, 0, 0};
y[0] = {0, 1, 0};
z[0] = {0, 0, 1};
vector<ll> a(3);
vector<ll> b(3);
vector<ll> c(3);
vector<vector<ll>> r(3, vector<ll>(3));
for (ll i = 0; i < M; i++)
{
ll op;
cin >> op;
if (op == 1)
{
a = {0, 1, 0};
b = {-1, 0, 0};
c = {0, 0, 1};
r = Culc(a, b, c, x[i], y[i], z[i]);
x[i+1] = r[0];
y[i+1] = r[1];
z[i+1] = r[2];
}
else if (op == 2)
{
a = {0, -1, 0};
b = {1, 0, 0};
c = {0, 0, 1};
r = Culc(a, b, c, x[i], y[i], z[i]);
x[i+1] = r[0];
y[i+1] = r[1];
z[i+1] = r[2];
}
else if (op == 3)
{
ll p;
cin >> p;
a = {-1, 0, 2 * p};
b = {0, 1, 0};
c = {0, 0, 1};
r = Culc(a, b, c, x[i], y[i], z[i]);
x[i+1] = r[0];
y[i+1] = r[1];
z[i+1] = r[2];
}
else
{
ll p;
cin >> p;
a = {1, 0, 0};
b = {0, -1, 2 * p};
c = {0, 0, 1};
r = Culc(a, b, c, x[i], y[i], z[i]);
x[i+1] = r[0];
y[i+1] = r[1];
z[i+1] = r[2];
}
}
ll Q;
cin >> Q;
vector<ll> A(Q);
vector<ll> B(Q);
for (ll i = 0; i < Q; i++)
{
cin >> A[i] >> B[i];
}
for (ll i = 0; i < Q; i++)
{
cout << x[A[i]][0] * X[B[i]-1] + x[A[i]][1] * Y[B[i]-1] + x[A[i]][2] << " " << y[A[i]][0] * X[B[i]-1] + y[A[i]][1] * Y[B[i]-1] + y[A[i]][2] << endl;
}
} | #include <bits/stdc++.h>
#define ALL(x) std::begin(x), std::end(x)
using namespace std;
// @title 行列
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
template< class T >
struct Matrix {
size_t H, W;
vector< vector< T > > A;
Matrix() {}
Matrix(size_t n, size_t m) : H(n), W(m), A(H, vector< T >(W, 0)) {}
Matrix(size_t n) : H(n), W(n), A(H, vector< T >(W, 0)) {};
Matrix(const vector<vector<T>>& a) : A(a) {
H = a.size();
assert(H > 0);
W = a[0].size();
}
size_t height() const { return H; }
size_t width() const { return W; }
inline const vector< T > &operator[](int k) const { return (A.at(k)); }
inline vector< T > &operator[](int k) { return (A.at(k)); }
static Matrix I(size_t n) {
Matrix mat(n);
for(int i = 0; i < n; i++) mat[i][i] = 1;
return (mat);
}
Matrix &operator+=(const Matrix &B) {
assert(H == B.H && W == B.W);
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
(*this)[i][j] += B[i][j];
return (*this);
}
Matrix &operator-=(const Matrix &B) {
assert(H == B.H && W == B.W);
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
(*this)[i][j] -= B[i][j];
return (*this);
}
Matrix &operator*=(const Matrix &B) {
assert(W == B.H);
vector< vector< T > > C(H, vector< T >(B.W, 0));
for(int i = 0; i < H; i++)
for(int j = 0; j < B.W; j++)
for(int k = 0; k < W; k++)
C[i][j] += ((*this)[i][k] * B[k][j]);
A.swap(C);
return (*this);
}
Matrix &operator^=(long long k) {
Matrix B = Matrix::I(H);
while(k > 0) {
if(k & 1) B *= *this;
*this *= *this;
k >>= 1LL;
}
A.swap(B.A);
return (*this);
}
vector<T> operator*(const vector<T> &v) {
assert(W == v.size());
vector<T> ret(H, 0);
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
ret[i] += ((*this)[i][j] * v[j]);
return ret;
}
Matrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }
Matrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }
Matrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }
Matrix operator^(const long long k) const { return (Matrix(*this) ^= k); }
friend ostream &operator<<(ostream &os, Matrix &p) {
for(int i = 0; i < p.H; i++) {
for(int j = 0; j < p.W; j++) {
os << p[i][j] << (j + 1 == p.W ? "\n" : " ");
}
}
return (os);
}
};
using ll = long long;
using matrix = Matrix<ll>;
matrix l1({
{0, 1, 0},
{-1, 0, 0},
{0, 0, 1}
});
matrix l2({
{0, -1, 0},
{1, 0, 0},
{0, 0, 1}
});
struct Pos { int x, y; };
int main() {
int n; cin >> n;
vector<Pos> pos;
for (int i = 0; i < n; ++i) {
int x, y; cin >> x >> y;
pos.push_back((Pos){x, y});
}
vector<matrix> mat;
mat.push_back(matrix({
{1, 0, 0},
{0, 1, 0},
{0, 0, 1}
}));
int m; cin >> m;
for (int i = 0; i < m; ++i) {
int op; cin >> op;
int p;
if (op >= 3) cin >> p;
matrix &b = mat.back();
if (op == 1) {
mat.push_back(l1*b);
}
else if (op == 2) {
mat.push_back(l2*b);
}
else if (op == 3) {
matrix l3({
{-1, 0, 2*p},
{0, 1, 0},
{0, 0, 1}
});
mat.push_back(l3*b);
}
else {
matrix l4({
{1, 0, 0},
{0, -1, 2*p},
{0, 0, 1}
});
mat.push_back(l4*b);
}
}
int q; cin >> q;
for (int i = 0; i < q; ++i) {
int a, b; cin >> a >> b;
Pos p = pos[b-1];
vector<ll> l = {p.x, p.y, 1};
vector<ll> ans = mat[a]*l;
cout << ans[0] << " " << ans[1] << endl;
}
return 0;
} |
#include<iostream>
#include<math.h>
#include<time.h>
#include<algorithm>
#include<random>
#include<vector>
#include<string>
using namespace std;
int num_cand = 3000;
mt19937 engine(time(0));
vector<vector<double>> x_path(100, vector<double>(100, 5000.0)); //(30, 29)
vector<vector<double>> y_path(100, vector<double>(100, 5000.0)); //(29, 30)
string basic_path(int j_def, int i_def){
string result;
if(j_def > 0){
for(int j = 0; j < j_def; j++){
result += "R";
}
}else{
for(int j = 0; j < - j_def; j++){
result += "L";
}
}
if(i_def > 0){
for(int i = 0; i < i_def; i++){
result += "D";
}
}else{
for(int i = 0; i < - i_def; i++){
result += "U";
}
}
return(result);
}
class path{
public:
double expected_cost;
string movement;
void assign_cost(int i_now, int j_now);
void modify_expectation(int i_now, int j_now, int real_cost);
};
void path::assign_cost(int i_now, int j_now){
int N = movement.length();
for(int l = 0; l < N; l++){
if(movement.at(l) == 'D'){
expected_cost += y_path.at(i_now).at(j_now);
i_now += 1;
}else if(movement.at(l) == 'U'){
expected_cost += y_path.at(i_now-1).at(j_now);
i_now -= 1;
}else if(movement.at(l) == 'R'){
expected_cost += x_path.at(i_now).at(j_now);
j_now += 1;
}else{
expected_cost += x_path.at(i_now).at(j_now-1);
j_now -= 1;
}
}
}
void path::modify_expectation(int i_now, int j_now, int real_cost){
int N = movement.length();
double new_expectation = real_cost / (double)N;
for(int l = 0; l < N; l++){
if(movement.at(l) == 'D'){
y_path.at(i_now).at(j_now) = new_expectation;
i_now += 1;
}else if(movement.at(l) == 'U'){
y_path.at(i_now-1).at(j_now) = new_expectation;
i_now -= 1;
}else if(movement.at(l) == 'R'){
x_path.at(i_now).at(j_now) = new_expectation;
j_now += 1;
}else{
x_path.at(i_now).at(j_now-1) = new_expectation;
j_now -= 1;
}
}
}
int main(){
for(int k = 0; k < 1000; k++){
int sy, sx, ty, tx;
cin >> sy >> sx >> ty >> tx;
int dx = tx - sx;
int dy = ty - sy;
string basics = basic_path(dx, dy);
vector<path> paths(num_cand);
double min_cost = pow(10, 9);
int min_cost_id = -1;
for(int i = 0; i < num_cand; i++){
shuffle(basics.begin(), basics.end(), engine);
paths.at(i).movement = basics;
paths.at(i).assign_cost(sy, sx);
if(paths.at(i).expected_cost < min_cost){
min_cost = paths.at(i).expected_cost;
min_cost_id = i;
}
}
cout << paths.at(min_cost_id).movement << endl;
int real_cost;
cin >> real_cost;
paths.at(min_cost_id).modify_expectation(sy, sx, real_cost);
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=0;i<1000;i++){
int si,sj,ti,tj;
cin>>si>>sj>>ti>>tj;
int difx=si-ti;
int dify=sj-tj;
if(difx>0){
for(int i=0;i<difx;i++){
cout<<'U';
}
}else{
for(int i=0;i<abs(difx);i++){
cout<<'D';
}
}
if(dify>0){
for(int i=0;i<dify;i++){
cout<<'L';
}
}else{
for(int i=0;i<abs(dify);i++){
cout<<'R';
}
}
cout<<endl;
long long num;
cin>>num;
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.