code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}
const int MOD = 1e9 + 7;
const int INF = 2e18;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
signed main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N + 1), GR(N + 1);
Edges<int> edges;
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
G[A].push_back(B);
GR[B].push_back(A);
edges.emplace_back(A, B, -1);
}
if (M == 0) {
cout << -1 << endl;
return 0;
}
vector<int> dist1(N + 1, INF);
dist1[edges.begin()->src] = 0;
dist1[edges.rbegin()->src] = 0;
for(int i = 1; i <= N * 2; i++) {
for(auto &e : edges) {
if(dist1[e.src] == INF) continue;
dist1[e.to] = min(dist1[e.to], dist1[e.src] + e.cost);
}
}
vector<int> dist2(N + 1); copy(dist1.begin(), dist1.end(), dist2.begin());
for(int i = 1; i <= N * 2; i++) {
for(auto &e : edges) {
if(dist2[e.src] == INF) continue;
dist2[e.to] = min(dist2[e.to], dist2[e.src] + e.cost);
}
}
if (dist1 == dist2) {
cout << -1 << endl;
return 0;
}
int s = 0, count = INF;
vector<map<int, int>> res(N + 1);
for (int i = 1; i <= N; i++) {
vector<bool> check(N + 1, false);
queue<int> explore;
vector<int> dist(N + 1, INF);
explore.push(i);
dist[i] = 0;
check[i] = true;
while (!explore.empty()) {
int now = explore.front();
explore.pop();
for (auto next : G[now]) {
if (dist[next] > dist[now] + 1) {
dist[next] = dist[now] + 1;
res[i][next] = now;
}
if (check[next]) continue;
check[next] = true;
explore.push(next);
}
if (now == i) dist[i] = INF;
}
if (dist[i] < count) {
s = i;
count = dist[i];
}
}
vector<int> ans = {s};
int next = res[s][s];
while (next != s) {
ans.push_back(next);
next = res[s][next];
}
cout << ans.size() << endl;
for (auto temp : ans) cout << temp << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
vector<int> G[200005];
int aoki_d[200005], takahashi_d[200005];
bool is_end[200005];
void dfs(int u, bool is_aoki, int p=-1) {
for (int v : G[u]) {
if (v == p) continue;
if (is_aoki) aoki_d[v] = aoki_d[u] + 1;
else takahashi_d[v] = takahashi_d[u] + 1;
dfs(v, is_aoki, u);
}
is_end[u] = G[u].size() == 1;
}
int main() {
int n, u, v;
cin >> n >> u >> v;
--u; --v;
rep(i, n-1) {
int a, b;
cin >> a >> b;
--a; --b;
G[a].push_back(b);
G[b].push_back(a);
}
dfs(u, false);
dfs(v, true);
int ans = 0;
rep(i, n) {
if (takahashi_d[i] <= aoki_d[i] && !is_end[i]) {
ans = max(ans, aoki_d[i]);
}
}
cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 998244353
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 1ll<<59
vector<ll> bi(5010101);
ll modinv(ll a) {
ll m=Mod;
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll comb(ll s,ll t){
ll q=bi[s]*modinv(bi[t]);
q%=Mod;
q*=modinv(bi[s-t]);
q%=Mod;
return q;
}
int main(){
ll i,j;
ll n,m;
cin>>n>>m;
bi[0]=1;
for(i=1;i<5010101;i++){
bi[i]=bi[i-1]*i;
bi[i]%=Mod;
}
ll ans1=comb(3*m+n-1,n-1);
ll ans2=n*comb(m+n-2,n-1);
ans2%=Mod;
ll hoge=(ans1-ans2+Mod)%Mod;
if(n<=m) cout<<hoge<<endl;
else{
ll l;
ll ans3=0;
for(l=m+1;l<=min(3*m,n);l++){
if((3*m-l)%2==0) {
ans3+=comb(n,l)*comb((3*m-l)/2+n-1,n-1);
ans3%=Mod;
}
}
cout<<(hoge+Mod-ans3)%Mod<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pi;
#define fi first
#define se second
int read() {
int res = 0, w = 1; char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-') c = getchar(), w = -1;
while (isdigit(c)) res = (res << 1) + (res << 3) + c - '0', c = getchar();
return res * w;
}
const int Mod = 998244353;
int add(int a, int b) { return (a += b) >= Mod ? a - Mod : a; }
int sub(int a, int b) { return (a -= b) < 0 ? a + Mod : a; }
int mul(int a, int b) { return 1ll * a * b % Mod; }
int fast_pow(int a, int b) {
int res = 1;
for (; b; b >>= 1, a = mul(a, a))
if (b & 1) res = mul(res, a);
return res;
}
const int N = 3e6 + 10;
int fac[N], inv[N];
void init(int n = N - 1) {
fac[0] = inv[0] = 1;
for (int i = 1; i <= n; i++) fac[i] = mul(fac[i - 1], i);
inv[n] = fast_pow(fac[n], Mod - 2);
for (int i = n - 1; i >= 1; i--) inv[i] = mul(inv[i + 1], i + 1);
}
int C(int a, int b) { return a >= b ? mul(fac[a], mul(inv[b], inv[a - b])) : 0;}
int main() {
#ifdef dream_maker
// freopen("tst.in", "r", stdin);
#else
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
#endif
init();
int n = read(), m = read(), ans = 0;
for (int i = 0; i <= m; i++) if ((3 * m - i) & 1 ^ 1) {
ans = add(ans, mul(C(n, i), C(((3 * m - i) >> 1) + n - 1, n - 1)));
}
ans = sub(ans, mul(n, C(m - 1 + n - 1, n - 1)));
cout << ans << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
int a, b; cin >> a >> b;
vector<string> s(100, string(100, '#'));
rep(i, 50) rep(j, 100) s[i][j] = '.';
int cnt = 0;
for (int i = 0; i < 50; i += 2) {
if (cnt == b - 1) break;
for (int j = 0; j < 100; j += 2) {
if (cnt == b - 1) break;
s[i][j] = '#';
cnt++;
}
}
cnt = 0;
for (int i = 51; i < 100; i += 2) {
if (cnt == a - 1) break;
for (int j = 0; j < 100; j += 2) {
if (cnt == a - 1) break;
s[i][j] = '.';
cnt++;
}
}
printf("100 100\n");
for (auto &line: s) cout << line << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main()
{
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); //for debug
cin.rdbuf(in.rdbuf()); //for debug
#endif
const int w = 52;
const int h = 100;
char field[h][w];
int a, b;
cin >> a >> b;
a--, b--;
rep(i, h / 2)
{
rep(j, w)
field[i][j] = '.';
}
rep(i, h / 2)
{
rep(j, w)
field[i + h / 2][j] = '#';
}
rep(i, 20)
{
if (b == 0)
break;
else
{
rep(j, 25)
{
if (b == 0)
break;
else
{
field[2 * i + 1][2 * j + 1] = '#';
b--;
}
}
}
}
rep(i, 20)
{
if (a == 0)
break;
else
{
rep(j, 25)
{
if (a == 0)
break;
else
{
field[2 * i + h / 2 + 1][2 * j + 1] = '.';
a--;
}
}
}
}
cout << h << " " << w << endl;
rep(i, h)
{
rep(j, w)
cout
<< field[i][j];
cout << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF=INT_MAX;
struct lst
{
private:
int n;
vector<int> node;
vector<int> lazy;
vector<bool> lflg;
public:
lst(int sz)
{
n=1; while(n<sz) n*=2;
node.resize(2*n-1, INF);
lazy.resize(2*n-1, 0);
lflg.resize(2*n-1, false);
}
void lazy2node(int k, int l, int r)
{
if(lflg[k])
{
node[k]=lazy[k];
lflg[k]=false;
prop(k, l, r);
}
}
void prop(int k, int l, int r)
{
if (r-l>0)
{
lazy[2*k+1]=lazy[2*k+2]=node[k];
lflg[2*k+1]=lflg[2*k+2]=true;
}
}
void update(int qa, int qb, int v, int k=0, int l=0, int r=-1)
{
if(r<0) r=n-1;
lazy2node(k, l, r);
if(qb<l || r<qa) return;
if(qa<=l && r<=qb)
{
node[k] = v;
prop(k, l, r);
}
else
{
int m=(l+r)/2;
update(qa, qb, v, 2*k+1, l, m);
update(qa, qb, v, 2*k+2, m+1, r);
}
}
int get(int qa, int qb, int k=0, int l=0, int r=-1)
{
if(r<0) r=n-1;
lazy2node(k, l, r);
if(qb<l || r<qa) return INF;
if(qa<=l && r<=qb) return node[k];
else
{
int m=(l+r)/2;
int lv = get(qa, qb, 2*k+1, l, m);
int lr = get(qa, qb, 2*k+2, m+1, r);
return min(lv, lr);
}
}
};
int main()
{
int n, q;
scanf("%d %d", &n, &q);
lst tree = lst(n);
for(int i=0; i<q; i++)
{
int t;
scanf("%d", &t);
if(t)
{
int s;
scanf("%d", &s);
printf("%d\n", tree.get(s,s));
}
else
{
int s, t, v;
scanf("%d %d %d", &s, &t, &v);
tree.update(s, t, v);
}
}
return 0;
}
| #include<iostream>
#include<algorithm>
#include<map>
using namespace std;
#define SEG_NUM (1<<20)
pair<long, long> seg[SEG_NUM*2];
long find(int i){
i += SEG_NUM;
long ans = 2147483647;
int time = 0;
while(i > 0){
if(time < seg[i].first) {
ans = seg[i].second;
time = seg[i].first;
}
i /= 2;
}
return ans;
}
void update(int s, int t, long x, long time){
s += SEG_NUM;
t += SEG_NUM;
while(s < t){
if(s % 2 == 1){
seg[s].first = time;
seg[s].second = x;
s++;
}
s /= 2;
if(t % 2 == 1){
seg[t-1].first = time;
seg[t-1].second = x;
t--;
}
t /= 2;
}
}
int main() {
for(long i=0;i<2*SEG_NUM;++i){
seg[i] = make_pair(0, 2147483647);
}
int n, q;
cin>>n>>q;
long query, s, t, x, i;
for(int time=0;time<q;++time){
cin>>query;
if(query){
cin>>i;
cout<<find(i)<<endl;
}
else {
cin>>s>>t>>x;
update(s, t+1, x, time+1);
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,counter,subcounter;
string strn,strm;
cin >> n;
subcounter = 0;
vector<string> vecn(0);
vector<string> vecm(0);
for (int i = 0; i < n; i++) {
cin >> strn;
vecn.push_back(strn);
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> strm;
vecm.push_back(strm);
}
for (int i = 0; i < n; i++) {
counter = 0;
for (int j = 0; j < n; j++) {
if (vecn.at(i) == vecn.at(j)) {
counter++;
}
}
for (int j = 0; j < m; j++) {
if (vecn.at(i) == vecm.at(j)) {
counter = counter -1;
}
}
if (counter > subcounter) {
subcounter = counter;
}
}
if (subcounter <= 0 ) {
subcounter = 0;
}
cout << subcounter;
}
| #include<iostream>
#include<cstring>
using namespace std;
int main(){
int dice[6],i,dif[6],len;
string str;
/********サイコロの目の入力*********/
for(i = 0 ; i < 6 ; i++)
{
cin >> dice[i];
}
cin >> str;
len = str.size();
for ( int j = 0 ; j < len ; j++){
if(str[j] == 'S')
{
dif[0] = dice[4];
dif[1] = dice[0];
dif[2] = dice[2];
dif[3] = dice[3];
dif[4] = dice[5];
dif[5] = dice[1];
}
else if (str[j] == 'W')
{
dif[0] = dice[2];
dif[1] = dice[1];
dif[2] = dice[5];
dif[3] = dice[0];
dif[4] = dice[4];
dif[5] = dice[3];
}
else if(str[j] == 'E')
{
dif[0] = dice[3];
dif[1] = dice[1];
dif[2] = dice[0];
dif[3] = dice[5];
dif[4] = dice[4];
dif[5] = dice[2];
}
else if (str[j] == 'N')
{
dif[0] = dice[1];
dif[1] = dice[5];
dif[2] = dice[2];
dif[3] = dice[3];
dif[4] = dice[0];
dif[5] = dice[4];
}
for( i = 0 ; i < 6 ; i++)
{
dice[i] = dif[i];
}
}
cout << dice[0] << endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(void){
// Your code here!]
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = a + b;
int ans1 = c + d;
if(ans > ans1){
cout << "Left" << endl;
}
else if(ans == ans1){
cout << "Balanced" << endl;
}
else {
cout << "Right" << endl;
}
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int a[5];
for(int i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
if(a[0] == a[2]) return cout << "No", 0;
for(int i = 1; i < 3; i++) if(a[i] == a[i - 1]) return cout << "Yes", 0;
cout << "No";
return 0;
}
| 0 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
//cout << std::fixed << std::setprecision(15) << y << endl;
int main(){
ll N, L;
cin >> N >> L;
if(L <= 0 && L + N - 1 > 0){
cout << N * (L + L + N - 1) / 2 << endl;
}else if(L + N - 1 <= 0){
cout << (N - 1) * (L + L + N - 2) / 2 << endl;
}else{
cout << (N - 1) * (L + 1 + L + N - 1) / 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int n, k; cin >> n >> k;
vector<int> v(n);
int og = 0;
for(int i = 0; i < n; ++i){
v[i] = k + i;
og += v[i];
}
int index = 0;
int maxi = INT_MAX;
for(int i = 0; i < n; ++i){
int dif = og - v[i];
int dist = abs(og - dif);
if(maxi > dist){
maxi = dist;
index = i;
}
}
cout << og - v[index] << '\n';
return 0;
} | 1 |
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin()
#define ubidx(x, y) upper_bound(x.begin(), x.end(), y) - x.begin()
#define llbidx(x, y, z) lower_bound(x.begin(), x.end(), z) - lower_bound(x.begin(), x.end(), y) // dist between two elements
// #define M_PI 3.14159265358979323846 // CF
#define deg2rad(deg) ((((double)deg)/((double)360)*2*M_PI))
#define rad2deg(rad) ((((double)rad)/(double)2/M_PI)*(double)360)
#define Find(set, element) set.find(element) != set.end()
#define Decimal(x) cout << fixed << setprecision(10) << x << endl; // 小数点を10桁まで表示
#define endl "\n"
#define Case(x) printf("Case #%d: ", x); // gcj
typedef pair<int, int> PI;
typedef pair<ll, ll> PLL;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
typedef vector<PI> vpi;
typedef vector<vector<PI>> vvpi;
typedef vector<PLL> vpl;
typedef vector<vector<PLL>> vvpl;
typedef vector<char> vch;
typedef vector<vector<char>> vvch;
constexpr ll LINF = 1001002003004005006ll;
constexpr int INF = 1001001001;
constexpr int n_max = 2e5+10;
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; };
template<class T, class U>
T POW(T x, U n) {T ret=1; while (n>0) {if (n&1) {ret*=x;} x*=x; n>>=1;} return ret;};
// debug
template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';};
string to_string(const char c) {return to_string((string) &c);};
string to_string(bool b) {return (b ? "true" : "false");};
template <size_t N>
string to_string(bitset<N> v){
string res = "";
for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
return res;
};
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for(const auto &x : v) {
if(!first) res += ", ";
first = false; res += to_string(x);
}
res += "}";
return res;
};
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
void debug_out() {cerr << endl;};
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); };
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 71
#endif
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
};
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
};
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
};
PI solve(string &s) {
int n = s.size();
vvi table(26);
rep(i, 0, 26) {
char ch = 'a'+i;
rep(j, 0, n) {
if (s[j] == ch) table[i].pb(j);
}
}
rep(i, 0, 26) {
rep(j, 0, table[i].size()-1) {
if (table[i][j+1]-table[i][j] < 3) {
return make_pair(table[i][j]+1,table[i][j+1]+1);
}
}
}
return make_pair(-1, -1);
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
PI ans = solve(s);
cout << ans.first << " " << ans.second << endl;
return 0;
};
| #include <cstdint>
#include <algorithm>
#include <vector>
#include <string>
int main() {
char buf[131072];
scanf("%s", buf);
std::string s = buf;
for (size_t i = 1; i < s.length(); ++i)
if (s[i-1] == s[i])
return !printf("%zu %zu\n", i, i+1);
for (size_t i = 1; i+1 < s.length(); ++i)
if (s[i-1] == s[i+1])
return !printf("%zu %zu\n", i, i+2);
puts("-1 -1");
} | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
int sum=0;
for(int i=v.size()-1;i>=n-k;i--)
{
sum+=v[i];
}
cout<<sum;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin>>N>>S;
vector<int> a(N),b(N);
int j=0;
for(int i=0;i<N;i++){
int k=0;
if(S.at(i)=='E')
k=1;
j+=k;
a.at(i)=j;
b.at(i)=i+1-j;
}
j=a.at(N-1)-a.at(0);
for(int i=1;i<N;i++){
int k=b.at(i-1)+a.at(N-1)-a.at(i);
j=min(j,k);
}
cout<<j<<endl;
} | 0 |
#include<iostream>
#include<vector>
using namespace std;
typedef unsigned long long int ull;
vector<ull> allPrimes;
void sieve(int n)
{
vector<bool> prime(n+1, true);
for (int p=2; p*p<=n; p++) {
if (prime[p] == true) {
for (int i=p*2; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
allPrimes.push_back(p);
}
ull factorialDivisors(ull n)
{
sieve(n);
ull result = 1;
for (int i=0; i < allPrimes.size(); i++)
{
ull p = allPrimes[i];
ull exp = 0;
while (p <= n)
{
exp = exp + (n/p);
p = p*allPrimes[i];
}
result = (result*(exp+1))%1000000007;
}
return result;
}
int main()
{
int n; cin>>n;
cout << factorialDivisors(n);
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i <= N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
map<ll, ll> M;
void prime_factor(ll N){
bool C = 1;
while(C){
C = 0;
rep(i, 2, sqrt(N)){
if(N%i == 0){M[i]++;N /= i;C = 1;break;}
}
}
M[N]++;
}
int main() {
ll N, Ans = 1;cin >> N;
rep(i, 2, N){
prime_factor(i);
}
for(auto x : M ){
Ans *= x.second + 1;Ans %= PP;
}
cout << Ans;
} | 1 |
#include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int main() {
in(int, n);
if (n == 1) {
out("Hello World");
return 0;
}
in(int, a, b);
out(a + b);
}
| #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main(){
int n, a, b;
cin >> n;
if(n == 1)
cout << "Hello World";
if(n == 2){
cin >> a >> b;
cout << a + b;
}
}
| 1 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout<<(x?"Yes":"No")<<endl;
#define out(s) cout<<s<<endl;
#define pb(s) push_back(s);
#define sp " ";
#define INF 10000000000
#define all(s) s.begin(),s.end()
void vout(vi v){
for(int i=0;i<v.size();i++)
cout<<v.at(i)<<endl;
}
int main(){
lli a, b, c;
cin >> a >> b >> c;
swap(a, b);
swap(a, c);
out(a << " " << b << " " << c);
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
int len;
len=s.size();
if(len<=k){
cout << s << endl;
return 0;
}else{
for(int i=0;i<k;i++){
cout << s.at(i);
}
}
cout << "..." << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin()) // 先頭文字削除
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define ANS cout << ans << endl
#define RETURN(x) \
cout << x << endl; \
return 0
clock_t CLOCK;
#define START_TIMER CLOCK = clock()
#define SHOW_TIMER cerr << "time: " << (ld)(clock() - CLOCK) / 1000000 << endl
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
signed main() {
init();
ll N, u, v;
cin >> N >> u >> v;
u--;
v--;
vvll to(N);
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
to[a].pb(b);
to[b].pb(a);
}
queue<P> q1;
q1.push({u, 1});
vll d1(N);
while (!q1.empty()) {
ll index = q1.front().first;
ll distance = q1.front().second;
q1.pop();
if (d1[index] != 0) continue;
d1[index] = distance;
rep(i, to[index].size()) {
q1.push({to[index][i], distance + 1});
}
}
debugV(d1);
queue<P> q2;
q2.push({v, 1});
vll d2(N);
while (!q2.empty()) {
ll index = q2.front().first;
ll distance = q2.front().second;
q2.pop();
if (d2[index] != 0) continue;
d2[index] = distance;
rep(i, to[index].size()) {
q2.push({to[index][i], distance + 1});
}
}
debugV(d2);
ll ans = 0;
rep(i, N) {
if (d1[i] < d2[i]) ans = max(ans, d2[i]);
}
ans--;
ans--;
COUT(ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N,u,v;
cin >> N >> u >> v;
vector<vector<int>> A(N);
for(int i=0;i<N-1;i++){
int a,b;cin>>a>>b;
A[a-1].push_back(b-1);
A[b-1].push_back(a-1);
}
queue<int> q1;
q1.push(u-1);
vector<int> D1(N,-1);
D1[u-1]=0;
while(q1.size()){
int f=q1.front();
q1.pop();
for(int a:A[f]){
if(D1[a]==-1){
D1[a]=D1[f]+1;
q1.push(a);
}
}
}
queue<int>q2;
q2.push(v-1);
vector<int>D2(N,-1);
D2[v-1]=0;
while(q2.size()){
int f=q2.front();
q2.pop();
for(int a:A[f]){
if(D2[a]==-1){
D2[a]=D2[f]+1;
q2.push(a);
}
}
}
vector<int> NG(N,0);
int M=0,Mi=-1;
for(int i=0;i<N;i++){
NG[i]=(D2[i]-D1[i]<0);
if((!NG[i]) && M<D2[i]){
M=D2[i];
Mi=i;
}
}
if(NG[u-1]){
cout << 0;
return 0;
}
cout << D1[Mi]+(D2[Mi]-D1[Mi])-1 << "\n";
} | 1 |
#include<stdio.h>
using namespace std;
const int sss=1<<21;
int n;
int a[1000][1000];
int d[1000],p[10000],color[1000];
int prim(){
int u,minv;
for(int i=0;i<n;i++){
d[i]=sss;
p[i]=-1;
}
d[0]=0;
while(1){
minv=sss;
u=-1;
for(int i=0;i<n;i++){
if(minv>d[i]&&color[i]!=1){
u=i;
minv=d[i];
}
}
if(u==-1) break;
color[u]=1;
for(int v=0;v<n;v++){
if(color[v]!=1&&a[u][v]!=sss){
if(d[v]>a[u][v]){
d[v]=a[u][v];
p[v]=u;
}
}
}
}
int sum=0;
for(int i=0;i<n;i++){
if(p[i]!=-1) {
sum+=a[p[i]][i];
}
}
return sum;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
int e;scanf("%d",&e);
a[i][j]=e==-1?sss:e;
}
}
printf("%d\n",prim());
return 0;
}
| #include<iostream>
#include<iomanip>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cassert>
#include<ctime>
#include<algorithm>
#include<utility>
#include<map>
#include<set>
#include<vector>
#include<functional>
using namespace std;
#ifdef DEBUG
#define dprintf printf
#define dout(x) cout<<#x" = "<<(x)<<endl
#define darray(x,n) {int i;rep(i,n)cout<<#x"["<<i<<"] = "<<*((x)+i)<<endl;}
#define dloop(i,s,g) for((i)=(s);(i)<(g);(i)++)
#define drep(i,n) for((i)=0;(i)<(n);(i)++)
#define dstop() scanf("%*c")
#else
#define dprintf (1)?0:printf
#define dout(x)
#define darray(x,n)
#define dloop(i,s,g) if(1){}else
#define drep(i,n) if(1){}else
#define dstop() if(1){}else
#endif
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define loop(i,s,g) for((i)=(s);(i)<(g);(i)++)
#define rep(i,n) for((i)=0;(i)<(n);(i)++)
#define all(x) (x.begin(),x.end())
#define in(T,...) T __VA_ARGS__; impl(__VA_ARGS__);
#define array(T,id,n) T id[n]; rep(i,n)cin>>id[i];
//#define int long long;
#ifndef int
#define INF (0x7fffffff)
#else
#define LINF (0x7fffffffffffffff)
#endif
typedef long long ll;
typedef unsigned ui;
typedef unsigned long long ull;
typedef pair<int,int> i_i;
typedef pair<ll,int> ll_i;
typedef pair<ll,ll> ll_ll;
typedef pair<double,int> d_i;
typedef pair<double,double> d_d;
void impl(){};
template <typename T,typename... TS >
void impl(T &head,TS &... tail)
{
cin>>head;
impl(tail ...);
}
#define UNION_FIND_MAX_N (112345)
int union_find_par[UNION_FIND_MAX_N];
int union_find_rank[UNION_FIND_MAX_N];
void init(int n)
{
int i;
for(i=0;i<n;i++)
{
union_find_par[i]=i;
union_find_rank[i]=0;
}
}
int find(int x)
{
if(union_find_par[x]==x)
return x;
else
return union_find_par[x]=find(union_find_par[x]);
}
void unite(int x,int y)
{
x=find(x);
y=find(y);
if(x==y)
return;
if(union_find_rank[x]<union_find_rank[y])
union_find_par[x]=y;
else
union_find_par[y]=x;
if(union_find_rank[x]==union_find_rank[y])
union_find_rank[x]++;
}
int nsame(int x,int y)
{
return find(x)!=find(y);
}
typedef struct edge
{
int u;
int v;
int cost;
bool operator>(const edge&right)const
{
return cost>right.cost;
}
bool operator<(const edge&right)const
{
return cost<right.cost;
}
}Edge;
signed main(void)
{
int n;
Edge edge[112345]={};
int i,j,k=0;
int sum=0;
cin>>n;
init(n);
rep(i,n)rep(j,n)
{
cin>>edge[k].cost;
edge[k].u=i;
edge[k].v=j;
k++;
}
sort(edge,edge+k);
rep(i,k)
if(edge[i].cost!=-1)
if(nsame(edge[i].u,edge[i].v))
unite(edge[i].u,edge[i].v),sum+=edge[i].cost;
cout<<sum<<endl;
return 0;
} | 1 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define si short int
using namespace std;
const int N=101;
si n,m,x,y,ans,dp[N][N][N][N],sum[N][N];
char g[N][N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
template<typename I>inline I mx(const I&a,const I&b){return a>b ? a : b;}
template<typename I>inline I mi(const I&a,const I&b){return a<b ? a : b;}
template<typename I>inline void swp(I&a,I&b){I t=a; a=b; b=t;}
inline void cmx(si &a,si b){if(b>a) a=b;}
inline si s(int a,int b,int c,int d){
if(a>c) swp(a,c); if(b>d) swp(b,d);
return sum[c][d]-sum[c][b-1]-sum[a-1][d]+sum[a-1][b-1];
}
int main()
{
// freopen("Salvage Robots.in","r",stdin);
read(n,m);
for(RG int i=1;i<=n;i++)
{
scanf("%s",g[i]+1);
for(RG int j=1;j<=m;j++)
{
if(g[i][j]=='o') sum[i][j]=1;
else if(g[i][j]=='E') x=i, y=j;
sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
}
}
for(int i=x;i;i--)
for(int j=y;j;j--)
for(int k=x;k<=n;k++)
for(int l=y;l<=m;l++)
{
ans=mx(ans,dp[i][j][k][l]);
int li=l-y+1, ri=m-y+j, us=k-x+1, ds=n-x+i;
if(i-1>=us) cmx(dp[i-1][j][k][l],dp[i][j][k][l]+s(i-1,mx(li,j),i-1,mi(ri,l)));
if(j-1>=li) cmx(dp[i][j-1][k][l],dp[i][j][k][l]+s(mx(i,us),j-1,mi(k,ds),j-1));
if(k+1<=ds) cmx(dp[i][j][k+1][l],dp[i][j][k][l]+s(k+1,mx(li,j),k+1,mi(ri,l)));
if(l+1<=ri) cmx(dp[i][j][k][l+1],dp[i][j][k][l]+s(mx(i,us),l+1,mi(k,ds),l+1));
}
cout<<ans<<endl;
return 0;
} | #include <algorithm>
#include <cstdio>
char str[105];
int row_pre[105][105], col_pre[105][105], dp[105][105][105][105];
int main()
{
// freopen("AGC004-E.in", "r", stdin);
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = 0; j < m; j++)
{
row_pre[i][j] = (j ? row_pre[i][j - 1] : 0) + (str[j] == 'o');
col_pre[i][j] = (i ? col_pre[i - 1][j] : 0) + (str[j] == 'o');
if (str[j] == 'E')
{
x = i;
y = j;
}
}
}
auto calc_row = [&] (int idx, int l, int r)
{
int ll = std::max(l, r - y), rr = std::min(r, m - 1 - y + l);
if (ll > rr)
return 0;
return row_pre[idx][rr] - (ll ? row_pre[idx][ll - 1] : 0);
};
auto calc_col = [&] (int idx, int l, int r)
{
int ll = std::max(l, r - x), rr = std::min(r, n - 1 - x + l);
if (ll > rr)
return 0;
return col_pre[rr][idx] - (ll ? col_pre[ll - 1][idx] : 0);
};
auto upd = [&] (int &a, const int &b)
{
if (a < b)
a = b;
};
for (int i = 0; i <= x; i++)
{
for (int j = n - 1; j >= x; j--)
{
for (int k = 0; k <= y; k++)
{
for (int t = m - 1; t >= y; t--)
{
if (i > j - x)
upd(dp[i][j][k][t], dp[i - 1][j][k][t] + calc_row(i - 1, k, t));
if (j < n - 1 - x + i)
upd(dp[i][j][k][t], dp[i][j + 1][k][t] + calc_row(j + 1, k, t));
if (k > t - y)
upd(dp[i][j][k][t], dp[i][j][k - 1][t] + calc_col(k - 1, i, j));
if (t < m - 1 - y + k)
upd(dp[i][j][k][t], dp[i][j][k][t + 1] + calc_col(t + 1, i, j));
}
}
}
}
printf("%d\n", dp[x][x][y][y]);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main()
{
int m[50],d[50];
int x = 0;
string Day[7] = {"Thursday", "Friday","Saturday","Sunday","Monday", "Tuesday", "Wednesday"};
int BanyakHari[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
string ThatDayIs[50];
do
{
int DayinBetween = 0;
cin >> m[x] >> d[x];
if((m[x] == 0) && (d[x] == 0))
{
break;
}
//Check banyak hari antara 1 Januari - Input
for(int y = 0; y < m[x]-1; y++)
{
DayinBetween = DayinBetween + BanyakHari[y];
}
DayinBetween = (DayinBetween + d[x] - 1)%7;
ThatDayIs[x] = Day[DayinBetween];
x++;
}
while(x < 50);
for(int z = 0; z < x; z++)
{
cout << ThatDayIs[z] << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string y[7]={"Wednesday","Thursday","Friday","Saturday","Sunday","Monday","Tuesday"};
int num[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
while(1){
int m,d;
cin >> m >> d;
if( m == 0 && d == 0 ) break;
while( m != 0 ){
d += num[m-1];
m--;
}
cout << y[d%7] << endl;
}
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
int main() {
int n;
std::cin >> n;
while (n != 0) {
std::vector<int> vec(n+1, 0);
int x;
for (int i = 1; i <= n; ++i) {
std::cin >> x;
vec[i] = x;
}
std::vector<int> sum;
sum.assign(n+1, 0);
sum[1] = vec[1];
for (int i = 1; i < n; i++) {
sum[i+1] = sum[i] + vec[i+1];
}
int ans = -1000000000;
for (int l = 1; l <= n; ++l) {
for (int r = l; r <= n; ++r) {
ans = std::max(ans, sum[r] - sum[l-1]);
}
}
std::cout << ans << std::endl;
std::cin >> n;
}
}
| #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair < db, db > pdd;
typedef pair < db, ld > pdl;
typedef pair < ld, db > pld;
typedef pair < ld, ld > ldp;
typedef pair < ll, ll > pll;
typedef pair < int, ll > pil;
typedef pair < ll, int > pli;
typedef pair < int, int > pii;
#define F first
#define S second
#define en end()
#define bg begin()
#define rev reverse
#define mp make_pair
#define pb push_back
#define y1 y1234567890
#define um unordered_map
#define all(x) x.bg, x.en
#define sz(x) (int)x.size()
#define len(x) (int)strlen(x)
#define sqr(x) ((x + 0ll) * (x))
#define sqrd(x) ((x + 0.0) * (x))
#define forn(i, n) for (int i = 1; i <= n; i++)
const ll inf = (ll)1e18;
const ll mod = (ll)1e9 + 7;
const db eps = (db)1e-9;
const db pi = acos(-1.0);
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
const int N = 200500;
int n;
ll p[N];
int main() {
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
//freopen(".err", "w", stderr);
//srand(time(NULL));
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
//cout << setprecision(10) << fixed;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
p[i] = p[i - 1] + x;
}
ll ans = inf;
for (int i = 2, pl = 1, pr = 2; i < n; i++) {
while (pl + 1 < i && abs(p[pl + 1] - (p[i] - p[pl + 1])) <= abs(p[pl] - (p[i] - p[pl])))
pl++;
while (pr + 1 < n && abs(p[pr + 1] - p[i] - (p[n] - p[pr + 1])) <= abs(p[pr] - p[i] - (p[n] - p[pr])))
pr++;
ans = min(ans, max({p[pl], p[i] - p[pl], p[pr] - p[i], p[n] - p[pr]}) - min({p[pl], p[i] - p[pl], p[pr] - p[i], p[n] - p[pr]}));
}
cout << ans;
//cerr << (clock() + 0.0) / CLOCKS_PER_SEC;
return 0;
}
| 0 |
#include <cstdio>
#include <iostream>
using namespace std;
struct Candidate{
int num;
};
int main(void) {
for (;;) {
int n, p;
cin >> n >> p;
if (n == 0 && p == 0)
break;
Candidate candidate[50];
for (int i = 0; i < 50; i++) {
candidate[i].num = 0;
}
int winner;
int t = p;
for (int i = 0; i <= 1000000; i=(i+1)%n) {
if (p != 0) {
candidate[i].num++;
p--;
}
else if (p == 0) {
p+=candidate[i].num;
candidate[i].num = 0;
}
if (candidate[i].num == t) {
winner = i;
break;
}
}
printf("%d\n", winner);
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> a;
vector <int> all;
int n,m;
int main() {
while(1) {
scanf("%d%d",&n,&m);
if(n == 0 && m ==0) break;
a.resize(n);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
a.push_back(0);
all.clear();
for(int i=0;i<a.size();i++)
for(int j=i;j<a.size();j++)
all.push_back(a[i]+a[j]);
sort(all.begin(),all.end());
int ans = 0;
int allsize = all.size();
int b = 0;
for(int i=allsize-1;i>= 0;i--) {
for(int j=b;j<allsize;j++) {
int sum = all[i] + all[j];
if(sum > m) break;
b++;
if(ans < sum) ans = sum;
}
if(ans == m) break;
}
cout << ans <<endl;
}
return 0;
} | 0 |
#include <iostream>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
map<int, int> memo;
for(int i = 0; i < n; i++){
int a;
cin >> a;
if(memo.count(a)) memo.erase(a);
else memo[a] = 1;
}
cout << memo.size() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
main(){
int n;cin >> n;
int a[n];for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
int ans=0;
for(int i=0;i<n;){
int cc = a[i];
int cnt = 0;
int j=i;
while(a[j] == cc){
cnt++;
i++;
j++;
}
ans+=cnt%2;
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")\n"; \
} while (0)
#else
#define dbg(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define in(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << '\n';
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define out(...) write_to_cout(__VA_ARGS__);
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
template <typename T>
using V = std::vector<T>;
template <typename T>
using VV = V<V<T>>;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
in(int, N, M, Q);
VV<int> trains(N + 1, V<int>(N + 1));
rep(i, M) {
in(int, L, R);
trains[L][R]++;
}
VV<int> sum(N + 2, V<int>(N + 2));
for (int l = N; l >= 1; --l) {
for (int r = 1; r <= N; ++r) {
sum[l][r] =
sum[l + 1][r] + sum[l][r - 1] - sum[l + 1][r - 1] + trains[l][r];
}
}
rep(i, Q) {
in(int, p, q);
out(sum[p][q]);
}
}
| #include "bits/stdc++.h"
using namespace std;
void Main() {
int N, M, Q;
cin >> N >> M >> Q;
vector<map<int, int>> start_length(N, map<int, int>());
for (int i = 0; i < M; ++i) {
int l, r;
cin >> l >> r;
--l;
--r;
if (start_length[l].count(r - l) == 0) {
start_length[l].insert(make_pair(r - l, 0));
}
start_length[l][r - l] += 1;
}
vector<vector<int>> start_lengthLess(N, vector<int>());
for (int i = 0; i < N; ++i) {
const map<int, int>& length_num = start_length[i];
vector<int> length(N + 1, 0);
for (auto e : length_num) {
length[e.first] = e.second;
}
vector<int> accumLength(N + 1, 0);
accumLength[0] = length[0];
for (int j = 1; j < accumLength.size(); ++j) {
accumLength[j] = accumLength[j - 1] + length[j];
}
start_lengthLess[i] = accumLength;
}
for (int i = 0; i < Q; ++i) {
int p, q;
cin >> p >> q;
--p;
--q;
int ans = 0;
for (int j = p; j <= q; ++j) {
ans += start_lengthLess[j][q - j];
}
cout << ans << endl;
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main() {
while(1) {
int n;
cin >> n;
if(n == 0) break;
int pm[n], pe[n], pj[n];
double average[n];
double ave_me[n];
for(int i = 0; i < n; i++) {
cin >> pm[i] >> pe[i] >> pj[i];
average[i] = (pm[i]+pe[i]+pj[i])/3.0;
ave_me[i] = (pm[i]+pe[i])/2.0;
}
char grade[n];
for(int i = 0; i < n; i++) {
if(pm[i] == 100 || pe[i] == 100 || pj[i] == 100) {
grade[i] = 'A';
} else if(ave_me[i] >= 90) {
grade[i] = 'A';
} else if(average[i] >= 80) {
grade[i] = 'A';
} else if(average[i] >= 70) {
grade[i] = 'B';
} else if(average[i] >= 50 && (pm[i] >= 80 || pe[i] >= 80)) {
grade[i] = 'B';
} else {
grade[i] = 'C';
}
cout << grade[i] << endl;
}
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
while( true ) {
long long int a, b, c;
cin >> a >> b >> c;
if ( a == 0 ) break;
vector< long long int > ans;
for ( long long int i = 0; i < a + b + c; i++ ) {
ans.push_back( 2 );
}
long long int n;
cin >> n;
vector< long long int > v_a, v_b, v_c;
for ( long long int i = 0; i < n; i++ ) {
long long int in_a, in_b, in_c, r;
cin >> in_a >> in_b >> in_c >> r;
if ( r == 1 ) {
ans[ in_a - 1 ] = 1;
ans[ in_b - 1 ] = 1;
ans[ in_c - 1 ] = 1;
}else {
v_a.push_back( in_a );
v_b.push_back( in_b );
v_c.push_back( in_c );
}
}
for ( long long int i = 0; i < v_a.size(); i++ ) {
if ( ans[ v_a[i] - 1 ] == 1 && ans[ v_b[i] - 1 ] == 1 ) ans[ v_c[i] - 1 ] = 0;
if ( ans[ v_a[i] - 1 ] == 1 && ans[ v_c[i] - 1 ] == 1 ) ans[ v_b[i] - 1 ] = 0;
if ( ans[ v_b[i] - 1 ] == 1 && ans[ v_c[i] - 1 ] == 1 ) ans[ v_a[i] - 1 ] = 0;
}
for ( long long int i = 0; i < a + b + c; i++ ) {
cout << ans[i] << endl;
}
}
return 0;
} | 0 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
int N, X, T;
cin >> N >> X >> T;
cout << (N+X-1)/X*T;
} | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
//*/
long long N, M, K;
cin >> N >> M >> K;
vector<long long> vec(N+1);// i個のブロックの塊をM色で隣合う色が異なるように塗る数
vec[0] = 0;
vec[1] = M;
COMinit();
for(int i = 2; i <= N; i++){
vec[i] = vec[i-1] * (M-1) % MOD;
vec[i] %= MOD;
}
long long sum = 0;
for(int i = 0; i <= K; i++){
sum += COM(N-1, i) * vec[N - i] % MOD;
sum %= MOD;
}
cout << sum <<endl;
}
| 0 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
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; }
set<int> si;
int n,k;
int fin = -1;
int s_int(string s){
return atoi(s.c_str());
}
int check(int n){
bool ok = 1;
while(n >= 0){
if(si.find(n%10) != si.end()){
return 0;
}
n /= 10;
if(n == 0) break;
}
return 1;
}
vector<int> solve(){
vector<int> ans;
queue<string> que;
rep(i,10){
string s = "";
s += char('0' + i);
que.push(s);
}
while(1){
string fa = que.front(); que.pop();
if(fa.size() > fin) return ans;
if(!check(s_int(fa))){
continue;
}
if(s_int(fa) >=n){
if(fin == -1) fin = fa.size();
ans.push_back(s_int(fa));
}
rep(i,10){
que.push(string(fa + char('0' + i)));
}
}
}
int main(){
cout << fixed << setprecision(10);
cin >> n >> k;
rep(i,k){
int x;
cin >> x;
si.insert(x);
}
vector<int> ans = solve();
sort(ans.begin(),ans.end());
cout << ans[0] << endl;
return 0;
} | #include<cstdio>
#include<queue>
#include<iostream>
#define ll long long
using namespace std;
ll res[4][2]={-1,0,0,1,0,-1,1,0};
char map1[60][60];
ll step[60][60];
ll n,m;
ll bfs()
{
map1[0][0]='#';
step[0][0]=0;
queue<ll>qu;
qu.push(0);
qu.push(0);
while(!qu.empty())
{
ll x=qu.front();qu.pop();
ll y=qu.front();qu.pop();
if(x==n-1&&m-1==y)return step[x][y];
for(int i=0;i<4;++i)
{
ll dx=x+res[i][0];
ll dy=y+res[i][1];
if(dx>=0&&dx<n&&dy>=0&&dy<m&&map1[dx][dy]=='.')
{
map1[dx][dy]='#';
step[dx][dy]=1+step[x][y];
qu.push(dx);
qu.push(dy);
}
}
}
return -1;
}
int main()
{
while(cin>>n>>m)
{
for(ll i=0;i<n;++i)
cin>>map1[i];
ll sum=0;
for(ll i=0;i<n;++i)
{
for(int j=0;j<m;++j)
if(map1[i][j]=='.')
sum++;
}
ll ss=bfs();
if(ss==-1)puts("-1");
else printf("%lld\n",sum-ss-1);
}
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1000000000;
constexpr ll INF = 5000000000000000000;
int main() {
ll x;
cin >> x;
ll ans = 0;
ans += x / 11 * 2;
x -= x / 11 * 11;
if (x >= 1 && x <= 6) ans += 1;
if (x >= 7) ans += 2;
cout << ans << "\n";
}
| #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
//ワーシャルフロイト法のテンプレ.graphに最短経路が格納される.
//負の重みがある場合inf + const = inf に気を付けること.
//graphは隣接行列.
void WF(vector<vector<int>> &graph){
int n = graph.size();
for (int k = 0; k < n; k++){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]);
}
}
}
}
//素因数分解をする関数.
map<long long int, int> prime_factorization(long long int a)
{
map<long long int, int>ans;
for (long long i = 2; i*i <= a; ++i) {
while (a%i == 0) {
ans[i]++;
a /= i;
}
}
if (a != 1)ans[a]++;
return ans;
}
int main()
{
ll x;
cin >> x;
ll ans = (x / 11) * 2;
x = x % 11;
if (x > 6)
ans += 2;
else if (x > 0)
ans++;
cout << ans << endl;
return 0;
} | 1 |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using std::cin;
using std::cout;
using std::cerr;
using std::endl;
using std::map;
using std::set;
using std::bitset;
using std::vector;
using std::string;
using std::multimap;
using std::multiset;
using std::deque;
using std::queue;
using std::stack;
using std::pair;
using std::iterator;
using std::sort;
using std::stable_sort;
using std::reverse;
using std::max_element;
using std::min_element;
using std::unique;
using std::ios_base;
using std::swap;
using std::fill;
using std::setprecision;
using std::fixed;
using std::min;
using std::max;
//#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
//typedef string S;
namespace MySpace{
};
#define F(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()
inline int nextInt()
{
int x = 0;
char c = getchar();
int mi = (c == '-');
if (c == '-') c = getchar();
while ('0' <= c && c <= '9')
{
x = 10 * x + c - '0';
c = getchar();
}
if (mi) return x * -1;
return x;
}
int n, m;
vector<int> graph[550000];
int color[550000];
int BITPARTITE = 1;
vector<int> bp, p;
int SZ = 0;
int dfs(int v, int fl)
{
color[v] = fl;
SZ++;
for (auto u : graph[v])
{
if (color[u] == 0) dfs(u, 3 - fl);
if (color[u] == fl) BITPARTITE = 0;
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int v, u;
cin >> v >> u;
v--, u--;
graph[v].push_back(u);
graph[u].push_back(v);
}
ll ans = 0;
ll cnt = n - 1;
for (int i = 0; i < n; i++)
{
if (graph[i].size() == 0)
{
ans += 2 * cnt + 1;
cnt--;
}
}
for (int i = 0; i < n; i++)
{
if (color[i] == 0 && graph[i].size() != 0)
{
BITPARTITE = 1;
SZ = 0;
dfs(i, 1);
if (BITPARTITE) bp.push_back(SZ);
else p.push_back(SZ);
}
}
cout << ans + 2LL * bp.size() * bp.size() + p.size() * p.size() + 2LL * bp.size() * p.size();
}
| #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x) BEGIN(x), END(x)
#define PAIR make_pair
#define VEC(type) vector<type >
#define endl '\n'
#define FOR(i, A, B) for(auto i = (A);i != (B); i++)
#define FORD(i, A, B) for(auto i = (A);i != (B); i--)
#define READRANGE(begin, end) FOR(it, begin, end) cin >> *it
#define READVEC(V) READRANGE(BEGIN(V), END(V))
using namespace std;
typedef long long lint;
typedef pair<int, int> Pii;
typedef pair<int, lint> Pil;
typedef pair<lint, lint> Pll;
typedef pair<lint, int> Pli;
// ---- BEGIN LIBRARY CODE ----
// ---- END LIBRARY CODE ----
void io_init()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
int main(int argc, char **argv)
{
io_init();
// Actual program code starts here.
int N, M;
cin >> N >> M;
VEC(VEC(int)) Edges(N);
FOR(i, 0, M) {
int u, v;
cin >> u >> v;
Edges[u - 1].push_back(v - 1);
}
VEC(VEC(int)) Reach(N, VEC(int)(N, 10000));
FOR(i, 0, N) {
VEC(int)& Bfs = Reach[i];
queue<int> q;
q.push(i);
while (q.size()) {
int v = q.front();
q.pop();
for (int u : Edges[v])
if (Bfs[u] >= 10000) {
q.push(u);
int dist = v == i ? 0 : Bfs[v];
Bfs[u] = 1 + dist;
}
}
}
VEC(int) cycle(10000, 0);
FOR(i, 0, N)
if (cycle.size() >= 10000 || Reach[i][i] < cycle.size()) {
cycle.clear();
int node = i, dist = Reach[i][i];
while (dist--) {
cycle.push_back(node);
for (int next : Edges[node]) {
if (next == i) {
goto done;
}
if (Reach[next][i] == dist) {
node = next;
break;
}
}
}
done:
continue;
}
if (cycle.size() >= 10000) {
cout << -1 << endl;
return 0;
}
cout << cycle.size() << endl;
for (int v : cycle)
cout << (v + 1) << endl;
return 0;
}; | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;
typedef long long ll;
#define INF 99999999
int n, k;
int dis[100][100];
int t, a, b, c, d, e;
signed main()
{
while (true) {
cin >> n >> k;
if (n == 0 && k == 0) break;
rep(i,n) rep(j,n) if (i == j) {
dis[i][j] = 0;
} else {
dis[i][j] = INF;
}
rep(i,k) {
cin >> t;
if (t == 0) {
cin >> a >> b;
a--; b--;
if (dis[a][b] == INF) {
cout << -1 << endl;
} else {
cout << dis[a][b] << endl;
}
} else if (t == 1) {
cin >> c >> d >> e;
c--; d--;
dis[c][d] = min(dis[c][d], e);
dis[d][c] = min(dis[d][c], e);
rep(i,n) rep(j,n) {
dis[i][j] = min(dis[i][j], min(dis[i][c] + dis[c][d] + dis[d][j], dis[i][d] + dis[d][c] + dis[c][j]));
dis[j][i] = min(dis[j][i], min(dis[j][c] + dis[c][d] + dis[d][i], dis[j][d] + dis[d][c] + dis[c][i]));
}
}
}
}
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<30;
typedef pair<int,int> pii;
int w,h;
int xs, ys, xg, yg;
int ba[100][100];
int dx[] = {-1,0,0,1};
int dy[] = {0,-1,1,0};
bool solve() {
queue<pii> Q;
bool visited[w][h];
memset(visited, 0, sizeof(visited));
Q.push(pii(xs,ys));
int col = ba[xs][ys];
while(Q.size()){
pii a = Q.front();
int x = a.first, y = a.second;
Q.pop();
// printf("%d %d %d\n", x,y, visited[x][y]);
visited[x][y] = 1;
REP(k,4) {
int xx = x + dx[k];
int yy = y + dy[k];
// cout << " " <<x << endl;
if (xx<0 || w<=xx || yy<0 || h<=yy) continue;
if (visited[xx][yy]) continue;
if (col != ba[xx][yy]) continue;
if (xx == xg && yy == yg)
return true;
//cout << xx << ". " << yy << endl;
Q.push(pii(xx,yy));
}
}
return false;
}
int main() {
while(cin>>w>>h,w+h) {
cin >>xs>>ys>>xg>>yg;
xs--;ys--;xg--;yg--;
int n;
cin >> n;
REP(i,n) {
int c,d,x,y;
cin >> c>>d>>x>>y;
x--;y--;
REP(i,8) {
if (d==0)
ba[x+i%4][y+i/4] = c;
else
ba[x+i/4][y+i%4] = c;
}
}
// REP(y,h) {
// REP(x,w)
// cout << ba[x][y] << " ";
// cout << endl;
// }
if (solve())
cout << "OK" << endl;
else
cout << "NG" << endl;
}
} | 0 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
if(y%2==0)
return (p*p)%z;
else
return (x*((p*p)%z))%z;
}}
ll gcd(ll x,ll y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
ll po(ll x)
{
ll c=0;
while(x>0)
{
x=x&(x-1);
c++;
}
return c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
ll n,x;
cin>>n>>x;
if(n>=10)
cout<<x;
else
cout<<x+100*(10-n);}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int r;
int x;
cin >> n;
cin >> r;
x = 100*(10-n)+r;
if (n >= 10) {
cout << r;
} else {
cout << x;
}
return 0;
}
| 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
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; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e15;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef pair<double,double> point;
const ll MAX = 2000005;
constexpr ll nx[8] = {1,0,-1,0,1,-1,1,-1};
constexpr ll ny[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll h,w;
cin >> h >> w;
vector<string> grid(h+2);
string s = "";
rep(i,w+2) s += '.';
grid[0] = s;
grid[h+1] = s;
rep(i,h){
cin >> grid[i+1];
grid[i+1] = '.'+grid[i+1]+'.';
}
rep(i,1,h+1){
rep(j,1,w+1){
bool out = 1;
if (grid[i][j] == '#'){
rep(k,4){
ll xn = i+nx[k];
ll yn = j+ny[k];
if (grid[xn][yn] == '#') out = 0;
}
if (out){
PRINT("No");
return 0;
}
}
}
}
PRINT("Yes");
}
| #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
return true;
}
template <class T> inline bool chmin(T &a, const T &b) {
if(a <= b) return false;
a = b;
return true;
}
/*-------------------------------------------*/
int n, x, a[200];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cin >> n >> x;
rep(i, n) cin >> a[i];
sort(a, a + n);
ll dp[209][100009];
rep(i, 100009) dp[0][i] = i;
rep(i, n) rep(j, 100009) dp[i + 1][j] =
(dp[i][j % a[i]] + i * dp[i][j]) % mod;
cout << dp[n][x] << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
bool upd[(1<<18)];
int val[(1<<18)];
void Set(int a,int b,int x,int k=0,int l=0,int r=(1<<17)){
if(b<=l || r<=a)return;
if( r-l>1 && upd[k] ){
upd[k*2+1] = upd[k*2+2] = 1;
val[k*2+1] = val[k*2+2] = val[k];
}
upd[k]=0;
if(a<=l && r<=b){
upd[k]=1;
val[k]=x;
}
else{
Set(a,b,x,k*2+1,l,(l+r)/2);
Set(a,b,x,k*2+2,(l+r)/2,r);
val[k]=min(val[k*2+1],val[k*2+2]);
}
}
int Find(int a,int b,int k=0,int l=0,int r=(1<<17)){
if(b<=l || r<=a)return INT_MAX;
if( r-l>1 && upd[k] ){
upd[k*2+1] = upd[k*2+2] = 1;
val[k*2+1] = val[k*2+2] = val[k];
}
upd[k]=0;
if(a<=l && r<=b) return val[k];
else{
int L = Find(a,b,k*2+1,l,(l+r)/2);
int R = Find(a,b,k*2+2,(l+r)/2,r);
return min(L,R);
}
}
int n,m,a,b,c,d;
int main(){
memset(upd,0,sizeof(upd));
fill(val,val+(1<<18),INT_MAX);
cin>>n>>m;
while(m--){
cin>>a>>b;
if(a){
cout<<Find(b,b+1)<<endl;
}
else{
cin>>c>>d;
Set(b,c+1,d);
}
}
}
| #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INIVAL 2147483647
int *a, *ts, c, s, t, v;
void update(int k, int l, int r)
{
if (r<s || t<=l) return;
if (s<=l && r<=t) {
a[k] = v;
ts[k] = c;
} else if (l<r-1) {
update(((k+1)<<1)-1, l, (l+r)>>1);
update((k+1)<<1, (l+r)>>1, r);
}
}
int main()
{
int i, k, n, z, w, latest;
char *p,buf[64] = {0};
buf[62] = '\n';
fgets(buf, 64, stdin);
for (n=0,p=buf; *p>' '; n=n*10+*(p++)-'0');
w = n>1 ? pow(2,(int)ceil(log2(n)))-1 : 1;
ts = (a = (int*)malloc((w+n)*2*sizeof(int))) + w+n;
for (i=0; i<w+n; i++) ts[i] = -1;
a[0] = INIVAL;
ts[0] = 0;
c = 0;
while (fgets(buf, 64, stdin)) {
for (s=0,p=buf+2; *p>' '; s=s*10+*(p++)-'0');
if (*buf=='0') { // update(s, t, x)
for (t=0,p++; *p>' '; t=t*10+*(p++)-'0');
for (v=0,p++; *p>' '; v=v*10+*(p++)-'0');
t++;
update(0, 0, w+1);
c++;
} else { // find(x) x->s
latest = -1;
for (k=w+s; ; k=(k-1)>>1) {
if (ts[k]>latest) {
latest = ts[k];
z = a[k];
}
if (k==0) break;
}
if (z<10) {
putc_unlocked('0'+z, stdout);
putc_unlocked('\n', stdout);
} else {
for (i=62; z>0; buf[--i]='0'+z%10,z/=10);
fputs(buf+i, stdout);
}
}
}
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int x[100010], nx[100010][20];
int main() {
int N, L, Q;
cin >> N;
for(int i=1; i<=N; ++i) cin >> x[i];
cin >> L;
int now=1;
for(int i=1; i<=N; ++i){
while(now<N){
if(x[now+1]-x[i]<=L){
++now;
}
else break;
}
nx[i][0]=now;
}
nx[N][0]=nx[N+1][0]=N+1;
int mx=0;
while(nx[1][mx]<N){
for(int j=1; j<=N+1; ++j){
nx[j][mx+1]=nx[nx[j][mx]][mx];
}
++mx;
}
cin >> Q;
for(int q=0; q<Q; ++q){
int a, b;
cin >> a >> b;
if(a>b) swap(a, b);
int ans=0, tak=a;
for(int i=mx; i>=0; --i){
if(nx[tak][i]<b){
ans |= (1<<i);
tak=nx[tak][i];
}
}
cout << ans+1 << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void dfs(ll v,ll par,set<ll> &st,vl &ans, vvl &g){
for(auto nv:g[v]){
if(par==nv)continue;
if(ans[nv]==-1){
ans[nv]=v;
st.ins(v);dfs(nv,v,st,ans,g);st.erase(v);
}
else{
if(st.count(ans[nv]))ans[nv]=v;
}
}
}
int main(){
ll n,m;cin >>n >>m;
vvl g(n);
vl ans(n,-1);
set<ll> st;rep(i,n)st.ins(i);
rep(i,n-1+m){
ll a,b;cin >> a >> b;a--;b--;
g[a].pb(b);
st.erase(b);
}
ll s=*st.begin();st.clear();
dfs(s,-1,st,ans,g);
for(auto p:ans)cout << p+1 <<endl;
} | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)
#define repd(i,a) repdi(i,a,0)
#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define endl '\n'
#define debug(x) std::cerr << #x << " = " << (x) << endl;
using ll = long long;
using P = std::pair<ll, ll>;
constexpr ll INF = 1ll<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class S, class T>
std::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )
{ std::cout << '(' << a.first << ", " << a.second << ')'; return out; }
template<class T>
std::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )
{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; }
ll K, X;
int main() {
std::cin >> K >> X;
repi( i, X-(K-1), X+K )
std::cout << i << (i==X+K-1 ? '\n': ' ');
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d){
long long count = 0;
long long f1 = 1;
long long f2 = 1;/*ここを変える*/
long long temp;
if(d == 1){
count = f1;
}else if(d == 2){
count = f2;
}else if(d==0){
count = 1;
}else{
for(int i=0;i<d-2;i++){
temp = f1+f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L,long long R){
if(L>R){
long long temp=R;
R = L;
L = temp;
}
unsigned long long pp=0,ppt=0;
unsigned long long ans=0;
if(R%L==0){
ans = L;
}else{
while(true){
ppt = pp;
pp=R%L;
if(pp == 0){
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L,long long R){
unsigned long long ans;
unsigned long long gcd = GCD(L,R);
ans = (L/gcd)*R;
return ans;
}
/*Combination set*/
#define mod 1000000007
#define maxcomb 3000/*大きいものを求めるときはここを変える*/
vector<long long> fc(maxcomb+1);
vector<long long> ifc(maxcomb+1);
long long modpow(long long x,long long n){
long long ans = 1;
while(n > 0){
if(n & 1) {
ans = ans*x%mod;
}
x = x*x%mod;
n >>= 1;
}
return ans;
}
void Conb(){
fc[0]= 1;
ifc[0]=1;
for(long long i=0;i<maxcomb;i++){
fc[i+1] = fc[i]*(i+1)%mod;//n!(mod)
ifc[i+1] = ifc[i]*modpow(i+1,mod-2)%mod;//k!^{M-2} (mod)
}
}
unsigned long long Combination(long long L,long long R){
unsigned long long up=1,ans;
Conb();
if(L==0&&R==0){
return 1;
}else if(L<R||L<0){
return 0;
}else{
long long t = ifc[L-R]*ifc[R]%mod;
ans = t*fc[L]%mod;
}
return ans;
}
/*Combination set ここまで*/
/*ここから*/
int main() {
int K,X;
cin >> K >> X;
for(int i=X-K+1;i<X+K;i++){
cout << i ;
if(i!=X+K-1){
cout << " ";
}else{
cout << endl;
}
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
int cnt = 0;
for(int i = a; i <= b; i++){
int l = i;
vector<int> vec(5);
rep(j, 5){
vec[j] = l % 10;
l /= 10;
}
if(vec[0] == vec[4] && vec[1] == vec[3]) cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int n, r;
cin >> n >> r;
if(n<10){
cout << r - 100*n + 1000 << endl;
}else{
cout << r << endl;
}
}
| 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int m; cin>>m;
vector<ll> d(m),c(m);
for (int i=0;i<m;i++) cin>>d[i]>>c[i];
ll res=0, digit=0;
for (int i=0;i<m;i++) {
res+=c[i];
digit+=d[i]*c[i];
}
res=res-1+(digit-1)/9;
cout<<res<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,f,ans=0,k,g;
cin>>a>>b>>c>>d>>e>>f;
k=min(min(a,b),min(c,d));
g=min(e,f);
ans=a+b+c+d+e+f-k-g;
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, L;
cin >> N >> L;
vector<int> A;
for (int i = 1; i <= N; i++) {
A.push_back(L+i-1);
}
sort(A.begin(), A.end(), [](int x, int y) {
return abs(x) < abs(y);
});
int total = 0;
for (int i = 1; i < N; i++) {
total += A[i];
}
cout << total << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return result;
}
int gcd(int a,int b)
{
if(b==0)
{
return a;
}
return gcd(b,a%b);
}
void sieve()
{
memset(isPrime,1,sizeof(isPrime));
isPrime[0] = isPrime[1] = 0;
for(int i=2;i*i<=1000000;i++)
{
if(isPrime[i])
{
for(int j=i*i;j<=1000000;j+=i)
{
isPrime[j] = 0;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
int t,n;
t = 1;
for(int i=0;i<t;i++)
{
int n,m;
cin>>n>>m;
unordered_map <int,int> mp;
int penalties = 0,correct = 0;;
for(int i=0;i<m;i++)
{
string s;
int x;
cin>>x>>s;
if(s=="WA")
{
if(mp[x]!=1000000)
{
mp[x]++;
}
}
if(s=="AC")
{
if(mp[x]!=1000000)
{
penalties+=mp[x];
correct ++;
mp[x] = 1000000;
}
}
}
cout<<correct<<" "<<penalties;
}
return 0;
}
| 0 |
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
int lcm( int m, int n ){
if ( ( 0 == m ) || ( 0 == n ) )
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
int main(){
int n; cin>>n;
vi v(n,0);rep(i,n)cin>>v[i];
sort(all(v));
for(int i=1;i<=v[0];i++){
bool flag=true;
rep(j,n){if(v[j]%i)flag=false;}
if(flag)cout<<i<<endl;
}
} | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(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 EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int main() {
int n;
string sn;
getline(cin, sn);
n = atoi(sn.c_str());
REP(i, n){
string s;
getline(cin, s);
while (s.find("Hoshino") != string::npos){
s[s.find("Hoshino") + 6] = 'a';
}
cout << s << endl;
}
} | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
int a,b,c;
while(cin>>a>>b>>c,a+b+c){
vector<int>in(a+b+c+1,2);
int n;
cin>>n;
vector<vector<int> >tmp(n,vector<int>(4));
rep(i,n)rep(j,4)cin>>tmp[i][j];
rep(i,n)if(tmp[i][3]==1){
in[tmp[i][0]]=1;
in[tmp[i][1]]=1;
in[tmp[i][2]]=1;
}
rep(i,n){
int co=0;
rep(j,3)if(in[tmp[i][j]]!=1)co++;
if(co==1){
rep(j,3)if(in[tmp[i][j]]==2)in[tmp[i][j]]=0;
}
}
loop(i,1,a+b+c+1)cout<<in[i]<<endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a,b,c,n,buhin[300],kensa[1000][4];
while(1){
for(int i = 0;i < 300;i++) buhin[i] = 2;
cin >> a >> b >> c >> n;
if(a == 0 && b == 0 && c == 0) break;
for(int i = 0;i < n;i++){
cin >> kensa[i][0] >> kensa[i][1] >> kensa[i][2] >> kensa[i][3];
if(kensa[i][3]){
buhin[kensa[i][0] - 1] = 1;
buhin[kensa[i][1] - 1] = 1;
buhin[kensa[i][2] - 1] = 1;
}
}
for(int i = 0;i < n;i++){
if(!kensa[i][3]){
if(buhin[kensa[i][0] - 1] == 1 && buhin[kensa[i][1] - 1] == 1) buhin[kensa[i][2] - 1] = 0;
if(buhin[kensa[i][0] - 1] == 1 && buhin[kensa[i][2] - 1] == 1) buhin[kensa[i][1] - 1] = 0;
if(buhin[kensa[i][2] - 1] == 1 && buhin[kensa[i][1] - 1] == 1) buhin[kensa[i][0] - 1] = 0;
}
}
for(int i = 0;i < a + b + c;i++) cout << buhin[i] << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,n) for(int i = l; i <= (int)(n); i++)
#define drep(i,n) for(int i = (int)(n-1); i >= 0; i--)
#define drepn(i,n) for(int i = (int)(n); i >= 0; i--)
#define size(s) (int)s.size()
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }
template<typename T> inline istream& operator>>(istream &i, vector<T> &v) {rep(j, size(v)) i >> v[j]; return i;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T> T gcd(T a, T b) {if(b==0)return a; else return gcd(b,a%b);}
template<class T> T lcm(T a, T b) {return a/gcd(a,b)*b;}
template<class T = int> using V = vector<T>;
template<class T = int> using VV = vector<V<T>>;
bool isIn(int i, int j, int h, int w) {return i >= 0 && i < h && j >= 0 && j < w;}
void Yes(){cout << "Yes" << endl;}
void No(){cout << "No" << endl;}
void YES(){cout << "YES" << endl;}
void NO(){cout << "NO" << endl;}
void err() {cout << -1 << endl;}
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ep emplace_back
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int h1, m1, h2, m2;
cin >> h1 >> m1 >> h2 >> m2;
while(h2 > h1) {
m2 += 60;
h2--;
}
int k;
cin >> k;
cout << (m2 - m1) - k << '\n';
} | // organize and stay in moment - Abhinav IIITA
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define ff first
#define ss second
#define ld long double
#define f(i,x,n) for(int i=x;i<n;++i)
int dx[]={-1,1,0,0};
int dy[]={0,0,1,-1};
int m=1e9+7;
vector<int> pr;
int prime[200005]={0};
void seive(){
for(int i=2;i<200005;++i){
if(prime[i]==0){
pr.pb(i);
for(int j=2*i;j<200005;j+=i){
prime[j]=1;
}
}
}
}
// -----------------------------------------------------------------------
int exp(int a,int b){
int r=1;
while(b!=0){
if(b&1){
r*=a;
}
b/=2;
a*=a;
}
return r;
}
// -----------------------------------------------------------------------
void solve(){
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
int h=(h2-h1-1)*60;
h+=(m2+60-m1-k);
cout<<h;
}
// -----------------------------------------------------------------------
int32_t main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t=1; // cin>>t;
//seive();
while(t--)
solve();
return 0;
} | 1 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a;
cin >> a;
cout << a / 3;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int counter = 0;
cin >> N;
for(int i = 0;i < N/3 + 1;i++){
if((N - 3*(i + 1) >= 0)){
counter ++;}
else cout << counter << endl;}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; // x->y
}
}else if(y<0){
if(abs(x) > abs(y)){
ans++; // x->-x
ans+= abs(x) - abs(y); // x->-y
}else if(abs(x) < abs(y)){
ans+= abs(y) - abs(x); // x->y
ans++; // x -> -y
}else{
ans++;
}
}else{
ans++;
ans+= x;
}
}else if(x<0){
if(y>0){
if(abs(x)>abs(y)){
ans += abs(x) -abs(y);
ans++;
}else if(abs(x)<abs(y)){
ans++;
ans += abs(y) - abs(x);
}else{
ans++;
}
}else if(y<0){
if(abs(x)>abs(y)){
ans += abs(x) -abs(y);
}else if(abs(x)<abs(y)){
ans++;
ans += abs(y) - abs(x);
ans++;
}
}else{
ans+=abs(x);
}
}else{
if(y>0) ans+=y;
else if(y<0) ans+= abs(y) + 1;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double current, goal;
cin >> current >> goal;
cout << 2 * goal - current << endl; // Solve for x: (current + x) / 2 = goal
} | 0 |
///*Bismillahir Rahmanir Rahim***///
/***Stay_Home_Stay_Safe***/
///**Author Thasin Sheikh**///
#include<bits/stdc++.h>
using namespace std;
#define MAX 35000
#define MOD 1000000007
#define PI 3.14159265359
#define makefast__ ios_base::sync_with_stdio(false);
using ll=long long int ;
using dl =double;
const int N = 2e5 + 10;
ll aarray[300000+10];
ll magic[101][101];
vector<ll>primes;
bool prime[1000001];
ll chkbit(ll n,ll k)
{
return n&(1LL<<k);
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
makefast__
string str;
ll a,b,c,d,e,f,x,y,k,t,A=0,mod,B=0,L,j,i,l,r,m,n,C=0,ans=0,sum=0,sum1=0;
vector<ll>v,v1;
queue<ll>qu;
cin>>n;
for(i=0; i<n; i++)
cin>>aarray[i];
for(i=0; i<64; i++)
{
ll cnt=0;
for(j=0; j<n; j++)
{
if(chkbit(aarray[j],i))
cnt++;
}
ll ad=((cnt*(n-cnt))%MOD)*((1LL<<i)%MOD);
ans=(ans+ad)%MOD;
}
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
const long long MOD = 1000000007;
long long N;
long long a[100000] = {0};
int main() {
cin >> N;
long long ans = 1;
rep(i, N) {
long long A;
cin >> A;
long long temp;
if(A == 0) {
temp = 3 - a[A];
} else {
temp = a[A-1] - a[A];
}
ans = ans * temp % MOD;
a[A]++;
}
if(ans <= 0) cout << 0 << endl;
else cout << ans << endl;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;cin>>s;
int n=s.size();
if(n%2!=0)cout<<"No";
else
{int f=0;
for(int i=0;i<n;i+=2)
{
if(s[i]=='h' && s[i+1]=='i')continue;
else{f++;break;}
}
if(f==0)cout<<"Yes";
else cout<<"No";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int cur = 0;
while (cur < S.size()) {
if (cur + 1 < S.size() && S[cur] == 'h' && S[cur + 1] == 'i') {
cur += 2;
} else {
break;
}
}
if (cur < S.size()) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int count = 0;
const int INF = 2000000000;
for(int i = 0; i < N; i++) {
cin >> A[i];
}
// 最長減少(等しい場合も含む)部分列の数列の長さがi+1のときの最終要素の最大値dp[i]?
vector<int> dp;
// 初期条件
dp.push_back(A[0]);
// dp開始
for(int i = 1; i < N; i++) {
// dp[i]の右から走査
auto iter = lower_bound(dp.rbegin(), dp.rend(), A[i]);
// A[i]が右端の値以下の場合
if(iter == dp.rbegin()) {
dp.push_back(A[i]);
// A[i]より小さい値がdp[i]に存在する場合
} else {
*(iter-1) = A[i];
}
}
// dp[i]の大きさが答え
cout << dp.size() << endl;
return 0;
}
| #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,M;
int a[1002]={0},vt[1002]={0};
cin>>N>>M;
for(int i=1;i<=N;i++)cin>>a[i];
for(int i=0;i<M;i++){
int b;
cin>>b;
for(int j=1;j<=N;j++){
if(a[j]<=b){
vt[j]++;
break;
}
}
}
int ans=0,ansvt=0;
for(int i=1;i<=N;i++)if(ansvt<vt[i])ans=i,ansvt=vt[i];
cout<<ans<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long,long long>
#define ii pair<int,int>
#define mod 1000000007
#define endl '\n'
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
ll power(ll a,ll b){
ll ans=1;
while(b>0){
if(b%2!=0){
ans=(ans*a)%mod;
}
a=((a%mod)*(a%mod))%mod;
b>>=1;
}
return ans;
}
void sieve(int n){
bool prime[n+1];
memset(prime,true,sizeof(prime));
for(int p=2;p*p<=n;p++){
if(prime[p]){
for(int i=p*p;i<=n;i+=p)
prime[i]=false;
}
}
for(int p=2;p<=n;p++){
if(prime[p])
cout<<p<<" ";
}
}
int ans(int index,int time,int t,vector<pair<int,int>>& v,vector<vector<int>>& value){
if(index>=v.size())
return 0;
if(time>=t)
return 0;
if(value[index][time]!=-1)
return value[index][time];
int returnVal=0;
returnVal = v[index].second + ans(index+1,time+v[index].first,t,v,value);
returnVal = max(returnVal,ans(index+1,time,t,v,value));
value[index][time]=returnVal;
return returnVal;
}
int main() {
IOS;
int n,t;
cin>>n>>t;
vector<pair<int,int>> v;
for(int i=0;i<n;i++){
int p,q;
cin>>p>>q;
v.push_back({p,q});
}
sort(v.begin(),v.end());
std::vector<vector<int>> va(n+1,vector<int> (t+1,-1));
cout<<ans(0,0,t,v,va);
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int dp1[3004][3004];
int dp2[3004][3004];
int main(){
int N, T;
scanf("%d", &N);
scanf("%d", &T);
std::vector<int > A(N), B(N);
int max=-1;
int maxindex=-1;
for (int i=0; i<N; i++){
scanf("%d", &A[i]);
scanf("%d", &B[i]);
}
for (int i=0; i<3004; i++){
for (int j=0; j<3004; j++){
dp1[i][j]=-1;
dp2[i][j]=-1;
}
}
dp1[0][0]=0;
dp2[N][0]=0;
for (int i=0; i<N; i++){
//printf("i1=%d\n", i);
for (int j=0; j<=T; j++){
if (j>0) dp1[i+1][j]=std::max(dp1[i+1][j-1], dp1[i+1][j]);
if (dp1[i][j]!=-1){
if (j+A[i]<=T) dp1[i+1][j+A[i]]=std::max(dp1[i+1][j+A[i]], dp1[i][j]+B[i]);
dp1[i+1][j] = std::max(dp1[i+1][j], dp1[i][j]);
}
}
}
for (int i=N-1; i>=0; i--){
//printf("i2=%d\n", i);
for (int j=0; j<=T; j++){
if (j>0) dp2[i+1][j]=std::max(dp2[i+1][j-1], dp2[i+1][j]);
if (dp1[i+1][j]!=-1){
if (j+A[i]<=T) dp2[i][j+A[i]]=std::max(dp2[i][j+A[i]], dp2[i+1][j]+B[i]);
dp2[i][j] = std::max(dp2[i][j], dp2[i+1][j]);
}
}
}
int ans = -1;
for (int k=0; k<N; k++){
//printf("k=%d\n", k);
int cand = -1;
for (int j=1; j<T-1; j++){
int val1 = std::max(dp1[k][j], 0);
int val2 = std::max(dp2[k+1][T-j-1], 0);
cand = std::max(cand, val1+val2);
//if (val1+val2+B[k]>55) printf("k=%d, j=%d, %d + %d + B[%d](=%d)\n", k, j, dp1[k][j], dp2[k+1][T-j],k, B[k]);
}
ans = std::max(ans, cand+B[k]);
}
std::cout << ans << std::endl;
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <list>
#include <set>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using pii=pair<int,int>;
using vs=vector<string>;
using vpii=vector<pii>;
using si=set<int>;
#define REP(i,a) for(int i=0;i<a;i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rREP(i,a) for(int i=(a)-1;i>=0;i--)
#define rFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define out(S) cout<<(S)<<endl;
#define beginend(v) (v).begin(),(v).end()
#define IfOut(condition,text) if(condition){out(text);return 0;}
#define IfOutElse(condition,if_text,else_text) if(condition){out(if_text);return 0;}else{out(else_text);return 0;}
#define mod(s) ((s)%(ll)(1e9+7))
ll modpow(ll i, ll j) { ll tmp = 1; while (j) { if (j % 2)tmp = mod(tmp*i); i = mod(i*i); j /= 2; }return tmp; }
#define divmod(a,b) (mod(a*modpow((ll)b,(ll)(1e9+5))))
#define pb(i) push_back(i)
#define fst first
#define snd second
#define Foreach(item,collection) for(auto item:collection)
#define INF 1e10
#define removeAll(vec,deleg) auto itr=remove_if(beginend(vec),deleg);vec.erase(itr,vec.end());
void removeAt(string& s, int index) { s.erase(index, 1); }
template<typename T> void removeAt(vector<T>& v, int index) { v.erase(v.begin() + index); }
ll manhattanDistance(ll x1, ll y1, ll x2, ll y2) { return (abs(x2 - x1) + abs(y2 - y1)); }
vector<ll> sieveOfEratosthenes(int max) {ll prime;double sqrtmax = sqrt(max);vector<ll> primeVec, searchVec;FOR(i, 2, max + 1) searchVec.push_back(i);do{prime = searchVec[0];primeVec.push_back(prime);auto itr = remove_if(beginend(searchVec), [=](ll x)->bool {return x%prime == 0; });searchVec.erase(itr, searchVec.end());} while (prime < sqrtmax);primeVec.reserve(primeVec.size() + searchVec.size());primeVec.insert(primeVec.end(), beginend(searchVec));return primeVec;}
ll sum(vi v) {ll sum=0;Foreach(i,v){sum+=i;}return sum;}
#define ShowAll(v) Foreach(i,v) out(i);
int shouhi(int v,int x,int y){
double motone=(double)v*100.0/(100.0+x);
return motone*(100.0+y)/100.0;
}
int main(){
vi ans;
int m,nmin,nmax;
while (cin>>m>>nmin>>nmax,(m||nmin||nmax))
{
vi P(m);
REP(i,m)cin>>P[i];
int n=nmin-1,pmax=0;
FOR(i,nmin-1,nmax){
if(pmax<=P[i]-P[i+1]){
pmax=P[i]-P[i+1];
n=i;
}
}
ans.pb(n+1);
}
ShowAll(ans);
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define MOD(x) (x%(mod))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
/*---------------------------------------------------*/
int main(){
int m,mini,maxi,gap,ans;
int data[200];
while(cin>>m>>mini>>maxi){
if(m==0&&mini==0&&maxi==0)break;
rep(i,m)cin>>data[i];
ans=mini;gap=0;
for(int i=mini-1;i<=maxi-1;i++){
if(abs(data[i]-data[i+1])>=gap){
gap=abs(data[i]-data[i+1]);
ans=i+1;
}
}
cout<<ans<<endl;
}
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Dice{
public:
long top, front, right, left, back, bottom;
Dice(long top, long front, long right, long left, long back, long bottom);
void north();
void south();
void west();
void east();
void rightTurn();
void ChangeTop(long top);
};
Dice::Dice(long top, long front, long right, long left, long back, long bottom){
this->top = top;
this->front = front;
this->right = right;
this->left = left;
this->back = back;
this->bottom = bottom;
}
void Dice::north(){
long sv[6];
sv[0] = this->front;
sv[1] = this->bottom;
sv[2] = this->right;
sv[3] = this->left;
sv[4] = this->top;
sv[5] = this->back;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::south(){
long sv[6];
sv[0] = this->back;
sv[1] = this->top;
sv[2] = this->right;
sv[3] = this->left;
sv[4] = this->bottom;
sv[5] = this->front;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::west(){
long sv[6];
sv[0] = this->right;
sv[1] = this->front;
sv[2] = this->bottom;
sv[3] = this->top;
sv[4] = this->back;
sv[5] = this->left;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::east(){
long sv[6];
sv[0] = this->left;
sv[1] = this->front;
sv[2] = this->top;
sv[3] = this->bottom;
sv[4] = this->back;
sv[5] = this->right;
this->top = sv[0];
this->front = sv[1];
this->right = sv[2];
this->left = sv[3];
this->back = sv[4];
this->bottom = sv[5];
}
void Dice::rightTurn(){
long vs[4];
vs[0] = this->left;
vs[1] = this->right;
vs[2] = this->front;
vs[3] = this->back;
this->left = vs[2];
this->right = vs[3];
this->front = vs[1];
this->back = vs[0];
}
void Dice::ChangeTop(long top){
if (top == this->top) return;
else if (top == this->back) Dice::south();
else if (top == this->front) Dice::north();
else if (top == this->left) Dice::east();
else if (top == this->right) Dice::west();
else for (long i = 0; i < 2; i++) Dice::north();
return;
}
int main(){
bool judge = 1;
long n;
cin >> n;
//n = 4;
vector< vector<long> > roll(n);
for (long i = 0; i < n; i++){
roll[i].resize(6);
cin >> roll[i][0] >> roll[i][1] >> roll[i][2] >> roll[i][3] >> roll[i][4] >> roll[i][5];
}
/*
roll[0][0] = 1;
roll[0][1] = 2;
roll[0][2] = 3;
roll[0][3] = 4;
roll[0][4] = 5;
roll[0][5] = 6;
roll[1][0] = 1;
roll[1][1] = 2;
roll[1][2] = 3;
roll[1][3] = 4;
roll[1][4] = 5;
roll[1][5] = 7;
roll[2][0] = 6;
roll[2][1] = 2;
roll[2][2] = 3;
roll[2][3] = 4;
roll[2][4] = 5;
roll[2][5] = 1;
roll[3][0] = 2;
roll[3][1] = 4;
roll[3][2] = 5;
roll[3][3] = 6;
roll[3][4] = 3;
roll[3][5] = 1;
*/
for (long i = 0; i < n; i++){
for (long j = i + 1; j < n; j++){
long isum = 0, jsum = 0;
for (long k = 0; k < 6; k++){
isum += roll[i][k];
jsum += roll[j][k];
}
//cout << isum << " " << jsum << endl;
if (isum != jsum) continue;
Dice *di, *dj;
di = new Dice(roll[i][0], roll[i][1], roll[i][2], roll[i][3], roll[i][4], roll[i][5]);
dj = new Dice(roll[j][0], roll[j][1], roll[j][2], roll[j][3], roll[j][4], roll[j][5]);
di->ChangeTop(roll[0][0]);
dj->ChangeTop(roll[0][0]);
//cout << di->top << " " << dj->top << endl;
for (long k = 0; k < 3; k++) if (di->front != dj->front) dj->rightTurn();
//cout << di->front << " " << dj->front << endl;
if (di->top == dj->top && di->front == dj->front && di->right == dj->right && di->left == dj->left && di->back == dj->back && di->bottom == dj->bottom){
//cout << i << " " << j << endl;
judge = 0;
break;
}
delete di;
delete dj;
}
if (judge == 0) break;
}
if (judge == 1) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void dice_roll( int *dice, char i){
if( i == 'W'){
int tmp = dice[0];
dice[0] = dice[1];
dice[1] = dice[5];
dice[5] = dice[4];
dice[4] = tmp;
}
if( i == 'S'){
int tmp = dice[0];
dice[0] = dice[4];
dice[4] = dice[5];
dice[5] = dice[1];
dice[1] = tmp;
}
if( i == 'D'){
int tmp = dice[0];
dice[0] = dice[3];
dice[3] = dice[5];
dice[5] = dice[2];
dice[2] = tmp;
}
if( i == 'A'){
int tmp = dice[0];
dice[0] = dice[2];
dice[2] = dice[5];
dice[5] = dice[3];
dice[3] = tmp;
}
if( i == 'd'){
int tmp = dice[1];
dice[1] = dice[2];
dice[2] = dice[4];
dice[4] = dice[3];
dice[3] = tmp;
}
}
int checkdice(int *d1, int *d2){
int b = 0;
for(int i = 0; i < 4; i++){
dice_roll(d1, 'W');
for(int j = 0; j < 4; j++){
dice_roll(d1, 'D');
for(int k = 0; k < 4; k++){
dice_roll(d1, 'd');
if(d1[0]==d2[0]&&d1[1]==d2[1]&&d1[2]==d2[2]&&d1[3]==d2[3]&&d1[4]==d2[4]&&d1[5]==d2[5]){
return 1;
i=4;j=4;k=4;
b= 1;
}
}
}
}
if(b!=1)return 0;
}
int main(){
/*
0
3 1 2 4
5
*/
int n;
cin >> n;
int d[n][6];
string s = "Yes";
for(int i = 0; i < n; i++){
for(int j = 0; j< 6; j++) cin >> d[i][j];
}
for(int h = 0; h < n; h++){
for(int i = 0; i < n; i++){
int t1[] = { d[h][0],d[h][1],d[h][2],d[h][3],d[h][4],d[h][5] };
int t2[] = { d[i][0],d[i][1],d[i][2],d[i][3],d[i][4],d[i][5] };
if(h!=i){
int t = checkdice(t1,t2);
if(t==1){
s = "No";
}
}
}
}
cout << s <<endl;
return 0;
}
| 1 |
#include <algorithm>
#include <iostream>
#include <numeric>
using namespace std;
int main() {
int n, m, cost;
int p[1000];
while (true) {
cin >> n >> m;
if (n == 0) {
return 0;
}
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
sort(p, p + n);
cost = accumulate(p, p + n, 0);
for (int i = n - m; i >= 0; i -= m) {
cost -= p[i];
}
cout << cost << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <boost/tokenizer.hpp>
#include <boost/lexical_cast.hpp>
#include <vector>
#include <list>
using namespace std;
using namespace boost;
int main(int argc, char* argv[])
{
using sprtr = char_separator<char>;
using tknzr = tokenizer<sprtr>;
sprtr sep(" ", "", keep_empty_tokens);
int f, mf, mo;
string line;
while(1) {
int n, m;
{
getline(cin, line);
tknzr tkns(line, sep);
auto it = tkns.begin();
n = lexical_cast<int>(*it++);
m = lexical_cast<int>(*it);
}
if( n == 0 && m == 0 ) {
break;
}
list<int> ps;
{
getline(cin, line);
tknzr tkns(line, sep);
for( auto p : tkns ) {
//cout << p << endl;
ps.push_back(lexical_cast<int>(p));
}
}
ps.sort(greater<int>());
int div = n / m;
int mod = n % m;
int sum = 0;
auto it = ps.begin();
for( int i = 0; i < div; i++ ) {
for( int j = 0; j < m; j++ ) {
auto p = *it++;
if( j == m-1 ) continue;
sum += p;
}
}
if( mod ) {
for( int i = 0; i < mod; i++ ) {
auto p = *it++;
sum += p;
}
}
cout << sum << endl;
ps.clear();
}
return 0;
} | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) res.push_back(n / i);
}
}
return res;
}
int main() {
ll N, M;
cin >> N >> M;
vector<ll> divs = divisor(M);
ll ans = 1;
for (int i = 0; i < divs.size(); i++) {
if (M / divs[i] >= N) ans = max(ans, divs[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
bool cmp(P a, P b)
{
return a.first < b.first;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int N;
ll M;
cin >> N >> M;
if(N==1)
{
cout << M << endl;
return 0;
}
ll ans=0;
vector<P> div;
for(ll i=2; i*i<=M; i++)
{
ll cnt = 0;
if(M%i==0)
{
cnt=M/i;
div.push_back(P(i, cnt));
div.push_back(P(cnt, i));
}
}
sort(div.begin(), div.end(), cmp);
reverse(div.begin(), div.end());
rep(i, div.size())
{
if(div[i].second>=N)
{
cout << div[i].first << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
int n,t;
ll a[105],dp[105][105];
ll solve(int i,int j) {
if (i==j) return 0;
if (dp[i][j]) return dp[i][j];
dp[i][j]=INF;
for (int k=i+1;k<=j;k++)
dp[i][j]=min(dp[i][j],solve(i,k-1)+solve(k,j)+a[i]*a[k]*a[j+1]);
return dp[i][j];
}
int main() {
cin>>n;
for (int i=1;i<=n;i++) if (i==n) cin>>a[i]>>a[i+1];
else cin>>a[i]>>t;
solve(1,n);
cout<<dp[1][n]<<'\n';
}
| #include <bits/stdc++.h>
#define pb push_back
#define vii vector<int>
#define task "KMULT"
#define pll pair<ll, ll>
#define pii pair< ll, pair< ll, ll > >
#define fi first
#define se second
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll mod = 998244353;
using namespace std;
const int N = 6e5+5;
ll m, n, k, t, T, ans, u, v, tong;
ll a[N], b[N], st[N*4], lazy[N*4];
string s;
vector<ll> kq;
struct dang
{
ll l, r, pos;
} p[N];
bool cmp(const dang& X, const dang& Y)
{
return (X.r < Y.r) || (X.r == Y.r && X.l < Y.l);
}
void sol()
{
cin >> n;
pll q;
for(int i = 1; i <= n; i ++)
{
cin >> p[i].l >> p[i].r;
if(p[i].l > q.fi)
{
q.fi = p[i].l;
q.se = p[i].r;
}
else if(p[i].l == q.fi && p[i].r > q.se)q.se = p[i].r;
}
sort(p+1, p+1+n, cmp);
ans = p[1].r - p[1].l + 1;
for(int i = 1; i <= n; i ++)a[i] = max(a[i-1], p[i].l);
for(int i = 2; i <= n; i ++)
{
if(p[i].r <= q.se)
{
ans = max(ans, max((ll)0, p[i].r - q.fi + 1) + max((ll)0, p[1].r - a[i-1] +1 ) );
}
if(p[i].l != q.fi || p[i].r != q.se)ans = max(ans, max(p[1].r - q.fi + 1, (ll)0) + p[i].r - p[i].l + 1);
}
cout << ans;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen(task".INP", "r"))
{
freopen(task".INP","r",stdin);
freopen(task".OUT","w",stdout);
}
sol();
//cout << chap(4, 3);
}
| 0 |
#include <stdio.h>
int main(){
int x;
int y;
scanf("%d", &x);
y = x*x*x;
printf("%d\n", y);
} | #include <stdio.h>
#include <string.h>
int main() {
int angka1=0,angka2=0;
scanf("%d %d",&angka1,&angka2);
int hitung = 0;
hitung = angka1*angka2;
printf("%d\n",hitung);
return 0;
}
| 0 |
#include<cstdio>
int main(){
char str[20];
char c;
int i = -1;
scanf("%c", &c);
while(c - 10){
i++;
str[i] = c;
scanf("%c", &c);
}
for(; i >= 0; i--){
printf("%c", str[i]);
}
printf("\n");
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a, b, c,i,j;
cin >> a >> b >> c;
i = a;
a = b;
b = i;
j = a;
a = c;
c = j;
cout << a << " " << b << " " << c;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
map<int, int> mp;
int total_acs = 0;
rep(i,0,N-1) {
char c;
cin >> c;
if (S.back() == 'A' && c == 'C') {
total_acs++;
}
mp[i] = total_acs;
S.push_back(c);
}
vector<int> answers;
rep(i,0,Q-1) {
int l, r;
cin >> l >> r;
int answer = mp[r-1] - mp[l-1];
answers.push_back(answer);
}
for (int answer: answers)
cout << answer << endl;
return 0;
}
| #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
using namespace std;
const int N = 2e5 + 5;
using namespace std;
int main()
{
int n, q;
cin >> n >> q;
string s;
cin >> s;
int a[N];
a[0] = 1;
for (int i = 1; i < n; ++i)
{
if (s[i] == 'C' && s[i - 1] == 'A')
{
a[i] = a[i - 1] + 1;
}
else
{
a[i] = a[i - 1];
}
}
int l, r;
rep(i, q)
{
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int AB[2], CD[2], value;
for(int i = 0; i < 2; i++)
cin >> AB[i];
for(int i = 0; i < 2; i++)
cin >> CD[i];
sort(begin(AB), end(AB));
sort(begin(CD), end(CD));
value = AB[0] + CD[0];
cout << value << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main()
{
int A , B , C , D;
cin >> A >> B >> C >> D;
if ((A >= B) && (C >= D)) {cout << B + D;}
else if ((A <= B) && (C >= D)) {cout << A + D;}
else if ((A >= B) && (C <= D)) {cout << B + C;}
else if ((A <= B) && (C <= D)) {cout << A + C;}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int e;
while(cin >>e,e){
int ans=1000000;
for(int y=0;y*y<=e;y++){
for(int z=0;z*z*z<=e-y*y;z++){
int x=e-z*z*z-y*y;
ans = min(ans,x+y+z);
}
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end(), x) - v.begin(); }
TT void sort(T& v){ sort(v.begin(), v.end()); }
TT void revs(T& v){ reverse(v.begin(), v.end()); }
TT void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TT void show(T& v,char d=' ',char e='\n'){for(int i=0;i<v.size();++i)cout<<v[i]<<((i==v.size()-1)?e:d);}
TT void inpt(vector<T>& v,int n){ v.reserve(n);for(int i=0;i<n;++i){T x; cin>>x; v.push_back(x);} }
TT T In(){ T x; cin >> x; return x; }
static inline void fast_io(){ ios::sync_with_stdio(0); cin.tie(0); }
static inline int in(){ int x; scanf("%d", &x); return x; }
static inline string instr(){ string x; cin >> x; return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int main()
{
while (int e = in()){
int m = 1e8;
for (int z = 0; z <= 100; ++z){
for (int y = 0; y <= 1000; ++y){
int x = e - (sq(z) * z + sq(y));
if (x < 0) continue;
m = min(m, z + y + x);
}
}
printf("%d\n", m);
}
return (0);
} | 1 |
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <bitset>
#include <iterator>
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int MAXN = 2e5+50;
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define f first
#define s second
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,r,l) for(int i=r;i>=l;--i)
#define rep0(i,l,r) for(int i=l;i<r;++i
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
int solve(){
int n;
cin>>n;
vector<int> vec(n);
for(int i=0;i<n;++i)
cin>>vec[i];
set<int> st;
for(int i=0;i<vec.size();++i){
if(st.find(vec[i])==st.end()){
st.insert(vec[i]);
}
else
return 1;
}
return 0;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
if(solve()==1)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int counter[200005];
bool balls[200005];
bool picked[200005];
void solve(int k){
for(int i=1; i*i<=k; i++){
if(k%i==0){
counter[i]++;
if(i!=k/i) counter[k/i]++;
}
}
}
int main(){
int n;
cin>>n;
int ret = 0;
for(int i=1; i<=n; i++) cin>>balls[i];
for(int i=n; i>=1; i--){
if(balls[i] && counter[i]%2) continue;
if(!balls[i] && counter[i]%2==0) continue;
picked[i] = true;
ret++;
solve(i);
}
cout<<ret<<'\n';
for(int i=1; i<=n; i++){
if(picked[i]) cout<<i<<" ";
}
} | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
static const long long INFTY = (1LL << 32);
int main()
{
int n, m, p, q, r,i,j,k,a,b,cost,time;
long long cost_d[101][101], time_d[101][101];
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)break;
for (i = 1; i <= m; i++) {
for (j = 1; j <= m; j++) {
cost_d[i][j] = ((i == j) ? 0 : INFTY);
time_d[i][j] = ((i == j) ? 0 : INFTY);
}
}
for (i = 0; i < n; i++) {
cin >> a >> b >> cost >> time;
cost_d[a][b] = cost;
cost_d[b][a] = cost;
time_d[a][b] = time;
time_d[b][a] = time;
}
for (k = 1; k <= m; k++) {
for (i = 1; i <= m; i++) {
if (cost_d[i][k] == INFTY)continue;
for (j = 1; j <= m; j++) {
if (cost_d[k][j] == INFTY)continue;
cost_d[i][j] = min(cost_d[i][j], cost_d[i][k] + cost_d[k][j]);
time_d[i][j] = min(time_d[i][j], time_d[i][k] + time_d[k][j]);
}
}
}
cin >> k;
for (i = 0; i < k; i++) {
cin >> p >> q >> r;
if (r == 0) {
cout << cost_d[p][q]<<endl;
}
else {
cout << time_d[p][q] << endl;
}
}
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, t, r;
int n, a, b;
cin >> s >> n;
while (n--) {
cin >> t >> a >> b;
if (t == "print")
cout << s.substr(a, b - a + 1) << endl;
else if (t == "reverse")
reverse(s.begin() + a, s.begin() + b + 1);
else {
cin >> r;
s.replace(a, b - a + 1, r);
}
}
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int m; cin >> m;
vector<ll> d(m), c(m);
for(int i = 0; i < m; i++)cin >> d[i] >> c[i];
ll res = 0, ans = -1;
for(int i = 0; i < m; i++) {
res += c[i] * d[i];
ans += c[i];
}
while(res > 9) {
ans += res / 10;
res = res / 10 + (res % 10);
}
cout << ans << endl;
} | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int t[101];
int pri[26];
int res = 0;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int pr[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++)
{
pr[i] = i;
}
}
int parent(int x) {
if (x == pr[x]) return x;
return pr[x] = parent(pr[x]);
}
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py) return false;
if (px < py) {
pr[py] = px;
}
else {
pr[px] = py;
}
return true;
}
void solv() {
int n;
cin >> n;
uini(n);
pair<ll, int> xr[100010];
pair<ll, int> yr[100010];
for (size_t i = 1; i <= n; i++)
{
ll x, y;
cin >> x >> y;
xr[i] = pair<ll, int>(x, i);
yr[i] = pair<ll, int>(y, i);
}
sort(xr, xr + n + 1);
sort(yr, yr + n + 1);
map<ll, vector<pair<int, int>>> mx;
for (int i = 2; i <= n; i++)
{
ll rem = abs( xr[i].first - xr[i - 1].first);
mx[rem].push_back(pii(xr[i].second, xr[i - 1].second));
ll remy = abs(yr[i].first - yr[i - 1].first);
mx[remy].push_back(pii(yr[i].second, yr[i - 1].second));
}
ll res = 0;
for (map<ll, vector<pii>>::iterator i = mx.begin(); i != mx.end(); i++)
{
ll val = i->first;
vector<pii> v = i->second;
for (int j = 0; j < v.size(); j++)
{
if (unit(v[j].first, v[j].second)) {
res += val;
}
}
}
cout << res << endl;
}
int main() {
solv();
return 0;
}
| 0 |
#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#include<random>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
// #define int ll
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 1100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[4] ={1,0,-1,0} , dy[4] ={0,1,0,-1};
mat mul(mat &A, mat &B){
mat C(A.size(), vll(B[0].size()));
rep(i,A.size()){
rep(k,B.size()){
rep(j,B[0].size()){
C[i][j]=(C[i][j]^(A[i][k]&B[k][j]));
}
}
}
return C;
}
mat pow(mat A,ll n){
mat B(A.size(), vll(A.size()));
rep(i,A.size()){
B[i][i]=(1ll<<32)-1;
}
while(n>0){
if(n&1) B=mul(B,A);
A=mul(A,A);
n>>=1;
}
return B;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
string s;
cin>>s;
rep(i,s.size()-8){
cout<<s[i];
}
cout<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
int len = s.length();
for(int i = 0; i < len-8; i++){
cout << s[i];
}
cout << endl;
return 0;
} | 1 |
///FUCKOUT
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) for(int i = a; i < b; i++)
//#define endl '\n'
using ll = long long;
using db = long double;
using row = vector<int>;
using ii = pair<ll, ll>;
#define int ll
const int N = 2e5+5, M = 1e6 + 5, LG = 17, MOD = 1e6 + 3;
const int BLOCK = 55;
const int BLOCKN = N / BLOCK + 1;
const long double EPS = 1e-7;
using ull = unsigned long long;
ll t[N<<2];
ll tA[N<<2], tB[N<<2];
void upd(int node, int s, int e, int idx, ll v){
t[node] = min(t[node], v);
tA[node] = min(tA[node], v + idx);
tB[node] = min(tB[node], v - idx);
if(s==e)return;
int md = (s+e)>>1;
if(idx<=md)
upd(node<<1,s,md,idx,v);
else
upd(node<<1|1,md+1,e,idx,v);
}
ll qry(int node, int s, int e, int idx){
if(e < idx)return idx + tB[node];
if(s > idx)return tA[node] - idx;
if(s==e)return t[node];
int md = (s+e)>>1;
return min(qry(node<<1,s,md,idx),qry(node<<1|1,md+1,e,idx));
}
int32_t main(){
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif // ONLINE_JUDGE
memset(t,63, sizeof t);
memset(tA,63, sizeof tA);
memset(tB,63, sizeof tB);
int n, q, A, B;
cin >> n >> q >> A >> B;
upd(1, 1, n, A, 0);
int prv = B;
ll ans = 0;
while(q--){
int x;
cin >> x;
ll val = qry(1, 1, n, x) + ans;
ans += abs(x - prv);
upd(1, 1, n, prv, val - ans);
prv = x;
}
cout << ans+t[1]<<'\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int long long
int hmt() {int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';if(n) x=-x;return x;}
#define in hmt()
#define ins ({string x;char c=getchar();for(;c==' '||c=='\n';c=getchar());for(;c!=' '&&c!='\n';c=getchar()) x+=c;x;})
#define forinc(i,a,b) for(int i=a,_b=b;i<=_b;++i)
#define fordec(i,a,b) for(int i=a;i>=b;--i)
#define forb(i,BS) for(int i=BS._Find_first();i< BS.size();i = BS._Find_next(i))
#define forv(a,b) for(auto &a:b)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define reset(f,x) memset(f,x,sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define onbit(x,i) (x|(1<<(i-1)))
#define offbit(x,i) (x&~(1<<(i-1)))
const int N=200010;
int n,Q,A,B,a[N],oo,s[N],f[N],ans;
struct bit
{
int t[N];
void rs()
{
reset(t,127);oo=t[0];
}
void upd(int i,int x)
{
for(;i<=n;i+=i&-i) t[i]=min(t[i],x);
}
int get(int i)
{
int g=oo;
for(;i;i-=i&-i) g=min(g,t[i]);
return g;
}
}T[2];
void add(int i,int x)
{
T[0].upd(i,x-i);
T[1].upd(n-i+1,i+x);
}
main()
{
//freopen("C.inp","r",stdin);
n=in,Q=in,A=in,B=in;
forinc(i,1,Q) a[i]=in;
forinc(i,2,Q) s[i]=s[i-1]+abs(a[i]-a[i-1]);
T[0].rs();T[1].rs();
add(B,abs(A-a[1]));
add(A,abs(B-a[1]));
ans=s[Q]+min(abs(A-a[1]),abs(B-a[1]));
forinc(i,2,Q)
{
f[i]=min(T[0].get(a[i])+a[i],T[1].get(n-a[i]+1)-a[i])+s[i-1];
add(a[i-1],f[i]-s[i]);
ans=min(ans,f[i]+s[Q]-s[i]);
}
cout<<ans<<"\n";
}
| 1 |
#include<iostream>
using namespace std;
int main(void){
long long n,a[10000],min=1000000,max=-1000000,sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<min){min=a[i];}
if(a[i]>max){max=a[i];}
sum=a[i]+sum;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
const ll INF=1e9+7;
int main(){
ll n;
cin >> n ;
vector<string> a(3);
rep(i,3){
cin >> a[i];
}
ll ans=0;
rep(i,n){
set<char> s;
rep(j,3){
s.insert(a[j][i]);
}
ans+=s.size()-1;
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200001
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int64_t> a(n), dp(n), os(n);
for (auto &i: a) cin >> i;
for (int i = 0; i < n; ++i) {
os[i] = (i ? os[i-1] : 0) + (i % 2 ? 0 : a[i]);
}
for (int i = 0; i < n; ++i) {
if (i) dp[i] = a[i] + (i > 1 ? dp[i-2] : 0);
if (i % 2) {
dp[i] = max(dp[i], os[i-1]);
} else if (i){
dp[i] = max(dp[i], dp[i-1]);
}
}
cout << dp[n-1];
} | #include <bits/stdc++.h>
#define sp ' '
#define nyan "(=^・ω・^=)"
#define mkp make_pair
#define intmax 2147483647
#define llmax 9223372036854775807
#define lP pair<ll,ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
const int mod = 1000000007;
int N, A, B, C, D;
ll DP[1001], E869120[1001];
ll pw(ll x, int y) {
ll a = 1;
while (y) {
if (y & 1)
a = a * x%mod;
x = x * x%mod;
y >>= 1;
}
return a;
}
ll modinv(ll x) {
return pw(x, mod - 2);
}
int main() {
cin >> N >> A >> B >> C >> D;
DP[0] = 1;
E869120[0] = 1;
for (int i = 1; i != N + 1; ++i)
E869120[i] = E869120[i - 1] * i%mod;
for (int i = A; i != B + 1; ++i) {
for (int j = N; j != -1; --j) {
for (int k = C; k != D + 1 && j + i * k <= N; ++k) {
DP[j + i * k] = (DP[j + i * k] + DP[j] * E869120[N - j] % mod*modinv(E869120[i*k] * E869120[N - j - i * k] % mod*pw(E869120[i], k) % mod*E869120[k] % mod) % mod*E869120[i*k]) % mod;
}
}
}
cout << DP[N] << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
// #define multicase
const int MOD = 1e9 + 7;
const int INF = 2e9;
const int N = 2e5 + 5;
int x;
void solve() {
int T = 1;
#ifdef multicase
cin >> T;
#endif
while(T--) {
cin >> x;
cout << (x < 1200 ? "ABC\n" : x < 2800 ? "ARC\n" : "AGC\n");
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int r; cin>>r;
if(r<1200) cout<<"ABC"<<endl;
else if(r<2800)cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(0.0)
#define ll long long
#define f first
#define s second
#define gap ' '
#define pb push_back
#define mod 1000000007
int main()
{
ll n,m;
cin>>n>>m;
ll x[n+5],y[m+5];
for(int i=0;i<n;i++)
{
cin>>x[i];
}
for(int i=0;i<m;i++)
{
cin>>y[i];
}
sort(x,x+n);
sort(y,y+m);
ll xx=0;
ll yy=0;
for(int i=0;i<n;i++)
{
xx+=(i-(n-1))*x[i]+i*x[i];
//cout<<xx<<endl;
}
for(int i=0;i<m;i++)
{
yy+=(i-(m-1))*y[i]+i*y[i];
}
ll ans=((xx%mod)*(yy%mod))%mod;
cout<<ans;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 2000000000;
int main() {
long n;
cin >> n;
long a[n];
for(int i = 0; i < n; i++)
cin >> a[i];
long sum[n];
sum[n-1] = a[n-1];
for(int i = n-2; i >= 0; i--)
sum[i] = sum[i+1] + a[i];
long ans = 0;
for(int i = 0; i < n-1; i++)
ans += (sum[i+1] % mod * a[i]) % mod;
cout << ans % mod << endl;
} | 0 |
#include <bits/stdc++.h>
#define len(x) ((int)(x).size())
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
// [
// (count_WA_before_passed, is_passed)
// ]
vector<pair<int, bool>> contest_result(105000, make_pair(0, false));
int WA_count = 0;
int AC_count = 0;
while (M--) {
int p;
string S;
cin >> p >> S;
if (contest_result[p].second) continue;
if (S == "AC") {
contest_result[p].second = true;
AC_count++;
WA_count += contest_result[p].first;
} else if (S == "WA") {
contest_result[p].first++;
}
}
cout << AC_count << " " << WA_count << endl;
}
| #include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n, q, m, d;
int mxd=0;
set<int> s[50];
int date=0;
cin >> n >> q;
if(!(n||q)) break;
--q;
for(int i=0;i<n;++i){
cin >> m;
for(int j=0;j<m;++j){
cin >> d;
s[i].insert(d);
mxd = max(mxd, d);
}
}
for(int i=1;i<=mxd;++i){
int cnt=0;
for(int j=0;j<n;++j){
if(s[j].find(i)!=s[j].end()) ++cnt;
}
if(q<cnt){
q = cnt;
date = i;
}
}
cout << date << endl;
}
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, x, t;
cin >> n >> x >> t;
cout << (n+(x-1))/x*t << endl;
return 0;
} | /**
* ABC042 C
*
* @date 2020.05.03
* @author 焼き鮭 <[email protected]>
*/
#include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
int target;
bool *disallow;
bool is_ok(int target)
{
int remain_size = std::to_string(target).length();
while (remain_size != 0)
{
int d = target % 10;
if (disallow[d])
{
return false;
}
target = target / 10;
remain_size -= 1;
}
return true;
}
int main(int argc, char const *argv[])
{
int k;
std::cin >> target;
std::cin >> k;
disallow = (bool *)malloc(k * sizeof(bool));
for (int i = 0; i < k; i++)
{
int tmp;
std::cin >> tmp;
disallow[tmp] = true;
}
int ans = target;
while (true)
{
if (is_ok(ans))
{
break;
}
ans++;
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> m;
vector<ll> x(n), y(m);
for(i = 0; i < n; i++) {
cin >> x[i];
}
for(i = 0; i < m; i++) {
cin >> y[i];
}
ll retx = 0;
for(k=0;k<n;k++){
retx = (retx + k*x[k] - (n-1-k)*x[k])%MOD;
}
ll rety=0;
for(k = 0; k < m; k++) {
rety = (rety + k * y[k] - (m - 1 - k) * y[k]) % MOD;
}
cout << (rety*retx)%MOD << endl;
return 0;
} | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <assert.h>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <complex>
#include <iomanip>
#include <stack>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
ll mod=1e9+7;
double eps=1e-7;
ll exp(ll x,ll y){if(y<0) return 0; ll ret=1;for(;y;y>>=1,x=(x*x)%mod){if(y&1)ret=(ret*x)%mod;}return ret;}
ull pexp(ull x,ull y){if(y<0) return 0; ull ret=1; for(;y;y>>=1,x=(x*x)){if(y&1)ret=(ret*x);}return ret;}
ll gcd(ll x,ll y){if(!x||!y) return x+y; return x%y==0?y:gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll bsum(ll u,ll b){ll ret=0;if(u<b)return u;while(u){ret+=u%b;u/=b;}return ret;}
ll prival(ll u,ll p){ll cn=0;while(u%p==0){cn++;u=u/p;}return cn;}
ll minv(ll a,ll b){return 1<a?b-minv(b%a,a)*b/a:1;}
ll extm(ll a,ll b){ll ret=0;while(a!=0){if(a%2==1){ret+=b;ret%=mod;}a>>=1;b=(2*b)%mod;}return ret;}
ll eaphi(ll x){ll t=x,ret=x,i;for(i=2;i*i<=x;i++){if(t%i==0){ret-=ret/i;while(t%i==0) t/=i;}}if(t!=1) ret-=ret/t;return ret;}
ll eadivc(ll x){ll ret=0;ll i;for(i=1;i*i<=x;i++){if(x%i==0 && i*i!=x) ret+=2;if(x%i==0 && i*i==x) ret+=1;}return ret;}
ll eadivs(ll x){ll ret=0;ll i;for(i=1;i*i<=x;i++){if(x%i==0 && i*i!=x) ret+=i+x/i;if(x%i==0 && i*i==x) ret+=i;}return ret;}
ll ndig(ll x, ll b){ll ret=0;while(x){x/=b; ret++;}return ret;}
ll rev(ll n, ll b){ll ret=0;while(n){ret=b*ret+n%b; n/=b;}return ret;}
ll sq(ll x){ll t=(ll)sqrt(x); for(ll i=t-2 ; i<=t+2 ; i++) if(i*i==x) return abs(i); return -1;}
ll extexp(ll x,ll y){if(y<0) return 0; ll ret=1;for(;y;y>>=1,x=extm(x,x)){if(y&1)ret=extm(ret,x);}return ret;}
bool isprime(ll x){if(x<=1) return false; for(ll i=2;i*i<=x;i++){if(x%i==0){return false;}}return true;}
ll ans, x, y, n, m;
ll u[111111], v[111111];
int main(void)
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>m; int i;
for(i=1 ; i<=n ; i++) cin>>u[i];
for(i=1 ; i<=m ; i++) cin>>v[i];
for(i=1 ; i<=n ; i++) x+=((mod+2LL*i-n-1)*(mod+u[i]))%mod;
for(i=1 ; i<=m ; i++) y+=((mod+2LL*i-m-1)*(mod+v[i]))%mod;
x%=mod; y%=mod; cout<<(x*y)%mod; return 0;
}
// it may be easier than you think
// it may be harder than you think
// ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); | 1 |
#include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#define gc() (((ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin)),ib==ob)?-1:*ib++)
inline int read() {
int ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch)) f^=ch=='-',ch=gc();
while(isdigit(ch)) ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
}
inline ll readl() {
ll ans=0;
bool f=1;
char ch=gc();
while(!isdigit(ch)) f^=ch=='-',ch=gc();
while(isdigit(ch)) ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return f?ans:-ans;
}
inline int Read(char*s) {
int tp=0;
char ch=gc();
while(!isdigit(ch)&&!isalpha(ch)) ch=gc();
while(isdigit(ch)||isalpha(ch)) s[++tp]=ch,ch=gc();
return tp;
}
namespace modular {
const int mod=1e9+7;
inline int add(int a,int b) { return a+b<mod?a+b:a+b-mod; }
inline int dec(int a,int b) { return a<b?a-b+mod:a-b; }
inline int mul(int a,int b) { return (ll)a*b%mod; }
inline void Add(int&a,int b) { a=a+b<mod?a+b:a+b-mod; }
inline void Dec(int&a,int b) { a=a<b?a-b+mod:a-b; }
inline void Mul(int&a,int b) { a=(ll)a*b%mod; }
inline int ksm(int a,int p) { int ret=1;for(;p;p>>=1,Mul(a,a)) (p&1)&&(Mul(ret,a),1);return ret; }
inline int Inv(int a) { return ksm(a,mod-2); }
inline int sqr(int a) { return mul(a,a); }
inline int cub(int a) { return (ll)a*a%mod*a%mod; }
}
using namespace modular;
template<typename T> inline void ckmax(T&a,T b) { a<b?a=b:0; }
template<typename T> inline void ckmin(T&a,T b) { a>b?a=b:0; }
template<typename T> inline T gcd(T a,T b) { T t;while(b)t=a,a=b,b=t-t/a*a;return a; }
template<typename T> inline T Abs(T x) { return x<0?-x:x; }
inline int rd() { return rand()|(rand()<<15); }
const int N=5e5+5;
int n,pre[N],suf[N];
pii a[N];
int main() {
#ifdef ldxcaicai
freopen("lx.in","r",stdin);
#endif
n=read();
for(ri i=1;i<=n;++i) a[i].fi=read(),a[i].se=read();
sort(a+1,a+n+1);
pre[0]=0x3f3f3f3f,suf[n]=0x3f3f3f3f;
for(ri i=1;i<n;++i) pre[i]=min(pre[i-1],a[i].se);
for(ri i=n-1;i;--i) suf[i]=min(suf[i+1],a[i].se);
int res=0;
for(ri mn,r1,r2,t,i=1;i<n;++i) {
r1=a[i].se,r2=min(max(suf[i+1],a[n].fi-1),a[n].se);
t=(r1-a[i].fi+1)+(r2-a[n].fi+1);
mn=pre[i-1];
ckmax(res,t-max(0,min(r1-max(a[i].fi-1,mn),r2-max(a[n].fi-1,mn))));
}
cout<<res;
return 0;
} | /*
* @Author: RBQRBQ
* @Date: 2020-04-05 15:08:15
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-04-05 19:16:50
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll,ll> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
x=x*f;
}
}
using namespace IO;
vector<pii> pp;
vector<pii> T;
ll mxL,minR,mxR,minL;
int main()
{
int N;
cin>>N;
mxL=mxR=-1;
minL=minR=10000000000ll;
int P,Q;
for(int i=1;i<=N;i++)
{
ll x,y;
read(x),read(y);
y++;
pp.push_back(make_pair(x,y));
if(x>mxL)
{
mxL=x;
P=i;
}
if(minR>y)
{
minR=y;
Q=i;
}
}
ll ans1=0,ans2=0;
minL=0;
for(int i=1;i<=N;i++)
{
minL=max(minL,pp[i-1].second-pp[i-1].first);
}
ans1=max((minL),0ll)+max((minR-mxL),0ll);
int ca=1;
for(auto p:pp)
{
if(ca!=P&&ca!=Q)
T.push_back(make_pair(max(p.second-mxL,0ll),max(minR-p.first,0ll)));
ca++;
}
sort(T.begin(),T.end());
ll P1=pp[P-1].second-pp[P-1].first;
ll Q1=pp[Q-1].second-pp[Q-1].first;
ll x1=0,x2=Q1;
// for(auto p:T)
// {
// cout<<p.first<<" "<<p.second<<endl;
// }
for(int i=0;i<T.size();i++)
{
x1=min(T[i].first,P1);
ans2=max(ans2,x1+x2);
x2=min(T[i].second,x2);
}
ans2=max(ans2,P1+x2);
cout<<max(ans1,ans2);
} | 1 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
map<int, int> m;
int ans = 0;
for (int i = 0; i < N; i++) {
int A;
scanf("%d", &A);
if (m[A] == 1) {
m[A] = 0;
ans--;
} else {
m[A] = 1;
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll prev = 0;
vector<ll> A(5);
ll k;
rep(i, 5) cin >> A[i];
cin >> k;
rep(i, 4) {
rep2(j, i + 1, 5) {
if(A[j] - A[i] > k) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
return 0;
}
| 0 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int count = 1000000;
for (int i = 0; i < count; i++) {
int e = 0;
cin >> e;
if (e == 0){
return 0;
}
int min = e;
for (int z = 0; z*z*z <= e; z++) {
for (int y = 0; y*y <= e - z*z*z; y++) {
int x = e - y*y - z*z*z;
int m = x + y + z;
if (m < min){
min = m;
}
}
} //
cout << min << endl;
} //
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <initializer_list>
using namespace std;
int main()
{
int m, e, y, z;
int min;
while (cin >> e, e) {
m = min = 1000000;
for (z = 0; z <= 100; z++) {
if (z*z*z > e)
break;
for (y = 0; y <= 1000; y++) {
if (y*y + z*z*z > e) {
y--;
m = y + z + (e-y*y-z*z*z);
min = m < min ? m : min;
break;
}
}
}
cout << min << endl;
}
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[n], b[n], c[n];
for(int i=0; i<n; i++) cin >> a[i];
for(int i=0; i<n; i++) cin >> b[i];
for(int i=0; i<n; i++) cin >> c[i];
sort(a, a+n);
sort(b, b+n);
sort(c, c+n);
ll ans = 0;
for(ll i=0; i<n; i++){
ll u = upper_bound(a, a+n, b[i]-1) - a;
ll l = lower_bound(c, c+n, b[i]+1) - c;
ans += u * (n-l);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
int A[3][100001];
LL dp[3][100001] = {};
int main() {
scanf("%d", &N);
rep(j, 3) { rep(i, N) scanf("%d", &A[j][i]); A[j][N] = 1000000001; }
rep(j, 3) sort(A[j], A[j] + N);
rep(i, N + 1) dp[0][i] = i;
rep(j, 2) {
int p = 0;
rep(i, N) {
while (A[j][p] < A[j + 1][i]) p++;
dp[j + 1][i + 1] += dp[j + 1][i] + dp[j][p];
}
}
printf("%lld\n", dp[2][N]);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
class dice{
public:
int init_label[6];
int label[6];
int tmp1, tmp2;
int order[4] = {1,2,4,3};
void setnumber(){
for(int i=0; i<6; i++)
cin >> init_label[i];
}
int check(int over, int front, int right, int left, int back, int bottom){
for(int i=0; i<4; i++){
if(over == label[0] && front == label[order[i]] && right == label[order[(i+1)%4]] && back == label[order[(i+2)%4]] && left == label[order[(i+3)%4]] && bottom == label[5]){
cout << "No" << endl;
return 1;
}
}
return 0;
}
void rotation(string sign){
tmp1 = label[0];
tmp2 = label[5];
if(sign == "N"){
label[0] = label[1];
label[5] = label[4];
label[1] = tmp2;
label[4] = tmp1;
}
if(sign == "S"){
label[0] = label[4];
label[5] = label[1];
label[4] = tmp2;
label[1] = tmp1;
}
if(sign == "W"){
label[0] = label[2];
label[5] = label[3];
label[2] = tmp2;
label[3] = tmp1;
}
if(sign == "E"){
label[0] = label[3];
label[5] = label[2];
label[3] = tmp2;
label[2] = tmp1;
}
if(sign == "NN"){
label[0] = tmp2;
label[5] = tmp1;
int tmp3 = label[4];
label[4] = label[1];
label[1] = tmp3;
}
}
void initialization(void){
for(int i=0; i<6; i++){
label[i] = init_label[i];
}
}
};
int main(){
int n; cin >> n;
vector<dice> d(n);
for(int i=0; i<n; i++){
d[i].setnumber();
}
string rot_info[6] = {"","N","W","E","S","NN"};
int flag=0;
for(int i=0; i<n; i++){
d[i].initialization();
for(int k=i+1; k<n; k++){
for(int j=0; j<6; j++){
d[k].initialization();
d[k].rotation(rot_info[j]);
flag = d[k].check(d[i].label[0],d[i].label[1],d[i].label[2],d[i].label[3],d[i].label[4],d[i].label[5]);
if(flag == 1)
break;
}
if(flag == 1)
break;
}
if(flag == 1)
break;
}
if(flag == 0)
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
map<ll, ll> verts;
pair<ll, ll> prev = {-1, 0};
ll ans = 1;
cin >> N;
rep(i, N) {
ll temp;
cin >> temp;
if(i == 0 && temp != 0) {
cout << 0 << endl;
return 0;
}
verts[temp]++;
}
if(verts[0] > 1) {
cout << 0 << endl;
return 0;
}
iter(i, verts) {
if(i.first - prev.first != 1) {
cout << 0 << endl;
return 0;
}
if(i.first != 0) {
rep(j, i.second) (ans *= prev.second) %= 998244353LL;
}
prev = i;
}
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
long long nexta[18][100001];
long long arr(long long from, long long days){
long long shisu=0;
while(days>0){
if(days%2==1){
from=nexta[shisu][from];
}
days/=2;
shisu++;
}
return from;
}
int main(){
//input
long long N;
cin >> N;
long long x[N+1];
long long i,j;
for(i=1; i<=N; i++){
cin >> x[i];
}
long long L;
cin >> L;
long long Q;
cin >> Q;
long long a[Q+1], b[Q+1];
for(i=1; i<=Q; i++){
cin >> a[i] >> b[i];
if(a[i]>b[i]) swap(a[i],b[i]);
}
//calc
for(i=1; i<=N; i++){
j=lower_bound(x+1,x+N+1,x[i]+L)-x;
if(j>N){
nexta[0][i]=N;
continue;
}
if(x[i]+L<x[j]){
j--;
}
nexta[0][i]=j;
}
for(i=1; i<18; i++){
for(j=1; j<=N; j++){
nexta[i][j]=nexta[i-1][nexta[i-1][j]];
}
}
long long ans[Q+1];
long long lef, rig, mid;
long long arrarr, arrarrarr;
for(i=1; i<=Q; i++){
lef=0;
rig=N;
while(lef<rig-1){
mid=(lef+rig)/2;
arrarr=arr(a[i],mid-1);
if(arrarr>=b[i]){
rig=mid;
}else{
lef=mid;
}
}
ans[i]=lef;
}
//output
for(i=1; i<=Q; i++){
cout << ans[i] << endl;
}
system("pause");
return 0;
} | /*
* Author : Andrew J
*/
#include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 1050;
#define singleCase
// #define multipleCase
int n,m,a,b;
string grid[N];
void work() {
cin >> n >> m >> a >> b;
string s = "";
for (int i = 1 ; i <= a ; i++) {
s += "1";
}
for (int i = 1 ; i <= m - a ; i++) {
s += "0";
}
for (int i = 1 ; i <= b ; i++) {
grid[i] = s;
}
for (int i = 0 ; i < m ; i++) {
s[i] = s[i] == '0' ? '1' : '0';
}
for (int i = b + 1 ; i <= n ; i++) {
grid[i] = s;
}
for (int i = 1 ; i <= n ; i++) {
for (int j = 0 ; j < m ; j++) {
printf("%c" , grid[i][j]);
} puts("");
}
return;
}
int main() {
#ifdef multipleCase
int nQ; in(nQ);
while (nQ--)
work();
#endif
#ifdef singleCase
work();
#endif
return 0;
}
void in(int &x) {
bool neg = false;
register int c;
x = 0;
c = getchar();
if(c == '-') {
neg = true;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar())
x = (x << 1) + (x << 3) + c - 48;
if (neg) x *= -1;
}
| 0 |
#include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<class T>il read(T &x){
int f=1;char k=getchar();x=0;
for(;k>'9'||k<'0';k=getchar()) if(k=='-') f=-1;
for(;k>='0'&&k<='9';k=getchar()) x=x*10+k-'0';
x*=f;
}
template<class T>il _print(T x){
if(x>=10) _print(x/10);
putchar(x%10+'0');
}
template<class T>il print(T x){
if(x<0) putchar('-'),x=-x;
_print(x);
}
ll mul(ll a,ll b,ll mod){long double c=1.;return (a*b-(ll)(c*a*b/mod)*mod)%mod;}
it qpow(int x,int k,int mod){
int res=1,bas=x;
while(k){
if(k&1) res=1ll*res*bas%mod;
bas=1ll*bas*bas%mod,k>>=1;
}
return res;
}
const int N = 2e5+5,mod = 1e9+7;
it add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
it mul(int x,int y){return 1ll*x*y%mod;}
il inc(int &x,int y){x=add(x,y);}
int n,m,k,ans,fac[N],ifac[N];
it C(int n,int m){return mul(mul(ifac[n-m],ifac[m]),fac[n]);}
int main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
read(n),read(m),read(k),fac[0]=1;
for(ri i=1;i<=n*m;++i) fac[i]=mul(fac[i-1],i);
ifac[n*m]=qpow(fac[n*m],mod-2,mod);
for(ri i=n*m-1;i>=0;--i) ifac[i]=mul(ifac[i+1],i+1);
for(ri i=1;i<=n-1;++i) inc(ans,mul(mul(mul(m,m),n-i),i));
for(ri i=1;i<=m-1;++i) inc(ans,mul(mul(mul(n,n),m-i),i));
print(mul(ans,C(n*m-2,k-2)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n;
char s[maxn];
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac(int x) { ll ret = 1; for(int i = 1; i <= x; ++i) ret = ret * i % mod; return ret;}
ll f(int i, int j)
{
if(i == 0) return j == 0;
if(s[i] == 'B')
{
if(j & 1)
return f(i - 1, j - 1);
else
return f(i - 1, j + 1) * (j + 1) % mod;
}
else
{
if(j & 1)
return f(i - 1, j + 1) * (j + 1) % mod;
else if(j > 0)
return f(i - 1, j - 1);
else
return 0;
}
}
int main()
{
scanf("%d", &n);
scanf("%s", s + 1);
cout << f(2 * n, 0) * fac(n) % mod << endl;
return 0;
} | 0 |
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>
typedef long long ll;
using namespace std;
char field[12][12];
void dfs(int x, int y){
field[x][y] = '0';
for(int dx=-1; dx<=1; ++dx){
for(int dy=-1; dy<=1; ++dy){
if(dx != 0 && dy != 0) continue;
int nx = x+dx, ny = y+dy;
if(0 <= nx && nx < 12 && 0 <= ny && ny < 12 && field[nx][ny] == '1'){
dfs(nx,ny);
}
}
}
}
int main(void){
while(1){
if(cin >> field[0][0] == 0) break;
for(int i=0; i<12; ++i){
for(int j=0; j<12; ++j){
if(i==0&&j==0)continue;
cin >> field[i][j];
}
}
int count = 0;
for(int i=0; i<12; ++i){
for(int j=0; j<12; ++j){
if(field[i][j] == '1'){
dfs(i, j);
count++;
}
}
}
cout << count << endl;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <fstream>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
#define INF 1000000000
int main(){
int m,mi,mx;
while(cin>>m>>mi>>mx, m){
vector<int> p(m);
rep(i,m) cin>>p[i];
sort(all(p), greater<int>());
int n, gap=0;
for(int i=mi-1; i<mx; i++){
if(p[i]-p[i+1] >= gap){
n=i+1;
gap = p[i]-p[i+1];
}
}
cout<<n<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) { // 発見できたとき
return 1;
}
else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
ll N, M; cin >> N >> M;
vector<pair<int, int>> ans(N + 1); // 提出数と0, 1の正解か不正解か
REP(i, M) {
int p; string S; cin >> p >> S;
if(S == "WA" && ans[p].second == 0) ans[p].first++;
else if(S == "AC") ans[p].second = 1;
}
ll res = 0; ll pena = 0;
REP(i, N + 1) {
if(ans[i].second == 1) {
res++;
pena += ans[i].first;
}
}
cout << res << " " << pena << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct UnionFind {
//各要素が属する集合の代表(根)を管理する
//もし、要素xが根であればdata[x]は負の値を取り、-data[x]はxが属する集合の大きさに等しい
vector<int> data;
UnionFind(int sz) : data(sz, -1) {}
bool unite(int x, int y) {
x = find(x);
y = find(y);
bool is_union = (x != y);
if (is_union) {
if (data[x] > data[y]) swap(x, y);
data[x] += data[y];
data[y] = x;
}
return is_union;
}
int find(int x) {
if (data[x] < 0) { //要素xが根である
return x;
} else {
data[x] = find(data[x]); //data[x]がxの属する集合の根でない場合、根になるよう更新される
return data[x];
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return -data[find(x)];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K, L;
cin >> n >> K >> L;
UnionFind uf1(n), uf2(n);
for (int i = 0; i < K; i++) {
int p, q;
cin >> p >> q;
p--; q--;
uf1.unite(p, q);
}
for (int i = 0; i < L; i++) {
int p, q;
cin >> p >> q;
p--; q--;
uf2.unite(p, q);
}
map<P, int> memo;
vector<P> v;
for (int i = 0; i < n; i++) {
P tar(uf1.find(i), uf2.find(i));
v.push_back(tar);
memo[tar]++;
}
for (int i = 0; i < n; i++) {
cout << memo[v[i]] << " \n"[i + 1 == n];
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
struct person{
long long h;
long long p;
};
int main(){
int n;
int ans=0;
std::vector<person> list;
std::vector<long long> dpList;
std::cin>>n;
list.resize(n);
dpList.resize(n+1, -1);
dpList[0]= 0;
for(int i=0; i<n; i++)
std::cin>>list[i].h>>list[i].p;
std::stable_sort(list.begin(), list.end(), [](const person& x, const person& y){return x.p+ x.h< y.p + y.h;});
for(int i=0; i<n; i++){
for(int j=i; j>=0; j--){
if(dpList[j]==-1)
continue;
if(dpList[j]>list[i].h)
continue;
if(dpList[j+1]==-1)
dpList[j+1]=dpList[j]+list[i].p;
else
dpList[j+1]=std::min(dpList[j]+list[i].p, dpList[j+1]);
}
}
for(int i=n; i>=0; i--){
if(dpList[i]!=-1){
ans= i;
break;
}
}
std::cout<<ans<<std::endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << x << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
bool srt(pi a, pi b){
return a.e1+a.e2 < b.e1+b.e2;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;
sc(n);
pi a[n];
FORR(i,a)
sc(i.e1,i.e2);
sort(a,a+n,srt);
ll dp[n+1];
ll LINF = 1e18;
FORR(i,dp)
i = LINF;
dp[0] = 0;
FORR(i,a){
/* whatis(i) */
for(int x = n-1; x >= 0; --x){
/* whatis(x) */
/* whatis(dp[x]) */
if(dp[x] == LINF) continue;
if(dp[x] > i.e1) continue;
/* if(dp[ */
dp[x+1] = min(dp[x+1],dp[x]+i.e2);
}
}
for(int i = n+1; --i;)
if(dp[i] != LINF) REE(i)
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
while(N%111!=0){
N++;
}
cout << N << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int hundred = N / 100;
int ten = N / 10 % 10;
int one = N % 100 % 10;
if (hundred < ten) {
cout << (hundred + 1) * 111 << endl;
}
else if (hundred >= ten && hundred >= one) {
cout << hundred * 111 << endl;
}
else {
cout << (hundred + 1) * 111 << endl;
}
}
| 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
const long double eps = 1e-12;
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*2
#define REP(a,b) for(long long a = 0;a < b;++a)
long long bad[700][700] = {};
vector<pair<int,int>> vertexs[2][700][700];
int visited[2][700][700];
int coloring[2][700][700];
int main() {
long long n, d[2];
cin >> n;
REP(q, 2) {
cin >> d[q];
}
REP(itr, 2) {
for (long long a = 0; a * a <= d[itr]; ++a) {
long long b = sqrt(d[itr] - a * a);
if (b * b + a * a != d[itr]) continue;
for (int q = 0; q < 2 * n; ++q) {
for (int j = 0; j < 2 * n; ++j) {
if (bad[q][j] == 1) continue;
int xe[4] = { 1,1,-1,-1 };
int ye[4] = { 1,-1,1,-1 };
REP(t, 4) {
int now_x = q + xe[t] * a;
int now_y = j + ye[t] * b;
if (now_x >= 0 && now_x < 2 * n && now_y >= 0 && now_y < 2 * n) {
if (bad[now_x][now_y] == 1) continue;
vertexs[itr][q][j].push_back(make_pair(now_x, now_y));
vertexs[itr][now_x][now_y].push_back(make_pair(q, j));
}
}
}
}
}
for (int q = 0; q < 2 * n; ++q) {
for (int j = 0; j < 2 * n; ++j) {
if (visited[itr][q][j] == 0 && bad[q][j] == 0) {
queue<pair<int, int>> next;
next.push(make_pair(q, j));
visited[itr][q][j] = 1;
vector<pair<int, int>> used;
int cnt[2] = {};
while (next.empty() == false) {
pair<int, int> now = next.front();
next.pop();
used.push_back(now);
REP(i, vertexs[itr][now.first][now.second].size()) {
pair<int, int> going = vertexs[itr][now.first][now.second][i];
if (visited[itr][going.first][going.second] == 0) {
visited[itr][going.first][going.second] = 1;
coloring[itr][going.first][going.second] = (coloring[itr][now.first][now.second] + 1) % 2;
cnt[coloring[itr][going.first][going.second]]++;
next.push(going);
}
}
}
int yusen = 1;
if (cnt[0] < cnt[1]) {
yusen = 0;
}
REP(q, used.size()) {
if (coloring[itr][used[q].first][used[q].second] == yusen) {
bad[used[q].first][used[q].second] = 1;
}
}
}
}
}
}
int cnt = 0;
REP(q, 2 * n) {
REP(j, 2 * n) {
if (bad[q][j] == 0) {
cnt++;
if (cnt <= n * n) {
cout << q << " " << j << endl;
}
}
}
}
} | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#define SZ(x) ((int)x.size())
using namespace std;
inline LL read()
{
LL f=1,x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int stack[20];
template<typename T>inline void write(T x)
{
if(x<0){putchar('-');x=-x;}
if(!x){putchar('0');return;}
int top=0;
while(x)stack[++top]=x%10,x/=10;
while(top)putchar(stack[top--]+'0');
}
template<typename T>inline void pr1(T x){write(x);putchar(' ');}
template<typename T>inline void pr2(T x){write(x);putchar('\n');}
template<typename T>inline void chkmin(T &x,T y){x=x<y?x:y;}
template<typename T>inline void chkmax(T &x,T y){x=x>y?x:y;}
const int MAXN=305;
int col[2][2*MAXN][2*MAXN],n,D1,D2;
vector<pii> fac[2];
bool in(int x,int y){return x>=0&&x<2*n&&y>=0&&y<2*n;}
void DFS(int x,int y,int o)
{
for(auto p:fac[o])for(int u=-1;u<=1;u++)if(u)for(int v=-1;v<=1;v++)if(v)
if(in(x+u*p.first,y+v*p.second))
{
int ux=x+u*p.first,uy=y+v*p.second;
if(col[o][ux][uy]!=-1)continue;
col[o][ux][uy]=col[o][x][y]^1;DFS(ux,uy,o);
}
}
void color(int o)
{
memset(col[o],-1,sizeof(col[o]));
for(int i=0;i<2*n;i++)for(int j=0;j<2*n;j++)if(col[o][i][j]==-1)
col[o][i][j]=0,DFS(i,j,o);
}
int sqr(int x){return x*x;}
int dis(pii u,pii v){return sqr(u.first-v.first)+sqr(u.second-v.second);}
vector<pii> ans[2][2];
int main()
{
n=read();D1=read();D2=read();
for(int i=0;i*i<=D1;i++)if(floor(sqrt(D1-i*i))==ceil(sqrt(D1-i*i)))fac[0].emplace_back(mp(i,sqrt(D1-i*i)));
for(int i=0;i*i<=D2;i++)if(floor(sqrt(D2-i*i))==ceil(sqrt(D2-i*i)))fac[1].emplace_back(mp(i,sqrt(D2-i*i)));
color(0);color(1);
for(int i=0;i<2*n;i++)for(int j=0;j<2*n;j++)
ans[col[0][i][j]][col[1][i][j]].emplace_back(mp(i,j));
for(int i=0;i<=1;i++)for(int j=0;j<=1;j++)if(SZ(ans[i][j])>=n*n)
{
// for(auto p:ans[i][j])for(auto q:ans[i][j])
// assert(dis(p,q)!=D1&&dis(p,q)!=D2);
int cnt=0;
for(auto p:ans[i][j])
{
pr1(p.first),pr2(p.second);
++cnt;if(cnt==n*n)break;
}
return 0;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int x = a;
int z = std::pow(x, 2);
int y = std::pow(x, 3);
int ans = x+y+z;
cout << ans << endl;
return 0;
} | /**
* auther: moririn_cocoa
*/
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_)
#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 <stdio.h>
#include <stdlib.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define fi first
#define se second
int main(int argc, char* argv[]) {
int R;
cin >> R;
if ( R < 1200 ) {
cout << "ABC" << endl;
}
else if ( R >= 1200 && R < 2800 ) {
cout << "ARC" << endl;
}
else {
cout << "AGC" << endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
for (int i = 0; i < n; ++i) cin >> xs[i]
void Main();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
return 0;
}
void Main() {
Cin(int, n);
Cins(int, n, a);
int sum = 0;
for (int i = 0; i < n; ++i) sum += a[i];
double mean = (double)sum / n;
double mi = 1001001001;
int mii = -1;
for (int i = 0; i < n; ++i) {
double sa = abs(a[i] - mean);
if (mi > sa) {
mi = sa;
mii = i;
}
}
cout << mii << endl;
} | #include<stdio.h>
int main(){
long long input;
scanf("%lld",&input);
int i = 0;
char ans[100];
while(input > 0){
int temp = input % 26;
if(temp == 0){
ans[i++] = 'z';
input = (input/26) - 1;
}
else{
ans[i++] = (temp - 1) + 'a';
input = input/26;
}
}
ans[i] = '\0';
for(int j = i - 1; j >= 0; j--){
printf("%c",ans[j]);
}
return 0;
} | 0 |
//#pragma warning(disable:4996)
//#include <Windows.h>
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
#include <complex>
#include <cstdio>
#include <list>
#include <bitset>
//#include <stdio.h>
//< in.txt > out.txt
using namespace std;
//std::ios::sync_with_stdio(false);
//std::cin.tie(0);
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
typedef long long LL;
typedef long double LD;
//typedef boost::multiprecision::cpp_int bigint;
typedef pair<LL, LL> PLL;
typedef pair<int, int> PI;
typedef pair<LD, LL> pdl;
typedef pair<LD, LD> pdd;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef unsigned long long ULL;
template<class T>
using pqueue = priority_queue<T, vector<T>, function<bool(T, T)>>;
template<class T>
inline void chmin(T& a, T b) {
a = min(a, b);
}
template<class T>
inline void chmax(T& a, T b) {
a = max(a, b);
}
void input();
void solve();
void daminput();
void naive();
void outputinput();
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
input();
//daminput();
solve();
//naive();
//outputinput();
return 0;
}
//////////////////////////////////////////////////
//////////////////////////////////////////////////
int N, Q;
VLL A;
VLL query;
void input() {
cin >> N >> Q;
A.resize(N);
for (int n = 0; n < N; n++) {
cin >> A[n];
}
query.resize(3 * Q);
for (int q = 0; q < 3 * Q; q++) {
cin >> query[q];
}
}
void daminput() {
}
//TT(T,T):=モノイドの乗算
//require Monoid
template<class T>
class Segtree {
private:
vector<T> seg;
LL RN;
typedef function<T(T, T)> TT;
TT f;
T te;
public:
Segtree(LL N, TT _f, T e) :te(e) {
RN = 1;
while (RN < N)RN *= 2;
seg.resize(2 * RN, te);
f = _f;
}
Segtree(vector<T>& V, TT _f, T e) :te(e) {
LL N = V.size();
RN = 1;
while (RN < N)RN *= 2;
seg.resize(2 * RN, te);
f = _f;
for (LL n = 0; n < N; n++) seg[RN + n] = V[n];
for (LL k = RN - 1; k >= 1; k--) {
seg[k] = f(seg[2 * k], seg[2 * k + 1]);
}
}
//set n-th as x(0 index!!!!!)
void set(LL n, T x) {
seg[RN + n] = x;
n = (RN + n) / 2;
while (n >= 1) {
seg[n] = f(seg[2 * n], seg[2 * n + 1]);
n /= 2;
}
}
//change n-th number p to x*p(0 index!!!!!)
void addl(LL n, T x) {
seg[RN + n] = f(x, seg[RN + n]);
n = (RN + n) / 2;
while (n >= 1) {
seg[n] = f(seg[2 * n], seg[2 * n + 1]);
n /= 2;
}
}
//change n-th number p to p*x(0 index!!!!!)
void addr(LL n, T x) {
seg[RN + n] = f(seg[RN + n], x);
n = (RN + n) / 2;
while (n >= 1) {
seg[n] = f(seg[2 * n], seg[2 * n + 1]);
n /= 2;
}
}
//get [l,r] (0 index!!!!!)
T get(LL l, LL r) {
T ansl = te, ansr = te;
r++;
l += RN;
r += RN;
while (l < r) {
if (l & 1) {
ansl = f(ansl, seg[l]);
l++;
}
if (r & 1) {
r--;
ansr = f(seg[r], ansr);
}
l >>= 1;
r >>= 1;
}
return f(ansl, ansr);
}
//get n-th number(0 index!!!!!)
T get(LL n) {
return seg[RN + n];
}
T operator[](LL n) {
return seg[RN + n];
}
};
void solve() {
Segtree<LL> seg(A, [](LL a, LL b) {
return a + b;
}, 0);
for (int q = 0; q < Q; q++) {
int t = query[3 * q];
if (t == 0) {
int p = query[3 * q + 1];
int x = query[3 * q + 2];
seg.addl(p, x);
}
else {
int l = query[3 * q + 1];
int r = query[3 * q + 2];
cout << seg.get(l, r - 1) << "\n";
}
}
}
void naive() {
}
void outputinput() {
} | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, Q; cin >> N >> Q;
fenwick_tree<long long> fw(N);
rep(i, N) {
int a; cin >> a;
fw.add(i, a);
}
rep(query, Q) {
int a, b, c; cin >> a >> b >> c;
if (a == 0) fw.add(b, c);
else cout << fw.sum(b, c) << endl;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string game[3];
cin >> game[0] >> game[1] >> game[2];
int turn = 0;
int length[] = {game[0].length(), game[1].length(), game[2].length()};
int indices[] = {0, 0, 0};
while(true) {
int curr = indices[turn]++;
if(indices[turn] > length[turn]) break;
turn = game[turn][curr] - 'a';
}
cout << char(turn + 'A');
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;
const ll MOD=1000000007;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T>auto MAX(const T& a) { return *max_element(a.begin(),a.end()); }
template<class T>auto MIN(const T& a) { return *min_element(a.begin(),a.end()); }
template<class T, class U>U SUM(const T& a, const U& v) { return accumulate(a.begin(),a.end(), v); }
template<class T, class U>U COUNT(const T& a, const U& v) { return count(a.begin(),a.end(), v); }
template<class T, class U>int LOWER(const T& a, const U& v) { return lower_bound(a.begin(),a.end(), v) - a.begin(); }
template<class T, class U>int UPPER(const T& a, const U& v) { return upper_bound(a.begin(),a.end(), v) - a.begin(); }
int GCD(int a, int b) { return b ? GCD(b, a%b) : a; }
int LCM(int a, int b) { int g = GCD(a, b); return a / g * b; }
typedef long double ld;
typedef unsigned long long int ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
//---------------------------------------------------------------------------------------------------
int main(void){
// Your code here!
string A,B,C; cin >> A >> B >> C;
queue<char> Sa,Sb,Sc;
rep(i,A.size()) Sa.push(A[i]);
rep(i,B.size()) Sb.push(B[i]);
rep(i,C.size()) Sc.push(C[i]);
char now ;
rep(i,A.size()+B.size()+C.size()+2) {
if (now == 'a' && Sa.empty()){
cout << 'A' << endl;
return 0;
}
if (now == 'b' &&Sb.empty()){
cout << 'B' << endl;
return 0;
}
if (now == 'c' &&Sc.empty()){
cout << 'C' << endl;
return 0;
}
if (i == 0) {
now = 'a';
continue;
}
if (now == 'a') {
now = Sa.front();
Sa.pop();
continue;
}
if (now == 'b') {
now = Sb.front();
Sb.pop();
continue;
}
if (now == 'c') {
now = Sc.front();
Sc.pop();
continue;
}
}
}
| 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
int N,M;
int nor, bip, sing, done[MX];
ll ans;
vi adj[MX];
bool ok = 1;
ll sq(ll x) { return x*x; };
void dfs(int x, int y) {
if (done[x]) {
if (done[x] != y) ok = 0;
return;
}
// cout << "HUH " << x << "\n";
done[x] = y;
for (int i: adj[x]) dfs(i,y^3);
}
void solve(int x) {
if (sz(adj[x]) == 0) {
sing ++;
return;
}
ok = 1;
dfs(x,1); // cout << "OOPS " << x << "\n";
if (ok) bip ++;
else nor ++;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> M;
F0R(i,M) {
int u,v; cin >> u >> v;
adj[u].pb(v), adj[v].pb(u);
}
FOR(i,1,N+1) if (!done[i]) {
//cout << i << "\n";
solve(i);
}
//cout << nor << " " << bip << " " << sing << "\n";
F0R(i,sing) {
ans += 2*N-1; N --;
}
//cout << ans << "\n";
ans += sq(bip);
ans += sq(nor+bip);
cout << ans;
}
// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?) ARRAY OUT OF BOUNDSS | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;}
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 end
int main(){
int n,m; scanf("%d%d",&n,&m);
int a[310][310];
rep(i,0,n)rep(j,0,m){
scanf("%d",&a[i][j]);
a[i][j]--;
}
int ans=n;
int cnt[310],idx[310]; bool used[310];
rep(i,0,n)cnt[a[i][0]]++;
rep(i,0,m-1){
int ma=0,idx2=-1;
rep(j,0,m)if(chmax(ma,cnt[j]))idx2=j;
chmin(ans,ma); used[idx2]=1;
rep(j,0,m)cnt[j]=0;
rep(j,0,n){
while(idx[j]<m&&used[a[j][idx[j]]])idx[j]++;
cnt[a[j][idx[j]]]++;
}
} printf("%d\n",ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
template <typename T> using vvec = vector<vector<T>>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0) { return 1; } if (b == 1) { return a % mod; } if (b == 2) { return (a * a) % mod; }
return (max(a * (b & 1), (int64_t)1) * mpow(mpow(a, b / 2, mod), 2, mod)) % mod;
}
constexpr int64_t mdiv(int64_t a, int64_t b, int64_t mod = 1000000007) {
return (a * mpow(b, mod - 2, mod)) % mod;
}
int main() {
int n, l; cin >> n >> l;
int all = n * (n - 1) / 2 + l * n;
if (0 <= l) {
cout << all - l << endl;
return 0;
}
if (abs(l) < n) {
cout << all << endl;
return 0;
}
cout << all - (l + n - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,r;
cin >> n >> r;
if(n<10) cout << r+(10-n)*100 << "\n";
else cout << r << "\n";
return 0;
} | 0 |
#include <iostream>
#include <cmath>
using namespace std;
const int INF = -100;
int k, r, c;
int a[8] = { INF, INF, INF, INF, INF, INF, INF, INF };
bool b[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
bool check() {
for (int i = 0; i < 7; i++) {
for (int j = i + 1; j < 8; j++)
if (a[i] == a[j] || j - i == abs(a[i] - a[j]))
return false;
}
return true;
}
void set(int i) {
if (i == 8) {
if (check()) {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] == j)
cout << "Q";
else
cout << ".";
}
cout << endl;
}
}
return;
}
if (b[i])
set(i + 1);
else {
for (int j = 0; j < 8; j++) {
a[i] = j;
set(i + 1);
}
}
}
int main()
{
cin >> k;
for (int i = 0; i < k; i++) {
cin >> r >> c;
a[r] = c;
b[r] = 1;
}
set(0);
return 0;
}
| #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
bool ok(int x, int y) {
if (x < 0 || x >= 8 || y < 0 || y >= 8) return false;
return true;
}
bool check(int nowmap[8][8]) {
int count = 0;
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (nowmap[i][j] == 1) {
count++;
}
}
}
if (count >= 9) {
return false;
}
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (nowmap[i][j] == 1) {
int dx[] = {1,1,-1,-1};
int dy[] = {1,-1,-1,1};
for (int k = 0; k < 4; k++) {
int px = j;
int py = i;
while(ok(px + dx[k], py + dy[k])) {
px += dx[k];
py += dy[k];
if (nowmap[py][px] == 1) {
return false;
}
}
}
}
}
}
return true;
}
void print(int nowmap[8][8]) {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
if (nowmap[i][j] == 1) {
cout << "Q";
} else {
cout << ".";
}
}
cout << endl;
}
}
int main(int argc, char const *argv[]) {
int N;
cin >> N;
int map[8][8] = {{0}};
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
map[a][b] = 1;
}
std::vector<int> perm;
for (int i = 0; i < 8; i++) {
perm.push_back(i);
}
do {
int nowmap[8][8] = {{0}};
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
nowmap[i][j] = map[i][j];
}
}
for (int i = 0; i < 8; i++) {
int x = i;
int y = perm[i];
nowmap[y][x] = 1;
}
if (check(nowmap)) {
print(nowmap);
return 0;
}
} while(next_permutation(perm.begin(), perm.end()));
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
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>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };
template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };
using namespace std;
//******************** dumps ************************//
template <typename T>
void dump(const T &data, vector<int> &iter)
{
cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
for (auto elem : data)
dump(elem, iter);
cout << endl;
}
template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
for (auto elem : iter)
{
cout << "[" << elem << "]";
}
cout << endl;
for (int i = 0; i < data.size(); i++)
{
iter.push_back(i);
dump(data[i], iter);
iter.pop_back();
}
cout << endl;
}
template <typename T>
void dump(const vector<T> &data, int dummy)
{
for (int i = 0; i < data.size(); i++)
{
cout << "[" << i << "] " << data[i] << endl;
}
}
template <typename T>
void dump(const T &data)
{ // T : data, U = base type val.
vector<int> iter;
dump(data, iter);
}
///////////////////////////////////////////////
void solve(long long K, std::string S)
{
int n = S.size();
if (K < n)
{
S = S.substr(0, K);
S += "...";
}
cout << S << endl;
}
int main()
{
cout << setprecision(10);
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| #include<iostream>
#include<string>
using namespace std;
int main(){
int k;
cin>>k;
string s,S;
cin>>s;
if(s.length()<=k)
cout<<s;
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"...";
}
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
#define N 1000100
ll n,s,ans,x[N],p[N];
using namespace std;
int main(){
scanf("%lld%lld",&n,&s);
for (ll i=1;i<=n;i++) scanf("%lld%lld",&x[i],&p[i]);
for (ll l=1,r=n;l<=r;){
if (x[l]>=s){ans+=x[r]-s; break;}//所有人都在一边直接开过去
if (x[r]<=s){ans+=s-x[l]; break;}
ans+=x[r]-x[l]; //每次来回开一趟
if (p[l]>=p[r])
while (l<r && p[l]>=p[r]) p[l]+=p[r],r--;//相同往左开
else while (l<r && p[l]<p[r]) p[r]+=p[l],l++;
}
printf("%lld\n",ans);
return 0;
} |
#include <cstdio>
using namespace std;
typedef long long int LL;
const int Max_N(100050);
namespace io
{
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
inline void flush (){fwrite (obuf, 1, oS - obuf, stdout);oS = obuf;}
inline void putc (char x){*oS ++ = x;if (oS == oT) flush ();}
template <class I>
inline void gi (I &x) {for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;}
template <class I>
inline void print (I x){
if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;while(x) qu[++ qr] = x % 10 + '0', x /= 10;while (qr) putc (qu[qr--]);}
struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io::gi;
using io::putc;
using io::print;
int N, S, X[Max_N], V[Max_N];
LL P[Max_N], Ans;
void solve(int l, int r)
{
if (l == r)
{
V[++V[0]] = X[l], V[++V[0]] = S;
return;
}
if (S < X[l])
{
V[++V[0]] = X[r], solve(l, r - 1);
return;
}
if (S > X[r])
{
V[++V[0]] = X[l], solve(l + 1, r);
return;
}
if (P[l] >= P[r])
V[++V[0]] = X[r], P[l] += P[r], solve(l, r - 1);
else
V[++V[0]] = X[l], P[r] += P[l], solve(l + 1, r);
}
constexpr int Abs(int x)
{
return x >= 0 ? x : -x;
}
int main()
{
gi(N), gi(S);
for (int i = 1;i <= N;++i)
gi(X[i]), gi(P[i]);
solve(1, N);
for (int i = V[0] - 1;i >= 1;--i)
Ans += Abs(V[i + 1] - V[i]);
print(Ans);
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#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;
using P = pair<int,int>;
int main() {
int n,q;
cin >> n >> q;
set<P> ds;
rep(i,n){
int s,t,x;
cin >> s >> t >> x;
ds.emplace(s-x,x);
ds.emplace(t-x,-x);
}
set<int> s; auto itr = ds.begin();
rep(i,q){
int d;
cin >> d;
while(itr!=ds.end() && itr->first<=d){
if(itr->second>0) s.insert(itr->second);
else s.erase(-itr->second);
++itr;
}
cout << (s.empty() ? -1 : *s.begin()) << endl;
}
}
| #include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, q, inf=2e9, cnt;
vector<int> par ;
vector<pair<int,pair<int,int> > > v;
map<int,int> id ;
int tree[3000006];
void update(int node, int s, int e, int l, int r, int val)
{
if(s>r||e<l)
return ;
if(s>=l && e<=r)
{
tree[node]=min(tree[node],val);
return ;
}
int m=(s+e)/2;
update(2*node,s,m,l,r,val);
update(2*node+1,m+1,e,l,r,val);
}
int solve(int node, int s,int e, int pos)
{
if(s==e)
return tree[node];
int m=(s+e)/2;
tree[2*node]=min(tree[node],tree[2*node]);
tree[2*node+1]=min(tree[node],tree[2*node+1]);
return pos<=m ? solve(2*node,s,m,pos) : solve(2*node+1,m+1,e,pos);
}
int main()
{
IO
cin>>n>>q;
for(int i=1; i<=3e6; i++)
tree[i]=inf;
for(int i=1; i<=n; i++)
{
int s, t, x;
cin>>s>>t>>x;
v.push_back({x,{s-x,t-x-1}});
id[s-x]++;
id[t-x-1]++;
}
for(int i=1; i<=q; i++)
{
int d;
cin>>d;
id[d]++;
par.push_back(d);
}
for(auto i : id)
id[i.first]=++cnt;
for(int i=0; i<n; i++)
{
int l=id[v[i].second.first], r=id[v[i].second.second];
update(1,1,cnt,l,r,v[i].first);
}
for(int i=0; i<q; i++)
{
int ans=solve(1,1,cnt,id[par[i]]);
if(ans==inf)
ans=-1;
cout<<ans<<"\n";
}
}
| 1 |
#include <stdio.h>
int main(){
long long int s,max,min,k;
int n;
scanf("%d",&n);
max = -1000000;
min = 1000000;
s = 0;
for (int i=0; i<n ; ++i){
scanf("%lld",&k);
if(k>max) max = k;
if(k<min) min = k;
s =s+k;
};
printf("%lld %lld %lld\n",min ,max, s);
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
long long Min,Max,sum=0,n,m;
scanf("%lld%lld",&n,&Max);
Min=sum=Max;
for(int i=1;i<n;i++){
scanf("%lld",&m);
if(m>Max) Max=m;
if(m<Min) Min=m;
sum+=m;
}
printf("%lld %lld %lld\n",Min,Max,sum);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int> p(n), q(m);
rep(i,n) cin>>p[i];
rep(i,m) cin>>q[i];
p.push_back(x); q.push_back(y);
sort(etob(p)); sort(btoe(q));
int a=p[0], b=q[0];
if(a<b) cout<<"No War"<<endl;
else cout<<"War"<<endl;
} | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
bool hantei( vector<int>& x, vector<int>& y ) {
rep( Z, -100, 100+1 ) {
bool flag = true;
rep( i, 0, x.size() ) {
if ( x.at(i) >= Z ) flag = false;
}
rep( i, 0, y.size() ) {
if ( y.at(i) < Z ) flag = false;
}
if (flag) return false;
}
return true;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> x(N+1), y(M+1);
cin >> x.at(0) >> y.at(0);
rep(i, 1, N+1) cin >> x.at(i);
rep(i, 1, M+1) cin >> y.at(i);
cout << ( hantei(x, y) ? "War" : "No War" ) << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
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 all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
ll N,Q;
string S;
cin >>N>>Q>>S;
vector<ll> l(Q);
vector<ll> r(Q);
rep(i,Q){
cin>>l[i]>>r[i];
}
vector<ll> sum(N);
sum[0]=0;
rep(i,N-1){
if(S[i]=='A' && S[i+1]=='C'){
sum[i+1] = sum[i]+1;
}else{
sum[i+1] = sum[i];
}
}
rep(i,Q){
cout<<sum[r[i]-1]-sum[l[i]-1]<<endl;;
}
return 0;
} | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define PI 3.141592653
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int n; cin >> n;
string s; cin >> s;
bool fin;
if(s[0] == 'o'){fin = true;}
else{fin = false;}
bool ans = true;
vector<char> s1(n+1);
s1[0] = 'W'; s1[1] = 'S';
vector<char> s2(n+1);
s2[0] = 'W'; s2[1] = 'W';
vector<char> s3(n+1);
s3[0] = 'S'; s3[1] = 'S';
vector<char> s4(n+1);
s4[0] = 'S'; s4[1] = 'W';
while(true){
bool f;
for(int i = 2; i <= n; i++){
f = true;
if(s1[i-2] == 'W'){f = !f;}
if(s1[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s1[i] = 'S';}
else{s1[i] = 'W';}
}
if(fin){if(s1[n-1] == 'W' && s1[0] == s1[n]) {rep(i, n){cout << s1[i];}ans = false; break;}}
else{if(s1[n-1] == 'S' && s1[0] == s1[n]) {rep(i, n){cout << s1[i];}ans = false; break;}}
for(int i = 2; i <= n; i++){
f = true;
if(s2[i-2] == 'W'){f = !f;}
if(s2[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s2[i] = 'S';}
else{s2[i] = 'W';}
}
if(fin){if(s2[n-1] == 'S' && s2[0] == s2[n] ) {rep(i, n){cout << s2[i];}ans = false; break;}}
else{if(s2[n-1] == 'W' && s2[0] == s2[n]) {rep(i, n){cout << s2[i];}ans = false; break;}}
for(int i = 2; i <= n; i++){
f = true;
if(s3[i-2] == 'W'){f = !f;}
if(s3[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s3[i] = 'S';}
else{s3[i] = 'W';}
}
if(fin){if(s3[n-1] == 'S' && s3[0] == s3[n]) {rep(i, n){cout << s3[i];} ans = false; break;}}
else{if(s3[n-1] == 'W' && s3[0] == s3[n]) {rep(i, n){cout << s3[i];}ans = false; break;}}
for(int i = 2; i <= n; i++){
f = true;
if(s4[i-2] == 'W'){f = !f;}
if(s4[i-1] == 'W'){f = !f;}
if(s[i-1] == 'x'){f = !f;}
if(f){s4[i] = 'S';}
else{s4[i] = 'W';}
}
if(fin){if(s4[n-1] == 'W' && s4[0] == s4[n]) {rep(i, n){cout << s4[i];} ans = false;break;}}
else{if(s4[n-1] == 'S' && s4[0] == s4[n]) { rep(i, n){cout << s4[i];}ans = false; break;}}
cout << -1;
break;
}
cout << endl;
} | 0 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 998244353
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
#define lg length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
ll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}
#define invp(a,p)pom(a,p-2,p)
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<Pll,ll> a,pair<Pll,ll> b){
return a.fi.se>b.fi.se;
}
ll cmp2(pair<ll,ll> a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
//----------------------------------------------------------------------
bool dp[80][80][2*160*80+1];
//----------------------------------------------------------------------
int main(int argc, char * argv[]){
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
//ll begin_t=clock();
//freopen("big.txt", "r", stdin);
//freopen("out3.txt", "w", stdout);
//-----------------------------
ll h,w;cin>>h>>w;
ll a[h+1][w+1];
ll b[h+1][w+1];
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin>>a[i][j];
}
}
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin>>b[i][j];
}
}
dp[0][0][a[0][0]-b[0][0]+160*80]=1;
dp[0][0][b[0][0]-a[0][0]+160*80]=1;
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
if(i>0){
for(ll k=0;k<=2*160*80;k++){
if(dp[i-1][j][k]){
dp[i][j][k+a[i][j]-b[i][j]]=1;
dp[i][j][k+b[i][j]-a[i][j]]=1;
}
}
}
if(j>0){
for(ll k=0;k<=2*160*80;k++){
if(dp[i][j-1][k]){
dp[i][j][k+a[i][j]-b[i][j]]=1;
dp[i][j][k+b[i][j]-a[i][j]]=1;
}
}
}
}
}
ll ans=INF;
for(ll k=0;k<=2*160*80;k++){
if(dp[h-1][w-1][k]){
chmin(ans,abs(k-160*80));
}
}
cout<<ans<<endl;
//------------------------------
//fclose(stdin);
//fclose(stdout);
//ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<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;
typedef pair<int,int> P;
typedef vector<int> vi;
int main(){
int k,n;
cin >> k >> n;
vi a(n);
rep(i,n) cin >> a[i];
sort(a.rbegin(),a.rend());
cout << max(2*a[0]-k-1,0);
return 0;
} | 0 |
#include<iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
char str[20];
int i, len=0;
cin >> str;
while (str[len])
len++;
for (i = len - 1; i >= 0; i--)
cout << str[i];
putchar('\n');
return 0;
} | #include<iostream>
using namespace std;
int n, i, j;
char a[1005][1005];
int main(){
cin>> n;
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
a[i][j] = '.';
}
}
if(n % 2 == 0){
if(n == 2){
cout<< -1;
return 0;
}
for(i = 1; i < n; i += 2){
a[i][i] = a[i + 1][i] = 'a';
a[i][i + 1] = a[i + 1][i + 1] = 'b';
}
for(i = 1; i < n - 2; i += 2){
a[i][i + 2] = a[i][i + 3] = 'c';
a[i + 1][i + 2] = a[i + 1][i + 3] = 'd';
}
a[n - 1][1] = a[n - 1][2] = 'c';
a[n][1] = a[n][2] = 'd';
}
else{
if(n == 5 || n > 9){
a[1][1] = a[1][2] = a[1][5] = a[2][5] = a[2][3] = a[3][3] = a[4][1] = a[4][2] = a[5][4] = a[5][5] = 'e';
a[1][3] = a[1][4] = a[5][1] = a[5][2] = 'f';
a[2][4] = a[3][4] = a[4][3] = a[5][3] = 'g';
a[3][5] = a[4][5] = 'i';
for(i = 6; i < n; i += 2){
a[i][i] = a[i + 1][i] = 'a';
a[i][i + 1] = a[i + 1][i + 1] = 'b';
}
for(i = 6; i < n - 2; i += 2){
a[i][i + 2] = a[i][i + 3] = 'c';
a[i + 1][i + 2] = a[i + 1][i + 3] = 'd';
}
a[n - 1][6] = a[n - 1][7] = 'c';
a[n][6] = a[n][7] = 'd';
}
if(n == 3 || n == 9){
for(i = 1; i < n; i += 3){
for(j = 1; j < n; j += 3){
a[i][j] = a[i][j + 1] = 'a';
a[i + 1][j + 2] = a[i + 2][j + 2] = 'b';
}
}
}
if(n == 7){
a[1][2] = a[1][3] = a[2][1] = a[3][1] = 'a';
a[1][4] = a[1][5] = a[4][1] = a[5][1] = 'b';
a[1][6] = a[1][7] = a[6][1] = a[7][1] = 'c';
a[2][2] = a[2][3] = a[3][4] = a[3][5] = a[4][2] = a[5][2] = a[6][6] = a[7][6] = 'e';
a[2][4] = a[2][5] = a[3][6] = a[3][7] = a[4][3] = a[5][3] = a[6][7] = a[7][7] = 'f';
}
}
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
cout<< a[i][j];
}
cout<<"\n";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 showmap(is, js, x) {rep(i, is){rep(j, js){cout << x[i][j] << " ";}cout << endl;}}
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll gcd(int x, int y){ return y?gcd(y, x%y):x;}
ll lcm(ll x, ll y){ return (x*y)/gcd(x,y);}
/*
正面衝突の場合 U-D, L-R
斜め衝突の場合 U-L, L-D, D-R, R-U
*/
int x_in[200050], y_in[200050];
char c_in[200050];
vector<pair<int, char>> ur[400020];
vector<pair<int, char>> ud[400020];
int n;
int solve_UD(){
rep(i, 400020){
ud[i].clear();
}
rep(i, n){
if (c_in[i] != 'U' && c_in[i] != 'D') continue;
ud[x_in[i]].push_back(make_pair(y_in[i], c_in[i]));
}
int tmin = 2000001;
rep(i, 400020){
sort(ud[i].begin(), ud[i].end());
rep(j, ud[i].size()-1){
if (ud[i][j].second == 'U' && ud[i][j+1].second == 'D'){
tmin = min(tmin, ud[i][j+1].first - ud[i][j].first);
}
}
}
return tmin * 5;
}
int solve_UR(){
rep(i, 400020){
ur[i].clear();
}
rep(i, n){
if (c_in[i] != 'U' && c_in[i] != 'R') continue;
ur[x_in[i]+y_in[i]].push_back(make_pair(x_in[i], c_in[i]));
}
int tmin = 2000001;
rep(i, 400020){
sort(ur[i].begin(), ur[i].end());
rep(j, ur[i].size()-1){
if (ur[i][j+1].second == 'U' && ur[i][j].second == 'R')
tmin = min(tmin, ur[i][j+1].first - ur[i][j].first);
}
}
return tmin*10;
}
void rotate(){
int tmp;
rep(i, n){
tmp = x_in[i];
x_in[i] = 200000-y_in[i];
y_in[i] = tmp;
if (c_in[i] == 'U') c_in[i] = 'L';
else if (c_in[i] == 'L') c_in[i] = 'D';
else if (c_in[i] == 'D') c_in[i] = 'R';
else c_in[i] = 'U';
}
}
int main()
{
cin >> n;
rep(i, n){
cin >> x_in[i] >> y_in[i] >> c_in[i];
}
int t_time = 2000001;
rep(t, 4){
t_time = min(t_time, solve_UD());
t_time = min(t_time, solve_UR());
rotate();
}
if (t_time == 2000001) cout << "SAFE" << endl;
else cout << t_time << endl;
}
| #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
vector< vs32 > g;
vs32 color;
const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;
inline int enc(int i, int j)
{
if (i < j) swap(i, j);
return i * (i - 1) / 2 + j + 1;
}
int d[1000 * 1000];
int dfs(int u)
{
if (color[u] == BLACK) return d[u];
color[u] = GRAY;
bool found = false;
for (auto v : g[u])
{
if (color[v] == GRAY)
{
return -1;
}
int temp = dfs(v);
if (temp == -1)
{
return -1;
}
found = true;
d[u] = max(d[u], temp + 1);
}
color[u] = BLACK;
return d[u];
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a;;
color.resize(n * (n - 1) / 2 + 1, WHITE);
g.resize(n * (n - 1) / 2 + 1);
rep (i, n)
{
int u = 0;
rep (j, n - 1)
{
cin >> a;
--a;
int v = enc(i, a);
g[u].push_back(v);
u = v;
}
}
cout << dfs(0) << "\n";
return 0;
}
| 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <functional>
#include <list>
#define MOD (1000000000 + 7)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 3000000;
long long fac[MAX], finv[MAX], inv[MAX];
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
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;}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
map<ll,ll> prime;//素因数分解でそれぞれの素数がいくつ出てきたかを保存するmap
//O(√n)
//整列済み(mapはkeyで自動で整列される)
void prime_factorize(ll n){
if(n<=1) return;
ll l=sqrt(n);
for(ll i=2;i<=(ll)(l);i++) { //
if(n%i==0){
prime_factorize(i);prime_factorize(ll(n/i));return;
}
}
//mapでは存在しないkeyの場合も自動で構築される
prime[n]++;return;
}
vector<ll> divisor;
void list_divisor(ll n) {
divisor.clear();
for(int i = 1; i*i <= n; i++) {
if(n % i == 0) {
divisor.push_back(i);
if(i*i != n) divisor.push_back(n/i);
}
}
sort(divisor.begin(), divisor.end());
}
int main() {
ll N;
cin >> N;
vector<ll> D(N, 0);
map<ll, ll> m;
ll maxv = 0;
for(ll i = 0; i < N; i++) {
cin >> D[i];
m[D[i]]++;
maxv = max(maxv, D[i]);
}
if(D[0] != 0 || m[0] >= 2) {
cout << 0 << endl;
return 0;
}
ll ret = 1;
for(ll i = 1; i <= maxv; i++) {
ret = (ret % 998244353) * modpow(m[i-1], m[i], 998244353);
}
cout << ret%998244353 << endl;
}
| #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77 ;
int mod = 998244353;
int cnt[N];
int32_t main(){
fast;
int n ; cin >> n ;
int in = 0;
for(int i = 0 ; i < n ; ++i){
int a ; cin >> a;
cnt[a]++;
if(i==0) in = a;
}
int ans = (int)((cnt[0] == 1) && (in == 0));
for(int i = 1 ; i <= 1e5 ;++i){
for(int j = 0 ;j < cnt[i] ; ++j){
ans = (ans*cnt[i-1]) % mod;
}
}
cout << ans << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,x;
cin >> N >> x;
vector<int> data(N);
for (int i=0; i<N; i++){
cin >> data[i];
}
sort(data.begin(),data.end());
for (int i=0; i<N; i++) {
x = x - data[i];
if (x == 0) {
cout << i+1 <<endl;
return 0;
}
if (x < 0){
cout << i << endl;
return 0;
}
}
cout << N-1 << endl;
} | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long int int64;
const int N = (int) 1e5 + 100;
vector <int> ch[N];
int k;
struct Ans
{
vector <int> v;
Ans() : v({0}) {}
void eprint()
{
for (int i = 0; i < min(k + 1, (int) v.size()); i++)
eprintf("[%d] %d, ", i, v[(int) v.size() - 1 - i]);
eprintf("\n");
}
};
Ans dp[N];
int merge(int a, int b)
{
if ((int) dp[a].v.size() < (int) dp[b].v.size())
swap(a, b);
for (int i = 0; i < (int) dp[b].v.size(); i++)
dp[a].v[(int) dp[a].v.size() - 1 - i] += dp[b].v[(int) dp[b].v.size() - 1 - i];
return a;
}
int goUp(int a)
{
dp[a].v.push_back(1);
if ((int) dp[a].v.size() >= k + 1)
dp[a].v.back() += dp[a].v[(int) dp[a].v.size() - k - 1];
int i = 2;
while (i <= (int) dp[a].v.size() && dp[a].v[(int) dp[a].v.size() - i] > dp[a].v.back())
{
dp[a].v[(int) dp[a].v.size() - i] = dp[a].v.back();
i++;
}
return a;
}
int solve(int v)
{
int cur = v;
for (int to : ch[v])
{
int nx = solve(to);
cur = merge(cur, nx);
}
//eprintf("(%d): ", v); dp[cur].eprint();
if (v != 0)
cur = goUp(cur);
//eprintf("(%d'): ", v); dp[cur].eprint();
return cur;
}
int a[N];
int main(int, char **)
{
#ifdef LOCAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
a[i]--;
}
for (int i = 1; i < n; i++)
ch[a[i]].push_back(i);
int id = solve(0);
int ans = dp[id].v[max(0, (int) dp[id].v.size() - k - 1)];
if (a[0] != 0)
ans++;
printf("%d\n", ans);
return 0;
}
| 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f); i < (n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define repv(v) for (auto it = (v).begin(); it != (v).end(); it++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T>
inline bool chmax(T& a, T b) {
return a = (a < b) ? b : a;
}
template <class T>
inline bool chmin(T& a, T b) {
return a = (a > b) ? b : a;
}
ll const INF = 1LL << 60;
ll const MOD = 1000000007;
// 約数の列挙 O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) res.push_back(n / i);
}
}
return res;
}
int main() {
INIT;
ll N;
cin >> N;
vector<ll> a(N + 1, 0);
reps(i, 1, N + 1) cin >> a[i];
vector<ll> b;
vector<ll> sum(N + 1, 0);
ll ans = 0;
for (ll i = N; i > 0; i--) {
if (sum[i] % 2 != a[i]) {
b.pb(i);
vector<ll> divs = divisor(i);
rep(j, SZ(divs)) { sum[divs[j]]++; }
}
// cout << i << ": ";
// repv(sum) cout << *it << " ";
// cout << endl;
}
sort(ALL(b));
cout << SZ(b) << endl;
if (SZ(b) > 0) {
repv(b) { cout << *it << " "; }
cout << endl;
}
return 0;
} | #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 INF = 2147483647;
const ll MOD = 1e9+7;
// const ll INF = 1000000000000000000LL;
//使い方
int main() {
ll n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
rep(i,n) cin >> a[i];
for(int i=n-1;i>=0;i--){
int num = i+1;
ans[i] = a[i];
if(ans[i]==1){
for(int j=1;j*j<=num;j++){
if(num % j ==0){
int x = j;
int y = num / j;
a[x-1] = 1 - a[x-1];
if(x!=y)
a[y-1] = 1 - a[y-1];
}
}
}
}
int cnt = 0;
vector<int> ans_vec;
rep(i,n){
if(ans[i]){
cnt++;
ans_vec.push_back(i+1);
}
}
cout << cnt << endl;
if(cnt==0) return 0;
rep(i,ans_vec.size()){
cout << ans_vec[i] << ' ';
}
cout << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, a, b) for (int i = a;i<=b;i++)
#define ll long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define mem(x,val) memset(x, val, sizeof(x))
#define ritr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define pai pair < int, int> ;
#define pal pair < ll, ll> ;
#define vi vector <int> ;
#define vl vector < ll > ;
#define vpai vector < pii > ;
#define prec(val,x) cout<<fixed<<setprecision(x)<<val;
const int mod = 1e9+7;
const int INF = INT_MAX;
const int sze = 305;
int n;
ll dp[sze][sze][sze];
ll calc(int one,int two,int three){
if(one<0||two<0||three<0) return 0;
if(one==0&&two==0&&three==0) return 0;
if(dp[one][two][three]>0) return dp[one][two][three];
int rem=one+two+three;
ll exp=n+one*calc(one-1,two,three)+two*calc(one+1,two-1,three)+
three*calc(one,two+1,three-1);
return dp[one][two][three]=exp/rem;
}
void solve() {
//int n;
cin>>n;
int arr[n];
int x=0,y=0,z=0;
rep(i,n) {
cin>>arr[i];
if(arr[i]==1) x++;
if(arr[i]==2) y++;
if(arr[i]==3) z++;
}
prec(calc(x,y,z),14);
cout<<endl;
}
int main() {
IOS;
int t = 1;
//cin >> t;
while (t--) {
mem(dp,-1);
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int tmpCnt1,tmpCnt2;
int Max1 = 0, Max2 = 0;
string str1, str2;
cin >> num >> str1 >> str2;
if(str1 == str2){
cout << num;
return 0;
}
for(int i = 0; i < num; i++){
tmpCnt1 = 0;
if(str1.at(i) == str2.at(0)){
for(int j = 0; j < num - i; j++){
if(str1.at(i+j) == str2.at(j)) tmpCnt1++;
else break;
}
Max1 = max(Max1, tmpCnt1);
}
}
for(int i = 0; i < num; i++){
tmpCnt2 = 0;
if(str2.at(i) == str1.at(0)){
for(int j = 0; j < num - i; j++){
if(str2.at(i+j) == str1.at(j)) tmpCnt2++;
else break;
}
Max2 = max(Max2, tmpCnt2);
}
}
if(Max1 == 0 && Max2 == 0){
cout << num * 2;
}else if(Max1 >= Max2){
cout << num + (num - Max1);
}else{
cout << num + (num - Max2);
}
}
| 0 |
#include<vector>
#include<iostream>
using namespace std;
string solve(){
vector<int> a;
for(int i=0;i<3;i++){
int tmp;
cin>>tmp;
a.push_back(tmp);
}
for(int i=0;i<a.size();i++){
if(a[i]==100)return "A";
}
if(a[0]+a[1]>=90*2)return "A";
int ave = (a[0]+a[1]+a[2])/3;
if(ave>=80)return "A";
if(ave>=70)return "B";
if(ave>=50)if(a[0]>=80||a[1]>=80)return "B";
return "C";
}
int main(){
int n;
while(cin>>n,n!=0){
for(int i=0;i<n;i++){
cout<<solve()<<endl;
}
}
} | #include <iostream>
using namespace std;
char judge(int pm, int pe, int pj)
{
if(pm == 100 || pe == 100 || pj == 100 || pm + pe >= 180 || pm + pe + pj >= 240) return 'A';
else if(pm + pe + pj >= 210 || pm + pe + pj >= 150 && (pm >= 80 || pe >= 80)) return 'B';
return 'C';
}
int main()
{
int n, pm, pe, pj;
while(cin >> n, n){
for(int i = 0; i < n; ++i){
cin >> pm >> pe >> pj;
cout << judge(pm,pe,pj) << endl;
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2005;
const int mod = 1e9+7;
int fac[N],combi[N][N];
int add(int x,int y) {
int ret = ((x+y)%mod + mod)%mod;
return ret;
}
int mul(int x,int y) {
ll ret = (ll)x*y;
ret%=mod;
return ret;
}
int num[2];
int group[2];
int dp[N][N];
int inv[N];
int invFac[N];
int solveDp(int x,int rem) {
if(rem==0) {
return 1;
}
if(x>num[1]) {
return 0;
}
int &ret = dp[x][rem];
if(ret != -1) {
return ret;
}
ret = solveDp(x+1,rem);
int cur = 1;
for(int j = 0;j<group[0];++j) {
cur = mul(cur, invFac[x]);
}
for(int f = group[0];f<=group[1] && f*x<=rem;++f) {
int tot = f*x;
int m = fac[tot];
int t = cur;
t = mul(t, invFac[f]);
m = mul(t,m);
m = mul(combi[rem][tot],m);
ret = add(ret, mul(m,solveDp(x+1,rem-tot)));
cur = mul(cur,invFac[x]);
}
return ret;
}
int myPow(int x,int c) {
int ret = 1;
while(c>0) {
if(c&1) {
ret = mul(ret,x);
}
x = mul(x,x);
c/=2;
}
return ret;
}
void solve() {
int n;
memset(dp,-1,sizeof(dp));
scanf("%d",&n);
for(int i=0;i<2;++i) {
scanf("%d",&num[i]);
}
for(int i=0;i<2;++i) {
scanf("%d",&group[i]);
}
fac[0] = 1;
inv[0] = 1;
invFac[0] = 1;
for(int i=1;i<N;++i) {
fac[i] = mul(fac[i-1],i);
inv[i] = myPow(i,mod-2);
invFac[i] = myPow(fac[i],mod-2);
}
for(int i=0;i<N;++i) {
combi[i][i] = combi[i][0] = 1;
for(int j = 1;j<i;++j) {
combi[i][j] = add(combi[i-1][j],combi[i-1][j-1]);
}
}
printf("%d\n", solveDp(num[0],n));
}
int main()
{
//freopen("input.txt","r",stdin);
solve();
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
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()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
const int MOD = 1000000007;
vector<long long> inv_init(int num) {
vector<long long> inv(num + 1, 0);
inv[1] = 1;
FOR(i, 2, num + 1) inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
return inv;
}
pair<long long, long long> ext_gcd(long long a, long long b) {
if (b == 0) return {1, 0};
pair<long long, long long> pr = ext_gcd(b, a % b);
return {pr.second, pr.first - a / b * pr.second};
}
long long mod_inv(long long a) {
if (__gcd(a, (long long)MOD) != 1) return 0;
pair<long long, long long> pr = ext_gcd(a, MOD);
return (pr.first + MOD) % MOD;
}
const int MAX = 10000000;
long long fact[MAX + 1], fact_inv[MAX + 1];
void nCk_init(int num = MAX) {
fact[0] = 1;
FOR(i, 1, MAX + 1) fact[i] = fact[i - 1] * i % MOD;
fact_inv[MAX] = mod_inv(fact[MAX]);
for (int i = MAX; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i % MOD;
}
inline long long nCk(int n, int k) {
if (n < 0 || n < k || k < 0) return 0;
return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}
int main() {
cin.tie(0); ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, a, b, c, d; cin >> n >> a >> b >> c >> d;
nCk_init(n);
vector<long long> inv = inv_init(d);
// dp[i][j] = 既に i 人グループに含まれており,
// 各グループの最大人数が j 人
vector<vector<long long> > dp(n+1, vector<long long>(b+1, 0));
dp[0][a-1] = 1; // 高々 j 人なので1人もグループ分けされていなくてもよい
REP(i, n+1) FOR(j, a-1, b) {
// 既に i 人グループに含まれており, 各グループの最大人数が j 人のとき
// j+1 人のグループを k (k = 0, c,...,d) グループ作る場合
// 残りの人々の選び方の総数は
// C(n-i, j+1) * C(n-i-(j+1), j+1) * ... * C(n-i-(k-1)*(j+1), j+1) / k!
(dp[i][j+1] += dp[i][j]) %= MOD; // k = 0
long long tmp = dp[i][j];
FOR(k, 1, d+1) {
if (i+k*(j+1) > n) break;
(tmp *= nCk(n-i-(k-1)*(j+1), j+1) * inv[k] % MOD) %= MOD;
if (k >= c) (dp[i+k*(j+1)][j+1] += tmp) %= MOD;
}
}
cout << dp[n][b] << '\n';
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define _ int v, int tl, int tr, int l, int r
#define tm (tl + tr >> 1)
#define sol v+v, tl, tm, l, r
#define sag v+v+1, tm+1, tr, l, r
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e3 + 3;
char s[N][N];
int sam[N],dif[N];
signed main(){
int m,n;
cin >> m >> n;
for(int i=1; i<=m; i++)
scanf(" %s", s[i]+1);
int ans = max(m,n);
for(int j=1; j<=n; j++){
stack < pp > S;
S.push(mp(-1,1));
for(int i=2; i<=m+1; i++){
int x = 0;
if(s[i][j] == s[i-1][j]){
x = ++sam[i];
dif[i] = 0;
}
else{
x = ++dif[i];
sam[i] = 0;
}
if(i == m+1) x = 0;
for(; S.top().st >= x;){
int t = S.top().st;
S.pop();
ans = max(ans , t * (i-S.top().nd));
}
S.push(mp(x,i));
}
}
cout << ans;
return 0;
} | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <utility>
#define INF 1000000000
using namespace std;
typedef long long int lli;
typedef pair<int, int> P;
struct edge{
int to, cost;
};
int V, E;
vector<edge> e[10000];
int mincost[10000];
bool used[10000];
int main(void){
cin >> V >> E;
for(int i = 0;i < V;i++){
mincost[i] = INF;
used[i] = false;
}
for(int i = 0;i < E;i++){
int a, b, c;
cin >> a >> b >> c;
edge d;
d.to = b;
d.cost = c;
e[a].push_back(d);
d.to = a;
e[b].push_back(d);
}
mincost[0] = 0;
long long int res = 0;
while(true){
int v = -1;
for(int u = 0;u < V;u++){
if(!used[u] && (v == -1 || mincost[u] < mincost[v])) v = u;
}
if(v == -1) break;
used[v] = true;
res += mincost[v];
for(int u = 0;u < e[v].size();u++){
mincost[e[v][u].to] = min(mincost[e[v][u].to], e[v][u].cost);
}
}
cout << res << endl;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.