code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <tuple>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef vector<vector<long long>> VVLL;
typedef vector<vector<bool>> VVB;
typedef vector<vector<double>> VVD;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define all(a) (a).begin(),(a).end()
const int MOD = 1000000007;
template<class T>bool chmax(T &a, const T &b){
if(a<b){
a=b;
return true;
}
return false;
}
template<class T>bool chmin(T &a, const T &b){
if(a>b){
a=b;
return true;
}
return false;
}
void debug(VI &arr){
int n=arr.size();
rep(i,n){
cout<<arr.at(i)<<endl;
}
}
void debug(VVI &board){
int h = board.size();
int w = board.at(0).size();
rep(i,h){
rep(j,w){
cout << board.at(i).at(j) << " ";
}
cout<<endl;
}
}
void debug(VVLL &board){
int h = board.size();
int w = board.at(0).size();
rep(i,h){
rep(j,w){
cout<<board.at(i).at(j)<<" ";
}
cout<<endl;
}
}
void debug(VS &board){
int h = board.size();
rep(i,h){
cout<<board.at(i)<<endl;
}
return;
}
LL gcd(LL a,LL b){
return b==0?a:gcd(b,a%b);
}
LL lcm(LL a,LL b){
return a*b/gcd(a,b);
}
LL cnt(LL n){
LL i=0;
while(true){
LL sum = (i + 1) * i / 2;
if(sum>n+1){
break;
}
i++;
}
return i-1;
}
int main(){
//cout<<fixed;
//cout<<setprecision(9)<<...
LL n;
cin>>n;
cout<<n-cnt(n)+1<<endl;
return 0;
}
| // #include <bits/stdc++.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <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
// bits default for atcoder
// additional
// #include <array> // array
#include <numeric> // accumulate
// macro
#define rep(i, n) for (int (i)=0;(i)<(n);(i)++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<pair<int, string>> vec(N);
for (int i = 0; i < N; ++i) {
string s;
int t;
cin >> s >> t;
vec[i] = make_pair(t, s);
}
sort(vec.begin(), vec.end());
cout << vec[N-2].second << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
int main() {
ll t;
cin >> t;
vl ans(t);
rep(j, t) {
string s;
cin >> s;
ll n = s.size();
// 0回の場合
if("atcoder" < s) {
continue;
}
// s[0] = 'a' が確定
ll x = 0; // sの先頭から連続する'a'の個数
for(auto c : s) {
if(c == 'a') {
x++;
}
else {
break;
}
}
// 全ての文字が'a'のとき不可能
if(x == n) {
ans[j] = -1;
continue;
}
if(s[x] > 't') {
ans[j] = x-1;
}
else {
ans[j] = x;
}
}
rep(i, t) {
out(ans[i]);
}
re0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define BIT(n) (1LL << (n))
#define TOUPPER(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define TOLOWER(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define FILLZERO(s, n) \
do { \
ostringstream os; \
os << setw(n) << setfill('0') << s; \
s = os.str(); \
} while (0);
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてからつかうこと
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pi = pair<int, int>;
template <typename T>
using Pq = priority_queue<T>;
template <typename T>
using pQ = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
vector<T> make_vec(size_t a, T n) { return vector<T>(a, n); }
template <typename T, typename... Ts>
auto make_vec(size_t a, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); }
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 <typename T>
bool isProductOverflow(T a, T b) {
return (a > numeric_limits<T>::max() / b);
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
__attribute__((constructor)) void ioInit() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(10);
}
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
signed main() {
cin >> N >> A >> B;
REP(i, N) {
cin >> X >> Y;
if (X < A and Y > B) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define boostIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, b) for (int i = 0; i < b; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define sz(v) (v.empty() ? 0 : v.size())
#define all(v) v.begin(), v.end()
#define mem(a, val) memset(a, val, sizeof(a))
#define trav(a, x) for (auto &a : x)
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define int long long
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for (long blockTime = 0; (blockTime == 0 ? (blockTime = clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
#define maxn 100005
#define mod 998244353
const int INF = 1e10;
typedef pair<int, int> pii;
signed main() {
boostIO;
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 2; i <= (2 * n); i++) {
int K = k + i;
if(K < 2 or K > 2 * n) continue;
int ir = min(n, i - 1);
int il = max(1LL, i - n);
int kr = min(n, K - 1);
int kl = max(1LL, K - n);
int ni = (ir >= il ? ir - il + 1 : 0);
int nk = (kr >= kl ? kr - kl + 1 : 0);
ans += (ni * nk);
}
cout << ans << endl;
return 0;
}
// XD | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 2005;
const int oo = 1e18 + 7, mod = 1e9 + 7;
int n, a[N];
set<int> numbers;
map<int, int> mp;
void process(){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
if(numbers.find(a[i]) != numbers.end()) continue;
numbers.insert(a[i]);
for(int j = 1; j <= sqrt(a[i]); j++){
if(a[i] % j) continue;
mp[a[i] / j] = __gcd(mp[a[i] / j], j);
mp[j] = __gcd(mp[j], a[i] / j);
}
}
int mini = (*numbers.begin());
set<int> se;
se.insert(mini);
for(auto it : mp){
if(it.fi > mini) break;
if(it.se != 1) continue;
se.insert(it.fi);
}
cout << se.size();
}
signed main(){
ios_base::sync_with_stdio(0);
process();
} |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
long long A[200001][2];
long long B[200001][2];
long long C[200001][2];
int main() {
int N;
cin >> N;
vector<long long>X(N);
vector<long long>Y(N);
rep(i, N) {
cin >> X[i] >> Y[i];
}
int M;
cin >> M;
A[0][0] = 1;
B[0][1] = 1;
rep(i, M) {
int op;
cin >> op;
if (op <= 2) {
if (1 == op) {
//(a,b)->(b,-a)
A[i + 1][0] = A[i][1];
B[i + 1][0] = B[i][1];
C[i + 1][0] = C[i][1];
A[i + 1][1] = -A[i][0];
B[i + 1][1] = -B[i][0];
C[i + 1][1] = -C[i][0];
}
else {
//(a,b)->(-b,a)
A[i + 1][0] = -A[i][1];
B[i + 1][0] = -B[i][1];
C[i + 1][0] = -C[i][1];
A[i + 1][1] = A[i][0];
B[i + 1][1] = B[i][0];
C[i + 1][1] = C[i][0];
}
}
else {
long long p;
cin >> p;
if (3 == op) {
//(a,b)->(2p-a,b)
A[i + 1][0] = -A[i][0];
B[i + 1][0] = -B[i][0];
C[i + 1][0] = 2 * p - C[i][0];
A[i + 1][1] = A[i][1];
B[i + 1][1] = B[i][1];
C[i + 1][1] = C[i][1];
}
else {
//(a,b)->(a,2p-b)
A[i + 1][0] = A[i][0];
B[i + 1][0] = B[i][0];
C[i + 1][0] = C[i][0];
A[i + 1][1] = -A[i][1];
B[i + 1][1] = -B[i][1];
C[i + 1][1] = 2 * p - C[i][1];
}
}
}
int Q;
cin >> Q;
rep(i, Q) {
int a, b;
cin >> a >> b;
b--;
long long x = A[a][0] * X[b] + B[a][0] * Y[b] + C[a][0];
long long y = A[a][1] * X[b] + B[a][1] * Y[b] + C[a][1];
cout << x << " " << y << endl;
}
return 0;
} | //#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#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
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll,double>>>;
vector<pair<ll,ll>> Z;
double dist(ll A,ll B){
ll dx=Z[A].first-Z[B].first;
ll dy=Z[A].second-Z[B].second;
return sqrt(dx*dx+dy*dy);
}
ll gcd(ll(a), ll(b)) {
ll c = a;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
ll mod=1e9+7;
int main() {
ll N;
cin>>N;
vector<pair<ll,string>> P(N);
rep(i,N){
ll H;string S;
cin>>S>>H;
P[i]=make_pair(H,S);
}
sort(all(P));
reverse(all(P));
cout<<P[1].second<<endl;
} |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
string S[100];
for (int i = 0; i < H; i++)
{
cin >> S[i];
}
int answer = 0;
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
if (j != W - 1)
{
if (S[i][j] == '.' && S[i][j + 1] == '.')
{
answer++;
}
}
if (i != H - 1)
{
if (S[i][j] == '.' && S[i + 1][j] == '.')
{
answer++;
}
}
}
}
cout << answer << endl;
return 0;
} | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_element(ALL(a)))
#define Min(a) (*min_element(ALL(a)))
using namespace std;
bool exor(string s){
ll ret = 0;
for(int i = 0;i < s.size();i++){
ret+=(s[i]-'0')%2;
}
return ret%2;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,m;
cin >> n >> m;
vector<string>vs(n);
for(auto &s:vs)cin>>s;
ll ans = 0;
vi cnt(10);
for(int i = 0;i < n;i++){
cnt[exor(vs[i])]++;
}
cout << cnt[0] * cnt[1] << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template < typename T_container, typename T = typename enable_if < !is_same<T_container, string>::value, typename T_container::value_type >::type >
ostream & operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr << "[" << #__VA_ARGS__ << "]: [", dbg_out(__VA_ARGS__)
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int a, b; cin >> a >> b;
vector <ll> ans;
if (a >= b) {
for (int i = 1; i <= a; ++i)
ans.push_back(i);
for (int i = 1; i < b; ++i)
ans.push_back(-i);
ll sum = 0;
for (int i = b; i <= a; ++i)
sum += i;
ans.push_back(-sum);
}
else {
for (int i = 1; i <= b; ++i)
ans.push_back(-i);
for (int i = 1; i < a; ++i)
ans.push_back(i);
ll sum = 0;
for (int i = a; i <= b; ++i)
sum += i;
ans.push_back(sum);
}
for (auto i : ans)
cout << i << ' ';
return 0;
}
/*
*/ | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
double fc(vector<int> &a, double x) {
double res = 0;
int n = a.size();
rep(i, n) {
res += a.at(i);
res -= min((double)a.at(i), 2*x);
}
res /= n;
res += x;
return res;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
double l = 0, r = 1e10;
rep(_i, 300) {
double ml = (l*2+r)/3, mr = (l+r*2)/3;
double mlp = fc(a, ml), mrp = fc(a, mr);
if(mlp < mrp) r = mr;
else l = ml;
}
double ans = fc(a, (l+r)/2);
cout << fixed << setprecision(10) << ans << endl;
return 0;
} |
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <utility>
#include <limits.h>
#include <cstring>
using namespace std;
const int N = 200005;
int n, s[N], e[N], tim = 1;
vector<int> adj[N];
vector<int> lvl[N];
int cnt(int idx, int l, int r)
{
return upper_bound(lvl[idx].begin(), lvl[idx].end(), r) - lower_bound(lvl[idx].begin(), lvl[idx].end(), l);
}
void dfs(int u = 1, int l = 0)
{
s[u] = tim;
lvl[l].push_back(s[u]);
for (int v: adj[u])
{
tim ++;
dfs(v, l + 1);
}
e[u] = tim;
}
int main(int argc, char const *argv[])
{
scanf("%d", &n);
for (int i = 2; i <= n; ++i)
{
int p;
scanf("%d", &p);
adj[p].push_back(i);
}
dfs();
int q;
scanf("%d", &q);
while (q --)
{
int u, v;
scanf("%d", &u);
scanf("%d", &v);
printf("%d\n", cnt(v, s[u], e[u]));
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
template<typename T> void dbg_a(const T *a,int l,int r){cerr<<" {";for(int i = l;i<r;i++) cerr<<a[i]<<", ";cerr<<a[r]<<"}"<<endl;}
typedef long long ll;
//#define int ll
inline int read(){
int f(1),r(0);char c(getchar());
while(c<'0'||c>'9'){if(c == '-') f = -1; c = getchar();}
while(c>='0'&&c<='9'){ r = (r<<1) + (r<<3) + c - '0';c = getchar();}
return f*r;
}
void read(int &x){ x = read();}
template<class Head, class... Tail> void read(Head &head, Tail &... tail) { read(head); read(tail...); }
typedef pair<int,int> PII;
#define fi first
#define se second
#define mst(a,b) memset(a,b,sizeof(a))
#define For(i,a,b) for(int i = a;i<=b;i++)
#define For_(i,a,b) for(int i = a;i>=b;i--)
#define rep(i,a) for(int i = 0;i<a;i++)
#define All(x) x.begin(),x.end()
// For(i,1,n) For(j,1,m) printf("f[%lld][%lld] = %lld\n",i,j,f[i][j]);
//const ll INF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 6,M = 2020+ 6;
const int mod = 1e9 + 7;
int n;
vector<vector<int>> G,lis;
int timer;
int in[N],out[N],dep[N];
void dfs(int x,int pr){
in[x] = ++timer;
lis[dep[x]].emplace_back(in[x]);
for(auto y:G[x]) if(y != pr){
dep[y] = dep[x] + 1;
dfs(y,x);
}
out[x] = ++timer;
}
void solve(){
n = read();
G.resize(n+1);
lis.resize(n+1);
For(i,2,n){
int x = read();
G[i].emplace_back(x);
G[x].emplace_back(i);
}
dfs(1,0);
int q = read();
dbg_a(in,1,7);
dbg_a(out,1,7);
while(q--){
int x,d;
read(x,d);
auto depth = lis[d];
int res = lower_bound(All(depth),out[x]) - lower_bound(All(depth),in[x]);
cout<<res<<"\n";
}
}
signed main(){
int T = 1;
//T = read();
while(T--) solve();
return 0;
} |
/**
* author:
* created: 15.11.2020 22:52:52
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int INF = 1001001001;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1};
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repn(i,n) for(int i = 1; i <= (n); i++)
#define pb push_back
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const double PI = acos(-1);
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x=0) : x((x%mod+mod)%mod) {}
mint operator-() const {
return mint(-x);
}
mint& operator+=(const mint& a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint& a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint& a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint& a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint& a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint& a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
return a;
}
// for prime mod
mint inv() const {
return pow(mod-2);
}
mint& operator/=(const mint& a) {
return (*this) *= a.inv();
}
mint operator/(const mint& a) const {
mint res(*this);
return res/=a;
}
friend ostream& operator<<(ostream& os, const mint& m){
os << m.x;
return os;
}
};
#pragma endregion
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n,w;
cin >> n >> w;
vector<ll>weight(200010,0);
rep(i,n){
int s,t,w;
cin >> s >> t >> w;
weight[s]+=w;
weight[t]-=w;
}
rep(i,200005){
weight[i+1]+=weight[i];
if(weight[i]>w){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include<cmath>
#define ll long long
using namespace std;
int main(void){
ll num,pro;
cin >> num;
cin >> pro;
bool ans = true;
vector<ll> start(num);
vector<ll> end(num);
vector<ll> use(num);
for(int i = 0;i < num;i ++){
cin >> start[i];
cin >> end[i];
cin >> use[i];
}
vector<ll> add(300000,0);
for(int i = 0;i < num;i ++){
add[start[i]] = add[start[i]] + use[i];
add[end[i]] = add[end[i]] - use[i];
}
ll sum = 0;
for(int i = 0;i < 300000;i ++){
sum = sum + add[i];
if(sum > pro){
ans = false;
}
}
if(ans == true){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void cout_line(vector<int> &a){
for(int i=0;i<a.size();i++){
if(i<a.size()-1){
cout<<a.at(i)<<" ";
}else{
cout<<a.at(i)<<endl;
}
}
}
signed main(){
int N; cin>>N;
vec_int A(N); rep(i,N)cin>>A.at(i);
int MOD = pow(10, 9) + 7;
vec_int cumul_A(N+1, 0);
for(int i=1;i<=N;i++){
cumul_A.at(i) = cumul_A.at(i-1)+A.at(i-1);
}
vector<vec_int> DP(N+1, vec_int(N+1, 0)); // DP.at(i).at(j): j番目の数値までをi個に区切ったときの数
DP.at(0).at(0) = 1;
for(int i=0;i<N;i++){
vec_int cumul_A2(N+1);
rep(k,N+1)cumul_A2.at(k) = cumul_A.at(k)%(i+1);
vector<vec_int> inds(i+1);
vector<vec_int> cumul(i+1);
rep(k, i+1)cumul.at(k).push_back(0);
vec_int start_vec(N+1, 0);
rep(k,N+1){
inds.at(cumul_A2.at(k)).push_back(k);
int sz = inds.at(cumul_A2.at(k)).size();
start_vec.at(k) = sz-1;
int prev = cumul.at(cumul_A2.at(k)).at(sz-1);
cumul.at(cumul_A2.at(k)).push_back(prev + DP.at(i).at(k));
}
for(int j=1;j<=N;j++){
// if(DP.at(i).at(j)==0)continue;
int from = cumul_A2.at(j);
int start_ind = start_vec.at(j);
// cout<<i<<" "<<j<<" "<<from<<" "<<start_ind<<" "<<cumul.at(from).at(start_ind)<<endl;
DP.at(i+1).at(j) += cumul.at(from).at(start_ind);
DP.at(i+1).at(j) %= MOD;
/*
for(int k=start_ind+1; k<inds.at(from).size();k++){
DP.at(i+1).at(inds.at(from).at(k)) += DP.at(i).at(j);
DP.at(i+1).at(inds.at(from).at(k)) %= MOD;
}
*/
}
}
int ans = 0;
for(int i=1;i<=N;i++){
ans += DP.at(i).at(N);
ans %= MOD;
}
cout<<ans<<endl;
return 0;
} | #include<stdio.h>
using ll=long long;
constexpr int mod=1000000007;
int N,M,K,inv[2000000]={1,1};
int main(){
for(int i=2;i<2000000;++i)inv[i]=ll(inv[mod%i])*(mod-mod/i)%mod;
for(int i=2;i<2000000;++i)inv[i]=ll(inv[i])*inv[i-1]%mod;
scanf("%d %d %d",&N,&M,&K);
ll p=1;
for(int i=2;i<=N+M;++i)(p*=i)%=mod;
int ans=p*inv[N]%mod*inv[M]%mod;
if(N+M<=K||N==K){
printf("%d\n",ans);
return 0;
}
if(N>M+K){
puts("0");
return 0;
}
++K;
ans-=p*inv[N-K]%mod*inv[M+K]%mod;
if(ans<0)ans+=mod;
printf("%d\n",ans);
} |
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
std::set<long long> numSet;
bool isPrime(long long num) {
if (num == 2)
return true;
if (num % 2 == 0)
return false;
int d = 3;
while ((d * d) <= num) {
if (num % d == 0)
return false;
d = d + 2;
}
return true;
}
int main(void)
{
long long n;
long long left;
scanf("%lld", &n);
left = n;
long long p;
p = 2;
while ((p * p) <= n) {
// if (isPrime(p) == false) {
// p++;
// continue;
// }
if (numSet.find(p) != numSet.end()) {
p++;
continue;
}
long long curNum = p * p;
while (curNum <= n) {
numSet.insert(curNum);
left--;
curNum = curNum * p;
}
p++;
}
printf("%lld\n", left);
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <cmath>
#include <unordered_set>
using namespace std;
int main()
{
long N;
cin >> N;
unordered_set<long> s;
for(long i = 2; i*i <= N; i++){
long exp = i*i;
while(exp <= N){
s.insert(exp);
exp *= i;
}
}
cout << N - s.size() << endl;
} |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_ll.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(ll i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
// #define mp make_pair
#define pq priority_queue
const ll mod=1000000007;
#define f first
#define s second
#define pii pair< ll, ll >
#define vi vector<ll>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc ll t; cin >> t; while(t--)
// using namespace boost::multiprecision;
using namespace std;
void optimizeIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
ll Z=10000;
ll get_floor(ll num){
return num-(num%Z+Z)%Z;
}
ll get_ceil(ll num){
return -get_floor(-num);
}
template <typename I, typename P> I binarysearch(const P &predicate, I l, I r) {
l--;
while (r - l > 1) {
auto mid = l + (r - l) / 2;
if (predicate(mid))
r = mid;
else
l = mid;
}
return r;
}
void solve(){
cout<<fixed<<setprecision(12);
double x1,y1,r1;
cin>>x1>>y1>>r1;
ll ans=0,x=round(x1*Z),y=round(y1*Z),r=round(r1*Z);
for(ll i=get_floor(x-r);i<=get_ceil(x+r);i+=Z){
ll rem=r*r-(i-x)*(i-x);
if(rem<0) continue;
ll delta_y = -1 + binarysearch<ll>([&](ll u) { return u * u > rem; }, 0, r + 1);
ll low=get_ceil(y-delta_y);
ll high=get_floor(y+delta_y);
ans+= (high-low)/Z+1;
}
cout<<ans<<endl;
}
int32_t main(){
optimizeIO();
ll r=1;
{solve();}
}
| //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FIX(d) fixed << setprecision(d)
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 2e9;
const ll LINF = (1LL<<60);
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n,m,t;
cin >> n >> m >> t;
vector<ll> a(m), b(m);
REP(i,m) cin >> a[i] >> b[i];
ll mx = n;
ll tm = 0;
REP(i,m){
n -= a[i]-tm;
if(n<=0){
cout << "No\n";
return 0;
}
n += min(b[i]-a[i], mx-n);
tm = b[i];
}
n -= t-tm;
cout << (n>0 ? "Yes\n" : "No\n");
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<unordered_map>
#include<random>
#include<array>
#include<cassert>
using namespace std;
#define INF ((1<<30)-1)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
struct TrieNode{
int n = 0;
long long sum = 0;
TrieNode* l = nullptr, * r = nullptr;
};
class Trie {
public:
Trie() { root = new TrieNode(); }
void insert(int x) {
TrieNode* t = root;
for (int i = 30; i >= 0; i--) {
t->n++;
t->sum += x;
if (x >> i &1) {
if (t->r == nullptr) t->r = new TrieNode;
t = t->r;
}
else {
if (t->l == nullptr) t->l = new TrieNode;
t = t->l;
}
}
t->n++;
t->sum += x;
}
void erase(int x) {
TrieNode* t = root;
for (int i = 30; i >= 0; i--) {
t->n--;
t->sum -= x;
if (x >> i & 1) {
t = t->r;
}
else {
t = t->l;
}
}
t->n--;
t->sum -= x;
}
pair<int, long long> query(int x) const{
pair<int, long long > ret(0, 0);
TrieNode* t = root;
for (int i = 30; i >= 0; i--) {
if (t == nullptr)break;
if (x >> i & 1) {
if (t->l) {
ret.first += t->l->n;
ret.second += t->l->sum;
}
t = t->r;
}
else {
t = t->l;
}
}
return ret;
}
private:
TrieNode* root;
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
vector<int> a(n, 0), b(m, 0);
Trie ta, tb;
rep(i, n) ta.insert(0);
rep(i, m)tb.insert(0);
long long ans = 0;
rep(_, q) {
int t, x, y;
cin >> t >> x >> y;
x--;
if (t == 1) {
auto p = tb.query(a[x]);
ans -= (long long)p.first * a[x];
ans += p.second;
p = tb.query(y);
ans += (long long)p.first * y;
ans -= p.second;
ta.erase(a[x]);
ta.insert(y);
a[x] = y;
}
else {
auto p = ta.query(b[x]);
ans -= (long long)p.first * b[x];
ans += p.second;
p = ta.query(y);
ans += (long long)p.first * y;
ans -= p.second;
tb.erase(b[x]);
tb.insert(y);
b[x] = y;
}
cout << ans << endl;
}
return 0;
}
| #include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
struct ppp{ll t,x,y;}c[200005];
ll a[200005],b[200005],N=500000;
ll tree[500005][2],num[500005][2];
void add(ll x,ll k,ll t){
while(x<N){
tree[x][t]+=k;
x+=x&(-x);
}
}
ll query(ll x,ll t){
ll res=0;
while(x){
res+=tree[x][t];
x-=x&(-x);
}return res;
}
void up(ll x,ll k,ll t){
while(x<N){
num[x][t]+=k;
x+=x&(-x);
}
}
ll cal(ll x,ll t){
ll res=0;
while(x){
res+=num[x][t];
x-=x&(-x);
}return res;
}
int main(){
ll n,m,q,ans=0;
cin>>n>>m>>q;
set<ll> s;vector<ll> p;
s.insert(0);
for(ll i=1;i<=q;i++){
cin>>c[i].t>>c[i].x>>c[i].y;
s.insert(c[i].y);
}
p.push_back(-2e18);
for(auto i:s){
p.push_back(i);
}
ll st=lower_bound(p.begin(),p.end(),(ll)0)-p.begin();
up(st,n,0);up(st,m,1);
for(ll i=1;i<=q;i++){
if(c[i].t==2){
ll v=b[c[i].x],y=c[i].y;
ll l=lower_bound(p.begin(),p.end(),v)-p.begin();
ll pn=cal(l,0),pv=pn*v+query(N,0)-query(l,0);
ans-=pv;up(l,-1,1);add(l,-v,1);
l=lower_bound(p.begin(),p.end(),y)-p.begin();
pn=cal(l,0),pv=pn*y+query(N,0)-query(l,0);
ans+=pv;up(l,1,1);add(l,y,1);b[c[i].x]=y;
}
else{
ll v=a[c[i].x],y=c[i].y;
ll l=lower_bound(p.begin(),p.end(),v)-p.begin();
ll pn=cal(l,1),pv=pn*v+query(N,1)-query(l,1);
ans-=pv;up(l,-1,0);add(l,-v,0);
l=lower_bound(p.begin(),p.end(),y)-p.begin();
pn=cal(l,1),pv=pn*y+query(N,1)-query(l,1);
ans+=pv;up(l,1,0);add(l,y,0);a[c[i].x]=y;
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int v, t, s, d;
cin >> v >> t >> s >> d;
if (v * t <= d && d <= v * s) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <iostream>
#include <bits/stdc++.h>
#include <cstdio>
#include <stack>
#include<algorithm>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (max(X, Y) < min(X, Y) + 3) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 998244353;
long long myMod(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a%mod;
a = a * a%mod;
n >>= 1;
}
return res;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << myMod(a, myMod(b, c, 4) + 4, 10);
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 1e9;
const long long inf = 1LL<<60;
int main() {
long long a, b, c;
cin >> a >> b >> c;
a %= 10;
long long num = a;
vector<int> A(10, 0);
vector<int> loopA;
A.at(num) = 1;
loopA.push_back(num);
while (1) {
num *= a;
num %= 10;
if (A.at(num) == 1) {
break;
} else {
A.at(num) = 1;
loopA.push_back(num);
}
}
int loopasize = (int)loopA.size();
num = b;
num %= loopasize;
vector<int> B(loopasize, 0);
vector<int> loopB;
B.at(num) = 1;
loopB.push_back(num);
while (1) {
num *= b;
num %= loopasize;
if (B.at(num) == 1) {
break;
} else {
B.at(num) = 1;
loopB.push_back(num);
}
}
long long k;
if ((loopB.back() == 0) && ((int)loopB.size() <= c)) {
k = 0;
} else {
k = loopB.at((c+(int)loopB.size()-1)%((int)loopB.size()));
}
long long res;
if (k%loopasize == 0) {
res = loopA.back();
} else {
res = loopA.at((k-1)%loopasize);
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod (int)(1e9+7)
#define num 100007
#define ll long long int
#define endl '\n'
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define test0 ;
#define test1 int t;cin>>t;for(int i=1;i<=t;i++)
#define test2 int t;cin>>t;for(int i=1;i<=t;i++) cout<<"Case #"<<i<<": ",
#define F first
#define S second
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}
#else
#define trace(...)
#endif
void solve();
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
IOS
test0
solve();
}
/******************************************************/
void solve(){
int a,b,x,y;
cin>>a>>b>>x>>y;
int op1 = abs(a-b)*y+x;
int op2 = abs(a-b)*2*x+x;
if(b<a){
op2-=2*x;
op1=(a-1-b)*y+x;
}
cout<<min(op1,op2)<<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n),b(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
vector<ll> v[2];
rep(i,n) v[i%2].emplace_back(b[i]-a[i]);
sort(v[0].rbegin(),v[0].rend());
sort(v[1].rbegin(),v[1].rend());
ll ans = 0;
rep(i,n) ans += a[i];
rep(i,n>>1) ans += max(v[0][i]+v[1][i],0LL);
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define pl pair<ll,ll>
#define mod 1000000007
#define INF 1000000001
#define forn(i,n) for(ll i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
typedef long long int ll;
ll gcd(ll a,ll b)
{
if(b==0) return a;
return gcd(b,a%b);
}
//////////////////////////////////// JAI SHREE RAM /////////////////////////////////////
const ll N=1e5;
void JAISHREERAM()
{
double x,y,z;
cin>>x>>y>>z;
double val=y/x*z,f=floor(val);
ll ans=0;
if(f==val) ans=val-1;
else ans=floor(val);
cout<<ans;
}
int main()
{
fast;
int T=1;
// cin>>T;
for(int t=1;t<=T;t++)
{
// codejam
JAISHREERAM();
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <array>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;
void solve()
{
ll x, y, z; cin >> x >> y >> z;
ll res = 0;
for (ll i = 0; i <= 10000000; ++i)
{
//y/x > i/z
if(y * z > i * x)
{
chmax(res, i);
}
else
break;
}
cout << res << "\n";
}
int main()
{
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int kkt = 1;
//cin >> kkt;
while(kkt--)
solve();
return 0;
} |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define fi first
#define se second
#define mpa make_pair
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define set20 cout<<fixed<<setprecision(20) ;
// ミント
const ll mod = 1e9+7 ;
// 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
//昆布
struct combination {
vector<mint> fact, ifact;
combination(int n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
mint p(int n,int k){
return fact[n]*ifact[n-k] ;
}
} ;
mint modpow(ll a,ll b){
if(b==0) return 1 ;
mint c= modpow(a,b/2) ;
if(b%2==1) return c*c*a ;
else return c*c ;
}
mint komb(ll n,ll m){
mint x=1 ;mint y=1 ;
rep(i,m){
x*= n-i ;
y*= i+1 ;
}
return x/y ;
}
map<ll,ll> factor(ll n){ //素因数とオーダーをマップで管理
map <ll,ll> ord ;
for(ll i=2;i*i<=n;i++){
if(n%i==0){
int res=0;
while(n%i==0){
n/=i;
res++;
}
ord[i]=res;
}
}
if(n!=1) ord[n]++;
return ord ;
}
///
template< typename T >
T extgcd(T a, T b, T &x, T &y) {
T d = a;
if(b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
////
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)];}
};
int main(){
ll n, m; cin>>n>>m ;
vector<ll> A(n) ;
rep(i,n) cin>>A[i] ;
ll sum=0 ;
rep(i,n) sum+= A[i] ;
ll b=m- sum ;
if(b<0) cout<<0<<endl ;
else{
ll a= sum+n+1 ;
//cout<<a<<" "<<b<<endl ;
//c(a+b-1,a-1) ;
mint ans=1ll;
rep(i,a-1){
ans*= (a+b-1-i) ;
ans/= mint(i+1) ;
}
cout<<ans<<endl ;
}
return 0 ;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<db, db> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM=MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[]={2,2,-2,-2,1,1,-1,-1},ddy[]={1,-1,1,-1,2,-2,2,-2};
ll nCr(int n,int r){
if(r>n)return 0;
ll res=1;
fup(i,1,r,1){
res=res*n--%MOD*POW(i,MOD-2)%MOD;
}
return res;
}
int main() {
int n,m,s=0;
scanf("%d%d",&n,&m);
fup(i,1,n,1){
int x;
scanf("%d",&x);
s+=x;
}
printf("%lld\n",nCr(n+m,n+s));
} |
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define int long long
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define pii pair<int, int>
#define fe(i, a, b) for (int i = a; i <= (b); ++i)
#define fr(i, a, b) for (int i = b; i >= (a); --i)
using namespace std;
inline int in() {
int s = 0, f = 0, ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
return f ? -s : s;
}
const int N = 1e6 + 5;
const int mod = 4;
const int inf = 1ULL << 60;
int n, m, k;
int a[N], b[N], f[N];
int c[N];
int qp(int a, int b) {
int sum = 1;
while (b) {
if (b & 1)
sum = sum * a % mod;
a = a * a % mod;
b >>= 1;
}
return sum;
}
int inv(int a) {
return qp(a, mod - 2);
}
bool flag[N];
int p[N], tot;
int find(int x) {
return x == f[x] ? x : f[x] = find(f[x]);
}
struct node {
int x, y;
bool operator<(const node& b) const { return y > b.y; }
};
vector<pair<int, int>> g[N];
void work() {
n = in(), m = in(), k = in();
if (k == 0) {
if (n - m >= 1) {
puts("Takahashi");
} else {
puts("Aoki");
}
} else {
if (m - n >= 1) {
puts("Aoki");
} else {
puts("Takahashi");
}
}
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
// for (int _ = in(); _; --_)
work();
// system("pause");
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>
#include <iomanip>
#define ll long long int
#define inf 1000000000000
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ps(x,y) fixed<<setprecision(y)<<x
using namespace std;
void solve()
{
int n, m, t;
cin >> n >> m >> t;
int tot = n, prev = 0, flag = 1;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
tot -= (a - prev);
if (tot <= 0) {
flag = 0;
tot = 0;
}
// cout << tot << endl;
int dif = b - a;
tot += dif;
if (tot > n)tot = n;
prev = b;
}
tot -= (t - prev);
if (tot <= 0)flag = 0;
if (flag) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// scanf("%d", &t);
while (t--) {
solve();
}
} |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<"]\e[m ";}
#define DBG_PRINT(s,t,u) {std::cerr<<(s)<<" \e[2m=\e[m \e[1m"<<(t)<<"\e[m"<<(u);}
#define SELECT_7TH(x1,x2,x3,x4,x5,x6,x7,...) x7
#define dbg1(x1) DBG_PRINT(#x1,x1,std::endl)
#define dbg2(x1,x2) DBG_PRINT(#x1,x1,", ")dbg1(x2)
#define dbg3(x1,x2,x3) DBG_PRINT(#x1,x1,", ")dbg2(x2,x3)
#define dbg4(x1,x2,x3,x4) DBG_PRINT(#x1,x1,", ")dbg3(x2,x3,x4)
#define dbg5(x1,x2,x3,x4,x5) DBG_PRINT(#x1,x1,", ")dbg4(x2,x3,x4,x5)
#define dbg6(x1,x2,x3,x4,x5,x6) DBG_PRINT(#x1,x1,", ")dbg5(x2,x3,x4,x5,x6)
#define dbg(...) DBG_LINE()\
SELECT_7TH(__VA_ARGS__,dbg6,dbg5,dbg4,dbg3,dbg2,dbg1)(__VA_ARGS__)
#else
#define dbg(...) {}
#endif
/* utility functions */
struct read_item{read_item(){};
template<class T>operator T(){T t;std::cin>>t;return t;}};
char splf(int i,int n){return(i+1<n)?' ':'\n';};
template<bool up>
struct _RI{int i;_RI(int a):i(a){}
int operator*(){return i;}void operator++(){i+=(up?1:-1);}
bool operator!=(const _RI& r){return up?i<r.i:i>r.i;}};
template<bool up>
struct _RX{_RI<up> x,y;_RI<up> begin(){return x;}_RI<up> end(){return y;}
_RX(int a,int b):x(up?a:(b-1)),y(up?b:(a-1)){}_RX(int a):_RX(0,a){}};
typedef _RX<true> range;
typedef _RX<false> revrange;
/* types and constants */
typedef int64_t i64;
typedef uint64_t u64;
// const i64 inf = (i64)1.05e18;
// const int inf = (int)1.05e9;
using namespace std;
int main() {
const int N = read_item();
array<vector<i64>, 3> As;
for(auto _ : range(2 * N)) {
i64 a = read_item();
string s = read_item();
char c = s[0];
int x = (c == 'R' ? 0 : c == 'G' ? 1 : 2);
As[x].push_back(a);
}
vector<int> odds;
for(auto i : range(3)) {
if(As[i].size() % 2 == 1) {
odds.push_back(i);
}
}
assert(odds.size() == 0 || odds.size() == 2);
if(odds.size() == 0) {
printf("0\n");
return 0;
}
auto xs = As[odds[0]];
auto ys = As[odds[1]];
auto zs = As[3 - odds[0] - odds[1]];
sort(xs.begin(), xs.end());
sort(ys.begin(), ys.end());
sort(zs.begin(), zs.end());
const int yn = ys.size();
i64 ans = 1e18;
auto nearest = [&](const vector<i64>& vs, i64 x) {
int i = lower_bound(vs.begin(), vs.end(), x) - vs.begin();
i = min(i, (int)vs.size() - 1);
int j = max(i - 1, 0);
return min(abs(x - vs[i]), abs(x - vs[j]));
};
for(auto x : xs) {
i64 a = nearest(ys, x);
ans = min(ans, a);
}
if(zs.size() >= 2) {
vector<pair<i64, int>> zxs, zys;
for(auto i : range(zs.size())) {
auto z = zs[i];
i64 zx = nearest(xs, z);
i64 zy = nearest(ys, z);
zxs.push_back({zx, i});
zys.push_back({zy, i});
}
sort(zxs.begin(), zxs.end());
sort(zys.begin(), zys.end());
vector<i64> vs;
for(auto i : range(2)) {
for(auto j : range(2)) {
auto zx = zxs[i];
auto zy = zys[j];
if(zx.second == zy.second) {
continue;
}
vs.push_back(zx.first + zy.first);
}
}
sort(vs.begin(), vs.end());
i64 a = vs[0];
ans = min(ans, a);
}
printf("%lld\n", ans);
return 0;
}
/* wafdayo~~~ */
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
i64 solve(vector<i64>& a, vector<i64>& b, vector<i64>& c){
sort(all(a));
sort(all(b));
i64 res = 5e18;
for (auto i: a){
auto x = lower_bound(all(b), i) - b.begin();
if (x > 0) chmin(res, i - b[x - 1]);
if (x < int(b.size())) chmin(res, b[x] - i);
}
vector<pair<i64, int>> aaa, bbb;
for (auto i: c){
i64 aa = 1e18, bb = 1e18;
auto x = lower_bound(all(b), i) - b.begin();
if (x > 0) chmin(bb, i - b[x - 1]);
if (x < int(b.size())) chmin(bb, b[x] - i);
x = lower_bound(all(a), i) - a.begin();
if (x > 0) chmin(aa, i - a[x - 1]);
if (x < int(a.size())) chmin(aa, a[x] - i);
aaa.emplace_back(aa, i);
bbb.emplace_back(bb, i);
}
sort(all(aaa));
sort(all(bbb));
if (aaa.empty()) return res;
if (aaa[0].second == bbb[0].second) return min(res, min(aaa[0].first + bbb[1].first, aaa[1].first + bbb[0].first));
return min(res, aaa[0].first + bbb[0].first);
}
int main()
{
int n;
cin >> n;
vector<i64> R, G, B;
rep(i, 2 * n){
i64 a;
char c;
cin >> a >> c;
if (c == 'R') R.emplace_back(a);
if (c == 'G') G.emplace_back(a);
if (c == 'B') B.emplace_back(a);
}
i64 ans = 0;
if (R.size() & 1){
if (B.size() & 1) ans = solve(R, B, G);
else if (G.size() & 1) ans = solve(R, G, B);
}
else if ((B.size() & 1) && (G.size() & 1)) ans = solve(B, G, R);
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll is_valid(double x1, double y1, double x2, double y2) {
if(y1 >= x2 && x1 <= x2) {
return 1;
}
if(x1 <= y2 && x2 <= x1) {
return 2;
}
if(x1 <= x2 && y1 >= y2) {
return 3;
}
if(x2 <= x1 && y2 >= y1) {
return 4;
}
return -1;
}
int main()
{
ll n;
cin >> n;
double arr[3][n];
for(int i = 0; i < n; i++) {
for(int j = 0; j < 3; j++) {
cin >> arr[j][i];
}
if(arr[0][i] == 2) {
arr[2][i] -= 0.1;
}
if(arr[0][i] == 3) {
arr[1][i] += 0.1;
}
if(arr[0][i] == 4) {
arr[1][i] += 0.1;
arr[2][i] -= 0.1;
}
}
ll ans = 0;
for(int i = 0; i < n; i++) {
for(int j = i+1; j < n; j++) {
ll val = is_valid(arr[1][i], arr[2][i], arr[1][j], arr[2][j]);
ll now = 0;
if(val != -1) {
if(val == 1) {
now = arr[2][i] - arr[1][j] + 1;
ans++;
}
else if(val == 2) {
now = arr[2][j] - arr[1][i] + 1;
ans++;
}
else if(val == 3) {
now = arr[2][j] - arr[1][j] + 1;
ans++;
}
else {
now = arr[2][i] - arr[1][i] + 1;
ans++;
}
}
//cout << i << " " << j << " " << val << "\n";
}
}
cout << ans << "\n";
}
| #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<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ld long double
#define ull unsigned long long
ll mod=1e9+7;
#define PI 3.1415926535897932385
#define inf 9e18
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
typedef pair<long long, long long> ii;
#define S second
#define F first
ll max(ll a,ll b){if(a>b){return a;}return b;}
ll min(ll a,ll b){if(a<b){return a;}return b;}
#define MAXN 200005
// #define endl "\n"
// string to integer stoi() Remember: it takes string not character
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
// To compile--> g++ -std=c++0x -o output one.cpp
// To run--> ./output
int main() {
fastio;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n;
cin>>n;
ll t[n];
ll l[n];
ll r[n];
for (int i = 0; i < n; ++i)
{
cin>>t[i]>>l[i]>>r[i];
}
ll ans=0;
for (int i = 0; i < n; ++i)
{
ll si=l[i];
ll ei=r[i];
for (int j = i+1; j < n; ++j)
{
ll sj=l[j];
ll ej=r[j];
if(si>ej || sj>ei){
continue;
}
else{
if(si==ej){
if((t[j]!=2) && (t[i]!=3) && (t[i]!=4) && (t[j]!=4)){
ans++;
}
}
else if(sj==ei){
if((t[j]!=3) && (t[i]!=2) && (t[i]!=4) && (t[j]!=4)){
ans++;
}
}
else{
ans++;
}
}
}
}
cout<<ans;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<pair<int, int>> ps(n);
for (auto& [l, r] : ps) {
int t;
cin >> t >> l >> r;
l *= 2, r *= 2;
if (t > 2) ++l;
if (t % 2) ++r;
}
int ans = 0;
for (int i = 0; i < n; ++i) {
auto [li, ri] = ps[i];
for (int j = 0; j < i; ++j) {
auto [lj, rj] = ps[j];
if (max(li, lj) < min(ri, rj)) ++ans;
}
}
cout << ans << "\n";
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
| //Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#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:コンテナ
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
//定数
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007 //問題による
//略記
#define F first
#define S second
//出力(空白区切りで昇順に)
#define coutALL(x) for(auto i=x.begin();i!=--x.end();i++)cout<<*i<<" ";cout<<*--x.end()<<endl;
//aをbで割る時の繰上げ,繰り下げ
ll myceil(ll a,ll b){return (a+(b-1))/b;}
ll myfloor(ll a,ll b){return a/b;}
signed main(){
ll N;
cin >> N;
vector<vector<ll>> trl(N,vector<ll>(3,0));
for (ll i=0;i<N;i++){
cin >> trl[i][0] >> trl[i][1] >> trl[i][2];
}
sort(trl.begin(),trl.end(),[](const vector<ll> &alpha,const vector<ll> &beta){return alpha[1] < beta[1];});
ll ans=0;
for (ll i=0;i<N;i++){
for (ll j=i+1;j<N;j++){
if(trl[i][2] > trl[j][1]) ans++;
else if (trl[i][2] == trl[j][1]) {
if (trl[i][0] == 1 || trl[i][0] == 3)
if (trl[j][0] == 1 || trl[j][0] == 2) ans++;
}
else break;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include<cmath>
#include<string>
#define pb push_back
#define x first
#define y second
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define int long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
//void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// look for all edge cases
//search for a pattern
int n,m;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
if(m < 0 ){
cout << -1<<"\n";
//return;
}
else if(m == 0){
// you pick i pick
int l =1;
while(n--){
cout << l <<" " << l+1 << "\n";
l+=2;
}
}
else if(m == n-1 || m == n){
cout << "-1\n";
}
else{
// i pick you dont
int l = 2;
int used=0;
m = m +1;
while(m--){
cout << l << " " << l+1 <<"\n";
l += 2;
used += 1;
}
cout << 1 << " " << l<<"\n";
l += 1;
used += 1;
while(used < n){
cout << l << " " << l+1 <<"\n";
l += 2;
used += 1;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
template<class Iter> void __kumaerrc(Iter begin, Iter end) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; }
void __kumaerr(istream_iterator<string> it) { (void)it; cerr<<endl; }
template<typename T, typename... Args> void __kumaerr(istream_iterator<string> it, T a, Args... args) { cerr<<*it<<"="<<a<<", ",__kumaerr(++it, args...); }
template<typename S, typename T> std::ostream& operator<<(std::ostream& _os, const std::pair<S,T>& _p) { return _os<<"{"<<_p.first<<','<<_p.second<<"}"; }
#define __KUMATRACE__ true
#ifdef __KUMATRACE__
#define dump(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); __kumaerr(_it, args); }
#define dumpc(ar) { cerr<<#ar<<": "; FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
#define dumpC(beg,end) { cerr<<"~"<<#end<<": "; __kumaerrc(beg,end); }
#else
#define dump(args...)
#define dumpc(ar)
#define dumpC(beg,end)
#endif
template <typename T> struct BIT {
public:
int N;
vector<T> A;
BIT() {}
BIT(int N) { init(N); }
void init(int N) {
this->N=N;
A=vector<T>(N+1,0);
}
// query ∑ { sum[i] : i=l..<r }
T query(int l, int r) {
assert(l<=r&&0<=l&&r<=N);
return query(r)-query(l);
}
// min index s.t. dat[0..i]>x
int upperbound(T x) {
int good=N+1,bad=0;
while(abs(good-bad)>1) {
int m=(good+bad)/2;
(query(m)>x?good:bad)=m;
}
return good-1;
}
// sum[i]+=x
void add(int i, T x) {
assert(0<=i&&i<N);
++i;
while(i<=N) A[i]+=x,i+=lsone(i);
}
// sum[i]=x
void update(int i, T v) {
T pre=query(i+1)-query(i);
add(i,v-pre);
}
private:
int lsone(int i) { return i&-i; }
// query in [0,r) : ∑ { sum[i] : i=0..r-1 }
T query(int r) {
assert(0<=r&&r<=N);
T res=0;
while(r>0) res+=A[r],r-=lsone(r);
return res;
}
};
// compute inversions
vector<int> inversions(vector<int> ns) {
int maxv=*max_element(ns.begin(),ns.end());
BIT<int> bit(maxv+1);
int N=ns.size();
vector<int> res(N);
for(int i=N-1; i>=0; --i) {
// Count elements which stays in right side and smaller
res[i]=bit.query(0,ns[i]);
bit.add(ns[i],1);
}
return res;
}
// $ cp-batch ShiftAndInversions | diff ShiftAndInversions.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address ShiftAndInversions.cpp && ./a.out
/*
1/30/2021
5:06-
*/
const int MAX_N=1e6+1;
int A[MAX_N];
int N;
void solve() {
auto ivs=inversions(VI(A,A+N));
LL res=0; REP(i,N) res+=ivs[i];
REP(i,N) {
cout<<res<<endl;
LL a=A[i],b=N-1-A[i];
res=res-a+b;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<setprecision(12)<<fixed;
cin>>N;
REP(i,N) cin>>A[i];
solve();
return 0;
}
|
/*
*/
#include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define ld double
#define pb push_back
#define eb emplace_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef pair<ll,ll> pll;
#define br "\n"
#define ff first
#define ss second
#define debug(a...) cout<<#a<<": ";for(auto it:a)cout<<it<<" ";cout<<endl;
ll MAX = 2e6 + 1;
ll mod = 1e9 + 7;
vector<vll> g;
vll in,out,dis;
ll cnt = 0;
vector<vll> edge;
vll tree,lazy;
void dfs(ll u,ll v){
dis.pb(u);
in[u] = cnt;
cnt++;
for(auto &x:g[u]){
if(x == v) continue;
dfs(x,u);
}
out[u] = cnt - 1;
}
bool parent(ll u,ll v){
if(in[u] <= in[v] && out[u] >= out[v]) return true;
return false;
}
ll range(ll v,ll tl,ll tr,ll l,ll r){
if(lazy[v] > 0){
tree[v] += lazy[v];
lazy[2*v] += lazy[v];
lazy[2*v + 1] += lazy[v];
lazy[v] = 0;
}
if(tl == l && tr == r) return tree[v];
if(l > r) return 0;
ll tm = (tl + tr)/2;
return (range(2*v,tl,tm,l,min(r,tm)) + range(2*v + 1,tm + 1,tr,max(l,tm + 1),r));
}
void update(ll v,ll tl,ll tr,ll l,ll r,ll val){
if(lazy[v] > 0){
tree[v] += lazy[v];
lazy[2*v] += lazy[v];
lazy[2*v + 1] += lazy[v];
lazy[v] = 0;
}
if(l > r) return;
if(l == tl && r == tr){
tree[v] += val;
lazy[2*v] += val;
lazy[2*v + 1] += val;
return;
}
ll tm = (tl + tr)/2;
update(2*v,tl,tm,l,min(tm,r),val);
update(2*v + 1,tm + 1,tr,max(l,tm + 1),r,val);
tree[v] = tree[2*v] + tree[2*v + 1];
}
void solve(){
ll n;
cin >> n;
g.resize(n);
in.resize(n);
out.resize(n);
rep(i,0,n - 1){
ll a,b;
cin >> a >> b;a--,b--;
g[a].pb(b);
g[b].pb(a);
edge.pb({a,b});
}
dfs(0,0);
tree.resize(4*n);
lazy.resize(8*n);
ll q;
cin >> q;
vll ans(n);
rep(i,0,q){
ll t,e,c;
cin >> t >> e >> c;e--;
ll a,b;
a = edge[e][0];
b = edge[e][1];
if(t == 2){
swap(a,b);
}
if(parent(b,a)){
ll l = in[a],r = out[a];
update(1,0,n - 1,l,r,c);
}
else{
ll l = in[b],r = out[b];
update(1,0,n - 1,0,n - 1,c);
update(1,0,n - 1,l,r,-1*c);
}
}
rep(i,0,n){
ans[dis[i]] = range(1,0,n - 1,i,i);
}
for(auto &x:ans) cout << x << br;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t = 1;
// calc();
// cin >> t;
// calc();
rep(i,0,t){
// cout << "Case #" << i + 1 << ": ";
solve();
// test();
}
} | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <cmath>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
using ll=long long;
using namespace std;
using pii = pair<int,int>;
int main(){
int N,Q;
cin>>N;
vector<pii> E;
vector<vector<int>> G(N);
int u,v;
for(int i=0;i<N-1;i++){
cin>>u>>v;
u--;v--;
G[u].push_back(v);
G[v].push_back(u);
E.push_back({u,v});
}
set<pii> S;
queue<int> q;
vector<int> check(N,0);
check[0]=1;
q.push(0);
while(!q.empty()){
int v=q.front();
q.pop();
for(auto p:G[v]){
if(check[p]){continue;}
check[p]=1;
S.insert({v,p});
q.push(p);
}
}
/*
cout<<"E"<<endl;
for(auto p:E){
cout<<p.first<<" "<<p.second<<endl;
}
cout<<"S"<<endl;
for(auto p:S){
cout<<p.first<<" "<<p.second<<endl;
}
//*/
vector<ll> V(N,0);
cin>>Q;
int t,e;
ll x;
for(int i=0;i<Q;i++){
cin>>t>>e>>x;
e--;
if(t == 1){
if(S.find(E[e])!=S.end()){
//cout<<"u->v"<<endl;
V[0]+=x;
V[E[e].second]-=x;
}else{
//cout<<"v->u"<<endl;
V[E[e].first]+=x;
}
}else{
if(S.find(E[e])!=S.end()){
//cout<<"v->u"<<endl;
V[E[e].second]+=x;
}else{
//cout<<"u->v"<<endl;
V[0]+=x;
V[E[e].first]-=x;
}
}
}
/*
for(auto p:V){
cout<<p<<" ";
}
cout<<endl;
//*/
check=vector<int> (N,0);
check[0]=1;
q.push(0);
while(!q.empty()){
int v=q.front();
q.pop();
for(auto p:G[v]){
if(check[p]){continue;}
check[p]=1;
V[p]+=V[v];
q.push(p);
}
}
for(auto p:V){
cout<<p<<endl;
}
return 0;
} |
#include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<stdlib.h>
#include<math.h>
#include<string>
#include<string.h>
#include<set>
#include<algorithm>
#define Doura() ios_base::sync_with_stdio(false),cin.tie(NULL), cout.tie(NULL)
#define ll long long
using namespace std;
int main()
{
Doura();
int a,b;
cin>>a>>b;
ll ans =a/b;
cout<<ans<<endl;
return 0;
}
| /*
Author: Racer5x
*************************************** UNAUTHORISED COPYING OF CODE PROHIBITED **********************************
*/
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <vector>
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <functional>
#define int long long
#define double long double
#define pb emplace_back
#define pf emplace_front
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define x first
#define y second
#define endl '\n'
#define hell 998244353
#define PI 3.141592653589
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define MAX 2000000000000000000
#define M 1000000007
using namespace std;
int dp[1 << 20];
signed main()
{
tezz
vector<int> primes;
for(int i=2; i<72; i++){
bool flag = true;
for(int j=2; j<i; j++){
if(i % j == 0) flag = false;
}
if(flag) primes.emplace_back(i);
}
int A, B;
cin>>A>>B;
//now convert every number into masks.. with respect to prime divisors
vector<int> v(B - A + 1);
for(int i=A; i<=B; i++){
int mask = 0;
for(int j=0; j<primes.size(); j++){
if(i % primes[j] == 0){
mask |= (1 << j);
}
}
v[i - A] = mask;
}
//now using dp to form every possible states
dp[0] = 1;
for(int x: v){
for(int mask=0; mask<(1 << 20); mask++){
if(dp[mask]){
int tmp = mask & x;
if(tmp == 0) dp[mask | x] += dp[mask];
}
}
}
int ans = 0;
for(int i=0; i<(1 << 20); i++) ans += dp[i];
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i =0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
int A[2000][2000];
int score[2000][2000];
int H,W;
const int INF = 1001001001;
int calc(int i,int j,int t){
if(i==H-1&&j==W-1)return 0;
else if(score[i][j]!=INF)return score[i][j];
else if (i==H-1){
if(t==1){
score[i][j]=calc(i,j+1,0)+ A[i][j+1];
return score[i][j];}
else score[i][j]=calc(i,j+1,1)- A[i][j+1];
return score[i][j];}
else if (j==W-1){
if(t==1)score[i][j]=calc(i+1,j,0)+ A[i+1][j];
else score[i][j]=calc(i+1,j,1)- A[i+1][j];
return score[i][j];}
else {
if(t==1)score[i][j]=max(calc(i+1,j,0)+ A[i+1][j],calc(i,j+1,0)+ A[i][j+1]);
else score[i][j]=min(calc(i+1,j,1)- A[i+1][j],calc(i,j+1,1)- A[i][j+1]);
return score[i][j];
}
}
int main() {
cin >>H>>W;
A[2000][2000];
rep(i,H){
string tmp;
cin>> tmp;
rep(j,W){
if(tmp[j]=='+')A[i][j]=1;
else A[i][j]=-1;
score[i][j]=INF;}
}
int ans=calc(0,0,1);
if(ans>0)cout <<"Takahashi";
if(ans<0)cout <<"Aoki";
if(ans==0)cout <<"Draw";
return 0;
}
| #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
template <u32 M>
struct modint {
u32 val;
public:
static modint raw(int v) { modint x; x.val = v; return x; }
modint() : val(0) {}
template <class T>
modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); }
modint(bool v) { val = ((unsigned int)(v) % M); }
modint& operator++() { val++; if (val == M) val = 0; return *this; }
modint& operator--() { if (val == 0) val = M; val--; return *this; }
modint operator++(int) { modint result = *this; ++*this; return result; }
modint operator--(int) { modint result = *this; --*this; return result; }
modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; }
modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; }
modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; }
modint& operator/=(const modint& b) { return *this = *this * b.inv(); }
modint operator+() const { return *this; }
modint operator-() const { return modint() - *this; }
modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
modint inv() const { return pow(M-2); }
friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; }
friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; }
friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; }
friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; }
friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; }
friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; }
};
using mint = modint<MOD>;
void solve(){
int n, a, b;
cin >> n >> a >> b;
mint k = max(n-a-b+1, 0);
mint ans = mint(max(0, n-b+1))*mint(max(0, n-a+1))*k*(k+1)*2-k*(k+1)*k*(k+1);
cout << ans.val << "\n";
}
int main() {
int t;
cin >> t;
while(t--){
solve();
}
return 0;
} |
//BISMILLAHIR RAHMANIR RAHIM
//INNALLAHA_MA_AS_SABIRIN
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define __ <<" "<<
#define loop(m,n) for(m=0;m<n;m++)
#define loop1(m,n) for(m=1;m<=n;m++)
#define rloop(m,n) for(m=n-1;m>=0;m--)
#define case() "Case " << z++ << ": "
#define test_inp() ll Tc,z=1;cin>>Tc;while(Tc--)
#define ntest_inp() for(int Tc=0;Tc<1;Tc++)
#define len(n) (long long)((log(n)/log(10))+1.0000000001)
#define PTF(b) puts(b?"YES":"NO")
#define Ptf(b) puts(b?"Yes":"No")
#define ptf(b) puts(b?"yes":"no")
#define newline cout<<endl
#define quit return 0
using namespace std;
using namespace __gnu_pbds;
//typedefs
typedef long long ll;
typedef pair<ll,ll> pll;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//constants
const ll mod=1000000007;
//Function prototypes
inline void ls();
inline ll ceill(ll n, ll k=1);
long long maxx(ll=0,ll=0,ll=0,ll=0,ll=0);
long long minn(ll=INT_MAX,ll=INT_MAX,ll=INT_MAX,ll=INT_MAX,ll=INT_MAX);
bool cmp1(pair<ll,ll> i1,pair<ll,ll> i2);
bool cmp2(pair<ll,ll> a, pair<ll,ll> b);
long long eugcd(ll a,ll b);
//Solve here...
ll bigmod(ll b, ll p)
{
if(p==0) return 1;
ll x=bigmod(b, p/2);
x=(x*x)%mod;
if(p%2==1)x=(x*b)%mod;
return x;
}
int main()
{
ls();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int i,j;
test_inp()
{
ll n;
cin >> n ;
if(n%2==1)
cout << "Odd" << endl;
else
{
if((n/2)%2==1)
cout << "Same" << endl;
else
cout << "Even" << endl;
}
}
quit;
}
//.......Functions here......
//Faster your code
inline void ls()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
}
//Multiple Maximum
ll maxx(ll a, ll b, ll c, ll d, ll e)
{
ll ans = a>b ? a : b ;
ans = ans > c ? ans : c ;
ans = ans > d ? ans : d ;
ans = ans > e ? ans : e ;
return ans;
}
//Multiple Minimum
ll minn(ll a, ll b, ll c, ll d, ll e)
{
ll ans = a<b ? a : b ;
ans = ans < c ? ans : c ;
ans = ans < d ? ans : d ;
ans = ans < e ? ans : e ;
return ans;
}
//double sort, both key and value in descending order
//and to make both ascending, use rbegin() and rend()
//priority: key
bool cmp1(pair<ll,ll> i1,pair<ll,ll> i2)
{
if(i1.first == i2.first)
return (i1.second> i2.second);
else
return (i1.first >i2.first);
}
//double sort, key ascending and value descending
//for vice versa, use rbegin() and rend()
//priority: value
bool cmp2(pair<ll,ll> a, pair<ll,ll> b)
{
if(a.second!=b.second)
return (a.second > b.second);
else
return (a.first < b.first);
}
//Euclidean gcd
ll eugcd(ll a,ll b)
{
if(b==0)
return a;
ll p=a%b;
return eugcd(b,p);
}
//ceil
inline ll ceill(ll n, ll k)
{
return (n/k)+bool(n%k);
}
//......Function over | #include <iostream>
using namespace std;
int main(){
int T;
long c;
cin >> T;
for(int t=0; t<T; t++){
cin >> c;
if(c%2!=0){
cout << "Odd" << endl;
} else if(c%4!=0){
cout << "Same" << endl;
} else{
cout << "Even" << endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
ll X; cin >> X;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.rbegin(), a.rend());
ll res=X-a[0];
for(int k=2;k<=n;k++){
vector<vector<int>> dp(k+1,vector<int>(k,-1));
dp[0][0]=0;
for(int i=0;i<n;i++){
for(int j=k-1;j>=0;j--){
for(int l=0;l<k;l++){
if(dp[j][l]<0)continue;
int nx=(l+a[i])%k;
dp[j+1][nx]=max(dp[j+1][nx],dp[j][l]+a[i]);
}
}
}
if(dp[k][X%k]>=0){
res=min(res,(ll)(X-dp[k][X%k])/k);
}
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VII;
typedef vector<ll> VL;
typedef vector<vector<ll>> VLL;
constexpr int mod = 1e9 + 7;
constexpr ll KINF = 1e18;
constexpr double eps = 1e-7;
int main(){
ios::sync_with_stdio(false); cin.tie(0);
int n;
ll x;
cin >> n >> x;
VI a(n);
_rep(i, 0, n) cin >> a[i];
auto check = [&](int k){
int rem = x % k;
int b[n];
_rep(i, 0, n) b[i] = a[i] % k;
int dp[n + 1][k + 1][k + 1];
memset(dp, -0x3f, sizeof dp);
_rep(i, 0, n + 1) dp[i][0][0] = 0;
_rep(i, 1, n + 1)
_rep(j, 1, k + 1)
_rep(z, 0, k){
dp[i][j][z] = dp[i - 1][j][z];
if(z - b[i - 1] >= 0) dp[i][j][z] = max(dp[i][j][z], dp[i - 1][j - 1][z - b[i - 1]] + a[i - 1]);
else dp[i][j][z] = max(dp[i][j][z], dp[i - 1][j - 1][z + k - b[i - 1]] + a[i - 1]);
if(dp[n][k][rem] == x) return 0;
}
return dp[n][k][rem];
};
int res = -1;
vector<PII> ans;
_dep(k, n, 1){
res = check(k);
if(res > 0) {
ans.eb(res, k);
}
if(res == 0){
cout << 0 << endl;
return 0;
}
}
if(ans.empty()) {
sort(all(a));
// auto it = lb(all(a), x);
// if(it != a.end()) cout << x - *it << endl;
// else cout << x - a[n - 1] << endl;
cout << x - a[n - 1] << endl;
return 0;
}
else{
ll res = KINF;
for(auto& [ini, div] : ans){
res = min(res, (x - ini) / div);
}
cout << res << endl;
}
return 0;
}
// 小心左移运算符导致的int溢出
// dp记得处理非法状态
// resize并不会初始化数组
// 全局函数一定要记得inline
// 带空格字符串不能直接cin,要用getline
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void solve() {
ll N;
cin >> N;
vector<ll> P(N);
rep(i, N) cin >> P[i];
vector<ll> ans;
for(ll n = 0; n >= 0; n++) {
bool ok = true;
bool update = false;
//cout << "n = " << n << endl;
//rep(i, N) cout << P[i] << " ";
//cout << endl;
rep(i, N-1) {
if(P[i+1] < P[i]) {
ok = false;
if(i%2 == n%2) {
ans.push_back(i+1);
swap(P[i], P[i+1]);
update = true;
break;
}
}
}
if(ok) break;
if(!update) {
for(ll i = N-2; i >= 0; i--) {
if(i%2 == n%2) {
ans.push_back(i+1);
swap(P[i], P[i+1]);
break;
}
}
}
}
cout << ans.size() << endl;
rep(i, ans.size()) {
cout << ans[i];
if(i != ans.size() - 1) cout << " ";
}
cout << endl;
}
int main(){
ll T;
cin >> T;
rep(i, T) solve();
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <atcoder/convolution>
//#include <atcoder/modint>
//using Modint = atcoder::modint998244353;
using namespace std;
typedef long long ll;
void ex_gcd(ll a, ll b, ll &d, ll &x, ll &y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
ex_gcd(b, a % b, d, y, x);
y -= a / b * x;
}
}
ll inv(ll a, ll n) {
ll d, x, y;
ex_gcd(a, n, d, x, y);
return d == 1 ? (x % n + n) % (n / d) : -1;
}
ll gcd(ll x, ll y) {
if (y == 0) return x;
return gcd(y, x % y);
}
const int maxn = 505;
const int mod = 998244353;
int a[maxn];
int pos[maxn];
int main() {
#ifdef suiyuan2009
freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "r", stdin);
freopen("/Users/suiyuan2009/CLionProjects/icpc/output.txt", "w", stdout);
#endif
int T;
cin>>T;
while(T--){
int n;
cin>>n;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
pos[a[i]] = i;
}
int cur=1;
vector<int>ans;
for(int i=n;i>=4;i--){
if(pos[i]==i)continue;
if((pos[i]&1)!=cur){
if(i==4&&pos[4]==3){
int idx = pos[i];
swap(a[idx-1], a[idx]);
cur = 1-cur;
ans.push_back(idx-1);
pos[a[idx-1]] = idx-1;
pos[a[idx]] = idx;
}
for(int j=1;j<i;j++){
if(a[j]!=i&&a[j+1]!=i&&(j&1)==cur){
swap(a[j], a[j+1]);
cur = 1 - cur;
ans.push_back(j);
pos[a[j]] = j;
pos[a[j+1]] = j+1;
break;
}
}
}
for(int j=pos[i];j<i;j++){
ans.push_back(j);
cur = 1-cur;
swap(a[j], a[j+1]);
pos[a[j]] = j;
pos[a[j+1]] = j+1;
}
}
if(n==2){
if(!(a[1]==1&&a[2]==2)){
ans.push_back(1);
cur = 1 - cur;
swap(a[1], a[2]);
pos[a[1]] = 1;
pos[a[2]] = 2;
}
} else {
while(!(a[1]==1&&a[2]==2&&a[3]==3)){
int tmp = 2 - cur;
ans.push_back(tmp);
cur = 1-cur;
swap(a[tmp], a[tmp+1]);
pos[a[tmp]] = tmp;
pos[a[tmp+1]] = tmp+1;
}
}
cout<<ans.size()<<endl;
for(int i=0;i<ans.size();i++){
if(i)printf(" ");
printf("%d", ans[i]);
}
cout<<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 < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define bit(n,k) ((n>>k)&1) //nのk bit目
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll llINF = 1LL << 60;
const int iINF = 1e9;
//------------------------------------------------
struct Solver{
void solve(){
ll N;
cin >> N;
string S;
cin >> S;
ll Q;
cin >> Q;
ll flip=0;
rep(qi,Q){
ll ti,A,B;
cin >>ti>> A >> B;
if(ti==1){
A = (A-1+N*flip)%(2*N);
B = (B-1+N*flip)%(2*N);
swap(S[A],S[B]);
}else flip = 1-flip;
}
if(flip==0) cout << S << endl;
else cout << S.substr(N,N) << S.substr(0,N) << endl;
}
};
int main(){
int testcasenum=1;
//cin >> testcasenum;
rep1(ti,testcasenum){
Solver solver;
solver.solve();
}
return 0;
}
| #include<bits/stdc++.h>
typedef long long ll;
#define int long long
using namespace std;
const int p=1e4;
int read(){
string s;cin>>s;
int t=4;
int f=0;
int ans=0;
for(auto i:s){
if(i=='.'){
f=1;
continue;
}else{
ans=ans*10+(i-'0');
if(f)t--;
}
}
while(t){
ans=ans*10;
t--;
}
return ans;
}
signed main(){
int X=read();
int Y=read();
int R=read();
//定义横坐标左右边界
int lc=X-R;
int rc=X+R;
while(lc%p)lc++;
while(rc%p)rc--;
//定义上下界指针; 横坐标变化的时候,只需要移动一点点上下界指针就行了.
int up=Y,down=Y;
while(up%p)up++;//取整
while(down%p)down--;
//
int ans=0;
for(int i=lc;i<=rc;i+=p){//枚举横坐标
int ix=abs(X-i);
//
while(ix*ix+(up-Y)*(up-Y)>R*R)up-=p;//up下移
while(up<=Y||ix*ix+(up-Y)*(up-Y)<=R*R)up+=p;//up上移到上界+1
//
while(ix*ix+(Y-down)*(Y-down)>R*R)down+=p;//down上移
while(down>=Y||ix*ix+(Y-down)*(Y-down)<=R*R)down-=p;//down下移到下界-1
//
int add=(up-down+p-2*p)/p;//up-down+1-2就是长度.
if(add>0)ans+=add;
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
const int maxn=2e3+5;
int n,m,u,v,w,dis[maxn][maxn],a[maxn];
struct node{
int x,y;
bool operator<(const node &a)const{
return y>a.y;
}
};
vector<node> g[maxn];
void dijkstra(int u){
dis[u][u]=0;
queue<node> q;
q.push({u,0});
while(!q.empty()){
node now=q.front();
q.pop();
int from=now.x;
for(auto it:g[from]){
int to=it.x,w=it.y;
if(dis[u][from]+w<dis[u][to]){
dis[u][to]=dis[u][from]+w;
q.push({to,dis[u][to]});
}
}
}
}
int main(){
n=read(),m=read();
memset(a,inf,sizeof(a));
memset(dis,inf,sizeof(dis));
for(int i=1;i<=m;++i){
u=read(),v=read(),w=read();
if(u==v) a[u]=min(a[u],w);
else g[u].push_back({v,w});
}
for(int i=1;i<=n;++i) dijkstra(i);
for(int i=1;i<=n;++i){
int ans=inf;
for(int j=1;j<=n;++j){
if(i==j) continue;
ans=min(ans,dis[i][j]+dis[j][i]);
}
ans=min(ans,a[i]);
if(ans==inf) printf("-1\n");
else printf("%d\n",ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin>> n >> m;
vector<pair<int, int>> a(m);
for (auto& [A, B] : a) cin>> A >> B;
int k; cin>> k;
vector<pair<int, int>> b(k);
for (auto& [C, D] : b) cin>> C >> D;
int ans = 0;
for (int bit=0; bit<(1<<k); bit++) {
vector<bool> ball(n);
for (int i=0; i<k; i++) {
const auto [C, D] = b[i];
ball[bit & 1<<i ? C : D] = 1;
}
int cnt = 0;
for (auto [A, B] : a) if (ball[A] && ball[B]) cnt++;
if (ans < cnt) ans = cnt;
}
cout << ans << endl;
return 0;
} |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
// #pragma GCC optimize("O3","unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("avx2")
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) -> iterator of kth element (in sorted fashion : low - high)
// order_of_key(x) -> #numbers strictly less than x
#define sync ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
#define unq(a) sort(all(a));a.resize(unique(all(a)) - a.begin())
#define F first
#define S second
#define endl '\n'
using pii = pair<int , int>;
using ll = long long;
using ld = long double;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//mt19937 rng(0);
int main(){
sync
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
//cin >> t;
while(t--){
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++){
string r;
for (int x = 4, j = i; j < s.size() && x > 0; j++,x--){
r += s[j];
}
cnt += (r == "ZONe");
}
cout << cnt << endl;
}
cerr << "processor time: " << clock() / (double) CLOCKS_PER_SEC << "s ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int cnt=0;
for(int i=0;i<9;i++){
string T=S.substr(i,4);
if(T=="ZONe") cnt++;
}
cout<<cnt<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pl;
ld const PI = 4*atan((ld)1);
int const N = 107;
int X[N], Y[N];
int main()
{
fastio;
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> X[i] >> Y[i];
for (int i = 0; i < n; ++i)
for (int j = i+1; j < n; ++j)
for (int k = j+1; k < n; ++k)
{
if ((Y[j] - Y[i]) * (X[k] - X[j]) == (Y[k] - Y[j]) * (X[j] - X[i]))
{
//cout << i << " " << j << " " << k << '\n';
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
}
| #include<bits/stdc++.h>
//#define int long long int
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fastm_fast ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
using namespace std;
const int mod = 1e9 + 7;
const int MAX = 2e5+5;
typedef pair<int, int> pii;
typedef vector<int> vi ;
typedef vector<string> vs;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef map<int,int> mapii ;
void sujho(){
int n ;
cin >> n ;
vector<pair<int,string> > v;
for(int i = 0; i < n; i++){
int x ;
string s;
cin >> s ;
cin >> x;
v.push_back({x,s});
}
sort(all(v));
cout << v[n-2].second;
}
int main()
{
fastm_fast;
// int test;cin >> test;
// for(int i = 1; i <= test; i++)
{ //cout << "Case #"<< test << ":";
sujho();
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m;
int main()
{
scanf("%d%d",&n,&m);
if(n==1&&m==0)
{
printf("1 2\n");
return 0;
}
if(m<0||m>=n-1)
{
printf("-1\n");
return 0;
}
m++;
printf("1 %d\n",2*m+2);
for(int i=1;i<=m;i++)
printf("%d %d\n",i*2,i*2+1);
for(int i=m+1;i<n;i++)
printf("%d %d\n",i*2+1,i*2+2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N,L;
vector<int> A(1e5+10), B(1e5+10), C, high(1e5+10), low(1e5+10);
main() {
cin >> N >> L;
C.push_back(0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
C.push_back(A[i]-i);
}
C.push_back(L-N);
int t = 0;
for (int i = 1; i <= N; i++) {
cin >> B[i];
// cout << "Goal: " << " " << B[i] << "\n";
// for (int c: C) cout << c+i << " "; cout << "\n";
auto it = lower_bound(C.begin(), C.end(), B[i]-i);
if (it == C.end() || *it != B[i]-i) {
cout << "-1\n";
return 0;
}
auto it2 = upper_bound(C.begin(), C.end(), B[i]-i);
int z = it-C.begin();
int z2 = it2-C.begin()-1;
if (z <= i && i <= z2) {
z = i;
}
else if (abs(z2-i) < abs(z-i)) {
z = z2;
}
//go from i to z
//cout << i << " to " << z << "\n";
if (i < z) {
low[z] = max(z-i, low[z]);
}
if (i > z) {
high[z] = max(i-z,high[z]);
}
}
for (int i = 0; i <= N+1; i++) {
// cout << i << " " << low[i] << " " << high[i] << "\n";
t += low[i] + high[i];
}
cout << t << "\n";
// cout << t << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int to_int(char c){ return c-'0'; }
string s[3];
int n;
void solve(){
bool flag=1;
for(int i=0;i<3;++i)
if(to_int(s[i][0])+to_int(s[i][n+n-1])==2) flag=0;
if(flag){
for(int i=1;i<=n;++i) putchar('1');
putchar('0');
for(int i=1;i<=n;++i) putchar('1');
}else{
putchar('1');
for(int i=1;i<=n;++i) putchar('0');
for(int i=1;i<=n;++i) putchar('1');
}
puts("");
}
int main(){
int T; scanf("%d",&T);
while(T--){
cin>>n;
cin>>s[0]>>s[1]>>s[2];
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 9;
char s[5][N];
void solve(){
int n; scanf("%d", &n);
scanf("%s %s %s", &s[1][1], &s[2][1], &s[3][1]);
for (int i = 1; i <= n; ++i) putchar('1');
for (int i = 1; i <= n; ++i) putchar('0');
putchar('1'); putchar('\n');
}
int main(){
int T; scanf("%d", &T);
while (T--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5;
ll v[N],p[N],a[N];
int main()
{
ll n;cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
ll ans=0;
for(int i=1;i<=n;i++)
{
ll sum=0;ll pos=a[i];
for(int j=i;j<=n;j++)
{
if(a[j]>=pos) sum+=pos;
else break;
}
for(int j=i-1;j>=1;j--)
{
if(a[j]>=pos) sum+=pos;
else break;
}ans=max(ans,sum);
}cout<<ans<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 510;
int n;
int a[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
int mn_idx = 1;
bool ok = true;
for (int i = 1; i <= n; ++i) {
for (int j = 1, del; j <= n; ++j) {
cin >> a[i][j];
if (i > 1) {
if (j == 1) del = a[i][j] - a[i - 1][j];
else if (a[i][j] - a[i - 1][j] != del) ok = false;
}
}
if (a[i][1] < a[mn_idx][1]) mn_idx = i;
}
if (ok) {
cout << "Yes\n";
for (int i = 1; i <= n; ++i) cout << a[i][i] - a[mn_idx][i] << ' ';
cout << '\n';
for (int i = 1; i <= n; ++i) cout << a[mn_idx][i] << ' ';
cout << '\n';
} else {
cout << "No\n";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
long long n,x,a;
int main()
{
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a;
if(a!=x)
{
cout<<a<<" ";
}
}
return 0;
} | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define endl '\n'
#define vs vector<string>
#define mii map<int,int>
#define msi map<string,int>
#define vpii vector< pair<int, int > >
#define vpsi vector< pair< string ,int > >
#define forci(p,q) for(int i=p;i<q;i++)
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);}
ull power(ull a, ull b) {a %= mod; ull res = 1; while (b > 0) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res%mod; }
ll modmul(ll x, ll y){return (x*y)%mod;}
ll modadd(ll x, ll y){return (x+y)%mod;}
ll modsub(ll x, ll y){return (x-y+mod)%mod;}
ll fact[1000007]={0};
void facto() {fact[0]=1;fact[1]=1;for(int i=2;i<1000007;i++)fact[i]=(fact[i-1]*i)%mod;}
ll ncr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(power(fact[r],mod-2)))%mod; res=(res*(power(fact[n-r],mod-2)))%mod; return res;}
ll npr(ll n,ll r) {ll res=1; res=fact[n]; res=(res*(power(fact[n-r],mod-2)))%mod; return res;}
inline long long toint(const std::string &s) {std::stringstream ss; ss << s; long long x; ss >> x; return x;}
inline std::string tostring(long long number) {std::stringstream ss; ss << number; return ss.str();}
inline std::string tobin(long long x) {return std::bitset<63>(x).to_string();}
/*bool prime[MAX];
ull sieve(){memset(prime,true,sizeof(prime));for(ull p=2;p*p<MAX;p++){if(prime[p]==true){for(ull i=2*p;i<MAX;i+=p){prime[i]=false;}}}prime[0]=0;prime[1]=0;
}*/
/*
int inv[1000001]={0};int invf[1000001]={0};
void findinverse(){
inv[0]=1;
inv[1] = 1;
for(int i = 2; i <=1e6 ; ++i)
inv[i] = (mod - (mod/i) * inv[mod%i] % mod) % mod;
invf[0]=1;invf[1]=1;
for(int i=2;i<=1e6;i++){
invf[i]=invf[i-1]*inv[i]%mod;
}
}*/
using namespace std;
int solve()
{
int x,y;
cin>>x>>y;
cout<<(x+y)/2<<" "<<(x-y)/2<<endl;
return 0;
}
signed main()
{
fastio;
// test
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
template <typename T>
inline void print(T x){
if(x<0) putchar('-'),x=-x;
if(x>9) print(x/10);
putchar(x%10^48);
}
int x,y,z;
int main(){
read(x),read(y),read(z);
for(register int i=0;i<=1000000;++i){
double tep=double((1.0*i)/z),tep2=double((1.0*y)/x);
if(tep>=tep2){
// cout<<tep<<" "<<tep2<<endl;
print(i-1);break;
}
}
return 0;
} | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
#define mod 1000000007
#define pi 3.14159265358979
#define PRE(x,p) cout<<setprecision(x)<<p;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define endl "\n"
#define high INT_MAX
#define low INT_MIN
#define ll long long int
using namespace std;
void showa(ll a[],ll n){ for(ll i=1;i<=n;i++) cout<<a[i]<<' '; cout<<endl; }
void showv(vector<ll>v){ for(ll i=0;i<v.size();i++) cout<<v[i]<<' '; cout<<endl;}
void solve()
{
ll n1,b,c,d,i;
cin>>n1>>b>>c>>d;
ll n2=0;
for(i=1;i<=1000000;i++)
{
if(n1<=n2*d)
{cout<<i-1;
return;}
n1+=b;
n2+=c;
}
cout<<"-1";
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t=1;
// cin>>t;
for(ll test=1;test<=t;test++)
{
// cout<<"CASE #"<<test<<": ";
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int M = 998244353;
int rep(int x) {
x %= M;
if (x < 0) x += M;
return x;
}
int add(int a, int b) {
return rep(a + b);
}
int mul(int a, int b) {
return rep(a * b);
}
int pw(int a, int b) {
int r = 1;
while (b) {
if (b & 1) r = rep(r * a);
a = rep(a * a);
b /= 2;
}
return r;
}
int dv(int a, int b) {
return rep(a * pw(b, M - 2));
}
const int N = 5000 + 7;
int n, sum, dp[N], fact[N], ifact[N], dp2[N];
int comb(int n, int k) {
if (k < 0 || k > n) return 0;
return mul(fact[n], mul(ifact[k], ifact[n - k]));
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
///freopen ("input", "r", stdin);
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(fact[i - 1], i);
}
ifact[N - 1] = dv(1, fact[N - 1]);
for (int i = N - 2; i >= 0; i--) {
ifact[i] = mul(ifact[i + 1], i + 1);
}
dp[0] = 1;
cin >> n >> sum;
for (int b = 0; (1 << b) <= sum; b++) {
int p = (1 << b);
for (int j = 0; j <= sum; j++) dp2[j] = 0;
for (int cnt = 0; cnt * p <= sum; cnt += 2) {
int ways = comb(n, cnt);
for (int bef = 0; bef + cnt * p <= sum; bef++) {
dp2[bef + cnt * p] = add(dp2[bef + cnt * p], mul(ways, dp[bef]));
}
}
for (int j = 0; j <= sum; j++) dp[j] = dp2[j];
}
cout << dp[sum] << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#define len(v) int(v.length())
#define lob(v,n) lower_bound(all(v),n)
#define lobi(v,n) lower_bound(all(v),n) - v.begin()
#define upb(v,n) upper_bound(all(v),n)
#define upbi(v,n) upper_bound(all(v),n) - v.begin()
#define mod 998244353
#define infi 1010000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;
template<typename T> bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}
template<typename T> bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}
class Combination {
vl fac,finv,inv;
public:
Combination(ll n) {
n++;
fac.resize(n);finv.resize(n);inv.resize(n);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
reps(i,2,n){
fac[i] = fac[i-1]*(ll)i%mod;
inv[i] = (ll)mod - inv[mod%i]*(ll)(mod/i)%mod;
finv[i] = finv[i-1]*inv[i]%mod;
}
}
ll com(ll n, ll m){
if(n < m) return 0;
if(n < 0 || m < 0) return 0;
return fac[n]*(finv[m]*finv[n-m]%mod)%mod;
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N,M;
cin >> N >> M;
Combination C(10000);
int n = 14;
vvl dp(n+1,vl(M+1,0));
dp[0][0] = 1;
rep(i,n){
int a = int(1<<i);
rep(k,M+1){
dp[i+1][k] += dp[i][k];
dp[i+1][k] %= mod;
if(dp[i][k] == 0) continue;
for (int j = 2; j <= N; j += 2) {
if(a*j+k > M) break;
dp[i+1][a*j+k] += dp[i][k]*C.com((ll)N,(ll)j)%mod;
dp[i+1][a*j+k] %= mod;
}
}
}
cout << dp[n][M] << endl;
return 0;
}
|
#include<bits/stdc++.h> //---------------------------------------------------------------
# define ll long long
# define mod 1000000007
# define MAX 100005
# define PI 3.141592653589793238 //shortcut keys
# define pb push_back
# define mp make_pair
# define all(x) x.begin(),x.end()
# define fr(i,a,b) for(int i=a;i<=b;i++)
# define decimal(k) fixed<<setprecision(k)
# define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); //---------------------------------------------------------------
using namespace std;
int main()
{
int n;cin>>n;
vector<tuple<ll,ll,ll> > v;
ll suma=0;
fr(i,1,n){
ll x,y,z;cin>>x>>y;
z=2*x+y;
v.pb(make_tuple(z,x,y));
suma+=x;
}
sort(all(v));
reverse(all(v));
int ans=0;
ll sumt=0;
fr(i,0,n-1){
sumt+=get<1>(v[i])+get<2>(v[i]);
suma-=get<1>(v[i]);
ans++;
if(sumt>suma)break;
}
cout<<ans<<'\n';
return 0;
}
| #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define p_q priority_queue
#define m_p make_pair
#define pb push_back
#define ld long double
#define fi first
#define se second
#define ull unsigned long long
#define mod 1000000007
#define md 998244353
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
using namespace std;
inline void read(int &x){
short negative=1;
x=0;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')negative=-1;
c=getchar();
}
while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();
x*=negative;
}
ll qpow(ll n,ll k){
ll ans=1;
while(k){
if(k%2){
ans*=n;
ans%=mod;
}
n*=n;
n%=mod;
k/=2;
}
return ans;
}
string i_to_s(int n){
string s="";
while(n){
int now=n%10;
s+=now+'0';
n/=10;
}
reverse(s.begin(),s.end());
return s;
}
int s_to_i(string s){
int n=0;
rep(i,s.size()){
n*=10;
n+=s[i]-'0';
}
return n;
}
int n;
int main(){
ios::sync_with_stdio(0);
cin>>n;
cout<<(n-1)/100+1<<"\n";
return 0;
}
//特判判全
//循环边界
//精度足够
//注意初值
|
#include<bits/stdc++.h>
using namespace std;
const int p = 31;
const int m = 1e9 + 7;
typedef long long ll;
typedef int in;
#define ff first
#define ss second
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
bitset<200009>vis;
vector<ll>dp(200009, -1e12);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<ll>cst(n);
for (int i = 0; i < n; ++i) {
cin >> cst[i];
}
vector<vector<int>>gr(n);
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
--x; --y;
gr[x].push_back(y);
}
ll ans = -1e12;
function<ll(int)>f = [&](int i) {
if (dp[i] > -1e10)return dp[i];
ll tmp = -1e12;
vis[i] = 1;
if (gr[i].empty()) {
return 0ll;
}
for (auto& it : gr[i]) {
tmp = max(tmp, cst[it] - cst[i] + f(it));
tmp=max(tmp, cst[it]-cst[i]);
}
ans = max(ans, tmp);
return dp[i] = tmp;
};
for (int i = 0; i < n; ++i) {
if (!vis[i] && !gr[i].empty()) {
f(i);
}
}
cout << ans;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=3e5+10;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=10500000;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
//long long tt = clock();
#endif
ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
int n,m1,q,i,j,k;
cin>>n>>m1>>q;
vector<pair<int,int>> v(n);
for(i=0;i<n;++i)
{int x,y;
cin>>x>>y;
v[i]=make_pair(x,y);
}
sort(v.begin(),v.end());
vector<int> w1(m1);
for(i=0;i<m1;++i)
cin>>w1[i];
while(q--)
{
int l,r,m;
cin>>l>>r;
--l,--r;
vector<int> w;
for(i=0;i<l;++i)
w.push_back(w1[i]);
for(i=r+1;i<m1;++i)
w.push_back(w1[i]);
m=w.size();
sort(w.begin(),w.end());
int dp[m+1][n+1];
for(i=0;i<=m;++i)
for(j=0;j<=n;++j)
dp[i][j]=INT_MIN;
for(i=0;i<=n;++i)
{
dp[0][i]=0;
}
for(i=0;i<=m;++i)
{
dp[i][0]=0;
}
for(i=1;i<=m;++i)
{
for(j=1;j<=n;++j)
{
// ith box till jth;
for(k=j;k>=1;--k)
{
if(v[k-1].first<=w[i-1])
{ if(dp[i-1][k-1]!=INT_MIN)
dp[i][j]=max(dp[i][j],dp[i-1][k-1]+v[k-1].second);
}
}
dp[i][j]=max(dp[i][j],dp[i-1][j]);
}
}
cout<<dp[m][n]<<"\n";
}
return(0);
}
|
#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 mem(a,b) memset(a,b,sizeof(a))
#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
vec v(3);
cin>>v[0]>>v[1]>>v[2];
sort(all(v));
cut(v[2]+v[1])
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
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;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1<<30;
const ll inf_l = 1LL<<61;
const int MAX = 1e5;
int main() {
int n; cin >> n;
vvint c(n, vint(n));
rep(i,n)rep(j,n) cin >> c[i][j];
rep(i,n)rep(j,i) {
vint tmp(n);
vint x = c[i], y = c[j];
rep(k,n) tmp[k] = x[k] - y[k];
bool ok = true;
int v = tmp[0];
REP(k,n) if (tmp[k] != v) ok = false;
if (!ok) {
cout << "No" << endl;
return 0;
}
}
P p = P(inf, -1);
rep(i,n) {
if (c[i][0] < p.first) p = P(c[i][0], i);
}
vint b = c[p.second], a(n);
rep(i,n) a[i] = c[i][0] - b[0];
cout << "Yes" << endl;
rep(i,n) printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
rep(i,n) printf("%d%s", b[i], i == n - 1 ? "\n" : " ");
} |
#include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define vi vector<int>
#define vii vector<ii>
#define all(x) x.begin(), x.end()
#define EPS 1e-9
#define INF 1e18
#define ROOT 1
#define curtime chrono::steady_clock::now().time_since_epoch().count
#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
using ll = long long;
using namespace std;
const double PI = acos(-1);
const int M = 1000000007;
// const int M = 998244353;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int mod(int n, int m = M) {
int ret = n % m;
if (ret < 0) ret += m;
return ret;
}
int exp(int n, int k, int m = M) {
if (k == 0) return 1;
if (k == 1) return n;
int ax = exp(n, k / 2, m);
ax = mod(ax * ax, m);
if (k % 2) ax = mod(ax * n, m);
return ax;
}
int gcd(int a, int b) {
if (a == 0)
return b;
else
return gcd(b % a, a);
}
//#define MULTIPLE_TEST_CASE
void solution() {
int n, m;
cin >> n >> m;
vector<vector<char>> A(n, vector<char>(m));
ii S, G;
int dst[n][m];
vector<ii> pos[26];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> A[i][j];
dst[i][j] = INF;
if (A[i][j] == 'S') S = ii(i, j);
if (A[i][j] == 'G') G = ii(i, j);
if (A[i][j] >= 'a' && A[i][j] <= 'z') pos[A[i][j] - 'a'].pb(ii(i, j));
}
}
auto valid = [&](const int x, const int y) {
return x >= 0 && x <= n - 1 && y >= 0 && y <= m - 1 && A[x][y] != '#';
};
set<char> tels;
for (char c = 'a'; c <= 'z'; c++) {
tels.insert(c);
}
set<tuple<int, int, int>> s;
dst[S.ff][S.ss] = 0;
s.insert(mt(0, S.ff, S.ss));
while (s.size() > 0) {
int i, j, d;
tie(d, i, j) = *s.begin();
s.erase(s.begin());
if (dst[i][j] != d) continue;
// take tel
if (A[i][j] >= 'a' && A[i][j] <= 'z' && tels.count(A[i][j])) {
tels.erase(A[i][j]);
for (ii x : pos[A[i][j] - 'a']) {
if (valid(x.ff, x.ss) && dst[x.ff][x.ss] > d + 1) {
dst[x.ff][x.ss] = d + 1;
s.insert(mt(d + 1, x.ff, x.ss));
}
}
}
// normal
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
for (int k = 0; k < 4; k++) {
int ni = i + dx[k];
int nj = j + dy[k];
if (valid(ni, nj) && dst[ni][nj] > d + 1) {
dst[ni][nj] = d + 1;
s.insert(mt(d + 1, ni, nj));
}
}
}
if (dst[G.ff][G.ss] >= INF) dst[G.ff][G.ss] = -1;
cout << dst[G.ff][G.ss] << endl;
}
int32_t main() {
DESYNC;
int t = 1;
#ifdef MULTIPLE_TEST_CASE
cin >> t;
#endif
while (t--) solution();
}
| #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--)
#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 H,W;
cin >> H >> W;
auto id = [&](int x,int y){
return x*W+y;
};
auto xy = [&](int a){
return (pair<int,int>){a/W,a%W};
};
auto in = [&](int x,int y){
return 0<=x && x<H && 0<=y && y<W;
};
vvec<char> S(H,vec<char>(W));
int sx,sy,gx,gy;
int M = 26;
vvec<int> list(M);
rep(i,H) rep(j,W){
cin >> S[i][j];
if(S[i][j]=='S') sx = i,sy = j;
else if(S[i][j]=='G') gx = i,gy = j;
else if(isalpha(S[i][j])) list[S[i][j]-'a'].push_back(id(i,j));
}
vec<int> dx = {-1,1,0,0},dy = {0,0,-1,1};
vec<int> dp(H*W+M,-1);
deque<int> Q;
dp[id(sx,sy)] = 0;
Q.push_back(id(sx,sy));
while(!Q.empty()){
int now = Q.front(); Q.pop_front();
if(now<H*W){
auto [x,y] = xy(now);
rep(k,4){
int nx = x+dx[k],ny = y+dy[k];
if(!in(nx,ny)) continue;
if(S[nx][ny]=='#') continue;
if(dp[id(nx,ny)]==-1){
dp[id(nx,ny)] = dp[now]+1;
Q.push_back(id(nx,ny));
}
}
if(isalpha(S[x][y]) && islower(S[x][y])){
int to = H*W+(S[x][y]-'a');
if(dp[to]==-1){
dp[to] = dp[now];
Q.push_front(to);
}
}
}else{
for(auto& to:list[now-H*W]){
if(dp[to]==-1){
dp[to] = dp[now]+1;
Q.push_back(to);
}
}
}
}
// rep(i,H) rep(j,W) cerr << dp[id(i,j)] << (j!=W-1? " ":"\n");
cout << dp[id(gx,gy)] << "\n";
} |
/*
ll fastmod(ll x,ll y)
{
ll res=1;
if(x%mod==0)
return 0;
while(y>0)
{
if(y&1)
res=(res*x)%mod;
y=y>>1;
x=(x*x)%mod;
}
return res;
}
}*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i,n) for(ll i=0;i<n;i++)
#define Fo(i,k,n) for(ll i=k;i<n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define tr(it,v) for(auto it=v.begin(),it!=v.end();it++)
#define vin(v,k) fo(i,k)cin>>a,v.pb(a);
#define deb(x) cout<<#x<<" "<<x<<'\n';
#define mod 1000000007
#define siz 100010
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
/*ll arr[250010];
struct node
{
ll val,zcnt,ocnt,tcnt;
node(val=0,zcnt=0,ocnt=0,tcnt=0)
{
val(val),zcnt(zcnt),ocnt(ocnt),tcnt(tcnt);
}
}
node merge(node a,node b)
{
}
*/
ll fastmod(ll a,ll b)
{
ll ans=1;
a=a%mod;
if(a==0)
return 0;
while(b)
{
if(b&1)
ans=(ans*a)%mod;
b=b>>1;
a=(a*a)%mod;
}
return ans%mod;
}
ll fermat(ll a)
{
return fastmod(a,mod-2)%mod;
}
vector<ll> fact(siz);
vector<ll> invfact(siz);
void f()
{
fact[0]=fact[1]=invfact[0]=invfact[1]=1;
for(ll i=2;i<siz;i++)
{
fact[i]=(i*fact[i-1])%mod;
invfact[i]=(invfact[i-1]*fermat(i))%mod;
}
}
ll choose(ll n,ll r)
{
ll ans=fact[n]%mod;
ans=(ans*invfact[n-r])%mod;
ans=(ans*invfact[r])%mod;
return ans%mod;
}
int main()
{
fast;
ll a,b,c,d,p,n,m,t,h,k,q,x,val,y;
cin>>n;
ll ans=0;
set<ll> s;
for(ll i=2;i<=(ll)sqrt(n);i++)
{
val=i;
while(val<=n)
{
val*=i;
if(val<=n)
s.insert(val);
}
}
cout<<n-s.size();
}
/*cin>>t;
map<ll,ll> mp;
while(t--)
{
cin>>n>>m>>k;
cin>>p;
set<ll> s;
for(ll i=0;i<p;i++)
{
cin>>a;
s.insert(a)
}
}
*/ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
unordered_set<ll> s;
for(ll a = 2; a * a <= N; a++){
ll x = a * a;
while(x <= N){
s.insert(x);
x *= a;
}
}
cout << N - s.size() << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y);}
template<class T, class U> void umax(T& x, const U& y){ x = max(x, (T)y);}
template<class T> void print(T& v){ for(auto it : v) cout << it << " "; cout << endl; }
template<class T, class U> void init(vector<T> &v, U x, size_t n) { v=vector<T>(n, (T)x); }
template<class T, class U, typename... W> void init(vector<T> &v, U x, size_t n, W... m) { v=vector<T>(n); for(auto& a : v) init(a, x, m...); }
int n;
vector<ll> a;
vector<vector<int>> p, nn;
const int MOD = 1e9+7;
vector<vi> cache;
int solve(int i, int k){
if (k > n) return 0;
if (k == n) return 1;
if (i > n) return 0;
if (cache[i][k] != -1) return cache[i][k];
ll r = 0;
// int s = 0;
int j = nn[i][k];
r += solve(i+1, j+1);
r -= MOD * (r >= MOD);
r += solve(i, j+1);
r -= MOD * (r >= MOD);
// for(int j = k; j < n; j++){
// int ds = a[j] % i;
// s = s + ds;
// if (s >= i) s -= i;
// if (s == 0){
// r += solve(i+1, j+1);
// r -= MOD * (r >= MOD);
// r += solve(i, j+1);
// r -= MOD * (r >= MOD);
// break;
// }
// }
return cache[i][k] = r;
}
//#define TEST 1
int main(int argc, char** argv) {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(15);
if (argc == 2 && atoi(argv[1]) == 123456789) freopen("d:\\code\\cpp\\contests\\stdin", "r", stdin);
#if TEST
n = 3000;
a.resize(n);
FOR(i, n)
a[i] = rand() * (1LL + rand());
#else
cin >> n;
a.resize(n);
FOR(i, n) cin >> a[i];
#endif
init(p, 0, n+1, n+1);
init(nn, 0, n+1, n+1);
FOR1(i, n){
FOR(k, n){
if (k) p[i][k] = p[i][k-1];
p[i][k] += a[k] % i;
p[i][k] -= i * (p[i][k] >= i);
}
map<int, int> H;
FORI(k, n){
H[p[i][k]] = k;
int pr = 0;
if (k) pr = p[i][k-1];
if (H.count(pr))
nn[i][k] = H[pr];
else
nn[i][k] = n;
}
}
init(cache, -1, n+1, n+1);
const ll i2 = (MOD+1)/2;
cout << solve(1, 0) * i2 % MOD << endl;
// FOR(i, n){
// FOR(j, n)
// cout << cache[i][j] << " ";
// cout << endl;
// }
if (argc == 2 && atoi(argv[1]) == 123456789) cout << clock()*1.0/CLOCKS_PER_SEC << " sec\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr int mod = 1000000007;
long long dp[3005][3005],sum[3005][3005],tmp[3005][3005];
int main() {
int N;
cin >> N;
vector<long long>A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
for(int i = 0; i < N; i++) {
long long tmp2 = 0;
for(int j = 0; j < N; j++) {
tmp2 += A[j];
tmp2 %= (i+1);
tmp[i][j] = tmp2;
}
}
for(int i = 0; i < N; i++) {
dp[i][0] = 1;
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
dp[i][j] += sum[j][tmp[j][i]];
dp[i][j] %= mod;
}
for(int j = 0; j < N; j++) {
sum[j+1][tmp[j+1][i]] += dp[i][j];
sum[j+1][tmp[j+1][i]] %= mod;
}
}
long long ans = 0;
for(int i = 0; i < N; i++) {
ans += dp[N-1][i];
ans %= mod;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N = 2e5 + 10;
int n, ans[N], timer;
bool diametr[N];
vector <int> g[N];
pair<int, int> dfs1(int u, int p) {
pair<int, int> tmp = {0, u}, cur;
for (int to : g[u]) {
if (to == p) continue;
cur = dfs1(to, u);
tmp = max(tmp, {cur.fi + 1, cur.se});
}
return tmp;
}
bool dfs2(int u, int p, int x) {
diametr[u] = true;
if (u == x) return true;
for (int to : g[u]) {
if (to == p) continue;
if (dfs2(to, u, x))
return true;
}
return false;
diametr[u] = false;
}
void dfs3(int u, int p) {
ans[u] = ++timer;
for (int to : g[u])
if (to != p && !diametr[to]) dfs3(to, u);
for (int to : g[u])
if (to != p && diametr[to]) dfs3(to, u);
timer++;
}
main(){
//freopen("input.txt", "r", stdin);
scanf("%d", &n);
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d %d", &u, &v);
g[u].pb(v);
g[v].pb(u);
}
int t1, t2;
pair<int, int> tmp;
tmp = dfs1(1, -1); t1 = tmp.se;
tmp = dfs1(t1, -1); t2 = tmp.se;
dfs2(t1, -1, t2);
dfs3(t1, -1);
for (int i = 1; i <= n; i++)
printf("%d ", ans[i]);
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(20);
}
} iosetup;
int main() {
int n; cin >> n;
vector<int> a(n + 1, 1);
FOR(i, 1, n + 1) for (int j = i * 2; j <= n; j += i) chmax(a[j], a[i] + 1);
// FOR(i, 1, n + 1) FOR(j, i + 1, n + 1) {
// if (j % i == 0) assert(a[i] != a[j]);
// }
FOR(i, 1, n + 1) cout << a[i] << " \n"[i == n];
return 0;
}
|
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define PB push_back
#define fi first
#define se second
#define MP make_pair
const int P = 1000000007;
const int V = 70;
char s[V];
int a[V];
LL K;
bool check(LL mid, int n) {
LL v = 0;
for (int i = 0; i < n; ++i) {
if (v > K / mid || v * mid > K) return false;
v = v * mid + a[i];
}
return v <= K;
}
int main() {
while (~scanf("%s%lld", s, &K)) {
int n = strlen(s);
for (int i = 0; i < n; ++i) a[i] = s[i] - '0';
int D = 0;
for (int i = 0; i < n; ++i) D = max(D, a[i]);
if (n == 1) {
if (a[0] <= K) puts("1");
else puts("0");
continue;
}
if (D > K) {
puts("0");
continue;
}
LL lo = 1, up = K;
while (lo != up) {
LL mid = (lo + up + 1) / 2;
//printf("%lld %lld %lld\n", lo, up, mid);
if (check(mid, n)) lo = mid;
else up = mid - 1;
}
printf("%lld\n", max(0LL, up - D));
}
return 0;
}
/*
22 10
999 1500
100000000000000000000000000000000000000000000000000000000000 1000000000000000000
*/
| #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define gmn(a,b) a=min(a,b)
#define gmx(a,b) a=max(a,b)
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int infi=2e9;//infi较大，注意涉及inf相加时爆int
const ll infl=4e18;
inline ll ceil_div(ll a,ll b){ return (a+b-1)/b; }
inline ll pos_mod(ll a,ll b){ return (a%b+b)%b; }
//std::mt19937 rnd(time(0));//std::mt19937_64 rnd(time(0));
}
using namespace Sakurajima_Mai;
namespace Fast_Read{
inline int qi(){
int f=0,fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline ll ql(){
ll f=0;int fu=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-')fu=-1; c=getchar(); }
while(c>='0'&&c<='9'){ f=(f<<3)+(f<<1)+c-48; c=getchar(); }
return f*fu;
}
inline db qd(){
char c=getchar();int flag=1;double ans=0;
while((!(c>='0'&&c<='9'))&&c!='-') c=getchar();
if(c=='-') flag=-1,c=getchar();
while(c>='0'&&c<='9') ans=ans*10+(c^48),c=getchar();
if(c=='.'){c=getchar();for(int Bit=10;c>='0'&&c<='9';Bit=(Bit<<3)+(Bit<<1)) ans+=(double)(c^48)*1.0/Bit,c=getchar();}
return ans*flag;
}
}
namespace Read{
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define rai(x,a,b) repi(i,a,b) x[i]=qi()
#define ral(x,a,b) repi(i,a,b) x[i]=ql()
}
namespace Out{
#define pi(x) printf("%d",x)
#define pl(x) printf("%lld",x)
#define ps(x) printf("%s",x)
#define pc(x) printf("%c",x)
#define pe() puts("")
}
namespace DeBug{
#define MARK false
#define DB if(MARK)
#define pr(x) cout<<#x<<": "<<x<<endl
#define pra(x,a,b) cout<<#x<<": "<<endl; \
repi(i,a,b) cout<<x[i]<<" "; \
puts("");
#define FR(a) freopen(a,"r",stdin)
#define FO(a) freopen(a,"w",stdout)
}
using namespace Fast_Read;
using namespace Read;
using namespace Out;
using namespace DeBug;
namespace INT128{
inline void print(__int128 x)
{
if(!x) return;
if(x<0) putchar('-'),x=-x;
print(x/10),putchar(x%10+'0');
}
inline void read(__int128 &X)
{
int w=0; char ch=0; X=0;
while(!isdigit(ch)) w|=ch=='-',ch=getchar();
while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
if(w) X=-X;
}
}
using namespace INT128;
const int MAX_N=1e5+5;
char s[MAX_N];
int x[MAX_N],len;
__int128 m;
bool check(ll base)
{
__int128 now=1,res=0;
repd(i,len,1){
if(res>m-now*x[i]) return false;
res+=now*x[i];
if(i!=1&&now>m/base) return false;
now*=base;
if(i!=1&&now>m) return false;
}
return true;
}
int main()
{
ss(s+1); read(m);
len=strlen(s+1);
int mx=0;
repi(i,1,len) x[i]=(s[i]-'0'),gmx(mx,x[i]);
if(!check(1ll*mx+1)) return puts("0"),0;
if(len==1) return puts("1"),0;
ll l=mx+1,r=1000000000000000000,ans;
while(l<=r){
ll mid=(l+r)>>1;
if(check(mid)) ans=mid,l=mid+1;
else r=mid-1;
}
pl(ans-(mx+1)+1),pe();
return 0;
} |
/*
AUTHOR: nit1n
CREATED: 23.01.2021 22:00:57
*/
#include<bits/stdc++.h>
#define int long long
using namespace std ;
const int N = 65 ;
vector<string> a(N) ;
int dp[N][2][2] ,n ;
int solve(int idx , bool flag){
if(idx > n){
return ((flag)?1 : 0) ;
}
if(dp[idx][flag][0] != -1 && dp[idx][flag][1] != -1){
return dp[idx][flag][0] + dp[idx][flag][1] ;
}
if(a[idx] == "AND"){
dp[idx][flag][0] = solve(idx +1 , flag&0) ;
dp[idx][flag][1] = solve(idx +1 , flag&1) ;
}else{
dp[idx][flag][0] = solve(idx +1 , flag|0) ;
dp[idx][flag][1] = solve(idx +1 , flag|1) ;
}
return dp[idx][flag][1] + dp[idx][flag][0] ;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
cin >> n ;
for(int i = 1 ; i <= n ; ++i){
cin >> a[i] ;
}
memset(dp , -1 , sizeof(dp)) ;
int ans = solve(1 , true) + solve(1 ,false ) ;
cout << ans ;
}
| #define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
int n;
int a[maxn], b[maxn];
void read_input()
{
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> a[i];
for(int i = 1; i <= n; ++i)
cin >> b[i];
}
void solve()
{
lli ans = 0;
multiset<int> odd, even;
for(int i = 1; i <= n; ++i)
{
ans += b[i];
if(i & 1) odd.insert(b[i] - a[i]);
else even.insert(b[i] - a[i]);
}
int remain = n / 2;
while(remain)
{
int val_odd = *odd.begin(); odd.erase(odd.begin());
int val_even = *even.begin(); even.erase(even.begin());
--remain;
if(val_odd + val_even < 0)
ans -= val_odd + val_even;
else break;
}
cout << ans << '\n';
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
read_input();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
signed main(){
int n;cin>>n;
vector<int> x(n),y(n);
REP(i,n)cin>>x[i]>>y[i];
int m;cin>>m;
vector<int> a(m+1),b(m+1),c(m+1),d(m+1),e(m+1),f(m+1);
a[0]=e[0]=1;
b[0]=c[0]=d[0]=f[0]=0;
REP(i,m){
int t;cin>>t;
a[i+1]=a[i],b[i+1]=b[i],c[i+1]=c[i],d[i+1]=d[i],e[i+1]=e[i],f[i+1]=f[i];
if(t==1){
a[i+1]=d[i],b[i+1]=e[i],c[i+1]=f[i];
d[i+1]=-a[i],e[i+1]=-b[i],f[i+1]=-c[i];
}
if(t==2){
a[i+1]=-d[i],b[i+1]=-e[i],c[i+1]=-f[i];
d[i+1]=a[i],e[i+1]=b[i],f[i+1]=c[i];
}
if(t==3){
int p;cin>>p;
a[i+1]=-a[i],b[i+1]=-b[i],c[i+1]=2*p-c[i];
}
if(t==4){
int p;cin>>p;
d[i+1]=-d[i],e[i+1]=-e[i],f[i+1]=2*p-f[i];
}
}
int q;cin>>q;
REP(i,q){
int A,B;cin>>A>>B;B--;
cout<<a[A]*x[B]+b[A]*y[B]+c[A]<<" "<<d[A]*x[B]+e[A]*y[B]+f[A]<<endl;
}
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
using namespace std;
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
vector<int>v[200005];
int sm[200005];
int c[200005];
signed main()
{
int n,m;
cin>>n>>m;
rep(i,n) cin>>c[i],sm[i]=1000000000000000;
rep(i,m){
int a,b;
cin>>a>>b;
v[b-1].pb(a-1);
}
int ans=-1000000000000000;
rep(i,n){
rep(j,sz(v[i])){
sm[i]=min(sm[i],sm[v[i][j]]);
sm[i]=min(sm[i],c[v[i][j]]);
}
// cout<<sm[i]<<' ';
ans=max(ans,c[i]-sm[i]);
}
cout<<ans;
re 0;
}
|
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include <iomanip>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --j){ A[i] -= A[j]; if(A[i] < 0) A[i] += m; }
}
void div_a(int v){
for(int i = v, j = 0; i <= dim_a; ++i, ++j){
A[i] += A[j]; if(A[i] >= m) A[i] -= m;
}
}
void mult_b(int v){
dim_b += v;
for(int i = dim_b, j = i - v; j >= 0; --i, --j){
B[i] -= B[j]; if(B[i] < 0) B[i] += m;
}
}
void div_b(int v){
for(int i = v, j = 0; i <= dim_b; ++i, ++j){
B[i] += B[j]; if(B[i] >= m) B[i] -= m;
}
}
int main(void){
std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(16);
A[0] = 1; B[0] = 1;
std::cin >> n >> k >> m; ++k;
for(int i = 1, j = k; i < n; ++i, j += k){ dim_a += j; mult_a(j); div_a(i); }
for(int i = 0, j = n, I = k, J = k * (n - 1); ; I += k, J -= k){
long long int res_v = 0;
for(int d = 0; d <= dim_b; ++d) res_v += static_cast<long long int>(A[d]) * B[d] % m;
if(res_v) res_v = (k * res_v - 1) % m; else res_v = m - 1;
res[i++] = res_v; res[--j] = res_v;
if(i > j) break;
mult_a(j); div_a(J);
mult_b(I); div_b(i);
}
for(int i = 0; i < n; ++i) std::cout << res[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
vi a(n + 1);
rep(i, 0, n + 1) cin >> a[i];
int ans = INT_MAX;
rep(i, 0, n) ans = min(ans, abs(a[i] - a[i + 1]));
vector<vi> b(n + 1, vi(ans, 0));
int k = 0;
rep(i, 0, n + 1) {
rep(j, 0, ans) b[i][j] = a[i] / ans;
int dif = a[i] - (a[i] / ans) * ans;
if(i % 2 == 0) {
rep(j, 0, dif) {
b[i][k]++;
k = (k + 1) % ans;
}
}else {
rep(j, 0, dif) {
k = (k + ans - 1) % ans;
b[i][k]++;
}
}
}
cout << ans << '\n';
rep(j, 0, ans) {
rep(i, 0, n + 1) {
cout << b[i][j] << ' ';
}
cout << '\n';
}
} |
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define mod 1000000007
#define rep(i,be,en) for(int i=be;i<=en;i++)
const int INF = 0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
//const double pi=acos(-1);
using namespace std;
const int N=2e5+7;
const int M=1e6+7;
inline int read(){
char c=getchar();int x=0,f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
inline ll readl(){
char c=getchar();ll x=0,f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int T,n,m,fl;
string s;
int p;//模数
int ksm(int a,int k){
int res=1;
a%=p;
while(k){
if(k&1) res=1ll*res*a%p;
k>>=1;
a=1ll*a*a%p;
}
return res;
}
int C(int a,int b){
if(a<b) return 0;
int up=1,down=1;
for(int i=a,j=1;j<=b;i--,j++){
up=1ll*up*i%p;
down=1ll*down*j%p;
}
return 1ll*up*ksm(down,p-2)%p;
}
int Lucas(ll a,ll b){
if(a<p&&b<p) return C(a,b);
else return 1ll*C(a%p,b%p)*Lucas(a/p,b/p)%p;
}
map<char,int> mp;
signed main(){
n=read();
cin>>s;
p=3;
mp['B']=0;mp['W']=1;mp['R']=2;
int ans=0;
rep(i,0,n-1){
ans=(ans+Lucas(n-1,i)*mp[s[i]])%3;
}
if(n%2==0) ans=(3-ans)%3;
if(ans==0) puts("B");
else if(ans==1) puts("W");
else puts("R");
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int main() {
int n;
cin >> n;
cout << (n % 2 == 0 ? "White" : "Black") << endl;
return 0;
} |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll s, p;
cin >> s >> p;
for(ll i = 1; i * i <= p; i++){
if(p % i == 0 && i + p / i == s){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, w;
cin >> n >> w;
cout << n / w << endl;
return 0;
} |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll kotae = 0;
int A[100000];
rep(i, N) {
cin >> A[i];
kotae += A[i];
}
priority_queue<int> p, q;
rep(i, N) {
int b;
cin >> b;
if (i & 1) p.push(b - A[i]);
else q.push(b - A[i]);
}
while (p.size()) {
int a = p.top();
int b = q.top();
if (a + b <= 0) break;
kotae += a + b;
p.pop();
q.pop();
}
co(kotae);
Would you please return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
using ll=long long;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
int vec[N];
for(int i=0;i<N;i++){
cin >> vec[i];
}
int x,X;
while(1){
sort(vec,vec+N);
x=vec[0],X=vec[N-1];
if(vec[0]==vec[N-1]){
cout << vec[0] << endl;
break;
}
for(int i=0;i<N;i++){
if(vec[i]%x==0)vec[i]=x;
else vec[i]=vec[i]%x;
}
}
} |
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
double r, x, y;
double p;
inline bool check()
{
double c = p / r;
if(int(c) * r == p) return 0;
return 1;
}
int main()
{
scanf("%lf%lf%lf", &r, &x, &y);
p = 1.0 * sqrt(x * x + y * y);
if (check()) printf("%d\n", int((p - r) / r) + 2);
else printf("%d\n",int(p / r));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
// using T = tuple<int,int,int>;
using P = pair<int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed main(){
int R; cin>>R;
int X, Y; cin>>X>>Y;
int dist2 = X*X + Y*Y;
if(dist2==R*R){
cout<<1<<endl;
}else if(dist2<R*R){
cout<<2<<endl;
}else{
// int N2 = dist2/(R*R);
for(int i=2;i<=1000000;i++){
if(i*i*R*R>=dist2){
cout<<i<<endl;
return 0;
}
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define deb(...) cerr << "[" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
void DBG() { cerr << "]\n";}
template<typename T, typename ...Args> void DBG(T first, Args... args)
{cerr << first; if(sizeof...(args))cerr<<", "; DBG(args...); }
void solve(){
int n,k; cin >> n >> k;
int cnt=0;
for(int i=2;i<=2*n;i++){
int num=k+i;
if(num>2*n||num<=1)continue;
if(num%2==0&&i%2){
int m=min(num,n);
int combs=(m-(m==num?1:0)-(num)/2)*2+1;
int m2=min(n,i);
int combs2=(m2-(m2==i?1:0)-(i-1)/2)*2;
cnt+=combs*combs2;
}
else if(num%2==0&&i%2==0){
int m=min(num,n);
int combs=(m-(m==num?1:0)-(num)/2)*2+1;
int m2=min(n,i);
int combs2=(m2-(m2==i?1:0)-i/2)*2+1;
cnt+=combs*combs2;
}
else if(num%2&&i%2){
int m=min(num,n);
int combs=(m+(m==num?-1:0)-(num-1)/2)*2;
int m2=min(n,i);
int combs2=(m2-(m2==i?1:0)-(i-1)/2)*2;
cnt+=combs*combs2;
}
else if(num%2&&i%2==0){
int m=min(num,n);
int combs=(m+(m==num?-1:0)-(num-1)/2)*2;
int m2=min(n,i);
int combs2=(m2+(m2==i?-1:0)-i/2)*2+1;
cnt+=combs*combs2;
}
}
cout << cnt << endl;
}
int32_t main(){
ios_base:: sync_with_stdio(false);
cin.tie(0);
int t=1;
for(int tt=1;tt<=t;tt++){
solve();
}
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SZ = 3100, INF = 1e9;
template<int MOD>
struct Mint {
int val;
Mint() : val(0) {}
Mint(int x) : val(x) {}
Mint(long long x) : val((x % MOD + MOD) % MOD) {}
Mint<MOD> operator + (Mint<MOD> a) const {
int x = val + a.val;
return Mint<MOD>(x - MOD * (x >= MOD));
}
Mint<MOD> operator - (Mint<MOD> a) const {
int x = val - a.val;
return Mint<MOD>(x + MOD * (x < 0));
}
Mint<MOD> operator * (Mint<MOD> a) const {
return Mint<MOD>((long long)val * a.val % MOD);
}
static Mint<MOD> power(Mint<MOD> a, long long b) {
if (b == 0) return Mint<MOD>(1);
if (b % 2) return a * power(a, b - 1);
return power(a * a, b / 2);
}
Mint<MOD> rev() const {
return power(*this, MOD - 2);
}
Mint<MOD> operator / (Mint<MOD> a) const {
return Mint<MOD>((long long)val * a.rev().val % MOD);
}
Mint<MOD>& operator += (Mint<MOD> a) {
return *this = *this + a;
}
Mint<MOD>& operator -= (Mint<MOD> a) {
return *this = *this - a;
}
Mint<MOD>& operator *= (Mint<MOD> a) {
return *this = *this * a;
}
Mint<MOD>& operator /= (Mint<MOD> a) {
return *this = *this / a;
}
Mint<MOD>& operator = (long long x) {
return *this = Mint<MOD>(x);
}
friend istream& operator >> (istream &in, Mint<MOD> &x) {
long long val;
in >> val;
x = Mint<MOD>(val);
return in;
}
friend ostream& operator << (ostream &out, Mint<MOD> x) {
return out << x.val;
}
};
constexpr int MOD = 998244353;
using mint = Mint<MOD>;
ll n, k;
mint dp[SZ + 3][SZ + 3], ones[SZ + 3][2];
int main() {
fastInp;
cin >> n >> k;
dp[0][0] = 1;
for (int i = 0; i <= SZ; i++) {
for (int j = SZ; j >= 0; j--) {
if (i > 0 && j > 0) dp[i][j] += dp[i - 1][j - 1];
if (j != 0 && 2 * j < SZ) dp[i][j] += dp[i][2 * j];
}
}
cout << dp[n][k];
return 0;
} |
#include "bits/stdc++.h"
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/4
#define INTINF INT_MAX/2
#define all(x) (x).begin(),(x).end()
#define debug(x) cerr<<#x<<": "<<x<<endl
#define debug_vec(v) cerr<<#v<<":";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
template<class T> inline bool chmax(T &a, T b){if(a < b){a = b;return true;}return false;}
template<class T> inline bool chmin(T &a, T b){if(a > b){a = b;return true;}return false;}
/*----------------------------------------------------------------*/
// const int MOD = 998244353;
const int MOD = 1000000007;
/*----------------------------------------------------------------*/
bool dp[200100][10] = {};
/*----------------------------------------------------------------*/
signed main(){
int n;
string s,x;
cin >> n >> s >> x;
dp[n][0] = 1;
for(int i = n-1;i >= 0;i--){
int cnt = 0;
rep(j,10){
bool a = dp[i+1][10*j%7];
bool b = dp[i+1][(10*j+(s[i]-'0'))%7];
if(x[i] == 'T' && (a||b)){
dp[i][j] = true;
cnt++;
}
if(x[i] == 'A' && (a&&b)){
dp[i][j] = true;
cnt++;
}
}
if(cnt == 0){
cout << "Aoki" << endl;
return 0;
}
}
if(dp[0][0])cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
return 0;
}
/*----------------------------------------------------------------*/
// g++ -std=gnu++17 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl https://atcoder.jp/contests/agc048/tasks/agc048_a
// rm -r -f test;oj d https://atcoder.jp/contests/abc195/tasks/abc195_a
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int MAX = 2e5;
vector<map<int,int>> mp(MAX);
class Union_Find{
vector<int> par; vector<int> rank; vector<int> num;
public:
Union_Find(int n) {
par = vector<int>(n); rank = vector<int>(n,0); num = vector<int>(n,1);
rep(i,n) par[i] = i;
}
int find(int x) {
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
int number(int x) {
return num[find(x)];
}
void unite(int x, int y) {
x = find(x); y = find(y);
if (x == y) return;
if (rank[x] < rank[y]) swap(x, y);
if (rank[x] == rank[y]) rank[x]++;
par[y] = x;
num[x] += num[y];
for(auto s : mp[y]) mp[x][s.first] += s.second;
mp[y].clear();
}
bool same(int x, int y) {
return find(x) == find(y);
}
};
int main(){
int n, q;
cin >> n >> q;
int c[n];
rep(i,n) {
cin >> c[i];
c[i]--;
mp[i][c[i]]++;
}
Union_Find uf(n);
vector<int> ans;
rep(i,q) {
int t, x, y;
cin >> t >> x >> y;
x--; y--;
if(t == 1) uf.unite(x,y);
else ans.push_back(mp[uf.find(x)][y]);
}
for(auto x : ans) cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
using Edge = struct { int to; int cost; };
const int INF = 1e9;
vector<int> a,b,c;
int n,m;
// s: スタート位置, g: 隣接リストグラフ
vector<int> dijkstra(int s, vector<vector<Edge>> g) {
vector<int> dist(g.size(), INF);
dist[s] = 0;
priority_queue<P, vector<P>, greater<P>> q;
q.emplace(0, s); // [現在位置のコスト, 位置位置]
while (!q.empty()) {
P p = q.top(); q.pop();
auto d = p.first, v = p.second;
if (dist[v] < d) continue;
for (Edge e: g[v]) {
if (dist[v]+e.cost < dist[e.to]) {
dist[e.to] = dist[v] + e.cost;
q.emplace(dist[e.to], e.to);
}
}
}
return dist;
}
void solve() {
vector<vector<Edge>> g(n);
REP(i,m) {
Edge e = { b[i], c[i] };
g[a[i]].emplace_back(e);
}
REP(i,n) {
vector<int> d = dijkstra(i, g);
int ans = INF;
REP(j,n) {
for(Edge e: g[j]) {
if (e.to == i) ans = min(ans, d[j]+e.cost);
}
}
cout << (ans == INF ? -1 : ans) << endl;
}
}
int main() {
cin >> n >> m;
a.resize(m); b.resize(m); c.resize(m);
REP(i,m) {
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
}
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const long long INF = numeric_limits<long long>::max();
const long long DP_INF = 1 << 29;
template <class T> using arr = vector<vector<T>>;
using vint = vector<int>;
using vll = vector<ll>;
// SourceTest用出力マクロ
#ifdef SOURCE_TEST
#define SPR(x) PR(x)
#define SPS(x) PS(x)
#define STRACE(var) cout << #var << "=" << var << endl;
#define SMAPTRACE(var) \
cout << #var << "=" \
<< "{" << var.first << "," << var.second << "}" << endl;
#else
#define SPR(x) \
{}
#define SPS(x) \
{}
#define STRACE(var) \
{}
#define SMAPTRACE(var) \
{}
#endif
template <class T> void dump(const vector<T>& vec) {
#ifdef SOURCE_TEST
for (ll i = 0; i < vec.size(); ++i) {
cout << vec[i] << ",";
}
cout << endl;
#endif
}
struct Item {
ll to;
ll minutes;
friend ostream& operator<<(ostream& os, const Item& pos) {
#ifdef SOURCE_TEST
os << "{" << pos.to << "," << pos.minutes << "}";
#endif
return os;
}
};
template <class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll N, M;
cin >> N >> M;
vector<vector<Item>> routes(N);
for (ll i = 0; i < M; ++i) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
routes[a].push_back(Item{b, c});
}
for (const auto& v : routes) {
dump(v);
}
for (ll n = 0; n < N; ++n) {
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> que;
vll dist(N, INF);
dist[n] = 0;
que.push({dist[n], n});
ll ans = INF;
while (!que.empty()) {
ll index = que.top().second;
ll d = que.top().first;
que.pop();
if (d > dist[index]) continue;
STRACE(index);
for (const auto& route : routes[index]) {
if (chmin(dist[route.to], dist[index] + route.minutes)) {
que.push({dist[route.to], route.to});
}
if (route.to == n) {
chmin(ans, dist[index] + route.minutes);
}
}
STRACE(ans);
dump(dist);
}
if (ans == INF) {
PR(-1);
} else {
PR(ans);
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,x,man=0,che=0;
double eu=0;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
man+=abs(x);
eu+=abs(x*x);
che=max(che,abs(x));
}
eu=sqrt(eu);
printf("%ld",man);
cout<<endl;
printf("%.15lf",eu);
cout<<endl;
printf("%ld",che);
}
| #include<bits/stdc++.h>
#define ll long long int
const ll MOD = 1e9+7;
const ll inf = 1e18+5;
using namespace std;
#define debug() for(ll l=0;l<50;l++){}
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll bs(ll arr[], ll l, ll r, ll x){
ll mid=0;
if (r >= l){
if (arr[mid] == x) return mid;
if (arr[mid] > x) return bs(arr, l, mid - 1, x);
return bs(arr, mid + 1, r, x);
}
return -1;
}
ll power(ll x,ll y,ll p){
ll res = 1;
x = x % p;
if(x == 0) return 0;
while (y > 0){
if (y & 1) res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
const int max1=500001;
pair<int,int>st[4*max1];
int arr[max1],arr1[max1];
void buildtree(int si,int ss,int se){
if(ss==se){
st[si].first=arr1[ss];
st[si].second=arr1[ss];
return;
}
int mid=ss+(se-ss)/2;
buildtree(2*si,ss,mid);
buildtree(2*si+1,mid+1,se);
if(arr1[mid]>arr1[mid+1]) st[si].first=st[2*si].first+st[2*si+1].first;
else st[si].second=st[2*si].second+st[2*si+1].second;
}
int query(int si,int ss,int se,int qs,int qe){
if(qs>se || qe<ss) //completely outside
return inf;
if(ss>=qs && se<=qe)
return st[si].first;
int mid=ss+(se-ss)/2;
int l=query(2*si,ss,mid,qs,qe);
int r=query(2*si+1,mid+1,se,qs,qe);
return min(l,r);
}
int geteven(int si,int ss,int se,int qs,int qe){
if(ss>qe || se<qs) //completely outside
return 0;
if(ss>=qs && se<=qe)
return st[si].second;
int mid=ss+(se-ss)/2;
int l=geteven(2*si,ss,mid,qs,qe);
int r=geteven(2*si+1,mid+1,se,qs,qe);
return l+r;
}
int getodd(int si,int ss,int se,int qs,int qe){
if(qs>se || qe<ss) //completely outside
return 0;
if(ss>=qs && se<=qe)
return st[si].first;
int mid=ss+(se-ss)/2;
int l=getodd(2*si,ss,mid,qs,qe);
int r=getodd(2*si+1,mid+1,se,qs,qe);
return l+r;
}
void update(int si,int ss,int se,int qi,int newval){
if(ss==se){
if(arr[ss]%2==1) st[si]={0,1};
else st[si]={1,0};
arr[ss]=newval;
return;
}
int mid=ss+(se-ss)/2;
if(qi<=mid) update(2*si,ss,mid,qi,newval);
else update(2*si+1,mid+1,se,qi,newval);
st[si].first=st[2*si].first+st[2*si+1].first;
st[si].second=st[2*si].second+st[2*si+1].second;
}
ll bin_exp(ll x, ll n){ // binary exponention
ll res = 1;
while(n){
if(n&1)
res = (res*x)%MOD;
n /= 2;
x = (x*x)%MOD;
}
return res;
}
ll fermi(ll a, ll b){ // inverse mod
return (a%MOD*(bin_exp(b, MOD-2)%MOD))%MOD;
}
ll nCr(ll n, ll r){ // calc nCr
ll ans = 1;
ll k = min(r, n-r);
for(ll i=0;i<k;i++){
ans = (ans%MOD *(n-i)%MOD)%MOD;
ans = fermi(ans, i+1);
}
return ans%MOD;
}
bool isPrime(ll n){
ll flag=1;
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
flag = 0;
break;
}
}
if(n<=1)
flag=0;
else if(n==2)
flag=1;
if (flag == 1) return true;
else return false;
}
void solve(){
ll n;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++) cin>>a[i];
ll a1=0,a2=0,a3=0;
for(ll i=0;i<n;i++){
a1+=abs(a[i]);
a2+=abs(a[i]*a[i]);
a3=max(a3,abs(a[i]));
}
printf("%lld\n",a1);
printf("%.15lf\n",sqrt(a2));
printf("%lld\n",a3);
}
int main(){
fast;
ll t=1;
//cin>>t;
while(t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
template<typename T> using vv = vector<vector<T>>;
template<typename T> using vvv = vector<vector<vector<T>>>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;
const int INF = 1e9;
const ll LINF = 1e18;
const int DX[4] = {1, 0, -1, 0};
const int DY[4] = {0, 1, 0, -1};
#define _sel(_1, _2, x, ...) x
#define repn(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, ...) _sel(__VA_ARGS__, reps, repn)(i, __VA_ARGS__)
#define reppn(i, n) for (ll i = 1; i <= (n); i++)
#define repps(i, a, b) for (ll i = (a); i <= (b); i++)
#define repp(i, ...) _sel(__VA_ARGS__, repps, reppn)(i, __VA_ARGS__)
#define rrepn(i, n) for (ll i = (n) - 1; i >= 0; i--)
#define rreps(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define rrep(i, ...) _sel(__VA_ARGS__, rreps, rrepn)(i, __VA_ARGS__)
#define rreppn(i, n) for (ll i = (n); i >= 1; i--)
#define rrepps(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepp(i, ...) _sel(__VA_ARGS__, rrepps, rreppn)(i, __VA_ARGS__)
#define pb push_back
#define fi first
#define se second
#define rng(v) (v).begin(), (v).end()
#define rrng(v) (v).rbegin(), (v).rend()
#define siz(x) int((x).size())
#define pow2(x) (1ll << (x))
#define bit(x, n) ((x) >> (n) & 1)
#define prt(x) cout << (x) << endl
#define dbg(x) dbgn(#x, x)
#define dec() cout << fixed << setprecision(15)
template<typename T, typename U> inline bool umax(T& m, U x) { if (m < x) { m = x; return true; } return false; }
template<typename T, typename U> inline bool umin(T& m, U x) { if (m > x) { m = x; return true; } return false; }
template<typename T> inline void errv(T& v) { for (auto x: v) cerr << x << " "; cerr << endl; }
inline void errv(vb& v) { for (auto x: v) cerr << (x ? 1 : 0) << " "; cerr << endl; }
template<typename T> inline void dbgn(string n, T x) { cerr << n << ": " << x << endl; }
template<typename T> inline void dbgn(string n, vector<T>& v) { cerr << n << ": "; errv(v); }
template<typename T> inline void dbgn(string n, vv<T>& m) { cerr << n << ":" << endl; for (auto& v: m) errv(v); }
struct UnionFind {
vi p;
UnionFind(int n): p(n, -1) { }
int root(int x) { if (p[x] < 0) return x; else return p[x] = root(p[x]); }
int size(int x) { return -p[root(x)]; }
void unite(int x, int y) {
int rx = root(x), ry = root(y);
if (rx == ry) return; if (p[rx] > p[ry]) swap(rx, ry);
p[rx] += p[ry]; p[ry] = rx;
}
};
ll MOD = 1e9 + 7;
//ll MOD = 998244353;
struct mint {
ll x;
mint(ll a = 0): x((a + MOD) % MOD) { }
mint operator+(mint a) { return mint(*this) += a; }
mint operator-(mint a) { return mint(*this) -= a; }
mint operator*(mint a) { return mint(*this) *= a; }
mint operator/(mint a) { return mint(*this) /= a; }
mint& operator+=(mint a) { if ((x += a.x) >= MOD) x -= MOD; return *this; }
mint& operator-=(mint a) { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; }
mint& operator*=(mint a) { (x *= a.x) %= MOD; return *this; }
mint& operator/=(mint a) { return *this *= a.inv(); }
mint pow(ll t) { mint a = x, ret = 1; while (t) { if (t & 1) ret *= a; a *= a; t >>= 1; } return ret; }
mint inv() { return pow(MOD - 2); }
friend istream& operator>>(istream& is, mint& a) { return is >> a.x; }
friend ostream& operator<<(ostream& os, mint& a) { return os << a.x; }
};
int main() {
ll n;
cin >> n;
prt(n - (ll)((sqrtl(8 * (n + 1) + 1) - 1) / 2) + 1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define show(a) for(auto e:a)cout<<e<<" ";cout<<endl
#define size(a) static_cast<int>((a).size())
int main(){
const long long mod = 1e9 + 7;
int n;
cin >> n;
vector<long long> a(n);
for(int i = 0; i < n; ++i) cin >> a.at(i);
vector<vector<long long>> dp(4, vector<long long>(n, 0));
dp.at(0).at(0) = a.at(0);
dp.at(1).at(0) = 1;
for(int i = 1; i < n; ++i){
dp.at(0).at(i) = (dp.at(0).at(i - 1) + a.at(i) * dp.at(1).at(i - 1) % mod) % mod;
dp.at(0).at(i) += (dp.at(2).at(i - 1) + a.at(i) * dp.at(3).at(i - 1) % mod) % mod;
dp.at(1).at(i) = (dp.at(1).at(i - 1) + dp.at(3).at(i - 1)) % mod;
dp.at(2).at(i) = (dp.at(0).at(i - 1) + mod - a.at(i) * dp.at(1).at(i - 1) % mod) % mod;
dp.at(3).at(i) = dp.at(1).at(i - 1) % mod;
}
/*
for(int i = 0; i < 4; ++i){
show(dp.at(i));
}
*/
cout << (dp.at(0).at(n - 1) + dp.at(2).at(n - 1)) % mod << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int popcount(int x) {
int ret = 0;
while (x > 0) {
ret += x % 2;
x /= 2;
}
return ret;
}
int main() {
ll N;
cin >> N;
cout << (1 << N) - 1 << "\n";
for (int i = 1; i < (1 << N); i++) {
rep(j, (1 << N)) {
if (popcount(i & j) % 2) cout << "A";
else cout << "B";
}
cout << "\n";
}
} | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<int> A(N, 0);
REP(i, 0, N) {
int a; cin >> a;
A[--a] = 1;
}
if (accumulate(ALL(A), 0) == N) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s[n];
map< string , int > mp;
for(int i = 0 ;i < n ;i++){
cin >> s[i];
if(s[i][0] == '!') mp[s[i].substr(1)]++;
}
for(int i = 0 ; i < n ; i++){
if(s[i][0] != '!' && mp.find(s[i]) != mp.end()){
cout << s[i] << endl;
return 0;
}
}
cout << "satisfiable" << endl;
return 0;
}
| //-- In the name of ALLAH --
// We're nothing and you're everything.
// Ya Ali!
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define sz(a) (ll)a.size()
#define endl "\n"
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a*b)/gcd(a,b))
#define all(vec) vec.begin(),vec.end()
#define ms(a, b) memset(a,b,sizeof(a))
#define rep(i,n) for(int i= 0; i < int(n); i++)
#define rep1(i,n) for(int i= 1; i <= n; i++)
#define TEST_CASE(t) for(int zz=1;zz<=t;zz++)
#define PRINT_CASE printf("Case %d: ",zz)
#define fii freopen("input.txt","r",stdin);
#define foo freopen("output.txt","w",stdout);
#define boom ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
const ll M = 1e9+7;
const ll mxn = 1e5+7;
int main()
{
ll i,j,k,a,b,c,d,n,m,t,x,y,z,u,v;
string s1,s2,ans;
set<string>st;
map<string,bool>vis;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s1;
vis[s1]=true;
if(s1[0]!='!')
{
st.insert(s1);
}
}
bool flag=true;
for(auto s:st)
{
s2="!"+s;
if(vis[s2])
{
ans=s;
flag=false;
break;
}
}
if(flag)
{
cout<<"satisfiable"<<endl;
}
else
{
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for (int i = (n)-1; i >= 0; --i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
template<typename T> bool chmax(T &a, T b) {if(a<b){a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, T b) {if(a>b){a=b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
ll mpow(ll x, ll p) {
if (p==0) return 1;
ll res=mpow(x,p/2); res=res*res%MOD;
return p%2?res*x%MOD:res;
}
ll lpow(ll x, ll p) {
if (p==0) return 1;
ll res=lpow(x,p/2); res*=res;
return p%2?res*x:res;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
ll ans = 0;
for (ll i = 0; i <= 10000000; ++i) {
if (b*c > i * a) ans = max(ans, i);
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
int b, c, d;
sort(a, a+3);
cout << a[1] + a[2] << endl;
} |
//void __(){
// _(int,n);
// rep(i,1,n){
// print (i*2-1)%n+1, (i*2+1-1)%n+1;
// }
//}
//
//
#include <iomanip>
#include <vector>
#include <utility>
#include <iostream>
#include <string>
#define REP_INT(i,l,r) for(int i = (l); i <= (r); ++i)
#define GET_REP_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define rep(...) GET_REP_MACRO(__VA_ARGS__,REP_ANY,REP_INT,REP_ZERO_INT)(__VA_ARGS__)
#define all(v) (v).begin(), (v).end()
#define sz(v) ll(v.size())
#define T1 template<typename T> static
using namespace std;
typedef long long ll;
T1 ostream& operator<<(ostream& stream, const vector<T>& t);
T1 istream& read(T, T, istream& = cin);
struct _print {
string sep,end;
bool space;
ostream &stream;
_print(string _sep=" ",string _end="\n",
ostream &_stream = cout)
: sep(_sep),end(_end),space(false),
stream(_stream) {}
~_print() { stream << end; }
template <typename T>
_print &operator , (const T &t) {
if (space) stream << sep;
space = true;
stream << t;
return *this;
}
};
#define print _print(),
#define INPUT_WITHOUT_INIT(type,name) type name; cin >> name
#define GET_INPUT_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define _(...) GET_INPUT_MACRO(__VA_ARGS__,_IWI,_IWI,_IWI,_IWI,_IWI,_IWI,INPUT_WITHOUT_INIT)(__VA_ARGS__)
void __(){
_(int,n);
rep(i,1,n){
print (i*2-1)%n+1, (i*2+1-1)%n+1;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
__();
}
| #include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VVVL vector<vector<vector<ll>>>
#define INF (ll)2e9
#define INF_LL 1LL<<60
//#define MOD 998244353
#define MOD 1000000007
ll Ceil(ll val, ll div) { return (val + div - 1) / div; }
ll CeilN(ll val, ll div) { return Ceil(val, div) * div; }
ll FloorN(ll x, ll n) { return (x - x % n); }
bool IsOdd(ll x) { return ((x & 1) == 1); }
bool IsEven(ll x) { return ((x & 1) == 0); }
void Solve()
{
ll N, M, T;
cin >> N >> M >> T;
ll maxN = N;
VL A(M), B(M);
REP(i, M) cin >> A[i] >> B[i];
string ans = "Yes";
ll stTime = 0;
REP(i, M) {
N -= (A[i] - stTime);
if (N <= 0) {
ans = "No";
break;
}
N += (B[i] - A[i]);
N = min(maxN, N);
stTime = B[i];
}
N -= (T - stTime);
if (N <= 0) {
ans = "No";
}
cout << ans << endl;
}
// メイン
int main()
{
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(6);
Solve();
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i,n)cin >> a[i];
ll ans=LLONG_MAX;
for(ll bit=0; bit<(1<<n); bit++){
ll tmp_ans=0;
vector<ll> v;
ll tmp=0;
for(int i=0; i<n; i++){
tmp|=a[i];
if(bit&(1<<i) || i==n-1){
v.emplace_back(tmp);
tmp=0;
}
}
for(auto t : v){
tmp_ans ^= t;
}
ans = min(ans, tmp_ans);
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define dd long double
#define all(x) x.begin(),x.end()
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v){
os << "[";
for (ll i=0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v){
os << "{";
for (auto it : v) {
os << it;
if (it != *v.rbegin())
os << ", ";
}
os << "}";
return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v){
os<<"{";
for (auto it : v){
os << it.first << " : "
<< it.second ;
if (it != *v.rbegin())
os << ", ";
}
os << "}";
return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v){
os << "(";
os << v.first << ", "
<< v.second << ")";
return os;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
vector<ll> arr(n);
REP(i,n){
cin>>arr[i];
arr[i]--;
}
// cout<<arr<<endl;
if(n==2){
if(arr[0]==0){
cout<<0<<endl;
}
else{
cout<<1<<endl;
cout<<1<<endl;
}
continue;
}
ll turn=0;
vector<ll> ans;
for(ll elem=n-1;elem>2;elem--){
ll pos;
for(ll i=0;i<=elem;i++){
if(arr[i]==elem){
pos=i;
break;
}
}
if(pos==elem) continue;
if((pos & 1)==turn){
for(ll i=pos;i<elem;i++){
ans.pb(i);
swap(arr[i],arr[i+1]);
turn^=1;
}
}
else{
ll ideal=-1;
for(ll j=0;j<elem;j++){
if((j & 1)==turn){
if(j+1!=pos){
ideal=j;
break;
}
}
}
if(ideal!=-1){
ans.pb(ideal);
swap(arr[ideal],arr[ideal+1]);
turn^=1;
for(ll i=pos;i<elem;i++){
ans.pb(i);
swap(arr[i],arr[i+1]);
turn^=1;
}
}
else{
ans.pb(pos-1);
swap(arr[pos-1],arr[pos]);
turn^=1;
ans.pb(pos);
swap(arr[pos],arr[pos+1]);
turn^=1;
for(ll i=pos-1;i<elem;i++){
ans.pb(i);
swap(arr[i],arr[i+1]);
turn^=1;
}
}
}
}
// cout<<arr<<endl;
// cout<<turn<<endl;
vector<ll> aux(arr.begin(),arr.begin()+3);
vector<ll> tar{0,1,2};
while(aux!=tar){
if(turn & 1){
ans.pb(1);
swap(aux[1],aux[2]);
turn^=1;
}
else{
ans.pb(0);
swap(aux[0],aux[1]);
turn^=1;
}
}
cout<<ans.size()<<endl;
for(auto & x:ans){
cout<<x+1<<" ";
}
cout<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a,b=105;
int main()
{
cin>>b;
for(int i=1;i<=3;i++)
cin>>a,b=min(b,a);
cout<<b<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N ,S,T,U,U2,T2,V;
cin >> N ;
U = 0;
V = 0;
T2 = 0;
vector<long long> vec1(N);
for (long long i = 0 ; i < N ; i++){
cin >> vec1.at(i);
T = vec1.at(i) * vec1.at(i) * (N - 1 - i);
T2 = T2 + T;
}
for (long long j = 1; j < N ; j++){
S = vec1.at(j) * vec1.at(j);
U2 = 0;
U = U + vec1.at(j-1);
U2 = ( -2 ) * U * vec1.at(j);
V = V + (S * j) + U2;
}
V = V + T2;
cout << V << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
using ll = long long;
const ll mod = 998244353;
ll func(ll n) { return (n * (n + 1) / 2) % mod; }
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans = ((func(A) * func(B)) % mod) * func(C);
cout << ans % mod << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(false),cin.tie(NULL);
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define irep(i,a,b) for(int i=a;i>=b;i--)
#define ip(V,n) vector<float> V(n); for(int _i=0;_i<n;_i++) cin>>V[_i]
#define op(V,sep) for(int _i=0;_i<V.size();_i++) cout<<V[_i]<<sep
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define int long long int
#define MOD 998244353
#define MAX 100005
#define INF 1e18
//.............. User: zero_bug (Not to touch) ....................
void solve() {
int a,b,c;
cin>>a>>b>>c;
int ans=1;
ans=((a*(a+1))/2)%MOD;
ans=ans*(((b*(b+1))/2)%MOD);
ans%=MOD;
ans=ans*(((c*(c+1))/2)%MOD);
cout<<(ans%MOD)<<endl;
}
int32_t main() {
FastIO
// int t;
// cin>>t;
// rep(tt,1,t) {
// cout<<"Case #"<<tt<<":"<<" ";
solve();
// }
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
inline int read () {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') t = -1, c = getchar();
while (c >= '0' && c <= '9') ret = ret * 10 + c - '0', c = getchar();
return ret * t;
}
const int mod = 1e9 + 7;
int n, a[100100];
int main () {
n = read(); int i, j, ans = 1;
for (i = 1; i <= n; i++) a[i] = read();
sort(a + 1, a + n + 1); n = unique(a + 1, a + n + 1) - a - 1;
for (i = 1; i <= n; i++) ans = 1ll * ans * (a[i] - a[i - 1] + 1) % mod;
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "_DEBUG.hpp"
#endif
#define int long long
const long long inf = 2e18;
const int mod = 1e9 + 7;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
t = v;
}
template <class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v) {
for (auto &e : t) fill(e, v);
}
signed main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
int ans = 0;
map<int, int> mp;
mp[0] = 1;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += (i % 2 == 0 ? a[i] : -a[i]);
ans += mp[sum];
mp[sum]++;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
//
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<pii> vpii;
typedef vector<vint> vvi;
typedef map<int,int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
#define mk make_pair
#define pb push_back
#define ff first
#define ss second
//
#define por(i, a, b, in) for (int i=a ; i<(b) ; i+=in)
#define rpor(i, a, b, in) for (int i=a-1 ; i>=(b) ; i-=in)
#define rep(i, a, b) por(i, a, b, 1)
#define rrep(i, a, b) rpor(i, a, b, 1)
#define each(it, mp) for (auto it = mp.begin(); it != mp.end(); it++)
#define all(c) c.begin(), c.end()
#define allg(c) all(c), greater<> ()
#define len(v) (int) v.size()
#define notin(c, x) ((c).find(x) == (c).end())
//
#define show(x) cout << x << "\n";
#define showp(x, y) cout << x << " " << y << "\n";
#define showv(v, n) rep(i, 0, n) {cout << v[i] << " ";} cout << "\n";
#define showvp(v, n) rep(i, 0, n) {showp(v[i].ff, v[i].ss);}
#define showvv(vv, n, m) rep(i, 0, n) {showv(vv[i], m);}
#define showset(it, st) each(it, st) {cout << *it << " ";} cout << "\n";
#define showmap(it, mp) each(it, mp) {cout << it->ff << " " << it->ss << "\n";} cout << "\n";
#define precision(d) cout << setprecision(d) << fixed;
void solve () {
string s;
cin >> s;
int n = len(s);
rrep (i, n, 0) {
if (s[i] == '6') {
cout << 9;
} else if (s[i] == '9') {
cout << 6;
} else
cout << s[i];
}
cout << "\n";
}
int main ()
{
ios::sync_with_stdio(false);
cin.tie(0);
//int t; cin >> t; while (t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void get(int n, vector<int>& oct) {
vector<int> vec1(100);
int k = 0;
while (n != 0) {
vec1[k] = n % 8;
n = n / 8;
k++;
}
for (int j = k - 1; j >= 0; j--) oct.push_back(vec1[j]);
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
bool t = true;
string cur = to_string(i);
for (int j = 0; j < cur.length(); j++) {
if (cur[j] - '0' == 7) {
t = false;
break;
}
}
if (t) {
vector<int> vec;
get(i, vec);
for (int j = 0; j < vec.size(); j++) {
//cout << vec[j] << endl;
if (vec[j] == 7) {
t = false;
break;
}
}
}
if (t) cnt ++;
}
cout << cnt << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+1e3+7;
int T,n,fa[N];
int find(int x)
{
return x==fa[x]?x:fa[x]=find(fa[x]);
}
signed main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
fa[i]=i;
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
fa[find(x)]=find(i);
}
int cnt=1;
for(int i=1;i<=n;i++)
if(fa[i]==i)
cnt=cnt*2%998244353;
cnt=(cnt-1+998244353)%998244353;
printf("%d\n",cnt);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<ll,ll>
using Graph = vector<vector<P>>;
//累乗 aのb乗、正しmを法として求める
long long pw(long long a,int b,int m){
if(b==0) return 1;
else if(b%2==0){
long long x = pw(a,b/2,m);
return (x*x)%m;
}
else{
long long x = pw(a,b-1,m);
return (a*x)%m;
}
}
int main(){
int N; cin >> N;
int f[N+1]; bool remain[N+1];
int vis1[N+1];
rep(i,N){
cin >> f[i+1];
remain[i+1] = true;
vis1[i+1] = 0;
}
int loop = 0;
rep(i,N){
if(!remain[i+1]) continue;
int st = i+1;
while(vis1[st]==0){
vis1[st] = i+1;
remain[i+1] = false;
st = f[st];
}
if(vis1[st]==i+1) loop++;
}
int m = 998244353;
cout << (pw(2LL,loop,m) - 1+m)%m << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
void solve() {
int h, w, a, b; cin >> h >> w >> a >> b;
Graph c(h * (w - 1) + (h - 1) * w, vector<int>(4));
int ind = 0;
for(int i=0; i<h; i++){
for(int j=0; j<w-1; j++){
c[ind][0] = i;
c[ind][1] = j;
c[ind][2] = i;
c[ind][3] = j + 1;
ind++;
}
}
for(int i=0; i<h-1; i++){
for(int j=0; j<w; j++){
c[ind][0] = i;
c[ind][1] = j;
c[ind][2] = i + 1;
c[ind][3] = j;
ind++;
}
}
int ans = 0;
for(int i=0; i<pow(2, ind); i++){
int tmp = i;
int cnt = 0;
for(int j=0; j<ind; j++) if(i & (1<<j)) cnt++;
if(cnt == a){
Graph g(h, vector<int>(w, 0));
for(int j=0; j<ind; j++) if(i & (1<<j)){
g[c[j][0]][c[j][1]]++;
g[c[j][2]][c[j][3]]++;
}
bool p = true;
for(int ii=0; ii<h; ii++) for(int jj=0; jj<w; jj++) if(g[ii][jj] > 1) p = false;
if(p) ans++;
}
}
print(ans);
return;
}
int main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(18);
int t;
//cin >> t;
t = 1;
while(t--) solve();
return 0;
} | #include<bits/stdc++.h>
#include<fstream>
using namespace std;
#pragma GCC optimize ("Ofast")
#define all(x) x.begin() , x.end()
#define mp make_pair
#define gcd __gcd
typedef long long int ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double db;
typedef pair<ll , pll> plll;
typedef pair<pii , int> piii;
typedef pair<pll , pll> pllll;
const ll MAXN = 32 , MASK = 1 << 16 , md = 1e9 + 7 , inf = 2e9;
ll tav(ll n , ll k){
ll res = 1;
while(k > 0){
if(k & 1){
res *= n; res %= md;
}
n *= n; n %= md;
k >>= 1;
}
return res;
}
ll dp[MASK][MAXN] , t[MAXN];
int main(){ // check MAXN
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
t[0] = 1;
for(ll i = 1 ; i < 20 ; i++){
t[i] = t[i - 1] << 1;
}
memset(dp , 0 , sizeof(dp));
ll h , w , a , b , q;
cin>>h>>w>>a>>b; q = h * w;
ll lm = 1 << (h * w);
dp[0][0] = 1;
for(ll mask = 1 ; mask < lm ; mask++){
ll av;
for(ll j = 0 ; j < q ; j++){
if(mask & t[j]){
av = j;
break;
}
}
ll h = mask - t[av];
for(ll j = 1 ; j <= b ; j++){
dp[mask][j] += dp[h][j - 1];
}
if(av % w != w - 1 && (mask & t[av + 1])){
h -= t[av + 1];
for(ll j = 0 ; j <= b ; j++){
dp[mask][j] += dp[h][j];
}
h += t[av + 1];
}
if(av + w < q && (mask & t[av + w])){
h -= t[av + w];
for(ll j = 0 ; j <= b ; j++){
dp[mask][j] += dp[h][j];
}
h += t[av + w];
}
}
cout<<dp[lm - 1][b]<<'\n';
return 0;
}
/*
*/ |
#include<bits/stdc++.h>
#define ll long long
#define mod 998244353
using namespace std;
int n;
int calc(int x, int m){
if (x >= (m << 1)) x -= m << 1;
if (x >= n) x -= m;
return x + 1;
}
int main(){
scanf("%d", &n);
int m;
for (m = 1; (m << 1) <= n; m <<= 1);
for (int i = 0; i < n; i++)
printf("%d %d\n", calc(i << 1, m), calc(i << 1 | 1, m));
return 0;
} | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
//#define int long long
//const int N = ;
inline int read()
{
int X=0;bool flag=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')flag=0;ch=getchar();}
while(ch>='0'&&ch<='9'){X=(X<<1)+(X<<3)+ch-'0';ch=getchar();}
if(flag)return X;
return ~(X-1);
}
inline void write(int X)
{
if(X<0){X=~(X-1);putchar('-');}
if(X>9){write(X/10);}
putchar(X%10+'0');
}
signed main()
{
int n=read();
int ans=n/100;
if(n%100!=0)ans+=1;
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, x, y;
cin >> a >> b >> x >> y;
int Q, R, S;
Q = x * 2;
//同じ階の場合
if(a == b) cout << x << endl;
//下りの場合
else if(a > b){
R = a - b - 1;
cout << min(R * y + x, R * Q + x) << endl;
}
//上りの場合
else{
S = b - a;
cout << min(S * y + x, S * Q + x) << endl;
}
} | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
long long power(long long base, long long val)
{
int ans = 1;
for (long long i = 0; i < val; ++i) {
ans *= base;
}
return ans;
}
long long count_point(long long n1, long long n2, long long n3, long long n4, long long n5)
{
vector<long long> counts(9, 0);
counts[n1 - 1]++;
counts[n2 - 1]++;
counts[n3 - 1]++;
counts[n4 - 1]++;
counts[n5 - 1]++;
long long cnt = 0;
for (long long i = 0; i < 10; ++i) {
cnt += (i + 1) * power(10, counts[i]);
}
return cnt;
}
int main()
{
long long K;
string S, T;
cin >> K;
cin >> S;
cin >> T;
unordered_map<int, long long> num_cards;
vector<long long> Snumbers;
vector<long long> Tnumbers;
for (long long i = 1; i <= 9; ++i)
num_cards[i] = K;
for (long long i = 0; i < 4; ++i) {
long long Snumber = S[i] - '0';
long long Tnumber = T[i] - '0';
num_cards[Snumber]--;
num_cards[Tnumber]--;
Snumbers.push_back(Snumber);
Tnumbers.push_back(Tnumber);
}
long double win_rate = 0;
for (long long i = 1; i <= 9; ++i) {
if (num_cards[i] <= 0)
continue;
for (long long j = 1; j <= 9; ++j) {
if (num_cards[j] <= 0)
continue;
if (num_cards[j] == 1 && i == j)
continue;
long long Spoint = count_point(Snumbers[0], Snumbers[1], Snumbers[2], Snumbers[3], i);
long long Tpoint = count_point(Tnumbers[0], Tnumbers[1], Tnumbers[2], Tnumbers[3], j);
// cout << Spoint << endl;
// cout << Tpoint << endl;
if (Spoint > Tpoint) {
if (i == j)
win_rate += num_cards[i] * (num_cards[i] - 1);
else
win_rate += num_cards[i] * num_cards[j];
}
}
}
cout << setprecision(16) << win_rate / ((9 * K - 8) * (9 * K - 9)) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 15e5 + 5;
map<int,int> mp;
int a[N];
int main()
{
int n,m;
cin >> n >> m;
int minn = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
if(i <= m){
mp[a[i]]++;
}
}
for(int i = 0; i <= m+1; i++){
if(!mp[i]){
minn = i;
break;
}
}
for(int i = m+1; i <= n; i++){
mp[a[i]]++;
mp[a[i-m]]--;
if(!mp[a[i-m]]){
minn = min(a[i-m],minn);
}
}
cout << minn << endl;
return 0;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
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;}
#define REP(i,n) for(int i=0;i<int(n);i++)
#define ROUNDUP(a,b) ((a+b-1)/b)
#define YESNO(T) cout<<(T?"YES":"NO")<<endl
#define yesno(T) cout<<(T?"yes":"no")<<endl
#define YesNo(T) cout<<(T?"Yes":"No")<<endl
const int INFint = 1 << 30;
const ll INFLL = 1LL << 60;
const ll MOD = 1000000007LL;
const double pi = 3.14159265358979;
int si,sj;
vector<vector<int>> tile(50, vector<int>(50));
vector<vector<int>> profit(50, vector<int>(50));
vector<bool> seen(2500,false);
string ans;
void all_resize(){
return;
}
void all_input(){
cin >> si >> sj;
all_resize();
for (int i = 0; i < 50; i++){
for (int j = 0; j < 50; j++){
cin >> tile[i][j];
}
}
for (int i = 0; i < 50; i++){
for (int j = 0; j < 50; j++){
cin >> profit[i][j];
}
}
return;
}
void all_output(){
cout << ans << endl;
return;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
all_input();
all_output();
}
// |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<ll>> memo(31, vector<ll>(31, -1));
ll f(int a, int b) {
if (memo[a][b] != -1) return memo[a][b];
if (a == 0) {
return 1;
}
if (b == 0) {
return 1;
}
ll va = f(a - 1, b);
ll vb = f(a, b - 1);
memo[a][b] = va + vb;
return va + vb;
}
#ifdef _DEBUG
#define show(x) \
cerr << #x << " : "; \
showVal(x)
template <typename T>
void showVal(const T &a) { cerr << a << endl; }
template <typename T>
void showVal(const vector<T> &a) {
for (const T &v : a) cerr << v << " ";
cerr << endl;
}
template <typename T>
void showVal(const vector<vector<T>> &a) {
cerr << endl;
for (const vector<T> &v : a) showVal(v);
}
#else
#define show(x)
#endif
int main() {
ll k;
int a, b;
cin >> a >> b >> k;
f(a, b);
string ans;
int sz = a + b;
for (int i = 0; i < sz; i++) {
if (a > 0 && f(a - 1, b) >= k) {
ans += 'a';
a--;
} else {
if (a > 0) k -= f(a - 1, b);
b--;
ans += 'b';
}
show(k);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss
int n, vis[105], coun;
ld x[105], y[105], r;
inline ld sqr(ld t) {
return t*t;
}
void dfs(int node) {
vis[node] = coun;
FOR(i, 1, n) if (sqr(x[i] - x[node]) + sqr(y[i] - y[node]) < sqr(2*r) and vis[i] == -1) dfs(i);
}
bool check(ld g) {
memset(vis, -1, sizeof vis);
coun = 0;
r = g;
FOR(i, 1, n) if (100 - y[i] < 2*r and vis[i] == -1) ++coun, dfs(i);
FOR(i, 1, n) if (y[i] + 100 < 2*r and vis[i] != -1) return 0;
return 1;
}
int main() {
fastio; cout << fixed << setprecision(4);
cin >> n;
FOR(i, 1, n) cin >> x[i] >> y[i];
ld lower = 0, upper = 100.0001;
while (upper - lower > (ld) 0.0001) {
ld mid = (upper + lower)/2;
if (check(mid)) lower = mid;
else upper = mid;
}
cout << lower;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main(){
int N;
scanf("%d", &N);
if(N % 2 == 0){
printf("White\n");
}
else{
printf("Black\n");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long l;
cin >> l;
long long ans =1;
for(int i = 1; i<=11; i++){
ans *= l-i;
ans /= i;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) ((n) | (1LL << (i)))
#define togglebit(n, i) ((n) ^ (1LL << (i)))
#define lastone(n) ((n) & (-(n)))
char gap = 32;
#define ll long long
#define lll __int128_t
#define pb push_back
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
ll status[200000];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
ll i,j,k,l;
cin >> n;
vector <ll> res;
res.pb(6);
res.pb(10);
res.pb(15);
ll cnt = 0;
ll curr = 6;
status[6] = status[10] = status[15] = 1;
for(i = 1 ; i <= n - 3 ; ){
while(curr <= 10000 and status[curr] == 1){
if(cnt == 0)
curr = curr + 6;
else if(cnt == 1)
curr = curr + 10;
else
curr = curr + 15;
}
if(curr > 10000){
if(cnt == 0){
cnt = 1;
curr = 10;
}
else if(cnt == 1){
cnt = 2;
curr = 15;
}
}
if(status[curr] == 0){
status[curr] = 1;
res.pb(curr);
i++;
}
}
for(i = 0 ; i < n;i++){
cout << res[i] << " ";
}
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double ans = 0;
for (int i = 1; i <= n; ++i) {
ans += 1.0 / i;
}
ans = n * ans - 1;
cout << fixed << setprecision(12) << ans << '\n';
return 0;
}
|
//Relive your past life.
//Face your demons.
//The past is never dead,it is not even past.
//The memories are not only the key to the past but...also to the future.
//coded in Rusty Lake
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#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<string.h>
#include<stdlib.h>
#include<stdio.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define orz 1000000007
using namespace std;
int n,k,m,ans[105],f[240005],a[105];
int main(){
srand(time(0));
scanf("%d%d%d",&n,&k,&m);
for(int i=1;i*2-1<=n;++i){
memset(f,0,sizeof(f));
f[120000]=1;
for(int j=1;j<=n;++j)a[j]=j-i;
random_shuffle(a+1,a+n+1);
for(int j=1;j<=n;++j){
int t=a[j];
if(!t) continue;
if(t>0){
int T=t*k;
for(int s=230000;s>230000-t;--s){
int o=0;
for(int I=0;I<k;++I){
o+=f[s-I*t];
if(o>=m)o-=m;
}
for(int q=s;q>=10000;q-=t){
o+=f[q-T]-f[q];
if(o<0)o+=m;
else if(o>=m)o-=m;
f[q]+=o;
if(f[q]>=m)f[q]-=m;
}
}
}
else{
t=-t;
int T=t*k;
for(int s=10000;s<10000+t;++s){
int o=0;
for(int I=0;I<k;++I){
o+=f[s+I*t];
if(o>=m)o-=m;
}
for(int q=s;q<=230000;q+=t){
o+=f[q+T]-f[q];
if(o<0)o+=m;
else if(o>=m)o-=m;
f[q]+=o;
if(f[q]>=m)f[q]-=m;
}
}
}
}
ans[i]=ans[n+1-i]=(f[120000]*1ll*(k+1ll)-1ll)%m;
}
for(int i=1;i<=n;++i)printf("%d\n",ans[i]);
return 0;
}
| #include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<stack>
#include<unordered_map>
#include<bitset>
#include<limits>
#include<complex>
#include<array>
#include<numeric>
#include<functional>
#include<random>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i,m,n) for(ll (i)=(ll)(m);i<(ll)(n);i++)
#define REP(i,n) rep(i,0,n)
#define all(hoge) (hoge).begin(),(hoge).end()
typedef pair<ll, ll> P;
constexpr long double m_pi = 3.1415926535897932L;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 61;
constexpr long double EPS = 1e-10;
template<typename T> using vector2 = vector<vector<T>>;
template<typename T> using vector3 = vector<vector2<T>>;
typedef vector<ll> Array;
ll dp[101][250001];
int main() {
ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
ll n, k, m;
cin >> n >> k >> m;
dp[0][0] = 1 ;
REP(i, n) {
Array tmp(i + 1, 0);
REP(j, 250001) {
(tmp[j % (i + 1)] += dp[i][j]) %= m;
if (j / (i + 1) > k)(tmp[j % (i + 1)] += m - dp[i][j - (i + 1) * (k + 1)]) %= m;
(dp[i + 1][j] += tmp[j % (i + 1)]) %= m;
}
}
auto solve = [&](ll x) {
ll ret = 0;
REP(i, 250001)(ret += dp[x - 1][i] * dp[n - x][i] % m) %= m;
(ret *= k + 1) %= m;
return (ret + m - 1) % m;
};
REP(i, n)cout << solve(i + 1) << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
#define all(v) v.begin(),v.end()
#define mp make_pair
#define space ' '
#define INF (1LL<<60)
#define graph vector<vector<edge>>
template<class T>int chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
struct edge{int to;int cst;edge(int to,int cst):to(to),cst(cst){}};
void dijkstra()
{
int n,m;cin>>n>>m;
graph g(n*2);
for(int i=0;i<m;i++){
int a,b,cst;cin>>a>>b>>cst;a--;b--;
g[a].push_back(edge(b,cst));
g[a+n].push_back(edge(b,cst));
g[a].push_back(edge(b+n,cst));
}
for(int s=0;s<n;s++){
int t=s+n;
//ここからdijkstra
vector<int>dist(n*2,INF);dist[s]=0;
vector<int>prev(n*2,-1);
//pair(d[v],[v])が要素のプラキューを作る
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
pq.push(mp(dist[s],s));
//反復
while(!pq.empty()){
//v : 使用済みでない頂点の最小がd[v]になる
//d : vに対するkey値
int v=pq.top().second;
int d=pq.top().first;
pq.pop();
if(d>dist[v])continue;
for(auto e:g[v]){
if(chmin(dist[e.to],dist[v]+e.cst)){
prev[e.to]=v;
pq.push(mp(dist[e.to],e.to));
}
}
}
if(dist[t]==INF) cout<<-1<<endl;
else{cout<<dist[t]<<endl;}
}
}
main(){
dijkstra();
} | #include <bits/stdc++.h>
using namespace std;
/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair
/* 関数マクロ */
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
#define all(v) v.begin(), v.end()
#define si(v) int(v.size())
#define UNIQUE(v) sort(all(v)), v.erase(unique(all(v)),v.end())
#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; IN(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; IN(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; IN(__VA_ARGS__);
/* 定数 */
const ll mod = 1e9 + 7;
const ll infll = (1LL << 62) - 1;
const ll inf = (1LL << 30) - 1;
/* その他 */
template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
void IN() {}
template <class Head, class... Tail>
void IN(Head &head, Tail &... tail) {
cin >> head;
IN(tail...);
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
LL(n);
set<ll> div;
rep2(i, 1, sqrt(n)) {
if (n % i == 0) {
div.em(i);
div.em(n/i);
}
}
for (auto e : div) cout << e << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
ll n , m , cnt, ans , sum;
ll x , y , z;
ll a , b , c;
string s , s1;
char ch;
vector<string>v;
int main(){
ll arr[4];
for( int i = 0;i < 4;i ++ )
cin >> arr[i];
sort( arr , arr + 4 );
cout <<arr[0];
}
| // 2020-12-13 21:00:20
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = long long;
using ld = long double;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
using P = pair<int, int>;
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
// #include <atcoder/convolution>
// #include <atcoder/dsu>
// #include <atcoder/fenwicktree>
// #include <atcoder/lazysegtree>
// #include <atcoder/math>
// #include <atcoder/maxflow>
// #include <atcoder/mincostflow>
// #include <atcoder/modint>
// #include <atcoder/scc>
// #include <atcoder/segtree>
// #include <atcoder/string>
// #include <atcoder/twosat>
// #include <atcoder/all>
// using namespace atcoder;
// clang-format on
void answer() {
vector<int> a(4);
rep(i, 4) cin >> a[i];
sort(ALL(a));
cout << a[0] << '\n';
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int read() {
char c=getchar(); int x=0,f=1;
while (c<'0' || c>'9') {
if (c=='-') f=-1;
c=getchar();
}
while (c>='0' && c<='9') {
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
vector<pair<int,int> > odd[100005],even[100005];
vector<int> G[100005];
int a[100005],b[100005],siz[100005];
bool cmp(pair<int,int> x,pair<int,int> y) {
int dx=x.first-x.second;
int dy=y.first-y.second;
return dx>dy;
}
void dfs(int x) {
siz[x]=1;
for (int i=0; i<G[x].size(); i++) {
int v=G[x][i];
dfs(v);
if (siz[v]&1) odd[x].push_back(make_pair(a[v],b[v]));
else even[x].push_back(make_pair(a[v],b[v]));
siz[x]+=siz[v];
}
sort(odd[x].begin(),odd[x].end(),cmp);
sort(even[x].begin(),even[x].end(),cmp);
a[x]=0; b[x]=1;
int i;
for (i=0; i<even[x].size(); i++) {
if (even[x][i].first>even[x][i].second) {
a[x]+=even[x][i].first;
b[x]+=even[x][i].second;
}
else break;
}
for (int j=0; j<odd[x].size(); j++) {
if (j&1) {
b[x]+=odd[x][j].first;
a[x]+=odd[x][j].second;
}
else {
a[x]+=odd[x][j].first;
b[x]+=odd[x][j].second;
}
}
for (; i<even[x].size(); i++) {
if (odd[x].size()&1) {
b[x]+=even[x][i].first;
a[x]+=even[x][i].second;
}
else {
a[x]+=even[x][i].first;
b[x]+=even[x][i].second;
}
}
}
int main() {
int n=read();
for (int i=2; i<=n; i++) {
int p=read();
G[p].push_back(i);
}
dfs(1);
cout<<b[1]<<endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
struct Tree
{
int n;
int r;
int l;
std::vector<std::vector<int>> prit;
std::vector<std::vector<int>> t;
std::vector<int> par;
std::vector<int> dpt;
std::vector<int> tour;
std::vector<std::vector<int>> appear_on_tour;
std::vector<std::vector<int>> anc;
Tree(){}
Tree(int n, int r) : n(n), r(r){
prit.resize(n);
t.resize(n);
par.resize(n);
dpt.resize(n);
}
void add_edge(int u, int v){
prit[u].push_back(v);
prit[v].push_back(u);
}
void build(){
for(int i = 0; i < n; i++) dpt[i] = -1;
std::queue<int> que;
par[r] = -1;
dpt[r] = 0;
que.push(r);
while(que.size()){
int u = que.front();
que.pop();
for(int v : prit[u]){
if(dpt[v] == -1){
t[u].push_back(v);
par[v] = u;
dpt[v] = dpt[u] + 1;
que.push(v);
}
}
}
}
/* std::vector<int> toposort(){
std::vector<std::pair<int, int>> p(n);
for(int i = 0; i < n; i++) p[i] = std::pair<int, int>(dpt[i], i);
sort(p.begin(), p.end(), std::greater<std::pair<int, int>>());
std::vector<int> res(n);
for(int i = 0; i < n; i++) res[i] = p[i].second;
return res;
}*/
void dfs(int u, int &k){
appear_on_tour[u].push_back(k);
tour[k++] = u;
for(int v : t[u]){
dfs(v, k);
appear_on_tour[u].push_back(k);
tour[k++] = u;
}
}
void build_euler_tour(){
tour.resize(n * 2 - 1);
appear_on_tour.resize(n);
int k = 0;
dfs(0, k);
}
void build_lca(){
for(l = 1; l <= n; l++){
if((1 << (l - 1)) >= n) break;
}
anc.resize(l);
for(int j = 0; j < l; j++) anc[j].resize(n);
for(int i = 0; i < n; i++) anc[0][i] = par[i];
for(int j = 1; j < l; j++){
for(int i = 0; i < n; i++){
if(anc[j - 1][i] == -1) anc[j][i] = -1;
else anc[j][i] = anc[j - 1][anc[j - 1][i]];
}
}
}
int lca(int u, int v){
if(dpt[u] < dpt[v]) std::swap(u, v);
int dpt_diff = dpt[u] - dpt[v];
for(int j = l - 1; j >= 0; j--){
if((dpt_diff >> j) & 1) u = anc[j][u];
}
if(u == v) return u;
for(int j = l - 1; j >= 0; j--){
if(anc[j][u] != anc[j][v]){
u = anc[j][u];
v = anc[j][v];
}
}
return anc[0][u];
}
};
int size(int u, Tree &t, int *d){
if(d[u]) return d[u];
d[u]++;
for(int v : t.t[u]) d[u] += size(v, t, d);
return d[u];
}
int dfs(int u, Tree &t, int *d, int *dp){
if(dp[u]) return dp[u];
dp[u]--;
vector<int> p, q;
for(int v : t.t[u]){
if(d[v] % 2) p.push_back(dfs(v, t, d, dp));
else q.push_back(dfs(v, t, d, dp));
}
sort(p.begin(), p.end(), greater<int>());
sort(q.begin(), q.end(), greater<int>());
for(int i = 0; i < (int)p.size(); i++){
if(i % 2) dp[u] -= p[i];
else dp[u] += p[i];
}
for(int i = 0; i < (int)q.size(); i++){
if(q[i] > 0 || !((int)p.size() % 2)) dp[u] += q[i];
else dp[u] -= q[i];
}
return dp[u];
}
int main()
{
int n;
cin >> n;
Tree t(n, 0);
for(int i = 1; i < n; i++){
int p;
cin >> p;
t.add_edge(i, --p);
}
t.build();
int d[100005]{0}, dp[100005]{0};
size(0, t, d);
cout << (n - dfs(0, t, d, dp)) / 2 << endl;
}
|
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#define LL long long
using namespace std;
template <class I>
inline void read(I &z)
{
z=0;
char c=getchar();int base=1;
while (!isdigit(c) && c!='-') c=getchar();
if (c=='-') c=getchar(),base=-1;
while (isdigit(c)) z=z*10+c-'0',c=getchar();
z*=base;
}
struct node
{
int h,x;
};
node a[1010];
int n,h;
char s[1010][20];
bool comp(node x,node y)
{
return x.h>y.h;
}
int main(int argc, char const *argv[])
{
read(n);
for (int i=1;i<=n;++i)
{
scanf("%s",s[i]+1);
read(h);
a[i]=(node){h,i};
}
sort(a+1,a+n+1,comp);
printf("%s",s[a[2].x]+1);
return 0;
}
| #include<bits/stdc++.h>
#define int int64_t
#define pb push_back
#define endl '\n'
#define pll pair<int,int>
#define vll vector<int>
#define all(a) (a).begin(),(a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mi map<int,int>
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b)) / gcd((a),(b))
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
void solve(){
int n; cin>>n;
pair<int,string> arr[n];
rep(i,0,n){
string s; int p;
cin>>s>>p;
arr[i].first=p;
arr[i].second=s;
}
sort(arr,arr+n);
cout<<arr[n-2].second;
}
signed main(){
ios
int test=1;
//cin>>test;
while(test--){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int,int> pii;
#define x first
#define y second
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
set<string> yes,no;
while(n--)
{
string s;
cin>>s;
if(s.front()=='!')
{
s.erase(s.begin());
no.insert(s);
}
else
yes.insert(s);
if(yes.count(s)&&no.count(s))
cout<<s,exit(0);
}
cout<<"satisfiable";
}
|
#include<bits/stdc++.h>
using namespace std;
#define vec vector<int>
#define vecp vector<pair<int,int>>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fr first
#define sc second
#define fr1(i,a,b) for(int i=a;i<b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fr3(i,a,b) for(int i=a;i<=b;i++)
#define umap unordered_map<int,int>
#define omap map<int,int>
#define uset unordered_set<int>
#define oset set<int>
#define pr pair<int,int>
#define endl "\n"
#define mod 1000000007
#define mp make_pair
#define all(v) v.begin(),v.end()
void solve()
{
int n;
cin>>n;
vector<string> s(n);
fr1(i,0,n)
{
cin>>s[i];
}
unordered_set<string> s1;
fr1(i,0,n)
{
s1.insert(s[i]);
}
for(auto i=s1.begin();i!=s1.end();i++)
{
string S=*i;
if(s1.count('!'+S)==1)
{
cout<<S<<endl;
return;
}
}
cout<<"satisfiable"<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
//cin>>t;
fr3(i,1,t){
solve();
}
return 0;
}
|
#ifdef _DEBUG
#include "../../../library/src/debug_template.hpp"
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
#include <cassert>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <variant>
#include <array>
using namespace std;
using lint = long long;
constexpr int INF = 1010101010;
constexpr lint LINF = 1LL << 60;
struct init {
init() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}
} init_;
template<class T, class F>
T bisearch(T OK, T NG, F f) {
T ok = OK;
T ng = NG;
while (abs(ok - ng) > 1) {
auto mid = (ok + ng) / 2;
if (f(mid)) ok = mid;
else ng = mid;
}
return ok;
}
template<class T>
vector<T> make_vec(size_t s, T val) { return vector<T>(s, val); }
template<class... Size>
auto make_vec(size_t s, Size... tail) {
return vector<decltype(make_vec(tail...))>(s, make_vec(tail...));
}
int main() {
int N;
cin >> N;
vector<array<int, 5>> ability(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 5; j++) {
cin >> ability[i][j];
}
}
auto judge = [&](int now) -> bool {
auto dp = make_vec((1 << 5), 3, 0);
for (int i = 0; i < N; i++) {
int bit = 0;
for (int j = 0; j < 5; j++) {
if (now <= ability[i][j]) bit += (1 << j);
}
dp[bit][0] = 1;
for (int j = 0; j < (1 << 5); j++) {
for (int k = 0; k < 2; k++) {
dp[j | bit][k + 1] |= dp[j][k];
}
}
}
DMP(dp);
return dp[(1 << 5) - 1][2];
};
cout << bisearch(0, INF, judge);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
class Graph{
int V;
list<int> *adj;
int *exist;
public:
Graph(int N){
V=N;
adj=new list<int> [N];
exist= new int [N];
memset(exist,0,sizeof(exist));
}
void AddEdge(int x,int y){
adj[x].push_back(y);
adj[y].push_back(x);
exist[x]=1;
exist[y]=1;
}
void dfs(int src,int visited[]){
visited[src]=1;
for(auto ngb: adj[src]){
if(!visited[ngb]){
dfs(ngb,visited);
}
}
}
int Ans(){
int visited[V];
int comp=0;
memset(visited,0,sizeof(visited));
for(int i=0;i<V;i++){
if((!visited[i]) and exist[i]){
dfs(i,visited);
comp++;
}
}
return comp;
}
};
void solve(){
Graph G(200005);
int n;
cin>>n;
vector<int> v(n);
unordered_map<int,int> m;
int uniq=0;
for(auto &x:v){
cin>>x;
if(m.count(x)){
m[x]++;
}
else{
m[x]=1;
uniq++;
}
}
int i=0,j=n-1;
while(i<=j){
G.AddEdge(v[i],v[j]);
i++;
j--;
}
//cout<<"Here"<<endl;
int comp= G.Ans();
cout<<uniq-comp<<endl;
return;
}
int main(){
int t;
//cin>>t;
t=1;
for(int i=1;i<=t;i++){
solve();
}
return 0;
}
|
///****In the name of ALLAH, most Gracious, most Compassionate****//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int N=2e5+5;
pii x[N];
#define func(xi) (2*xi.first + xi.second)
inline bool cmp( pii x, pii y)
{
return func(x) < func(y);
}
int32_t main()
{
int n;
cin>>n;
while(n>=N) ;
for(int i=0; i<n; i++)
cin>>x[i].first>>x[i].second;
sort(x,x+n, cmp);
ll a = 0, b = 0;
for(int i=0; i<n; i++)
b+=x[i].first;
int tot =0;
for(int i=n-1; i>=0; i--)
{
a+=x[i].first;
a+=x[i].second;
b-=x[i].first;
tot++;
if(a>b)
{
cout<<tot<<"\n";
return 0;
}
}
cout<<n<<"\n";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define rreps(i, n, s) for (int i = s; i >= n; i--)
using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<pair<ll, ll>> d(n);
ll a, b;
ll all_a = 0;
rep(i, n) {
cin >> a >> b;
all_a += a;
d[i] = {a + b + a, a};
}
sort(d.begin(), d.end(), greater<pair<ll, ll>>());
ll all_b = 0;
ll res = 0;
rep(i, n) {
auto p = d[i];
all_a -= p.second;
all_b += p.first - p.second;
res++;
if (all_b > all_a) break;
}
cout << res << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
int main()
{
int x, y, z;
cin >> x >> y >> z;
int a = 0;
while (x*a < y*z) {
++a;
}
--a;
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll n, k;
string s;
char dp[200][200];
ll pow2[200];
char winner(char a, char b){
if(a == 'R') return (b == 'S' ? a : b);
else if(a == 'P') return (b == 'R' ? a : b);
else return (b == 'P' ? a : b);
}
char dfs(ll pos, ll len){
if(dp[pos][len]) return dp[pos][len];
if(len == 0) return s[pos];
return dp[pos][len] = winner(dfs(pos, len - 1), dfs((pos + pow2[len - 1]) % n, len - 1));
}
signed main(){
cin >> n >> k >> s;
pow2[0] = 1;
REP(i, n) pow2[i + 1] = (pow2[i] * 2) % n;
PRINT(dfs(0, k));
return 0;
} |
/// hhoangcpascal
#include <iostream>
#include <algorithm>
#define llong long long
using namespace std;
const llong mod = 1e9+7;
llong prefix[3006], dp[3006][3006], tmp[3006];
int n;
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; ++i) {
llong a; cin >> a;
prefix[i] = prefix[i-1] + a;
}
for(int i = 1; i <= n; ++i) dp[1][i] = 1;
for(int i = 2; i <= n; ++i) {
fill(tmp, tmp+i, 0LL);
tmp[prefix[i-1] % i] = dp[i-1][i-1];
for(int j = i; j <= n; ++j) {
(dp[i][j] += tmp[prefix[j] % i]) %= mod;
(tmp[prefix[j] % i] += dp[i-1][j]) %= mod;
}
}
llong ans = 0;
for(int i = 1; i <= n; ++i) (ans += dp[i][n]) %= mod;
cout << ans;
return 0;
}
| //AUTHOR: RAVAN_2070
//PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<pair<ll,ll>> vii;
typedef pair<ll,ll> pii;
typedef map<ll,ll> mii;
#define MOD7 1000000007
#define MOD9 1000000009
#define pi 3.1415926535
#define Test_cases ll TC;cin>>TC;while(TC--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed<<setprecision(x)
#define sz(x) (ll)(x.size())
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
const ll INF = (ll)2e18 + 77;
vector<int>d[10];
void precompute()
{
d[0].pb(0);
ll i;
foe(i,1,9)
{
unordered_set<ll>x;
ll now=i;
while(true)
{
if(x.count(now%10))break;
d[i].pb(now%10);
x.insert(now%10);
now*=i;
}
}
}
ll modularExponentiation(ll x,ll n,ll M)
{
ll result=1ll;
while(n>0)
{
if(n % 2 ==1)
result=(result * x)%M;
x=(x*x)%M;
n=n/2;
}
return (result-1+M)%M;
}
void solve()
{
ll A,B,C;cin>>A>>B>>C;
A=A%10;
ll p=modularExponentiation(B,C,sz(d[A]));
cout<<d[A][p]<<"\n";
}
int main()
{
fastio
precompute();
//Test_cases
solve();
return 0;
}
|
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
////#pragma GCC optimize("unroll-loops")
////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end()
#define pb push_back
using namespace std;
void dout() { cerr << endl; }
//typedef long long ll;
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
cerr << H << ' ';
dout(T...);
}
using ll = long long;
//#ifdef __int128
//using hll = __int128;
//#endif
using pii = pair<ll, ll>;
using ld = long double;
using pll = pair<long long, long long>;
template <typename T>
void do_uniq(vector<T> &vec){
sort(all(vec));
vec.resize(unique(all(vec)) - vec.begin());
}
#ifndef ONLINE_JUDGE
clock_t timestamp_start = clock();
void time_calc()
{
cerr << (ld)(clock() - timestamp_start) / CLOCKS_PER_SEC << "\n";
}
#endif
#ifdef _getchar_nolock
#else
#define _getchar_nolock getchar_unlocked
#endif
#define integer int
integer mod = 1e9 + 7;
integer ml(integer a, integer b) {
return (a * 1ll * b) % mod;
}
integer add(integer a, integer b) {
return (a + b) % mod;
}
integer sub(integer a, integer b) {
return add(a, mod - b);
}
integer sq(integer a) {
return ml(a, a);
}
integer b_p(integer b, integer p) {
if (p == 0) return 1;
if (p & 1) return ml(b, b_p(b, p - 1));
return sq(b_p(b, p >> 1));
}
#define solvsh
//#define multi
#ifdef solvsh
const int MAXN = 2e5 + 31;
void precalc() {
}
struct edge {
int from;
int to;
int ci;
int other(int i) {
return i == from ? to : from;
}
};
edge edgs[MAXN];
vector<int> g[MAXN];
set<int> forb[MAXN];
int assgn[MAXN];
bool usd[MAXN];
void dfs(int ver, int l =- 1) {
if (usd[ver]) return;;
usd[ver] = true;
if (l == -1) {
l = 1;
while (forb[ver].count(l)) ++l;
}
assgn[ver] = l;
for (auto e : g[ver]) {
forb[edgs[e].other(ver)].insert(l);
}
for (auto e : g[ver]) {
int to = edgs[e].other(ver);
if (assgn[ver] == edgs[e].ci) dfs(to, -1);
else dfs(to, edgs[e].ci);
}
}
void solve() {
int n, m;
cin >> n >> m;
int last = 0;
for (int i = 0; i < m; ++i) {
int f, t, c;
cin >> f >> t >> c;
--f;
--t;
edgs[last] = {f, t, c};
g[f].push_back(last);
g[t].push_back(last);
++last;
}
dfs(0);
for (int i = 0; i < n; ++i) {
if (!usd[i]) {
cout << "No\n";
return;
}
}
for (int i = 0; i < n; ++i) {
cout << assgn[i] << "\n";
}
}
#else
#endif
void multisolve() {
precalc();
int t;
cin >> t;
int i = 1;
while (t--) {
solve();
i++;
}
}
#ifndef ONLINE_JUDGE
void gen() {
int n = 2000;
cout << n << "\n";
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cout << (i != j ? 1 : 0) << " ";
}
cout << "\n";
}
}
#endif
#define int int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef multi
// gen();
multisolve();
#else
solve();
// gen();
#endif
// time_calc();
}
| #include<bits/stdc++.h>
using namespace std;
#define N 100005
struct ji{
int nex,to,len;
}edge[N<<2];
int E,n,m,x,y,z,head[N],vis[N],pd[N],ans[N];
void add(int x,int y,int z){
edge[E].nex=head[x];
edge[E].to=y;
edge[E].len=z;
head[x]=E++;
}
void dfs(int k){
vis[k]=1;
for(int i=head[k];i!=-1;i=edge[i].nex)
if (!vis[edge[i].to]){
if (edge[i].len==ans[k])ans[edge[i].to]=n+1;
else ans[edge[i].to]=edge[i].len;
dfs(edge[i].to);
}
}
int main(){
scanf("%d%d",&n,&m);
memset(head,-1,sizeof(head));
for(int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
add(x,y,z);
add(y,x,z);
}
dfs(1);
for(int i=1;i<=n;i++)
if (!vis[i]){
printf("No");
return 0;
}
ans[1]=n+1;
for(int i=1;i<=n;i++)
if (ans[i]>n){
for(int j=head[i];j!=-1;j=edge[j].nex)pd[ans[edge[j].to]]=1;
ans[i]=1;
while (pd[ans[i]])ans[i]++;
for(int j=head[i];j!=-1;j=edge[j].nex)pd[ans[edge[j].to]]=0;
}
for(int i=1;i<=n;i++)printf("%d\n",ans[i]);
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pr pair < int , int >
const int N = 2e5+10,NN = 1005, length = 25 , mod = 1e9+7, inf = 1e9;
vector < int > g[N];
int color[N] , ans, n;
multiset< pair < int , int > > *mst[N];
void dfs ( int node , int par )
{
int mx = -1 ;
for ( auto i : g[node])
{
if ( i == par)
continue;
dfs(i,node);
if ( mx == -1)
mx = i ;
else if ( mst[i]->size() > mst[mx]->size())
mx = i;
}
if ( mx == -1)
{
mst[node] = new multiset< pair < int , int > > ;
mst[node]->insert({color[node],node});
return ;
}
for ( auto i : g[node])
{
if ( i == par || i == mx)
continue;
for ( auto j : *mst[i])
mst[mx]->insert(j);
}
auto it = mst[mx]->lower_bound({color[node],-1});
while (it != mst[mx]->end() && it->first == color[node])
{
mst[mx]->erase(it);
it = mst[mx]->lower_bound({color[node],-1});
}
mst[node] = mst[mx];
mst[node]->insert({color[node],node});
}
int main() {
Tsetso
cin >> n ;
ans = n;
for ( int i = 1 ; i <= n; i++)
cin >> color[i];
for ( int i = 1 ; i < n ; i++)
{
int u , v ;
cin >> u >> v ;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1,0);
set < int > s ;
for ( auto j : *mst[1])
s.insert(j.second);
for ( auto j : s)
cout << j << '\n';
} |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t) cout<<t
#define LL long long
#define ld long double
#define fa(i,a,b) for(LL i=(a);i<(LL)(b);++i)
#define fd(i,a,b) for(LL i=(a);i>(LL)(b);--i)
#define setp pair<pair<int,int>,int>
#define setl pair<LL,LL>
#define micro 0.000001
using namespace std;
LL gcd(LL a, LL b) { return a % b ? gcd(b, a % b) : b; }
LL lcm(LL a, LL b) { return (a * b) / gcd(a, b); }
#ifdef OHSOLUTION
#define ce(t) cerr<<t
#define AT cerr << "\n=================ANS=================\n"
#define AE cerr << "\n=====================================\n"
#else
#define AT
#define AE
#define ce(t)
#define __popcnt __builtin_popcountll
#endif
pair <int, int> vu[9] = { {0,1},{1,0},{0,-1} ,{-1,0},{0,0},{1,0}, {-1,1} , {1,-1},{-1,-1} }; //RDLU EWSN
template<typename T, typename U> void ckmax(T& a, U b) { a = a < b ? b : a; }
template<typename T, typename U> void ckmin(T& a, U b) { a = a > b ? b : a; }
struct gcmp { bool operator()(LL a, LL b) { return a < b; } bool operator()(setl a, setl b) { return a.second < b.second; } };
struct lcmp { bool operator()(LL a, LL b) { return a > b; } bool operator()(setl a, setl b) { return a.second > b.second; } };
const int max_v = 2e5 + 7;
const int INF = 1e9 + 7;
const LL LNF = (LL)5e18 + 7ll;
const LL mod = 1e9+7;
setl arr[max_v];
map<int, vector<int>> xh;
vector <int> vi[max_v];
map<setl, LL> dp;
LL dnq(int pos, int id)
{
if (id == 0) return abs(pos);
LL& ret = dp[{pos,id}];
if (ret) return ret;
if (vi[id - 1].size() == 1) return ret = dnq(vi[id - 1][0], id - 1)+ abs(pos-vi[id-1][0]);
ret = LNF;
LL dif = abs(vi[id - 1][0] - vi[id - 1][1]);
ckmin(ret, dnq(vi[id - 1][1], id - 1) + dif + abs(pos - vi[id - 1][0]));
ckmin(ret, dnq(vi[id - 1][0], id - 1) + dif + abs(pos - vi[id - 1][1]));
return ret;
}
int main()
{
#ifdef OHSOLUTION
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; ci(n);
fa(i, 0, n) ci(arr[i].first >> arr[i].second);
vector <int> cod(n);
fa(i, 0, n) cod[i] = arr[i].second;
sort(cod.begin(), cod.end());
cod.erase(unique(cod.begin(), cod.end()), cod.end());
fa(i, 0, n) arr[i].second = lower_bound(cod.begin(), cod.end(), arr[i].second) - cod.begin();
fa(i, 0, n) xh[arr[i].second].push_back(arr[i].first);
for (auto& x : xh)
{
sort(x.second.begin(), x.second.end());
vi[x.first].push_back(x.second[0]);
if (x.second.size() > 1) vi[x.first].push_back(x.second.back());
}
co(dnq(0, cod.size()));
return 0;
}
|
#include<iostream>
#include<algorithm>
#include <cmath>
#include <string>
using namespace std;
int main()
{
int n, x;
string s;
cin >> n >> x;
cin >> s;
for (int i = 0; i < n; i++)
{
if (s[i] == 'o')
{
x++;
}
if (s[i] == 'x')
{
if (x == 0)
{
continue;
}
else
{
x--;
}
}
}
cout << x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define setbits(x) __builtin_popcountll(x)
#define md (ll)1e9 + 7
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define f(i, j, n) for (ll i = j; i < n; i++)
#define r(i, j, n) for (ll i = n - 1; i >= j; i--)
void solve()
{
ll n,x;
cin>>n>>x;
string s;
cin>>s;
for(auto i : s){
i=='o'?x++:x--,x=max(0ll,x);
}
cout<<x;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inpput.txt", "r", stdin); //freopen("op.txt", "w", stdout);
#endif
ll test_cases = 1;
//cin >> test_cases;
for (ll t = 1; t <= test_cases; t++)
solve(),cout<<"\n";
//cerr<<"Time : "<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vi = vector<int>;
const ll MOD = 1e9 + 7;
const int INF = 1001001001;
const double PI = 3.14159265358979323846;
int V;
int G[20][20];
int dp[200000][20];
struct pos {
int x, y, z;
pos(int x, int y, int z) : x{x}, y{y}, z{z} {}
};
int rec(int state, int v) {
if (state == 0) {
if (v == 0) {
return 0;
} else {
return INF;
}
}
if ((state & (1 << v)) == 0) {
return INF;
}
int &ret = dp[state][v];
if (ret != 0) return ret;
ret = INF;
rep(u, V) {
ret = min(ret, rec(state ^ (1 << v), u) + G[u][v]);
}
return ret;
}
void solve() {
cin >> V;
rep(i, 20) rep(j, 20) G[i][j] = INF;
vector<pos> vec;
int x, y, z;
vector<int> zs;
rep(i, V) {
cin >> x >> y >> z;
x--; y--; z--;
vec.push_back(pos(x, y, z));
zs.push_back(z);
}
rep(i, V) {
auto a = vec[i];
rep(j, V) {
auto b = vec[j];
int dist = abs(a.x - b.x) + abs(a.y - b.y);
G[i][j] = dist + max(0, b.z - a.z);
G[j][i] = dist + max(0, a.z - b.z);
}
}
int state = (1 << V) - 1;
int ans = rec(state, 0);
if (ans == INF) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
}
int main() {
solve();
return 0;
} | //#define LOCAL
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 500;
const int inf = 1 << 29;
const int N = 17;
int n;
int dp[N][1<<N];
int dis[N][N];
int pos[N][3];
int dfs(int city, int state) {
if(state == (1 << n) - 1) {
return dis[city][0];
}
if(dp[city][state] != -1) return dp[city][state];
dp[city][state] = inf;
for(int i = 0; i < n; i++) {
if(state & (1 << i)) continue;
dp[city][state] = min(dp[city][state], dis[city][i] + dfs(i, state | (1 << i)));
}
return dp[city][state];
}
int main() {
#ifdef LOCAL
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d%d%d", &pos[i][0], &pos[i][1], &pos[i][2]);
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
dis[i][j] = abs(pos[i][0] - pos[j][0]) + abs(pos[i][1] - pos[j][1]) + max(0, pos[j][2] - pos[i][2]);
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
for(int k = 0; k < n; k++) {
dis[j][k] = min(dis[j][k], dis[j][i] + dis[i][k]);
}
}
}
memset(dp, 255, sizeof(dp));
dfs(0, 1<<0);
printf("%d", dp[0][1<<0]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> &a, vector<int> &b, vector<int> &c) {
sort(a.begin(), a.end());
int64_t ans = 0;
for (auto &&i : c) {
int value = b[i - 1];
ans += upper_bound(a.begin(), a.end(), value) - lower_bound(a.begin(), a.end(), value);
}
cout << ans << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (auto &&i : a) cin >> i;
for (auto &&i : b) cin >> i;
for (auto &&i : c) cin >> i;
solve(a, b, c);
}
| #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define int long long
#define uint unsigned int
#define reg register
#define db double
#define il inline
#define gc getchar
#define pc putchar
#define len 200000
il int umax(int a,int b){return a>b?a:b;}
il int umin(int a,int b){return a<b?a:b;}
il int rd()
{
reg int res=0;
reg char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
while(ch>='0'&&ch<='9')
res=(res<<3)+(res<<1)+(ch&15),ch=getchar();
return res;
}
il void prt(int x,char t)
{
if(x<0)putchar('-'),x=-x;
if(x>9)prt(x/10,0),x%=10;
putchar(x|48);
if(t)putchar(t);
}
int n,a[len+5],b[len+5],mxa[len+5],mxb[len+5],ans;
signed main()
{
n=rd();
for(int i=1;i<=n;++i)
a[i]=rd(),mxa[i]=umax(mxa[i-1],a[i]);
for(int i=1;i<=n;++i)
b[i]=rd(),mxb[i]=umax(mxb[i-1],b[i]);
for(int i=1;i<=n;++i)
prt((ans=umax(ans,mxa[i]*b[i])),'\n');
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll dp[3005][3050],cnt;
ll dfs(int n,int k){
// cout<<n<<" "<<k<<endl;
if(n<k) return 0;
if(dp[n][k]>0) return dp[n][k];
if(n==0) return dp[n][k]=1;
if(k==0) return dp[n][k]=0;
ll ret=(dfs(n-1,k-1)+dfs(n,k<<1))%mod;
return dp[n][k]=ret;
}
int main(){
int n,k;cin>>n>>k;
cout<<dfs(n,k)<<endl;
return 0;
} | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss second
#define lli long long int
#define pb push_back
#define pf push_front
#define mkp make_pair
#define pii pair<lli,lli>
#define vi vector<int>
#define mii map<lli,lli>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 998244353
#define INF 1e9
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define endl "\n"
const double PI = acos(-1);
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
lli maxm(lli a, lli b)
{
return (a >= b ? a : b);
}
lli minm(lli a, lli b)
{
return (a <= b ? a : b);
}
lli power(lli x, lli y, lli p)
{
lli res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
lli nCrmodp(lli n, lli r, lli p)
{
if (r == 0)
return 1;
if (r == 1)
return n;
lli pro = 1, k = n;
while (k > r)
{
pro *= k;
pro %= p;
--k;
}
k = 2;
while (k <= (n - r))
{
pro *= power(k, (p - 2), p);
pro %= p;
++k;
}
return pro;
}
lli first_big(lli n, lli k, vector<lli> arr)
{
lli l, r, ans = n;
l = 0;
r = n - 1;
while (l <= r) {
lli m = l + (r - l) / 2;
if (arr[m] > k) {
ans = m;
r = m - 1;
}
else
l = m + 1;
}
return ans;
}
lli last_small(lli n, lli k, vector<lli> arr)
{
lli l, r, ans = -1;
l = 0;
r = n - 1;
while (l <= r)
{
lli mid = (l + r) / 2;
if (arr[mid] <= k)
{
ans = mid;
l = mid + 1;
}
else
r = mid - 1;
}
return ans;
}
void c_p_c()
{
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
}
lli dp[3001][6001];
lli n, k;
lli dfs(lli i, lli j)
{
if (dp[i][j] == -1)
{
if (i < j)
dp[i][j] = 0;
else
{
if (j == 0 || i == 0)
{
if (i == 0 && j == 0)
dp[i][j] = 1;
else
dp[i][j] = 0;
}
else
dp[i][j] = (dfs(i - 1, j - 1) + dfs(i, 2 * j)) % mod;
}
}
return dp[i][j];
}
int main()
{
c_p_c();
cin >> n >> k;
memset(dp, -1, sizeof(dp));
cout << dfs(n, k) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int a[11], k, cnt;
int main() {
int aa = 0;
char c;
while((c = getchar()) != ' ') a[++cnt] = c - 48;
for(int i = 1; i <= cnt; i ++) aa = aa * 10 + a[i];
cin >> k;
int ne = aa;
for(int i = 1; i <= k; i ++) {
sort(a + 1, a + cnt + 1);
int b = 0, e = 0;
for(int i = 1; i <= cnt; i ++) b = b * 10 + a[i];
reverse(a + 1, a + cnt + 1);
for(int i = 1; i <= cnt; i ++) e = e * 10 + a[i];
ne = abs(b - e);
cnt = 0;
if(i < k) while(ne > 0) a[++cnt] = ne % 10, ne /= 10;
}
cout << ne << endl;
return 0;
} | #include<bits/stdc++.h>
#define fp(x,a,b) for(ll x=a; x<b; x++)
#define fn(x,a,b) for(int x=a; x>b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int ,int>>
#define vll vector<pair<ll ,ll>>
#define all(v) v.begin(),v.end()
#define sor(a) sort( a.begin(), a.end() )
#define ros(a) sort( a.rbegin(), a.rend())
#define prec(n) fixed<<setprecision(n)
#define ff first
#define ss second
// #define tt third
#define print(x) for(auto it:x) cout<<it<<" ";
#define debug(x) cerr << #x << " is " << x << endl;
#define w(x) while(x--)
#define r(x) scanf("%d", &x)
#define rl(x) scanf("%ld", &x)
#define rll(x) scanf("%lld", &x)
typedef long long ll;
using namespace std;
template <typename TYPE> void readint(TYPE &x){
x=0; int f=1; char c;
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit(c);c=getchar())x=x*10+c-'0';
x*=f;
}
#define dbg(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 << endl;
err(++it, args...);
}
template<typename... T>
void rd(T& ... args){
((cin >> args), ...);
}
template<typename... T>
void ps(T ... args){
((cout << args << ' '), ...);
cout<<'\n';
}
const ll MOD = 1e9 + 7, MOD1 = 998244353LL, MAX = 2e5 + 5;
const char nl = '\n';
const int INF = 2e9;
int n, q;
char x[MAX];
//queue front back push pop
//stack top push pop
// __builtin_popcount() : Cuenta todos los bits 1 de un número
// __builtin_parity() : Revisa la paridad de un número
// __builtin_clz() : Cuenta todos los bits 0 a la izquierda del primer bit 1 de un número.
// __builtin_ctz() : Cuenta todos los bits 0 a la derecha del último bit 1 de un número.
void solve(){
// be careful with typos and overflows, but also with the sizes of the arrays :::
int a[3] = {1, 1, 0};
rd(n);
ll ans = 10000000000LL, ga = -1, gb = -1;
fp(i, 0, n) rd(x[i]);
if(n == 1){
ps(ans * (x[0] - '/'));
return;
}
bool gd = false;
fp(i, 0, 3){
bool f = true;
fp(j, 0, n){
if(x[j] - '0' != a[(j + i) % 3]){
f = false;
break;
}
}
if(f) gd = f, ga = i, gb = (i + n - 1) % 3;
}
// dbg(n, ga, gb);
if(gd) ps(ans - (n + (2 - gb) + ga) / 3 + 1);
else ps(0);
}
int main(){
cpu();
// int __;
// cin>>__;
// while(__--){
// solve();
// // cout << nl;
// }
solve();
// cout<<nl;
return 0;
} |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
int N;
int A[MAX_N], B[MAX_N], P[MAX_N];
int idx[MAX_N];
void solve() {
cin >> N;
rep(i, 0, N) cin >> A[i];
rep(i, 0, N) cin >> B[i];
rep(i, 0, N) {
cin >> P[i]; P[i]--;
idx[P[i]] = i;
}
rep(i, 0, N) {
if(A[i] <= B[P[i]] && i != P[i]) {
cout << -1 << "\n"; return;
}
}
vi ord(N);
vector<pi> ans;
rep(i, 0, N) ord[i] = i;
sort(all(ord), [&](int a, int b) { return A[a] < A[b]; });
rep(q, 0, N) {
int i = ord[q];
if(i == P[i]) continue;
int j = idx[i];
idx[P[i]] = j;
idx[P[j]] = i;
swap(P[i], P[j]);
ans.pb(pi(i + 1, j + 1));
}
cout << sz(ans) << "\n";
rep(i, 0, sz(ans)) {
cout << ans[i].fst << " " << ans[i].sec << "\n";
}
}
uint32_t rd() {
uint32_t res;
#ifdef __MINGW32__
asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
res = std::random_device()();
#endif
return res;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
cerr << fixed;
cerr.precision(6);
rng.seed(rd());
#ifdef LOCAL
//freopen("in.txt", "wt", stdout); //for tester
if(!freopen("in.txt", "rt", stdin)) return 1;
#endif
solve();
cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| #include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
#define debug(x) std::cerr << #x << '=' << x << '\n'
#define rep(a, b, c) for (int a = b; a <= c; a++)
typedef long long LL;
typedef unsigned long long ULL;
const int N = 212345;
int n, m;
void work_before(void) {
for (int i = 1; i <= m + 1; i++) {
printf("%d %d\n", i << 1, (i << 1) + 1);
}
}
void work_after(void) {
for (int i = 1; i <= n - m - 2; i++) {
printf("%d %d\n", 1000000 + i * 2, 1000001 + i * 2);
}
}
int main() {
cin >> n >> m;
if (n == 1 || n == 2) {
if (!m) {
puts("1 2");
} else {
puts("-1");
}
return 0;
}
if (m < 0 || n - m - 1 < 1) {
puts("-1");
return 0;
}
puts("1 1000001");
work_before();
work_after();
return 0;
} |
#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);
template<class T> bool chmin(T &a, const T b){
if(a > b) {a = b; return true;}
else return false;
}
template<class T> bool chmax(T &a, const T b){
if(a < b) {a = b; return true;}
else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
if(!v.empty()){
for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
std::cout<<v.back();
}
if(endline) std::cout<<std::endl;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin>>S;
N = S.size();
rep(i, N){
if(S[i] == '.') break;
cout<<S[i];
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()
int main() {
ll n;
cin >> n;
map<ll, int> fib;
ll val = 1, pre = 0;
int cnt = 0;
while (val <= n) {
fib[val] = cnt;
ll tmp = val + pre;
pre = val;
val = tmp;
++cnt;
}
int mc = fib.rbegin()->second;
n -= fib.rbegin()->first;
vector<int> add;
for (auto itr=fib.rbegin(); itr!=fib.rend(); ++itr) {
if (itr->second == mc) continue;
if (n == 0) break;
if (n >= itr->first) {
n -= itr->first;
add.push_back(itr->second);
}
}
vector<int> res;
int bi = mc % 2, ai = 0, adlen = add.size();
rep(i, mc+1) {
if (i%2 == 0) {
if (i == 0) res.push_back(bi+1);
else res.push_back(bi+3);
}
else res.push_back(4-bi);
if (ai<adlen && add[ai]==mc-i) {
res.push_back(((i%2)+bi)%2+1);
++ai;
}
}
int k = res.size();
cout << k << endl;
rep(i, k) cout << res[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,f[1500009],pas;
multiset <int> s,h;
multiset <int>::iterator it,tt;
void ins(int q){
it=h.lower_bound(q);
if(it!=h.end()&&(*it)==q){
h.erase(it);
}
s.insert(q);
}
void er(int q){
it=s.lower_bound(q);
s.erase(it);
it=s.lower_bound(q);
if(it!=s.end()&&(*it)==q){
}else{
h.insert(q);
}
}
void chk(){
tt=h.begin();
if(pas>(*tt)) pas=(*tt);
}
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>a>>b;
pas=a+2;
for(i=1; i<=a; i++){
cin>>f[i];
}
for(i=0; i<=a+2; i++){
h.insert(i);
}
for(i=1; i<=b; i++){
//s.insert(f[i]);
ins(f[i]);
}
chk();
for(i=b+1; i<=a; i++){
c=f[i-b];
/*it=s.lower_bound(c);
s.erase(it);*/
er(c);
//s.insert(f[i]);
ins(f[i]);
chk();
}
cout<<pas;
return 0;
} | #include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
b%=m;
ll ans = 1;
for (; e; b = b * b % m, e /= 2)
if (e & 1) ans = ans * b % m;
return ans;
}
const int N = 1511111 + 100;
int tree[N*4];
int qtd[N*4];
void upd(int no,int i,int j,int p,int v){
if(i==j){
qtd[no]+=v;
tree[no] = (qtd[no] ? 1 : 0);
return;
}
int mid = (i+j)>>1;
int l=no<<1,r=no<<1|1;
if(p<=mid)upd(l,i,mid,p,v);
else upd(r,mid+1,j,p,v);
tree[no] = tree[l] + tree[r];
}
int query(int no,int i,int j){
if(i==j)return i;
int mid = (i+j)>>1;
int l=no<<1,r=no<<1|1;
if(tree[l]!=(mid - i + 1)){
return query(l,i,mid);
}
return query(r,mid+1,j);
}
int a[N];
int32_t main(){
fastio;
int n,m;
cin >> n >> m;
for(int i=1;i<=n;i++){
cin >> a[i];
}
for(int i=1;i<=m;i++){
upd(1,0,n,a[i],1);
}
int res = 1e9;
for(int i=m;i<=n;i++){
if(i!=m){
upd(1,0,n,a[i-m],-1);
upd(1,0,n,a[i],1);
}
res = min(res,query(1,0,n));
}
cout << res << endl;
// math -> gcd it all
// Did u check N=1? Did you switch N,M?
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=509, INF=1e9+10;
int N,C[Nmax][Nmax],B[Nmax],A[Nmax],chk,Bm=INF,Am=INF,Delta;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>N;
REP(i,1,N) {
REP(j,1,N) {
cin>>C[i][j];
}
}
REP(j,1,N) {
B[j]=C[1][j]; Bm=min(Bm,B[j]);
}
REP(j,1,N) B[j]-=Bm;
REP(i,1,N) {
A[i]=C[i][1]; Am=min(Am,A[i]);
}
REP(i,1,N) A[i]-=Am;
Delta=C[1][1]-A[1]-B[1];
REP(i,1,N) A[i]+=Delta;
REP(i,1,N) {
REP(j,1,N) {
if (C[i][j]==A[i]+B[j]) continue;
chk=-1; break;
}
}
if (chk) cout<<"No";
else {
cout<<"Yes\n";
REP(i,1,N) cout<<A[i]<<" ";
cout<<"\n";
REP(i,1,N) cout<<B[i]<<" ";
}
return 0;
}
| /*
Krishnakant Tiwari
Problem Link:
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
typedef long long ll;
#define _cin ios_base::sync_with_stdio(0); cin.tie(0);
#define endl "\n"
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define repd(i,a,b) for(ll i=a;i>=b;--i)
#define mp make_pair
#define hell 1000000007
#define vvll vector<vector<ll> >
#define vll vector<ll>
#define mll map<ll,ll>
#define sz(x) (ll)x.size()
#define sll set<ll>
#define pll pair<ll,ll>
#define F first
#define S second
#define eb emplace_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define precise(x) cout<<fixed<<setprecision(x)
const ll MAX = 1000004;
const ll INF = 1e18L + 5;
template <class T, class U>
void chmin(T &t, const U &u)
{
if (t > u) t = u;
}
template <class T, class U>
void chmax(T &t, const U &u)
{
if (t < u) t = u;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
cerr << " " << H;
debug_out(T...);
}
template <typename Arg1>
void pn(Arg1 &&arg1)
{
cout << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void pn(Arg1 &&arg1, Args &&... args)
{
cout << arg1 << "\n";
pn(args...);
}
template <typename Arg1>
void ps(Arg1 &&arg1)
{
cout << arg1 << " ";
}
template <typename Arg1, typename... Args>
void ps(Arg1 &&arg1, Args &&... args)
{
cout << arg1 << " ";
ps(args...);
}
template <typename Arg1>
void read(Arg1 &&arg1)
{
cin >> arg1;
}
template <typename Arg1, typename... Args>
void read(Arg1 &&arg1, Args &&... args)
{
cin >> arg1;
read(args...);
}
ll g[MAX];
ll a[MAX];
void solve()
{
ll n, a, b;
read(n, a, b);
pn(n - min(a, n) + b);
}
int main()
{
_cin
ll tc = 1;
// cin>>tc;
while(tc--)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define LL long long
//#define MOD 1000000007
#define MOD 998244353
#define INF 1000000000000000000
#define VE vector
#define VL vector<LL>
#define VVL VE<VL>
#define VVVL VE<VVL>
#define LD long double
#define PB push_back
#define POB pop_back
#define FOR(i,a,k) for(LL i=a;i<k;i++)
#define rep(i,k) FOR(i,0,k)
#define ALL(a) a.begin(),a.end()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define coutl cout<<fixed<<setprecision(15)//
#define MI modint<MOD>
template<int mod>struct modint{
int x;
modint():x(0){}
modint(LL n):x(n>=0?n%mod:(mod-(-n)%mod)%mod){}
modint &operator+=(const modint &n){if((x+=n.x)>=mod)x-=mod;return *this;}
modint &operator-=(const modint &n){if((x+=mod-n.x)>=mod)x-=mod;return *this;}
modint &operator++(){*this+=1;return *this;}
modint &operator--(){*this-=1;return *this;}
modint &operator*=(const modint &n){x=(int)((LL)x*n.x%mod);return *this;}
modint &operator/=(const modint &n){*this*=n.inv();return *this;}
modint operator-()const{return modint(-x);}
modint operator+(const modint &n)const{return modint(*this)+=n;}
modint operator-(const modint &n)const{return modint(*this)-=n;}
modint operator++(int){modint ret(*this);*this+=1;return ret;}
modint operator--(int){modint ret(*this);*this-=1;return ret;}
modint operator*(const modint &n)const{return modint(*this)*=n;}
modint operator/(const modint &n)const{return modint(*this)/=n;}
bool operator<(const modint &n)const{return x<n.x;}
bool operator>(const modint &n)const{return x>n.x;}
bool operator<=(const modint &n)const{return x<=n.x;}
bool operator>=(const modint &n)const{return x>=n.x;}
bool operator!=(const modint &n)const{return x!=n.x;}
bool operator==(const modint &n)const{return x==n.x;}
friend istream &operator>>(istream &is,modint &n){LL l;is>>l;n=modint<mod>(l);return is;}
friend ostream &operator<<(ostream &os,const modint &n){return os<<n.x;}
int getmod(){return mod;}
modint inv()const{int a=x,b=mod,c=1,d=0,n;while(b){n=a/b;swap(a-=n*b,b);swap(c-=n*d,d);}return modint(c);}
modint pow(LL n)const{modint ret(1),m(x);while(n){if(n&1)ret*=m;m*=m;n>>=1;}return ret;}
};
VL yakusuu(LL N){
LL M=0;
VL ret;
for(LL i=0; i<N; i++){
M++;
if(M>N/M){
for(LL i=0; i<N; i++){
M--;
if(M==0){
return ret;
}
if(M*M==N){
continue;
}
if(N%M==0){
ret.PB(N/M);
}
}
}
if(N%M==0){
ret.PB(M);
}
}
return ret;
}
LL nanjo(LL a,LL n){//aのn乗 N=nanjo(a,n)A
LL ret=1;
for(LL i=0;i<n;i++){
ret*=a;
}
return ret;
}
void YesNo(bool f){
if(f)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
LL kakuketa(LL n){//各桁の和を求める
LL a=0;
while(n>0){
a=a+n%10;
n=n/10;
}
return a;
}
int main(){
LL N,ans=1000000001;
cin>>N;
VL A(N),P(N),X(N);
rep(i,N){
cin>>A[i]>>P[i]>>X[i];
}
rep(i,N){
if(X[i]-A[i]>0){
if(ans>=P[i]){
ans=P[i];
}
}
}
if(ans==1000000001){
cout<<-1<<endl;
}
else{
cout<<ans<<endl;
}
/*LL K,ans=0;
cin>>K;
ans=K-2;//全部同じ数だった場合
if(K>=4){
ans+=(1+(K-2)/2)*K/2*3;//２つ同じ数があった場合
}
if(K>=6){
ans+=(1+(K/2+1)*K/6)**6;
}
cout<<ans<<endl;
LL N,M,T,ans=0;
cin>>N>>M>>T;
ans=N;
VL A(M),B(M);
rep(i,M){
cin>>A[i]>>B[i];
}
rep(i,M){
ans=ans-A[i]+A[i-1];
if(ans<=0){
cout<<"No"<<endl;
break;
}
ans=ans+(B[i]-A[i]);
if(ans>=M){
ans=N;
}
}
cout<<"Yes"<<endl;*/
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, P, X, x = 1000000000;
cin >> N;
for(int i = 0; i < N; i++){
cin >> A >> P >> X;
if(X - A > 0){
x = min(P, x);
}
}
if(x == 1000000000) cout << -1 <<endl;
else cout << x << endl;
return 0;
} |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll tmp = 2 * N + 2;
ll are = sqrt(tmp);
ll kotae = 0;
if (are * (are + 1) <= tmp) chmax(kotae, are);
if (are * (are - 1) <= tmp) chmax(kotae, are - 1);
if ((are + 2) * (are + 1) <= tmp) chmax(kotae, are + 1);
co(N - kotae + 1);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
ll n;
cin >> n;
ll l, r;
l = 0, r = 2e9;
while (r - l > 1) {
ll m = (l + r) / 2;
if (m * m + m > 2 * n + 2) r = m;
else l = m;
}
cout << n - (l - 1) << endl;
// long double s = sqrtl(8.0 * n + 9.0);
// cout << setprecision(15) << (- 1.0 + s ) / 2.0 << endl;
// ll m = (- 1.0 + s ) / 2.0;
// cout << m << endl;
// cout << n - (m - 1) << endl;
} |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define ci(x) cin >> x
#define ci2(x, y) cin >> x >> y
#define ci3(x, y, z) cin >> x >> y >> z
#define co(x) cout << x << endl
#define co2(x, y) cout << x << y << endl
#define co3(x, y, z) cout << x << y << z << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> PQ;
typedef priority_queue<int, vector<int>, greater<int>> PQG;
typedef priority_queue<P> PQP;
typedef priority_queue<P, vector<P>, greater<P>> PQPG;
const int MAX_N = 2e5, MOD = 1e9 + 7, INF = 1e9;
int n, x[100], y[100];
int par[MAX_N + 2], r[MAX_N + 2];
void init(int x) {
for (int i = 0; i < x; i++) par[i] = i;
}
int find(int x) {
if (par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (r[x] < r[y]) par[x] = y;
else {
if (r[x] == r[y]) r[x]++;
par[y] = x;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
int main() {
ci(n);
rep(i, n) ci2(x[i], y[i]);
double l = 0.0, r = 100.0;
rep(cnt, 200) {
double mid = (l + r) / 2;
init(n + 2);
rep(i, n) {
if (2 * mid >= 100 - y[i]) unite(i, n);
if (2 * mid >= y[i] + 100) unite(i, n + 1);
rep(j, i) {
if (4 * mid * mid >= (x[i] - x[j]) * (x[i] - x[j])
+ (y[i] - y[j]) * (y[i] - y[j])) {
unite(i, j);
}
}
}
if (same(n, n + 1)) r = mid;
else l = mid;
}
printf("%5.15lf\n", l);
return 0;
}
| /**
* Written by : Ujjawal Pabreja [cuber_coder]
* Email : [email protected]
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define endl "\n"
const int mod = 1e9 + 7;
const int MAX = 2e5 + 1;
int n;
vector <pair <ld, ld>> a;
vector <int> Parent, Rank;
void init() {
Parent.resize(n + 2);
Rank.resize(n + 2);
iota(Parent.begin(), Parent.end(), 0);
}
int Find(int v) {
while (v != Parent[v]) {
v = Parent[v];
}
return v;
}
void Union(int u, int v) {
u = Find(u);
v = Find(v);
if (Rank[u] < Rank[v]) {
Parent[u] = v;
} else {
Parent[v] = u;
if (Rank[u] == Rank[v]) {
Rank[u]++;
}
}
}
ld distance(pair <ld, ld> a, pair <ld, ld> b) {
return (a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second);
}
bool possible(ld r) {
init();
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (distance(a[i], a[j]) <= 4.0 * r * r) {
Union(i, j);
}
}
}
for (int i = 1; i <= n; i++) {
if (abs(a[i].second - 100) <= 2.0 * r) {
Union(n + 1, i);
}
if (abs(a[i].second + 100) <= 2.0 * r) {
Union(0, i);
}
}
return Find(0) != Find(n + 1);
}
void Solve() {
cin >> n;
a.resize(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin() + 1, a.end());
ld hi = 100, lo = 0, ans;
ll itr = 100;
while (itr--) {
ld mid = lo + (hi - lo) / 2;
if (possible(mid)) {
lo = mid + 1;
ans = mid;
} else {
hi = mid - 1;
}
}
cout << fixed << setprecision(20) << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcases = 1;
// cin >> testcases;
while (testcases--) {
Solve();
}
} |
#include<bits/stdc++.h>
using namespace std;
int a[3050][6], n;
bool check(int x){
int vis[35] = {0};
for(int i = 1; i <= n; i ++){
int tmp = 0;
for(int j = 0; j < 5; j ++){
if(a[i][j] >= x) tmp |= (1 << j);
}
vis[tmp] = 1;
}
int t = 1 << 5;
for(int i = 0; i < t; i ++)
for(int j = i; j < t; j ++)
for(int k = j; k < t; k ++)
if(vis[i] && vis[j] && vis[k] && (i|j|k) == t - 1) return true;
return false;
}
int main(){
cin >> n;
for(int i = 1; i <= n; i ++) for(int j = 0; j < 5; j ++) cin >> a[i][j];
int l = 1, r = 1e9, ans = 1;
while(l <= r){
int mid = l + r >> 1;
if(check(mid)) l = mid + 1, ans = mid;
else r = mid - 1;
}
cout << ans << endl;
return 0;
} | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int tt; cin>>tt; while(tt--)
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
int arr[n][5];
for(int i=0; i<n; i++)
{
for(int j=0; j<5; j++)
cin>>arr[i][j];
}
int ans=0;
for(int k=0; k<5; k++)
{
vector<pair<int, int>> v;
for(int i=0;i<n;i++)
v.pb({arr[i][k], i});
sort(v.begin(), v.end());
int sel=v[n-1].ss;
int done[5];
for(int j=0; j<5; j++)
done[j]=arr[sel][j];
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int aa=max({done[0], arr[i][0], arr[j][0]});
int bb=max({done[1], arr[i][1], arr[j][1]});
int cc=max({done[2], arr[i][2], arr[j][2]});
int dd=max({done[3], arr[i][3], arr[j][3]});
int ee=max({done[4], arr[i][4], arr[j][4]});
ans=max(ans, min({aa, bb, cc, dd, ee}));
}
}
}
cout<<ans<<endl;
}
|
Subsets and Splits