code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAX = 200000, SENTINEL = 2100000000;
int L[MAX / 2 + 2], R[MAX / 2 + 2];
ll merge(int A[], int n, int left, int mid, int right) {
ll cnt = 0;
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) L[i] = A[left + i];
for (int i = 0; i < n2; i++) R[i] = A[mid + i];
L[n1] = R[n2] = SENTINEL;
int i = 0, j = 0;
for (int k = left; k < right; k++) {
if (L[i] <= R[j]) {
A[k] = L[i++];
} else {
A[k] = R[j++];
cnt += n1 - i;
}
}
return cnt;
}
ll msort(int A[], int n, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res += msort(A, n, left, mid);
res += msort(A, n, mid, right);
res += merge(A, n, left, mid, right);
}
return res;
}
int main(void) {
int n, A[MAX];
cin >> n;
for (int i = 0; i < n; i++) cin >> A[i];
cout << msort(A, n, 0, n) << endl;
return 0;
} | #include <cstdio>
#include <vector>
#include <algorithm>
int main()
{
int n,v,p;
long long m;
scanf("%d%lld%d%d",&n,&m,&v,&p);
std::vector<long long> A(n);
for(int i=0;i<n;i++){
scanf("%lld",&A[i]);
}
std::sort(A.begin(),A.end());
int l=-1,r=n-p;
while(l+1<r){
int d=(l+r)/2;
bool F=true;
if(A[d]+m<A[n-p]){
F=false;
}
else{
long long S=0ll;
for(int i=d+1;i<=n-p;i++){
S+=A[d]+m-A[i];
}
if(S>=std::max(v-p-d,0)*m){
F=true;
}
else{
F=false;
}
}
if(F){
r=d;
}
else{
l=d;
}
}
printf("%d\n",n-r);
return 0;
}
| 0 |
#ifdef __GNUC__
#include <bits/stdc++.h>
auto & in = std::cin;
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#else
std::istringstream in;
#endif
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/dynamic_bitset.hpp>
using namespace std;
#define ALL(v) std::begin(v),std::end(v)
using u6 = std::uint64_t;
using u3 = std::uint32_t;
constexpr u6 moduloNo = 1'000'000'000+7; //'
struct State {
array<u3, 3> buf;
//State() :buf{ 1,0,1 } {}
State() {}
State(u3 zerocount) :buf{ 1,0,zerocount } { addX(zerocount); }
void addX(u3 zero) {
if (zero != buf[2]){
u6 zerodiff = zero - buf[2];
buf[0] = (u3)(((u6)buf[0] + zerodiff * buf[1])%moduloNo);
buf[2] = zero;
}
buf[1] = buf[0]+buf[1];
buf[1] = (buf[1] >= moduloNo) ?buf[1] - moduloNo: buf[1];
}
};
u6 pow2(u6 n) {
if (n < 64)return (u6(1) << n)% moduloNo;
else if (n == 64)return (u6(0) - moduloNo) % moduloNo;
u6 tmp = pow2(n / 2);
tmp=tmp * tmp;
if (n & 1)tmp *= 2;
return tmp % moduloNo;
}
struct Calc {
u6 N;
unordered_map<u3, State> stmap;
Calc() {
in >> N;
}
u6 calc() {
u3 st = 0;
u3 tmp;
u3 zerocount = 0;
for (u3 index = 0; index < N; ++index) {
in >> tmp;
st ^= tmp;
if (!st) {
++zerocount;
//cout << index << endl;
}
else {
auto ite = stmap.find(st);
if (ite == stmap.end()) {
stmap.emplace(st, zerocount);
}
else {
ite->second.addX(zerocount);
}
}
}
if (st != 0) {
return stmap[st].buf[0];
}
else {
u6 result = pow2(zerocount-1);
for (auto & stv: stmap) {
result = (result + stv.second.buf[1])%moduloNo;
}
/*u6 sum0 = 0, sum1 = 0;
for (auto & stv : stmap) {
cout << stv.second.buf[0] << " " << stv.second.buf[1] << " " << stv.second.buf[2] << endl;
sum0 += stv.second.buf[0];
sum1 += stv.second.buf[1];
}
cout << sum0 << " " << sum1 << endl;*/
return result;
}
}
};
int main() {
#ifndef __GNUC__
in.str("32\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0");
#endif
Calc calc;
cout << calc.calc() << endl;
/*
u6 i = 0; u6 maxnum = 0;
for (auto & v : tbl.buf) {
for (auto n : v.buf) {
if (n > maxnum)maxnum = n;
}
}
cout << maxnum << endl;
for (auto & v : tbl.buf) {
cout << i << "=" << v << endl;
++i;
}
cout << maxnum << endl;*/
}
| //khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 600000 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000010;
const ll LOG = 25;
pii adj[N];
int a[4][N], n, ind[N], rev[N], fen[N], L[N], R[N];
void add(int id, int x){
for (id; id < N; id += (id) & (-id)) fen[id] += x;
}
int get(int id){
int res = 0;
for(; id > 0; id -= id & (-id)) res += fen[id];
return res;
}
int32_t main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= 3; j++){
for (int k = 1; k <= 3; k++){
if (k == j) continue;
if (adj[(i - 1) * 3 + j].F == 0) adj[(i - 1) * 3 + j].F = (i - 1) * 3 + k;
else adj[(i - 1) * 3 + j].S = (i - 1) * 3 + k;
}
}
}
for (int i = 1; i <= 3; i++){
for( int j = 1; j <= n; j++) cin >> a[i][j];
}
// for (int i = 1; i <= 3; i++){
// for (int j = 1; j <= n; j++) cout << a[i][j] << ' ';
// cout << '\n';
// }
// cout << a[3][4] << '\n';
for (int j = 1; j <= n; j++){
vi Nw;
// if (j == 4) cout << a[1][j] << ' ' << a[2][j] << ' ' << a[3][j] << '\n';
// cout << a[3][4] << '\n';
for (int i = 1; i <= 3; i++) Nw.pb(a[i][j]);
vi NN;
NN.pb(a[1][j]);
NN.pb(adj[a[1][j]].F);
NN.pb(adj[a[1][j]].S);
sort(all(Nw));
sort(all(NN));
// cout << a[3][4] << '\n';
// cout << j << '\n';
// if (j == 4) for (int j = 0; j < 3; j++) cout << Nw[j] << ' ' << NN[j] << '\n';
for( int i = 0; i < 3; i++) if (Nw[i] != NN[i]) return cout << "No", 0;
if (a[2][j] != ((a[1][j] - 1) / 3) * 3 + 2) return cout << "No", 0;
if (((a[1][j] - 1) / 3 + 1) % 2 != j % 2) return cout << "No", 0;
// cout << a[3][4] << '\n';
ind[(a[1][j] - 1) / 3 + 1] = j;
rev[(a[1][j] - 1) / 3 + 1] = (a[1][j] != ((a[1][j] - 1) / 3 * 3 + 1));
}
int inv = 0, cnt = 0;
for (int i = 1; i <= n; i += 2){
inv += get(n) - get(ind[i]);
L[i] = get(n) - get(ind[i]);
add(ind[i], 1);
}
memset(fen, 0, sizeof fen);
for (int i = n - ((n - 1) % 2); i >= 1; i -= 2){
R[i] = get(ind[i]);
add(ind[i], 1);
}
for (int i = 1; i <= n; i += 2){
int sm = L[i] + R[i];
cnt += (sm + rev[i]) % 2;
}
memset(fen, 0, sizeof fen);
int inv2 = 0, cnt2 = 0;
for (int i = 2; i <= n; i += 2){
inv2 += get(n) - get(ind[i]);
L[i] = get(n) - get(ind[i]);
add(ind[i], 1);
}
memset(fen, 0, sizeof fen);
for (int i = n - (n % 2); i >= 2; i -= 2){
R[i] = get(ind[i]);
add(ind[i], 1);
}
for (int i = 2; i <= n; i += 2){
int sm = L[i] + R[i];
cnt2 += (sm + rev[i]) % 2;
}
if ((inv % 2 == cnt2 % 2) && (inv2 % 2 == cnt % 2)) return cout << "Yes", 0;
cout << "No";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> ac(n);
vector<int> sum(n + 1, 0);
rep(i, n) {
if(i != n) {
if(s[i] == 'A' && s[i + 1] == 'C') {
ac[i]++;
i++;
}
}
}
rep(i, n) {
sum[i + 1] += sum[i] + ac[i];
}
/*cout << endl;
rep(i, n) cout << ac[i] << ' ';
cout << endl;
rep(i, n + 1) cout << sum[i] << ' ';
cout << endl;
//確認済*/
vector<vector<int>> l(q, vector<int>(2));
rep(i, q) {
rep(j, 2) cin >> l[i][j];
}
rep(i, q) {
cout << sum[l[i][1] - 1] - sum[l[i][0] - 1] << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
//**デバッグ準備**//
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
cerr << " " << h;
if (sizeof...(t) > 0) cerr << " :";
debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
ll ctoi(char c) {
switch (c) {
case '0': return 0; case '1': return 1; case '2': return 2;
case '3': return 3; case '4': return 4; case '5': return 5;
case '6': return 6; case '7': return 7; case '8': return 8;
case '9': return 9; default: return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
//rep, vin, all, iteLoop//
//gcdlcm, isPrime, eratos, Npow, divisor, modinv, bitSearch, bitList, dfs, bfs//
//dijkstra, WarshallFloyd, BellmanFord, UnionFind, COM, digitDP ,RMQ//
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z;
ll MOD = 1000000007; ll INF = 1LL << 60; ll ans = 0; ll z = 0, o = 1;
vl flag, color, D; vll path;
//***********//
int main() {
cin >> H >> W;
vll A(H, vl(W, 0));
vll B(H, vl(W, 0));
vll D(H+1, vl(W+1, 0));
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
cin >> A[i][j];
}
}
for (i = 0; i < H; i++) {
for (j = 0; j < W; j++) {
cin >> B[i][j];
D[i+1][j+1] = abs(A[i][j] - B[i][j]);
}
}
ll M = (H + W) * 80;
vector<vll> dp(H+1, vll(W+1, vl(M, 0)));
dp[1][1][D[1][1]] = 1;
for (i = 1; i <= H; i++) {
for (j = 1; j <= W; j++) {
for (k = 0; k < M; k++) {
if (i == H && j == W) continue;
if (i != H) {
if (k + D[i + 1][j] < M) dp[i + 1][j][k + D[i + 1][j]] |= dp[i][j][k];
if (abs(k - D[i + 1][j]) < M) dp[i + 1][j][abs(k - D[i + 1][j])] |= dp[i][j][k];
}
if (j != W) {
if (k + D[i][j + 1] < M) dp[i][j + 1][k + D[i][j + 1]] |= dp[i][j][k];
if (abs(k - D[i][j + 1]) < M) dp[i][j + 1][abs(k - D[i][j + 1])] |= dp[i][j][k];
}
}
}
}
for (k = 0; k < M; k++) {
if (dp[H][W][k]) {
cout << k;
exit(0);
}
}
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
int main()
{
int n;
long long sn, x, y;
vector<long long>p;
map<long, long>m;
while (1){
m.clear();
p.clear();
cin >> n;
if (n == 0)break;
for (int i = 0; i < n; i++){
cin >> sn >> x >> y;
if (m.find(sn) == m.end()){
p.push_back(sn);
}
m[sn] += x*y;
}
int flag = 0;
for (int i = 0; i < p.size(); i++){
if (m[p[i]] >= 1000000){
cout << p[i] << endl;
flag++;
}
}
if (flag==0)cout << "NA" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
long long pd,n,s,p[200005],loc,num,l,r,ss;
long long ans,val[200005];
int main(){
// freopen("go home.in","r",stdin);
// freopen("go home.out","w",stdout);
scanf("%lld%lld",&n,&s);
pd=0;l=1;r=n+1;
for (long long i=1;(i<=n);i++){
scanf("%lld%lld",&loc,&num);
if(pd==0)
if (loc>=s){
p[i]=s;val[i]=0;pd=1;ss=i;
}
p[i+pd]=loc;val[i+pd]=num;
}
if (pd==0) p[n+1]=s;
while (true){
if (p[l]>=p[ss]){
ans+=p[r]-p[l];
printf("%lld",ans);
return 0;
}
if (p[r]<=p[ss]){
ans+=p[r]-p[l];
printf("%lld",ans);
return 0;
}
ans+=p[r]-p[l];
if (val[l]>=val[r]){
while (val[l]>=val[r]){
val[l]+=val[r];
r--;
if (p[r]==p[ss]) break;
}
} else{
while (val[r]>val[l]){
val[r]+=val[l];
l++;
if (p[l]==p[ss]) break;
}
}
}
//fclose(stdin);fclose(stdout);
return 0;
} | 0 |
#include <stdio.h>
#define MAX_N 100
#define INF 1e8
int main(){
int N,i,j,k,l,q,r[MAX_N],c[MAX_N],p[MAX_N+1];
int dp[MAX_N+1][MAX_N+1];
scanf("%d",&N);
for(i = 0 ; i < N ; i++){
scanf("%d%d",&r[i],&c[i]);
}
p[0] = r[0];
for(i = 1 ; i <= N ; i++){
p[i] = c[i-1];
}
N++;
for(i = 0 ; i < N ; i++){
dp[i][i] = 0;
}
for(l = 2 ; l < N ; l++){
for(i = 1 ; i < N-l+1 ; i++){
j = i + l - 1;
dp[i][j] = INF;
for(k = i ; k <= j-1 ; k++){
q = dp[i][k] + dp[k+1][j] + p[i-1]*p[k]*p[j];
if(q < dp[i][j]){
dp[i][j] = q;
}
}
}
}
printf("%d\n",dp[1][N-1]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int mxn=2e5+3,du=1e9+7;
int m,n;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>m>>n;
map<int,int> mp;
multiset<int> s;
for (int i=1;i<=n;i++) mp[i]=i,s.insert(0);
for (int i=1;i<=m;i++)
{
int l,r;
cin>>l>>r;
auto it=mp.lower_bound(l);
int mx=0;
while(it!=mp.end()&&it->first<=r)
{
mx=max(mx,it->second);
int dis=(it->first)-(it->second);
s.erase(s.find(dis));
mp.erase(it++);
}
if (mx!=0&&r<n&&mp.find(r+1)==mp.end())
{
mp[r+1]=mx;
s.insert(r+1-mx);
}
// cout<<"DM";
if (s.size()) cout<<(*s.begin())+i<<"\n";
else cout<<-1<<"\n";
}
return 0;
}
| 0 |
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
void solve(){
ll n;
std::cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
string s;
std::cin >> s;
vector<vector<ll>> dp(n+1);
dp[n] = {0};
for (int i = n-1; i >= 0; i--) {
ll v = a[i];
for (auto e : dp[i+1]) {
v = min(v,v^e);
}
if(v==0){
dp[i] = dp[i+1];
}else{
if(s[i]=='0'){
dp[i+1].push_back(v);
sort(dp[i+1].rbegin(),dp[i+1].rend());
for (auto e : dp[i+1]) {
dp[i].push_back(e);
}
}else{
std::cout << 1 << std::endl;
return;
}
}
}
std::cout << 0 << std::endl;
}
int main() {
int t;
std::cin >> t;
for (int iii = 0; iii < t; iii++) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
int a[5], k;
rep(i, 5) cin >> a[i];
cin >> k;
bool ok = true;
rep(i, 5) {
for (int j = i+1; j < 5; j++) {
if (abs(a[i]-a[j]) > k) ok = false;
}
}
if (ok) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | 0 |
#include<stdio.h>
int main(void)
{
int m[12]={31,29,31,30,31,30,31,31,30,31,30,31};
int man,day;
int s;
int i;
scanf("%d %d",&man,&day);
while(man!=0){
s=0;
if(man!=1){
for(i=0;i<man-1;i++){
s+=m[i];
}
s+=day;
}
else {
s+=day;
}
// printf("%d\n",s);
s=s%7;
if(s==0){
printf("Wednesday\n");
}
else if(s==1){
printf("Thursday\n");
}
else if(s==2){
printf("Friday\n");
}
else if(s==3){
printf("Saturday\n");
}
else if(s==4){
printf("Sunday\n");
}
else if(s==5){
printf("Monday\n");
}
else if(s==6){
printf("Tuesday\n");
}
scanf("%d %d",&man,&day);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
vector<string> s(3);
rep(i,3) cin >> s[i];
int cur = 0;
while (true) {
string t = s[cur];
if (t.empty()) {
cout << char(cur + 'A') << endl;
return 0;
}
s[cur] = t.substr(1,t.size()-1);
cur = t[0] - 'a';
}
return 0;
} | 0 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
long N, A, B;
cin >> N >> A >> B;
vector<long> X(N);
for (int i=0; i<N; i++){
cin >> X[i];
}
long ans = 0;
for (int i=0; i<N-1; i++){
if ((X[i+1]-X[i]) * A < B){
ans += (X[i+1]-X[i]) * A;
}
else ans += B;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N, T;
cin >> N >> T;
vector<int> t(N);
rep(i, N) {
cin >> t[i];
}
long long sum = 0;
rep(i, N-1) {
sum += std::min(T, t[i+1] - t[i]);
}
sum += T;
cout << sum << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n, x; cin >> n;
x = int(sqrt(n));
while (n%x) x--;
cout << max(int(log10(x) + 1), int(log10(n/x) + 1)) << endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i != 0) continue;
ll ex = 0;
while (n % i == 0) {
++ex;
n /= i;
}
res.push_back({i, ex});
}
if (n != 1) res.push_back({n, 1});
return res;
}
//cin.tie(0);ios::sync_with_stdio(false);
int main() {
ll n;
cin >> n;
if (n == 1) {
cout << 1 << endl;
return 0;
}
vector<ll> primes;
for (auto v : prime_factorize(n)) {
for (ll i = 0; i < v.second; i++) {
primes.push_back(v.first);
}
}
vector<ll> ans;
ll tmp1, tmp2;
for (int bit = 0; bit < 1 << primes.size(); bit++) {
tmp1 = tmp2 = 1;
for (int j = 0; j < primes.size(); j++) {
if (bit & 1 << j) {
tmp1 *= primes[j];
} else {
tmp2 *= primes[j];
}
}
ans.push_back(max(to_string(tmp1).size(), to_string(tmp2).size()));
}
cout << *min_element(ans.begin(), ans.end()) << endl;
return 0;
}
| 1 |
#include <iostream>
#include <map>
using namespace std;
void solve()
{
int a[5];
while(~scanf("%d,%d,%d,%d,%d", &a[0], &a[1], &a[2], &a[3], &a[4], &a[5]))
{
map<int, int> Map;
for(int i = 0; i < 5; ++i)
{
++Map[a[i]];
}
if(Map.size() == 2)
{
int Max = 0;
for(map<int, int>::iterator Ite = Map.begin(); Ite != Map.end(); ++Ite)
{
if(Max < Ite->second)
{
Max = Ite->second;
}
}
if(Max == 3)
{
cout << "full house" << endl;
}
else
{
cout << "four card" << endl;
}
}
else if(Map.size() == 3)
{
int Max = 0;
for(map<int, int>::iterator Ite = Map.begin(); Ite != Map.end(); ++Ite)
{
if(Max < Ite->second)
{
Max = Ite->second;
}
}
if(Max == 3)
{
cout << "three card" << endl;
}
else
{
cout << "two pair" << endl;
}
}
else if(Map.size() == 4)
{
cout << "one pair" << endl;
}
else
{
map<int, int>::iterator Ite = Map.begin();
map<int, int>::iterator IteNext = Map.begin();
++IteNext;
map<int, int>::iterator IteEnd = Map.end();
IteEnd--;
if(IteEnd->first - Ite->first == 4 || IteNext->first - Ite->first == 9)
{
cout << "straight" << endl;
}
else
{
cout << "null" << endl;
}
}
}
}
int main()
{
solve();
return(0);
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
using namespace std;
char shima[13][13];
void tansaku(int x,int y){
if(x<0||x>11||y<0||y>11||shima[y][x]=='0')
return ;
if(shima[y][x]=='1'){
shima[y][x]='0';
}
tansaku(x+1,y);
tansaku(x-1,y);
tansaku(x,y+1);
tansaku(x,y-1);
}
int main(){
while(cin>>shima[0][0]){
for(int i=0;i<12;i++){
for(int j=0;j<12;j++){
if(i==0&&j==0)
continue;
else
cin>>shima[i][j];
}
}
int a=0;
for(int i=0;i<12;i++){
for(int j=0;j<12;j++){
if(shima[i][j]=='1'){
tansaku(j,i);
a++;
}
}
}
cout<<a<<endl;
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,x;
cin >> k >> x;
for(int i = x-k+1; i <= x + k - 2; i++){
cout << i << " ";
}
cout << x + k - 1 << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<math.h>
#include<map>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
int ans = 0;
switch (x)
{
case 1:
ans += 300000;
switch (y)
{
case 1:
ans += 700000;
break;
case 2:
ans += 200000;
break;
case 3:
ans += 100000;
break;
}
break;
case 2:
ans += 200000;
switch (y)
{
case 1:
ans += 300000;
break;
case 2:
ans += 200000;
break;
case 3:
ans += 100000;
break;
}
break;
case 3:
ans += 100000;
switch (y)
{
case 1:
ans += 300000;
break;
case 2:
ans += 200000;
break;
case 3:
ans += 100000;
break;
}
break;
default:
switch (y)
{
case 1:
ans += 300000;
break;
case 2:
ans += 200000;
break;
case 3:
ans += 100000;
break;
}
}
cout << ans << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
#define sz(x) (int((x).size()))
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
template<typename T> bool domax(T &a, T b) { return (b > a ? (a = b, true) : false); }
template<typename T> bool domin(T &a, T b) { return (b < a ? (a = b, true) : false); }
typedef long long ll;
const int maxc = 105, inf = 1e9;
int Y, X, s[maxc][maxc], ey, ex, dp[maxc][maxc][maxc][maxc], ans;
char g[maxc][maxc];
int bly, blx, bsy, bsx;
int sum(int ly, int lx, int sy, int sx) {
if (bly < ly) ly = bly;
if (blx < lx) lx = blx;
if (bsy > sy) sy = bsy;
if (bsx > sx) sx = bsx;
return std::max(0, s[ly+1][lx+1] - s[ly+1][sx] - s[sy][lx+1] + s[sy][sx]);
}
int main() {
scanf("%d%d", &Y, &X);
for (int y = 0; y < Y; y++) scanf(" %s", g[y]);
for (int y = 0; y < Y; y++) for (int x = 0; x < X; x++) {
if (g[y][x] == 'E') { ey = y; ex = x; }
s[y+1][x+1] = s[y+1][x] + s[y][x+1] - s[y][x];
if (g[y][x] == 'o') s[y+1][x+1]++;
}
int W = ex+1, E = X-ex;
int N = ey+1, S = Y-ey;
for (int w = 0; w < W; w++) for (int e = 0; e < E; e++) for (int n = 0; n < N; n++) for (int s = 0; s < S; s++) {
dp[w][e][n][s] = -inf;
}
dp[0][0][0][0] = 0;
for (int w = 0; w < W; w++) for (int e = 0; e < E; e++) for (int n = 0; n < N; n++) for (int s = 0; s < S; s++) {
domax(ans, dp[w][e][n][s]);
//if (ans == 5) {
// printf("%d %d %d %d\n", w, e, n, s);
// return 0;
//}
domax(dp[w+1][e][n][s], dp[w][e][n][s]);
domax(dp[w][e+1][n][s], dp[w][e][n][s]);
domax(dp[w][e][n+1][s], dp[w][e][n][s]);
domax(dp[w][e][n][s+1], dp[w][e][n][s]);
bsx = e; blx = X-1-w;
bsy = s; bly = Y-1-n;
if (e <= ex-(w+1)) domax(dp[w+1][e][n][s], dp[w][e][n][s] + sum(ey+s, ex-(w+1), ey-n, ex-(w+1)));
if (w <= X-1 - (ex+(e+1))) domax(dp[w][e+1][n][s], dp[w][e][n][s] + sum(ey+s, ex+(e+1), ey-n, ex+(e+1)));
if (s <= ey-(n+1)) domax(dp[w][e][n+1][s], dp[w][e][n][s] + sum(ey-(n+1), ex+e, ey-(n+1), ex-w));
if (n <= Y-1 - (ey+(s+1))) domax(dp[w][e][n][s+1], dp[w][e][n][s] + sum(ey+(s+1), ex+e, ey+(s+1), ex-w));
//if (dp[0][0][0][1] == 3) {
// printf("wtf %d %d %d %d\n", w, e, n, s);
// return 0;
//}
//if (dp[0][1][0][1] == 5) {
// printf("hi %d %d %d %d\n", w, e, n, s);
// return 0;
//}
}
printf("%d\n", ans);
}
| #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <climits>
using namespace std;
int mcm(vector<int>& p)
{
vector<vector<int> > m(p.size() - 1, vector<int>(p.size() - 1));
for (int i = 0; i < m.size(); i++) {
m[i][i] = 0;
}
/*
* l == number of targets
* i == left most of targets
*/
for (int l = 2; l <= m.size(); l++) {
for (int i = 0; i < m.size() - l + 1; i++) {
int j = i + l - 1;
m[i][j] = INT_MAX;
for (int k = i; k < j; k++) {
m[i][j] =
min(m[i][j],
m[i][k] + m[k + 1][j] + p[i] * p[k + 1] * p[j + 1]);
}
}
}
return m[0][m.size() - 1];
}
int main()
{
int n;
cin >> n;
vector<int> p(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> p.at(i - 1) >> p.at(i);
}
cout << mcm(p) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int A, B, c{}; cin >> A >> B;
for (int i{A}; i <= B; ++i)
{auto s{to_string(i)}, t{s}; reverse(begin(t), end(t));
c += s == t;}
cout << c;} | #include<bits/stdc++.h>
#define reg register
using namespace std;
inline int read() {
reg int s = 0, t = 0; reg char ch = getchar();
while(ch > '9' || ch < '0') t |= ch == '-', ch = getchar();
while(ch >= '0' && ch <= '9') s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
return t ? -s : s;
}
int n, m, a[301][301], d[301], pos[301], sum[301], minn = 190090, ans;
int main()
{
n = read(); m = read();
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++) a[i][j] = read();
sum[a[i][1]]++;
}
for(int i = m; i >= 1; i--){
ans = 0;
for(int j = 1; j <= m; j++) ans = max(ans, sum[j]);
minn = min(minn, ans);
for(int j = 1; j <= m; j++) {
if(sum[j] == ans){ pos[j] = 1; break;}
}
for(int j = 1; j <= m; j++) sum[j] = 0;
for(int j = 1; j <= n; j++)
for(int k = 1; k <= m; k++){
if(!pos[a[j][k]]) {sum[a[j][k]]++; break;}
}
}
cout << minn;
} | 0 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define PI 3.14159265359
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pai;
typedef pair<ll, ll> pal;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
int main(){
string s;
cin >> s;
cout << "2018" << s.substr(4, 6) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;//条件によってYes、Noを出力する
const int MOD=1000000007;
const double pi = 3.141592653589793;
int main(){
string s;
cin>>s;
int n=s.length();
if(n==2){
if(s[0]==s[1])cout<<"1 2"<<endl;
else cout<<"-1 -1"<<endl;
return 0;
}
rep(i,n-1){
string t = s.substr(i,3);
if(t[0]==t[1]||t[1]==t[2]||t[0]==t[2]){
cout<<i+1<<" "<<i+3<<endl;
return 0;
}
}
cout<<-1<<" "<<-1<<endl;
} | 0 |
///not today
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef pair<long long, long long> pll;
#define SZ(x) (int)(x).size()
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define xmax(x, y) (x) = max((x), (y))
#define xmin(x, y) (x) = min((x), (y))
#define F first
#define S second
#define int long long
#define accept_sho ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#define lc (v << 1)
#define rc ((v << 1)| 1)
#define MID ((R + L) >> 1)
const int mod = 998244353, maxn = 1e6 + 3;
int fc[maxn];
int pw(int a, int b){
int ans = 1;
for(int i = 30; i >= 0; i --){
ans *= ans; ans %= mod;
if(b & (1 << i)){
ans *= a; ans %= mod;
}
}
return ans;
}
int c(int k, int n){
if(k == 0){
return 1;
}
if(k > n){
return 0;
}
int ans = fc[n];
ans *= pw(fc[k], mod - 2); ans %= mod;
ans *= pw(fc[n - k], mod - 2); ans %= mod;
return ans;
}
int32_t main(){
accept_sho
int n, m;
cin >>n >>m;
fc[0] = 1;
for(int i = 1; i < maxn - 1; i ++){
fc[i] = fc[i - 1] * i; fc[i] %= mod;
}
int ans = max(n, m);
for(int i = 1; i <= min(n, m); i ++){
int x = ( c(n - i, n + m - (2 * i)) * c(i, 2 * i) )% mod;
x *= pw(c(n, n + m) ,mod - 2); x %= mod;
x *= pw(2, mod - 2); x %= mod;
ans = (ans + x)% mod;
}
cout <<ans <<endl;
return false;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000, mod = 998244353, inv2 = (mod + 1) / 2;
int n, m, s, w, d, w2, ans;
int fac[maxn + 10], ifac[maxn + 10], inv[maxn + 10];
inline int add(int x, int y) {
x += y; return x < mod ? x : x - mod;
}
inline int dec(int x, int y) {
x -= y; return x < 0 ? x + mod : x;
}
inline int mul(int x, int y) {
return 1ll * x * y % mod;
}
void prework() {
fac[0] = ifac[0] = 1;
for (int i = 1; i <= maxn; ++i) {
fac[i] = mul(fac[i - 1], i);
inv[i] = i == 1 ? 1 : dec(0, mul(mod / i, inv[mod % i]));
ifac[i] = mul(ifac[i - 1], inv[i]);
}
}
int comb(int x, int y) {
return y < 0 || y > x ? 0 : mul(fac[x], mul(ifac[y], ifac[x - y]));
}
int f(int x, int y) {
return comb(x + y, x);
}
int main() {
prework();
scanf("%d%d", &n, &m);
w = comb(n + m - 1, n); w2 = comb(n + m - 1, m); d = 1;
s = add(s, add(w, w2));
for (int i = m - 2; i >= -n - 1; --i) {
ans = add(ans, mul(s, inv[d]));
++d;
if (d & 1) {
w = add(w, mul(f(i + d / 2, n - d / 2), f(m - (i + d / 2) - 2, d / 2)));
w2 = add(w2, mul(f(m - d / 2, n - (d - d / 2)), f(d / 2, d - d / 2 - 2)));
} else {
w = dec(w, mul(f(i + d / 2, n - d / 2), f(m - (i + d / 2) - 1, d / 2 - 1)));
w2 = dec(w2, mul(f(m - d / 2, n - (d - d / 2)), f(d / 2 - 1, d - d / 2 - 1)));
}
s = add(s, add(w, w2));
}
printf("%d", mul(ans, mul(ifac[n + m], mul(fac[n], fac[m]))));
} | 1 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <math.h> // sqrt()
#include <iomanip>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, it, it2;
it = 0;
it2 = 0;
char a;
cin >> n;
int sum = n;
vector<char> str;
rep(i , n){
cin >> a;
str.push_back(a);
}
rep(i , n){
if (i == 0){
it2 = int(count(str.begin() + 1, str.end(), 'E'));
}
else{
if (str.at(i - 1) == 'W')
it++;
if (str.at(i) == 'E')
it2--;
}
sum = min(sum , it + it2);
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> E(N + 1), W(N + 1);
for (int i = 1; i < N + 1; i++) {
E.at(i) = E.at(i - 1) + (S.at(i - 1) == 'E');
W.at(i) = W.at(i - 1) + (S.at(i - 1) == 'W');
}
int ans = 2e9;
for (int i = 0; i < N + 1; i++) {
ans = min(ans, E.at(N) - E.at(i) + W.at(i));
}
cout << ans << "\n";
} | 1 |
#include <iostream>
using namespace std;
int main(){
while (true)
{
int n, a[5001] = {};
long long int ans = -100000, sum;
cin >> n;
if (n == 0) { break; }
for(int i = 0;i<n;i++){
cin >> a[i];
}
for(int i = 0;i<n;i++){
sum = 0;
for(int j = i;j<n;j++){
sum += a[j];
if(sum > ans){
ans = sum;
}
}
}
cout << ans << endl;
}
return 0;
} | #include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#include <valarray>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <complex>
#include <list>
#include <time.h>
#include <stack>
#include <locale>
#include <clocale>
#include <ctype.h>
#include <wchar.h>
using namespace std;
typedef long long int LL;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int xcomp(vector<LL>& a, vector<LL>& b) {
return a[0] < b[0];
}
#define XSORT(c) sort((c).begin(),(c).end(),xcomp)
#define ALL(x) (x).begin(),(x).end()
LL mod = 1000000007;
int main() {
int N;
cin >> N;
REP(i, N) {
int a1 = 0;
int a2 = 0;
int a3 = 0;
int out = 0;
int pt = 0;
while (true) {
string s;
cin >> s;
if (s[1] == 'I') {
if (a3 == 1) {
a3 = 0;
pt++;
}
if (a2 == 1) {
a2 = 0;
a3 = 1;
}
if (a1 == 1) {
a1 = 0;
a2 = 1;
}
a1 = 1;
}
else
if (s[1] == 'U') {
out++;
if (out == 3) {
break;
}
}
else {
if (a1 == 1) {
a1 = 0;
pt++;
}
if (a2 == 1) {
a2 = 0;
pt++;
}
if (a3 == 1) {
a3 = 0;
pt++;
}
pt++;
}
}
cout << pt << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n; cin>>n;
set<int> st;
rep(i,n){
int a; cin>>a;
if(st.count(a)==1) st.erase(a);
else st.insert(a);
}
cout<<st.size()<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N);
vector<int>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.begin(),A.end());
sort(C.begin(),C.end());
int ans = 0;
for(int i = 0; i < N; i++) {
int cnt = 1;
int it = lower_bound(A.begin(),A.end(),B[i])-A.begin();
cnt*=it;
it = C.end()-upper_bound(C.begin(),C.end(),B[i]);
cnt*=it;
ans+=cnt;
}
cout << ans << endl;
}
| 0 |
#include <iostream>
using namespace std;
int main()
{
string test;
getline(cin,test);
if (test[0] == 'A' && test[1] == 'C')
{
cout << "Yes" << endl;
}
else if(test[1] == 'A' && test[2] == 'C')
{
cout << "Yes" << endl;
}
else if(test[2] == 'A' && test[3] == 'C')
{
cout << "Yes" << endl;
}
else if(test[3] == 'A' && test[4] == 'C')
{
cout << "Yes" << endl;
}
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
#if 1
//-------------
// DUMPマクロ
// https://www.creativ.xyz/dump-cpp-652/
// vector
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
for (T& x : vec) is >> x;
return is;
}
// pair
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// vector
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// map
template <typename T, typename U>
ostream& operator<<(ostream& os, map<T, U>& map_var) {
os << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set
template <typename T>
ostream& operator<<(ostream& os, set<T>& set_var) {
os << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
#define DUMPOUT cerr
void dump_func() {
DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&& ... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
#ifdef DEBUG
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#endif
signed main() {
string s;
cin>>s;
if(s.find("AC")==s.npos) No;
else Yes;
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2000+10,mod=1e9+7;
ll f[maxn][maxn];
ll s[maxn*maxn+10],invs[maxn*maxn+10];
int n,m;
inline void read(int &x){
char c=getchar();
int f=1;
x=0;
while(c<'0' || c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0' && c<='9'){x=x*10+c-'0';c=getchar();}
x*=f;
}
inline long long ksm(ll x,int y){
ll sum=1;
while(y){
if(y&1){sum=(sum*x)%mod;}
y/=2;
x=(x*x)%mod;
}
return sum%mod;
}
inline ll cal(int x,int y){
//cout<<s[x]<<" "<<s[y]<<endl;
ll sum2=1,sum1=1,sum=0;
//for(register int i=1;i<=y;i++)sum1=(sum1*i)%mod;
//for(register int i=x-y+1;i<=x;i++)sum2=(sum2*i)%mod;
//sum2=s[x];sum1=(s[x-y]*s[y])%mod;
//sum=(sum2*ksm(sum1,mod-2))%mod;
sum=((s[x]*invs[y])%mod*invs[x-y])%mod;
//cout<<sum<<endl;
return sum%mod;
}
int main(){
int i,j,k;
read(n);read(m);
//cout<<n<<" "<<m<<endl;
if(m==1){cout<<1<<endl;return 0;}
f[0][0]=1;
s[0]=1;
//for(register int i=1;i<=n;i++)f[i][0]=1;
for(register int i=1;i<=maxn*maxn;i++){s[i]=(s[i-1]*i)%mod;}
invs[maxn*maxn]=ksm(s[maxn*maxn],mod-2);
for(register int i=maxn*maxn-1;i>=0;i--)invs[i]=(invs[i+1]*(i+1))%mod;
for(register int i=1;i<=n;i++)
for(register int j=0;j<=i;j++){
if(!j)f[i][j]=f[i-1][j]%mod;
else f[i][j]=(f[i-1][j]+((f[i][j-1]*(n-j+1))%mod*cal(n*m-(j-1)*(m-1)-i-1,m-2)))%mod;
}
cout<<f[n][n]<<endl;
return 0;
} | #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
#define int ll
//#define double long double
#define endl '\n'
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define mp make_pair
#define pb emplace_back
#define dbg(x) cerr << #x << " : " << x << endl
//#define PI 3.141592653589
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair <int, int>;
using pld = pair <ld, ld>;
/*
const ll MAX_MEM = 25e7;
char MEM[MAX_MEM];
ll MEM_POS = 0;
void* operator new(size_t x)
{
auto ret = MEM + MEM_POS;
MEM_POS += x;
assert(MEM_POS < MAX_MEM);
return ret;
}
void operator delete(void*)
{}
*/
template <class T>
istream& operator>> (istream &in, vector <T> &a)
{
for (auto &i : a)
in >> i;
return in;
}
template <class T>
ostream& operator<< (ostream &out, vector <T> a)
{
for (auto &i : a)
out << i << ' ';
return out;
}
template <class T, class U>
istream& operator>> (istream &in, pair <T, U> &p)
{
in >> p.first >> p.second;
return in;
}
template <class T, class U>
ostream& operator<< (ostream &out, pair <T, U> p)
{
out << p.first << " " << p.second << " ";
return out;
}
inline void Start()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
//freopen("lol.in", "r", stdin);
//freopen("lol.out", "w", stdout);
}
const int P = 1e9 + 7;
int add(int a, int b)
{
return a + b >= P ? a + b - P : a + b;
}
int mul(int a, int b)
{
return a * b % P;
}
int bpow(int a, int n)
{
int res = 1;
while (n)
{
if (n & 1)
res = mul(res, a);
a = mul(a, a);
n >>= 1;
}
return res;
}
int rev(int x)
{
return bpow(x, P - 2);
}
int sub(int a, int b)
{
return add(a, P - b);
}
int divi(int a, int b)
{
return mul(a, rev(b));
}
struct combinations
{
vector <int> fact, revfact;
combinations() {}
combinations(int n)
{
fact.assign(n, 1);
revfact.assign(n, 1);
for (int i = 1; i < n; ++i)
fact[i] = mul(fact[i - 1], i), revfact[i] = divi(revfact[i - 1], i);
}
int operator() (int n, int k)
{
return mul(fact[n], mul(revfact[k], revfact[n - k]));
}
};
signed main()
{
Start();
int n, k;
cin >> n >> k;
combinations c(2001 * 2001);
if (k == 1)
return cout << 1, 0;
vector <vector <int>> dp(n + 1, vector <int> (n + 1));
dp[0][0] = 1;
for (int i = 0; i <= n; ++i)
{
for (int j = (i ? 0 : 1); j <= n; ++j)
{
if (j < i)
continue;
if (i)
dp[i][j] = add(dp[i][j], dp[i - 1][j]);
if (j)
dp[i][j] = add(dp[i][j], mul(dp[i][j - 1], c(i + j * (k - 1) - 1, k - 2)));
}
}
cout << mul(dp[n][n], c.fact[n]);
return 0;
}
| 1 |
#include <iostream>
int main(){
int n=0,A=0,B=0;
while(std::cin >> n, n){
for(int i=0;i<n;i++){
int a=0,b=0;
std::cin>>a>>b;
int ab=a+b;
if(a>b){
A+=ab;
}else{
if(a<b){
B+=ab;
}else{
A+=a;
B+=b;
}
}
}
std::cout<<A<<" "<<B<<std::endl;
A=0,B=0;
}
return 0;
} | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int A,B,C,N;
cin>>A>>B>>C;
if(A==0&&B==0&&C==0)break;
cin>>N;
int lis[1000][4];
for(int i=0;i<N;i++)cin>>lis[i][0]>>lis[i][1]>>lis[i][2]>>lis[i][3];
int che[301];
for(int i=1;i<=300;i++)che[i]=2;
for(int i=0;i<N;i++){
if(lis[i][3]==1)che[lis[i][0]]=1,che[lis[i][1]]=1,che[lis[i][2]]=1;
}
for(int i=0;i<N;i++){
if(che[lis[i][0]]==1&&che[lis[i][1]]==1&&lis[i][3]==0)che[lis[i][2]]=0;
if(che[lis[i][0]]==1&&che[lis[i][2]]==1&&lis[i][3]==0)che[lis[i][1]]=0;
if(che[lis[i][1]]==1&&che[lis[i][2]]==1&&lis[i][3]==0)che[lis[i][0]]=0;
}
for(int i=1;i<=A+B+C;i++)cout<<che[i]<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
using namespace std;
const int MAXN = 110;
int n;
ll a[MAXN];
void work() {
scanf("%d", &n);
for(reg int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
int ans = 0;
for(reg int i = 1; i <= n; ++i) {
for(reg int j = i + 1; j <= n; ++j) {
for(reg int k = j + 1; k <= n; ++k) {
if(a[i] != a[j] && a[j] != a[k] && a[i] != a[k]) {
if(a[i] + a[j] > a[k] && a[i] + a[k] > a[j] && a[j] + a[k] > a[i]) ++ans;
}
}
}
}
printf("%d\n", ans);
}
signed main() {
int _ = 1;
// scanf("%d", &_);
while(_--) {
work();
}
return 0;
}
| #include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=1e9+7;
const long double PI = acos(0);
template <class T>void UNIQUE(vector<T> &x){
sort(all(x));
x.erase(unique(all(x)), x.end());
}
// }}} End Header
int main() {
int n, ans = 0;
cin >> n;
vector<ll> l(n);
map<ll, ll> dict;
rep(i,n){
cin >> l[i];
dict[l[i]]++;
}
UNIQUE(l);
if(l.size()<3){
cout << 0 << endl;
return 0;
}
rep(i,l.size()-2){
loop(j, i+1, l.size()-1){
loop(k, j+1, l.size()){
if(l[i]+l[j] > l[k]){
//cout << l[i] << l[j] << l[k] << endl;
ans+=(dict[l[i]]*dict[l[j]]*dict[l[k]]);
}
}
}
}
cout << ans << endl;
return 0;
} | 1 |
#include <stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <complex>
using ll = long long int;
using namespace std;
int main(){
ll N, tmp;
vector<ll> A;
cin >> N;
for(ll i = 0; i < N; i++){
cin >> tmp;
A.push_back(tmp);
}
// if N is even
if(N%2 == 0){
cerr << "N is even." << endl;
vector<ll> accum(N);
accum[0] = A[0];
for(ll i = 2; i < N; i+=2){
accum[i] = accum[i-2] + A[i];
}
accum[N-1] = A[N-1];
for(ll i = N-3; i >= 1; i-=2){
accum[i] = accum[i+2] + A[i];
}
ll ans = max(accum[N-2], accum[1]);
for(ll i = 0; i<=N-4; i+=2){
ans = max(ans, accum[i]+accum[i+3]);
}
cerr << "Answer:" << endl;
cout << ans << endl;
return 0;
}
// N is odd
else{
cerr << "N is odd." << endl;
vector<ll> accum(N);
accum[0] = A[0];
for(ll i = 2; i < N; i++){
accum[i] = accum[i-2] + A[i];
}
accum[N-2] = A[N-2];
for(ll i = N-4; i >= 1; i-=2){
accum[i] = accum[i+2] + A[i];
}
vector<ll> diff(N);
for(ll i = 1; i <= N-4; i+=2){
diff[i] = accum[i-1] + accum[i+2] - accum[1];
}
for(ll i = 2; i <= N-3; i+=2){
diff[i] = accum[N-1]-accum[i] + accum[1] - accum[i+1] - accum[1];
}
diff[N-2] = accum[N-3] - accum[1];
diff[0] = accum[2] - accum[1];
vector<ll> eomax(N);
eomax[N-3] = diff[N-3];
for(ll i = N-5; i >= 0; i-=2){
eomax[i] = max(eomax[i+2], diff[i]);
}
ll ans = max(max(accum[N-1]-accum[0], accum[N-3]), accum[1]);
for(ll oe = 1; oe < N-2; oe+=2){
ans = max(ans, accum[1]+diff[oe]+eomax[oe+1]);
}
cerr << "Answer:" << endl;
cout << ans << endl;
return 0;
}
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
void chmax(ll &a, const ll b) { if (a < b) a = b; return; }
const ll INF = 1ll<<60;
int main() {
int n; cin >> n;
vector<ll> a(n); for (int i = 0; i < n; i++) cin >> a[i];
if (n % 2 == 0) {
ll count = 0;
for (int i = 0; i < n; i += 2) count += a[i];
ll ans = count;
for (int i = n-2; i >= 0; i -= 2) {
count += a[i+1];
count -= a[i];
chmax(ans,count);
}
cout << ans << endl;
return 0;
}
else {
vector<vector<ll>> dp(n+2,vector<ll>(3,-INF));
dp[0][0] = 0ll;
for (int i = 1; i <= n+1; i++) {
for (int j = 0; j < 3; j++) {
if (i-2 >= 0) chmax(dp[i][j], dp[i-2][j] + a[i-2]);
}
for (int j = 1; j < 3; j++) {
if (i-1 >= 0) chmax(dp[i][j], dp[i-1][j-1]);
}
}
cout << dp[n+1][2] << endl;
return 0;
}
} | 1 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
using namespace std;
#define pi 3.141592653589793
int solve(int n, int p[])
{
int result[101][101];
for(int i = 0; i < n + 1; i++){
for(int j = 0; j < n + 1; j++){
if(i == j) result[i][j] = 0;
else result[i][j] = 1000000;
}
}
for(int i = 2; i < n + 1; i++){
for(int j = 1; j < n - i + 2; j++){
for(int k = j; k < j + i - 1; k++){
result[j][j + i - 1] = min(result[j][j + i - 1], result[j][k] + result[k + 1][j + i - 1] + p[j - 1] * p[k] * p[j + i - 1]);
}
}
}
// i : 掛け合わせる行列の個数
// j : 掛け合わせる行列のうち一番左のもの
// k : 左から何番目で分けるか
return result[1][n];
}
int main()
{
int n;
cin >> n;
int p[101];
for(int i = 1; i < n + 1; i++){
cin >> p[i - 1] >> p[i];
}
cout << solve(n, p) << endl;
return 0;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps == pt) {
ps = buf, pt = buf + fread(buf, 1, IN_BUF, stdin);
}
return ps == pt ? EOF : *ps++;
}
template<typename T>
inline bool read(T &x) {
bool op = 0;
char ch = getchar();
x = 0;
for (; !isdigit(ch) && ch != EOF; ch = getchar()) {
op ^= (ch == '-');
}
if (ch == EOF) {
return false;
}
for (; isdigit(ch); ch = getchar()) {
x = x * 10 + (ch ^ '0');
}
if (op) {
x = -x;
}
return true;
}
inline int readStr(char *s) {
int n = 0;
char ch = getchar();
for (; isspace(ch) && ch != EOF; ch = getchar())
;
for (; !isspace(ch) && ch != EOF; ch = getchar()) {
s[n++] = ch;
}
s[n] = '\0';
return n;
}
inline void myPutchar(char x) {
static char pbuf[OUT_BUF], *pp = pbuf;
struct _flusher {
~_flusher() {
fwrite(pbuf, 1, pp - pbuf, stdout);
}
};
static _flusher outputFlusher;
if (pp == pbuf + OUT_BUF) {
fwrite(pbuf, 1, OUT_BUF, stdout);
pp = pbuf;
}
*pp++ = x;
}
template<typename T>
inline void print_(T x) {
if (x == 0) {
putchar('0');
return;
}
static int num[40];
if (x < 0) {
putchar('-');
x = -x;
}
for (*num = 0; x; x /= 10) {
num[++*num] = x % 10;
}
while (*num){
putchar(num[*num] ^ '0');
--*num;
}
}
template<typename T>
inline void print(T x, char ch = '\n') {
print_(x);
putchar(ch);
}
inline void printStr_(const char *s, int n = -1) {
if (n == -1) {
n = strlen(s);
}
for (int i = 0; i < n; ++i) {
putchar(s[i]);
}
}
inline void printStr(const char *s, int n = -1, char ch = '\n') {
printStr_(s, n);
putchar(ch);
}
}
using namespace IO;
const int N = 100005;
int n, m, q, a[N], b[N];
void solve() {
read(n), read(m), read(q);
for (int i = 1; i <= n; ++i) {
read(a[i]);
}
for (int i = 1; i <= m; ++i) {
read(b[i]);
}
int ans = *std::min_element(a + 1, a + 1 + n) + *std::min_element(b + 1, b + 1 + m);
for (int i = 1; i <= q; ++i) {
int x, y, c;
read(x), read(y), read(c);
ans = std::min(ans, a[x] + b[y] - c);
}
print(ans);
}
int main() {
int T = 1;
// read(T);
while (T--) {
solve();
}
}
| 0 |
#include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int i,k,x;
cin >> k >> x;
for(i=x-k+1;i<=k+x-1;i++){
if(i==x-k+1){
printf("%d",i);
}
else{
printf(" %d",i);
}
}
printf("\n");
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
#define coutfix(i) cout << fixed << setprecision(i) //coutの浮動小数出力の桁数設定
using namespace std;
const int64 mod = 998244353;
int64 mpow(int64 mm, int64 xx)
{
if(xx == 0)
{
return 1;
}
int64 tmp = mpow(mm, xx / 2);
tmp *= tmp;
tmp %= mod;
if(xx % 2 == 1)
{
tmp *= mm;
tmp %= mod;
}
return tmp;
}
int main()
{
int64 kk, xx;
cin >> kk >> xx;
for(int64 ii = xx - kk + 1;ii <= xx + kk - 2;ii++)
{
cout << ii << ' ';
}
cout << (xx + kk - 1) << endl;
return 0;
} | 1 |
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int n; cin >> n; cout << n / 3;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<3)
cout<<0;
else if (n%3==0)
cout<<n/3;
else if(n%3!=0){
while(true){
n++;
if(n%3==0){
cout<<n/3-1;
break;
}
}
}
return 0;
} | 1 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
int main(){
int N;
std::vector<int> vec;
std::cin>>N;
if(N==0){
std::cout<<0<<std::endl;
return 0;
}
while(N!=0){
vec.emplace_back(abs(N%2));
N-=abs(N%2);
N/=-2;
}
for(int i=vec.size()-1;0<=i;i--) std::cout<<vec[i];
std::cout<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
const ll INF=LLONG_MAX;
ll pow2[32];
vector<char>s(32,'0');
vll dp,dp2;
void init(){
pow2[0]=1LL;
for(int i=1; i<32; i++)
pow2[i] = pow2[i-1]*2LL;
for(int i=0; i<32; i+=2){
if(dp.empty())dp.eb(pow2[i]);
else dp.eb(pow2[i]+dp.back());
}
for(int i=1; i<32; i+=2){
if(dp2.empty())dp2.eb(pow2[i]);
else dp2.eb(pow2[i]+dp2.back());
}
}
void solve(int x){
if(x==0)return;
else if(x<0){
auto ptr = lower_bound(all(dp2),x*-1)-dp2.begin();
int next = x+pow2[ptr*2+1];
s[ptr*2+1]='1';
solve(next);
}else{
auto ptr = lower_bound(all(dp),x)-dp.begin();
int next = x-pow2[ptr*2];
s[ptr*2]='1';
solve(next);
}
return;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
//freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
int x; cin >> x;
init();
if(x==0){
cout << 0 << endl;
return 0;
}
solve(x);
reverse(all(s));
bool st=0;
for(auto ch:s){
if(ch=='1')st=1;
if(st)cout << ch;
}
}
// READ & UNDERSTAND
// ll, int overflow, array bounds, memset(0)
// special cases (n=1?), n+1 (1-index)
// do smth instead of nothing & stay organized
// WRITE STUFF DOWN
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n;
cin >> n;
if (n == 1) {
cout << "Hello World";
} else {
int a, b;
cin >> a >> b;
cout << a + b << '\n';
}
return 0;
} | #include<cstdio>
#include<iostream>
int main(){
int nowpoint,wran[3]={0},kran[3]={0},wsum=0,ksum=0;
for(int i=0;i<10;i++){
scanf("%d",&nowpoint);
if(wran[0]<nowpoint)
wran[2]=wran[1],wran[1]=wran[0],wran[0]=nowpoint;
else if(wran[1]<nowpoint)
wran[2]=wran[1],wran[1]=nowpoint;
else if(wran[2]<nowpoint)
wran[2]=nowpoint;
}
for(int i=0;i<10;i++){
scanf("%d",&nowpoint);
if(kran[0]<nowpoint)
kran[2]=kran[1],kran[1]=kran[0],kran[0]=nowpoint;
else if(kran[1]<nowpoint)
kran[2]=kran[1],kran[1]=nowpoint;
else if(kran[2]<nowpoint)
kran[2]=nowpoint;
}
for(int i=0;i<3;i++)
wsum+=wran[i],ksum+=kran[i];
printf("%d %d\n",wsum,ksum);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class T> void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d=stod(t);
}
void read(long double& d) {
string t;
read(t);
d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
read(h);
read(t...);
}
template<class A> void read(vt<A>& x) {
EACH(a, x)
read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
EACH(a, x)
read(a);
}
string to_string(char c) {
return string(1, c);
}
string to_string(bool b) {
return b?"true":"false";
}
string to_string(const char* s) {
return string(s);
}
string to_string(string s) {
return s;
}
string to_string(vt<bool> v) {
string res;
FOR(sz(v))
res+=char('0'+v[i]);
return res;
}
template<size_t S> string to_string(bitset<S> b) {
string res;
FOR(S)
res+=char('0'+b[i]);
return res;
}
template<class T> string to_string(T v) {
bool f=1;
string res;
EACH(x, v) {
if(!f)
res+=' ';
f=0;
res+=to_string(x);
}
return res;
}
template<class A> void write(A x) {
cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) {
write(h);
write(t...);
}
void print() {
write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) {
write(h);
if(sizeof...(t))
write(' ');
print(t...);
}
void DBG() {
cerr << "]" << endl;
}
template<class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h);
if(sizeof...(t))
cerr << ", ";
DBG(t...);
}
#ifdef _DEBUG
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
template<class T> void offset(ll o, T& x) {
x+=o;
}
template<class T> void offset(ll o, vt<T>& x) {
EACH(a, x)
offset(o, a);
}
template<class T, size_t S> void offset(ll o, ar<T, S>& x) {
EACH(a, x)
offset(o, a);
}
mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
return uniform_int_distribution<ll>(a, b)(mt_rng);
}
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
ll mod=1e9+7;
const int N=1e6+5;
const ld PI=2*acos(0.0);
ll modpow(ll a, ll b){
ll res=1; a%=mod;
while(b){
if(b&1){ res=(res*a)%mod;}
a=(a*a)%mod;
b>>=1;
}
return res;
}
#define lcm(a,b) ((a)*(b))/(__gcd(a,b))
bool compare(array<int,2> a,array<int,2> b){
return a[0]<b[0];
}
void solve() {
int n,t; read(n,t);
vt<array<int,2> > td(n+1);
FOR(i,1,n+1) read(td[i][0],td[i][1]);
sort(++td.begin(),td.end(),compare);
int siz=(*--td.end())[0]+t+5;
vt<int> dp(siz,0);
vt<int> pre(siz,0);
FOR(i,1,n+1){
FOR(j,1,siz){
if(j-td[i][0]<0||j-td[i][0]>=t) { dp[j]=pre[j];}
else{ dp[j]=max(pre[j],pre[j-td[i][0]]+td[i][1]);}
}
FOR(j,1,siz){ pre[j]=dp[j]; dp[j]=0; }
//dbg(i,pre);
}
print(*max_element(all(pre)));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
| #include<bits/stdc++.h>
using namespace std;
//#pragma region atcoder
/*#include <atcoder/dsu>
using namespace atcoder;*/
//using mint = modint998244353;
//These are for segment tree
/*int op(int a, int b){return max(a, b);}
int e(){return -1;}
bool f(int v){ return v < target;}
*/
#pragma endregion
#pragma region macros
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vl = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rrep(i, n) for(int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#pragma endregion
#pragma region debug for var, v, vv
#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){cout << endl;int cnt = 0;for(const auto& v : vv){cout << cnt << "th : "; view(v); cnt++;} cout << endl;}
#pragma endregion
const ll mod = 1000000007;
const int inf = 1001001001;
const ll INF = 1001001001001001001;
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 modpow(ll a, ll p){ll ret = 1; while(p){if(p & 1){ret = ret * a % mod;} a = a * a % mod; p >>= 1;} return ret;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
/*-----------------------------------------------------------------------------------------------------*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t; cin >> n >> t;
vector<pair<int, int>> p(n);
rep(i,n) cin >> p[i].first >> p[i].second;
sort(all(p));
vvi dp(n + 1, vi(t));
rep(i,n){
rep(j,t){
chmax(dp[i + 1][j], dp[i][j]);
if(j - p[i].first >= 0) chmax(dp[i + 1][j], dp[i][j - p[i].first] + p[i].second);
}
}
int ans = 0;
rep(i,n){
ans = max(ans, dp[i][t - 1] + p[i].second);
}
cout << ans << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll N, Q;
string S;
ll solve(ll k) {
ll ret = 0;
ll D = 0;
ll M = 0;
ll C = 0;
REP(i, N) {
if (i - k >= 0) {
ll index = i - k;
if (S[index] == 'D') {
D--;
C -= M;
}
else if (S[index] == 'M') {
M--;
}
}
if (S[i] == 'C')
ret += C;
else if (S[i] == 'M') {
M++;
C += D;
}
else if (S[i] == 'D')
D++;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> S >> Q;
REP(i, Q) {
ll k;
cin >> k;
cout << solve(k) << endl;
}
return 0;
} | #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;
int main() {
int n;
while(cin>>n,n) {
REP(i,n) {
int m,e,j;
cin >> m >> e >> j;
char c;
if (m == 100 || e == 100 || j == 100)
c = 'A';
else if (m + e >= 180)
c = 'A';
else if (m + e + j >= 240)
c = 'A';
else if (m + e + j >= 210)
c = 'B';
else if (m + e + j >= 150 && (m >= 80 || e >= 80))
c = 'B';
else
c = 'C';
cout << c << endl;
}
}
} | 0 |
////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - [email protected]
#include<bits/stdc++.h>
using namespace std;
#define E end()
#define B begin()
#define sz size()
#define EM empty()
#define fi first
#define se second
#define cl clear()
#define sqr(a) (a*a)
#define mk make_pair
#define po pop()
#define pu push
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
string en="\n";
string sp=" ";
string t="hello";
string Y="YES\n";
string N="NO\n";
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define per(i,n) for(i=n-1;i>=0;i--)
#define peR(i,n) for(i=n;i>0;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define all(cont) cont.begin(),cont.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define pi 3.1415926535897932384626433832795
#define vi vector<long long>
#define vs vector<string>
#define MX LLONG_MAX
#define MN LLONG_MIN
#define MOD 1000000007
#define vp(vi,x) cin>>x; vi.pb(x);
#define bsearch(a,x) binary_search(all(a),x)
#define LB(a,x) (lower_bound(all(a),x)-a.B)
#define UB(a,x) (upper_bound(all(a),x)-a.B)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
bool isprm(LL a){if(a==1)return false; for(LL i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
bool palin(string a){for(int i=0;i<a.sz;i++){if(a.at(i)!=a.at(a.sz-i-1))return 0;} return 1;}
bool isVowel(char ch){ ch=toupper(ch); if(ch=='A'||ch=='U'||ch=='I'||ch=='O'||ch=='E') return true; return false;}
int toInt(string s){int sm;stringstream ss(s);ss>>sm;return sm;}
LL ceil2(LL a,LL b){LL c=a/b; if(a%b)c++; return c; }
LL bpow(LL a,LL b){if(b==0)return 1;LL r=bpow(a,b/2);if(b%2)return r*r*a;else return r*r;}
LL binpow(LL a,LL b){LL r=1;while(b>0){if(b&1)r=r*a;a=a*a;b>>=1;}return r;}
LL binpow(LL a,LL b,LL m){a%=m;LL r=1;while(b>0){if(b&1) r=r*a%m;a=a*a%m; b>>=1;}return r;}
template<typename T>inline T gcd(T a,T b){if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);return (b==0)?a:gcd(b,a%b);}
template<typename T>inline T lcm(T a,T b) {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
int main()
{
// fast;
LL i,j,k,n,m,l,s=0,x,y,tc=1,p,q,a,b,c=0;
bool f=0,ff=0;string st,s1,s2,s3; char ch;
while(cin>>n>>m)
{
a=b=0;
bool ar[n+5];
rep(i,n+5)ar[i]=0;
map<LL,LL>mp;
while(m--)
{
cin>>p>>st;
if(ar[p])continue;
if(st=="AC") a++,ar[p]=1;
else mp[p]++;
}
for(auto it=mp.B;it!=mp.E;it++)
{
if(ar[it->fi])b+=it->se;
}
cout<<a<<sp<<b<<en;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
const double PI = 3.1415926535897932;
int main()
{
int N, M;
cin >> N >> M;
vector<string> S(M);
vector<int> P(M);
rep(i, M) {
cin >> P[i] >> S[i];
P[i]--;
}
vector<int> Ans(N, 0);
int penalty = 0;
int ac = 0;
for (int i = 0; i < M; ++i) {
if (S[i] == "AC" && Ans[P[i]] <= 0) {
penalty += Ans[P[i]] * -1;
Ans[P[i]] = 1;
ac++;
}
else {
if (Ans[P[i]] <= 0) {
Ans[P[i]]--;
}
}
}
cout << ac << " " << penalty << endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#define _GLIBCXX_DEBUG
#include <iomanip>
using namespace std;
template<typename T> vector<T> range(T begin, T end, T stride = 1) {
vector<T> vec;
for (T i = begin; i < end; i += stride) {
vec.push_back(i);
}
return vec;
}
template<typename T> T factorial(T in) {
long long ans = 1;
for (int i=2; i < in + 1; ++i) ans *= i;
return ans;
}
int main() {
int n; cin >> n;
vector<int> v = range(0, n);
vector<int> x(n), y(n);
for (int i=0; i < n; ++i) cin >> x[i] >> y[i];
double sum = 0;
do {
for (int i=0; i<n-1; i++) {
sum += sqrt((x[v[i+1]] - x[v[i]]) * (x[v[i+1]] - x[v[i]]) + (y[v[i+1]] - y[v[i]]) * (y[v[i+1]] - y[v[i]]));
}
} while(next_permutation(v.begin(), v.end()));
cout << fixed << setprecision(15) << sum / factorial(n) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
template<class Iter> void __kumaerrc(Iter begin, Iter end) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; }
void __kumaerr(istream_iterator<string> it) { (void)it; cerr<<endl; }
template<typename T, typename... Args> void __kumaerr(istream_iterator<string> it, T a, Args... args) { cerr<<*it<<"="<<a<<", ",__kumaerr(++it, args...); }
template<typename S, typename T> std::ostream& operator<<(std::ostream& _os, const std::pair<S,T>& _p) { return _os<<"{"<<_p.first<<','<<_p.second<<"}"; }
#define __KUMATRACE__ true
#ifdef __KUMATRACE__
#define dump(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); __kumaerr(_it, args); }
#define dumpc(ar) { cerr<<#ar<<": "; FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
#define dumpC(beg,end) { cerr<<"~"<<#end<<": "; __kumaerrc(beg,end); }
#else
#define dump(args...)
#define dumpc(ar)
#define dumpC(beg,end)
#endif
// $ cp-batch VotingJudges | diff VotingJudges.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address VotingJudges.cpp && ./a.out
/*
6/28/2020
9:50-
*/
const int MAX_N=1e6+1;
LL A[MAX_N],M;
int N,V,P;
bool ok(int m) {
vector<LL> as(A,A+N);
int v=0;
as[m]+=M,++v;
REP(i,P-1) if(v<V) as[i]+=M,++v;
int i=N-1;
for(; i>=0&&v<V&&as[i]<=as[m]-M; --i) {
LL x=min(as[m]-as[i],(LL)M);
if(x>0) as[i]+=x,++v;
}
LL rem=M*(V-v);
//dump(p,rem,i,as[P-1],as[p]);
//dumpc(as);
while(rem>0&&i>P-2) {
LL x=min(as[m]-as[i],rem);
rem-=x,as[i]+=x;
--i;
}
if(rem>0) return false;
else return as[m]>=as[P-1];
}
void solve() {
sort(A,A+N),reverse(A,A+N);
//dumpC(A,A+N);
int good=P-1,bad=N;
while(abs(good-bad)>1) {
int mid=(good+bad)/2;
bool res=ok(mid);
//dump(mid,res);
(res?good:bad)=mid;
}
cout<<good+1<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<setprecision(12)<<fixed;
cin>>N>>M>>V>>P;
REP(i,N) cin>>A[i];
solve();
return 0;
}
| 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<unordered_map>
#include<set>
#include<cmath>
#include<climits>
#include<random>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define fast ios::sync_with_stdio(false); cin.tie(NULL);
const double eps = 1e-6;
/////////////////////////////////////////////
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
////////////////////////////////
#define int long long
void solve(){
int n;
cin>>n;
int a[n][n];
for(int i = 0 ; i < n ; ++i){
for(int j = 0 ; j < n ; ++j)
cin>>a[i][j];
}
int nn = (1<<n);
int dp[nn];
memset(dp , 0 , sizeof dp);
for(int i = 1 ; i <= nn ; ++i){
vector<int> tmp;
for(int j = 0 ; j < n ; ++j){
if((1<<j)&i)
tmp.pb(j);
}
for(int k = 0 ; k < tmp.size() ; ++k)
for(int j = k + 1 ; j < tmp.size() ; ++j){
dp[i] += a[tmp[k]][tmp[j]];
}
}
for(int mask = 1 ; mask < nn ; ++mask){
for(int i = mask ; i > 0 ; i= mask&(i-1)){
dp[mask] = max(dp[mask] , dp[i] + dp[i^mask]);
}
}
cout<<dp[nn-1]<<endl;
}
signed main(){
fast;
int t = 1;
//cin>>t;
for(int i = 1 ; i <= t ; ++i){
solve();
}
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
//setprecision(15)
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define MAX_N 15
int A[MAX_N+1][MAX_N+1];
int main() {
memset(A, -1, sizeof(A));
int N; cin >> N;
for (int i = 1; i <= N; i++) {
int cnt; cin >> cnt;
rep(j, cnt) {
int tmp; cin >> tmp;
cin >> A[i][tmp];
}
}
int p = mod_pow(2, N, MOD);
int ans = 0;
for (int i = 1; i < p; i++) {
int NG_flg = 0;
for (int j = 0; (1 << j) < p; j++ ) {
if (NG_flg == 1) break;
if (!(i & (1 << j))) continue;
for (int k = 1; k <= N; k++ ) {
if (A[j+1][k] == -1) continue;
if ( (A[j+1][k] == 1 && (i & (1 << (k-1))) == 0) ||
(A[j+1][k] == 0 && (i & (1 << (k-1))) > 0) ) {
NG_flg = 1; break;
}
}
}
if (NG_flg == 0) {
int cnt = 0;
rep(j, 16) {
if (i & (1 << j)) cnt++;
}
ans = max(ans, cnt);
}
}
cout << ans << endl;
} | 0 |
//---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
//---------------------------------------------------------------
#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 rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1e18
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define vec vector
using pint = pair<int,int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
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; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double pi = acos(-1);
//---------------------------------------------------------------
//↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓
vector<int> Eratosthenes( const int N )
{
vector<bool> is_prime( N + 1 );
for( int i = 0; i <= N; i++ )
{
is_prime[ i ] = true;
}
vector<int> P;
for( int i = 2; i <= N; i++ )
{
if( is_prime[ i ] )
{
for( int j = 2 * i; j <= N; j += i )
{
is_prime[ j ] = false;
}
P.emplace_back( i );
}
}
return P;
}
int main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll n;
cin>>n;
auto b = Eratosthenes(55555);
int cnt=0;
for(auto a : b){
if(a%5==1){
cout<<a<<' ';
cnt++;
if(cnt==n){
break;
}
}
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string key;
while(getline(cin,key)){
if(key.size() > 80){
break;
}
for(int j=0; j<26; j++){
for(int i=0; i<key.size(); i++){
if(key[i] >= 'a' && key[i] <= 'z'){
if(key[i] == 'z')
key[i] = 'a';
else
key[i] += 1;
}
}
if(key.find("the") != string::npos || key.find("this") != string::npos || key.find("that") != string::npos){
cout << key << endl;
}
}
}
return 0;
} | 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 k;
cin >> k;
vector<pair<int, int> > in(k);
rep(i, k) cin >> in[i].first >> in[i].second;
vector<int> p(8);
rep(i, 8) p[i] = i;
do{
bool check = true;
rep(i, k){
if(p[in[i].first] != in[i].second){
check = false;
break;
}
}
if(!check) continue;
bool flag = true;
rep(i, 7){
// (1, 1)方向チェック
for(int j = i + 1; j < 8; ++j){
int r_dif = j - i;
int l_dif = p[i] + r_dif;
if(l_dif == p[j]) flag = false;
}
// (1, -1)方向チェック
for(int j = i + 1; j < 8; ++j){
int r_dif = j - i;
int l_dif = p[i] - r_dif;
if(l_dif == p[j]) flag = false;
}
}
if(flag) break;
}while(next_permutation(p.begin(), p.end()));
rep(i, 8){
rep(j, 8){
if(p[i] == j){
cout << "Q";
}else{
cout << ".";
}
}
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
bool flg;
void init(char field[8][8],bool can[8][8]){
flg = false;
for(int i = 0 ; i < 8 ; i++){
for(int j = 0 ; j < 8 ; j++){
field[i][j] = '.';
can[i][j] = true;
}
}
}
bool inField(int y,int x){
return 0 <= y && y < 8 && 0 <= x && x < 8;
}
void putQ(int r,int c,bool can[8][8]){
const int dx[4] = {-1,1,1,-1};
const int dy[4] = {-1,-1,1,1};
for(int i = 0 ; i < 8 ; i++){
can[r][i] = can[i][c] = false;
}
for(int i = 0 ; i < 4 ; i++){
int x = c, y = r;
while(inField(y,x)){
can[y][x] = false;
x += dx[i]; y += dy[i];
}
}
}
void print(char field[8][8]){
for(int i = 0 ; i < 8 ; i++){
for(int j = 0 ; j < 8 ; j++){
cout << field[i][j];
}
cout << endl;
}
}
void copy(bool a[8][8],bool b[8][8]){
for(int i = 0 ; i < 8 ; i++){
for(int j = 0 ; j < 8 ; j++){
a[i][j] = b[i][j];
}
}
}
void solve(int now,int S,bool can[8][8],char field[8][8]){
if(now == 8){
print(field);
flg = true;
return;
}
if((S >> now) & 1){
solve(now+1,S,can,field);
}else{
bool tmp[8][8];
for(int i = 0 ; i < 8 ; i++){
if(can[now][i]){
copy(tmp,can);
field[now][i] = 'Q';
putQ(now,i,can);
solve(now+1,S,can,field);
if(flg) return;
copy(can,tmp);
field[now][i] = '.';
}
}
}
}
int main(){
int N,r,c,S = 0;
bool can[8][8];
char field[8][8];
init(field,can);
cin >> N;
for(int i = 0 ; i < N ; i++){
cin >> r >> c;
S |= 1<<r;
field[r][c] = 'Q';
putQ(r,c,can);
}
solve(0,S,can,field);
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int memo[10001],color[10001];
stack<int> numb;
vector<int> connect[10001],rconnect[10001];
void dfs(int i){
if(memo[i]!=0) return;
memo[i]=1;
lp(j,connect[i].size()){
dfs(connect[i][j]);
}
numb.push(i);
return;
}
void rdfs(int i,int j){
if(memo[i]!=1) return;
memo[i]=2;
color[i]=j;
lp(k,rconnect[i].size()){
rdfs(rconnect[i][k],j);
}
return;
}
int main(){
int v,e;
cin>>v>>e;
lp(i,e){
int a,b;
cin>>a>>b;
connect[a].push_back(b);
rconnect[b].push_back(a);
}
for(int i=0;i<v;i++){
if(memo[i]==0) {
dfs(i);
}
}
int j=0;
for(int i=0;i<v;i++){
int x=numb.top();
numb.pop();
if(memo[x]==1) {
rdfs(x,j);
j++;
}
}
int q;
cin>>q;
lp(i,q){
int a,b;
cin>>a>>b;
if(color[a]==color[b]) cout<<"1"<<endl;
else cout<<"0"<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
struct edge
{
int to;
ll cost;
};
vector<vector<edge>> tree(100010);
vector<ll> depth(100010);
void dfs(int v, int p, ll d)
{ //vからの最短経路、現在地のいっこまえ、はじめからの距離
depth[v] = d;
for (auto &e : tree[v])
{
if (e.to == p)
continue;
dfs(e.to, v, d + e.cost);
}
}
int main()
{
int n;
cin >> n;
rep(i, n - 1)
{
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
tree[a].push_back({b, c});
tree[b].push_back({a, c});
}
int q, k;
cin >> q >> k;
k--;
dfs(k, -1, 0);
rep(i, q)
{
int x, y;
cin >> x >> y;
x--, y--;
cout << depth[x] + depth[y] << endl;
}
}
| 0 |
// https://atcoder.jp/contests/agc005/tasks/agc005_a
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define REP(i, n) for(size_t i = 0; i < (n); ++i)
int main()
{
string X;
cin >> X;
int N = X.size();
stack<char> st;
for (int i = 0; i < N; ++i)
{
// 見ている文字とスタックの先頭に着目する
if ('S' == X[i])
{
st.push('S');
}
else // 'T' == X[i]
{
if (st.empty())
{
st.push('T');
continue;
}
char c = st.top();
if (c == 'T')
{
st.push('T');
}
else // c == 'S'
{
st.pop();
}
}
}
cout << st.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n; cin >> n;
ll a = n/500;
n %= 500;
cout << (a*1000) + int(n/5)*5 << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
long long mod=(1e+9)+7;
long long n,m;
cin>>n>>m;
static long long sum_x,sum_y;
vector<long long> x(n+10),y(m+10);
for(ll i=1;i<=n;i++) cin>>x[i];
for(ll i=1;i<=m;i++) cin>>y[i];
for(ll xx=1;xx<=n;xx++){
sum_x+=(2*xx-n-1)*x[xx];
sum_x%=mod;
}
for(ll yy=1;yy<=m;yy++){
sum_y+=(2*yy-m-1)*y[yy];
sum_y%=mod;
}
cout<<(sum_x*sum_y)%mod<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7, A = 5e5 + 2;
int main() {
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, x;
cin >> n >> x;
ll a[n];
for (int i = 0; i < n; i++) cin >> a[i];
ll sum = 0;
for (int i = 0; i <= x; i++) {
for (int j = 0; i + j <= min(n, x); j++) {
priority_queue<ll, vector<ll>, greater<ll>> pq;
for (int k = 0; k < i; k++)
pq.push(a[k]);
for (int k = n - 1, c = 0; c < j; c++, k--)
pq.push(a[k]);
for (int k = i + j; k < x; k++) {
if (!pq.empty() && pq.top() < 0) pq.pop();
}
ll val = 0;
while(!pq.empty()) val += pq.top(), pq.pop();
sum = max(sum, val);
}
}
cout << sum;
return 0;
} | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2005;
const int ha=1000000007;
int jc[maxn*maxn],ni[maxn*maxn];
int n,k,f[maxn][maxn];
inline int add(int x,int y){
x+=y;
return x>=ha?x-ha:x;
}
inline int ksm(int x,int y){
int an=1;
for(;y;y>>=1,x=x*(ll)x%ha) if(y&1) an=an*(ll)x%ha;
return an;
}
inline void init(){
jc[0]=1;
for(int i=1;i<=4004000;i++) jc[i]=jc[i-1]*(ll)i%ha;
ni[4004000]=ksm(jc[4004000],ha-2);
for(int i=4004000;i;i--) ni[i-1]=ni[i]*(ll)i%ha;
}
inline int getC(int x,int y){
return jc[x]*(ll)ni[y]%ha*(ll)ni[x-y]%ha;
}
inline void dp(){
f[0][0]=1;
for(int i=0;i<=n;i++)
for(int j=i;j>=0;j--) if(f[i][j]){
f[i+1][j+1]=add(f[i+1][j+1],f[i][j]*(ll)(n-i)%ha*(ll)getC(k*(i+1)-j-2,k-2)%ha);
if(j) f[i][j-1]=add(f[i][j-1],f[i][j]);
}
/*
for(int i=0;i<=n;i++){
for(int j=0;j<=i;j++) printf("%d ",f[i][j]);
puts("");
}
*/
}
int main(){
init();
scanf("%d%d",&n,&k);
if(k==1) puts("1");
else{
dp();
printf("%d\n",f[n][0]);
}
return 0;
}
/*
仅有一个序列中的每一个白球都能在其后方匹配到一个是其颜色里出现第一次的彩球，
这个序列才合法。
从后向前dp,
f[i][j] 表示 已经完整出现过 i种颜色的球，
并且还剩j种颜色的球没有被匹配的方案数。
考虑加入一种新球的话:
f[i+1][j+1] += f[i][j] * (n-i) * C(k*(i+1)-j-2,k-2)
考虑加入一种白球的话:
f[i][j-1] += f[i][j]
初始化 f[0][0] = 1
*/ | #include <stdio.h>
#include <string.h>
int x;
char y[101];
int main(){
scanf("%d",&x); scanf("%s",&y);
int len = strlen(y);
if(len<=x){
printf("%s\n",y);
return 0;
}
else{
for(int i=x; i<len; i++){
y[i]='\0';
}
for(int i=x; i<x+3; i++){
y[i]='.';
}
printf("%s\n",y);
return 0;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
char next_char(char now, char pre, string &s, int k) {
if (s[k]=='o') {
if (now=='S') return pre;
else if (pre=='W') return 'S';
else return 'W';
}
else {
if (now=='W') return pre;
else if (pre=='W') return 'S';
else return 'W';
}
}
int main(){
int N;
cin >> N;
string s;
cin >> s;
map<int,string> mp;
mp[0] = "S";
mp[1] = "W";
rep(i,2) rep(j,2) {
string ans = mp[i] + mp[j];
rep(k,N-1) {
char now = ans[k+1];
char pre = ans[k];
char next = next_char(now,pre,s,k+1);
if (k==N-2) {
if (next==ans[0]) {
pre = now;
now = ans[0];
next = next_char(now,pre,s,0);
if (next==ans[1]) {
cout << ans << endl;
return 0;
}
}
}
else {
ans += next;
}
}
}
cout << -1 << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
char str[100100];
int ty[4][100100];
main()
{
int n;
scanf("%d",&n);
scanf("%s",str);
ty[0][0]=ty[0][1]=ty[1][0]=ty[2][1]=0; // sheep
ty[1][1]=ty[2][0]=ty[3][0]=ty[3][1]=1; // wolf
for(int i=1;i<n;i++)
{
if(str[i]=='o')
{
for(int j=0;j<4;j++)
{
if(ty[j][i]==0)ty[j][i+1]=ty[j][i-1];
else ty[j][i+1]=(ty[j][i-1]+1)%2;
}
}
else
{
for(int j=0;j<4;j++)
{
if(ty[j][i]==1)ty[j][i+1]=ty[j][i-1];
else ty[j][i+1]=(ty[j][i-1]+1)%2;
}
}
}
for(int i=0;i<4;i++)
{
if(str[0]=='o')
{
if(ty[i][0]==0&&ty[i][n-1]==ty[i][1]&&ty[i][0]==ty[i][n])
{
//printf("%d %d\n",ty[i][n-1],ty[i][1]);
for(int j=0;j<n;j++)printf("%s",ty[i][j]==0?"S":"W");
return 0;
}
if(ty[i][0]==1&&ty[i][n-1]!=ty[i][1]&&ty[i][0]==ty[i][n])
{
for(int j=0;j<n;j++)printf("%s",ty[i][j]==0?"S":"W");
return 0;
}
}
else
{
if(ty[i][0]==1&&ty[i][n-1]==ty[i][1]&&ty[i][0]==ty[i][n])
{
for(int j=0;j<n;j++)printf("%s",ty[i][j]==0?"S":"W");
return 0;
}
if(ty[i][0]==0&&ty[i][n-1]!=ty[i][1]&&ty[i][0]==ty[i][n])
{
for(int j=0;j<n;j++)printf("%s",ty[i][j]==0?"S":"W");
return 0;
}
}
}
printf("-1");
}
| 1 |
#include <iostream>
using namespace std;
int main(){
int n,count=0;
cin>> n;
int num[n];
for(int i= 0;i<n;i++)
cin>>num[i];
bool flag=true;
while(flag){
flag=false;
for(int j = n-1 ; j>0;j--){
if(num[j]<num[j-1]){
swap(num[j],num[j-1]);
flag = true;
count++;
}
}
}
for(int i= 0;i<n-1;i++)
cout<<num[i]<<" ";
cout<<num[n-1]<<endl<<count<<endl;
} | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
const int MAX=100000;
const int geta=100;
struct BIT
{
int bit[MAX+1];
void add(int i,int x)
{
while(i<=MAX)
{
bit[i]+=x;
i+=i&-i;
}
}
int sum(int i)
{
int res=0;
while(i>0)
{
res+=bit[i];
i-=i&-i;
}
return res;
}
};
BIT bit;
int N,a[105];
int main()
{
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%d",&a[i]);
a[i]+=geta;
}
int ans=0;
for(int i=0;i<N;i++)
{
ans+=bit.sum(a[i]);
bit.add(a[i],1);
}
sort(a,a+N);
for(int i=0;i<N;i++)printf("%d%c",a[i]-geta,(i==N-1)?'\n':' ');
printf("%d\n",N*(N-1)/2-ans);
return 0;
} | 1 |
#include<iostream>
using namespace std;
int main()
{
int N;
int M;
int x[20];
int y[20];
char d;
int l;
while (cin >> N && N != 0)
{
int flag[21][21] = {};
int initX = 10;
int initY = 10;
int cnt = 0;
for (int i = 0; i < N; i++)
{
cin >> x[i];
cin >> y[i];
flag[y[i]][x[i]] = 1;
}
cin >> M;
for (int i = 0; i < M; i++)
{
cin >> d;
cin >> l;
int dx = 0;
int dy = 0;
for (int k = 0; k <= l; k++)
{
if (d == 'S' || d == 'W')
{
if (d == 'S')
{
for (int j = 0; j < N; j++)
{
if (x[j] == initX && y[j] == initY - k && flag[y[j]][x[j]] == 1)
{
cnt++;
flag[y[j]][x[j]] = 0;
}
}
}
else
{
for (int j = 0; j < N; j++)
{
if (x[j] == initX - k && y[j] == initY && flag[y[j]][x[j]] == 1)
{
cnt++;
flag[y[j]][x[j]] = 0;
}
}
}
}
else
{
if (d == 'N')
{
for (int j = 0; j < N; j++)
{
if (x[j] == initX && y[j] == initY + k && flag[y[j]][x[j]] == 1)
{
cnt++;
flag[y[j]][x[j]] = 0;
}
}
}
else
{
for (int j = 0; j < N; j++)
{
if (x[j] == initX + k && y[j] == initY && flag[y[j]][x[j]] == 1)
{
cnt++;
flag[y[j]][x[j]] = 0;
}
}
}
}
}
if (d == 'S')
{
dy = -l;
}
else if (d == 'N')
{
dy = l;
}
else if (d == 'W')
{
dx = -l;
}
else
{
dx = l;
}
initX += dx;
initY += dy;
}
if (cnt == N)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
const int inf=1e8;
int main(){
while(1){
int n, m;
cin>> n>> m;
if(n==0&&m==0) break;
int a[m], b[m];
for(int i=0; i<m; i++){
cin>> a[i]>> b[i];
a[i]--; b[i]--;
}
int mtrx[n][n];
fill(mtrx[0], mtrx[n], inf);
for(int i=0; i<m; i++){
mtrx[a[i]][b[i]]=mtrx[b[i]][a[i]]=1;
}
for(int k=0; k<n; k++)
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
mtrx[i][j]=min(mtrx[i][j], mtrx[i][k]+mtrx[k][j]);
int ans=0;
for(int i=1; i<n; i++){
if(mtrx[0][i]==2||mtrx[0][i]==1) ans++;
}
cout<< ans<< endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int MOD = 1e9 + 7;
template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
for (auto &e : t) fill(e, v);
}
// auto v = make_vec<int>(h, w);
// fill(v, 0);
signed main(){
int n, x; cin >> n >> x;
vector<int> s(n);
for(int i = 0; i < n; i++) cin >> s[i];
sort(s.begin(),s.end());
auto dp = make_vec<int>(n+1, x+1);
for(int i = 0; i <= x; i++){
dp[0][i] = i;
}
for(int i = 0; i < n; i++){
for(int j = 0; j <= x; j++){
dp[i+1][j] += dp[i][j % s[i]]; dp[i+1][j] %= MOD;
dp[i+1][j] += dp[i][j] * i; dp[i+1][j] %= MOD;
}
}
cout << dp[n][x] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
ll mPrime = int(1e9) + 7;
ll bN, bX;
vector<ll> bS;
vector<ll> facts;
vector<ll> invFacts;
vector<int> tbl;
vector<int> low; // low[y] == #{ i | s[i] <= y }
ll mAdd(ll x, ll y) {
ll z = x + y;
if (z < mPrime) return z;
else return (z - mPrime);
}
ll mSub(ll x, ll y) {
ll z = x - y;
if (z >= 0) return z;
else return (z + mPrime);
}
ll mMul(ll x, ll y) {
return (x * y) % mPrime;
}
ll eGCD(ll a, ll b, ll& s, ll& t) {
if (a == 0) {
s = 0;
t = 1;
return b;
}
ll u;
ll g = eGCD(b % a, a, t, u);
s = u - (b / a) * t;
return g;
}
ll mInv(ll x) {
ll s, t;
eGCD(x, mPrime, s, t);
return s < 0 ? s + mPrime : s;
}
ll tight(ll);
ll loose(ll y, ll len) {
ll result = mMul(tight(y), mMul(facts.at(len), invFacts.at(low.at(y))));
DLOG("loose(%lld, %lld) = %lld\n", y, len, result);
return result;
}
ll tight(ll y) {
if (tbl.at(y) >= 0) return tbl.at(y);
ll len = low.at(y);
if (len == 0) return y;
ll result = 0;
for (ll i = 0; i < len; i++) {
ll z = y % bS.at(i);
result = mAdd(result, loose(z, len-1));
}
tbl.at(y) = result;
DLOG("tight(%lld) = %lld\n", y, result);
return result;
}
int main() {
cin >> bN >> bX;
bS.resize(bN);
for (ll i = 0; i < bN; i++) {
cin >> bS.at(i);
}
facts.resize(bN+1);
invFacts.resize(bN+1);
facts.at(0) = invFacts.at(0) = 1;
for (ll i = 1; i <= bN; i++) {
facts.at(i) = mMul(i, facts.at(i-1));
invFacts.at(i) = mInv(facts.at(i));
}
sort(bS.begin(), bS.end());
low.resize(bX+1);
ll idx = 0;
for (ll i = 0; i < bX+1; i++) {
if (idx < (ll) bS.size() && bS.at(idx) == i) idx++;
low.at(i) = idx;
}
tbl.resize(bX+1, -1);
ll ans = loose(bX, bS.size());
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
string s, rs;
int n, k;
vector<vector<vector<int>>> dp;
int solve();
int main() {
cin >> s >> k;
n = s.size();
rs = s;
reverse(rs.begin(), rs.end());
cout << solve() << endl;
return 0;
}
int solve() {
int res = 0;
dp.assign(n + 1, vector(n + 1, vector<int>(k + 1, 0)));
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
for (int l = 0; l <= k; ++l) {
dp[i + 1][j + 1][l] = max(dp[i + 1][j][l], dp[i][j + 1][l]);
if (s[i] == rs[j])
dp[i + 1][j + 1][l] = max(dp[i + 1][j + 1][l], dp[i][j][l] + 1);
else if (l != 0)
dp[i + 1][j + 1][l] = max(dp[i + 1][j + 1][l], dp[i][j][l - 1] + 1);
else
dp[i + 1][j + 1][l] = max(dp[i + 1][j + 1][l], dp[i][j][l]);
}
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= n; ++j)
for (int l = 1; l <= k; ++l)
dp[i][j][l] = max(dp[i][j][l], dp[i][j][l - 1]);
for (int i = 0; i <= n; ++i) {
// even
res = max(res, dp[i][n - i][k] * 2);
// odd
if (i > 0) res = max(res, dp[i - 1][n - i][k] * 2 + 1);
}
return res;
} | //Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#define pb push_back
#define pq priority_queue
#define dbg(x) cerr << #x" = " << (x) << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fl(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)
using namespace std;
namespace io {
const int SI = 1 << 21 | 1;
char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
int f, t;
#define gc() (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin), IS == IT ? EOF : *IS++) : *IS++)
inline void flush() {
fwrite(OB, 1, OS - OB, stdout), OS = OB;
}
inline void pc(char x) {
*OS++ = x;
if (OS == OT) flush();
}
template <class I>
inline void rd(I &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());
x *= f;
}
template <class I>
inline void rd(I &x, I &y) {
rd(x), rd(y);
}
template <class I>
inline void rd(I &x, I &y, I &z) {
rd(x), rd(y), rd(z);
}
template <class I>
inline void rda(I *a, int n) {
for (int i = 1; i <= n; i++) rd(a[i]);
}
inline void rdc(char &c) {
for (c = gc(); c < 33 || c > 126; c = gc());
}
inline void rds(char *s, int &n) {
for (c = gc(); c < 33 || c > 126; c = gc());
for (n = 0; c >= 33 && c <= 126; s[++n] = c, c = gc());
}
inline void rds(string &s) {
for (c = gc(); c < 33 || c > 126; c = gc());
for (s.clear(); c >= 33 && c <= 126; s.pb(c), c = gc());
}
template <class I>
inline void print(I x, char k = '\n') {
if (!x) pc('0');
if (x < 0) pc('-'), x = -x;
while (x) ch[++t] = x % 10 + '0', x /= 10;
while (t) pc(ch[t--]);
pc(k);
}
template <class I>
inline void print(I x, I y) {
print(x, ' '), print(y);
}
template <class I>
inline void print(I x, I y, I z) {
print(x, ' '), print(y, ' '), print(z);
}
template <class I>
inline void printa(I *a, int n) {
for (int i = 1; i <= n; i++) print(a[i], " \n"[i==n]);
}
inline void printc(char c) {
pc(c);
}
inline void prints(char *s, int n) {
for (int i = 1; i <= n; i++) pc(s[i]);
pc('\n');
}
inline void prints(string s) {
int n = s.length();
while (t < n) pc(s[t++]);
pc('\n'), t = 0;
}
struct Flush {
~Flush() {
flush();
}
} flusher;
}
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
using io::print;
using io::printa;
using io::printc;
using io::prints;
const int N = 307, inf = 1e9;
int n, k, f[N][N][N];
char s[N];
bool v[N][N][N];
int F(int l, int r, int k) {
if (k < 0) return -inf;
if (r - l < 1) return r - l + 1;
if (v[l][r][k]) return f[l][r][k];
v[l][r][k] = 1;
return f[l][r][k] = max(max(F(l + 1, r, k), F(l, r - 1, k)), F(l + 1, r - 1, k - (s[l] != s[r])) + 2);
}
int main() {
rds(s, n), rd(k), print(F(1, n, k));
return 0;
} | 1 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define int ll
#define F first
#define S second
const int N = 1e5 + 10;
vector<int> g[N];
int p[N], dp[N], ans, k;
void dfs(int v) {
dp[v] = 1;
for (auto u : g[v]) {
dfs(u);
dp[v] = max(dp[v], dp[u] + 1);
}
if (dp[v] == k - 1 && p[v] != 1) {
dp[v] = 0;
ans++;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> k;
k++;
int x;
cin >> x;
if (x != 1) {
ans++;
}
p[1] = 1;
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
g[x].pb(i);
p[i] = x;
}
dfs(1);
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t n;
cin >> n;
int64_t a[n+1];
for(int i = 0; i < n; i++){
cin >> a[i];
}
a[n] = 100000001;
sort(a,a+n);
int64_t ans = 0,count = 1;
for(int i = 0; i < n; i++){
if(a[i] == a[i+1]){
count++;
}else{
if( (count % 2) == 1){
ans++;
}
count = 1;
}
}
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647; // 2^31-1
const double PI = acos(-1);
//cout<<fixed<<setprecision(10);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
struct BipartiteMatching {
vector< vector< int > > graph;
vector< int > match, alive, used;
int timestamp;
BipartiteMatching(int n) : graph(n), alive(n, 1), used(n, 0), match(n, -1), timestamp(0) {}
void add_edge(int u, int v) {
graph[u].push_back(v);
graph[v].push_back(u);
}
bool dfs(int idx) {
used[idx] = timestamp;
for(auto &to : graph[idx]) {
int to_match = match[to];
if(alive[to] == 0) continue;
if(to_match == -1 || (used[to_match] != timestamp && dfs(to_match))) {
match[idx] = to;
match[to] = idx;
return true;
}
}
return false;
}
int bipartite_matching() {
int ret = 0;
for(int i = 0; i < graph.size(); i++) {
if(alive[i] == 0) continue;
if(match[i] == -1) {
++timestamp;
ret += dfs(i);
}
}
return ret;
}
void output() {
for(int i = 0; i < graph.size(); i++) {
if(i < match[i]) {
cout << i << "-" << match[i] << endl;
}
}
}
};
signed main()
{
gearup;
int n; cin >> n;
vpii r,b;
rep(i,n){
int x,y; cin >> x >> y;
x--;y--;
r.push_back({x,y});
}
rep(i,n){
int x,y; cin >> x >> y;
x--;y--;
b.push_back({x,y});
}
//sort(all(r));
//sort(all(b));
BipartiteMatching bm(n + n);
rep(i,n){
rep(j,n){
if(r[i].first < b[j].first && r[i].second < b[j].second) bm.add_edge(i,n+j);
}
}
out(bm.bipartite_matching());
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
///**************************DONE****************************///
typedef struct
{
int x, y, col;
} pt;
bool cmp(pt A, pt B)
{
if(A.x != B.x)
return A.x < B.x;
}
pt P[2 * mx2];
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> P[i].x >> P[i].y, P[i].col = 1;
for(int i = n; i < 2 * n; i++)
cin >> P[i].x >> P[i].y, P[i].col = 2;
sort(P, P + 2 * n, cmp);
priority_queue<int> pq;
int ans = 0;
for(int i = 0; i < 2 * n; i++){
if(P[i].col == 2){
if(pq.size() == 0)
continue;
queue<int> q;
while(!pq.empty()){
int t = pq.top();
pq.pop();
if(t < P[i].y){
ans++;
break;
}
q.push(t);
}
while(!q.empty()){
int t = q.front();
pq.push(t);
q.pop();
}
}
else
pq.push(P[i].y);
}
cout << ans << '\n';
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n; ll m; cin >> n >> m;
int v, p; cin >> v >> p;
map<ll, int> mp;
vector<ll> A(n);
rep(i, n) {
cin >> A[i];
mp[A[i]]++;
}
sort(all(A));
vector<ll> sum(n+1);
rep(i, n) sum[i+1] = sum[i] + A[i];
rrep(i, n) {
ll margin = 0;
ll t1 = upper_bound(all(A), A[i]) - begin(A);
margin += t1 * m;
ll t2 = upper_bound(all(A), A[i]+m) - begin(A);
margin += (n-t2) * m;
if(n-t2 >= p) {
cout << n - i - 1 << endk;
return 0;
}
ll rem = p - (n-t2);
ll t3 = upper_bound(all(A), A[i]+m-1) - begin(A);
margin += (rem-1) * m;
if((t3-(rem-1)-t1) < 0) continue;
margin += (A[i]+m) * (t3-(rem-1)-t1) - (sum[t3-(rem-1)]-sum[t1]);
if(margin >= v * m) continue;
else {
cout << n - i - 1 << endk;
return 0;
}
}
cout << n << endk;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
long long read()
{
char ch=getchar();long long x=0,ff=1;
while(ch<'0'||ch>'9') {if(ch=='-') ff=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*ff;
}
void write(long long aa)
{
if(aa<0) putchar('-'),aa=-aa;
if(aa>9) write(aa/10);
putchar('0'+aa%10);
return;
}
long long n,X,sum,ans;
long long b[100005],l[100005],r[100005],id[100005];
long long vis[100005];
long long F(long long aa)
{
return (X-b[aa])*r[aa]+b[aa]*l[aa];
}
bool cmp(long long aa,long long bb)
{
return F(aa)>F(bb);
}
int main()
{
n=read(),X=read();
for(long long i=1;i<=n;++i) b[i]=read(),l[i]=read(),r[i]=read(),id[i]=i,sum+=l[i]*b[i];
if(sum==0) {puts("0");return 0;}
sort(id+1,id+n+1,cmp);
for(long long i=1;i<=n;++i)
{
if(sum>=F(id[i])) sum-=F(id[i]),ans+=X;
else
{
sum-=F(id[i]);
long long mx=X;
for(long long j=1;j<=n;++j)
{
long long tmp=0;
if(vis[j]) sum+=F(j);
else sum+=F(id[i]);
if(sum<=b[j]*l[j]) tmp=(sum-1)/l[j]+1;
else sum-=b[j]*l[j],tmp=b[j]+(sum-1)/r[j]+1,sum+=b[j]*l[j];
if(vis[j]) sum-=F(j);
else sum-=F(id[i]);
mx=min(tmp,mx);
}
ans+=mx;
sum=0;
}
if(!sum) break;
vis[id[i]]=1;
}
write(ans);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using Weight = long long;
using Vertex = int;
struct Edge {Vertex from, to; Weight weight;};
using Graph = std::vector<std::vector<Edge>>;
std::vector<std::vector<Vertex>> connected_component(const Graph& G) {
std::vector<std::vector<Vertex>> cc;
std::vector<bool> used(G.size());
std::function<void(int)> dfs = [&](int v) {
cc.back().push_back(v);
used[v] = true;
for(const auto& e: G[v]) if(!used[e.to]) dfs(e.to);
};
for(Vertex v = 0; v < G.size(); ++v) if(!used[v]) {
cc.push_back(std::vector<Vertex>());
dfs(v);
}
return cc;
}
using I = long long;
I com2(I n) {return n * (n - 1) / 2;}
bool check(const auto& G, auto s) {
vector<int> color(G.size(), -1);
function<bool(Vertex, int)> dfs = [&](auto v, auto c) {
if(color[v] != -1) return color[v] == c;
color[v] = c;
c ^= 1;
for(const auto& e: G[v]) if(!dfs(e.to, c)) return false;
return true;
};
return dfs(s, 0);
}
int main() {
I N, M;
cin >> N >> M;
Graph G(N);
for(auto i=0; i<M; ++i) {
int u, v;
cin >> u >> v;
--u; --v;
G[u].push_back({u, v});
G[v].push_back({v, u});
}
auto cc = connected_component(G);
auto V = N - count_if(begin(cc), end(cc), [](const auto& v) {return v.size() == 1;});
auto ans = N * N - V * V;
I twocol = 0, obscure = 0;
for(auto c: cc) if(c.size() != 1) {
if(check(G, *begin(c))) ++twocol;
else ++obscure;
}
ans += 2 * twocol + obscure;
ans += 4 * com2(twocol) + 2 * com2(obscure);
ans += 2 * twocol * obscure;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int v = 100005,e;
int c = 0;
vector<vector<int>> graph(v,vector<int>());
vector<bool> seen(v,false);
vector<int> ord(v);
vector<int> low(v);
vector<bool> isart(v,false);
void dfs(int i,int par=-1){
seen[i] = true;
ord[i] = low[i] = c++;
int count = 0;
for(int j:graph[i]){
if(!seen[j]){
dfs(j,i);
++ count;
low[i] = min(low[i],low[j]);
if(par != -1 && ord[i] <= low[j]) isart[i] = true;
}else if(j!=par){
low[i] = min(low[i],ord[j]);
}
}
if(par==-1 && count>1) isart[i] = true;
return;
}
int main(){
cin >> v >> e;
rep(i,e){
int s,t;
cin >> s >> t;
graph[s].push_back(t);
graph[t].push_back(s);
}
dfs(0);
rep(i,v){
if(isart[i]) cout << i << endl;
}
return 0;
}
| 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(ll i=a;i<=b;i++)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
#define N 101000
#define ll long long
using namespace std;
ll sum,n,a[N],g1[N],g2[N];
ll gcd(ll x,ll y)
{
if(x==-1||y==-1) return -x*y;
return y==0?x:gcd(y,x%y);
}
ll dg(ll x)
{
g1[1]=a[1];g2[n]=a[n];
g1[0]=g2[n+1]=-1;
fo(i,2,n) g1[i]=gcd(g1[i-1],a[i]);
fd(i,n-1,1) g2[i]=gcd(g2[i+1],a[i]);
ll gd=-1,k=0;
fo(i,1,n)
if(a[i]!=1)
{
gd=gcd(gcd(a[i]-1,g1[i-1]),g2[i+1]);
k=i;
if(((sum-1)/gd)%2==1) break;
gd=-1;
}
if(gd!=-1)
{
fo(i,1,n) if(i!=k) a[i]=a[i]/gd;
a[k]=(a[k]-1)/gd;
sum=(sum-1)/(ll)gd;
return 1-dg(x^1);
}
return 0;
}
int main()
{
scanf("%lld",&n);
fo(i,1,n) scanf("%lld",&a[i]),sum+=(ll)a[i];
if(n%2==0)
{
if(sum%2==1) printf("First\n");
else printf("Second\n");
return 0;
}
if(sum%2==0) return printf("First\n"),0;
if(dg(1)==1) printf("First\n");
else printf("Second\n");
} | #include<bits/stdc++.h>
using namespace std;
#define N 305
double dp[N][N][N];
int n;
double fn(int x,int y,int z,int n) {
if(x<0 || y<0 || z<0) {return 0;}
if(!x && !y && !z) {return 0;}
if(dp[x][y][z]>0) {return dp[x][y][z];}
int t=x+y+z;
return dp[x][y][z]=(n+x*fn(x-1,y,z,n)+y*fn(x+1,y-1,z,n)+z*fn(x,y+1,z-1,n))/t;
}
int main() {
int x=0,y=0,z=0,a;
cin>>n;
for(int i=0;i<n;i++) {
cin>>a;
x+=(a==1)?1:0;
y+=(a==2)?1:0;
z+=(a==3)?1:0;
}
memset(dp,-1,sizeof(dp));
cout<<fixed<<setprecision(9);
double t=fn(x,y,z,n);
cout<<t<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::string S, long long Q, std::vector<long long> k)
{
for (ll i = 0; i < Q; i++) {
ll D = 0;
ll M = 0;
ll DM = 0;
ll DMC = 0;
ll ans = 0;
for (ll j = 0; j < N; j++) {
if (j - k[i] >= 0) {
if (S[j - k[i]] == 'D') {
D--;
DM -= M;
}
if (S[j - k[i]] == 'M') {
M--;
}
}
if (S[j] == 'D') {
D++;
}
if (S[j] == 'M') {
M++;
DM += D;
}
if (S[j] == 'C') {
DMC += DM;
}
ans = max(ans, DMC);
}
cout << ans << "\n";
}
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main()
{
long long N;
scanf("%lld", &N);
std::string S;
std::cin >> S;
long long Q;
scanf("%lld", &Q);
std::vector<long long> k(Q - 1 - 0 + 1);
for (int i = 0; i < Q - 1 - 0 + 1; i++) {
scanf("%lld", &k[i]);
}
solve(N, S, Q, std::move(k));
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>;
ll sum[3][1000005];
ll combiDM[1000005];
int main() {
int N;
cin >> N;
string S;
cin >> S;
int Q;
cin >> Q;
vector<int> k(Q);
rep(i, Q) cin >> k[i];
rep(j, 3) rep(k, N) sum[j][k] = 0;
combiDM[0] = 0;
string T = "DMC";
rep(i, N) {
rep(j, 3) {
if (S[i] == T[j]) ++sum[j][i];
}
}
rep(i, 2) {
rep(j, N - 1) {
if (i == 1) {
combiDM[j + 1] = combiDM[j] + sum[0][j + 1] * sum[1][j + 1];
}
sum[i][j + 1] += sum[i][j];
}
}
rep(i, Q) {
vector<ll> ans(N);
rep(j, N) {
if (j < 2) continue;
ans[j] += ans[j - 1];
if (sum[2][j] != 1) continue;
ans[j] += combiDM[j];
if (j - k[i] < 0) continue;
ans[j] -= (combiDM[j - k[i]] +
sum[0][j - k[i]] * (sum[1][j - 1] - sum[1][j - k[i]]));
}
cout << ans[N - 1] << endl;
}
} | 1 |
#include <iostream>
//#include <iomanip>
//#include <string>
#include <vector>
#include <algorithm>
//#include <utility>
//#include <set>
//#include <map>
//#include <queue>
//#include <deque>
//#include <bitset>
//#include <math.h>
using namespace std ;
using ll = long long ;
//using ld = long double ;
using vll = vector<ll> ;
//using vvll = vector<vll> ;
//using vc = vector<char> ;
//using vvc = vector<vc> ;
//using vb = vector<bool> ;
//using vvb = vector<vb> ;
//using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
//ll mod = 1000000007 ;
//long double pie = acos(-1) ;
//ll INF = 1000000000000 ;
//void yorn(bool a){if(a) cout << "Yes" << endl ; else cout << "No" << endl ;}
//void YorN(bool a){if(a) cout << "YES" << endl ; else cout << "NO" << endl ;}
//ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
//ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}
//ll sa(long long a,long long b){if(a>b) return a-b ; return b-a ;}
//void fix_cout(){cout << fixed << setprecision(20) ;}
int main(){
ll n,m,v,p ;
cin >> n >> m >> v >> p ;
vll a(n) ;
for(auto &i:a) cin >> i ;
sort(all(a)) ;
reverse(all(a)) ;
ll l,r,mid ;
l = p-1 ;
r = n ;
while(l+1<r){
mid = (l+r)/2 ;
if(a.at(p-1)>a.at(mid)+m){
r = mid ;
continue ;
}
ll cnt = 0 ;
cnt += m*(p-1+n-mid) ;
for(int i=p-1;i<mid;i++) cnt += a.at(mid)+m-a.at(i) ;
if(cnt>=m*v) l = mid ;
else r = mid ;
}
cout << l+1 << endl ;
}
| #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target ("avx2,avx,fma")
#define ll long long int
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define rep(i,l,r) for(i=l;i<r;i++)
#define ld long double
#define ff first
#define ss second
#define pli pair<ll,int>
#define pi 3.1415926535897932384626433832
int main()
{
io;
int i,n;
ll x;
cin>>n>>x;
vector<ll>b(n);
vector<ll>l(n);
vector<ll>u(n);
vector<pli>p(n);
vector<ll>pre(n);
ll d=0;
rep(i,0,n)
{
cin>>b[i]>>l[i]>>u[i];
d-=l[i]*b[i];
p[i]=mp(l[i]*b[i]+u[i]*(x-b[i]),i);
}
ll beg=0;
ll r=n*x;
//cout<<r;
sort(p.begin(),p.end(),greater<pli>());
pre[0]=p[0].ff;
rep(i,1,n)
pre[i]=pre[i-1]+p[i].ff;
while(beg<=r)
{
//cout<<1;
ll mid=(beg+r)/2;
ll q=mid/x;
ll rem=mid%x;
ll ans;
ll maxi=d;
if(q==n)
maxi=0;
else
rep(i,0,n)
{
ans=d;
if(q!=0)
{
if(i<q)
ans+=pre[q]-p[i].ff;
else
ans+=pre[q-1];
}
ans+=min(b[p[i].ss],rem)*l[p[i].ss]+max(rem-b[p[i].ss],0ll)*u[p[i].ss];
maxi=max(ans,maxi);
}
if(maxi>=0)
r=mid-1;
else
beg=mid+1;
}
cout<<beg;
return 0;
}
| 0 |
//#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const long long M=1000000007;
//typedef long T;
//#include "math/mod.h"
//#include "math/modulo.h"
template<class T, long long M>
struct modulo {
T n;
T gcd_ext(T a, T b, T *x, T *y) {
if (a == 0) {
*x = 0;
*y = 1;
return b;
}
T x1, y1;
T gcd = gcd_ext(b%a, a, &x1, &y1);
*x = y1 - (b/a) * x1;
*y = x1;
return gcd;
}
modulo(T n): n(n<0? n%M+M: n%M) {}
operator T() const { return n; }
modulo operator-() {
return modulo(-n);
}
modulo operator+(const modulo &o) {
return modulo(n+o.n);
}
modulo operator-(const modulo &o) {
return modulo(n-o.n);
}
modulo operator*(const modulo &o) {
return modulo(n*o.n);
}
modulo operator/(const modulo &o) {
T x, y;
T g = gcd_ext(o.n, M, &x, &y);
if (g != 1) return 0;
else return modulo(n * (x % M));
}
bool operator<(const modulo &o) const {
return n<o.n;
}
bool operator<=(const modulo &o) const {
return n<=o.n;
}
bool operator>(const modulo &o) const {
return n>o.n;
}
bool operator>=(const modulo &o) const {
return n>=o.n;
}
bool operator==(const modulo &o) const {
return n==o.n;
}
bool operator!=(const modulo &o) const {
return n!=o.n;
}
};
typedef modulo<long long, M> T;
//#include "math/comb.h"
void comb_inc_k(T &r, int n, int &k) {
//C(n,k+1) = C(n,k) * (n-k) / (k+1)
r = r * T(n-k) / T(k+1);
k++;
}
void comb_dec_k(T &r, int n, int &k) {
//C(n,k-1) = C(n,k) * k / (n-k+1)
r = r * T(k) / T(n-k+1);
k--;
}
void comb_inc_n(T &r, int &n, int k) {
//C(n+1,k) = C(n,k) * (n+1) / (n+1-k)
r = r * T(n+1) / T(n+1-k);
n++;
}
void comb_dec_n(T &r, int &n, int k) {
//C(n-1,k) = C(n,k) * (n-k) / n
r = r * T(n-k) / T(n);
n--;
}
T comb(int n, int k) {
if (k*2 > n) k = n-k;
if (n==0) return 0;
T r = 1; //C(n,0)
for (int i=0; i<k; ) comb_inc_k(r, n, i);
return r;
}
int h,w,a,b;
int input() {
if (scanf("%d %d %d %d", &h, &w, &a, &b) < 0) return 0;
return 1;
}
void init() {
}
int solve() {
T r = comb(h+w-2, h-1);
int xn = h-a+b-1, xk = b-1;
T x = comb(xn, xk);
int yn = a-1+w-b-1, yk = w-b-1;
T y = comb(yn, yk);
for (int i=0; i<a; i++) {
//T x = mod_combinations(h-a+i+b-1, b-1, M);
//T y = mod_combinations(a-1-i+w-b-1, w-b-1, M);
if (i) {
comb_inc_n(x, xn, xk);
comb_dec_n(y, yn, yk);
}
r = r-x*y;
}
/*
T r = mod_combinations(h+w-2, h-1, M);
T x = mod_combinations(h-a+b-1, b-1, M);
T y = mod_combinations(a-1+w-b-1, w-b-1, M);
for (int i=0; i<a; i++) {
//T x = mod_combinations(h-a+i+b-1, b-1, M);
//T y = mod_combinations(a-1-i+w-b-1, w-b-1, M);
if (i) {
T n = h-a+i+b-1, m = b-1;
x = mod_div(x*n, n-m, M);
n = a-1-i+w-b-1, m = w-b-1;
y = mod_div(y*(n+1-m), n+1, M);
}
T z = mod_mul(x, y, M);
//printf("%d: r=%ld %ld %ld %ld\n", i, r, x, y, z);
r = mod_sub(r, z, M);
}
*/
return r;
}
void output(int ans) {
printf("%d\n", ans);
}
void cleanup() {
}
int main() {
//precalc();
//int ca; scanf("%d", &ca);
while (input()) {
init();
output(solve());
cleanup();
//break;
}
}
| ///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;
}
| 0 |
#include <iostream>
#include <cstdio>
using namespace std;
int A[100000], n;
int Partition(int p, int r){
int x = A[r - 1], j = 0;
//printf("%d ", A[r - 1]);
for(int i = 0;i < n;i++){
if(A[i] <= x){
int tmp = A[j];
A[j++] = A[i];
A[i] = tmp;
}
}
return j - 1;
}
main(){
scanf("%d", &n);
for(int i = 0;i < n;i++)scanf("%d", &A[i]);
int j = Partition(0, n);
for(int i = 0;i < n - 1;i++){
if(i)printf(" ");
if(i == j)printf("[");
printf("%d", A[i]);
if(i == j)printf("]");
}
printf(" %d\n", A[n - 1]);
} | #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#define NILL 2000000010
using namespace std;
struct node{
node *p, *l,*r;
int key;
};
node *root;
node * mk_node(int key,node *l,node *r,node *p){
node *n=(node *)malloc(sizeof(node));
n->key=key;
n->r=r;
n->l=l;
n->p=p;
return n;
}
void insert(node *z){
node *y=mk_node(NILL,NULL,NULL,NULL);
node *x=root;
while(x!=NULL){
y=x;
if((z->key)<(x->key)) x=x->l;
else x=x->r;
}
z->p = y;
if(y->key==NILL)root = z;
else if(z->key < y->key) y->l=z;
else y->r=z;
}
void print(node *pos, int flg){
if(flg)cout <<" "<<pos->key;
if(pos->l!=NULL)print(pos->l,flg);
if(!flg)cout <<" "<<pos->key;
if(pos->r!=NULL)print(pos->r,flg);
}
node * find(node *pos,int key){
if(pos==NULL)return pos;
if(pos->key>key) return find(pos->l,key);
if(pos->key<key) return find(pos->r,key);
return pos;
}
node *treeMinimum(node *x){
while(x->l!=NULL) x=x->l;
return x;
}
node * treeSuccessor(node *x){
if(x->r!=NULL) return treeMinimum(x->r);
node *y=x->p;
while(y!=NULL&&x==y->r)x=y,y=y->p;
return y;
}
void del(node *z){
node *y;
if(z->l==NULL||z->r==NULL) y = z;
else y=treeSuccessor(z);
node *x;
if(y->l!=NULL) x=y->l;
else x=y->r;
if(x!=NULL) x->p=y->p;
if(y->p==NULL) root=x;
else if (y==y->p->l) y->p->l=x;
else y->p->r=x;
if( y!=z) z->key=y->key;
}
char str[1000];
int main(){
root=mk_node(NILL,NULL,NULL,NULL);
int n;
cin>>n;
while(n--){
node *x=mk_node(NILL,NULL,NULL,NULL);
int a;
scanf("%s",str);
if(str[0]=='i'){
scanf("%d",&x->key);
insert(x);
}
else if(str[0]=='p'){
print(root,0);cout <<endl;
print(root,1);cout <<endl;
}
else if(str[0]=='f'){
cin>>a;
cout <<(find(root,a)!=NULL? "yes":"no")<<endl;
}
else if(str[0]=='d'){
cin>>a;
del(find(root,a));
}
}
return 0;
} | 0 |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
bool block[6][110][110];
bool visit[110][110];
int main(){
int w, h;
int xs, ys, xg, yg;
int n, c, d, x, y;
while(scanf("%d%d%d%d%d%d%d", &w, &h, &xs, &ys, &xg, &yg, &n) == 7){
memset(block, 0, sizeof block);
memset(visit, 0, sizeof visit);
for(int i = 0; i < n; ++i){
scanf("%d%d%d%d", &c, &d, &x, &y);
int dx, dy;
if(d){ dx = 2; dy = 4; }
else{ dy = 2; dx = 4; }
for(int j = 0; j < dy; ++j)
for(int k = 0; k < dx; ++k){
block[c][y + j][x + k] = true;
}
}
for(c = 5; c > 1 && !block[c][ys][xs]; --c);
if(c){
queue<int> q;
q.push(ys << 16 | xs);
visit[ys][xs] = true;
while(!q.empty()){
y = q.front() >> 16;
x = q.front() & 0xffff;
q.pop();
for(int dy = -1; dy <= 1; ++dy)
for(int dx = -1; dx <= 1; ++dx){
if(block[c][y+dy][x+dx] && !visit[y+dy][x+dx]){
visit[y+dy][x+dx] = true;
q.push(y+dy << 16 | x+dx);
}
}
}
}
puts(visit[yg][xg] ? "OK" : "NG");
}
} | /*** Mysterious Gems ***/
#include <bits/stdc++.h>
using namespace std;
#define SIZE 21
#define REP(i, n) for(int i=0; i<n; ++i)
void create_map(int map[][SIZE], int n){
int x, y;
REP(j, SIZE){
REP(i, SIZE){
map[j][i]=0;
}
}
REP(i, n){
cin >> x >> y;
map[y][x]=1;
}
return;
}
int main(){
int N, M;
int l;
int map[SIZE][SIZE], flag;
char d;
cin >> N;
while(N!=0){
create_map(map, N);
int xx=10, yy=10;
cin >> M;
REP(k, M){
cin >> d >> l;
while(l>0){
if(d=='N') ++yy;
else if(d=='E') ++xx;
else if(d=='S') --yy;
else --xx;
if(map[yy][xx]) map[yy][xx]=0;
--l;
}
}
flag=0;
REP(j, SIZE){
REP(i, SIZE){
if(map[j][i]){
flag=1;
break;
}
}
}
if(flag) cout << "No" << endl;
else cout << "Yes" << endl;
cin >> N;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FASTIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define inf 1e18
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define mod 1000000007
#define pb push_back
#define all(s) s.begin(),s.end()
#define pie 3.14159265358979323846
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define frr(i,a,b) for(ll i=b-1;i>=a;i--)
#define gcd __gcd
#define con continue
#define pii pair<ll,ll>
signed main(){
FASTIO;
ll tt=1;
//cin>>tt;
while(tt--){
ll n;cin>>n;
ll arr[n],sum=0;
ll a[n],s=0;
for(ll i=0;i<n;i++)cin>>a[i];
for(ll i=n-1;i>=0;i--)s+=a[i],arr[i]=s,s%=mod;
//for(ll i=0;i<n;i++)cout<<arr[i]<<" ";
//cout<<"\n";
for(ll i=0;i+1<n;i++){
sum=(sum%mod+(a[i]%mod*arr[i+1]%mod)%mod)%mod;
}
cout<<sum%mod<<"\n";
}
}
| #include <iostream>
#include <vector>
#include <queue>
#define to first
#define cost second
const int inf=1e9+7;
using namespace std;
int main(){
int n,tmp,r=0,flag[100]={},v=0;
cin>>n;
vector <pair<int,int> > gl[n];
priority_queue <pair<int,int> ,vector<pair<int,int> >, greater<pair<int,int> > >q;
//for(int i=1;i<n;i++) mincost[i]=inf;
for(int i=0;i<n;i++) for(int j=0;j<n&&cin>>tmp;j++) if(tmp!=-1) gl[i].push_back(make_pair(j,tmp));
int now=0;
for(int j=0;j<n-1;j++){
for(int i=0;i<gl[now].size();i++) if(!flag[gl[now][i].to]) q.push(make_pair(gl[now][i].cost,gl[now][i].to));
flag[now]=1;
for(;flag[q.top().second];) q.pop();
//if(q.empty()) break;
r+=q.top().first;
now=q.top().second;
q.pop();
}
cout<<r<<endl;
return 0;
} | 0 |
#include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define ALL(c) (c).begin(), (c).end()
#define dump(a) cerr << #a << "=" << (a) << endl
template<class T> void chmin(T &t, T f) { if (t > f) t = f; } //t=min
template<class T> void chmax(T &t, T f) { if (t < f) t = f; } //t=max
using namespace std;
int main() {
int N,Q;
int M,date;
bool dates[100][50]; //date N
while(cin >> N >> Q) {
if (N == 0 && Q == 0) break;
fill_n((bool *)dates,sizeof(dates)/sizeof(bool),false);
rep(n,N) {
cin >> M;
rep(m,M) { //Dates
cin >> date;
dates[date][n] = true;
}
}
/*
rep(n,N) {
rep(d,20) {
cout << dates[d][n];
}
cout << endl;
}
cout << endl; */
int cnt=0;
int max_cnt=0;
int max_d=0;
rep(d,100) {
cnt = 0;
rep(n,N) { //縦に見る
if(dates[d][n]) {
cnt++;
}
}
if (cnt > max_cnt) {
max_cnt = cnt;
max_d = d;
}
}
if (max_cnt >= Q) {
cout << max_d << endl;
}
else {
cout << 0 << endl;
}
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
scanf("%d",&l);
++Date[l];
}
}
}
l=0;
i=0;
for(k=0;k<100;k++){
if(i<Date[k] && Date[k]>=Q){
i=Date[k];
l=k;
}
}
printf("%d\n",l);
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////
int N, X;
ll B[MAX_N], L[MAX_N], R[MAX_N];
int idx[MAX_N];
int fid[MAX_N];
ll RS[MAX_N], LS[MAX_N];
bool ok(ll m) {
int q = m / X;
int r = m % X;
rep(i, 0, N) {
ll tmp = 0;
if(r == 0) {
tmp += RS[q];
tmp += LS[N] - LS[q];
}
else {
if(B[i] > r) tmp += L[i] * (r - B[i]);
else tmp += R[i] * (r - B[i]);
if(fid[i] < q) {
tmp -= R[i] * (X - B[i]);
tmp += RS[q + 1];
tmp += LS[N] - LS[q + 1];
}
else {
tmp -= -L[i] * B[i];
tmp += RS[q];
tmp += LS[N] - LS[q];
}
}
if(tmp >= 0) {
return true;
}
}
return false;
}
void solve() {
cin >> N >> X;
rep(i, 0, N) {
cin >> B[i] >> L[i] >> R[i];
idx[i] = i;
}
sort(idx, idx + N, [](int i, int j){
return R[i] * (X - B[i]) + L[i] * B[i] > R[j] * (X - B[j]) + L[j] * B[j];
});
// rep(i, 0, N) {
// debug(R[i] * (X - B[i]) - L[i] * B[i], B[i], L[i], R[i]);
// }
// debug(vi(idx, idx + N));
rep(i, 0, N) {
int at = idx[i];
fid[at] = i;
RS[i + 1] = RS[i] + R[at] * (X - B[at]);
LS[i + 1] = LS[i] - L[at] * B[at];
}
ll lv = -1, rv = 1ll * N * X;
while(rv - lv > 1) {
ll m = (lv + rv) / 2;
if(ok(m)) rv = m;
else lv = m;
}
cout << rv << "\n";
}
uint32_t rd() {
uint32_t res;
#ifdef __MINGW32__
asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
res = std::random_device()();
#endif
return res;
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
cerr << fixed;
cerr.precision(6);
rng.seed(rd());
#ifdef LOCAL
//freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
| #include<bits/stdc++.h>
#define MN 100000
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
ll res,v[MN+5],V[MN+5],ans,g[MN+5],G[MN+5];
int n,X,L[MN+5],R[MN+5],b[MN+5],rk[MN+5];
bool cmp(int x,int y){return v[x]+g[x]>v[y]+g[y];}
ll GetV(ll*s,int l,int r,int x){return s[r]-s[l-1]-((x>=l&&x<=r)?s[x]-s[x-1]:0);}
inline int Div(ll x,int y){return (x+y-1)/y;}
int main()
{
n=read();X=read();
for(int i=1;i<=n;++i)
{
b[i]=read();L[i]=read();R[i]=read();
v[i]=1LL*(X-b[i])*R[i];g[i]=1LL*b[i]*L[i];
rk[i]=i;ans+=b[i];
}
sort(rk+1,rk+n+1,cmp);
for(int i=1;i<=n;++i) V[i]=V[i-1]+v[rk[i]],G[i]=G[i-1]+g[rk[i]];
for(int i=1;i<=n;++i)
{
int l=0,r=n-1,mid,res=n;
while(l<=r)
{
mid=l+r>>1;
ll Val=GetV(V,1,mid,i)-GetV(G,mid+1,n,i)+v[rk[i]];
if(Val>=0) res=mid,r=mid-1; else l=mid+1;
}
ll Val=GetV(V,1,res,i)-GetV(G,res+1,n,i);
if(Val>=0) ans=min(ans,1LL*(res-(res>=i))*X+max(0,Div(g[rk[i]]-Val,L[rk[i]])));
else ans=min(ans,1LL*(res-(res>=i))*X+b[rk[i]]+Div(-Val,R[rk[i]]));
}
cout<<ans;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
int n,m; cin >> n >> m;
cout << max(n+m,max(n-m,n*m));
} | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b>>c;
e=c;
d=a;
a=b;
b=d;
c=a;
a=e;
cout<<a<<" "<<b<<" "<<c<<" "<<endl;
return 0;
}
| 0 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
int n,tmp,row_sum,col_sum[11];
while(true){
scanf("%d",&n);
if(n == 0)break;
for(int i=0; i < 11; i++)col_sum[i] = 0;
for(int i=0; i < n; i++){
row_sum = 0;
for(int k=0; k < n; k++){
scanf("%d",&tmp);
printf("%5d",tmp);
row_sum += tmp;
col_sum[k] += tmp;
}
printf("%5d\n",row_sum);
col_sum[n] += row_sum;
}
for(int i=0; i <= n; i++)printf("%5d",col_sum[i]);
printf("\n");
}
return 0;
}
| #include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int cnt[10800];
int main(){
int n, q, m, d;
while(cin >> n >> q, n | q){
fill(cnt, cnt + 10800, 0);
int res = 0;
int mx = 0;
for(int i = 0;i < n;i++){
cin >> m;
for(int j = 0;j < m;j++){
cin >> d;
cnt[d]++;
mx = max(mx, cnt[d]);
}
}
for(int i = 10799;i >= 0;i--){
if(mx >= q && cnt[i] == mx)res = i;
}
cout << res << endl;
}
return 0;
} | 0 |
#include<iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
int point_a = 0;
int point_b = 0;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
if (a > b) {
point_a += a + b;
}
else if (a < b) {
point_b += a + b;
}
else {
point_a += a;
point_b += b;
}
}
cout << point_a << " " << point_b << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX << " " << pointY << endl;
pointX = pointY = count = 0;
cin >> n;
}
} while (n != 0);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, x;
x = 1;
cin >> N >> K;
int i=0;
while (2*x < x+K){
if (i>=N) {break;}
x*=2;
i++;
}
for (int j=0; j<N-i; j++){
x+=K;
}
cout << x << endl;
}
| #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
typedef long long ll;
const int inf =2e9;
int N,top=0;
int st[maxn];
int main(){
cin>>N;
st[top]=-inf;
for(int i=1;i<=N;i++){
int x;
cin>>x;
x=-x;
if(x>=st[top])st[++top]=x;
else{
int l=1,r=top;
while(l<=r){
int mid=(l+r)/2;
if(x>=st[mid])l=mid+1;
else r=mid-1;
}
st[l]=x;
}
}
cout<<top<<endl;
}
| 0 |
#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 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
return f.second > s.second;
}
ll gcd(ll a, ll b){
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll conbinationMemo[100][100];
void cmemoInit(){
rep(i, 100){
rep(j, 100){
conbinationMemo[i][j] = -1;
}
}
}
ll nCr(ll n, ll r){
if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
if(r == 0 || r == n){
return 1;
} else if(r == 1){
return n;
}
return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r){
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--) ret *= i;
return ret;
}
//-----------------------ここから-----------
ll n, m;
vector<vector<ll>> g;
vector<vector<ll>> rg;
vector<ll> t;
void dfs(ll now, vector<int> &visited){
visited[now] = 1;
rep(i, g[now].size()){
ll next = g[now][i];
if(visited[next]) continue;
dfs(next, visited);
}
t.push_back(now);
}
int main(void){
cin >> n >> m;
g.resize(n);
rg.resize(n);
vector<int> appeared(n, 0);
rep(i, n - 1 + m){
ll a, b;
cin >> a >> b;
a--, b--;
g[a].push_back(b);
rg[b].push_back(a);
appeared[b] = 1;
}
ll root = 0;
rep(i, n){
if(!appeared[i]){
root = i;
break;
}
}
vector<int> visited(n, 0);
dfs(root, visited);
reverse(all(t));
map<ll,ll> mp;
rep(i, t.size()){
mp[t[i]] = i;
}
rep(i, n){
sort(all(rg[i]), [&mp](const ll &f, const ll &s){
return mp[f] > mp[s];
});
}
vector<ll> ans(n);
rep(i, n){
if(rg[i].size() == 0){
ans[i] = 0;
} else {
ans[i] = rg[i][0] + 1;
}
}
rep(i, ans.size()){
cout << ans[i] << endl;
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
//#define cccgift
//#define getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
template<typename T>
inline void read(T &x)
{
static char ch;bool f=1;
for(x=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') f=0;
for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=getchar());x=f?x:-x;
}
template<typename T>
void print(T x)
{
if (x<0) x=-x,putchar('-');
if (x>9) print(x/10);
putchar(x%10+48);
}
template<typename T>
inline void print(T x,char ap) {print(x);if (ap) putchar(ap);}
template<typename T>
inline void chkmax(T &x,const T &y) {x=x<y?y:x;}
template<typename T>
inline void chkmin(T &x,const T &y) {x=x<y?x:y;}
int f[6001][12001],n,mod;
#define inc(x,y) x+=y,x>=mod?x-=mod:0
int main()
{
read(n),n*=3,read(mod),f[0][n]=1;
for(res i=1;i<=n;++i)
for(res j=n-i;j<=n+i;++j) {
if(j) inc(f[i][j],f[i-1][j-1]);
if(i>1&&j<2*n) inc(f[i][j],(ll)f[i-2][j+1]*(i-1)%mod);
if(i>2) inc(f[i][j],(ll)f[i-3][j]*(i-1)*(i-2)%mod);
}
int tot=0;
for(res i=n;i<=2*n;++i) inc(tot,f[n][i]);
print(tot,'\n');
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/
| #include <bits/stdc++.h>
using namespace std;
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<pair<long long, long long>> PrimeFactorize(long long n){
vector<pair<long long, long long>> res;
long long a = 0;
for(long long i = 2; i * i <= n; i++){
a = 0;
if(n%i == 0){
if(IsPrime(i)){
while(n % i == 0){
n /= i;
a++;
}
res.push_back(make_pair(i, a));
}
}
}
if(n!= 1) res.push_back(make_pair(n, 1));
return res;
}
int NumOfDivisor(long long n){
vector<pair<long long, long long>> res;
res = PrimeFactorize(n);
int num = 1;
for(int i = 0; i < res.size(); i++){
num *= (1 + res[i].second);
}
return num;
}
int main(){
const int mod = 1e9 + 7;
int n;
const int max_n = 1e3;
cin >> n;
long long ans = 1;
long long ex[max_n + 2] = {};
for(int i = 1; i <= n; i++){
vector<pair<long long, long long>> res;
res = PrimeFactorize(i);
for(int j = 0; j < res.size(); j++){
ex[res[j].first - 1] += res[j].second;
}
}
for(int i = 0; i < n; i++){
ans *= (ex[i] + 1);
ans %= mod;
}
cout << ans << endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
long int n,sum=0;
cin>>n;
vector<int>v;
for(long int i=1;i<=n;i++){
v.push_back(i);
if(i%3==0||i%5==0)
v.pop_back();
}
for(long int i=0;i<v.size();i++){
sum+=v[i];
}
cout<<sum;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long int math(long long int x)
{
long long int ans;
ans=x*(x+1)/2;
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int ff,n,fv,th,total,totalff,totalfv,totalth,ans;
cin>>n;
total= math(n);
ff=n/15;
totalff=15*math(ff);
th=(n/3);
totalth=3*math(th);
fv=(n/5);
totalfv=5*math(fv);
ans=total-totalfv-totalth+totalff;
cout<<ans;
} | 1 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define sz size()
const double EPS = 1e-10;
const int INF = 100000000;
int main(){
int n,m;
while(cin>>n>>m){
if(n==0 && m==0)break;
int data[600][600]={};
rep(i,600){
rep(j,600){
if(i==j){
data[i][j]=0;
}
else{
data[i][j]=INF;
}
}
}
rep(i,m){
int a,b;
cin>>a>>b;
a--;b--;
data[a][b]=1;
data[b][a]=1;
}
rep(k,n){
rep(i,n){
rep(j,n){
data[i][j]=min(data[i][j],data[i][k]+data[k][j]);
}
}
}
int c=0;
for(int i=1;i<n;i++){
if(data[0][i]<=2)
c++;
}
cout<<c<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
typedef vector<int> Vi;
typedef pair<int,int> Pii;
typedef pair<int,Pii> Pip;
const int INF = (1<<30);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(){
int n, m;
int a[10000], b[10000];
while( cin >> n >> m, n + m ) {
map<int, int> maps;
set<int> all;
for(int i=0; i<m; i++) {
cin >> a[i] >> b[i];
if( a[i] == 1 ) {
maps[b[i]] = 1;
all.insert(b[i]);
}
}
for(int i=0; i<m; i++) {
if( maps[a[i]] == 1 ) {
all.insert(b[i]);
}
if( maps[b[i]] == 1 ) {
if( a[i]!= 1 ) {
all.insert(a[i]);
}
}
}
cout << all.size() << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
for(int i=1;; i++) {
if(i*i>N) {
cout << (i-1)*(i-1) << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int n=sqrt(N);
cout << n*n << endl;
}
| 1 |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <limits>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
cout << (int)(floor(sqrt(N))*floor(sqrt(N))) << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T>
vector<pair<T, T>> prime_factorization(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T cnt = 0;
while(n % i == 0) {
n /= i; cnt++;
}
if(cnt != 0) ret.emplace_back(i, cnt);
}
if (n != 1) ret.emplace_back(n, 1);
return ret;
}
int main(){
int n; cin >> n;
map<int64_t, int64_t> f;
for (auto i = 2; i <= n; i++) {
auto p = prime_factorization(i);
for (auto & elm : p) f[elm.first] += elm.second;
}
int64_t ans = 1;
const int64_t mod = 1e9 + 7;
for (auto & elm : f) ans = ((elm.second + 1) * ans) % mod;
cout << ans << endl;
return 0;
} | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<set>
#include<cmath>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(a) a.begin(),a.end()
typedef long long ll;
typedef long double ld;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
int n, m, x, y,q;ll z, w=0, sum = 0, ans = 0;
const int MAX = 510000;
const int MOD = 1000000007;
int dp[10010][2][110];
int main(void) {
string s; int d; cin >> s >> d;
Fill(dp, 0);
dp[0][1][0] = 1;
rep(i, s.size()) {
rep(j, d) {
rep(k, 10) {
dp[i + 1][0][(j + k) % d] += dp[i][0][j];
dp[i + 1][0][(j + k) % d] %= MOD;
}
int Si = s[i] - '0';
rep(k, Si) {
dp[i + 1][0][(j + k) % d] += dp[i][1][j];
dp[i + 1][0][(j + k) % d] %= MOD;
}
dp[i + 1][1][(j + Si) % d] = dp[i][1][j];
}
}cout << (dp[s.size()][0][0] + dp[s.size()][1][0] - 1 + MOD) %MOD << endl;
} | #include <bits/stdc++.h>
#if ((_WIN32 || __WIN32__) && __cplusplus < 201103L)
#define lld I64d
#else
#define lld lld
#endif
//{{{
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
// clang-format off
#define debug(args...) {vector<string> _v = split(#args, ','); err(_v.begin(), args); cerr<<endl;}
vector<string> split(const string& s, char c) {vector<string> v; stringstream ss(s); string x; while
(getline(ss, x, c)) v.push_back(x); return v;} void err(vector<string>::iterator) {}
template<typename T, typename... Args> void err(vector<string>::iterator it, T a, Args... args)
{cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; err(++it, args...);}
// clang-format on
//}}}
const int N = 2e5 + 10;
int T;
const int mod = 1e9 + 7;
int d;
char s[10010];
int dp[10010][111];
int len;
int dfs(int pos, int cursum, bool ding)
{
if (pos == len)
{
return cursum == 0;
}
if (ding == false && dp[pos][cursum] != -1)
{
return dp[pos][cursum];
}
int ret = 0;
int ed = 9;
if (ding) ed = s[pos] - '0';
for (int i = 0; i <= ed; i++)
{
int v = dfs(pos + 1, (cursum + i) % d, ding && i == ed);
ret = (ret + v) % mod;
}
if (!ding) dp[pos][cursum] = ret;
return ret;
}
int main()
{
#ifdef LOCAL
freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
while (~scanf("%s", s))
{
scanf("%d", &d);
len = strlen(s);
clr(dp, -1);
int ans = dfs(0, 0, true);
ans = (ans - 1 + mod) % mod;
printf("%d\n", ans);
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi0 for(ll i=0;i<n;i++)
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int i=0;i<s.size();i++){
char a=(char)s[i];
int d=(int) a-'0';
sum+=d;
}
if(sum%9==0)cout<<"Yes\n";
else cout<<"No\n";
}
int main()
{
ll n;
cin>>n;
ll cnt=0;
ll a[n];
fi0{
cin>>a[i];
}
sort(a,a+n);
///fi0 cout<<a[i]<<' ';
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=j+1;k<n;k++){
if(a[i]!=a[j]&&a[j]!=a[k]){
vector<ll>xxx;
xxx.push_back(a[i]);
xxx.push_back(a[j]);
xxx.push_back(a[k]);
sort(xxx.begin(),xxx.end());
if(xxx[0]+xxx[1]>xxx[2])cnt++;
}
}
}
}
cout<<cnt<<endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N < 3){
cout << "0" << endl;
return 0;
}
vector<int> a(N);
for(int i = 0;i < N;i++){
cin >> a.at(i);
}
int count = 0;
for(int j = 2;j < N;j++){
for(int k = 1;k < j;k++){
for(int l = 0;l < k;l++){
if((a.at(j) == a.at(k)) || (a.at(k) == a.at(l)) || (a.at(l) == a.at(j)))continue;
if((a.at(j) < a.at(k) + a.at(l)) && (a.at(k) < a.at(l) + a.at(j)) && (a.at(l) < a.at(j) + a.at(k)))count++;
}
}
}
cout << count <<endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main()
{
string s;
int q;
cin >> s >> q;
cin.ignore();
string buf;
while (q)
{
getline(cin, buf);
//cout << "DEBUG:" << buf << endl;
if (buf.find("replace ") != string::npos)
{
char cmd[10] = {0};
int a1, a2;
char a3[1001] = {0};
sscanf(buf.c_str(), "%s %d %d %s", cmd, &a1, &a2, a3);
s.replace(a1, (a2+1)-a1, string(a3));
//cout << "DEBUG:replaced:" << s << endl;
}
else if (buf.find("reverse ") != string::npos)
{
char cmd[10] = {0};
int a1, a2;
sscanf(buf.c_str(), "%s %d %d", cmd, &a1, &a2);
string sub = s.substr(a1, (a2+1)-a1);
//cout << "DEBUG:sub( ):" << sub << endl;
reverse(sub.begin(), sub.end());
//cout << "DEBUG:sub(r):" << sub << endl;
size_t subsize = sub.size();
for (int i = a1, j = 0; i < a1 + subsize; i++, j++) {
s[i] = sub[j];
}
//cout << "DEBUG:reversed:" << s << endl;
}
else if (buf.find("print ") != string::npos)
{
char cmd[10] = {0};
int a1, a2;
sscanf(buf.c_str(), "%s %d %d", cmd, &a1, &a2);
cout << s.substr(a1, (a2+1)-a1) << endl;
}
q--;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
string s1, com, s2;
int n,a,b;
cin >> s1 >> n;
for ( int i = 0; i < n; i++ )
{
cin >> com >> a >> b;
if ( com == "print" )
{
cout << s1.substr(a, b-a+1) <<endl;
}
else if ( com == "replace" )
{
cin >> s2;
s1 = s1.replace(a, b-a+1, s2);
}
else if ( com == "reverse" )
{
string s3 = s1.substr(a, b-a+1);
int m = s3.size();
for (int k = 0; k < m; k++)
{
s1[a+k] = s3[m-1-k];
}
}
}
return 0;
}
| 1 |
//Misterious Gems
#include <iostream>
using namespace std;
enum Direction{
N = 1,//y+
E = 2,//x+
S = 3,//y-
W = 4///x-
};
struct Order{
Direction dir;
int length;
};
int main(){
int MaxN;//宝石最大数
bool GemField[21][21];//宝石の有無保持用フィールド[y][x]
bool RobotField[21][21];//ロボット通過情報保持用フィールド[y][x]
int MaxM;//命令数
Order Ord[30];//命令
int RobotX, RobotY;//ロボット位置
bool Gettable;//収集可能性
int i, j, k, l;//使用する一時変数
char c;//使用する一時変数
while (1){
//フィールド初期化
for (i = 0; i < 21; ++i){
for (j = 0; j < 21; ++j){
GemField[i][j] = false;
RobotField[i][j] = false;
}
}
RobotField[10][10] = true;
RobotX = 10; RobotY = 10;
Gettable = true;
//代入
cin >> MaxN;
if (MaxN == 0)break;
for (i = 0, j = 0, k = 0; i < MaxN; ++i){
cin >> j >> k;
GemField[k][j] = true;
}
cin >> MaxM;
for (i = 0, c = 0; i < MaxM; ++i){
cin >> c >> Ord[i].length;
switch(int(c)){
case 'N':
Ord[i].dir = N;
break;
case 'E':
Ord[i].dir = E;
break;
case 'W':
Ord[i].dir = W;
break;
case 'S':
Ord[i].dir = S;
break;
}
}
//命令実行&RobotFieldに反映
for (i = 0, k = 0, l = 0; i < MaxM; ++i){
//方向決定
k = (Ord[i].dir % 2 == 0) ? 1 : 0;//偶数ならX
l = (Ord[i].dir % 2 == 0) ? 0 : 1;//奇数ならY
if (Ord[i].dir >= 3){
k *= -1; l *= -1;
}
//移動
for (int j = 0; j < Ord[i].length; ++j){
RobotX += k; RobotY += l;
RobotField[RobotY][RobotX] = true;
}
}
//全収集チェック
for (i = 0; i < 21 && Gettable ; ++i){
for (j = 0; j < 21 && Gettable; ++j){
if (GemField[j][i] && !RobotField[j][i])Gettable = false;
}
}
//出力
cout << (Gettable ? "Yes" : "No") << endl;
}
return 0;
} | #include <stdio.h>
typedef struct _Gem{
int x;
int y;
bool hit;
} Gem;
static void
pick_gem(Gem* g, int n, int x, int y)
{
for (int i = 0; i < n; i++) {
if (!g[i].hit && g[i].x == x && g[i].y == y) {
g[i].hit = true;
return;
}
}
}
static bool
check_gem(Gem* g, int n)
{
for (int i = 0; i < n; i++) {
if (g[i].hit == false) {
return false;
}
}
return true;
}
int
main(void)
{
char line[80];
int n;
int m;
Gem g[20];
char d[30];
int l[30];
while (true) {
if (fgets(line, sizeof line, stdin) == NULL) {
return 1;
}
if (sscanf(line, "%d", &n) != 1) {
return 1;
}
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
if (fgets(line, sizeof line, stdin) == NULL) {
return 1;
}
if (sscanf(line, "%d %d", &(g[i].x), &(g[i].y)) != 2) {
return 1;
}
g[i].hit = false;
}
if (fgets(line, sizeof line, stdin) == NULL) {
return 1;
}
if (sscanf(line, "%d", &m) != 1) {
return 1;
}
for (int i = 0; i < m; i++) {
if (fgets(line, sizeof line, stdin) == NULL) {
return 1;
}
if (sscanf(line, "%c %d", &(d[i]), &(l[i])) != 2) {
return 1;
}
}
int x = 10;
int y = 10;
for (int i = 0; i < m; i++) {
if (d[i] == 'N') {
for (int k = 1; k <= l[i]; k++) {
pick_gem(g, n, x, ++y);
}
} else if (d[i] == 'S') {
for (int k = 1; k <= l[i]; k++) {
pick_gem(g, n, x, --y);
}
} else if (d[i] == 'E') {
for (int k = 1; k <= l[i]; k++) {
pick_gem(g, n, ++x, y);
}
} else {
for (int k = 1; k <= l[i]; k++) {
pick_gem(g, n, --x, y);
}
}
}
printf("%s\n", (check_gem(g, n) ? "Yes" : "No"));
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
// Create a boolean array "prime[0..n]" and initialize
// all entries it as true. A value in prime[i] will
// finally be false if i is Not a prime, else true.
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p=2; p*p<=n; p++)
{
// If prime[p] is not changed, then it is a prime
if (prime[p] == true)
{
// Update all multiples of p greater than or
// equal to the square of it
// numbers which are multiple of p and are
// less than p^2 are already been marked.
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
// Print all prime numbers
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a,ll b)
{
if(a>b)
return a;
return b;
}
ll power(ll x, ll y,ll mod)
{
ll temp;
if( y == 0)
return 1;
temp = power(x, y/2,mod);
if (y%2 == 0)
return (temp*temp)%mod;
else
return (((x*temp)%mod)*temp)%mod;
}
vector <vector <int> > g;
void dfs(int s,vector <int> &p,int &parent,int &child,set <int> &s2,vector <bool> &visited,vector <int> &depth,int &min,vector <int> &path);
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=nxt(),m=nxt();
vector <int> row;
g.resize(n+1,row);
set <pair<int,int> > edges;
for(int i=0;i<m;i++)
{//cout<<"came3\n";
int u=nxt(),v=nxt();
g[u].push_back(v);
edges.insert({u,v});
}
vector <int> p(n+1);
int parent=0,child=0,min=INT_MAX;
vector <int> path(n+1);
for(int i=1;i<=n;i++)
{//cout<<"came"<<endl;
vector <bool> visited;
visited.resize(n+1,0);
set <int> s2;
vector <int> depth(n+1);
depth[i]=0;
dfs(i,p,parent,child,s2,visited,depth,min,path);
}
if(parent!=0)
{
vector <int> test;
int cur=child;
test.push_back(cur);
//cout<<cur<<" "<<parent<<endl;
//return 0;
while(cur!=parent)
{//cout<<cur<<endl;
cur=path[cur];
test.push_back(cur);
}
cout<<test.size()<<endl;
for(auto val:test)
cout<<val<<endl;
return 0;
}
cout<<"-1\n";
return 0;
}
void dfs(int s,vector <int> &p,int &parent,int &child,set <int> &s2,vector <bool> &visited,vector <int> &depth,int &min,vector <int> &path)
{
visited[s]=1;
int x=s;
s2.insert(x);
for(int i=0;i<g[x].size();i++)
{
if(!visited[g[x][i]])
{
p[g[x][i]]=x;
depth[g[x][i]]=depth[x]+1;
dfs(g[x][i],p,parent,child,s2,visited,depth,min,path);
}
else{
if(s2.count(g[x][i])&&(depth[x]-depth[g[x][i]])<min)
{
child=x;
parent=g[x][i];
min=depth[x]-depth[g[x][i]];
path=p;
}
}
}
s2.erase(x);
}
| #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int N,M;
vector<int>G[1000];
int cnt[1000];
main()
{
cin>>N>>M;
for(int i=0;i<M;i++)
{
int u,v;cin>>u>>v;u--,v--;
G[u].push_back(v);
cnt[v]++;
}
queue<int>P;
for(int i=0;i<N;i++)
{
if(cnt[i]==0)P.push(i);
}
int sz=0;
while(!P.empty())
{
sz++;
int u=P.front();P.pop();
for(int v:G[u])
{
if(--cnt[v]==0)P.push(v);
}
}
cout<<-(sz==N)<<endl;
} | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> bool chmax(T &a, U b) { if (a < b) a = b; return true; }
template<class T, class U> bool chmin(T &a, U b) { if (b < a) a = b; return true; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007, MAX = 55555;
vi prime()
{
vi ret;
rep2(i, 3, MAX) {
bool ok = true;
rep2(j, 2, sqrt(i)) {
if (i % j == 0) {
ok = false;
break;
}
}
if (ok && i % 10 == 1) ret.eb(i);
}
return ret;
}
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
auto v = prime();
rep(i, n) {
if (i) cout << " ";
cout << v[i];
}
cout << endl;
return (0);
} | #include<bits/stdc++.h>
#define Rint register int
using namespace std;
const int N = 300003, mod = 1e9 + 7, ch[8][2] = {{3, 1}, {5, 2}, {2, 2}, {4, 7}, {3, 3}, {6, 1}, {5, 5}, {3, 1}};
char str[N];
int n, dp[N][8];
inline void qmo(int &x){x += (x >> 31) & mod;}
int main(){
scanf("%s", str); n = strlen(str); dp[n][1] = dp[n][2] = 1;
for(Rint i = n - 1;~i;-- i)
for(Rint j = 0;j < 8;++ j){
if(str[i] != '0') dp[i][j] = dp[i + 1][ch[j][1]];
if(str[i] != '1') qmo(dp[i][j] += dp[i + 1][ch[j][0]] - mod);
}
printf("%d\n", dp[0][0]);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
ll a; cin >> a;
mp[a]++;
}
ll cnt = 0;
for (auto u : mp) {
if (1 < u.second) cnt++;
}
string ans = "YES";
if (1 <= cnt) ans = "NO";
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf 1e18
#define no_of_test(x) int x; cin>>x; while(x--)
const int mod = 1e9 + 7;
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// no_of_test(x)
{
int n;
cin>>n;
int a[n];
set<int>s;
for(int i=0;i<n;i++)
{
cin>>a[i];
s.insert(a[i]);
}
if(s.size()==n)
{
cout<<"YES"<<'\n';
}
else
{
cout<<"NO"<<'\n';
}
}
return 0;
} | 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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,a,b;
cin >> n >> a >> b;
if(n==1) cout << "Hello World" << endl;
else cout << a+b << endl;
}
| 1 |
#include <iostream>
#include <vector>
#include <iterator>
#include <numeric>
#include <algorithm>
typedef long long ll;
using std::cin;
using std::cout;
const int MaxN = 100005;
int n, m; ll k;
int buk[MaxN];
ll arr[MaxN], tmp[MaxN];
bool vis[MaxN];
int main() {
cin >> n;
std::copy_n(std::istream_iterator<int>(cin), n, arr);
cin >> m >> k;
std::iota(buk, buk + n, 0);
while (m--) {
int pos; cin >> pos;
std::swap(buk[pos - 1], buk[pos]);
}
std::adjacent_difference(arr, arr + n, tmp);
for (int i = 0; i < n; ++i) {
if (!vis[i]) {
std::vector<int> vec;
int j = i;
do {
vis[j] = true;
vec.push_back(j);
j = buk[j];
} while (j != i);
int len = vec.size();
for (int p = 0; p < len; ++p) {
int from = vec[p];
int to = vec[(p + k) % len];
arr[from] = tmp[to];
}
}
}
std::partial_sum(arr, arr + n, std::ostream_iterator<ll>(cout, "\n"));
return 0;
} | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
ll mPrime = 1000*1000*1000 + 7;
ll n, x;
vector<ll> s;
vector<ll> facts;
vector<ll> invFacts;
vector<int> tbl;
ll mAdd(ll x, ll y) {
ll z = x + y;
if (z < mPrime) return z;
else return (z - mPrime);
}
ll mSub(ll x, ll y) {
ll z = x - y;
if (z >= 0) return z;
else return (z + mPrime);
}
ll mMul(ll x, ll y) {
return (x * y) % mPrime;
}
ll eGCD(ll a, ll b, ll& s, ll& t) {
if (a == 0) {
s = 0;
t = 1;
return b;
}
ll u;
ll g = eGCD(b % a, a, t, u);
s = u - (b / a) * t;
return g;
}
ll mInv(ll x) {
ll s, t;
eGCD(x, mPrime, s, t);
return s < 0 ? s + mPrime : s;
}
int main() {
cin >> n >> x;
s.resize(n);
for (ll i = 0; i < n; i++) {
cin >> s.at(i);
}
facts.resize(n+1);
invFacts.resize(n+1);
facts.at(0) = invFacts.at(0) = 1;
for (ll i = 1; i <= n; i++) {
facts.at(i) = mMul(i, facts.at(i-1));
invFacts.at(i) = mInv(facts.at(i));
}
sort(s.begin(), s.end());
tbl.resize(x+1, 0);
tbl.at(x) = 1;
ll lim = x;
for (ll k = n; k >= 1; k--) {
ll newLim = 0;
for (ll r = 1; r <= lim; r++) {
ll weight = tbl.at(r);
if (weight == 0) continue;
newLim = r;
ll rem = k;
for (ll t : s) {
if (r < t) break;
rem--;
ll newR = r % t;
tbl.at(newR) = mAdd(tbl.at(newR), weight);
}
tbl.at(r) = mMul(tbl.at(r), rem);
}
lim = newLim;
}
ll ans = 0;
for (ll r = 1; r <= lim; r++) {
ans = mAdd(ans, mMul(tbl.at(r), r));
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while(cin>>n, n) {
int now, max;
cin>>now;
max=now;
for(int i=1; i<n; i++) {
int t;
cin>>t;
if(now<=0) now=t;
else now+=t;
if(max<now) max=now;
}
cout<<max<<'\n';
}
return 0;
} | #include <iostream>
int calcMaxSum(int amount_set);
int main()
{
while (true) {
int amount_set;
std::cin >> amount_set;
if(amount_set == 0) {
break;
}
std::cout << calcMaxSum(amount_set) << std::endl;
}
return 0;
}
int calcMaxSum(int amount_set)
{
const int MAXNUMBER = 100000;//??\????????????????????§??????
int *data;
data = new int[amount_set + 1];
int *sum = new int[amount_set + 1];
sum[0] = 0;//???????????????????????????????????´??????sum[0]??§??????
std::cin >> data[1];//?????????????????±???
sum[1] = data[1];//?????????????????????
for (int number = 2; number <= amount_set; number++) {
std::cin >> data[number];//????????????????????????
sum[number] = sum[number - 1] + data[number];// ????????´??°
}
int max = -MAXNUMBER;//????????????????????¨??¨-MAXNUMBER???????????????????????§???????????????????????????????°????
for (int number_big = 1; number_big <= amount_set; number_big++) {
for (int number_small = 0; number_small < number_big; number_small++) {
if (sum[number_big] - sum[number_small] > max) {
max = sum[number_big] - sum[number_small];
}
}
}
delete [] data;
delete [] sum;
return max;
} | 1 |
//#pragma GCC optimize ("-O3","unroll-loops")
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include <random>
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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define print(x) cout<<x<<'\n';
#define pe(x) cout<<x<<" ";
#define lb(v,n) lower_bound(v.begin(), v.end(), n);
#define ub(v,n) upper_bound(v.begin(), v.end(), n);
#define int long long
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i,v.size())cout << v[i] << ((i == v.size() - 1) ? "\n" : " ");
//#define double long double
template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
const int MOD = 1e9 + 7;
int n, x, y, z, l, ng;
ll dp[41][1 << 16], ans;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> x >> y >> z;
l = x + y + z - 1;
int m = (1 << l) - 1;
ng = (1 << l) | (1 << (l - x)) | (1 << (l - x - y));
dp[0][0] = 1;
REP(i, n) {
FOR(a, 1, 11) {
REP(s, 1 << l) {
int t = (s << a) | (1 << (a - 1));
if ((ng & t) != ng)dp[i + 1][t & m] = (dp[i + 1][t & m] + dp[i][s]) % MOD;
}
}
}
ans = 1;
REP(i, n)ans = ans * 10 % MOD;
REP(s, 1 << l) {
ans += MOD - dp[n][s]; ans %= MOD;
}
print(ans);
}
| #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
//const long long MOD = 998244353;
long long MOD;
using namespace std;
ll dp[6010][8005];
void solve()
{
int n;
scanf("%d%lld", &n, &MOD);
dp[0][n] = 1; // dp[i][j]: 後ろからi文字目まで選択済で、ただし残る2マス数が残る1マス数よりj-n個多い場合の数
int i, j;
for (i = 0; i < n * 3; i++) {
for (j = 0; j <= n*4; j++) {
if (dp[i][j]) {
if(j+1<=n*4) dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % MOD;
if(i+2<=n*3 && j-1>=0) dp[i + 2][j - 1] = (dp[i + 2][j - 1] + dp[i][j] * (n*3-i-1) % MOD) % MOD;
if(i+3<=n*3) dp[i + 3][j] = (dp[i + 3][j] + dp[i][j] * (n * 3 - i - 1) % MOD * (n * 3 - i - 2) % MOD) % MOD;
}
}
}
ll ans = 0;
for (j = n; j <= n * 4; j++) {
ans = (ans + dp[n * 3][j]) %MOD;
}
printf("%lld\n", ans);
return;
}
int main(int argc, char* argv[])
{
#if 1
solve();
#else
int T; scanf("%d", &T);
while(T--) {
solve();
}
#endif
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};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n,h,w;
cin>>n>>h>>w;
cout<<(n-h+1)*(n-w+1)<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
ll N, A, B;
cin >> N >> A >> B;
vec<ll> X(N);
rep(i, N) cin >> X[i];
ll ans = 0;
ll now = X[0];
for(int i=1;i<N;++i){
ans+=min(A*(X[i]-now),B);
now=X[i];
}
cout << ans << '\n';
}
| 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
int H,W,K,dp[110][10],s[10][3];
signed main(){
cin>>H>>W>>K;
for(int bit=0;bit<(1<<(W-1));bit++){
bool b=false;
for(int i=0;i<W-2;i++)
if((bit>>i)&1&(bit>>(i+1)))b=true;
if(b)continue;
for(int i=0;i<W;i++){
if(i!=0 && ((bit>>(i-1))&1))s[i][0]++;
else if(i!=W-1 && ((bit>>i)&1))s[i][2]++;
else s[i][1]++;
}
}
dp[0][0]=1;
for(int i=0;i<H;i++)
for(int j=0;j<W;j++)
for(int k=0;k<3;k++)
if(0<=j+k-1 && j+k-1<W)dp[i+1][j+k-1]=(dp[i+1][j+k-1]+dp[i][j]*s[j][k]%mod)%mod;
cout<<dp[H][K-1]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int MOD = 1e9 + 7;
int H, W, K;
vector<int> fib;
ll ans;
void input() {
cin >> H >> W >> K;
}
int solve(int n) {
if (n < 0) return 1;
return fib[n];
}
int main() {
input();
fib = vector<int>(W);
fib[0] = 1;
fib[1] = 2;
for (int i = 2; i < W; i++) fib[i] = fib[i-1] + fib[i-2];
vector<ll> w1, w2;
w1 = vector<ll>(W, 0);
w1[0] = 1;
rep(i, H) {
w2 = vector<ll>(W, 0);
for (int j = 0; j < W; j++) {
if (j > 0) w2[j-1] = (w2[j-1] + w1[j] * solve(j-2) * solve(W-j-2)) % MOD;
w2[j] = (w2[j] + w1[j] * solve(j-1) * solve(W-j-2)) % MOD;
if (j < W - 1) w2[j+1] = (w2[j+1] + w1[j] * solve(j-1) * solve(W-j-3)) % MOD;
}
w1 = w2;
}
cout << w1[K-1] << endl;
}
| 1 |
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) + (end) + 1, value)
#define fillvector(v, value) fill((v).begin(), (v).end(), value)
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
#define vecfirst (*vec.begin())
#define veclast (*vec.rbegin())
#define vecall(v) (v).begin(), (v).end()
#define vecupsort(v) (sort((v).begin(), (v).end()))
#define vecdownsort(v, type) (sort(vecall(v), greater<type>()))
#define veccmpsort(v, cmp) (sort(vecall(v), cmp))
using namespace std;
const int N = 500050;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
clock_t TIME__START, TIME__END;
void program_end()
{
#ifdef ONLINE
printf("\nTime used: %.6lf(s)\n", ((double)TIME__END - TIME__START) / 1000);
system("pause");
#endif
}
int h, w;
int A[N], B[N], cnt[N];
map<int, int> c;
inline void solve()
{
scanf("%d%d", &h, &w);
for (int i = 1; i <= h; ++i)
scanf("%d%d", &A[i], &B[i]);
for (int i = 1; i <= w; ++i)
c.insert(mp(i, i));
int ans = 0;
cnt[0] = w;
for (int i = 1; i <= h; ++i)
{
int L = A[i], R = B[i];
auto it = c.lower_bound(L);
int pos = 0;
while (it != c.end() && it->first <= R + 1)
{
pos = max(pos, it->second);
cnt[it->first - it->second]--;
it = c.erase(it);
}
if (pos && R + 1 <= w)
{
cnt[R + 1 - pos]++;
c.insert(mp(R + 1, pos));
}
while (!cnt[ans] && ans < w)
ans++;
if (ans == w)
puts("-1");
else
printf("%d\n", ans + i);
}
}
int main()
{
TIME__START = clock();
int Test = 1;
// scanf("%d", &Test);
while (Test--)
solve();
TIME__END = clock();
program_end();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/*
dp[i][j]=dp[i-1][j]+1; (j<L[i-1] or R[i-1]<j)
dp[i][j]=dp[i-1][L[i-1]-1]+1+(j-(L[i-1]-1)) (L[i-1]<=j<=R[i-1])
*/
const int M=2e5+5;
const int INF=0x3f3f3f3f;
struct SegT
{
struct TN
{
int mn,fi,add;
void app_add(int v)
{
add+=v;
mn+=v;
}
void app_set(int v) // arthimic
{
add=0;
fi=v;
mn=v;
}
}tn[M*4];
int P,L,R,V;
void push(int o,int l,int mi,int r)
{
if(tn[o].fi!=-1)
{
tn[o<<1].app_set(tn[o].fi);
tn[o<<1|1].app_set(tn[o].fi+mi-l+1);
tn[o].fi=-1;
}
if(tn[o].add)
{
tn[o<<1].app_add(tn[o].add);
tn[o<<1|1].app_add(tn[o].add);
tn[o].add=0;
}
}
void pull(int o)
{
tn[o].mn=min(tn[o<<1].mn,tn[o<<1|1].mn);
}
void build(int o,int l,int r)
{
tn[o].mn=tn[o].add=0;
tn[o].fi=-1;
if(l==r)
{
if(l==0) tn[o].mn=tn[o].add=INF;
return;
}
int mid=(l+r)>>1;
build(o<<1,l,mid);
build(o<<1|1,mid+1,r);
pull(o);
}
void add(int o,int l,int r)
{
if(L<=l&&r<=R)
{
tn[o].app_add(1);
return;
}
int mid=(l+r)>>1;
push(o,l,mid,r);
if(L<=mid) add(o<<1,l,mid);
if(mid<R) add(o<<1|1,mid+1,r);
pull(o);
}
void set(int o,int l,int r)
{
if(L<=l&&r<=R)
{
tn[o].app_set(V+l-L+1);
return;
}
int mid=(l+r)>>1;
push(o,l,mid,r);
if(L<=mid) set(o<<1,l,mid);
if(mid<R) set(o<<1|1,mid+1,r);
pull(o);
}
int query(int o,int l,int r)
{
if(l==r) return tn[o].mn;
int mid=(l+r)>>1;
push(o,l,mid,r);
if(P<=mid) return query(o<<1,l,mid);
else return query(o<<1|1,mid+1,r);
}
}segt;
int main()
{
int h,w; scanf("%d%d",&h,&w);
segt.build(1,0,w);
int l,r;
for(int i=0;i<h;i++)
{
scanf("%d%d",&l,&r);
if(l!=1)
{
segt.L=1; segt.R=l-1;
segt.add(1,0,w);
}
if(r!=w)
{
segt.L=r+1; segt.R=w;
segt.add(1,0,w);
}
segt.P=l-1;
segt.V=segt.query(1,0,w);
segt.L=l; segt.R=r;
segt.set(1,0,w);
int ans=segt.tn[1].mn;
printf("%d\n",ans>=INF ? -1 : ans);
}
return 0;
} | 1 |
#include<iostream>//itp14d.cpp
using namespace std;
int main(void)
{
long long int n,m,i,max=0,min=10000000,all=0;
cin>>n;
for(i=1;i<=n;i++){
cin>>m;
all=all+m;
if(max<=m) max=m;
if(min>=m) min=m;
}
if(n==1) cout<<m<<" "<<m<<" "<<m<<endl;
else cout<<min<<" "<<max<<" "<<all<<endl;
return 0;
}
| /*
?????§??§ 1000000 ??????????????§ 10000 ?????\?????????????????§?????????????????¨????¶??????????????????´?????????????????????1010 ????¨???????????????¨?????§??????????????????????????????????????????
int ??§????¶???????????????§???long long (??\?????¬??¬)????????¨??????
??¬??¬????????¬???????????????????????°?¢??????\??£????????????64bit????????§900????????§????????????
http://oshiete.goo.ne.jp/qa/56545.html
http://okwave.jp/qa/q2099363.html
printf?????????%lld??????????????§??¨???
*/
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int a[10000];
int n;
int max=-1000000,min=1000000;
long long sum=0;
cin >> n;
if(n==0){
printf("%d %d %d\n", 0, 0, 0);
return 0;
}
for(int i=0; i<n; i++){
cin >> a[i];
sum+=a[i];
if(max<a[i]) max = a[i];
if(min>a[i]) min = a[i];
}
printf("%d %d %lld\n", min, max, sum);
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int s=0,w=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
int n,m,q,a[2010][2010];
int po[2010][2010],ba[2010][2010];
int ob[2010][2010],zb[2010][2010];
int main(){
// freopen("duty.in","r",stdin);
// freopen("duty.out","w",stdout);
n=read(); m=read(); q=read();
for(int i=0;++i<=n;){
char ch;
for(int j=0;++j<=m;)
ch=getchar(),a[i][j]=(ch=='1');
ch=getchar();
}
for(int i=0;++i<=n;)
for(int j=0;++j<=m;){
po[i][j]=po[i-1][j]+po[i][j-1]-po[i-1][j-1]+a[i][j];
ba[i][j]=ba[i-1][j]+ba[i][j-1]-ba[i-1][j-1]+(a[i][j]&a[i-1][j])+(a[i][j]&a[i][j-1]);
ob[i][j]=ob[i][j-1]+(a[i][j]&a[i-1][j]);
}
for(int j=0;++j<=m;)
for(int i=0;++i<=n;)
zb[i][j]=zb[i-1][j]+(a[i][j]&a[i][j-1]);
for(int i=0;++i<=q;){
int sx=read(),sy=read(),ex=read(),ey=read();
int Sp=po[ex][ey]-po[sx-1][ey]-po[ex][sy-1]+po[sx-1][sy-1];
int Sb=ba[ex][ey]-ba[sx-1][ey]-ba[ex][sy-1]+ba[sx-1][sy-1];
printf("%d\n",Sp-Sb+ob[sx][ey]-ob[sx][sy-1]+zb[ex][sy]-zb[sx-1][sy]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main()
{
int N, M, Q; cin >> N >> M >> Q;
vector<string> S(N); for (auto &s : S) cin >> s;
vector<vector<int>> V(N+1, vector<int>(M+1)), Ex(N, vector<int>(M+1)), Ey(N+1, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
V[i+1][j+1] = V[i][j+1] + V[i+1][j] - V[i][j] + (S[i][j] == '1');
}
}
for (int i = 0; i < N-1; i++) {
for (int j = 0; j < M; j++) {
Ex[i+1][j+1] = Ex[i][j+1] + Ex[i+1][j] - Ex[i][j] + (S[i][j] == '1' && S[i+1][j] == '1');
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M-1; j++) {
Ey[i+1][j+1] = Ey[i][j+1] + Ey[i+1][j] - Ey[i][j] + (S[i][j] == '1' && S[i][j+1] == '1');
}
}
for (int i = 0; i < Q; i++) {
int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
x1--, y1--;
int v = V[x2][y2] - V[x2][y1] - V[x1][y2] + V[x1][y1];
int ex = Ex[x2-1][y2] - Ex[x2-1][y1] - Ex[x1][y2] + Ex[x1][y1];
int ey = Ey[x2][y2-1] - Ey[x2][y1] - Ey[x1][y2-1] + Ey[x1][y1];
cout << v - ex - ey << '\n';
}
return 0;
} | 1 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << v << s; }
template <typename T> void in(T &v) { cin >> v; }
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int G[500][500];
int ACC[501][501];
int main() {
int n, m, q; in(n),in(m),in(q);
loop(i,0,m) {
int l, r; in(l),in(r);
l--;r--;
G[l][r]++;
}
loop(y,0,n) {
loop(x,0,n) {
ACC[y+1][x+1] = ACC[y+1][x] + ACC[y][x+1] - ACC[y][x] + G[y][x];
}
}
// loop(y,0,n+1) {
// loop(x,0,n+1) {
// print(ACC[y][x], " ");
// }
// print("");
// }
loop(i,0,q) {
int l,r; in(l),in(r);
int cnt = ACC[r][r];
cnt += ACC[l-1][l-1];
cnt -= ACC[l-1][r];
cnt -= ACC[r][l-1];
// print(ACC[r][r]);
// print(ACC[l-1][l-1]);
// print(ACC[l-1][r]);
// print(ACC[r][l-1]);
print(cnt);
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], * ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) { fread_unlocked(cn, 1, cm, stdin); ci = cn; }
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm) while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
else while ((ct = *ci++) >= '0') A = A * 10 + ct - '0';
return A;
}
pair<int, bool> P[100001];
bool dame[100001];
pair<int, bool> Find(int A) {
if (P[A].first < 0) return mp(A, 0);
auto p = Find(P[A].first);
P[A].first = p.first;
P[A].second ^= p.second;
return P[A];
}
bool Unite(int A, int B) {
auto a = Find(A);
auto b = Find(B);
if (a.first == b.first) {
if(a.second == b.second) dame[a.first] = true;
return false;
}
if (P[a.first].first > P[b.first].first) swap(a, b);
P[a.first].first += P[b.first].first;
dame[a.first] |= dame[b.first];
P[b.first] = mp(a.first, !(a.second ^ b.second));
return true;
}
int Size(int A) {
return -P[Find(A).first].first;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint(), M = getint();
rep1(i, N) P[i] = mp(-1, 0);
rep(i, M) {
int a = getint(), b = getint();
Unite(a, b);
}
ll x = 0, y = 0, z = 0;
rep1(i, N) {
if (Find(i).first == i) {
if (Size(i) > 1) {
if (dame[i]) y++;
else x++;
}
else z++;
}
}
co(x * x + (x + y) * (x + y) + 2 * N * z - z * z);
Would you please return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> cn(n + 1, 0);
rep(i, n) cin >> a[i];
cn[0] = 3;
ll ans = 1;
rep(i, n){
if(cn[a[i]] <= 0){
cout << 0 << endl;
return 0;
}
ans *= cn[a[i]];
ans %= MOD;
cn[a[i]]--;
cn[a[i] + 1]++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100010];
bitset<100010> al;
vector<int> adj[100010];
int ans = 0;
int dist[100010];
void dfs(int u){
al[u] = true;
dist[u] = 1;
for(auto v : adj[u]){
if(!al[v]){
dfs(v);
dist[u] = max(dist[u], dist[v] + 1);
}
}
if(u != 1 && dist[u] == k && a[u] != 1) dist[u] = 0, ans++;
}
int main(){
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
if(i != 1) adj[a[i]].emplace_back(i);
}
if(a[1] != 1) ans++;
dfs(1);
printf("%d\n", ans);
return 0;
} | 0 |
#include <stdio.h>
#include <string.h>
int main(){
int A, B, len;
scanf("%d %d", &A, &B);
char S[100];
scanf("%s", &S);
len = strlen(S);
if(len != A+B+1){
printf("No\n");
return 0;
}
if(S[A] == '-'){
for(int i=0; i<len; i++){
if(i != A){
if(S[i] < 48 || S[i] > 57){
printf("No\n");
return 0;
}
}
}
printf("Yes\n");
return 0;
}else{
printf("No\n");
return 0;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main() {
int K = 0;
vector<int> in(5, 0);
for (int i = 0; i < 5; i++) cin >> in[i];
cin >> K;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (max(in[i], in[j]) - min(in[i], in[j]) > K && i != j) {
printf("%s\n", ":(");
return 0;
}
}
}
printf("%s\n", "Yay!");
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define REPI(i, s, e) for (int i = (s); i <= (e); i++)
#define rep(i, n) REP(i, 0, n)
#define repi(i, n) REPI(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define dump(x) (cout << #x << " = " << x << endl)
#define dump2(x, y) (cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl)
#define dump3(x, y, z) (cout << "(" << #x << ", " << #y << ", " << #z << ") = (" << x << ", " << y << ", "<< z << ")" << endl)
typedef long long ll;
typedef pair<int, int> pii;
#define VACANT 0
#define BLOCK 1
#define START 2
#define GOAL 3
#define INF (1<<29)
#define MAX 21
int w, h;
int brd[MAX][MAX];
int ans;
int sx, sy;
int gx, gy;
int dx[] = { -1, 1, 0, 0 };
int dy[] = { 0, 0, -1, 1 };
void dfs(int depth, int y, int x)
{
/*
rep(j, h) {
rep(i, w) {
char ch;
switch(brd[j][i]) {
case VACANT: ch = '.'; break;
case BLOCK: ch = '#'; break;
}
if (j == y && i == x)
ch = 'X';
if (j == gy && i == gx)
ch = 'G';
printf("%c ", ch);
}
puts("");
}
puts("-------");
*/
if (depth >= 10) return;
rep(i, 4) {
REP(t, 1, max(w, h)) {
int ny = y+dy[i]*t, nx = x+dx[i]*t;
if (ny == gy && nx == gx) {
ans = min(ans, depth+1);
return;
}
if (!(0 <= ny && ny < h)) goto NEXT;
if (!(0 <= nx && nx < w)) goto NEXT;
if (t == 1 && brd[ny][nx] == BLOCK) goto NEXT;
if (brd[ny][nx] == BLOCK) {
int ty = ny-dy[i], tx = nx-dx[i];
brd[ny][nx] = VACANT;
dfs(depth+1, ty, tx);
brd[ny][nx] = BLOCK;
break;
}
}
NEXT:
;
}
}
int main(void)
{
while (cin >> w >> h, w|h) {
rep(j, h)
rep(i, w) {
cin >> brd[j][i];
if (brd[j][i] == START) {
brd[j][i] = VACANT;
sx = i, sy = j;
} else if (brd[j][i] == GOAL) {
brd[j][i] = VACANT;
gx = i, gy = j;
}
}
ans = INF;
dfs(0, sy, sx);
printf("%d\n", ans==INF?-1:ans);
}
return 0;
} | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<vpii> vvpii;
const int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
const int MOD = 1000000007;
const double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
bool odd(const int &n) { return n & 1; }
bool even(const int &n) { return !odd(n); }
void solve();
main { solve(); return 0; }
// clang-format on
int di[] = {1, 0, -1, 0}, dj[] = {0, 1, 0, -1};
void solve() {
for (;;) {
vs s(12);
rep(i, 12) if (!(cin >> s[i])) return;
int c = 0;
rep(i, 12) rep(j, 12) {
function<void(int, int)> dfs = [&](int i, int j) {
if (i < 0 || j < 0 || i >= 12 || j >= 12 || s[i][j] == '0') return;
s[i][j] = '0';
rep(k, 4) dfs(i + di[k], j + dj[k]);
};
c += s[i][j] == '1';
dfs(i, j);
}
cout << c << 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>;
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; }
const ll INF = 1LL << 60;
int main() {
int N,L;
cin >> N >> L;
int R[N];
rep(i,N){
R[i] = (L + i);
}
int abs_min = 10000;
int abs_idx;
rep(i,N){
if(abs_min > (R[i]*R[i])){
abs_min = (R[i]*R[i]);
abs_idx = i;
}
}
int sum = 0;
rep(i,N){
sum += R[i];
}
sum -= R[abs_idx];
cout << sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,L;
cin>>N>>L;
int A;
A=L;
int R=A+N-1;
int eat;
if(R<=0){
eat=R;
}
else if(L>=0){
eat=L;
}
else{
eat=0;
}
int ans=(R+L)*(R-L+1)/2-eat;
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
int odd[100002]={}, even[100002]={};
int omax=0, emax=0, io, ie;
for(int i=0; i<n; i++){
int a;
cin >> a;
if(i%2==0){
odd[a]++;
if(odd[a]>omax){
omax = odd[a];
io = a;
}
}else{
even[a]++;
if(even[a]>emax){
emax = even[a];
ie = a;
}
}
}
sort(odd, odd+100000, greater<int>());
sort(even, even+100000, greater<int>());
int ans;
if(io!=ie) ans = n - omax - emax;
else ans = n - max(omax+even[1], odd[1]+emax);
cout << ans << endl;
return 0;
}
| /*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int N=1e5+5;
int read(){
int s=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){s=s*10+c-'0';c=getchar();}
return s*f;
}
int n,m,a[N],num[2][N],f[2][2],g[2][2];
int main(){
// freopen("_.in","r",stdin);
// freopen("_.out","w",stdout);
n=read();
for(int i=1;i<=n;i++){a[i]=read();num[i&1][a[i]]++;}
for(int t=0;t<2;t++){
for(int i=1;i<N;i++){
if(f[t][0]<=num[t][i]){
f[t][1]=num[t][g[t][1]=g[t][0]];
f[t][0]=num[t][g[t][0]=i];
}
else if(f[t][1]<=num[t][i]){
f[t][1]=num[t][g[t][1]=i];
}
}
}
if(g[0][0]!=g[1][0])printf("%d\n",n-f[0][0]-f[1][0]);
else printf("%d\n",min(n-f[0][0]-f[1][1],n-f[0][1]-f[1][0]));
return 0;
} | 1 |
#include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) for(int i = 0; i < (N); i++)
#define reps(i, N) for(int i = 1; i <= (N); i++)
#define repr(i, N) for(int i = (N) - 1; i >= 0; i--)
#define pub push_back
template<typename T>
void chmax(T &a, T b){ a = max(a, b); };
template<typename T>
void chmin(T &a, T b){ a = min(a, b); };
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
const ll LINF = 10000000000000000;
const int MOD = 1000000007;
const int dx[9] = { 0, 1, 0, -1, 1, 1, -1, -1, 0};
const int dy[9] = { 1, 0, -1, 0, 1, -1, -1, 1, 0};
//--------------------------------------//
int N, K, L;
vector<int> G[2][200000];
int d[2][200000];
int ans[200000];
map<P, int> m;
void bfs(int s, int c, int b){
queue<int> q;
q.push(s);
d[b][s] = c;
while(!q.empty()){
int n = q.front(); q.pop();
rep(i, G[b][n].size()){
int to = G[b][n][i];
if(d[b][to] == 0){
d[b][to] = c;
q.push(to);
}
}
}
}
void solve(){
rep(i, 2){
int c = 1;
rep(j, N){
if(d[i][j] == 0){
bfs(j, c, i);
c++;
}
}
}
rep(i, N){
m[P(d[0][i], d[1][i])]++;
}
rep(i, N){
cout << m[P(d[0][i], d[1][i])] << (i == N - 1 ? '\n' : ' ');
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> K >> L;
rep(i, K) {
int p, q;
cin >> p >> q;
p--; q--;
G[0][p].pub(q);
G[0][q].pub(p);
}
rep(i, L) {
int r, s;
cin >> r >> s;
r--; s--;
G[1][r].pub(s);
G[1][s].pub(r);
}
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
inline int read()
{
register int x=0;
register char ch=getchar();
while(ch<'0'||ch>'9')
ch=getchar();
while(ch>='0'&&ch<='9')
x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return x;
}
inline void write(int x)
{
register char st[10];
register int top=0;
if(!x)
putchar('0');
while(x)
st[++top]=(x%10)+48,x/=10;
while(top)
putchar(st[top--]);
putchar('\n');
}
const int N=200001;
int f1[N],f2[N];
int find(int x,int *f)
{
return f[x]==x? f[x]:f[x]=find(f[x],f);
}
map<pair<int,int>,int>mp;
int main()
{
register int n=read(),k=read(),l=read(),a,b;
for(register int i=1;i<=n;++i)
f1[i]=f2[i]=i;
while(k--)
if(find(a=read(),f1)!=find(b=read(),f1))
f1[find(a,f1)]=find(b,f1);
while(l--)
if(find(a=read(),f2)!=find(b=read(),f2))
f2[find(a,f2)]=find(b,f2);
for(register int i=1;i<=n;++i)
find(i,f1),find(i,f2);
for(register int i=1;i<=n;++i)
++mp[make_pair(f1[i],f2[i])];
for(register int i=1;i<=n;++i)
write(mp[make_pair(f1[i],f2[i])]);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
template<typename T>
ll sz(vector<T> vec){ return (ll)vec.size(); }
ll sz(string s){ return (ll)s.size(); }
ll gcd(ll a,ll b){ return ((!b) ?a :gcd(b, a%b)); }
int main(){
ll n,m,q;
cin >> n >> m >> q;
ll imos[n][n] = {};
rep(i,0,m){
ll l,r;
cin >> l >> r;
imos[0][r-1] += 1;
if(l != n) imos[l][r-1] -= 1;
}
rep(i,0,n) rep(j,1,n) imos[i][j] += imos[i][j-1];
rep(j,0,n) rep(i,1,n) imos[i][j] += imos[i-1][j];
rep(i,0,q){
ll l,r;
cin >> l >> r;
cout << imos[l-1][r-1] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main(){
int n,m;
int s[6];
char c[6];
cin >> n >> m;
rep(i,m)cin >> s[i] >> c[i];
bool ok =false;
rep(i,1000){
string now = to_string(i);
if(now.size()==n){
ok = true;
rep(j,m){
if(now[s[j]-1]!=c[j]){
ok = false;
break;
}
}
}
if(ok){
cout << stoi(now);
return 0;
}
}
cout << -1;
return 0;
} | 0 |
using namespace std;
#include <iostream>
#include <string>
#include <set>
#include <functional>
#include <vector>
#include <algorithm>
#include <stdio.h>
int CtoI(char c){
if(c=='I')return 1;
else if(c=='V')return 5;
else if(c=='X')return 10;
else if(c=='L')return 50;
else if(c=='C')return 100;
else if(c=='D')return 500;
else if(c=='M')return 1000;
}
int main()
{
string s;
while(getline(cin,s)){
int ans=0;
for(int i=1;i<(int)s.length();i++){
int x=CtoI(s[i-1]);
if(x<CtoI(s[i]))ans-=x;
else ans+=x;
}
ans+=CtoI(s[(int)s.length()-1]);
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };
int ans;
string str;
int main() {
while ( ( cin >> str ) ) {
ans = 0;
for ( int i = 0; i < str.size(); i++ ) {
if ( str[ i ] == 'M' ) {
if ( ans % 1000 ) {
ans += 800;
}
else {
ans += 1000;
}
}
else if ( str[ i ] == 'D' ) {
if ( ans % 500 ) {
ans += 300;
}
else {
ans += 500;
}
}
else if ( str[ i ] == 'C' ) {
if ( ans % 100 ) {
ans += 80;
}
else {
ans += 100;
}
}
else if ( str[ i ] == 'L' ) {
if ( ans % 50 ) {
ans += 30;
}
else {
ans += 50;
}
}
else if ( str[ i ] == 'X' ) {
if ( ans % 10 ) {
ans += 8;
}
else {
ans += 10;
}
}
else if ( str[ i ] == 'V' ) {
if ( ans % 5 ) {
ans += 3;
}
else {
ans += 5;
}
}
else {
ans++;
}
}
printf( "%d\n", ans );
}
return 0;
} | 1 |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
while(true){
int a, b, c, N, i, j, t1, t2, t3, r;
scanf("%d %d %d", &a, &b, &c);
if(a == 0 && b == 0 && c == 0) return 0;
scanf("%d", &N);
vector< vector<int> > results;
vector<int> ans(a+b+c+1, 2);
for(i = 0;i < N;++i){
vector<int> re;
scanf("%d %d %d %d", &t1, &t2, &t3, &r);
re.push_back(t1);re.push_back(t2);re.push_back(t3);re.push_back(r);
results.push_back(re);
if(r == 1){
ans[t1] = 1;ans[t2] = 1;ans[t3] = 1;
}
}
for(i = 0;i < N;++i){
vector<int> re = results[i];
if(re[3] == 0){
if(ans[re[0]] == 1 && ans[re[1]] == 1){
ans[re[2]] = 0;
}else if(ans[re[1]] == 1 && ans[re[2]] == 1){
ans[re[0]] = 0;
}else if(ans[re[2]] == 1 && ans[re[0]] == 1){
ans[re[1]] = 0;
}
}
}
for(i = 1;i < a+b+c+1;++i) printf("%d\n", ans[i]);
}
}
| #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
#include <sstream>
#include <queue>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
#define print(s) cout << (s) << endl
int main() {
int n;
cin >> n;
int a = 0, out = 0;
int base[4] = {0};
string s;
while (cin >> s) {
if (s == "HIT") {
for (int i = 2; i >= 0; i--) {
if (base[i]) base[i+1] = 1, base[i] = 0;
}
base[0] = 1;
if (base[3]) {
a++;
base[3] = 0;
}
}else if (s == "HOMERUN") {
REP(i,3) a += base[i];
a++;
REP(i,3) base[i] = 0;
}else {
out++;
}
if (out == 3) {
cout << a << endl;
out = 0;
a = 0;
REP(i,4) base[i] = 0;
}
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------------------------------
void MAIN() {
int n; cin >> n;
int mi = n;
for (int i = 1; i <= 5; i++) {
int t; cin >> t;
mi = min(mi, t);
}
cout << (n + mi - 1) / mi + 4 << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
// cin >> T;
while (T--) MAIN();
}
| #include <iostream>
#include <stdlib.h>
#include <iomanip>
using namespace std;
int main() {
int n;
cin >> n;
int num[n-1];
for (int i = 0; i < n; ++i)
{
cin >> num[i];
}
for (int i = 0; i < n; ++i)
{
if (i) cout << " ";
cout << num[n-1-i];
}
cout << endl;
} | 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, H, W;
cin >> N >> H >> W;
cout << max(0LL, N - H + 1) * max(0LL, N - W + 1) << endl;
return 0;
}
| #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int a,b;
string s;
vector<char> lst(10);
cin>>a>>b>>s;
bool ans=true;
// for(int i=0;i<s.size();i++){
// cin>>lst.at(i);
// {
for(int i=0;i<s.size();i++){
if (i!=a && s[i]=='-'){
ans=false;
break;
}
if (i==a && s[i]!='-'){
ans=false;
break;
}
}
if(ans==true){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
return is >> p.FF >> p.SS;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9+7;
class UnionFind{
private:
vector<int> par, rank;
public:
UnionFind(int n){
par.assign(n, 0);
rank.assign(n, 0);
for(int i=0;i<n;++i)
par[i] = i;
}
//find root of x
int find(int x){
if(par[x] == x)
return x;
return (par[x] = find(par[x]));
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y])
par[x] = y;
else{
par[y] = x;
if(rank[x] == rank[y])
++rank[x];
}
}
bool same(int x, int y){
return find(x) == find(y);
}
};
struct Edge{
int to, cost;
Edge(int t, int c): to(t), cost(c)
{}
bool operator>(const Edge& rhs) const{
return cost > rhs.cost;
}
bool operator<(const Edge& rhs) const{
return cost < rhs.cost;
}
};
typedef vector< vector<Edge> > Graph;
void add_edge(Graph& graph, int u, int v, int cost){
graph[u].push_back(Edge(v,cost));
graph[v].push_back(Edge(u,cost));
}
int kruskal(const Graph& G){
int N = SZ(G);
UnionFind uf(N);
vector<pair<Edge,int>> edges;
REP(i,N) for(auto& e:G[i]){
edges.push_back(MP(e, i));
}
sort(ALL(edges));
int res = 0;
for(int i=0,n=1;n<N;++i){
auto& e = edges[i].first;
int v = edges[i].second;
if(!uf.same(e.to,v)){
uf.unite(e.to, v);
res += e.cost;
++n;
}
}
return res;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int V, E; cin >> V >> E;
Graph G(V);
REP(i,E){
int a, b, c; cin >> a >> b >> c;
add_edge(G, a, b, c);
}
cout << kruskal(G) << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <algorithm>
constexpr int STR_MAX_LEN = 1000;
int main(){
char s1[STR_MAX_LEN], s2[STR_MAX_LEN];
int dp[STR_MAX_LEN + 1][STR_MAX_LEN + 1];
scanf("%s%s", s1, s2);
int s1_len = strlen(s1), s2_len = strlen(s2);
for(int i = 1; i <= s1_len; ++i){
dp[i][0] = i;
}
for(int i = 1; i <= s2_len; ++i){
dp[0][i] = i;
}
for(int i = 1; i <= s1_len; ++i){
for(int j = 1; j <= s2_len; ++j){
if(s1[i - 1] == s2[j - 1]){
dp[i][j] = dp[i - 1][j - 1];
}
else{
dp[i][j] = std::min({dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1});
}
}
}
printf("%d\n", dp[s1_len][s2_len]);
return 0;
} | 0 |
#include<iostream>
using namespace std;
#include<cstdio>
#include<cstring>
//メイン関数
int main()
{
char str[81];
while(fgets(str,sizeof(str),stdin)!=NULL){
// while(scanf("%[^/n]s",str)!=EOF){
//strstrで探索
if((strstr(str,"the")) || (strstr(str,"this")) || (strstr(str,"that"))){
printf("%s",str);
continue;
}
int len=strlen(str);
for(int i=1;i<=26;i++){
for(int j=0;j<len;j++){
if(str[j]>='a' && str[j]<='z'){
str[j]++;
if(str[j]=='{'){
str[j]='a';
}
}
}
//strstrで探索
if((strstr(str,"the")) || (strstr(str,"this")) || (strstr(str,"that")))break;
}
printf("%s",str);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;
#define INF INT_MAX/3
#define MAX_N 1000000001
int main(){
cin.sync_with_stdio(false);
int n;
while(cin >> n, n) {
int key[n];
rep(i, n) cin >> key[i];
string s;
cin >> s;
int i = 0;
rep(j, s.size()) {
if ('a' <= s[j] && s[j] <= 'z') {
if (key[i] <= 26) {
if (s[j] - 'a' >= key[i]) s[j] = (char)(s[j] - key[i]);
else s[j] = (char)('Z' - (key[i] - (s[j] - 'a') - 1));
} else {
s[j] = (char)(s[j] + ('A' - 'a'));
if (s[j] - 'A' >= key[i] - 26) s[j] = (char)(s[j] - key[i] + 26);
else s[j] = (char)('z' - (key[i] - (s[j] - 'A') - 27));
}
i = (i + 1) % n;
} else {
if (key[i] <= 26) {
if (s[j] - 'A' >= key[i]) s[j] = (char)(s[j] - key[i]);
else s[j] = (char)('z' - (key[i] - (s[j] - 'A') - 1));
} else {
s[j] = (char)(s[j] - ('A' - 'a'));
if (s[j] - 'a' >= key[i] - 26) s[j] = (char)(s[j] - key[i] + 26);
else s[j] = (char)('Z' - (key[i] - (s[j] - 'a') - 27));
}
i = (i + 1) % n;
}
}
cout << s << endl;
}
return 0;
} | 0 |
#define BUG
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fore(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#ifdef BUG
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " /";
__f(comma + 1, args...);
}
#endif
template <class T> bool mini(T& a, T b) { return a > b ? (a = b, 1) : 0; }
template <class T> bool maxi(T& a, T b) { return a < b ? (a = b, 1) : 0; }
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
const int INF = (int)1e9 + 7;
int main() {
#ifdef LOCAL
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
#endif // LOCAL
ios_base::sync_with_stdio(0); cin.tie(0);
int h, w, a, b; cin >> h >> w >> a >> b;
const int N = 2e5 + 3;
const ll M = 1e9 + 7;
auto mpow = [&](ll a, ll b) {
ll res = 1;
for (a %= M; b; a = a * a % M, b >>= 1) if (b & 1) res = res * a % M;
return res;
};
vi fac(N), inv(N);
fac[0] = 1;
fore(i, 1, N) fac[i] = fac[i - 1] * i % M;
inv[N - 1] = mpow(fac[N - 1], M - 2);
ford(i, N - 2, 0) inv[i] = inv[i + 1] * (i + 1) % M;
auto C = [&](int n, int k) {
return fac[n] * inv[n - k] % M * inv[k] % M;
};
ll ans = 0;
fort(i, b + 1, w) {
(ans += C(h - a - 1 + i - 1, i - 1) * C(w - i + a - 1, w - i)) %= M;
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a ; i<n ; i++)
#define r0 return 0;
#define endl '\n'
#define INF (int)1e15
/* Debug Begins */
# define trace(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
string to_string(char c) { return "'" + string(1, c) + "'";}
string to_string(string s) { return '"' + s + '"';}
string to_string(bool f) { if(f) return "True"; else return "False";}
string to_string(const char* s) { return to_string((string) s);}
template<typename A> string to_string(A);
template<typename A, typename B> string to_string(pair<A, B> p){
return "(" + to_string(p.first) + ": " + to_string(p.second) + ")";}
template<typename A> string to_string(A v) {bool f = false; string r = "{";
for (auto x: v) {if (f) r += ", "; r += to_string(x); f = true;} return r += "}";}
template<typename A> string to_string(vector<vector<A>> v) {string r;
for (auto x: v) r += "\n" + to_string(x); return r;}
int Nerr;
template<typename A> string to_string(A *p) {return to_string(vector<A>(p, p + Nerr));}
void err(istream_iterator<string>) { cerr << endl; }
template<typename T,typename... Args> void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << to_string(a) << "; "; err(++it, args...); }
template<typename T> void kek(T ans) {cout << ans << endl; exit(0);}
#define Lu(...) [&] (auto &&u) { return __VA_ARGS__; }
#define Luv(...) [&] (auto &&u, auto &&v) { return __VA_ARGS__; }
/***************************************************************/
int fact[N];
int power(int x, unsigned int y, unsigned int m)
{
if (y == 0)
return 1;
int p = power(x, y/2, m) % m;
p = (p *1ll* p) % m;
return (y%2 == 0)? p : (x *1ll* p) % m;
}
int ncr(int n, int r){
int ans = fact[n];
ans = (ans * power(fact[n-r], M-2,M)) % M;
ans = (ans * power(fact[r], M-2,M)) % M;
return ans;
}
int find_ans(int i1, int j1, int i2, int j2){
return ncr(i2-i1+j2-j1,i2-i1);
}
signed main()
{
ios_base::sync_with_stdio(0);
int TESTS=1;
fact[0] = 1;
rep(i,1,N) fact[i] = (fact[i-1] * i) % M;
// cin>>TESTS;
while(TESTS--)
{
int h,w,a,b;
cin >> h >> w >> a >> b;
int ans = 0;
rep(i,1,h-a+1){
int ni = i;
int nj = b;
// trace(ni, nj);
ans = (ans + find_ans(1,1,ni,nj) * find_ans(ni,nj+1,h,w)) % M;
}
cout << ans << endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
int k;
string s;
cin >> k >> s;
if(s.length() <= k){
cout << s << endl;
}else if(s.length() > k){
rep(i,k){
cout << s[i] ;
}
cout << "..." << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
const int INF = 1<<29;
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
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;
}
// 法mでのaの逆元を計算
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;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//最大公約数
long long gcd(long long x, long long y){
if(y==0) return x;
else return gcd(y,x%y);
}
//最小公倍数
long long lcm(long long x, long long y){
return x / gcd(x, y) * y;
}
// nが大きく,kが10^7程度の時の二項係数
long long com[200005];
void combination(long long n,long long k){
com[0] = 1;
for(int i=1;i<=k;i++){
com[i] = (com[i-1]*(n-i+1)%MOD)*modinv(i,MOD)%MOD;
}
}
int main(){
int K,X; cin >> K >> X;
int a=X-K+1;
if(K==1){
cout << X << endl;
return 0;
}
for(int i=a;i<X+K;i++){
cout << i << " ";
}
return 0;
}
| 0 |
#include <stdio.h>
#include <vector>
int judge( const int* number_table1 , const int* number_table2 )
{
const int right_side_table[ 6 ][ 6 ] =
{
//front=
// 1 2 3 4 5 6
{ -1 , 3 , 5 , 2 , 4 , -1 }, //top=1
{ 4 , -1 , 1 , 6 , -1 , 3 }, //2
{ 2 , 6 , -1 , -1 , 1 , 5 }, //3
{ 5 , 1 , -1 , -1 , 6 , 2 }, //4
{ 3 , -1 , 6 , 1 , -1 , 4 }, //5
{ -1 , 4 , 2 , 5 , 3 , -1 }, //6
};
for( int top = 0 ; top < 6 ; top++ )
{
for( int front = 0 ; front < 6 ; front++ )
{
int right = right_side_table[ top ][ front ] - 1;
if( right < 0 )
{
continue;
}
if( number_table1[ 0 ] != number_table2[ top ] )
{
continue;
}
if( number_table1[ 1 ] != number_table2[ front ] )
{
continue;
}
if( number_table1[ 2 ] != number_table2[ right ] )
{
continue;
}
if( number_table1[ 3 ] != number_table2[ 5 - right ] )
{
continue;
}
if( number_table1[ 4 ] != number_table2[ 5 - front ] )
{
continue;
}
if( number_table1[ 5 ] != number_table2[ 5 - top ] )
{
continue;
}
return 1;
}
}
return 0;
}
struct NumberTableEntry
{
int table[ 6 ];
};
typedef std::vector<NumberTableEntry> NumberTable;
int main( int argc , char** argv )
{
NumberTable number_table;
int data_size;
scanf( "%d" , &data_size );
number_table.reserve( data_size );
for( int i = 0 ; i < data_size ; i++ )
{
NumberTableEntry entry;
scanf( "%d %d %d %d %d %d" ,
&entry.table[ 0 ] ,
&entry.table[ 1 ] ,
&entry.table[ 2 ] ,
&entry.table[ 3 ] ,
&entry.table[ 4 ] ,
&entry.table[ 5 ] );
number_table.push_back( entry );
}
for( NumberTable::const_iterator itr = number_table.begin() ; itr != number_table.end() ; itr++ )
{
NumberTable::const_iterator itr2 = itr;
itr2++;
for( ; itr2 != number_table.end() ; itr2++ )
{
if( judge( &itr->table[ 0 ] , &itr2->table[ 0 ] ) )
{
printf( "No\n" );
return 0;
}
}
}
printf( "Yes\n" );
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
while(getline(cin,str)){
int flg = 0;
while(true){
for(int i = 0 ; i < str.length() ; i++){
string key1 = str.substr(i,3),key2 = str.substr(i,4);
if(key1 == "the" || key2 == "that" || key2 == "this") flg = 1;
}
if(flg) break;
else{
for(int j = 0 ; j < str.length() ; j++){
if('a' <= str[j] && str[j] <= 'z'){
str[j] -= 'a' - 'A';
str[j] = (char)('A'+(str[j]-'A'+26+1)%26);
str[j] += 'a' - 'A';
}
else continue;
}
}
}
cout << str << endl;
}
return 0;
} | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.