code_file1
stringlengths 80
4k
| code_file2
stringlengths 91
4k
| similar_or_different
int64 0
1
|
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
template<typename T,typename... A>
void err(T a,A... x){cout << a << ' '; err(x...);}
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
template<class T> void mkuni(vector<T>&v)
{
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
}
template<class T>
void print(T x,int suc=1)
{
cout<<x;
if(suc==1) cout<<'\n';
else cout<<' ';
}
template<class T>
void print(const vector<T>&v,int suc=1)
{
for(int i=0;i<v.size();i++)
print(v[i],i==(int)(v.size())-1?suc:2);
}
const int INF=0x3f3f3f3f;
const int maxn=1e5+7;
int n;
string s;
int main()
{
cin>>n;
cin>>s;
bool ok=0;
string op;
for(int st=0;st<2;st++)
{
for(int ed=0;ed<2;ed++)
{
op=(st?"S":"W");
for(int i=0;i<s.length()-1;i++)
{
char pre=(i?op[i-1]:(ed?'S':'W'));
char cur=op[i];
if(s[i]=='o')
{
if(cur=='S')
op+=pre;
else op+=(pre=='W'?'S':'W');
}
else{
if(cur=='W')
op+=pre;
else op+=(pre=='W'?'S':'W');
}
//dbg(st,ed,i);
// dbg(op);
}
char edd=(ed?'S':'W');
if(edd==op[s.length()-1])
{
if(s[s.length()-1]=='o')
{
char pre=op[s.length()-2];
if((pre==op[0]&&edd=='S')||(pre!=op[0]&&edd=='W'))
{
ok=1;
break;
}
}
else{
char pre=op[s.length()-2];
if((pre==op[0]&&edd=='W')||(pre!=op[0]&&edd=='S'))
{
ok=1;break;
}
}
}
}
if(ok) break;
}
if(!ok) cout<<"-1\n";
else cout<<op<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int a[100009];
for(int b: {0, 1}){
for(int c: {0, 1}){
a[1] = b;
a[2] = c;
a[0] = (s[1]=='o'?1:0)^b^c;
for(int i=3;i<n;i++){
a[i] = (s[i-1]=='o'?1:0)^a[i-1]^a[i-2];
}
if((s[n-1]=='o'?1:0)^a[n-1]==a[0]^a[n-2] && (s[0]=='o'?1:0)^a[0]==a[n-1]^a[1]){
for(int i=0;i<n;i++){
cout << (a[i]==1?'S':'W');
}
cout << endl;
return 0;
}
}
}
cout << -1 << endl;
}
| 1 |
//by rng_59
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <memory.h>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
using namespace std;
#define REP(i,n) for(int (i)=0; i<(int)(n); i++)
bool col[1000010];
bool row[1000010];
const int mod = 1e9+7;
int main(){
int N,M;
long long ans = 1;
cin >> N >> M;
REP(i,N) {
int a;
cin >> a;
if(row[a]) {
cout << 0;
return 0;
}
row[a] = 1;
}
REP(i,M) {
int b;
cin >> b;
if(col[b]) {
cout << 0;
return 0;
}
col[b] = 1;
}
int c=0,r=0;
for(int i=N*M; i>0; i--) {
int tc = c,tr = r;
if(col[i]) {
tc = 1;
c++;
}
if(row[i]) {
tr = 1;
r++;
}
if(col[i] || row[i]) ans *= (tc*tr)%mod;
else ans *= (tc*tr-(N*M-i))%mod;
ans %= mod;
}
cout << ans%mod << endl;
return 0;
}
|
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
int N=in();
string S=in<string>();
string WS[8];
REP(i,8) WS[i].resize(N,'_');
REP(i,4) WS[i][0]='S';
if(S[0]=='o'){
WS[0][1]='S';
WS[0][N-1]='S';
WS[1][1]='W';
WS[1][N-1]='W';
REP(i,2) WS[i+2].clear();
}
else{
WS[2][1]='S';
WS[2][N-1]='W';
WS[3][1]='W';
WS[3][N-1]='S';
REP(i,2) WS[i].clear();
}
REP(i,4) WS[i+4][0]='W';
if(S[0]=='x'){
WS[4][1]='S';
WS[4][N-1]='S';
WS[5][1]='W';
WS[5][N-1]='W';
REP(i,2) WS[i+6].clear();
}
else{
WS[6][1]='S';
WS[6][N-1]='W';
WS[7][1]='W';
WS[7][N-1]='S';
REP(i,2) WS[i+4].clear();
}
for(int i=1;i<N-2;i++){
REP(j,8){
if(WS[j].empty()) continue;
if(S[i]=='o'){
if(WS[j][i]=='S') WS[j][i+1]=WS[j][i-1];
else if(WS[j][i]=='W') WS[j][i+1]=WS[j][i-1]=='W'?'S':'W';
}
else{
if(WS[j][i]=='W') WS[j][i+1]=WS[j][i-1];
else if(WS[j][i]=='S') WS[j][i+1]=WS[j][i-1]=='W'?'S':'W';
}
}
}
for(int i=N-2;i<N;i++){
REP(j,8){
if(WS[j].empty()) continue;
if(S[i]=='o'){
if(WS[j][i]=='S'){
if((WS[j][i-1]=='S' && WS[j][(i+1)%N]=='W') || (WS[j][i-1]=='W' && WS[j][(i+1)%N]=='S')){
WS[j].clear();
}
}
else if(WS[j][i]=='W'){
if((WS[j][i-1]=='S' && WS[j][(i+1)%N]=='S') || (WS[j][i-1]=='W' && WS[j][(i+1)%N]=='W')){
WS[j].clear();
}
}
}
else{
if(WS[j][i]=='S'){
if((WS[j][i-1]=='S' && WS[j][(i+1)%N]=='S') || (WS[j][i-1]=='W' && WS[j][(i+1)%N]=='W')){
WS[j].clear();
}
}
else if(WS[j][i]=='W'){
if((WS[j][i-1]=='S' && WS[j][(i+1)%N]=='W') || (WS[j][i-1]=='W' && WS[j][(i+1)%N]=='S')){
WS[j].clear();
}
}
}
}
}
for(auto& x:WS){
if(!x.empty()){
out(x);
return 0;
}
}
out(-1);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl ;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
#define rep(i,N) for(int i=0; i < (int)N; i++)
#define all(v) (v).begin(),(v).end()
#define chor(x,y) x = (x||y);
const int INF = 1001001001;
int main(){
int h ,w; cin >> h >> w;
vector<vi>a, b, c; a = b = c = vector<vi>(h, vi(w));
rep(i,h) rep(j,w) cin >> a[i][j];
rep(i,h) rep(j,w) cin >> b[i][j];
rep(i,h) rep(j,w) c[i][j] = a[i][j] - b[i][j];
int bias = 7000;
vector<vector<vector<bool>>> dp(h,vector<vector<bool>>(w,vector<bool>(14000, false)));
dp[0][0][bias+c[0][0]] = true;
rep(i,h)rep(j,w)rep(k, 14000){
int d = c[i][j];
if(i>0 && (k-d>0 && k-d<14000)) chor(dp[i][j][k], dp[i-1][j][k-d]);
if(i>0 && (k+d>0 && k+d<14000)) chor(dp[i][j][k], dp[i-1][j][k+d]);
if(j>0 && (k-d>0 && k-d<14000)) chor(dp[i][j][k], dp[i][j-1][k-d]);
if(j>0 && (k+d>0 && k+d<14000)) chor(dp[i][j][k], dp[i][j-1][k+d]);
// if(dp[i][j][k]) cout << i << " " << j <<" " <<k<<endl;
}
int ans = INF;
rep(i,14000){
if(dp[h-1][w-1][i]) ans = min(ans, abs(i-bias));
}
// rep(i, 14000){
// if(dp[h-1][w-1][i])cout <<i<< endl;
// }
cout << ans <<endl;
}
|
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <unordered_set>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
using namespace std;
const int B = 12750;
bitset<B> dp[81][81];
int vs[81][81];
int main(void) {
int h, w;
scanf("%d%d", &h, &w);
REP(i, h) {
REP(j, w) {
scanf("%d", &vs[i][j]);
}
}
REP(i, h) {
REP(j, w) {
int v;
scanf("%d", &v);
vs[i][j] = abs(vs[i][j]-v);
}
}
// cerr << "> " << vs[0][0] << endl;
dp[0][0].set(vs[0][0]);
REP(i, h) {
REP(j, w) {
if(i == 0 && j == 0) {
continue;
}
int v = vs[i][j];
auto &s = dp[i][j];
bitset<B> b;
if(i-1 >= 0) {
b = dp[i-1][j];
}
if(j-1 >= 0) {
b |= dp[i][j-1];
}
s = b << v;
s |= b >> v;
REP(x, v) {
if(b[x]) {
s.set(v - x);
}
}
// cerr << s << endl;
}
}
const auto &s = dp[h-1][w-1];
REP(i, B) {
if(s[i]) {
cout << i << endl;
break;
}
}
return 0;
}
| 1 |
//32
#include<iostream>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;
int main(){
int p[2][10];
for(int i=0;i<2;i++){
for(int j=0;j<10;j++){
cin>>p[i][j];
}
}
for(int i=0;i<2;i++){
sort(p[i],p[i+1],greater<int>());
cout<<accumulate(p[i],p[i]+3,0)<<((i==0)?' ':'\n');
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
#define tpl(...) make_tuple(__VA_ARGS__)
typedef long long LL;
typedef pair<int, int> P; typedef pair<int, P> IP; typedef pair<P, P> PP;
typedef vector<int> Array; typedef vector<vector<int> > Array2;
typedef vector<LL> LArray; typedef vector<P> PArray; typedef vector<string> SArray;
const int INF = 1 << 29;
const LL LINF = 1LL << 60;
inline int getInt() { int itiv; return (cin >> itiv, itiv); }
template <typename T> void readAll(vector<T>& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i]; }
template <typename T, typename U> void readAll(vector<pair<T, U> >& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i].first >> vec[i].second; }
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };
inline bool between(int min, int max, int n) { return min <= n && n <= max; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }
int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };
int dr[] = { 0, -1, 0, 1 }, dc[] = { -1, 0, 1, 0 };
int m, n;
int main(void)
{
Array w(10), k(10);
readAll(w); readAll(k);
sort(ALL(w)); sort(ALL(k));
int ws = 0, ks = 0;
for (int i = 0; i < 3; i++)
{
ws += w[9 - i];
ks += k[9 - i];
}
cout << ws << ' ' << ks << endl;
return 0;
}
| 1 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int main() {
string s;
while (getline(cin, s)){
int n = s.length();
while (1){
if (s.find("the") != string::npos)break;
if (s.find("this") != string::npos)break;
if (s.find("that") != string::npos)break;
REP(i, n){
if ('a' <= s[i] && s[i] <= 'z'){
s[i]++;
if (s[i] > 'z')s[i] -= 26;
}
}
}
cout<<s<<endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
string stro, str;
while(getline(cin, stro)){
for(int i = 0; i < 26; i++){
str = stro;
for(int j = 0; j < stro.length(); j++){
if(str[j] >= 'a' && str[j] <= 'z')
if(str[j] + i > 'z')
str[j] += i - 26;
else
str[j] += i;
}
std::string::size_type f_the = str.find("the", 0);
std::string::size_type f_this = str.find("this", 0);
std::string::size_type f_that = str.find("that", 0);
if((f_the != string::npos && f_the == 0 && (str[f_the + 3] == ' ' || str[f_the + 3] == '.' || str[f_the + 3] == '\0')) || (f_this != string::npos && f_this == 0 && (str[f_this + 4] == ' ' || str[f_this + 4] == '.' || str[f_this + 4] == '\0')) || (f_that != string::npos && f_that == 0 && (str[f_that + 4] == ' ' || str[f_that + 4] == '.' || str[f_that + 4] == '\0')))
cout << str << endl;
else if((f_the != string::npos && (str[(f_the - 1 < 0) ? 0 : f_the - 1] == ' ' || str[(f_the - 1 < 0) ? 0 : f_the - 1] == '.' || str[(f_the - 1 < 0) ? 0 : f_the - 1] == '\n') && (str[f_the + 3] == ' ' || str[f_the + 3] == '.' || str[f_the + 3] == '\0')) || (f_this != string::npos && (str[(f_this - 1 < 0) ? 0 : f_this - 1] == ' ' || str[(f_this - 1 < 0) ? 0 : f_this - 1] == '.' || str[(f_this - 1 < 0) ? 0 : f_this - 1] == '\n') && (str[f_this + 4] == ' ' || str[f_this + 4] == '.' || str[f_this + 4] == '\0')) || (f_that != string::npos && (str[(f_that - 1 < 0) ? 0 : f_that - 1] == ' ' || str[(f_that - 1 < 0) ? 0 : f_that - 1] == '.' || str[(f_that - 1 < 0) ? 0 : f_that - 1] == '\n') && (str[f_that + 4] == ' ' || str[f_that + 4] == '.' || str[f_that + 4] == '\0')))
cout << str << endl;
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
bool isOK(vector<int> v) {
for (int i = 0; i < 8; i++) {
for (int j = i + 1; j < 8; j++) {
if (abs(v[j] - v[i]) == j - i) {
return false;
}
}
}
return true;
}
int main()
{
int k;
cin >> k;
vector<int> x(k), y(k);
for (int i = 0; i < k; i++) {
cin >> x[i] >> y[i];
}
vector<int> v = { 0, 1, 2, 3, 4, 5, 6, 7 };
do {
bool OK = true;
for (int i = 0; i < k; i++) {
if (v[x[i]] != y[i]) {
OK = false;
}
}
if (OK && isOK(v)) {
break;
}
} while (next_permutation(v.begin(), v.end()));
vector<string> res(8, "........");
for (int i = 0; i < 8; i++) {
res[i][v[i]] = 'Q';
}
for (int i = 0; i < 8; i++) {
cout << res[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i= (a); i<(b); i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
const long long INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
typedef long long ll;
//約数列挙
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
//sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
int n;
vector<vector<int>> board(8,vector<int>(8,0));
void change(vector<vector<int>> &board,int h,int w,int num){
REP(i,8){
board[h][i]+=num;board[i][w]+=num;
}
board[h][w]-=num*3;
//右上
for(int i=h-1;i>=0;i--){
if(h-i+w<0 || h-i+w>7)continue;
board[i][h-i+w]+=num;
}
//右下
for(int i=h+1;i<=7;i++){
if(h-i+w<0 || h-i+w>7)continue;
board[i][h-i+w]+=num;
}
//左上
for(int i=h-1;i>=0;i--){
if(w-(h-i)<0 || w-(h-i)>7)continue;
board[i][w-(h-i)]+=num;
}
//左下
for(int i=h+1;i<=7;i++){
if(w-(h-i)<0 || w-(h-i)>7)continue;
board[i][w-(h-i)]+=num;
}
}
void setqueen(int q,vector<int>queen,vector<vector<int>>board){
if(q==8){
REP(i,8){
int h=queen[i];
char ans[]="........";
ans[h]='Q';
cout << ans << endl;
}
exit(0);
}
if(queen[q]!=-1){
setqueen(q+1,queen,board);
} else {
for(int i=0;i<8;i++){
if(board[q][i]<1){
queen[q]=i;
change(board,q,i,1);
setqueen(q+1,queen,board);
change(board,q,i,-1);
}
}
}
}
signed main () {
scanf("%d",&n);
vector<int> queen(8,-1);
REP(i,n){
int a,b;scanf("%d %d",&a,&b);
//a--;b--;
queen[a]=b;
change(board,a,b,1);
}
setqueen(0,queen,board);
}
| 1 |
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF=1e+9;
const int MOD=1e+9+7;
//REPマクロ
#define REP(i,n) for(int i=0;i<(ll)(n);i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define REP2(i,a,b) for(int i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(ll)(b);i--)
//vectorの扱い
#define ALL(x) (x).begin(),(x).end() //sortなどの引数省略
#define SIZE(x) ((ll)(x).size()) //size
#define MAX(x) *max_element(ALL(x)) //最大値
#define MIN(x) *min_element(ALL(x)) //最小値
//グローバル変数
//ライブラリ挿入
const int H_MAX=80;
const int W_MAX=80;
const int A_MAX=80;
const int B_MAX=80;
vector<vector<vector<bool>>> dp(H_MAX+1,vector<vector<bool>>(W_MAX+1,vector<bool>(1+A_MAX*(H_MAX+W_MAX),false)));
int main(){
int H,W;
cin>>H>>W;
vector<vector<int>> A(H,vector<int>(W)),B(H,vector<int>(W));
REP(i,H){
REP(j,W){
cin>>A[i][j];
}
}
REP(i,H){
REP(j,W){
cin>>B[i][j];
}
}
dp[0][0][0]=true;
dp[1][0][0]=true;
dp[0][1][0]=true;
REP(i,H){
REP(j,W){
REP(v,1+A_MAX*(H_MAX+W_MAX)){
if(abs(v-abs(A[i][j]-B[i][j]))<=A_MAX*(H_MAX+W_MAX)){
dp[i+1][j+1][v]=dp[i+1][j+1][v]||dp[i][j+1][abs(v-abs(A[i][j]-B[i][j]))];
dp[i+1][j+1][v]=dp[i+1][j+1][v]||dp[i+1][j][abs(v-abs(A[i][j]-B[i][j]))];
}
if(v+abs(A[i][j]-B[i][j])<=A_MAX*(H_MAX+W_MAX)){
dp[i+1][j+1][v]=dp[i+1][j+1][v]||dp[i][j+1][v+abs(A[i][j]-B[i][j])];
dp[i+1][j+1][v]=dp[i+1][j+1][v]||dp[i+1][j][v+abs(A[i][j]-B[i][j])];
}
}
}
}
REP(v,1+A_MAX*(H_MAX+W_MAX)){
if(!dp[H][W][v]) continue;
cout << v <<endl;
return 0;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<double> p(200000);
for(int i=0; i<n; i++) cin >> p[i];
vector<int> sigma(1000);
sigma[0] = 1;
for(int i=1; i<1000; i++){
sigma[i] = sigma[i-1]+(i+1);
}
for(int i=0; i<n; i++){
p[i] = sigma[p[i]-1] / p[i];
}
double MAX = 0;
double tmp = 0;
for(int i=0; i<k; i++) tmp += p[i];
MAX = tmp;
for(int i=1; i<=n-k; i++){
tmp = tmp - p[i-1] + p[i+k-1];
if(tmp > MAX){
MAX = tmp;
}
}
printf("%.12f\n", MAX);
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for (int i=a;i<=b;i++)
#define fd(i,a,b) for (int i=a;i>=b;i--)
#define fi first
#define se second
#define mkp make_pair
typedef long long ll;
const int N=1100000;
int n,ans,flag,s[N],t[N],pos[N],a[N],b[N];
int read()
{
int ret=0,sig=1;
char c;
while (c=getchar(),(c<'0'||c>'9')&&c!='-');
if (c=='-') sig=-1;
else ret=c-'0';
while (c=getchar(),c>='0'&&c<='9') ret=ret*10+c-'0';
return ret*sig;
}
int main()
{
n=read();
fo(i,1,n)
{
char c;
while (c=getchar(),c<'a'||c>'z');
s[i]=c-'a'+1;
}
fo(i,1,n)
{
char c;
while (c=getchar(),c<'a'||c>'z');
t[i]=c-'a'+1;
if (s[i]!=t[i]) flag=1;
}
if (!flag)
{
printf("0\n");
return 0;
}
int w=n+1;
b[0]=1;
fd(i,n+1,1)
if (t[i]!=t[i-1])
{
b[++b[0]]=i-1;
while (w&&(w>i||s[w]!=t[i])) w--;
if (!w)
{
printf("-1\n");
return 0;
}
a[++a[0]]=w;
}
int tail=1;
fo(i,2,a[0])
{
while (tail<a[0]&&a[tail+1]-(i-tail-1)>=b[i]) tail++;
ans=max(ans,i-tail);
}
printf("%d\n",ans);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define N 110
#define INF 0x3f3f3f3f
using namespace std;
typedef struct {
int w;
int s;
int e;
}Edge;
Edge edge[N*N];
int m[N][N];
int father[N];
int n;
int k = 0; //edge的下标
int result = 0;
int findfather(int x){
return x == father[x] ? x : findfather(father[x]);
}
int cmp(Edge a, Edge b){
return a.w < b.w;
}
void Kruscal(){
for(int u = 0; u < k; u++){
int s = edge[u].s;
int e = edge[u].e;
if(findfather(s) != findfather(e)){
father[findfather(e)] = s;
result += edge[u].w;
}
}
printf("%d\n", result);
}
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) father[i] = i;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
int b;
scanf("%d", &b);
m[i][j] = b;
}
}
for(int i = 1; i <= n; i++){
for(int j = i; j <= n ;j++){
if(m[i][j] != -1) {
edge[k].w = m[i][j];
edge[k].s = i;
edge[k].e = j;
k++;
}
}
}
sort(edge, edge+k, cmp);
Kruscal();
return 0;
}
| 0 |
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/
#include <bits/stdc++.h>
#define LL long long
#define ll long long
#define SL(n) scanf("%lld",&n)
#define LF double
#define SF(n) scanf("%lf",&n)
#define pb push_back
#define mp make_pair
#define ON(n,i) (n|(1LL<<i))
#define OFF(n,i) (n&(~(1LL<<i)))
#define CHK(n,i) (n&(1LL<<i))
#define ff first
#define ss second
#define SET(arr) memset( arr , -1 , sizeof arr)
#define RESET(arr) memset( arr,0,sizeof arr)
#define srt(v) sort(v.begin(),v.end())
#define uniq(v) v.resize(distance(v.begin(),unique(v.begin(),v.end())))
#define found( s,d ) (s.find(d) != s.end())
#define FOR(i,s,e) for( LL i = s ; i<=e ; i++ )
#define RFOR(i,e,s) for( LL i = e ; i>=s ; i-- )
#define FILEIN freopen("in.txt","r",stdin)
#define FILEOUT freopen("WA.txt","w",stdout)
#define DEBUG(x) cerr<<#x<<" = "<<x<<endl
#define PRINTALL(v) {cerr<<endl<<"Printing: "<<#v<<endl;for(LL i = 0 ; i<v.size(); i++) DEBUG(v[i]); cerr<<endl;}
using namespace std;
LL f[2019];
int main(){
LL L,R;
SL(L); SL(R);
for( LL i = L ; i<= min(R,L+2019-1) ;i++ ) f[ i % 2019 ]++;
LL mn = 1e18;
for( LL i = 0 ; i<2019 ; i++ ){
for( LL j = i+1 ; j<2019 ; j++ ){
if( f[i] && f[j] ) mn = min(mn,(i*j)%2019);
}
}
cout<<mn<<endl;
return 0;}
|
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
const int mod = 2019;
const int INF = 1e16;
int main() {
ll l, r;
cin >>l >>r;
ll ans(INF);
for (ll i = l; i < r; ++i) {
for (ll j = l + 1; j <= r; ++j) {
ll ii = i % mod;
ll jj = j % mod;
ll can = ii * jj;
can %= mod;
ans = min(ans, can);
if (ans == 0) {
cout << 0;
return 0;
}
}
}
cout << ans;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 1e9+7;
int main(){
ll N;
cin >> N;
vector<ll> A(N), num(N+1, 0);
rep(i, 0, N) cin >> A[i];
ll ans = 1;
num[0] = 3;
rep(i, 0, N){
ans *= num[A[i]];
num[A[i]]--;
num[A[i]+1]++;
ans %= mod;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
ll n;
ll a[350];
ll dp[350][302*302 + 2];
ll dp1[350][302*302];
const ll mod = 998244353;
ll ME(ll x,ll nn,ll M)
{
ll result=1;
while(nn>0)
{
if(nn % 2 ==1)
result=(result * x)%M;
x=(x*x)%M;
nn=nn/2;
}
return result;
}
ll solve(ll id, ll sum)
{
if(sum < 0) return 0LL;
if(id == n+1){
if(sum == 0) return 1LL;
return 0;
}
ll &ret = dp[id][sum];
if(ret != -1) return ret;
ret = solve(id+1, sum - a[id]);
ret = (ret + 2*solve(id+1 , sum))%mod;
return ret;
}
ll solve2(ll id ,ll sum)
{
if(sum<0) return 0;
if(id == n+1) {
if(sum == 0) return 1LL;
return 0;
}
ll &ret = dp1[id][sum];
if(ret != -1) return ret;
ret = solve2(id+1, sum);
ret = (ret + solve2(id+1, sum-a[id]))%mod;
return ret;
}
int main()
{
cin >> n;
ll sum=0;
for(ll i=1;i<=n;i++) {
cin >> a[i];
sum += a[i];
}
ll ans = ME(3,n,mod);
ans = (ans * ME(3LL , mod-2,mod))%mod;
memset(dp,-1,sizeof dp);
for(ll i=(sum+1)/2; i <= sum; i++) {
ans = (ans - solve(1 , i) + mod)%mod;
}
//memset(dp,-1,sizeof dp);
if(sum%2 == 0){
memset(dp1,-1,sizeof dp1);
ans = (ans + solve2(1 , (sum)/2))%mod;
}
ans = (ans*3LL)%mod;
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
int mx = -101;
int my = 101;
rep(i, n) {
int x1;
cin >> x1;
mx = max(mx, x1);
}
rep(i, m) {
int y1;
cin >> y1;
my = min(my, y1);
}
if(mx >= y || my <= x) cout << "War" << endl;
else if(mx < my) cout << "No War" << endl;
else cout << "War" << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
//#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define L(a) scanf("%lld",&a)
#define L2(a,b) scanf("%lld%lld",&a,&b)
#define L3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define PI(a) printf("%d",a)
#define PL(a) printf("%lld",a)
#define PT(t) printf("Case %d: ",t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a,0,sizeof a)
#define SETR(a) memset(a,-1,sizeof a)
#define SZ(a) ((int)a.size())-1
#define f(i,a,b) for(int i=a;i<=b; i++)
#define fr(i,a,b) for(int i=a;i<=b; i++)
#define frr(i,a,b) for(int i=a;i>=b; i--)
#define frv(i,a) for(int i=0;i<a.size();i++)
#define pi 2.0*acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T mul(T p, T e, T M)
{
ll ret = 0;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret + p) ;
p = (p + p) ;
if(ret>=M)ret-=M;
if(p>=M)p-=M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b)
{
if(b == 0)return a;
return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M)
{
return BM(a, M - 2, M);
}
template <class T> inline T PW(T p, T e)
{
ll ret = 1;
for(; e > 0; e >>= 1)
{
if(e & 1) ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T>bool ISLEFT(T a, T b, T c)
{
if(((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)return 1; //Uporer dike //A,b,c, x okkher ordera sorted
else return 0;
}
#define mx 200004
#define base 193ll
typedef pair<int,int >P;
//////////////////////////
////////////////////////
#define F(i,a,b) for(int i=a;i<b; i++)
#define LL long long
#define MX 200007
#define md 998244353ll
///////////////////////////
///////////////////////////
///
int main(){
int n, m , x, y;
I2(n, m);
I2(x, y);
int ar[n+2];
int br[m+2];
for(int i = 1; i <= n; i++){
I(ar[i]);
}
for(int j = 1; j <= m; j++){
I(br[j]);
}
sort(ar + 1, ar + n + 1);
sort(br + 1 , br + m + 1);
for(int i = x + 1; i <= y; i++){
if(i > ar[n] && i <= br[1]){
PC("No War");
NL;
return 0;
}
}
PC("War");
NL;
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct edge{
int to;
int cap;
int rev;
};
struct Dinic{
int V;
vector<int> level, used;
vector<vector<edge>> G;
Dinic(int N){
V = N;
used.resize(V, 0);
level.resize(V, -1);
G.resize(V);
}
void add(int u, int v, int c){
edge e1 = {v, c, (int)G[v].size()};
G[u].push_back(e1);
edge e2 = {u, 0, (int)G[u].size() - 1};
G[v].push_back(e2);
}
void bfs(int s){
level.assign(V, -1);
queue<int> q;
q.push(s);
level[s] = 0;
while(!q.empty()){
int v = q.front();
q.pop();
for(edge e: G[v]){
if(e.cap > 0 && level[e.to] < 0){
level[e.to] = level[v] + 1;
q.push(e.to);
}
}
}
}
int dfs(int s, int t, int f){
if(s == t) return f;
for(int &i = used[s]; i < (int)G[s].size(); i++){
edge &e = G[s][i];
if(e.cap > 0 && level[e.to] > level[s]){
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0){
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int solve(int s, int t){
int flow = 0;
int INF = 1e9;
while(1){
bfs(s);
if(level[t] < 0) return flow;
used.assign(V, 0);
int f;
while((f = dfs(s, t, INF)) > 0) flow += f;
}
}
};
int main(){
int N;
cin >> N;
Dinic Ford(2 * N + 2);
int can[N][N];//can[i][j] = 1でペアが作れる
vector<int> a(N), b(N), c(N), d(N);
for(int i = 0; i < N; i++) cin >> a[i] >> b[i];
for(int i = 0; i < N; i++) cin >> c[i] >> d[i];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(a[i] < c[j] && b[i] < d[j]) can[i][j] = 1;
else can[i][j] = 0;
}
}
for(int i = 0; i < N; i++){
Ford.add(2 * N, i, 1);
Ford.add(N + i, 2 * N + 1, 1);
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(can[i][j]) Ford.add(i, N + j, 1);
}
}
int ans = Ford.solve(2 * N, 2 * N + 1);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int main(void){
int n;
cin>>n;
vector<P> red,blue;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
red.push_back({a,b});
}
for(int i=0;i<n;i++){
int c,d;
cin>>c>>d;
blue.push_back({c,d});
}
sort(blue.begin(),blue.end());
vector<bool> tf(n,false);
int cnt=0;
for(int i=0;i<n;i++){
int bx=blue[i].first;
int by=blue[i].second;
int y=-1000;
int x=-1;
for(int j=0;j<n;j++){
if(tf[j]){
continue;
}
int rx=red[j].first;
int ry=red[j].second;
if(bx<rx){
continue;
}
if(by<ry){
continue;
}
if(y<ry){
x=j;
y=ry;
}
}
if(x!=-1){
++cnt;
tf[x]=true;
}
}
cout<<cnt<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define en "\n"
#define ITER(i,a) for( typeof(a.begin()) i=a.begin();i!=a.end();i++)
#define mod 1000000007
#define mpp make_pair
#define mes(a,b) memset((a),(b),sizeof((a))
typedef map<int,int> MI;
typedef pair<int,int> PI;
typedef vector<int> VI;
typedef long long int LL;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
n=(2*n);
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int ans=0;
for(int i=0;i<n;i+=2)
{
ans=ans+a[i];
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
if (print_space_enable) std::cout << " ";
cout << fixed << setprecision(15) << head;
print_space_enable = true;
print(std::forward<Tail>(tail)...);
}
template<typename T>
void print(vector<T> v) {
for (size_t i = 0; i < v.size(); i++) {
if (i > 0) std::cout << " ";
std::cout << v[i];
}
std::cout << '\n';
}
void solve() {
Int n;
cin >> n;
vector<Int> a(2 * n);
for (Int i = 0; i < 2 * n; i++) {
cin >> a[i];
}
sort(all(a));
Int res = 0;
for (Int i = 0; i < 2 * n; i += 2) {
res += a[i];
}
print(res);
}
int main() {
solve();
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i < (n); i++)
#define FOR(i,a,b) for (int i=(a); i < (b); i++)
#define MOD 1000000007 //10^9+7
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
const int INF = numeric_limits<int>::max();
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0) res += m;
return res;
}
//greatest common divisor
long long gcd(ll a, ll b)
{
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
//least common multiple
long long lcm(ll a, ll b)
{
return a / gcd(a, b) * b ;
}
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return n != 1;
}
int main()
{
int k, x; cin >> k >> x;
for (int i = x - k +1; i <= x + k -1; i++) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
#define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF 1e18
#define INF (int)1e9+1
// Copied from Gennady-Korotkevich's template
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string)s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}\n";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}\n";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
template <typename A, typename B, typename C, typename D, typename E>
string to_string(tuple<A, B, C, D, E> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + "," + to_string(get<4>(p)) + ")";
}
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "\n[" << #__VA_ARGS__ << "]:\n", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// End of Gennady-Korotkevich's template
using llong = long long;
using PII = pair<int, int>;
const llong MOD = 998244353LL;
int main() {
IOS;
int n, k; cin >> n >> k;
vector<double> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = (a[i] + 1) / 2;
}
double sum = 0;
double mx = -1;
for (int i = 0; i < k; i++) {
sum += a[i];
}
mx = sum;
for (int i = k; i < n; i++) {
sum += a[i];
sum -= a[i - k];
mx = max(mx, sum);
}
cout << fixed << setprecision(10);
cout << mx;
}
| 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;
int n;
int main() {
read(n);
print(180 * (n - 2));
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
long long A,B,K;
cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2!=0){
A-=1;
}
B+=A/2;
A/=2;
}else{
if(B%2!=0){
B-=1;
}
A+=B/2;
B/=2;
}
}
cout<<A<<" "<<B<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,i,j,n;
deque<int >v;
cin >> n;
for(i = 0 ;i<n ;i++)
{
cin >> x;
deque<int >:: iterator it;
it = upper_bound(v.begin(),v.end(),x);
if(v.begin()== it)
v.push_front(x);
else
v[it -v.begin()]==x ;
}
cout<<v.size()<<endl;
}
|
#include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=610;
const int P=1000000007;
const db eps=1e-7;
#define pritnf printf
//char buf[1<<22],*p1=buf,*p2=buf,obuf[1<<22],*O=obuf;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
template <typename T>
inline void sc (T &x)
{
x=0; static int p; p=1; static char c; c=getchar();
while (!isdigit(c)) { if (c=='-') p=-1; c=getchar(); }
while ( isdigit(c)) { x=(x<<1)+(x<<3)+(c-48); c=getchar(); }
x*=p;
}
template <typename T>
inline void print (T x)
{
if (x< 0) putchar('-'),x=-x;
if (x>=10) print(x/10);
putchar(x%10+'0');
}
template <typename T>
inline void pr (T x) { print(x),putchar('\n'); }
template <typename T1,typename T2>
void chkmax (T1 &A,T2 B) { A=A>=B?A:B; }
template <typename T1,typename T2>
void chkmin (T1 &A,T2 B) { A=A<=B?A:B; }
bool vis[N][N];
int n,d1,d2;
void solve (int d)
{
int t=0;
while (d%4==0) d/=4,++t;
if (d&1)
{
for (int i=0; i< n; i++)
for (int j=0; j< n; j++)
if (((i>>t)+(j>>t))&1) vis[i][j]=1;
}
else
{
for (int i=0; i< n; i++) if ((i>>t)&1)
for (int j=0; j< n; j++)
vis[i][j]=1;
}
}
int main ()
{
// freopen (".in","r",stdin);
// freopen (".out","w",stdout);
sc(n),sc(d1),sc(d2); int m=n*n; n<<=1;
solve (d1);
solve (d2);
for (int i=0; i< n; i++)
for (int j=0; j< n; j++) if (!vis[i][j])
{
printf ("%d %d\n",i,j);
if (!--m) return 0;
}
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;
int main(){
int n,h,w;
cin>>n>>h>>w;
cout<<max(0,(n-h+1)*(n-w+1))<<endl;
return 0;
}
|
// https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_a
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> v(2);
cin >> v[0] >> v[1];
int ans = 0;
if (v[0] == 1 && v[1] == 1) {
ans += 400000;
}
REP(i, 2) {
if (v[i] == 1) {
ans += 300000;
} else if (v[i] == 2) {
ans += 200000;
} else if (v[i] == 3) {
ans += 100000;
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define RI register int
int read() {
int q=0;char ch=' ';
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') q=q*10+ch-'0',ch=getchar();
return q;
}
const int N=100005;
int n,a[4][N],b[N],ans[2];
void NO() {puts("No");exit(0);}
int main()
{
n=read();
for(RI i=1;i<=3;++i)
for(RI j=1;j<=n;++j) {
a[i][j]=read();
int x=(a[i][j]-1)%3+1,y=(a[i][j]+2)/3;
if((i!=2&&x==2)||(i==2&&x!=2)) NO();
if((j&1)^(y&1)) NO();
}
for(RI j=1;j<=n;++j) {
int x=(a[1][j]-1)%3+1,y=(a[1][j]+2)/3;
if((a[2][j]+2)/3!=y||(a[3][j]+2)/3!=y) NO();
if(x==1&&(a[3][j]-1)%3+1!=3) NO();
if(x==3&&(a[3][j]-1)%3+1!=1) NO();
if(x==3) ans[j&1]^=1;
b[j]=y;
}
for(RI i=1;i<=n;++i)
while(b[i]!=i) ans[(i&1)^1]^=1,swap(b[i],b[b[i]]);
if(ans[0]||ans[1]) NO();
puts("Yes");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n, x[1<<18], y[1<<18];
char d[1<<18];
void Rotate(){
for(int i = 1; i <= n; i++){
int cx = y[i],cy = 200000-x[i],cz;
if(d[i] == 'U') cz = 'R';
if(d[i] == 'R') cz = 'D';
if(d[i] == 'D') cz = 'L';
if(d[i] == 'L') cz = 'U';
x[i] = cx; y[i] = cy; d[i] = cz;
}
}
vector<pair<int,char>> v1[1<<19];
vector<pair<int,char>> v2[1<<19];
int solve_01(){
int ans = (1 << 24);
for(int i = 0; i <= 500000; i++) v1[i].clear();
for(int i = 1; i <= n; i++){
if(!(d[i] == 'R' || d[i] == 'U')) continue;
v1[x[i]+y[i]].push_back(make_pair(x[i],d[i]));
}
for(int i = 0; i <= 500000; i++){
sort(v1[i].begin(),v1[i].end());
for(int j = 0; j < (int)v1[i].size() - 1; j++){
if(!(v1[i][j].second == 'R' && v1[i][j+1].second == 'U')) continue;
ans = min(ans,v1[i][j+1].first - v1[i][j].first);
}
}
return ans * 10;
}
int solve_02(){
int ans = (1 << 24);
for(int i = 0; i <= 500000; i++) v2[i].clear();
for(int i = 1; i <= n; i++){
if(!(d[i] == 'L' || d[i] == 'R')) continue;
v2[y[i]].push_back(make_pair(x[i],d[i]));
}
for(int i = 0; i <= 500000; i++){
sort(v2[i].begin(),v2[i].end());
for(int j = 0; j < (int) v2[i].size()-1; j++){
if(!(v2[i][j].second == 'R' && v2[i][j+1].second == 'L')) continue;
ans = min(ans,v2[i][j+1].first - v2[i][j].first);
}
}
return ans*5;
}
int main(){
cin >> n;
for(int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> d[i];
int fans = (1 << 24);
for(int i = 1; i <= 4; i++){
int val1 = solve_01(); fans = min(fans,val1);
int val2 = solve_02(); fans = min(fans,val2);
Rotate();
}
if(fans == (1 << 24)) cout << "SAFE" << endl;
else cout << fans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sz(a) (ll)(a.size())
int main()
{
int h,w,n;
cin>>h>>w>>n;
int z = max(h,w);
cout<<(n+z-1)/z<<"\n";
return 0;
}
|
#include <iostream>
using namespace std;
void ask(int left, int right, bool male) {
int mid = (left + right) / 2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return;
if (((mid - left) % 2 == 0) == (male == (s == "Male"))) ask(left, mid - 1, male);
else ask(mid + 1, right, s == "Male");
}
int main() {
int N;
cin >> N;
cout << 0 << endl;
string s;
cin >> s;
if (s == "Vacant") return 0;
ask(1, N - 1, s == "Male");
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
queue<char>a,b,c;
int main(){
string al , bo ,chr ;
cin >> al ;
cin >> bo ;
cin >> chr ;
for(int i=0;i<al.size();i++){
a.push(al[i]);
}
for(int i=0;i<bo.size();i++){
b.push(bo[i]);
}
for(int i=0;i<chr.size();i++){
c.push(chr[i]);
}
char curr = a.front();
a.pop();
while(true){
if(curr=='a'){
if(a.empty()){
cout << "A" <<endl;
return 0;
}
curr = a.front();
a.pop();
}
else if(curr=='b'){
if(b.empty()){
cout << "B" <<endl;
return 0;
}
curr=b.front();
b.pop();
}
else if(curr=='c'){
if(c.empty()){
cout << "C" <<endl;
return 0;
}
curr=c.front();
c.pop();
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s[3];
rep(i, 3) cin >> s[i];
int t = 0;
vector<int> idx(3);
while (true) {
if (s[t].size() == idx[t]) {
cout << char('A' + t) << endl;
return 0;
}
t = s[t][idx[t]++] - 'a';
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<ll> num(1010,0);
vector<bool> prime(1010,true);//iが素数ならtrue(エラトステネスの篩)
void isprime(){
prime[0]=false;
prime[1]=false;
for(ll i=2;i*i<=1010;i++){
if(!prime[i]){continue;}
for(ll j=i*i;j<=1010;j+=i){
prime[j]=false;
}
}
return;
}
int main(){
ll n;cin>>n;
isprime();
if(n==1){cout<<1<<endl;return 0;}
for(ll i=2;i<=n;i++){//n以下の連続整数の素因数個数を数える
ll number=i;
for(ll j=2;j<=i;j++){
if(prime[j]==true){
while(number%j==0){
num[j]++;
number/=j;
}
}
}
}
ll ans=1;
for(ll i=2;i<=n;i++){//約数個数を計算
ans*=(num[i]+1);
ans%=mod;
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
const double pi=3.14159265;
int main(){
int n;
cin>>n;
if(n==0){
cout<<0<<endl;
return 0;
}
string s;
int p=n;
int q;
while(p!=1){
q=abs(p%(-2));
if(p<0) p--;
p/=(-2);
s+=q+'0';
}
cout<<1;
rep(i,s.size()){
cout<<s[s.size()-i-1];
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string a,b,c;
cin >> a >> b >> c;
int n=a.size();
int m=b.size();
int l=c.size();
if(a[n-1]==b[0] && b[m-1]==c[0])cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include<stdio.h>
int d,t,s;
int main()
{
scanf("%d %d %d", &d, &t, &s);
d=d+s-1;
if(t>=(d/s))printf("Yes");
else printf("No");
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define left 2*node+1
#define right left+1
#define mid (s+e>>1)
const ll N=5e5+5;
vector<ll> T[4*N];
void build(ll A[], ll node, ll s, ll e){
if(s==e){
T[node].push_back(A[s]);
return;
}
build(A, left, s, mid);
build(A, right, mid+1, e);
merge(T[left].begin(), T[left].end(), T[right].begin(), T[right].end(), back_inserter(T[node]));
}
ll query(ll node,ll s, ll e, ll x, ll y){
if(e<s || s>y || e<x)
return 0;
if(x<=s && e<=y){
ll a=upper_bound(T[node].begin(), T[node].end(), y)-T[node].begin();
return T[node].size()-a;
}
ll p1=query(left, s, mid, x, y);
ll p2=query(right, 1+mid,e, x, y);
return p1+p2;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, q;
cin>>n>>q;
ll A[n];
ll B[n];
for(ll i=0;i<n;i++)
cin>>A[i];
map<ll,ll> M;
for(ll i=n-1;i>=0;i--){
if(M.count(A[i]))
B[i]=M[A[i]];
else
B[i]=INT_MAX;
M[A[i]]=i;
}
build(B,0,0, n-1);
while(q--){
ll x, y;
cin>>x>>y;
ll ans=query(0,0,n-1,x-1,y-1);
cout<<ans<<"\n";
}
}
|
#include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
queue<pair<int,int> > qu2;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
#define ALL(a) a.begin(), a.end()
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.sise())
#define mod 1000000007
#define reps(i,s,n) for(int i = s; i < n; i++)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
deque<int> deq;
#define fi first
#define se second
//const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<int, int> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
template<typename T>
struct BIT {
int n;
vector<T> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, T x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
T sum(int i) {
T x = 0;
for (i++; i; i -= i&-i) {
x += d[i];
}
return x;
}
T sum(int l, int r) {
return sum(r-1) - sum(l-1);
}
};
int main(){
int n,q;
cin >> n>> q;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> pi(n+1,-1);
vector<vector<int>> ps(n);
rep(i,n){
int l = pi[a[i]];
if (l != -1) ps[l].push_back(i);
pi[a[i]] = i;
}//赤矢印
vector<vector<P>> qs(n);//青点
rep(qi,q) {
int l, r;
cin >> l >> r;
--l; --r;
qs[l].emplace_back(r,qi);
}
vector<int> ans(q);
BIT<int> d(n);
for (int x = n-1; x >= 0; --x) {//平面走査
for (int y : ps[x]) d.add(y,1);
for (P query : qs[x]) {
int r = query.first, i = query.second;
ans[i] = (r-x+1) - d.sum(r);
}
}
rep(i,q) cout << ans[i] << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i) // a ≦ i < b
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c) // [b,c) イテレータ
#define INF 1000000000000000
#define MOD 1000000007
using PII = pair<int64_t, int64_t>;
using VI = vector<int64_t>;
using VVI = vector<VI>;
using VS = vector<string>;
using VP = vector<PII>;
using i64 = int64_t;
template<typename T> void invec(vector<T> &A){for(T& a:A) cin >> a;}
char SWswap(char c){
if (c == 'S') return 'W';
else return 'S';
}
bool out(string S, string s){
int N = S.size();
if (s[N-1] == 'o'){
if (S[N-1] == 'S' && S[0] == S[N-2]){
return true;
}
else if (S[N-1] == 'W' && S[0] != S[N-2]){
return true;
}
}
else {
if (S[N-1] == 'S' && S[0] != S[N-2]){
return true;
}
else if (S[N-1] == 'W' && S[0] == S[N-2]){
return true;
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s;
cin >> N >> s;
VS ans{"SS", "SW", "WS", "WW"};
for(string S: ans){
rep(i, 1, N-1){
if (s[i] == 'o'){
if (S[i] == 'S') S.push_back(S[i-1]);
else S.push_back(SWswap(S[i-1]));
}
else { // s[i] == 'x'
if (S[i] == 'S') S.push_back(SWswap(S[i-1]));
else S.push_back(S[i-1]);
}
}
if (s[0] == 'o'){
if ((S[0] == 'S' && S[1] == S[N-1]) || (S[0] == 'W' && S[1] != S[N-1]))
if (out(S, s)){
cout << S + "\n";
return 0;
}
}
else {
if ((S[0] == 'S' && S[1] != S[N-1]) || (S[0] == 'W' && S[1] == S[N-1]))
if (out(S, s)){
cout << S + "\n";
return 0;
}
}
}
cout << "-1\n";
return 0;
}
// コンテスト前はtemplate振り返り。
// 書いて考える．場合分け．情報整理．
// 単純に分かる量から．愚直解を実装して研究．
// 境界，出力文字列 チェック．行末にスペース入れない．
// 可読性優先．高速化次点．
// まずは全探索，分割，次にDP(小さい問題から大きな問題)
// 制限を見る．境界に注意．求めたい量の変域．動かせる量．
// 偶奇，逆から，ソート，出現回数，出現位置，DP， 余事象，包除
// データ構造． 問題の特徴量．単調性→二分探索
// 存在判定：構成方法，入力の特徴
// 構築問題。極端解を試す。
// 例外を十分に含む一般化．想像力の限界
// 小さい系から例示
// 代数的処理．前処理によるクエリ高速化．
// 始めは過剰に例示・場合分けしてもいい．各場合を確実に対処．
// 自明な例から処理，除外．
// 小数のときは，精度の設定する．doubel 変数に数値を入力するときは 123. とする．
// コーナーケース。境界値。数表出力プログラム作る
// 実行エラー：vector添え字超え．0割り．
|
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b)
{
if (a%b == 0)return b;
return gcd(b, a%b);
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main()
{
int n; cin >> n;
vector<int> a(n); rep(i, n)cin >> a[i];
if (a[0] != 0)
{
cout << -1 << endl;
return 0;
}
for (int i = 1; i < n; ++i)
{
if (a[i] > a[i - 1] + 1)
{
cout << -1 << endl;
return 0;
}
}
ll res = 0;
for (int i = 1; i < n; ++i)
{
if (a[i] == a[i - 1] + 1)++res;
else res += a[i];
}
cout << res << endl;
}
| 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll x, ll n){
ll res = 1;
ll mul = x;
while(n){
if(n % 2) res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
struct Combination
{
int maxn;
vector<ll> fmemo;
vector<ll> imemo;
vector<ll> ifmemo;
Combination(int maxn) : maxn(maxn){
fmemo.resize(maxn + 1);
imemo.resize(maxn + 1);
ifmemo.resize(maxn + 1);
for(ll i = 1; i <= maxn; i++){
imemo[i] = modpow(i, MOD - 2);
}
}
ll fact(ll n){
if(n == 0) return 1;
if(fmemo[n]) return fmemo[n];
return fmemo[n] = n * fact(n - 1) % MOD;
}
ll ifact(ll n){
if(n == 0) return 1;
if(ifmemo[n]) return ifmemo[n];
return ifmemo[n] = imemo[n] * ifact(n - 1) % MOD;
}
ll com(ll n, ll k){
if(k > n) return 0;
if(k == n || k == 0) return 1;
return (fact(n) * ifact(k) % MOD) * ifact(n - k) % MOD;
}
};
int main()
{
int n, m, k;
cin >> n >> m >> k;
Combination com(n * m);
ll c = com.com(n * m - 2, k - 2);
ll ans = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(i + j == 0) continue;
if(i == 0 || j == 0) ans = (ans + c * (i + j) % MOD * (n - i) * (m - j) % MOD) % MOD;
else ans = (ans + c * (i + j) % MOD * (n - i) * (m - j) * 2 % MOD) % MOD;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,MOD=1e9+7;
long long fac[N],infac[N];
long long poww(long long x,long long y)
{
if(y==0) return 1;
if(y&1) return (x*poww(x,y-1))%MOD;
return poww((x*x)%MOD,y/2);
}
long long nck(int n,int k)
{
return (((fac[n]*infac[k])%MOD)*infac[n-k])%MOD;
}
long long get(int a,int b,int c,int d)
{
int tot=(c-a)+(d-b);
return nck(tot,c-a);
}
int main()
{
fac[0]=infac[0]=1;
for(int i=1;i<N;i++)
{
fac[i]=(fac[i-1]*i)%MOD;
infac[i]=poww(fac[i],MOD-2);
}
int n,m,a,b;
cin >> n >> m >> a >> b;
long long ans=0;
for(int i=0;i<n-a;i++)
{
ans+=get(0,0,i,b-1)*get(i,b,n-1,m-1);
ans%=MOD;
}
cout << ans << endl;
}
| 0 |
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
const long long MAX = 10000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
//そのまま計算すると負の値になるのでMODを足す
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(long long n, long long k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
long long a, b;
cin >> a >> b;
map<long long, long long> v;
long long tmpb = b;
for(long long i=2;i*i<=b;i++) {
while(tmpb % i == 0) {
tmpb /= i;
v[i] += 1;
}
}
if(tmpb!=1) v[tmpb] += 1;
long long ans = 1;
for(auto m:v) {
//cout << m.first << " " << m.second << endl;
ans = (ans * COM(m.second+a-1, a-1))%MOD;
}
cout << ans << endl;
}
/*
2 2 3
a1b2 b1b2 c1c2
a1+b1+b2 = 2
a2+b2+c2 = 1
*/
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s,t;
cin>>s>>t;
cout<<2*t-s<<endl;
}
| 0 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j;
int a[100][100],b[100],c[100],m,n;
int mn;
while(cin>>n>>m&&n+m){
for(i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=200000000;
for(i=0;i<m;i++){
int p,q,r;
cin>>p;
if(p){
cin>>p>>q>>r;
p--;
q--;
a[p][q]=a[q][p]=min(a[p][q],r);
}else{
cin>>p>>q;
p--;
q--;
memset(b,-1,sizeof(b));
b[p]=1;
c[p]=0;
for(j=0;j<n;j++){
if(j!=p)
c[j]=c[p]+a[p][j];
}
for(;;){
mn=q;
for(j=0;j<n;j++){
if(b[j]==-1&&c[mn]>c[j])
mn=j;
}
if(mn==q)
break;
b[mn]=1;
for(j=0;j<n;j++)
c[j]=min(c[j],c[mn]+a[mn][j]);
}
if(c[q]==200000000)
cout<<-1<<endl;
else
cout<<c[q]<<endl;
}
}
}
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int cost[101][101];
int d[101];
bool used[101]={};
int n,k;
#define INF 10000000
int V;
void dijkstra(int s){
fill(d,d+101,INF);
fill(used,used+101,false);
d[s]=0;
while(1){
int c=-1;
for(int u=0;u<V;u++){
if(!used[u] && (c==-1 || d[u]<d[c])){
c=u;
}
}
if(c==-1){
break;
}
used[c]=true;
for(int i=0;i<V;i++){
d[i]=min(d[i],d[c]+cost[c][i]);
}
}
}
int main(){
while(1){
scanf("%d %d",&n,&k);
if(!(n+k)) break;
for(int i=0;i<101;i++){
for(int j=0;j<101;j++){
cost[i][j]=INF;
}
}
V=n;
for(int i=0;i<k;i++){
int q;
scanf("%d",&q);
if(q){
int r,o,p;
scanf("%d %d %d",&r,&o,&p);
cost[r-1][o-1]=min(p,cost[r-1][o-1]);
cost[o-1][r-1]=min(p,cost[o-1][r-1]);
}else{
int r,p;
scanf("%d %d",&r,&p);
dijkstra(r-1);
if(d[p-1]==INF){
printf("%d\n",-1);
}else{
printf("%d\n",d[p-1]);
}
}
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 1005
int n;
char ans[maxn][maxn];
char s3[5][5] = {"aa.", "..b", "..b"};
char s4[5][5] = {"aabd", "ccbd", "deff", "degg"};
char s5[6][6] = {"aaeff", "b.e.g", "b.jjg", ".ccih", "dd.ih"};
char s6[8][8] = {"aabcc.", "b.b..d", "baa..d", "cc.aab", "..db.b", "..dbaa"};
char s7[8][8] = {"a.aa.a.", "a....ac", ".dd.bbc", "b..b..a", "b..b..a", ".ee.ccb", "cc.aa.b"};
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
ans[i][j] = '.';
if (n == 2)
{
printf("-1\n");
return 0;
}
if (n == 7)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%c", s7[i][j]);
printf("\n");
}
return 0;
}
if (n == 3)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%c", s3[i][j]);
printf("\n");
}
return 0;
}
if (n == 6)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%c", s6[i][j]);
printf("\n");
}
return 0;
}
if (n == 11)
{
for (int i = 0; i < 6; i++)
{
for (int j = 0; j < 6; j++)
ans[i][j] = s6[i][j];
}
for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
ans[6 + i][6 + j] = s5[i][j];
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%c", ans[i][j]);
printf("\n");
}
return 0;
}
int x, y;
// 4x+5y=n
for (int i = 0; i * 4 <= n; i++)
{
if ((n - 4 * i) % 5 == 0)
{
x = i;
y = (n - 4 * i) / 5;
}
}
//printf("%d %d\n", x, y);
for (int i = 0; i < x; i++)
{
for (int j = 0; j < 4; j++)
{
for (int k = 0; k < 4; k++)
ans[i * 4 + j][i * 4 + k] = s4[j][k];
}
}
for (int i = 0; i < y; i++)
{
for (int j = 0; j < 5; j++)
{
for (int k = 0; k < 5; k++)
ans[4 * x + i * 5 + j][4 * x + i * 5 + k] = s5[j][k];
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%c", ans[i][j]);
printf("\n");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<T> &v){
for(int i=0; i<v.size(); i++) is >> v[i];
return is;
}
#ifdef DBG
void debug_(){ cout << endl; }
template<typename T, typename... Args>
void debug_(T&& x, Args&&... xs){
cout << x << " "; debug_(forward<Args>(xs)...);
}
#define dbg(...) debug_(__VA_ARGS__)
#else
#define dbg(...)
#endif
void rec(vector<vector<int>> &b, int k, vector<vector<vector<int>>> &res){
int n = b.size();
int mx = 0;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++) mx=max(mx, b[i][j]);
}
int si=0, sj=0;
if(mx>0){
bool done = false;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(b[i][j]==mx){
si = i;
sj = j;
done=true;
break;
}
}
if(done) break;
}
}
int x = -1;
bool ok = true;
for(int i=0; i<n; i++){
set<int> a;
for(int j=0; j<n; j++){
if(b[i][j]>0) a.insert(b[i][j]);
}
if(x<0) x = a.size();
if(a.size()>k) return;
if(x!=a.size()){
if(i<si) return;
ok = false;
}
}
for(int i=0; i<n; i++){
set<int> a;
for(int j=0; j<n; j++){
if(b[j][i]>0) a.insert(b[j][i]);
}
if(a.size()>k) return;
if(x!=a.size()) ok = false;
}
if(ok && x==k){
res.push_back(b);
return;
}
for(int i=si; i<n; i++){
for(int j=(i==si?sj:0); j<n; j++){
if(i+1<n&&b[i][j]==0&&b[i+1][j]==0){
b[i][j] = b[i+1][j] = mx+1;
rec(b, k, res);
if(res.size()) return;
b[i][j] = b[i+1][j] = 0;
}
if(j+1<n&&b[i][j]==0&&b[i][j+1]==0){
b[i][j] = b[i][j+1] = mx+1;
rec(b, k, res);
if(res.size()) return;
b[i][j] = b[i][j+1] = 0;
}
}
}
}
vector<vector<vector<int>>> naive(int n, int k){
vector<vector<vector<int>>> ret;
vector<vector<int>> b(n, vector<int>(n));
rec(b, k, ret);
return ret;
}
string x3[3] = {
"aab",
"c.b",
"cdd",
};
string x4[4] = {
"aabc",
"ddbc",
"efgg",
"efhh",
};
string x5[5] = {
"..abc",
"..abc",
"ddeef",
"ggh.f",
"iihjj",
};
string x6[6] = {
"abc...",
"abc...",
"d.eeff",
"dghh..",
".g.ijj",
"kk.ill",
};
string x7[7] = {
"abc....",
"abc....",
"def....",
"def....",
"g..hhii",
"g..jjkk",
".llmmnn",
};
int main() {
ios_base::sync_with_stdio(false);
cout << setprecision(20) << fixed;
int n; cin >> n;
if(n<=2){
cout << -1 << endl;
return 0;
}
if(n==3){
for(int i=0; i<3; i++) cout << x3[i] << endl;
return 0;
}
int k = n%4+4;
int l = n/4-1;
for(int i=0; i<l; i++){
for(int j=0; j<4; j++){
cout << string(i*4, '.') << x4[j] << string(n-4*(i+1), '.') << endl;
}
}
if(k==4){
for(int j=0; j<4; j++){
cout << string(n-4, '.') << x4[j] << endl;
}
} else if(k==5){
for(int j=0; j<5; j++){
cout << string(n-5, '.') << x5[j] << endl;
}
} else if(k==6){
for(int j=0; j<6; j++){
cout << string(n-6, '.') << x6[j] << endl;
}
} else if(k==7){
for(int j=0; j<7; j++){
cout << string(n-7, '.') << x7[j] << endl;
}
}
return 0;
}
| 1 |
#include<iostream>
int n,m[3],i;main(){for(std::cin>>n;i<n;)std::cin>>m[i++];for(i=0;i++<*m;)*m%i+m[1]%i+m[2]%i||std::cout<<i<<"\n";}
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)
int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};
int dx9[9]={0,1,0,-1,1,-1,1,0,-1};
int dy9[9]={0,1,1,1,0,0,-1,-1,-1};
typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
ll ans = 1;
int c[3];
REP(i, 3) c[i] = 0;
REP(i, n) {
int a;
cin >> a;
int t = 0, p = 0;
REP(j, 3) if(c[j] == a) {
t++; p = j;
}
ans = (ans * t) % mod;
c[p]++;
}
cout << ans << endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
map<int64_t,int64_t>M;
for(int i=0;i<N;i++){
int64_t a; cin>>a;a*=-1;
if(M.count(a))
M.at(a)++;
else
M[a]=1;
}int64_t ans=0;
for(auto p:M){
auto k=p.first;
auto v=p.second;
k*=-1;int64_t a=1;
for(int i=0; ;i++){
if(k<a)break;
else
a*=2;
}int64_t b=a-k; b*=-1;
if(-k==b)
ans+=v/2;
else{
if(M.count(b)){
int64_t c=min(v,M.at(b)); ans+=c;
M.at(b)-=c;
}
}
}cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
#define debug(...) {cerr<<"[L"<<__LINE__<<"] "; _debug(__VA_ARGS__);}
template<typename T>
string join(const vector<T>&v, string del=", "){ stringstream s;
for(auto x : v) s << del << x; return s.str().substr(del.size());
}
template<typename T>
ostream& operator<<(ostream& o, const vector<T>&v){
if(v.size()) o << "[" << join(v) << "]"; return o;
}
template<typename T>
ostream& operator<<(ostream& o, const vector<vector<T> >&vv){
int l = vv.size();
if(l){ o<<endl; rep(i,l) o << (i==0 ? "[ " : ",\n " ) << vv[i] << (i==l-1 ? " ]" : ""); }
return o;
}
template<typename T1, typename T2>
ostream& operator<<(ostream& o, const pair<T1, T2>& p){
return o << "(" << p.first << ", " << p.second << ")";
}
inline void _debug(){cerr<<endl;}
template<class First, class... Rest>
void _debug(const First& first, const Rest&... rest){cerr<<first<<" ";_debug(rest...);}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const double PI = (1*acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;
inline void finput(string filename) {
freopen(filename.c_str(), "r", stdin);
}
int main(){
ios_base::sync_with_stdio(0);
// finput("./input");
int n; cin >> n;
vi a(n);
rep(i,n) cin >> a[i];
sort(all(a));
map<int,vi> mp;
rep(i,n) mp[a[i]].push_back(i);
vi used(n,0);
int ans = 0;
rrep(i,n){
if(used[i]) continue;
int lsb = __builtin_ffsll(a[i]) - 1;
int msb = (31 - __builtin_clz(a[i]));
int x = 1 << lsb;
REP(j,lsb,msb){
if((a[i]&(1<<j)) == 0) x |= 1<<j;
}
if(mp.count(x)){
if(mp[x].size() == 0) continue;
if(mp[x].back() == i){
mp[x].pop_back();
if(mp[x].size() == 0) continue;
}
int idx = mp[x].back();
used[idx] = 1;
mp[x].pop_back();
ans++;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
char x[200];
char Roma[7]={'I','V','X','L','C','D','M'};
int Arabia[7]={1,5,10,50,100,500,1000};
int a=0,b,ans=0,ls;
string s;
while(cin>>s){
ans=0;
a=0;
ls=s.size();
for(int i=ls-1;i>-1;i--){
for(int j=0;j<7;j++){
if(s[i]==Roma[j])b=Arabia[j];}
if(b>=a){ans+=b; a=b;}
if(b<a)ans-=b;}
cout<<ans<<endl;}}
|
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
string s,p;
int main()
{
ft
ll t,i,j,n,m=0,l,r;
cin>>s;
n=s.size();
for(i=0;i<n;i++)
{
if((i+1)<n && s[i]==s[i+1])
{
cout<<(i+1)<<" "<<(i+2)<<"\n";
return 0;
}
else if(((i+2)<n && s[i]==s[i+2]))
{
cout<<(i+1)<<" "<<(i+3)<<"\n";
return 0;
}
}
cout<<"-1 -1\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
template<class G>
class Fenwick_tree{
vector<G> a;
public:
Fenwick_tree(){}
Fenwick_tree(int n){ build(n); }
Fenwick_tree(const vector<G>& a){ build(a); }
void build(int n){
a.assign(n,G{});
}
void build(const vector<G>& a){
this->a=a;
for(int i=1;i<a.size();i++) if(i+(i&-i)-1<a.size()) (this->a)[i+(i&-i)-1]+=(this->a)[i-1];
}
void add(int i,const G& val){
for(i++;i<=a.size();i+=i&-i) a[i-1]+=val;
}
G sum(int l,int r)const{
if(l==0){
G res{};
for(;r>0;r-=r&-r) res+=a[r-1];
return res;
}
return sum(0,r)-sum(0,l);
}
int lower_bound(G val)const{
if(val<=G{}) return 0;
int x=0,k;
for(k=1;k<=a.size();k<<=1);
for(k>>=1;k>0;k>>=1) if(x+k<=a.size() && a[x+k-1]<val) val-=a[x+k-1], x+=k;
return x;
}
int upper_bound(G val)const{
if(val<G{}) return 0;
int x=0,k;
for(k=1;k<=a.size();k<<=1);
for(k>>=1;k>0;k>>=1) if(x+k<=a.size() && a[x+k-1]<=val) val-=a[x+k-1], x+=k;
return x;
}
};
int main(){
int n,q; scanf("%d%d",&n,&q);
vector<lint> a(n);
rep(i,n) scanf("%lld",&a[i]);
Fenwick_tree<lint> F(a);
rep(_,q){
int t,l,r; scanf("%d%d%d",&t,&l,&r);
if(t==0) F.add(l,r);
else printf("%lld\n",F.sum(l,r));
}
return 0;
}
|
#include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
using namespace atcoder;
int main(){
int N, Q;
cin >> N >> Q;
fenwick_tree<long long> a(N);
for (int i = 0; i < N; i++){
int x;
cin >> x;
a.add(i, x);
}
for (int i = 0; i < Q; i++){
int t;
cin >> t;
if (t == 0){
int p, x;
cin >> p >> x;
a.add(p, x);
}
if (t == 1){
int l, r;
cin >> l >> r;
cout << a.sum(l, r) << endl;
}
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n, m;
std::cin >> n >> m;
while (n != 0 && m != 0) {
int whole_price = 0;
std::vector<int> vegi(n);
for (auto &v : vegi) std::cin >> v;
std::sort(vegi.begin(), vegi.end());
for (auto i = 1; i <= n; ++i) {
whole_price += (i % m == 0) ? 0 : vegi[n - i];
}
std::cout << whole_price << std::endl;
std::cin >> n >> m;
}
}
|
#include <iostream>
#include <algorithm>
using namespace std;
const int N_MAX = 1000;
int n, m;
int p[N_MAX];
int main () {
while (cin >> n >> m, n || m) {
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
sum += p[i];
}
sort(p, p + n, greater<int>());
for (int i = m - 1; i < n; i += m) {
sum -= p[i];
}
cout << sum << endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <tuple>
using namespace std;
typedef long long ll;
#define REP(i,n) for (int i = 0; i < n; i++)
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
int main ()
{
int N; cin >> N;
cout << (N - 2) * 180 << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <string>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#include <climits>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
const dd PI = 3.1415926535;
class UnionFind {
std::vector<int> p;
public:
UnionFind(int n) : p(n, -1) {}
int root(int x) { return p[x] < 0 ? x : p[x] = root(p[x]); }
bool same(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (p[y] < p[x]) std::swap(x, y);
if (p[x] == p[y]) --p[x];
p[y] = x;
return true;
}
};
ll fast(ll n, ll k) {
if (k == 0) {
return 1;
}
if (k == 1) {
return n;
}
if (k % 2 == 0) {
ll tmp = fast(n, k / 2);
return tmp * tmp % MOD;
}
else {
ll tmp = fast(n, k / 2);
tmp = tmp * tmp % MOD;
return n * tmp % MOD;
}
}
int main() {
ll N;
cin >> N;
cout << 180 * (N - 2) << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
long long dp[2][3003];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<string>vst;
set<long long>st,nt,tt; map<long long,long long>mp,nq,qr; string str,ttr,ntr;
scanf("%lld %lld",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%lld %lld",&a,&b); vct.push_back(make_pair(a,b));
}
sort(vct.begin(),vct.end());
long long idx,cap;
for(idx=n-1;idx>=0;idx--)
{
for(cap=1;cap<=k;cap++)
{
fr=idx%2; sc=(idx+1)%2; a=vct[idx].first; b=vct[idx].second;
p=0; q=0;
if(idx==n-1 || cap-a<=0){ p=b; }
else{ p=b+dp[sc][cap-a]; }
if(idx!=n-1){ q=dp[sc][cap]; }
dp[fr][cap]=max(p,q);
}
}
printf("%lld\n",dp[0][k]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(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)
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A> string to_string(A v) {
bool first = true; string res = "{";
for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); }
res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H); debug_out(T...); }
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
const int N = 3005;
int n, t;
int A[N], B[N];
int dp[N][N][2];
int rec(int idx, int left, int last) {
if (idx == n) {
return 0;
}
if (left <= 0) {
return 0;
}
if (dp[idx][left][last] != -1) return dp[idx][left][last];
if (last == 1) {
if (A[idx] <= left) {
dp[idx][left][last] = max(rec(idx + 1, left - A[idx], 1) + B[idx], rec(idx + 1, left, 1));
} else {
dp[idx][left][last] = rec(idx + 1, left, 1);
}
} else {
if (A[idx] <= left) {
dp[idx][left][last] = max({rec(idx + 1, left - A[idx], 0) + B[idx], rec(idx + 1, left, 0), rec(idx + 1, left - 1, 1) + B[idx]});
} else {
dp[idx][left][last] = max(rec(idx + 1, left - 1, 1) + B[idx], rec(idx + 1, left, 0));
}
}
return dp[idx][left][last];
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> t;
REP(i, n) {
cin >> A[i];
cin >> B[i];
}
memset(dp, -1, sizeof dp);
cout << rec(0, t, 0) << "\n";
}
| 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
void b_sort(int* a , int n, int* count){
for(int i=n;i>=0;--i){
for(int j=0;j<i-1;++j){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
(*count)++;
}
}
}
}
int main(){
int n , cnt=0;
cin >> n;
int*a = new int [n];
for(int i=0;i<n ;++i){
cin >> a[i];
}
b_sort(a , n , &cnt);
for(int i=0;i<n-1 ; ++i){
cout << a[i] << " ";
}
cout << a[n-1] << endl << cnt << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int N;
int A[100];
void disp(void)
{
for (int i=0; i<N; ++i) {
cout << A[i];
if (i != (N-1)) {
cout << " ";
} else {
cout << "\n";
}
}
}
int main(void)
{
cin >> N;
for (int i=0; i<N; ++i) {
cin >> A[i];
}
int count = 0;
int flag = 1;
while (flag) {
flag = 0;
for (int j=N-1; j>=1; --j) {
if (A[j] < A[j-1]) {
swap(A[j], A[j-1]);
flag = 1;
count++;
}
}
}
disp();
cout << count << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
string alp = "zabcdefghijklmnopqrstuvwxy";
int main()
{
ll n;
cin >> n;
string ans;
while (n > 0) {
int amari = n % 26;
ans += alp[amari];
if (n % 26 == 0) {
n /= 26;
n--;
} else n /= 26;
}
reverse(ans.begin(), ans.end());
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
int main(){
long long input;
scanf("%lld",&input);
int i = 0;
char ans[100];
while(input > 0){
int temp = input % 26;
if(temp == 0){
ans[i++] = 'z';
input = (input/26) - 1;
}
else{
ans[i++] = (temp - 1) + 'a';
input = input/26;
}
}
ans[i] = '\0';
for(int j = i - 1; j >= 0; j--){
printf("%c",ans[j]);
}
return 0;
}
| 1 |
#include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 998244353
#define inf 1000000000000000000ll
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll power(ll x,ll y, ll md=MOD){ll res = 1;x%=md;while(y){if(y&1)res = (res*x)%md;x *= x; if(x>=md) x %= md; y >>= 1;}return res;}
using namespace std;
#define endl '\n'
#define int ll
int lcm(int a, int b) {
int g = __gcd(a,b);
int ans = a/g;
ans *= b;
return ans;
}
string s;
int k;
int dp[305][305][305];
int pre[305][305][305];
int pre1[305][305][305];
vector<int> v;
// int solve(int index, int out, int total) {
// if(out<0 || out>3) return 0;
// if(index==v.size()) {
// if(out==0) return 1;
// else return 0;
// }
// if(dp[index][out]!=-1) return dp[index][out];
// int ans = 0;
// // Consumer
// for(int i=0;i<=300;i++) {
// ans += solve(index+1,out+i, total);
// ans %= MOD;
// }
// // Producer
// for(int i=1;i<=v[index];i++) {
// ans += solve(index+1,out-i, total+i);
// ans %= MOD;
// }
// cout<<index<<" "<<out<<" -- "<<ans<<endl;
// return dp[index][out] = ans;
// }
signed main() {
fast;
cin>>s;
cin>>k;
int cur = 0;
int n = s.size();
k = min(k, n);
for(int i=0;i<n;i++) {
if(s[i]=='0') {v.pb(cur);cur=0;}
else cur++;
}
v.pb(cur);
for(int i=0;i<=300;i++) pre[v.size()][0][i] = 1, pre1[v.size()][0][0] = 1;
int ff = 0;
for(int i=(int)v.size()-1;i>=0;i--) {
for(int tot=k;tot>=0;tot--) {
for(int out=0;out<=300;out++) {
int ans = 0;
int sum = pre[i+1][tot][300] - ((out==0)?0:pre[i+1][tot][out-1]);
// if(i==2 && tot==0 && out==0) cout<<"$$"<<sum<<endl;
ans += sum;
ans %= MOD;
if(tot>=out) sum = ((out-(v[i]) < 0) ? pre1[i+1][tot-out][0]: pre1[i+1][tot-v[i]][out-v[i]]) - pre1[i+1][tot][out];
else sum = ((tot-(v[i]) < 0) ? pre1[i+1][0][out-tot]: pre1[i+1][tot-v[i]][out-v[i]]) - pre1[i+1][tot][out];
// if(i==2 && tot==0 && out==0) cout<<"$$"<<sum<<" "<<v[i]<<endl;
ans += sum;
ans %= MOD;
if(out!=0) {
pre[i][tot][out] = (ans + pre[i][tot][out-1])%MOD;
}
else {
pre[i][tot][out] = ans;
}
if(out!=300) {
pre1[i][tot][out] = (ans + pre1[i][tot+1][out+1])%MOD;
}
else {
pre1[i][tot][out] = ans;
}
// cout<<"#"<<i<<" "<<tot<<" "<<out<<" -- "<<ans<<endl;
if(i==0&&tot<=k&&out==0) ff += ans;
ff %= MOD;
}
}
}
ff += MOD;
ff %= MOD;
cout<<ff;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
ll dp[200][10];
ll se[10];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
se[0] = 1;
se[1] = 1;
se[2] = 2;
se[3] = 3;
se[4] = 5;
se[5] = 8;
se[6] = 13;
se[7] = 21;
int h, w, k;
cin >> h >> w >> k;
dp[0][1] = 1;
for (int i = 0; i < h; i++)
{
for (int j = 1; j <= w; j++)
{
dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * se[j - 1] % MOD * se[w - j]) % MOD;
if (j - 1 >= 1) dp[i + 1][j - 1] = (dp[i + 1][j - 1] + dp[i][j] * se[j - 2] % MOD * se[w - j]) % MOD;
if (j + 1 <= w) dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j] * se[j - 1] % MOD * se[w - j - 1]) % MOD;
}
}
cout << dp[h][k];
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| 0 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
//FILE *fi = freopen("1.txt", "r", stdin);
//FILE *fo = freopen("1", "w", stdout);
//FILE *fi = freopen("P.inp", "r", stdin);
//FILE *fo = freopen("P.out", "w", stdout);
int n, Q;
int c[500001];
typedef pair<int, int> ii;
vector<ii> q[500001];
int bit[500001];
void update(int pos, int val)
{
for (int i = pos; i <= n; i += i & -i)
bit[i] += val;
}
int Get(int pos)
{
int ans = 0;
for (int i = pos; i; i -= i & -i)
ans += bit[i];
return ans;
}
int ans[500001];
int b[500001];
int main()
{
//------------------------------
// Faster
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//------------------------------
cin >> n >> Q;
for (int i = 1; i <= n; i++)
{
cin >> c[i];
}
int id = 0;
for (int i = 1; i <= Q; i++)
{
int l, r;
++id;
cin >> l >> r;
q[r].push_back({l, id});
}
for (int i = 1; i <= n; i++)
{
int x = c[i];
if (b[x])
update(b[x], -1);
b[x] = i;
update(b[x], 1);
for (auto Q : q[i])
{
ans[Q.second] = Get(n) - Get(Q.first - 1);
}
}
for (int i = 1; i <= Q; i++)
cout << ans[i] << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define MAX 500005
//#define INF 1001001001
template <typename T>
struct RMQ {
const T INF = numeric_limits<T>::max();
int n;
vector<T> dat, lazy;
RMQ(int _n) : n(), dat(_n*4,INF), lazy(_n*4,INF) {
int x = 1;
while (x < _n) x <<= 1;
n = x;
}
void update(int i, T x) {
i += n-1;
dat[i] = x;
while (i > 0) {
i = (i-1)/2;
dat[i] = min(dat[i*2+1],dat[i*2+2]);
}
}
T query(int a, int b, int k, int l, int r) {
eval(k);
if (r <= a || b <= l) return INF;
if (a <= l && r <= b) return dat[k];
T mid = (l+r)>>1;
T vl = query(a,b,k*2+1,l,mid);
T vr = query(a,b,k*2+2,mid,r);
return min(vl,vr);
}
T query(int a, int b) { return query(a,b,0,0,n); }
void eval(int k) {
if (lazy[k] == INF) return;
if (k < n-1) lazy[k*2+1] = lazy[k*2+2] = lazy[k];
dat[k] = lazy[k];
lazy[k] = INF;
}
void update(int a, int b, int x, int k, int l, int r) {
eval(k);
if (r <= a || b <= l) return;
if (a <= l && r <= b) {
lazy[k] = x;
eval(k);
} else {
int mid = (l+r)>>1;
update(a,b,x,k*2+1,l,mid);
update(a,b,x,k*2+2,mid,r);
dat[k] = min(dat[k*2+1],dat[k*2+2]);
}
}
void update(int a, int b, int x) { update(a,b,x,0,0,n); }
inline T operator[](int a) { return query(a,a+1); }
};
int main(int, char**)
{
int n, q;
cin >> n >> q;
RMQ<int> rmq(n);
vector<int> ans;
rep(i,q) {
int command; cin >> command;
if (command == 0) {
int s, t, x;
cin >> s >> t >> x;
rmq.update(s,t+1,x);
} else if (command == 1) {
int i; cin >> i;
ans.push_back(rmq[i]);
}
}
for (auto a : ans) cout << a << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
// const ll INF = 1000000000000000000LL;
int main() {
string s;
cin >> s;
int w;
cin >> w;
rep(i,s.size()){
cout << s[i];
i+=w-1;
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
string s;
int w;
int main() {
cin >> s >> w;
for(int i=0; s[i]; i++) {
if(i%w==0) putchar(s[i]);
}
return 0;
}
| 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[210] = { 0 }, n;
int main() {
cin >> n;
int len = 2 * n, ans = 0;
for (int i = 0; i < len; i++) cin >> a[i];
sort(a, a + len);
for (int i = 0; i < len; i += 2) ans += a[i];
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>v;
int answer=0;
for(int i = 0 ; i< 2*n ;i++){
int k;
cin>>k;
v.push_back(k);
}
sort(v.begin(),v.end());
for(int i = 0 ; i < 2*n ; i+=2){
answer+=min(v.at(i),v.at(i+1));
}
cout<<answer<<endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
void chmaxs(string &s,string ref)
{
int flg = 0;
if(s == ref)return;
if(ref.size() != s.size())
{
if(ref.size() > s.size())
{
s = ref;
return;
}
else
{
return;
}
}
if(ref.size() == s.size());
{
for (int i = 0; i < s.size(); i++)
{
if(ref[i] != s[i])
{
if(ref[i] > s[i])
{
s = ref;
return;
}
else
{
return;
}
}
}
}
return;
}
void solve(void)
{
vector<int> data = {0,2,5,5,4,5,6,3,7,6};
int N,M; cin>>N; cin>>M;
vector<int> vec (M,0);
for (int i = 0; i < M; i++)
{
cin>>vec[i];
}
vector<string> DP (N+1,"");//i本のマッチを用いて作ることが可能な整数のうち最大のものを格納する。
for (int i = 1; i <= N; i++)
{
for (int j = 0; j < M; j++)
{
int fi = i - data[vec[j]];
if(fi < 0 )continue;
if(fi != 0 && DP[fi] == "")continue;
chmaxs(DP[i],DP[fi] + to_string(vec[j]));
}
}
cout<<DP[N]<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
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; }
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
ll n, m;
struct numinfo {
int digit;
int match;
int min_match;
int n;
};
vector<numinfo> nums;
bool dfs( int i, int remain_match, int remain_keta ){
if ( i == SZ(nums) ){
eprintf( "remain=%d %d ", remain_match, remain_keta );
rep(k,SZ(nums)){
eprintf( "%d ", (int)nums[k].n );
}
eprintf( "\n" );
if ( remain_match == 0 && remain_keta <= 0 )
return true;
return false;
}
for ( int k = remain_match/nums[i].match; k >= 0; k-- ){
nums[i].n = k;
int creatable_keta = (remain_match-k*nums[i].match)/nums[i].min_match;
if ( remain_keta-k-creatable_keta > 0 )
continue;
if ( dfs( i+1, remain_match-k*nums[i].match, remain_keta-k ) )
return true;
}
return false;
}
int main(){
cin >> n >> m;
vector<int> a(m);
rep(i,m){
cin >> a[i];
}
sort(a.rbegin(),a.rend());
int digit_to_match[] = { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
set<int> s;
rep(i,m){
int match = digit_to_match[a[i]];
if ( s.count(match) == 0 )
nums.push_back({a[i],match,100,0});
s.insert(match);
}
m = nums.size();
int min_match = 100;
for ( int i = nums.size()-1; i >= 0; i-- ){
nums[i].min_match = min_match;
chmin(min_match, nums[i].match);
eprintf( "digit,=%d match=%d min_match=%d\n", nums[i].digit, nums[i].match, nums[i].min_match );
}
for ( int keta = n / min_match; keta > 0; keta-- ){
eprintf( "\n\nketa=%d\n", keta );
if ( dfs( 0, n, keta ) ){
sort(nums.begin(), nums.end(), [](numinfo &l, numinfo &r){
return l.digit>r.digit;
});
rep(i,m){
rep(j,nums[i].n){
cout << nums[i].digit;
}
}
cout << endl;
return 0;
}
}
return 0;
}
| 1 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main () {
// input
string str;
cin >> str;
int q;
cin >> q;
string result = str;
int res_len = result.length();
for (int i=0; i<q; i++) {
string order;
int a, b;
cin >> order >> a >> b;
if (order == "print") {
// output
cout << result.substr(a, b-a+1) << endl;
} else if (order == "reverse") {
string reversed = "";
for (int j=0; j<a; j++) {
reversed += result[j];
}
for (int jj=b; jj>a-1; jj--) {
reversed += result[jj];
}
for (int jjj=b+1; jjj<res_len; jjj++) {
reversed += result[jjj];
}
result = reversed;
//cout << reversed << endl;
} else if (order == "replace") {
string p;
cin >> p;
string replaced = "";
for (int k=0; k<a; k++) {
replaced += result[k];
}
for (int kk=a; kk<b+1; kk++) {
replaced += p[kk-a];
}
for (int kkk=b+1; kkk<res_len; kkk++) {
replaced += result[kkk];
}
result = replaced;
//cout << result << endl;
}
}
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str1,str2,p;
char x;
int q,a,b;
getline(cin, str1);
cin >> q;
for (int i = 0; i < q; i++){
cin >> str2;
if (str2 == "replace"){
//replace?????????
cin >> a >> b >> p;
for (int j = 0; j < p.length(); j++)
str1[j + a] = p[j];
}
else if(str2 == "reverse"){
//reverse?????????
cin >> a >> b;
//a???????????????b???????????????????????????
for (int j = a; j < ((b - a) / 2)+a+1; j++){
swap(str1[j],str1[b-(j-a)]);
}
}
else if(str2=="print"){
//print?????????
cin >> a >> b;
for (int j = a; j < b+1; j++){
cout << str1[j];
}cout << endl;
}
}//??????????????????
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string ans;
if(n < 1200) ans = "ABC";
else if(n < 2800) ans = "ARC";
else ans = "AGC";
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int N = 2e5+5 ;
//😁😁😁😁😁😁😁😁😁😁😁
void Never_give_up()
{
int k; cin>>k;
string s; cin>>s;
if(s.size()<=k) cout<<s;
else
{
for(int i=0;i<k;++i) cout<<s[i];
cout<<"...";
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
Never_give_up();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> P;
int main() {
string input; cin >> input;
vector<int> a(4);
rep(i,4) a[i] = input[i]-'0';
rep(i,8) {
int sum = a[0];
string s;
s += (char)('0'+a[0]);
rep(j,3) {
if (i & (1<<j)) {
sum += a[j+1];
s += '+';
s += (char)('0'+a[j+1]);
}
else {
sum -= a[j+1];
s += '-';
s += (char)('0'+a[j+1]);
}
}
if (sum == 7) {
cout << s << "=7" << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
vector<int> vec(4);
string judge(int su, int num, string op) {
if (num == 4) {
if (su == 7 - vec[0]) {
return op;
}
else return "";
}
if (judge(su + vec[num], num + 1, op + "+") != "") {
return judge(su + vec[num], num + 1, op + "+");
}
if (judge(su - vec[num], num + 1, op + "-") != "") {
return judge(su - vec[num], num + 1, op + "-");
}
return "";
}
int main() {
char A,B,C,D; cin >> A >> B >> C >> D;
vec[0] = A - '0', vec[1] = B - '0', vec[2] = C - '0', vec[3] = D - '0';
string op = "";
string a = judge(0, 1, op);
cout << vec[0] << a[0] << vec[1] << a[1] << vec[2] << a[2] << vec[3] << "=7" << endl;
}
| 1 |
#include <iostream>
#include <string>
using namespace std;
int main( void )
{
string s;
while( 1 ){
getline( cin, s );
if( cin.eof() ) break;
while( 1 ){
for( int i=0; i<s.size(); i++ ){
if( s[i] == 'z' ) s[i] = 'a';
else if( 'a' <= s[i] && s[i] < 'z' ) s[i]++;
}
if( s.find( "the", 0 ) != string::npos ){ cout << s << endl; break; }
if( s.find( "this", 0 ) != string::npos ){ cout << s << endl; break; }
if( s.find( "that", 0 ) != string::npos ){ cout << s << endl; break; }
}
}
return 0;
}
|
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
int main()
{
string a,b;
while(getline(cin,a))
{
for(int shift=0;shift<26;shift++)
{
b="";
for(int i=0;i<a.length();i++)
{
if(a[i]>='a'&&a[i]<='z')
{
if(a[i]+shift>'z') b+=(a[i]+(shift-26));
else b+=(a[i]+shift);
}
else b+=a[i];
}
if(b.find("the")!=string::npos||b.find("this")!=string::npos||b.find("that")!=string::npos) break;
else continue;
}
cout<<b<<endl;
}
//while(1);
return 0;
}
| 1 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
string s;
cin>>s;
unordered_map<char,int>mp;
unordered_map<char,vector<pair<int,int>>>store;
int n=s.size();
int st,ed,flag=0;
for(int i=0;i<n;i++){
mp[s[i]]++;
store[s[i]].push_back({i,mp[s[i]]});
}
for(auto x:store){
if((int)x.second.size()>=2){
//cout<<x.first<<endl;
int temp_sz=0;
int cnt=0;
int i=0,j=1,sz=(int)x.second.size();
while(j<sz){
int temp;
temp_sz=x.second[j].first-x.second[i].first+1;
temp=temp_sz/2;
cnt=x.second[j].second;
if(i>0){
cnt-=x.second[i-1].second;
}
if(cnt>temp){
flag=1;
st=x.second[i].first,ed=x.second[j].first;
}
i++;
j++;
if(flag){
break;
}
}
}
if(flag){
break;
}
}
if(flag==0){
cout<<"-1 -1\n";
}
else{
cout<<st+1<<" "<<ed+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int64_t al[MAXN][26];
int main()
{
string S;
cin >> S;
for (int i = 1; i < S.size(); i++)
{
if (S[i - 1] == S[i])
{
cout << i << ' ' << i + 1 << endl;
return 0;
}
if (i != 1 && S[i - 2] == S[i])
{
cout << i - 1 << ' ' << i + 1 << endl;
return 0;
}
}
cout << -1 << ' ' << -1 << endl;
}
| 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int now = 1;
for (int i = 1; i < n; i++) {
if (i * i > n) {
break;
}
now = i * i;
}
cout << now << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
void solve()
{
string s;
cin >> s;
int k = s.size();
while (s[k - 1] != 'F')
k--;
cout << s.substr(0, k - 1) << endl;
}
int main()
{
solve();
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b; cin >> a >> b;
int ans = -INF;
ans = max(ans,a+b);
ans = max(ans,a-b);
ans = max(ans,a*b);
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue>
#include <map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldouble = long double;
//BDD,ZDD,kdtree, bdtree,bicalc, bolonoy, doloney,chinesemod,segmenttree,daikusutora, saidairyuu, 2bugurahu, heirokenshutu, topologicalsort, kyourenketuseibun
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
int 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:
cout << "ERR_ctoi" << endl;
return -1;
}
}
//最大公約数
template<typename T>
constexpr T gcd(T a, T b)
{
if (a % b == 0)
{
return(b);
}
else
{
return(gcd(b, a % b));
}
}
//最小公倍数
template<typename T>
constexpr T lcm(T a, T b)
{
return a * b / gcd(a, b);
}
int main() {
int a, b;
cin >> a >> b;
if (a <= 8 && b <= 8) {
PRI("Yay!");
}
else PRI(":(");
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1003;
int n, m, dis[N], par[N];
vector<int> adj[N], ans;
int main(int argc, char const *argv[])
{
scanf("%d %d\n", &n, &m);
for (int i = 0; i < m; ++i)
{
int u, v;
scanf("%d %d\n", &u, &v);
adj[u].push_back(v);
}
for (int s = 1; s <= n; ++s)
{
queue<int> q;
for (int i = 1; i <= n; ++i)
{
par[i] = dis[i] = -1;
}
q.push(s);
dis[s] = 0;
while (!q.empty())
{
int u = q.front();
q.pop();
for (int v: adj[u])
{
if (dis[v] == -1)
{
par[v] = u;
dis[v] = 1 + dis[u];
q.push(v);
}
else if (v == s)
{
int cur = u;
vector<int> temp;
while (cur != -1)
{
temp.push_back(cur);
cur = par[cur];
}
if (temp.size() < ans.size() || ans.empty())
{
ans.clear();
for (int node: temp)
ans.push_back(node);
}
}
}
}
}
if (ans.empty())
printf("%d\n", -1);
else
{
printf("%d\n", (int)ans.size());
for (int node: ans)
printf("%d\n", node);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, a[300][300], c[300], ans;
bool removed[300];
int main() {
cin >> n >> m;
ans = n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
--a[i][j];
}
for (int i = 0; i < m; ++i) { //iコ除外
fill(c, c + m, 0);
for (int j = 0; j < n; ++j) {
for (int k = 0; k < m; ++k) {
if (removed[a[j][k]])
continue;
++c[a[j][k]];
break;
}
}
int idx = 0;
for (int j = 0; j < m; ++j)
if (c[j] > c[idx])
idx = j;
ans = min(ans, c[idx]);
removed[idx] = 1;
}
cout << ans << endl;
}
| 0 |
#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>;
const long long INF = 1ll << 60;
int main() {
int A, B, M; cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
int minA = 100001;
int minB = 100001;
rep(i,A){
cin >> a[i];
minA = min(minA,a[i]);
}
rep(i,B){
cin >> b[i];
minB = min(minB,b[i]);
}
int ans = minA + minB;
rep(i,M){
int x,y,c; cin >> x >> y >> c;
x--;
y--;
ans = min(ans, a[x] + b[y] - c);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pi> vpi;
typedef vector<vi> vii;
typedef map<int, int> mp;
typedef multiset<int> mset;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
typedef vector<int64> vi64;
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define form(i,j,k,l) for(int i=j;i<int(k);i+=l)
#define rform(i,j,k,l) for(int i=int(j);i>int(l);i-=l)
#define rep(i, j) for(int i=0;i<int(j);i++)
#define rrep(i, j) for(int i=int(j);i>=0;i--)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define forc(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define INF (int)1e9
#define INF64 (int64)1e18
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define F first
#define S second
const double pie = acos(-1.0);
template <typename T>
T Max(T x, T y)
{
return (x > y) ? x : y;
}
template <typename T>
T Min(T x, T y)
{
return (x > y) ? y : x;
}
int gcd(int n1, int n2)
{
if (n2 != 0) return gcd(n2, n1 % n2);
else return n1;
}
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
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...);
}
#else
#define trace(...)
#endif
clock_t time_p = clock();
void rtime() { time_p = clock() - time_p; cerr << "Time Taken : " << (float)1000 * (time_p) / CLOCKS_PER_SEC << "\n";}
int64 binpow(int64 a, int64 b, int64 m) {
a %= m;
int64 res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int main()
{ fast;
int n;
long long int a, b;
cin >> n >> a >> b;
long long int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long long int ans = 0;
form(i, 1, n, 1)
{
ans = ans + Min((arr[i] - arr[i - 1]) * a, b);
}
cout << ans;
}
| 0 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
int main(){
//ios::sync_with_stdio(false);
//cin.tie(0);
int e;
while(cin>>e, e){
int ans = INF;
for(int z=0; z*z*z<=e; z++){
int sum = z*z*z;
for(int y=0; y*y+sum<=e; y++){
int x = e-y*y-sum;
ans = min(ans, x+y+z);
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end(), x) - v.begin(); }
TT void sort(T& v){ sort(v.begin(), v.end()); }
TT void revs(T& v){ reverse(v.begin(), v.end()); }
TT void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TT void show(T& v,char d=' ',char e='\n'){for(int i=0;i<v.size();++i)cout<<v[i]<<((i==v.size()-1)?e:d);}
TT void inpt(vector<T>& v,int n){ v.reserve(n);for(int i=0;i<n;++i){T x; cin>>x; v.push_back(x);} }
TT T In(){ T x; cin >> x; return x; }
static inline void fast_io(){ ios::sync_with_stdio(0); cin.tie(0); }
static inline int in(){ int x; scanf("%d", &x); return x; }
static inline string instr(){ string x; cin >> x; return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int main()
{
while (int e = in()){
int m = 1e8;
for (int z = 0; z <= 100; ++z){
for (int y = 0; y <= 1000; ++y){
int x = e - (sq(z) * z + sq(y));
if (x < 0) continue;
m = min(m, z + y + x);
}
}
printf("%d\n", m);
}
return (0);
}
| 1 |
#include <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();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
//入力
int A,B,M; cin>>A>>B>>M;
vector<int> a(A); for(int i=0;i<A;i++) cin>>a.at(i);
vector<int> b(B); for(int i=0;i<B;i++) cin>>b.at(i);
//まずは(冷蔵庫の最安値)+(レンジの最安値を求める)
int mina=100000,minb=100000;//まずはどちらも絶対にどのai,biよりも高くなるように設定する
for(int i=0;i<A;i++) mina=min(mina,a.at(i));//競プロでよく使われる手段、最小値更新
for(int i=0;i<B;i++) minb=min(minb,b.at(i));
int ans=mina+minb;//割引券なしの最小値ペアが求まった
//割引券込みのを求める
for(int i=0;i<M;i++){
int x,y,c; cin>>x>>y>>c; x--,y--;//入力、添え字調整
int sub_ans=a.at(x)+b.at(y)-c;//i番目の割引込みの値段
ans=min(ans,sub_ans);//最小値更新
}
cout<<ans<<endl;
/*
補足
for文は書きにくいのでrepに差し替えてもいい
最大値更新、最小値更新はある程度慣れたらchmin,chmaxを使った方がやりやすい、
chmax,chminについては↓の2を参照
https://qiita.com/drken/items/dc53c683d6de8aeacf5a
*/
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int sx,sy,tx,ty;
signed main()
{
sx=read(), sy=read(), tx=read(), ty=read();
for(ri int i=1;i<=tx-sx;i++) putchar('R');
for(ri int i=1;i<=ty-sy;i++) putchar('U');
for(ri int i=1;i<=tx-sx;i++) putchar('L');
for(ri int i=1;i<=ty-sy;i++) putchar('D');
putchar('D');
for(ri int i=1;i<=tx-sx+1;i++) putchar('R');
for(ri int i=1;i<=ty-sy+1;i++) putchar('U');
putchar('L');
putchar('U');
for(ri int i=1;i<=tx-sx+1;i++) putchar('L');
for(ri int i=1;i<=ty-sy+1;i++) putchar('D');
putchar('R');
puts("");
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
string s = to_string(i);
if (s[0] == s[4] && s[1] == s[3]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
/*"itob" int to "N"base */ template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if (t.is_signed) {if (v < 0) n *= -1;}while (n >= base) {ret += table[n%base];n /= base;}ret += table[n];if (t.is_signed) {if (v < 0 && base == 10) ret += '-';}reverse(ret.begin(), ret.end());return ret;}
/*"chmin" a = MAX*/ template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
/*"chmax" a = MIN*/ template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
/*"ctoi" char to int*/ int ctoi(char c) {return c-'0';}
/*"gcd" MAX Euclidean */ ll gcd(ll a,ll b){if(b==0)return a; return gcd(b,a%b);}
/*"lcm" MIN*/ ll lcm(ll a,ll b){ll g = gcd(a,b);return a/g*b;}
/*"primecheck"If prime,return true.*/bool primecheck(ll n){if(n < 2) return false;else{for(int i = 2; i * i <= n; i++){if(n % i == 0) return false;}return true;}}
string reverserange(string s,ll a,ll b){reverse(s.begin()+a-1,s.begin()+b); return s;}
ll modpow(ll a,ll n, ll mod){ll res = 1;while(n>0){if (n%2==1){res = res * a % mod;}a = a * a % mod;n/=2;}return res;}
int main() {
int a,b;
cin >> a>>b;
cout<<a*b<<endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int a, b;
cin>>a>>b;
int ans=a*b;
cout<<ans<<endl;
}
| 1 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
int N;
cin >> N;
map<int64_t, int>d;
for (int i=0; i<N; i++) {
int64_t n;
cin >> n;
if (d.count(n) > 0) {
d[n] = d[n] + 1;
} else {
d[n] = 1;
}
}
int64_t sum = 0;
for (auto c: d) {
if (c.second % 2 != 0) {
sum += 1;
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#define endl "\n"
#include "string"
int maxSubSetXor(int *a,int n) {
int ans = 0;
int id = 0;
for(int i = 61; i >= 0; i--) {
int maxid = -1, maxi = -1;
for(int j = id; j < n; j++) {
if( a[j] & (1ll << i) && a[j] > maxi) {
maxi = a[j];
maxid = j;
}
}
if(maxid == -1)
continue;
swap(a[maxid] , a[id]);
for(int j = 0; j < n; j++) {
if(j != id && a[j] & (1ll << i) )
a[j] ^= maxi;
}
id++;
}
for(int i = 0; i < n; i++)
ans ^= a[i];
return ans;
}
int32_t main() {
int n;
cin >> n;
int a[n] , xr = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
xr ^= a[i];
}
for(int i = 0; i < n; i++)
a[i] &= ~xr;
int ans = maxSubSetXor(a, n);
ans = 2 * ans + xr;
cout << ans << endl;
}
| 0 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<queue>
#include <cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<ctime>
#define rep(i,n) for (int i=0;i<n;i++)
//#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,N,ans=0;
cin>>H>>W>>N;
if (H>W) cout<<(N-1)/H+1<<endl;
else cout<<(N-1)/W+1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool f(int a, int b, int c) {
return ( a == b && a != c ?
true : false);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (f(a, b, c) || f(c, a, b) || f(b, c, a) ?
"Yes" : "No");
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
string t;
string ans;
void dfs(int i,string s,int n);
void solve();
int main(void){
cin >> t;
solve();
return 0;
}
void dfs(int i, string s, int n){
if(i==3){
if(n==7){
ans=s+"=7";
}
return ;
}
dfs(i+1,s + "+" + t[i + 1],n + (t[i + 1] - '0'));
dfs(i+1,s + "-" + t[i + 1],n - (t[i + 1] - '0'));
}
void solve(){
dfs(0,t.substr(0,1),t[0]-'0');
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional> // std::function<void(int)>
using namespace std;
#define int long long
#define All(v) (v).begin(),(v).end()
int dy[4] = {-1,0,1,0};
int dx[4] = {0,1,0,-1};
int Dy[8] = {-1,-1,0,1,1,1,0,-1};
int Dx[8] = {0,1,1,1,0,-1,-1,-1};
const int mod = 1000000007;
const int inf = mod*mod;
const int d5 = 111111;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin>>a;
cout<<180*(a-2)<<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define rev(v) reverse(all(v))
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define mapmax(v) v.rbegin()->first
#define mapmin(v) v.begin()->first
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define SIZE(s) (int)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;
const double pi = acos(-1.0);
const int mod=1000000007;
const int mod2=998244353;
template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
ost << "{" << p.first << ", " << p.second << "} ";
return ost;
}
template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
ost << "{";
for (int i = 0; i<(int)v.size(); i++) {
if (i)ost << " ";
ost << v[i];
}
ost << "} \n";
return ost;
}
template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
ost << "{";
for (auto p:v) {
ost << "{" << p.first << ", " << p.second << "} ";
}
ost << "} ";
return ost;
}
template<class T>
inline bool chmax(T& a, T b){if(a<b){a=b;return true;} return false;}
template<class T>
inline bool chmin(T& a, T b){if(a>b){a=b;return true;} return false;}
void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}
ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll gcd(ll x, ll y) {return __gcd(x,y);}
ll lcm(ll x, ll y) {return x/__gcd(x,y)*y;}
struct UnionFind {
vector<long long> par;
UnionFind(long long size):par(size+1,-1){}
bool unite(long long x,long long y){ //集合の連結
x=root(x);
y=root(y);
if (x!=y){
if(par[y]<par[x]) swap(x,y);
par[x]+=par[y];
par[y]=x;
}
return x!=y;
}
bool same(long long x,long long y){ //同集合内かの判定
return root(x)==root(y);
}
int root(long long x){ //根を求める
return par[x]<0?x:par[x]=root(par[x]);
}
int size(long long x){ //集合の大きさ
return -par[root(x)];
}
};
int main()
{
ll n,k,l,a,b;
cin >> n >> k >> l;
vll ar(n),br(n);
UnionFind x(n),y(n);
rep(i,k){
cin >> a >> b;
a--;
b--;
x.unite(a,b);
}
rep(i,l){
cin >> a >> b;
a--;
b--;
y.unite(a,b);
}
rep(i,n){
ar[i]=x.root(i);
br[i]=y.root(i);
}
map<pll,ll> m;
rep(i,n) m[m_p(ar[i],br[i])]++;
rep(i,n) cout << m[m_p(ar[i],br[i])] << (i==n-1?"\n":" ");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, m; cin >> n >> m;
vector<ll> p(n, 0);
ll xmin = 1, xmax = n;
for(ll i=0; i<m; ++i){
ll l, r; cin >> l >> r;
xmin = max(xmin, l);
xmax = min(xmax, r);
}
ll res = max((ll)0, xmax-xmin+1);
cout << res << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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;}
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 1000000009;
const double pi = acos(-1);
int dist_sum(int N) {
int ans = 0;
while(N > 0) {
ans += N%10;
N /= 10;
}
return ans;
}
int main() {
int N; cin >> N;
cout << (N%dist_sum(N) == 0 ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main () {
ll x; cin >> x; ll ans = (x / 11) * 2, b = x % 11;
if (b > 6) ans += 2;
else if (b > 0) ans++;
cout << ans << endl;
}
| 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
#define fs first
#define sc second
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll a,b,m;
cin >> a >> b >> m;
vector<ll> A(a);
vector<ll> B(b);
cins(all(A));
cins(all(B));
ll ma = *min_element(all(A));
ll mb = *min_element(all(B));
ll ans = ma + mb;
rep(i, m){
ll x,y,c;
cin >> x >> y >> c;
--x, --y;
chmin(ans, A[x] + B[y] - c);
}
print(ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define poly vector<ll>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
inline ll read(){
ll x=0;char ch=getchar();bool d=1;
for(;!isdigit(ch);ch=getchar()) if(ch=='-') d=0;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return d?x:-x;
}
inline void write(ll x){
if(x<0) x=-x,putchar('-');
if(x>=10) write(x/10);
putchar('0'+x%10);
}
inline void writeln(ll x){write(x);puts("");}
inline void writep(ll x){write(x);putchar(' ');}
inline ull rnd(){
return ((ull)rand()<<30^rand())<<4|rand()%4;
}
const int N=20,M=(1<<15)+5;
ll f[M][N],g[M];
vector<pii> v[N];
void upd(ll &x,ll y){
x=max(x,y);
}
int main(){
int n=read(),m=read();ll tot=0;
For(i,1,m){
int x=read(),y=read(),z=read();tot+=z;
v[x].pb(mp(y,z));v[y].pb(mp(x,z));
}
int st=(1<<n)-1;
For(s,0,st){
For(i,1,n) if(!(s>>(i-1)&1)){
if(!g[s|(1<<(i-1))]){
g[s|(1<<(i-1))]=g[s];
for(auto x:v[i]){
if(s>>(x.fi-1)&1){
g[s|(1<<(i-1))]+=x.se;
}
}
}
}
}
memset(f,-1,sizeof(f));
f[1][1]=0;
For(s,1,st){
For(i,1,n) if(s>>(i-1)&1){
if(f[s][i]==-1) continue;
for(auto x:v[i]){
if(!(s>>(x.fi-1)&1)){
upd(f[s|(1<<(x.fi-1))][x.fi],f[s][i]+x.se);
}
}
int ss=(st^s)|(1<<(i-1));
for(int t=ss;t;t=(t-1)&ss){
if(t>>(i-1)&1){
upd(f[s|t][i],f[s][i]+g[t]);
}
}
}
}
cout<<tot-f[st][n];
}
| 0 |
//
// main.cpp
// usaco
//
// Created by 김현수 on 2020/08/30.
// Copyright © 2020 김현수. All rights reserved.
//
#include <iostream>
#include <algorithm>
#include <string>
int main()
{
int a, b, c, d, e, k;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &k);
if(e-a<=k)
{
printf("Yay!");
}
else if(e-a>k)
{
printf(":(");
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n';
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b << endl;
}
| 0 |
#include<iostream>
using namespace std;
int InsertionSort(int* a, int n, int g)
{
int tmp, j, count = 0;
for (int i = g; i < n; i++)
{
tmp = a[i];
for (j = i - g; j >= 0 && a[j] > tmp; j -= g)
{
a[j + g] = a[j];
count++;
}
a[j + g] = tmp;
}
return count;
}
int ShellSort(int* a, int n)
{
int m, g[100],count = 0;
for (m = 1; m * m * m <= n; m++)
continue;
m--;
cout << m << endl;
for (int i = 0; i < m; i++)
{
g[i] = (m - i) * (m - i);
if (i)
cout << " ";
cout << g[i];
}
for (int i = 0; i < m; i++)
count += InsertionSort(a, n, g[i]);
return count;
}
int main()
{
int n, a[1000000], count;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
count = ShellSort(a, n);
cout << endl << count << endl;
for (int i = 0; i < n; i++)
cout << a[i] << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
namespace util {
template<typename T >
void print_vector(vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
cout << *it;
if (it + 1 != v.end())
cout << " ";
}
cout << endl;
}
}
namespace {
void insertion_sort(vector<int> &a, int g, int &count) {
for (int i = g; i < a.size(); i++) {
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v) {
a[j+g] = a[j];
j = j - g;
count++;
}
a[j+g] = v;
}
}
vector<int> shell_sort(vector<int> &a, int &count) {
vector<int> gs;
int g = 1;
while (a.size() >= g) {
gs.push_back(g);
g = 3 * g + 1;
}
reverse(gs.begin(), gs.end());
for (int _g : gs) {
insertion_sort(a, _g, count);
}
return gs;
}
}
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int in;
cin >> in;
v.push_back(in);
}
int count = 0;
vector<int> gs = shell_sort(v, count);
cout << gs.size() << endl;
util::print_vector(gs);
cout << count << endl;
for(int i : v) {
cout << i << endl;
}
return 0;
}
| 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
vector<pll> prime_factorize(ll N) {
vector<pll> res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1) res.push_back({N, 1});
return res;
}
const int MAX = 210000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAX; i++){
fac[i] = fac[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if(n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}
int main() {
ll n, m;
COMinit();
cin >> n >> m;
vector<pll> vc = prime_factorize(m);
ll ans = 1;
for(int i=0; i<vc.size(); i++){
ll num = COM(vc[i].second + n - 1, n-1);
//cout << "num:" << num << " vc[i]:" << vc[i].first << " " << vc[i].second << ln;
ans = (ans * num)% MOD;
}
cout << ans % MOD << ln;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
constexpr auto INF = INT_MAX/2;
constexpr auto LINF = 5000000000000000;
constexpr auto MOD = 1000000007;
ll fac[120020], invfac[120020];
ll lpow(ll p, ll q) {
ll ans = 1;
ll pp = p;
while (q) {
if (q % 2) {
ans *= pp;
ans %= MOD;
}
q /= 2;
pp *= pp;
pp %= MOD;
}
return ans;
}
ll com(ll n, ll r) {
if (n < r || n < 0 || r < 0)return 0;
ll ans = 1;
ll k = n - r;
ans *= fac[n] * invfac[r];
ans %= MOD;
ans *= invfac[k];
ans %= MOD;
return ans;
}
void precom(int n) {
rep(i, n + 1) {
if (i == 0)fac[i] = 1;
else fac[i] = (fac[i - 1] * i) % MOD;
invfac[i] = lpow(fac[i], MOD - 2);
}
return;
}
int s[100020];
vi prime(0);
int main() {
ll n, m;
cin >> n >> m;
if (m == 1 || n == 1) { cout << 1 << endl;return 0;
}
rep(i, 100020)s[i] = 1;
rep1(i, 100000) {
if (i < 2)continue;
if (s[i] != 1)continue;
prime.push_back(i);
s[i] = i;
int ii = i;
while (ii <= 100000) {
if (s[ii] == 1)s[ii] = i;
ii += i;
}
}
precom(120000);
vi mp(0);
int mm = m;
int k = 0;
while (mm>1&&k<prime.size()) {
if (mm % prime[k])k++;
else { mm /= prime[k];mp.push_back(prime[k]); }
}
if(mm>1)mp.push_back(mm);
k = 1;
ll ans = 1;
rep(i, mp.size() - 1) {
if (mp[i + 1] == mp[i])k++;
else {
ans *= com(n - 1 + k, k);
ans %= MOD;
k = 1;
}
}
ans *= com(n - 1 + k, k);
ans %= MOD;
cout << ans << endl;
}
| 1 |
//
// main.c
// ITP1_6_A
//
// Created by ??±??°?????? on 2015/10/11.
// Copyright ?? 2015??´ HamadaShogo. All rights reserved.
//
#include <stdio.h>
void reverseNum(int *num, int size);
int main(int argc, const char * argv[]) {
int size;
int num[100];
int i;
scanf("%d", &size);
for (i=0; i<size; i++) {
scanf("%d", &num[i]);
}
reverseNum(num, size);
return 0;
}
void reverseNum(int *num, int size){
int i;
for (i=0; i<size; i++) {
printf("%d", num[size-i-1]);
if (!(i == size-1)) {
printf(" ");
}
}
puts("");
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >> x;
reverse(a.begin(), a.end());
for (int i = 0; i < n; i++) cout << a[i] << (i == n - 1 ? '\n' : ' ');
}
| 1 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b){if (a < b) { a = b; return true; } return false;}
template<class T> inline bool chmin(T& a, T b){if (a > b) { a = b; return true; } return false;}
ll INF = 1e+18;
int iINF = 1e9;
int MAXI = 1e8 + 1;
using vec = vector<int>;
int
main()
{
int N; cin >> N;
vec arr(N + 1);
repe(i, 1, N) cin >> arr[i];
vec ball(N + 1, 0);
int num = 0;
for(int i = N; i >= 1; --i){
int val = i;
int cnt = 0;
while(true){
val += i;
if(val > N) break;
if(ball[val] == 1) ++cnt;
}
if(arr[i] != (cnt % 2)) ball[i] = 1, ++num;
}
cout << num << endl;
rep(i, 1, N + 1){
if(ball[i] == 1) cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int INF = 1000 * 1000 * 1000;
const int N = 100;
int n;
int c[N][N];
int d[N];
bool used[N];
int prim() {
int i, res = 0;
for (i=0; i<n; i++) {
d[i] = INF;
used[i] = false;
}
d[0] = 0;
while (1) {
int v = -1;
for (i=0; i<n; i++)
if (!used[i] && (v==-1 || (v>=0 && d[i]<d[v])))
v = i;
if (v==-1) break;
used[v] = true;
res += d[v];
for (i=0; i<n; i++)
d[i] = min(d[i], c[v][i]);
}
return res;
}
int main() {
int i, j;
scanf("%d ", &n);
for (i=0; i<n; i++)
for (j=0; j<n; j++) {
scanf("%d ", &(c[i][j]));
if (c[i][j]==-1) c[i][j] = INF;
}
printf("%d\n", prim());
return 0;
}
| 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int n, sm = 0;
cin >> n;
if(n >= 500){
sm += n / 500 * 1000;
n = n % 500;
}
if(n >= 5){
sm += n / 5 * 5;
}
cout << sm << "\n";
}
|
#include <iostream>
int main()
{
int d;
while (std::cin >> d) {
int n = 0, s = 0;
while (n < 600) {
s += n * n * d;
n += d;
}
std::cout << s << std::endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, M;
cin >> N;
string s[N];
rep(i,N) cin >> s[i];
cin >> M;
string t[M];
rep(i,M) cin >> t[i];
sort(s,s+N);
int ans = 0;
int u = 1;
string c = s[0];
for (int i=1; i<N; i++){
if (s[i] == c) u++;
else {
int d = 0;
rep(j,M) if (t[j] == c) d++;
ans = max(ans, u-d);
u = 1;
c = s[i];
}
if (i == N-1) {
int d = 0;
rep(j,M) if (t[j] == c) d++;
ans = max(ans, u-d);
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i=0; i<N; i++) {
cin >> s;
if (S.count(s)) S.at(s) += 1;
else S[s] = 1;
}
int M;
cin >> M;
for (int i=0; i<M; i++) {
cin >> s;
if (S.count(s)) S.at(s) -= 1;
}
using pis = pair<int, string>;
priority_queue<pis> cnt;
for (auto x : S) { // 要素はキーと値のpair
cnt.push(pair(x.second, x.first));
}
if (cnt.top().first < 0) cout << 0 << endl;
else cout << cnt.top().first << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define rep(i,begin,end) for(__typeof(end)i=(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
#define F first
#define S second
#define sz(x) ((int)x.size())
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mod 1000000007
#define mod2 998244353
#define what_is(x) cerr << #x << " is " << x <<"\n";
#define sortA(v) sort(v.begin(), v.end())
#define sortD(v) sort(v.rbegin(), v.rend())
#define PI 3.14159265358979323846
#define vout(a) for(auto x:a) cout<<x<<" ";
#define INF 1000000000000
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
// using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
using vii = vector<pii>;
using mi = multiset<int>;
using mii = multiset<pii>;
int lcm(int a,int b) {return (a*(b/__gcd(a,b)));}
void solve()
{
int n,m,t,i,l,k,r,u,v,w,j,s,sum=0,pos,flag=0,count=0;
string S,T,U;
// int x,y,a,b,c;
cin>>n>>m>>k;
set<int> a;
a.insert(n);
a.insert(m);
a.insert(k);
if(sz(a)==2) cout<<"Yes";
else cout<<"No";
}
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
int T=0;
while(t--)
{
T++;
// if(T>1) cout<<"\n";
// cout<<"Case #"<<T<<": ";
solve();
if(t)cout<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
bool poor = false;
cin >> a;
cin >> b;
cin >> c;
if (a == b == c) {
poor = false;
} else {
if (a == b && a != c) {
poor = true;
} else {
if (a == c && a != b) {
poor = true;
} else {
if (b == c && b != a) {
poor = true;
} else {
if (b == a && b != c) {
poor = true;
} else {
if (c == a && c != b) {
poor = true;
} else {
if (c == b && c != a) {
poor = true;
} else {
poor = false;
}
}
}
}
}
}
}
if (poor == true) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
bool g[101][101];
int main(){
int m,n;
cin>>m>>n;
cout<<"100 100"<<endl;
for(int i=0;i<50;i++)
for(int j=0;j<100;j++)
g[i][j]=1;
m--;
for(int i=0;i<50;i+=2)
for(int j=0;j<100;j+=2){
if(m==0)
break;
g[i][j]=0;
m--;
}
n--;
for(int i=99;i>=50;i-=2)
for(int j=0;j<100;j+=2){
if(n==0)
break;
g[i][j]=1;
n--;
}
for(int i=0;i<100;i++){
for(int j=0;j<100;j++)
if(g[i][j]) cout<<"#";
else
cout<<".";
cout<<endl;
}
}
|
/**
* created: 28.06.2020 02:21:50
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
using namespace std;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b; return 1;} return 0;}
const int mod = 1000000007;
const long double pi = acos(-1.0);
const int inf = 1LL << 60;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int a, b;
cin >> a >> b;
int mx = max(a,b);
if (mx*2 <= 16) cout << "Yay!" << endl;
else cout << ":(" << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//---------------------------------------------------------------------------------------------------
ll MOD = 998244353;
ll f[101010], rf[101010];
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1) res = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
for(int i = 1; i < 101010; i++) f[i] = (f[i - 1] * i) % MOD;
for(int i = 0; i < 101010; i++) rf[i] = inv(f[i]);
}
ll C(int n, int k) {
if(n < k) return 0;
ll a = f[n]; // = n!
ll b = rf[n-k]; // = (n-k)!
ll c = rf[k]; // = k!
ll bc = (b * c) % MOD;
return (a * bc) % MOD;
}
ll H(int k, int n)
{
return C(n+k-1, k-1);
}
//---------------------------------------------------------------------------------------------------
int main()
{
init();
int k, n;
cin >> k >> n;
for(int i = 2; i <= 2 * k; i++)
{
ll ans = 0;
int num;
if(i <= k+1)
{
num = i/2;
}
else
{
num = (2*k-i+2)/2;
}
for(int j = 0; j <= num; j++)
{
ll tmp = 0;
if(i % 2 != 0)
{
tmp = H(k, n-2*j) * C(num, j);
}
else
{
tmp = (H(k-1, n-2*j) * C(num-1, j) + H(k-1, n-2*j-1) * C(num-1, j)) % MOD;
}
if(j % 2 != 0)
{
ans = (ans - tmp + MOD) % MOD;
}
else
{
ans = (ans + tmp + MOD) % MOD;
}
}
cout << ans << endl;
}
}
|
////sfef
#include<stdio.h>
int main(){
int k,x,i,p,q,r;
scanf("%d %d",&k,&x);
p=(x-(k-1));
q=(x+(k-2));
r=(x+(k-1));
if(k==1)
{
printf("%d",x);
}
else{
for(i=p;i<=q;i++)
{
printf("%d ",i);
}
printf("%d",r);
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define solve(a) ((a)?"Yes":"No")
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
ll mod=998244353LL;
long long modpow(long long a, long long n, long long mod=(1LL<<62)){
long long res = 1;
while (n > 0){
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
const int MAX = 510000;
const ll MOD = 998244353LL;
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){ // 二項係数:nCk計算
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(){
int n,m,k;
COMinit();
ll ans=0LL;
cin >>n>>m>>k;
for(int i=0;i<=k;i++){
ans+=m*modpow(m-1,n-1-i,mod)%mod*COM(n-1,i)%mod;
ans%mod;
// clog<<ans<<endl;
}
cout<<ans%mod<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
struct Combination{
vector<ll> fac,finv,inv;
Combination(int mx){init(mx);}
void init(int mx){
fac.resize(mx+1);
finv.resize(mx+1);
inv.resize(mx+1);
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2;i<=mx;i++){
fac[i]=fac[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
finv[i]=finv[i-1]*inv[i]%MOD;
}
}
ll calc(int n,int k){
return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}
};
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1)res=res*x%MOD;
x=x*x%MOD;
n>>=1;
}
return res;
}
int main(){
int n,a,b,c,d;
cin>>n>>a>>b>>c>>d;
ll dp[n+1]={};
dp[0]=1;
Combination comb(n);
for(int j=a;j<=b;j++){
for(int i=n;i>=1;i--){
for(int k=c;k<=i/j&&k<=d;k++){
ll ce=comb.calc(n-(i-k*j),k*j)*comb.fac[k*j];
ce%=MOD;
ce*=comb.finv[k];
ce%=MOD;
ce*=modpow(comb.finv[j],k);
ce%=MOD;
dp[i]+=dp[i-k*j]*ce;
dp[i]%=MOD;
}
}
}
cout<<dp[n]<<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define poly vector<ll>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
ll x=0;char ch=gc();bool positive=1;
for(;!isdigit(ch);ch=gc()) if(ch=='-') positive=0;
for(;isdigit(ch);ch=gc()) x=x*10+ch-'0';
return positive?x:-x;
}
inline void write(ll x){
if(x<0){
x=-x;putchar('-');
}
if(x>=10) write(x/10);
putchar('0'+x%10);
}
inline void writeln(ll x){write(x);puts("");}
inline void writep(ll x){write(x);putchar(' ');}
inline ull rnd(){
return ((ull)rand()<<30^rand())<<4|rand()%4;
}
const int N=1e5+5;
int a[N],nxt[65][N];
ll id[N];
int main(){
int n=read();
For(i,1,n) a[i]=read(),id[i]=i;
int m=read();ll k=read();
For(i,1,m){
int x=read();
swap(id[x],id[x+1]);
}
For(i,1,n) nxt[0][i]=id[i];
For(i,1,63){
For(j,1,n) nxt[i][j]=nxt[i-1][nxt[i-1][j]];
}
For(i,1,n){
id[i]=i;
Rep(j,63,0) if(k>>j&1) id[i]=nxt[j][id[i]];
id[i]=a[id[i]]-a[id[i]-1];
}
For(i,1,n){
id[i]+=id[i-1];
printf("%lld.0\n",id[i]);
}
}
|
#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;
int p[100] = {0};
int rank[100] = {0};
cin >> n;
for(int i=0; i<n * (n - 1) / 2; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--; b--;
if( c > d ) p[a] += 3;
if( c < d ) p[b] += 3;
if( c == d ) { p[a]++; p[b]++; }
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
if( i != j ) {
if( p[i] < p[j] ) rank[i]++;
}
}
}
for(int i=0; i<n; i++) {
cout << rank[i]+1 << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
long long ans = 0;
for(int i = 1; i <= n; i++) {
if(i % 3 != 0 && i % 5 != 0)
ans += i;
}
cout << ans << "\n";
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
long long N;
cin >> N;
long long c = N*(N+1)/2;
long long j = N / 3;
long long k = N / 5;
long long l = N / 15;
c = c - 3*j*(j+1)/2 - 5*k*(k+1)/2 + 15*l*(l+1)/2;
cout << c;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int A,B;
cin>>A>>B;
if(A<9&&B<9){
cout<<"Yay!"<<endl;
}
else{
cout<<":("<<endl;
}
}
|
//#include "stdafx.h"
#include<bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int a,b,ans,q;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>a>>b;
q=abs(a-b);
ans=16-(a+b);
if(q>ans/2)
cout<<":(\n";
else
cout<<"Yay!\n";
return 0;
}
| 1 |
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <queue>
#include <climits>
using namespace std;
typedef pair<int,int> p;
int d[100003];
vector<p>edge[100002];
int main()
{
priority_queue<p,vector<p>,greater<p> > que;
int v,e,r;
int s,t,d0;
cin>>v>>e>>r;
for(int i=0;i<100002;i++){d[i]=INT_MAX;}
for(int i=0;i<e;i++){
scanf("%d%d%d",&s,&t,&d0);
edge[s].push_back(p(t,d0));}
que.push(p(0,r));
d[r]=0;
while(!que.empty()){
p cur=que.top();
que.pop();
if(d[cur.second]<cur.first)continue;
for(int i=0;i<edge[cur.second].size();i++){
p to=edge[cur.second][i];
if(d[to.first]>=d[cur.second]+to.second){
d[to.first]=d[cur.second]+to.second;
que.push(p(d[to.first],to.first));}
}
}
for(int i=0;i<v;i++){
if(d[i]==INT_MAX)cout<<"INF"<<endl;
else
cout<<d[i]<<endl; }
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<vector>
using namespace std;
struct graph{
int h[360010],nex[27000010],to[27000010],col[360010],M;
bool v[360010];
graph(){
M=0;
memset(h,0,sizeof(h));
memset(v,0,sizeof(v));
memset(col,0,sizeof(col));
}
void ins(int a,int b){
M++;
to[M]=b;
nex[M]=h[a];
h[a]=M;
}
void add(int a,int b){
ins(a,b);
ins(b,a);
}
void dfs(int x,int c){
col[x]=c;
v[x]=1;
int i,j;
for(i=h[x];i;i=nex[i]){
if(!v[to[i]]){
v[to[i]]=1;
for(j=h[to[i]];j;j=nex[j]){
if(!v[to[j]])dfs(to[j],c);
}
}
}
}
}g[2];
int n;
int p(int i,int j){return i*2*n+j+1;}
bool sq(int x){
double d=sqrt(x);
return fabs(d-round(d))<1e-6;
}
void build(int f,int x,int y){
if(y>=2*n)return;
int i,j;
for(i=0;i+x<2*n;i++){
for(j=0;j+y<2*n;j++)g[f].add(p(i,j),p(i+x,j+y));
}
for(i=0;i+x<2*n;i++){
for(j=2*n-1;j-y>=0;j--)g[f].add(p(i,j),p(i+x,j-y));
}
}
struct pr{
int x,y;
pr(int a=0,int b=0){x=a;y=b;}
};
vector<pr>v[4];
int main(){
int i,j,d1,d2;
scanf("%d%d%d",&n,&d1,&d2);
for(i=0;i<2*n&&i*i<=d1;i++){
if(sq(d1-i*i))build(0,i,round(sqrt(d1-i*i)));
}
for(i=0;i<2*n&&i*i<=d2;i++){
if(sq(d2-i*i))build(1,i,round(sqrt(d2-i*i)));
}
for(i=1;i<=4*n*n;i++){
if(!g[0].v[i])g[0].dfs(i,1);
if(!g[1].v[i])g[1].dfs(i,2);
}
for(i=0;i<2*n;i++){
for(j=0;j<2*n;j++)v[g[0].col[p(i,j)]|g[1].col[p(i,j)]].push_back(pr(i,j));
}
for(i=0;i<4;i++){
if((int)v[i].size()>=n*n){
for(j=0;j<n*n;j++)printf("%d %d\n",v[i][j].x,v[i][j].y);
break;
}
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool flag = (s.size()%2 == 0);
while(s.size()>0 && flag){
if(s.substr(0,2) == "hi"){
s = s.substr(2,s.size()-2);
}
else flag = 0;
}
cout << (flag?"Yes":"No") << endl;
}
|
#include <bits/stdc++.h>
int main()
{std::string S, t; std::cin >> S;
int i{5}; while(i--) {t += "hi"; if (t == S) {puts("Yes"); return 0;}}
puts("No");}
| 1 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>
using namespace std;
typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
struct Edge{int to,from,cost;};
#ifdef DEBUG
#define debug cout
#else
stringstream __ss__;
#define debug __ss__
#endif
template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) debug << *i << " "; debug << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }
#define rep(i,n) for(int i=0;i<(n);++i)
#define repd(i,n) for(int i=(n)-1;i>=0;--i)
#define repn(i,m,n) for(int i=(m);i<=(n);++i)
#define repnd(i,m,n) for(int i=(n);i>=(m);--i)
#define rep0(i,n) for(i=0;i<(n);++i)
#define repd0(i,n) for(i=(n)-1;i>=0;--i)
#define repn0(i,m,n) for(i=(m);i<=(n);++i)
#define repnd0(i,m,n) for(i=(n);i>=(m);--i)
#define all(n) n.begin(),n.end()
#define sz(n) ((int)(n).size())
#define IL for(;;)
#define MP make_pair
#define PB push_back
#define SS stringstream
#define X second
#define Y first
#define PUTLINE debug<<"LINE:"<<__LINE__<<endl;
const int INF = 2147483647/3;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int dx[]={1,-1,0,0,1,-1,1,-1,0};
const int dy[]={0,0,1,-1,1,-1,-1,1,0};
int main() {
string s;
cin>>s;
char now='a';
int res=0;
int count[3]={};
rep(i,sz(s)){
//debug<<i<<" "<<count[0]<<" "<<count[1]<<" "<<count[2]<<endl;
if(s[i]=='J'){
if(now=='J'){
++count[0];
}else if(now=='O'){
count[0]=1;
count[1]=0;
count[2]=0;
}else{
if(count[0]>=count[1]&&count[1]<=count[2])chmax(res,min(min(count[0],count[1]),count[2]));
count[0]=1;
count[1]=0;
count[2]=0;
}
}else if(s[i]=='O'){
if(now!='I'){
++count[1];
}else{
if(count[0]>=count[1]&&count[1]<=count[2])chmax(res,min(min(count[0],count[1]),count[2]));
count[0]=0;
count[1]=1;
count[2]=0;
}
}else{
if(now!='J'){
++count[2];
}else{
count[0]=0;
count[1]=0;
count[2]=1;
}
}
now=s[i];
}
if(count[0]>=count[1]&&count[1]<=count[2])chmax(res,min(min(count[0],count[1]),count[2]));
cout<<res<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
string str;
int ans = 0;
int n1, n2, n3;
cin>>str;
for (int i = 0; i < str.length(); ++i) {
n1 = n2 = n3 = 0;
while (str[i] == 'J') {
n1++;
i++;
}
while (str[i] == 'O') {
n2++;
i++;
}
while (str[i] == 'I') {
n3++;
i++;
}
if(n2 <= n1 && n2 <= n3) ans = max(ans, n2);
i--;
}
cout<<ans<<endl;
return 0;
}
| 1 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
typedef long long ll;
int main()
{
long long a,b=0;
cin>>a;
for(int i=1;i<=a;i++)
{
if(i%3==0||i%5==0);
else b=b+i;
}
cout<<b;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
}
return ret;
}
ll mod(ll val) {
ll res = val % MOD;
if(res < 0) {
res += MOD;
}
return res;
}
ll RS(ll N, ll P, ll M){
if(P==0) return 1;
if(P%2==0){
ll t = RS(N, P/2, M);
return t*t % M;
}
return N * RS(N, P-1, M) % M;
}
int main() {
int N;
cin >> N;
if(N == 2) {
cout << -1 << endl;
return 0;
}
vector<vector<char>> three = {
{'a','a','b'},
{'b','.','b'},
{'b','a','a'}
};
vector<vector<char>> four = {
{'a','a','c','a'},
{'b','b','c','a'},
{'a','e','d','d'},
{'a','e','c','c'},
};
vector<vector<char>> five = {
{'a','a','b','b','c'},
{'b','.','.','a','c'},
{'b','.','.','a','b'},
{'a','b','b','.','b'},
{'a','c','c','a','a'},
};
vector<vector<char>> seven = {
{'.','a','a','b','b','c','.'},
{'d','d','.','.','.','c','e'},
{'f','.','.','.','a','.','e'},
{'f','.','.','.','a','.','f'},
{'h','.','a','a','.','.','f'},
{'h','g','.','.','.','a','a'},
{'.','g','a','a','b','b','.'},
};
if(N == 3) {
for(int i = 0;i < 3;i++) {
for(int j = 0;j < 3;j++) {
cout << three.at(i).at(j);
}
cout << endl;
}
return 0;
}
else if(N == 6) {
vector<vector<char>> ret(N,vector<char>(N,'.'));
for(int i = 0;i < 2;i++) {
for(int j = 0;j < 3;j++) {
for(int k = 0;k < 3;k++) {
ret.at(3 * i + j).at(3 * i + k) = three.at(j).at(k);
}
}
}
for(int i = 0;i < N;i++) {
for(int j = 0;j < N;j++) {
cout << ret.at(i).at(j);
}
cout << endl;
}
return 0;
}
int Four = 0;
int Five = 0;
int Seven = 0;
for(int i = 0;i <= 400;i++) {
for(int j = 0;j <= 400;j++) {
for(int k = 0;k <= 400;k++) {
if(i * 4 + j * 5 + k * 7 == N) {
Four = i;
Five = j;
Seven = k;
break;
}
}
}
}
vector<vector<char>> ret(N,vector<char>(N,'.'));
int cnt = 0;
for(int i = 0;i < Four;i++) {
for(int j = 0;j < 4;j++) {
for(int k = 0;k < 4;k++) {
ret.at(cnt + j).at(cnt + k) = four.at(j).at(k);
}
}
cnt += 4;
}
for(int i = 0;i < Five;i++) {
for(int j = 0;j < 5;j++) {
for(int k = 0;k < 5;k++) {
ret.at(cnt + j).at(cnt + k) = five.at(j).at(k);
}
}
cnt += 5;
}
for(int i = 0;i < Seven;i++) {
for(int j = 0;j < 7;j++) {
for(int k = 0;k < 7;k++) {
ret.at(cnt + j).at(cnt + k) = seven.at(j).at(k);
}
}
cnt += 7;
}
for(int i = 0;i < N;i++) {
for(int j = 0;j < N;j++) {
cout << ret.at(i).at(j);
}
cout << endl;
}
}
| 0 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, M, bx, x, by, y, XCount = 0, YCount = 0;
const long long MOD = 1e9 + 7;
cin >> N >> M >> bx;
for (int i = 1; i < N; i++) {
cin >> x;
XCount += i * (N - i) * (x - bx);
XCount = XCount % MOD;
bx = x;
}
cin >> by;
for (int i = 1; i < M; i++) {
cin >> y;
YCount += i * (M - i) * (y - by);
YCount = YCount % MOD;
by = y;
}
cout << (XCount * YCount) % MOD;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){
if(y<h && y>=0 && x<w && x>=0) return true;
return false;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;cin >> n >> m;
vector<ll> x(n), y(m);
rep(i,n) cin >> x.at(i);
rep(i,m) cin >> y.at(i);
ll ans = 0, sum = 0;
rep(i,n){
ans += x.at(i) * i - x.at(i) * (n - i - 1);
ans %= mod;
}
rep(i,m){
sum += y.at(i) * i - y.at(i) * (m - i - 1);
sum %= mod;
}
cout << ans * sum % mod << endl;
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int a,b=0;
cin>>a;
if(a%3==0 && a>0){
b=(a/3)+b;
}
else if(a%3==1 && a>1){
a-=4;
b++;
b=(a/3)+b;
}
else if(a%3==2 && a>2){
a-=5;
b++;
b=(a/3)+b;
}
else{
system("pause");
}
cout<<b;
}
|
#include <iostream>
#include <bits/c++io.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main()
{
int x;
cin>>x;
cout<<x/3<<endl;
}
| 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<pair<ll, ll>> p(n);
for (int i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
p[i] = {a, b};
}
sort(p.begin(), p.end(), [](pair<ll, ll> p1, pair<ll, ll> p2) {
return p1.first + p1.second > p2.first + p2.second;
});
ll result = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
result += p[i].first;
} else {
result -= p[i].second;
}
}
cout << result << endl;
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void getint(_T& a) {
std::cin >> a;
}
template<class _T> static void getint(_T& a, _T& b) {
std::cin >> a >> b;
}
template<class _T> static void getint(_T& a, _T& b, _T& c) {
std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
if (a < (_T)0) {
a *= (_T)-1;
}
return a;
}
static void exec();
int main()
{
exec();
fflush(stdout);
return 0;
}
static void exec()
{
int N;
getint(N);
std::vector<std::pair<LLONG, LLONG>> plates(N);
for (int i = 0; i < N; i++) {
getint(plates[i].first, plates[i].second);
}
std::sort(plates.begin(), plates.end(),
[](const std::pair<LLONG, LLONG>& a, const std::pair<LLONG, LLONG>& b) {
return (a.first + a.second) > (b.first + b.second);
});
bool tkhs = true;
std::vector<std::pair<LLONG, LLONG>> tk, ao;
for (int i = 0; i < N; i++) {
if (tkhs) {
tk.push_back(plates[i]);
tkhs = false;
}
else {
ao.push_back(plates[i]);
tkhs = true;
}
}
LLONG tkSum = 0;
for (auto it = tk.begin(); it != tk.end(); it++) {
tkSum += it->first;
}
LLONG aoSum = 0;
for (auto it = ao.begin(); it != ao.end(); it++) {
aoSum += it->second;
}
printf("%lld\n", tkSum - aoSum);
}
| 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,k;
cin>>n>>k;
vector<ld> p(n),a(n-k+1);
ld ans=0;
rep(i,n){
cin>>p[i];
p[i]=(1+p[i])/2;
if(i-k<0) a[0]+=p[i];
else{
a[i-k+1]=a[i-k]-p[i-k]+p[i];
ans=max(ans,a[i-k]);
}
}
ans=max(ans,a[n-k]);
cout<<fixed<<setprecision(10)<<ans;
}
|
#include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef pair<i64,int> pli;
typedef pair<int,i64> pil;
typedef pair<i64,i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
template <typename T>
T id(T b) {return b;};
template <class It>
bool all(It f,It l){return std::all_of(f,l,id<bool>);}
template <class It>
bool any(It f,It l){return std::any_of(f,l,id<bool>);}
template <int N> class rmq {
int n; i64 dat[4*N-1];
i64 query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) return INF;
if (a <= l && r <= b) return dat[k];
else {
return min(query(a,b,2*k+1,l,(l+r)/2),query(a,b,2*k+2,(l+r)/2,r));
}
}
public:
const i64 INF = INT64_MAX;
rmq() {
n = 1;
while (n < N) n *= 2;
for (int i = 0; i < 2*n-1; i++) dat[i] = INF;
}
void update(int k, i64 a) {
k += n-1; dat[k] = a;
while (k > 0) {
k = (k-1) / 2;
dat[k] = min(dat[2*k+1],dat[2*k+2]);
}
}
i64 query(int a, int b) { return query(a, b, 0, 0, n); }
};
struct union_find {
typedef vector<int> vi;
vi parent,rank,cnt;
int n;
union_find(int n) : n(n) {
parent = vi(n); rank = vi(n,0); cnt = vi(n,1);
for (int i = 0; i < n; i++) parent[i] = i;
}
int find(int a) {
if (parent[a] == a) return a;
return parent[a] = find(parent[a]);
}
void unite(int a, int b) {
a = find(a); b = find(b);
if (a == b) return;
if (rank[a] < rank[b]) {
parent[a] = b; cnt[b] += cnt[a];
} else {
parent[b] = a; cnt[a] = cnt[b];
if (rank[a] == rank[b])
rank[a]++;
}
}
int count(int a) { return cnt[find(a)]; }
bool same(int a, int b) { return find(a) == find(b); }
};
typedef tuple<i64,int,int> edge;
const int MAX_N = 200000;
int n;
i64 d, a[MAX_N];
pii b[MAX_N];
int tab[MAX_N];
rmq<MAX_N> r1, r2;
map<i64,int> m;
int main()
{
cin >> n >> d;
for (int i = 0; i < n; i++) cin >> a[i], b[i] = mp(a[i],i);
sort(b,b+n);
for (int i = 0; i < n; i++) tab[b[i].second] = i;
vector<edge> es;
r1.update(tab[0], a[0]-d);
m[a[0]-d] = 0;
for (int i = 1; i < n; i++) {
i64 v = r1.query(0,tab[i]);
if (v < r1.INF) {
int j = m[v];
es.push_back(make_tuple(v+a[i]+(i+1)*d,i,j));
}
v = a[i]-(i+1)*d;
r1.update(tab[i], v);
m[v] = i;
}
m.clear();
r2.update(tab[n-1], a[n-1]+n*d);
m[a[n-1]+n*d] = n-1;
for (int i = n-2; i >= 0; i--) {
i64 v = r2.query(0,tab[i]);
if (v < r2.INF) {
int j = m[v];
es.push_back(make_tuple(v+a[i]-(i+1)*d,i,j));
}
v = a[i]+(i+1)*d;
r2.update(tab[i], v);
m[v] = i;
}
sort(es.begin(),es.end());
union_find uf(n);
i64 res = 0;
for (auto e : es) {
i64 cost; int u,v;
tie(cost,u,v) = e;
if (uf.same(u,v)) continue;
res += cost;
uf.unite(u,v);
}
cout << res << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << endl;
}
|
#include <bits/stdc++.h>
const int N = 100054;
int n, K, ans;
int p[N], fc[N], nc[N], f[N];
inline void up(int &x, const int y) {x < y ? x = y : 0;}
inline void link(int x, int px) {nc[x] = fc[px], fc[px] = x;}
void dfs(int x, int dep = 0) {
for (int y = fc[x]; y; y = nc[y]) dfs(y, dep + 1), up(f[x], f[y] + 1);
if (dep > 1 && f[x] >= K - 1) ++ans, f[x] = -1;
}
int main() {
scanf("%d%d%d", &n, &K, &ans), ans = ans != 1;
for (int i = 2; i <= n; ++i) scanf("%d", p + i), link(i, p[i]);
dfs(1), printf("%d\n", ans);
return 0;
}
| 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
if(s == "SUN"){
cout << "7\n";
return 0;
}
if(s == "MON"){
cout << "6\n";
return 0;
}
if(s == "TUE"){
cout << "5\n";
return 0;
}
if(s == "WED"){
cout << "4\n";
return 0;
}
if(s == "THU"){
cout << "3\n";
return 0;
}
if(s == "FRI"){
cout << "2\n";
return 0;
}
if(s == "SAT"){
cout << "1\n";
return 0;
}
}
|
#include<iostream>
using namespace std;
class dice {
private:
int n[7];
public:
dice(int, int, int, int, int, int);
int getcur() { return n[1]; }
void rotate(char);
};
dice::dice(int n1, int n2, int n3, int n4, int n5, int n6) {
n[1] = n1;
n[2] = n2;
n[3] = n3;
n[4] = n4;
n[5] = n5;
n[6] = n6;
}
void dice::rotate(char op) {
dice copy(n[1], n[2], n[3], n[4], n[5], n[6]);
switch (op) {
case'W':
n[1] = copy.n[3];
n[3] = copy.n[6];
n[6] = copy.n[4];
n[4] = copy.n[1];
break;
case'E':
n[1] = copy.n[4];
n[3] = copy.n[1];
n[6] = copy.n[3];
n[4] = copy.n[6];
break;
case'S':
n[1] = copy.n[5];
n[2] = copy.n[1];
n[6] = copy.n[2];
n[5] = copy.n[6];
break;
case'N':
n[1] = copy.n[2];
n[2] = copy.n[6];
n[6] = copy.n[5];
n[5] = copy.n[1];
break;
}
}
int main() {
int n[7];
for (int i = 1; i <= 6; i++) {
cin >> n[i];
}
dice a(n[1], n[2], n[3], n[4], n[5], n[6]);
char op;
while (cin >> op) {
a.rotate(op);
//cerr << a.getcur() << endl;
}
cout << a.getcur() << endl;
return 0;
}
| 0 |
#include <iostream>
#include <deque>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#define llint long long
#define mod 998244353
#define inf 1e18
using namespace std;
typedef pair<llint, llint> P;
typedef pair<llint, P> E;
struct SegTree{
int size;
vector<P> seg;
SegTree(){}
SegTree(int size){
this->size = size;
seg.resize(1<<(size+1));
}
void init()
{
for(int i = 0; i < (1<<(size+1)); i++) seg[i] = P(inf, inf);
}
void update(int i, P val)
{
i += (1 << size);
seg[i] = val;
while(i > 1){
i /= 2;
seg[i] = min(seg[i*2], seg[i*2+1]);
}
}
P query(int a, int b, int k, int l, int r)
{
if(b < l || r < a) return P(inf, inf);
if(a <= l && r <= b) return seg[k];
P lval = query(a, b, k*2, l, (l+r)/2);
P rval = query(a, b, k*2+1, (l+r)/2+1, r);
return min(lval, rval);
}
P query(int a, int b)
{
if(a > b) return P(inf, inf);
return query(a, b, 1, 0, (1<<size)-1);
}
};
struct UnionFind{
int size;
vector<int> parent;
UnionFind(){}
UnionFind(int size){
this->size = size;
parent.resize(size+1);
init();
}
void init(){
for(int i = 0; i <= size; i++) parent[i] = i;
}
int root(int i){
if(parent[i] == i) return i;
return parent[i] = root(parent[i]);
}
bool same(int i, int j){
return root(i) == root(j);
}
void unite(int i, int j){
int root_i = root(i), root_j = root(j);
if(root_i == root_j) return;
parent[root_i] = root_j;
}
};
llint n, d;
llint a[200005];
SegTree lseg(18), rseg(18);
vector<P> vec;
vector<E> evec;
UnionFind uf(200005);
int main(void)
{
cin >> n >> d;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= n; i++) vec.push_back(P(a[i], i));
sort(vec.begin(), vec.end());
lseg.init(), rseg.init();
for(int i = 0; i < vec.size(); i++){
int p = vec[i].second;
P res = lseg.query(1, p-1);
if(res.first < inf/2) evec.push_back(E(res.first+p*d+a[p], P(p, res.second)));
res = rseg.query(p+1, n);
if(res.first < inf/2) evec.push_back(E(res.first-p*d+a[p], P(p, res.second)));
lseg.update(p, P(a[p]-p*d, p));
rseg.update(p, P(a[p]+p*d, p));
}
sort(evec.begin(), evec.end());
llint ans = 0;
for(int i = 0; i < evec.size(); i++){
llint u = evec[i].second.first, v = evec[i].second.second, w = evec[i].first;
if(uf.same(u, v)) continue;
ans += w;
uf.unite(u, v);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin >> N >> T;
vector<int> time(N);
for(int i = 0; i < N; i++){
cin >> time.at(i);
}
long long ans, sum = T;
for(int i = 0; i < N-1; i++){
ans = min(T,time.at(i+1)-time.at(i));
sum += ans;
}
cout << sum << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
short N;
ll ans = 0;
string L, R, b, r;
map<pair<string, string>, int> M;
void aff(vector<bool>&vec, short i) {
if (i == N) {
for (short j = 0;j < N;j++) {
if (vec[j])b.push_back(L[j]);
else r.push_back(L[j]);
}
b += 'B';
r += 'R';
if (M.find({ b,r }) != M.end()) {
M.at({ b,r })++;
}
else {
M.insert({ {b,r},1 });
}
b = "";
r = "";
return;
}
aff(vec, i + 1);
vec[i] = 1;
aff(vec, i + 1);
vec[i] = 0;
return;
}
void aff2(vector<bool>&vec, short i) {
if (i == N) {
for (short j = 0;j < N;j++) {
if (vec[j])b.push_back(R[j]);
else r.push_back(R[j]);
}
b += 'B';
r += 'R';
if (M.find({ b, r }) != M.end()) {
ans += (ll)M.at({ b,r });
//cout << b << " " << r << endl;
//cout << ans << endl;
}
b = "";
r = "";
return;
}
aff2(vec, i + 1);
vec[i] = 1;
aff2(vec, i + 1);
vec[i] = 0;
return;
}
int main(){
cin >> N;
string S;
cin >> S;
for (short i = 0;i < N;i++) {
L += S[i];
}
for (short i = 0;i < N;i++) {
R += S[i + N];
}
reverse(R.begin(), R.end());
vector<bool> vec(N, false);
aff(vec, 0);
aff2(vec, 0);
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
//template <typename... T> void read(T& ... t){ ((cin >> t), ...); }
//template <typename... T> void write(T ... t){ ((cout << t), ...); }
//#define int long long
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define size(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define ln '\n'
#define space ' '
using LL = long long;
using pii = pair<int,int>;
const int INF = 2e9;
const int NN = 2e3;
const int MOD = 998244353;
namespace Mm{
inline int mul(const LL &x, const LL &y) { return (x*y)%MOD; }
inline int add(const LL &x, const LL &y) { return (x+y)%MOD; }
inline int power(const LL &x, const LL &n){ if(n == 0) return 1; int y=power(x, n>>1); y=mul(y,y); return (n&1)?mul(y,x):y; }
inline int inv(const LL &x){ return power(x, MOD-2); }
// int _fact[2*NN] = {0};
// inline int fact(const int &x){ return (x==0 ? 1 : (_fact[x]!=0 ? _fact[x] : _fact[x]=mul(x, fact(x-1)))); }
// inline int cnk(const int &n, const int &k){ return (n<k)?0:mul(fact(n),inv(mul(fact(k),fact(n-k)))); }
int _cnk[2*NN+1][2*NN+1] = {0};
inline int cnk(const int &n, const int &k){ return (n<k)?0:(k==0)?1:(_cnk[n][k]!=0?_cnk[n][k]:_cnk[n][k]=add(cnk(n-1,k),cnk(n-1,k-1))); }
} using namespace Mm;
int n,k;
int dp[NN+1][NN+1];
int nbPairs[2*NN+1];
#define read(a,b) cin>>a>>b
#define write(a,b) cout<<a<<b
int32_t main(){ FAST;
read(k,n);
dp[0][0] = 1;
for(int i=1; i<=NN; ++i){ // #pairs
int prefSum = 0;
for(int j=0; j<=NN; ++j){ // #items to distribute on pairs
dp[i][j] = add(dp[i-1][j], add(prefSum, prefSum)); // k € [1;j]
prefSum = add(prefSum, dp[i-1][j]);
}
}
for(int i=1; i<=k; ++i) for(int j=i+1; j<=k; ++j) ++nbPairs[i+j];
for(int i=2; i<=2*k; ++i){
int ans = 0;
int others = k - 2*nbPairs[i];
if(i&1){
if(others == 0){
ans = dp[nbPairs[i]][n];
write(ans, ln);
continue;
}
for(int giveOthers=0; giveOthers<=n; ++giveOthers){
int givePairs = n-giveOthers;
ans = add(ans, mul(dp[nbPairs[i]][givePairs], cnk(others+giveOthers-1, giveOthers)));
}
}
else{
--others;
if(others == 0){
ans = add(dp[nbPairs[i]][n], dp[nbPairs[i]][n-1]);
write(ans, ln);
continue;
}
for(int giveOthers=0; giveOthers<=n; ++giveOthers){
int givePairs = n-giveOthers;
ans = add(ans, mul(dp[nbPairs[i]][givePairs], cnk(others+giveOthers-1, giveOthers)));
}
for(int giveOthers=0; giveOthers<=n-1; ++giveOthers){
int givePairs = n-1-giveOthers;
ans = add(ans, mul(dp[nbPairs[i]][givePairs], cnk(others+giveOthers-1, giveOthers)));
}
}
write(ans, ln);
}
}
| 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
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 Graph = vector<vector<int>>;
typedef pair<int, int> P;
string ABCD;
bool isEnd = false;
void dfs(int total, string signs, int index){
if (isEnd) return;
if(index == 4){
if (total == 7){
string ans = "";
ans += ABCD[0];
for (int i = 0; i < 3; i++){
ans += signs[i];
ans += ABCD[i+1];
}
cout << ans+"=7" << endl;
isEnd = true;
}
return;
}
dfs(total+(ABCD[index]-'0'), signs+"+", index+1);
dfs(total-(ABCD[index]-'0'), signs+"-", index+1);
}
int main(){
cin >> ABCD;
dfs(ABCD[0]-'0', "", 1);
}
|
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int arr[200001];
int main()
{
int N;
cin >> N;
int temp;
int i;
int m = 0;
ll sum = 0;
for(i = 0; i < N; i++)
{
cin >> temp;
arr[i] = temp;
m = max(m,arr[i]);
sum += m-arr[i];
}
for(i = N-1; i >= 0; i--)
{
}
cout << sum;
}
| 0 |
#include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a > 8 || b > 8) cout << ":(";
else cout << "Yay!";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
int W;
cin >> S >> W;
for(int i=0;i<S.size();i+=W){
cout << S.at(i);
}
cout << endl;
}
| 0 |
#include<iostream>
#define INF 2 << 23
using namespace std;
int main(){
int n,m;
while(cin >> n >> m){
if(n==0&&m==0) break;
int cost[m+1][m+1];
int time[m+1][m+1];
for(int i=0;i<=m;i++)
for(int j=0;j<=m;j++){
if(i==j)
cost[i][j] = time[i][j] = 0;
else
cost[i][j] = time[i][j] = INF;
}
for(int i=0;i<n;i++){
int a,b;
cin >> a >> b;
cin >> cost[a][b] >> time[a][b];
cost[b][a] = cost[a][b]; time[b][a] = time[a][b];
}
for (int i = 1; i <= m; i++) // ?????±????????????
for (int j = 1; j <= m; j++) // ????§???????
for (int k = 1; k <= m; k++){ // ??????
cost[j][k] = min(cost[j][k], cost[j][i] + cost[i][k]);
time[j][k] = min(time[j][k], time[j][i] + time[i][k]);
}
int k;
cin >> k;
int p,q,r;
for(int i=0;i<k;i++){
cin >> p >> q >> r;
switch(r){
case 0: cout << cost[p][q] << endl; break;
case 1: cout << time[p][q] << endl; break;
default: break;
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c) for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define mp make_pair
#define pb push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }
#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9
const int MAX_N = 10;
int n;
int a[MAX_N+1][MAX_N+1];
int main()
{
while((cin >> n) && n){
rep(i, n+1) rep(j, n+1) a[i][j] = 0;
rep(i, n) rep(j, n) cin >> a[i][j];
rep(i, n) rep(j, n) a[n][j] += a[i][j];
rep(i, n+1) rep(j, n) a[i][n] += a[i][j];
rep(i, n+1) rep(j, n+1) printf("%5d%s", a[i][j], (j==n ? "\n" : ""));
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define simplify ios_base::sync_with_stdio(0);cin.tie(0);
#define int long long
#define endl "\n"
using namespace std;
const int mod=998244353;
const int N=2e5+5;
int fact[N];
int invFact[N];
int inverseMod(int x,int mod);
void precompute(){
fact[0]=fact[1]=1;
for(int i=2;i<N;i++){
fact[i]=fact[i-1]*i;
fact[i]%=mod;
}
invFact[N-1]=inverseMod(fact[N-1],mod);
for(int i=N-2;i>=0;i--){
invFact[i]=invFact[i+1]*(i+1);
invFact[i]%=mod;
}
}
int NCR(int n,int r){
if(r>n)return 0;
int num=fact[n];
num*=invFact[r];
num%=mod;
num*=invFact[n-r];
num%=mod;
return num;
}
int power(int x,int n,int mod){
//(x^n)%mod
int result=1;
while(n){
if(n%2)
result=(result*x)%mod;
x=(x*x)%mod;
n/=2;
}
return result;
}
int inverseMod(int x,int mod){
return power(x,mod-2,mod);
}
int32_t main(){
simplify
int n,m,k;
cin>>n>>m>>k;
precompute();
int ans=0;
int other;
for(int i=0;i<=k;i++){
other=m*power(m-1,n-1-i,mod);
other%=mod;
other=other*NCR(n-1,i);
other%=mod;
ans+=other;
ans%=mod;
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0;i<(n);i++)
typedef long long ll;
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res = res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod);
}
int main() {
ll N,M,K,ans;
cin>>N>>M>>K;
ll mod = 998244353;
ll kakuk = M*modpow(M-1,N-1,mod)%mod;
ans = kakuk;
ll gyakuM = modinv(M-1,mod);
rep(i,K){
kakuk = (kakuk * (N-i-1))%mod;
kakuk = (kakuk * modinv(i+1,mod))%mod;
kakuk = (kakuk * gyakuM)%mod;
ans += kakuk;
ans = ans%mod;
}
if(M==1&&N-1==K) cout << 1 << endl;
else cout << ans << endl;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N, x;
cin >> N >> x;
vector<ll> a(N);
rep(i,N) cin >> a.at(i);
ll ans = 0;
rep(i,N) {
if (i == 0) continue;
if(a.at(i) + a.at(i-1) > x) {
ll diff = a.at(i) + a.at(i-1) - x;
ans += diff;
if (diff <= a.at(i)) a.at(i) -= diff;
else a.at(i) = 0;
}
}
cout << ans << endl;
}
|
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n,x,a;
while(~scanf("%d%d%d",&n,&x,&a)){
ll ans=0;
if(a>x)
ans+=a-x,a=x;
while(--n){
int b;
scanf("%d",&b);
if(a+b>x)
ans+=a+b-x,a=x-a;
else
a=b;
}
printf("%lld\n",ans);
}
return 0;
}
| 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<utility>
#include<cmath>
#include<assert.h>
#include<set>
#include<map>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
map<pii, vector<pair<pii, int>>> G;
map<pii, int> d;
set<int> company[100100];//company[i]:=駅iを通る会社
int N, M;
void dijkstra() {
priority_queue<pair<int, pii>, vector<pair<int, pii>>, greater<pair<int, pii>>> que;
d[pii(0, -1)] = 0;
que.push(make_pair(0, pii(0, -1)));
while (!que.empty()) {
pair<int, pii> p = que.top();
que.pop();
pii v = p.second;
if (d.count(v) && d[v] < p.first)continue;
rep(i, G[v].size()) {
pair<pii, int> edge = G[v][i];
if (!d.count(edge.first) || d[edge.first] > d[v] + edge.second) {
d[edge.first] = d[v] + edge.second;
que.push(make_pair(d[edge.first], edge.first));
}
}
}
}
signed main() {
cin >> N >> M;
rep(i, M) {
int p, q, c;
cin >> p >> q >> c;
p--;
q--;
G[pii(p, c)].push_back(make_pair(pii(q, c), 0));
G[pii(q, c)].push_back(make_pair(pii(p, c), 0));
company[p].insert(c);
company[q].insert(c);
}
rep(i, N) {
for (int c:company[i]) {
G[pii(i, c)].push_back(make_pair(pii(i, -1), 0));
G[pii(i, -1)].push_back(make_pair(pii(i, c), 1));
}
}
dijkstra();
if (d.count(pii(N - 1, -1)))
cout << d[pii(N - 1, -1)] << endl;
else cout << -1 << endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#define INF 1<<30-1
using namespace std;
int n;
int c[101][101];
int t[101][101];
int flg;
int washa(int st,int en,int va){
if(flg==1){
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(c[i][j]>c[i][k]+c[k][j]){
c[i][j]=c[i][k]+c[k][j];
}
if(t[i][j]>t[i][k]+t[k][j]){
t[i][j]=t[i][k]+t[k][j];
}
}
}
}
flg=0;
}
if(va==0){
return c[st][en];
}else{
return t[st][en];
}
}
int main(){
while(1){
int m;
for(int i=0;i<101;i++){
for(int j=0;j<101;j++){
c[i][j]=t[i][j]=INF;
}
}
flg=1;
scanf("%d%d",&m,&n);
if(m==0 && n==0){
break;
}
for(int i=0;i<m;i++){
int a,z,s,x;
scanf("%d%d%d%d",&a,&z,&s,&x);
c[a][z]=c[z][a]=s;
t[a][z]=t[z][a]=x;
}
scanf("%d",&m);
for(int i=0;i<m;i++){
int a,z,s;
scanf("%d%d%d",&a,&z,&s);
printf("%d\n",washa(a,z,s));
}
}
}
| 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
// 多倍長
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
// 指定した文字cが文字列に何文字入ってるか
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
// 割り算の切り上げ処理
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
// 桁和
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
// 回文判定
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int ng[500];
int dp[500];
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n,m;
cin >> n >> m;
vector<ll> a(n);
vector<ll> s(n + 1);
map<ll, ll> mp;
rep(i, n) {
cin >> a[i];
s[i + 1] = s[i] + a[i];
}
rep(i, n + 1) mp[s[i] % m]++;
ll ans = 0;
for(auto num : mp){
ans += num.sc * (num.sc - 1) / 2;
}
print(ans);
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int f(int x,int y){
if(y<10)return x*10+y;
return x*100+y;
}
int main(){
while(1){
int n,k,c[100],ans=1;
vector<int> sum;
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
for(int i=0;i<n;i++)scanf("%d",&c[i]);
int a=0;
for(int i=0;i<n;i++){
int a0=c[i];
for(int j=0;j<n;j++){
if(j!=i){
int a1=f(a0,c[j]);
if(k==2)sum.push_back(a1);
else {
for(int l=0;l<n;l++){
if(l!=j&&l!=i){
int a2=f(a1,c[l]);
if(k==3)sum.push_back(a2);
else{
for(int m=0;m<n;m++){
if(m!=l&&m!=j&&m!=i){
int a3=f(a2,c[m]);
sum.push_back(a3);
}
}
}
}
}
}
}
}
}
sort(sum.begin(),sum.end());
int s=sum.size();
for(int i=1;i<s;i++){
if(sum[i]!=sum[i-1])ans++;
}
printf("%d\n",ans);
}
}
| 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define inf 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) num = num * 10 + (ch & 15);
if(neg) num = -num;
}
int N, M, A[1005], B[1005];
ll ans = 1;
int main(){
getint(N), getint(M);
for(register int i = 1; i <= N; i++) getint(A[i]);
for(register int i = 1; i <= M; i++) getint(B[i]);
sort(A + 1, A + N + 1), sort(B + 1, B + M + 1), A[N + 1] = B[M + 1] = inf;
for(register int i = 1; i < N; i++) if(A[i] == A[i + 1]) return puts("0"), 0;
for(register int i = 1; i < M; i++) if(B[i] == B[i + 1]) return puts("0"), 0;
for(register int i = 1, j = 1, k = 1; i <= N * M; i++){
while(j <= N && A[j] < i) j++;
while(k <= M && B[k] < i) k++;
if(A[j] == i && B[k] != i) ans = ans * (M - k + 1) % MOD;
else if(A[j] != i && B[k] == i) ans = ans * (N - j + 1) % MOD;
else if(A[j] != i && B[k] != i) ans = ans * ((M - k + 1) * (N - j + 1) - (N * M - i)) % MOD;
}
return printf("%lld\n", ans), 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int INF=1<<30;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int main(){
int n,m;cin >> n >> m;
vector<int> a(n),b(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(RALL(a));
for (int i = 0; i < m; i++) {
cin >> b[i];
}
sort(RALL(b));
LL h=0,w=0;
LL ans = 1, res = 0;
for (int i = n*m; i >= 1; i--) {
if(h < n && i == a[h] && w < m && i == b[w]){
h++;
w++;
res += h + w - 2;
}
else if(h < n && i == a[h]){
if(w==0) ans = 0;
h++;
res += w - 1;
ans = ans * w % mod;
}
else if(w < m && i == b[w]){
if(h==0) ans = 0;
w++;
res += h - 1;
ans = ans * h % mod;
}
else{
if(res <= 0) ans = 0;
ans = ans * res % mod;
res--;
}
}
cout << ans << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int p[1000005];
int getSum(int* BIT,int idx){
int sum=0;
while(idx>0){
sum+=BIT[idx];
idx-=(idx&-idx);
}
return sum;
}
void update(int* BIT,int N,int idx,int val){
while(idx<=N){
BIT[idx]+=val;
idx+=(idx&-idx);
}
return;
}
int main() {
memset(p,0,sizeof(p));
int N,i;
scanf("%d",&N);
int Q;
scanf("%d",&Q);
int A[N+1];
for(i=1;i<=N;i++)
scanf("%d",&A[i]);
int *BIT=new int[N+1];
for(i=0;i<=N;i++)
BIT[i]=0;
vector<pair<int,pair<int,int> > > queries(Q);
for(i=0;i<Q;i++){
scanf("%d %d",&queries[i].second.first,&queries[i].first);
queries[i].second.second=i;
}
vector<int> ans(Q,0);
sort(queries.begin(),queries.end());
int j=0;
for(i=1;i<=N;i++){
if(p[A[i]]>0)
update(BIT,N,p[A[i]],-1);
p[A[i]]=i;
update(BIT,N,i,1);
while(j<Q&&queries[j].first==i){
ans[queries[j].second.second]=getSum(BIT,i)-getSum(BIT,queries[j].second.first-1);
++j;
}
if(j==Q)
break;
}
for(int i=0;i<Q;i++)
printf("%d\n",ans[i]);
// your code goes here
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#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 llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
int main(){
while(1){
llong n, m;
scanf("%lld%lld", &n, &m);
if(n==0) return 0;
vector<llong> v(n);
REP(i, n){
scanf("%lld", &v[i]);
}
v.push_back(0);
n++;
vector<llong> a;
REP(i, n){
REP(j, n){
a.push_back(v[i]+v[j]);
}
}
VSORT(a);
llong ans=0;
REP(i, n){
REP(j, n){
llong tmp=v[i]+v[j];
llong k=upper_bound(a.begin(), a.end(), m-tmp)-a.begin();
if(k==a.size()) continue;
k--;
if(k>=0) ans=max(ans, tmp+a[k]);
}
}
printf("%lld\n", ans);
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> G;
vector<int> indeg; // 入次数
vector<bool> visited;
vector<int> ans; // トポロジカルソートの結果
void bfs(int s) {
queue<int> q;
q.push(s);
visited.at(s) = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int nx : G.at(cur)) {
indeg.at(nx)--;
if (indeg.at(nx) == 0 && !visited.at(nx)) {
q.push(nx);
ans.at(nx) = cur + 1;
}
}
}
}
int main() {
cin >> N >> M;
G.resize(N);
for (int i = 0; i < N-1+M; i++) {
int a, b; cin >> a >> b;
a--; b--;
G.at(a).push_back(b);
}
indeg.resize(N);
visited.resize(N);
ans.resize(N);
for (int i = 0; i < N; i++) {
for (int e : G.at(i)) {
indeg.at(e)++;
}
}
for (int i = 0; i < N; i++) {
if (indeg.at(i) == 0 && !visited.at(i)) bfs(i);
}
for (int v : ans) cout << v << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void dfs(vector<vector<int>> &g, vector<bool> &used, int v, vector<int> &ans) {
used[v] = true;
for(int nv: g[v]) {
if(!used[nv]) {
dfs(g, used, nv, ans);
}
}
ans.push_back(v);
}
int main(){
ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
vector<vector<int>> to(n);
vector<vector<int>> from(n);
rep(i,n-1+m) {
int a,b;
cin >> a >> b;
a--;b--;
to[a].push_back(b);
from[b].push_back(a);
}
vector<bool> used(n, false);
vector<int> topo_sort(0);
rep(v,n) {
if(!used[v]) dfs(to, used, v, topo_sort);
}
vector<int> inv_topo(n);
rep(i,n) {
inv_topo[topo_sort[i]] = i;
}
rep(i,n) {
if(from[i].size() == 0) {
cout << 0 << endl;
continue;
}
int ans = from[i][0];
for(int v :from[i]) {
if(inv_topo[v] < inv_topo[ans]) {
ans = v;
}
}
cout << ans+1 << endl;
}
}
| 1 |
#include<stdio.h>
int num[4];
int main()
{
int n,d1,d2;
scanf("%d%d%d",&n,&d1,&d2);
int num1=0,num2=0;
while((d1&1)==0)
{
num1++;
d1>>=1;
}
while((d2&1)==0)
{
num2++;
d2>>=1;
}
for(int i=0;i<(n<<1);i++)
{
for(int j=0;j<(n<<1);j++)
{
int tp1,tp2;
if(num1&1)
{
tp1=((i>>(num1>>1))&1);
}
else
{
tp1=(((i>>(num1>>1))+(j>>(num1>>1)))&1);
}
if(num2&1)
{
tp2=((i>>(num2>>1))&1);
}
else
{
tp2=(((i>>(num2>>1))+(j>>(num2>>1)))&1);
}
num[tp1+tp1+tp2]++;
}
}
int wz;
for(wz=0;wz<4;wz++)
{
if(num[wz]>=n*n)
{
break;
}
}
int rm=n*n;
for(int i=0;i<(n<<1);i++)
{
for(int j=0;j<(n<<1);j++)
{
int tp1,tp2;
if(num1&1)
{
tp1=((i>>(num1>>1))&1);
}
else
{
tp1=(((i>>(num1>>1))+(j>>(num1>>1)))&1);
}
if(num2&1)
{
tp2=((i>>(num2>>1))&1);
}
else
{
tp2=(((i>>(num2>>1))+(j>>(num2>>1)))&1);
}
if(tp1+tp1+tp2==wz)
{
printf("%d %d\n",i,j);
rm--;
if(rm==0)
{
return 0;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define reg register
#define pr std::pair<int, int>
#define fi first
#define se second
#define FIN(s) freopen(s, "r", stdin)
#define FOUT(s) freopen(s, "w", stdout)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define lep(i, l, r) for (int i = l; i < r; ++i)
#define irep(i, r, l) for (int i = r; i >= l; --i)
#define ilep(i, r, l) for (int i = r; i > l; --i)
#define Rep(i, n) rep(i, 1, n)
#define Lep(i, n) lep(i, 1, n)
#define IRep(i, n) irep(i, n, 1)
#define ILep(i, n) ilep(i, n, 1)
typedef long long ll;
typedef long double ld;
namespace modular {
const int MOD = 1000000007;
inline int add(int x, int y) { return (x += y) >= MOD ? x -= MOD : x; }
inline void inc(int &x, int y) { (x += y) >= MOD ? x -= MOD : 0; }
inline int mul(int x, int y) { return 1LL * x * y % MOD; }
inline int qpow(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = mul(x, x))
if (y & 1) ans = mul(ans, x);
return ans;
}
}; // namespace modular
namespace Base {
template <typename Tp>
inline Tp input() {
Tp x = 0, y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-') y = -1;
c = getchar();
}
if (c == EOF) return 0;
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getchar();
return x *= y;
}
template <typename Tp>
inline void read(Tp &x) {
x = input<Tp>();
}
template <typename Tp>
inline void chmax(Tp &x, Tp y) {
x < y ? x = y : 0;
}
template <typename Tp>
inline void chmin(Tp &x, Tp y) {
x > y ? x = y : 0;
}
}; // namespace Base
using namespace Base;
/*----------------------------------------------------------------------------*/
#define MAX_N 607
int N, D1, D2;
struct Graph {
std::vector<pr> dir;
std::queue<pr> q;
int col[MAX_N][MAX_N];
Graph() { memset(col, -1, sizeof(col)); }
void build(int D) {
lep(i, 0, N * 2) {
if (i * i > D) break;
lep(j, 0, N * 2) {
if (j * j > D) break;
if (i * i + j * j == D) {
dir.push_back(pr(i, j));
dir.push_back(pr(i, -j));
dir.push_back(pr(-i, j));
dir.push_back(pr(-i, -j));
}
}
}
}
bool in(int x, int y) { return 0 <= x && x < N * 2 && 0 <= y && y < N * 2; }
void bfs(int x, int y) {
q.push(pr(x, y));
col[x][y] = 0;
while (!q.empty()) {
pr k = q.front();
q.pop();
for (pr t : dir) {
pr nk = pr(k.fi + t.fi, k.se + t.se);
if (in(nk.fi, nk.se) && col[nk.fi][nk.se] == -1) {
col[nk.fi][nk.se] = col[k.fi][k.se] ^ 1, q.push(nk);
}
}
}
}
void color() {
// for (auto t : dir) printf("%d %d\n", t.fi, t.se);
// puts("--------");
// return;
lep(i, 0, N * 2) lep(j, 0, N * 2) if (col[i][j] == -1) bfs(i, j);
}
} G1, G2;
void init() {
G1.build(D1), G2.build(D2);
G1.color(), G2.color();
}
std::vector<pr> ans[2][2];
void solve() {
lep(i, 0, N * 2) {
lep(j, 0, N * 2) {
ans[G1.col[i][j]][G2.col[i][j]].push_back(pr(i, j));
}
}
lep(i, 0, 2) {
lep(j, 0, 2) if (ans[i][j].size() >= N * N) {
while (ans[i][j].size() > N * N) ans[i][j].pop_back();
for (pr k : ans[i][j]) printf("%d %d\n", k.fi, k.se);
return;
}
}
}
int main() {
read(N), read(D1), read(D2);
init();
solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int n, m;
scanf("%d%d", &n, &m);
std::vector<std::tuple<int, int, int>> es;
std::vector<std::pair<int, int>> w;
for (int i = 0; i < m; i++) {
int p, q, c;
scanf("%d%d%d", &p, &q, &c);
--p; --q;
es.emplace_back(p, q, c);
w.emplace_back(p, c);
w.emplace_back(q, c);
}
std::sort(w.begin(), w.end());
w.erase(std::unique(w.begin(), w.end()), w.end());
auto get = [&](int v, int c) {
return n + std::lower_bound(w.begin(), w.end(), std::make_pair(v, c)) - w.begin();
};
std::vector<std::vector<std::pair<int, int>>> g(w.size() + n);
for (const auto &e : w) {
int v = get(e.first, e.second);
g[e.first].emplace_back(v, 1);
g[v].emplace_back(e.first, 0);
}
for (const auto &e : es) {
auto p = std::get<0>(e), q = std::get<1>(e), c = std::get<2>(e);
int pv = get(p, c), qv = get(q, c);
g[pv].emplace_back(qv, 0);
g[qv].emplace_back(pv, 0);
}
constexpr int inf = std::numeric_limits<int>::max() / 2;
std::vector<int> dist(g.size(), inf);
std::deque<int> q { 0 };
dist[0] = 0;
while (!q.empty()) {
int v = q.front();
q.pop_front();
for (auto to : g[v]) {
if (dist[to.first] <= dist[v] + to.second) continue;
dist[to.first] = dist[v] + to.second;
if (to.second) q.push_back(to.first);
else q.push_front(to.first);
}
}
printf("%d\n", dist[n - 1] == inf ? -1 : dist[n - 1]);
return 0;
}
|
#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<queue>
using namespace std;
long long int inf = 10000000000;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int main(){
long long int n, m;
cin >> n >> m;
vector< vector<long long int> > dist(n, vector<long long int>(n, inf));
for(int i=0; i<m; i++){
int s, t, d;
cin >> s >> t >> d;
dist[s][t] = d;
}
for(int i=0; i<n; i++) dist[i][i] = 0;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if( dist[j][i] == inf ) continue;
for(int k=0; k<n; k++){
if( dist[i][k] == inf ) continue;
if( dist[j][k] > dist[j][i] + dist[i][k] ) dist[j][k] = dist[j][i] + dist[i][k];
}
}
}
for(int i=0; i<n; i++){
if( dist[i][i] < 0 ){
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if( dist[i][j] == inf ) cout << "INF";
else cout << dist[i][j];
if( j == n-1 ) cout << endl;
else cout << " ";
}
}
return 0;
}
// EOF
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl) vl.begin(),vl.end()
#define m_p make_pair
#define sz(a) sizeof(a)
#define forn(mp,it) for(it = mp.begin();it!=mp.end();it++)
#define FOR(i,a,n) for(ll i=a;i<n;i++)
#define FORE(i,a,n) FOR(i,a,n+1)
#define Endl endl
#define eNdl endl
#define enDl endl
#define endL endl
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
ll a,b;
cin>>a>>b;
cout<<b*2-a<<Endl;
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;
}
| 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.