source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 92032eea2450b21cd2ebb8867e035b51 | 1,700 | PASSED |
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 78f83186e7dd24d7423fc06c782031c9 | 1,700 | PASSED |
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 02f4831b6b98acea690e6ef817a4f294 | 1,700 | PASSED |
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | f42b6c8c27c0165919aa1b33ece80fc1 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+3;
bool a[N];
int dp[2][N][2];
char s[N];
int main(){
int T; scanf("%d",&T);
while(T--){
int n; scanf("%d%s",&n,s+1);
for(int i=1;i<=n;i++) a[i]=s[i]=='R';
for(int i=0;i<=n;i++) dp[0][i][0]=dp[0][i][1]=dp[1][i][0]=dp[1][i][1]=0;
... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | dc5d0e4e0e49f8adb15803e13867ed55 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+3;
bool a[N];
int dp[2][N][2];
int main(){
int T; scanf("%d",&T);
while(T--){
int n; scanf("%d",&n);
string s; cin>>s;
for(int i=1;i<=n;i++) a[i]=s[i-1]=='R';
for(int i=0;i<=n;i++) dp[0][i][0]=dp[0][i][1]=dp[1][i][0]=dp[1][i][1]=0;
... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 970331767d4554eef71c8c272ba5c44c | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> l(n, 1), r(n, 1);
for (int i = 1; i < n; i++) {
if (s[i] != s[i-1]) l[i] = l[i-1] + 1;
}
for (int i = n - 2; i >= 0; i--) {
... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 8661a0972a261a52a86550d14df270bc | 1,700 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<array>
#include<unordered_map>
#include<ctime>
#include<random>
#define ll long long
#define ull unsigned long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const ll inf = 0x3f3f3f3f;
const ll IN... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 7dc917d5590fe91a3f4558bc338c5ed6 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define sz(v) (int) (v).size()
#define all(v) (v).begin(), (v).end()
#define r_all(v) (v).rbegin(), (v).rend()
#define bit_count(v) __builtin_popcount((v))
using int64... | C++ | cf3cfcae029a6997ee62701eda959a60 | c46944b52e387daa324a323a66fc7a07 | 800 | PASSED |
#include <stdio.h>
int main()
{
int n, i, a, b, c, d, e, l, g;
scanf("%d",&n);//n组数据
for(i=0; i<n; i++){
scanf("%d",&a);
int f[a]={0};
for(b=0; b<a; b++){
scanf("%d",&c);
f[b]=c;
}
for(d=0; d<a-1; d++){
for(e=0; e<a-d-1; e++){
if(f[e]>f[e+1]){//小到大
l=f[e];
f[e]=f[e+1];
f[e+1]=... | C++ | cf3cfcae029a6997ee62701eda959a60 | 652ad288c042fb2cce015de42f6cafc5 | 800 | PASSED |
#include <iostream>
#include <cstring>
#define endl "\n"
#define max2(a,b) (a>b)?(a):(b)
#define min2(a,b) (a<b)?(a):(b)
using namespace std;
int main () {
ios::sync_with_stdio(false);
cout.tie(0), cin.tie(0);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
int mi = 2e9, mx = -1;
int xl;
for(int i = 1... | C++ | cf3cfcae029a6997ee62701eda959a60 | 2bf4d5a16b1611c2d965895bc2628a3a | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[1005], s, m, n, t;
int main()
{
cin >> t;
while(t--)
{
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
cout << a[n - 1] - a[0] << endl;
}
return 0;
}
| C++ | cf3cfcae029a6997ee62701eda959a60 | a901c0f0317551c437f35111a6f910be | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n; cin >>n;
int ans;
for(int i = 1; i <= n; i++) {
int m; cin >> m;
vector <int> a(m);
int mx = INT_MIN, mi = INT_MAX;
for(int j = 0; j < m; j++) {
cin >> a[j];
mx = max(mx, a[j]);
mi = min(mi, a[j]);
}
ans = mx - mi;
cout << ans ... | C++ | cf3cfcae029a6997ee62701eda959a60 | 2e9e243c0c0f66e1d9cf129c37f672b6 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int Max = 55;
int t,n,a[Max];
int main()
{
cin >> t;
while(t--){
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
cout << a[n-1]-a[0] << endl;
}
}
| C++ | cf3cfcae029a6997ee62701eda959a60 | 566085e2fe0c3884ae2c675fb8d3434e | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
void slove()
{
int maxn = 0;
int minn = 1000000005;
int n;
cin >> n;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
minn = min(minn, a);
... | C++ | cf3cfcae029a6997ee62701eda959a60 | 3b656a01a4c9d7ccc282889e5a3590f2 | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
void solve(void);
void solve(void)
{
int nums[60], ma, mi;
int n;
ma=0; mi=0x3FFFFFFF;
cin>>n;
for(int i=0; i<n ;i++)
{
cin>>nums[i];
ma=max(ma,nums[i]);
mi=min(mi,nums[i]);
}
printf("%d\n", ma-mi);
}
int main(void)
{
i... | C++ | cf3cfcae029a6997ee62701eda959a60 | 04a82cc0444807ee5d1914ea4eec63df | 800 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a=-1,b=1e9;
while(n--){
int x;
cin>>x;
a=max(a,x);
b=min(b,x);
}
cout<<a-b... | C++ | cf3cfcae029a6997ee62701eda959a60 | 1d49c7f090b4dd70aaed461c295af49a | 800 | PASSED |
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int n,m,a,mini,maxi;
cin>>n;
while(n--)
{
cin>>m;
mini=1000000001,maxi=-1;
for(int i=0;i<m;i++)
{
cin>>a;
maxi=max(maxi,a);
mini=min(mini,a);
}
cout<<maxi-mini<<endl;
}
return 0;
}
... | C++ | cf3cfcae029a6997ee62701eda959a60 | 2dfcda43c88b21270d4b2bf3c83350d1 | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=200010,M=200010;
int p[M];
int n,m;
int cnt[N];
int Size[N];
int ans=0;
struct Edge
{
int a,b,w;
bool operator< (const Edge &W)const
{
return w < W.w;
}
}edges[N];
int fi... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | cb1c612489deb16017bb267549e18580 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200010,M=200010;
int fa[N];
int n,m;
int cnt[N];
int ssize[N];
int ans=0;
struct Edge
{
int a,b,w;
}edges[N];
bool cmp(Edge a,Edge b)
{
return a.w<b.w;
}
int find(int x) // 并查集
{
if (fa[x] != ... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 221fbf110731e1b5d40ee9db8e857cd3 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define PI 3.14159265358979
using namespace std;
mt19937_64 rng(chrono::steady_clock... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 43346c958614fb7491f317c8fb006aef | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define endl "\n"
#define pb push_back
#define fi first
#define se second
#define pi pair<int,int>
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vpi vector<pair<int,int>>
#define vvi vector<vector<int>>
... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 3d83ee6c0de5f46f3c6310fdd0a85c5e | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define endl "\n"
#define pb push_back
#define fi first
#define se second
#define pi pair<int,int>
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vpi vector<pair<int,int>>
#define vvi vector<vector<int>>
... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 568b6f073b581d1881c02064c2737ce5 | 1,900 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10, INF = 0x3f3f3f3f;
int T;
int n, m;
struct Node
{
int u, v, w;
}e[N];
int fa[N];
inline int read()
{
int x = 0, w = 1;
char ch = getchar();
while (!isdigit(ch))
{
... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | aed5f40c5857304e9c98451d886ea428 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long t,n,m,fa[2000020];
struct edge{
long long u,v,w;
}e[2000020];
long long find(long long x){
if(x==fa[x]) return x;
return fa[x]=find(fa[x]);
}
bool solve(long long x,long long k){
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<=m;i++){
if((e[i].w|x... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 9d0668033a7b8ccc0fbe714ac738f198 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll t,n,m,fa[200020];
struct edge{
ll u,v,w;
}e[200020];
ll find(ll x){
if(x==fa[x]) return x;
return fa[x]=find(fa[x]);
}
bool solve(ll x,ll k){
for(ll i=1;i<=n;i++) fa[i]=i;
for(ll i=1;i<=m;i++){
if((e[i].w|x)>=(x+(1ll<<(k+1)))) con... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | e6feaa866a3c94fd4dfd88bf384a3020 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t,n,m,upper[200005],l,ans;
struct edger{
int qi;
int zh;
int ch;
int ability;
}bn[200005];
bool cmp(edger a,edger b){
return a.ch<b.ch;
}
int find(int x){
int master=x;
while(upper[master]!=master) master=upper[master];
int i... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 00bff19cf041271625fd16df1c8cd32f | 1,900 | PASSED |
#include<bits/stdc++.h>
#define left l,mid,ls[p]
#define righ mid+1,r,rs[p]
#define use 1,n,rt
#define mod 1000000007
#define N 510001
#define fer(x,y,z) for(register int x=y;x<=z;x++)
using namespace std;
int n,m,q1x[N],q1y[N],q1d[N],s1;
int q2x[N],q2y[N],q2d[N],s2;
int fa[N];
int bine(int x){return fa[x]=f... | C++ | 9a2e734bd78ef1e50140f2bb4f57d611 | 413dc9cb1efe5781f8cfcbc6336e08f4 | 1,900 | PASSED |
// -------------------- Includes -------------------- //
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <stdlib.h>
#include <array>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <m... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 50548df9501e2c2e547e91a61655c2e5 | 2,000 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve(){
int n,k;
cin >> n>>k;
vector<string> rmb(n);
for (int i=0;i<n;i++) cin >> rmb[i];
string s;
cin>>s;
if (k==1) {
cout << -1<<'\n'; return;
}else
if (k<=2){
for (int i=0;i<rmb.size();i+... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 27d059642ec333e64c28128c250746d3 | 2,000 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
const ll mod = 1e9 + 7;
#define ld long double
using namespace std;
// Copy from nealwu's template - http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class T> explicit ... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 03de32e7f99b5c66bcafdb06b58f4cd1 | 2,000 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
const ll mod = 1e9 + 7;
#define ld long double
using namespace std;
// Copy from nealwu's template - http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class T> explicit ... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 0ac1840423b4d1769add316619523609 | 2,000 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
const ll mod = 1e9 + 7;
#define ld long double
using namespace std;
// Copy from nealwu's template - http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class ... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 0759860a9d8a02c2408a569ea5bc5ecc | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// Copy from nealwu's template - http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class T> explicit y_combinator_result(T &&fun): fun_(std... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 29e7d5023594e445b87ef5297ce2d00f | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int f2[N],f3[N],l2[N],l3[N];
int g[N],l[N],nxt[N],n,m,t;
char s[N];
int num(char x,char y,char z){
return (x-'0')*100+(y-'0')*10+z-'0';
}
int main(){
// freopen("1.in","r",stdin);
scanf("%d",&t);
while(t--){
memset(f2,0,sizeof(f2));
mem... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | f10f52b72c333a7a0858669cdbf59ba3 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int f2[N],f3[N],l2[N],l3[N];
int g[N],l[N],nxt[N],n,m,t;
char s[N];
int num(char x,char y,char z){
return (x-'0')*100+(y-'0')*10+z-'0';
}
int main(){
// freopen("1.in","r",stdin);
scanf("%d",&t);
while(t--){
memset(f2,0,sizeof(f2));
mem... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 6e78978d1c3a2bcbbc7e29fede950935 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
struct range{
int l,r,i;
void init(){
l=r=i=0;
}
void set(int _l,int _r,int _i){
l=_l;r=_r;i=_i;
}
void print(){
printf("%d %d %d\n",l,r,i);
}
}f[N],f2[N],f3[N];
int nxt[N],n,m,t;
char s[N];
int num(char x,char y,char z){
r... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 53cd2b7d9cc6292756a8c02da8613a2b | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
struct range{
int l,r,i;
void init(){
l=r=i=0;
}
void set(int _l,int _r,int _i){
l=_l;r=_r;i=_i;
}
void print(){
printf("%d %d %d\n",l,r,i);
}
}f[N],f2[N],f3[N];
int nxt[N],n,m,t;
char s[N];
int num(char x,char y,char z){
r... | C++ | a4f4ad94387b16e8760e7c7fd45b93b3 | 8eefcc875b59981687471644fb736417 | 2,000 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while (t--)
{
int a, b, c;
cin >> a >> b >> c;
if (a == b == c || b - a == c - b || a - b == b - c)
{
cout << "YES" << endl;
continue;
}
double d = 2.0 * b - c;
if ((int)d % a == 0 && d >... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 751f25aaed111a02b419ab010dccb15f | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (b * 2 - a > 0 && (b * 2 - a) % c == 0)
{
puts("YES");
}
else if (b * 2 - c > 0 && (b * 2 - c) % a == 0)
{
puts("YES");
}
else if ((a + c) % ... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 4466e6a39d5ef966f543caf7562430ab | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
ll a,b,c;
cin>>a>>b>>c;
if((2*b-c)%a==0&&2*b-c>0){
puts("yes");
}
else if((a+c)%(2*b)==0){//
puts("yes");
}
else if((2*b-a)%c==0&&2*b-a>0){
puts("yes");
}
else {
puts("no");
}
}
int main()
{
int t;
cin>>t;
while(t--... | C++ | 90c5058c0c7f55a567f2e036482149f9 | a7ec0a12bb36fa601e8e0bc38baf3656 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void slove()
{
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (b * 2 - c > 0 && (b * 2 - c) % a == 0) printf("YES\n");
else if (b * 2 - a > 0 && (b * 2 - a) % c == 0) printf("YES\n");
else if ((a + c) % (2 * b) == 0) printf("YES\n");
else printf("... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 3b6bdcdb797dfda832a8038aa41c477b | 900 | PASSED |
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int flag = 0;
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a + c) % (2*b) == 0 && a + c >0 ) {
flag = 1;
}
else if((2*b-a)%c==0&&2*b-a>0){
flag = 1;
}
... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 68fc072492768af52921e1ea7db21735 | 900 | PASSED |
#include <bits/stdc++.h>
int main()
{
int t;
long long a,b,c;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld%lld",&a,&b,&c);
if((a+c)>(2*b))
{
if((a+c)%(2*b)==0)
printf("YES\n");
else
printf("NO\n");
}
else
{
if((2*b-a)%c==0||(2*b-c)%a==0)
printf("YES\n");
else
printf("NO\n");... | C++ | 90c5058c0c7f55a567f2e036482149f9 | d87c31d034e5beedfba65b143846b635 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while(n--){
int a, b, c;
cin >> a >> b >> c;
if((a+c)%(2*b)==0){
cout << "YES" << endl;
}else if((2*b-a)%c==0 && (2*b-a)>0){
cout << "YES" << endl;
}else if((2*b-c)%a==0 && (2*b-c)>0){
cout << "YES" << endl;
}else{
c... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 825c78a24703f87fafca9516c680f478 | 900 | PASSED |
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int N=200010;
int t,n,m,a[N];
signed main()
{
cin>>t;
while(t--)
{
int a,b,c;
cin>>a>>b>>c;
if(((a+c)%2==0&&((a+c)/2)%b==0)||(2*b-a>=c&&(2*b-a)%c==0)||(2*b-c>=a&&(2*b-c)%a==0)) cout<<"YES"<<endl;
else c... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 7b20893866ec4cc17c6640729e3f127c | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t,a,b,c,m;
cin>>t;
while(t--){
cin>>a>>b>>c;
if((2*b-c)%a==0&&(2*b-c)/a>0){
cout<<"Yes"<<endl;
}
else if(((a+c)/2)%b==0){
m=(a+c)/(2*b);
if(m*b-a==c-m*b)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else if((2*b-a)%c==0&&(2*b... | C++ | 90c5058c0c7f55a567f2e036482149f9 | 7c50a2849929c57b1993a46331e55acf | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t;
int main(){
cin>>t;
for(int i = 1;i <= t;i++){
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if(((2 * b - c) > 0 && (2 * b - c) % a == 0) || (a + c) % (b * 2) == 0 || ((2 * b - a) > 0 && (2 * b - a) % c == 0)){
printf("YES\n");
}
else{
printf("NO\n");}
... | C++ | 90c5058c0c7f55a567f2e036482149f9 | f1d7b4bce9c41025bf19cc9822d87c22 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), [](const int& x, const int& y) {
return x > y;
});
... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | dd98ac879ed57d21ae35a717ac51a797 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define sz(v) (int) (v).size()
#define all(v) (v).begin(), (v).end()
#define r_all(v) (v).rbegin(), (v).rend()
#define bit_count(v) __builtin_popcount((v))
using int64... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 95a7de6eab51c803321f56013393a7eb | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
int n;
cin>>n;
vector<int>a(n+1);
for(int i=0;i<n;i++){
int num;
scanf("%d",&num);
while(num>n) num/=2;
if(a[num]==0){
a[num]=1;
}
else{
while(a[num]&&num>0){
num/=2;
}
a[num]=1;
}
}
if(count(a.begin()+1... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 3689977190770665bdc8ad9668a4b5bc | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int n;
scanf("%d", &n);
vector<int>b(n + 1);
for (int i = 1; i <= n; i++)
{
int x;
scanf("%d", &x);
while (x > n)x = x / 2;
if (!b[x])
{
b[x] = 1;
}
e... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 3e89a042d794744189bb2624367f7049 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[200],book[200],book1[200];
int main()
{
int m;
scanf("%d",&m);
while(m--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int num;
scanf("%d",&num);
if(num>=1&&num<=n) a[i]=num;
else
{
while(1)
{
if(num>=1&&num<=n)
{
... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 90937af02b5ea868bde67e787abf2a1b | 1,100 | PASSED |
#include<bits/stdc++.h>
#define N 100000
using namespace std;
int main()
{
int t;
cin>>t;
for(int i=0; i<t; ++i)
{
int a[N];
bool b[N];
int k=0;
int n;
cin>>n;
for(int j=0; j<n; j++)b[j]=false,cin>>a[j];
b[n]=false;
sort(a, a+n);
for(int j=0; j<n; j++)
{
while(a[j]>1&&(a[j]>n||b[a[j]]))a[j]=... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 44370fa247778bb223a8d4d487a934bc | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
int a[maxn];
int main()
{
int t;
cin >> t;
while(t--)
{
map<int, int>mp;
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
}
f... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 3b881bd7f7cab2132961f8d56c54a120 | 1,100 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<deque>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn=1e2+5;
int t,n,x;
vector<int> a;
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 1fbc3bf8ab5e80d864305311552abc32 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define N 200010
#define il inline
#define rr register
#define ll long long
#define mo 1000000007
#define gc() getchar()
#define INF 0x3f3f3f3f
#define mem(a, b) memset(a, b, sizeof(a))
#define f0r(i,a,b) for(rr ll i=a;i<=b;++i)
#define f1r(i,a,b) for(rr ll i=a;i>=b;--i)
using namespace std;
///... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | fbb446f747e7f4c802f37e7abcb011fa | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int maxn=55;
ll a[maxn],f[maxn];
int main() {
cin.tie(0)->sync_with_stdio(0);... | C++ | 645459e0a41ec63b13648ea8dbe0f053 | 22a438ddc696ec8a652b92ba9def68d2 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(x) " ["#x << ": " << x << "] "
void break_into_singles(int &d, int &s) {
d -= 1;
s += 2;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
for (int tc = 1; tc <= t; ++tc) {
... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | ac35c63c8409689febe2cc63ac1c23fe | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define dbg(x) " ["#x << ": " << x << "] "
template<typename A, typename B>
B ceil_div(A n, B m) {
return n / m + (n % m != 0);
}
vector<int> get_freq(string &s) {
vector<int> freq(26, 0);
for (auto i: s)++freq[i - 'a'];
return freq;
}
bo... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 3a6d99b289099d27cf4d4bf8123e5554 | 1,400 | PASSED |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define fi fir... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | fcbd1df059af11e5a13f22bb08f271d3 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define sz(v) (int) (v).size()
#define all(v) (v).begin(), (v).end()
#define r_all(v) (v).rbegin(), (v).rend()
#define bit_count(v) __builtin_popcount((v))
using int64... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 57acaef829022cad0e43fde44aa385cf | 1,400 | PASSED |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define int long long
#define ll long long
using namespace std;
typedef pair<int, int> pii;
const int M = 2e5 + 10;
map<char, int> mp;
char s[M];
int n, k, tot = 0;
bool check(int mid) {
if(mid/2*k<=tot)
... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 1ea02bed1cd80d215506fd674366faf9 | 1,400 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
int freq[30];
int n, k;
string s;
int main()
{
int T;
cin >> T;
while (T--)
{
cin >> n >> k >> s;
memset (freq, 0, sizeof freq);
for (char i : s)
freq[i - 'a'] ... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 5f750b0a9359cce5c18add3470481805 | 1,400 | PASSED |
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int N=200010;
int t,n,m,a[N];
signed main()
{
cin>>t;
while(t--)
{
int dui=0,dan=0;
cin>>n>>m;
string s;
unordered_map<char,int> mm;
cin>>s;
for(int i=0;i<s.size();i++)
{
... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | b0a57823899fb44958ad44afa4b787d5 | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n,k;
string s;
int a[26];
bool check(int x){
if(k*x>n) return false;
int sum=0;
for(int i=0;i<26;++i){
sum+=a[i]/2;
}
if(x/2*k<=sum) return true;
else return false;
}
void solve()
{
cin>>n>>k;
cin>>s;
for(int i=0;i<26;++i) a[i]=0;
for(int i=0;i<n;++i){
a... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 9d3ef8860d4e313b710c92a51d195734 | 1,400 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define ll long long
#define MAX 200010
//
int check(int x,int k,int pair,int sing,int n) {
if (x * k > n)return 0;
while (k--) {
if (x % 2) {//奇数
if (sing != 0)sing--;
else {
if (pair == 0)return 0;
else {
pair--;
... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 35626facf6a2b8f1d548938c365130b2 | 1,400 | PASSED |
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 2e5 + 5;
char s[N];
int vis[27];
int main()
{
int _;
scanf("%d", &_);
while (_--)
{
memset(vis,0,sizeof vis);
int n, k;
scanf("%d%d", &n, &k);
int sum = 0;
scanf("%s", s... | C++ | ca817fe0a97e2d8a6bcfcb00103b6b6d | 3ded7e3797e292e2dfbc2f7436ab8a6b | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define ll long long
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define mii map<int,int>
#define pii pai... | C++ | ad36ef40ef4888b69ee9635e924c65ab | 339764d3f96c538976ce1589d62bc0d8 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void ask(int n) {
cout << "+ " << n << endl;
cout.flush();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int l = 1, r = n - 1;
int t = 0;
while (l <= r) {
int mid = (l + r) >> 1;
int add = n - mid % n;
ask(add);
in... | C++ | ad36ef40ef4888b69ee9635e924c65ab | 085d5c75ba16e528305531b711b00983 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void ask(int n) {
cout << "+ " << n << endl;
cout.flush();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int l = 1, r = n - 1;
int t = 0;
while (l < r) {
int mid = (l + r + 1) >> 1;
int add = n - mid % n;
ask(add);
... | C++ | ad36ef40ef4888b69ee9635e924c65ab | d06ab4b220a9add35d85adaa93432297 | 2,000 | PASSED |
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int add(int a) {
cout << "+ " << a << endl;
int k;
cin >> k;
return k;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//#ifndef ONLINE_JUDGE
// fr... | C++ | ad36ef40ef4888b69ee9635e924c65ab | d72f895eaf368c1eaa4102af21914f19 | 2,000 | PASSED |
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int add(int a) {
cout << "+ " << a << endl;
//fflush(stdout);
int k;
cin >> k;
return k;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//#ifndef ONL... | C++ | ad36ef40ef4888b69ee9635e924c65ab | f088d58fc040df723b93ea21c0173a94 | 2,000 | PASSED |
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int add(int a) {
cout << "+ " << a << '\n';
cout.flush();
int k;
cin >> k;
return k;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//#ifndef ONLINE_... | C++ | ad36ef40ef4888b69ee9635e924c65ab | a16abf25c19b8bf8fd4b1a342f66beda | 2,000 | PASSED |
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int add(int a) {
cout << "+ " << a << '\n';
cout.flush();
int k;
cin >> k;
return k;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//#ifndef ONLINE_... | C++ | ad36ef40ef4888b69ee9635e924c65ab | 3bd81013fa78080044f77d998ab93a9c | 2,000 | PASSED |
#include <cstdio>
#include <cstring>
using namespace std;
//solution by Tim Dee with 3 if, xd 13.01.2022 /
int main() {
int n;
scanf("%d",&n);
if (n<10) {
int t=1;
printf("+ %d\n", t);
fflush(stdout);
int c;
sca... | C++ | ad36ef40ef4888b69ee9635e924c65ab | addc557b8bdc4e00e4cbbe4b46dc387b | 2,000 | PASSED |
#include <cstdio>
#include <cstring>
using namespace std;
//solution by Tim Dee with 3 if, xd 13.01.2022
int main() {
int n;
scanf("%d",&n);
if (n<10) {
int t=1;
printf("+ %d\n", t);
fflush(stdout);
int c;
scanf... | C++ | ad36ef40ef4888b69ee9635e924c65ab | d3e5e02d0a8f18e87e8cf1d9aa029328 | 2,000 | PASSED |
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n;
scanf("%d",&n);
if (n<10) {
int t=1;
printf("+ %d\n", t);
fflush(stdout);
int c;
scanf("%d", &c);
while (c == 0) {
... | C++ | ad36ef40ef4888b69ee9635e924c65ab | e0594819d965ecae052eda1e00c4f1ef | 2,000 | PASSED |
#include<bits/stdc++.h>
#define ll int
const ll N=800010;
const ll M=200000;
using namespace std;
struct node{
ll a,b,x,y,z,id;
};
ll n;
vector<node>t,ans;
ll t1[N],t2[N],tot;
ll vis[N];
queue<ll>q;
bool cmp(node a,node b){
return abs(a.a-M)==abs(b.a-M)?abs(a.a-M)<abs(b.b-M):abs(a.a-M)<abs(b.a-M);... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | 3e04763cf77d19e146e6b96e8d9a5599 | 3,500 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
long long a,v[1600001],id[1600001],id1[1600001],an[1600001],st[1600001],cn,t[1600001],cnt,cnn,quu[1600001],cnnn,stt[1600001];
struct p{long long q,w;}l[1600001];
struct pp{list<long long> q,w;pp(){}};
stack<pp*> m;
vect... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | c8f132f120672510ebafaa3edbe73417 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct curve {
list<int> a, b;
curve() {}
curve(int x) {
a.push_back(x);
b.push_back(x);
}
curve& operator+=(curve &o) {
a.splice(a.end(), o.a);
o.b.splice(o.b.end(), b);
b.swap(o.b);
ret... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | f4ae9c7a4ef0e66768c1613d0a2f37ef | 3,500 | PASSED |
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | 5800fbc39b4a2de74f86dfb3c0a26bcf | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define re register
#define Re register
#define i64 long long
#define defrog(args...) {string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); de_frog(_it, args);}
inline void de_frog(istream_iterator<st... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | eeb359ff249c0e095c09ff4f38cf6875 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define re register
#define Re register
#define i64 long long
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout);
#define defrog(args...) {string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<st... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | a90425ec44b88657aa262a0ce875e2c9 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,from[2][N],to[2][N];
struct Card{int a,b;}s[N<<1];
int go[N<<1][2],back[N<<1][2];
struct DSU{
int fa[N<<1],L[N<<1],R[N<<1];
void init(int n){for(int i=1;i<=n;++i)fa[i]=L[i]=R[i]=i;}
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
}... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | c10b70259fff2a36a1511f20e8641639 | 3,500 | PASSED |
//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/st... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | a75b99e60be7c67af8b18dbc08584bad | 3,500 | PASSED |
#include <bits/stdc++.h>
#define st first
#define nd second
#define re register
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
using namespace std;
const int N = 4e5 + 10;
inline int read()
{
int s = 0, w = 1;
char ch = getchar();
while(ch < '0' || ch > '9') { if(ch == '-') w *=... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | 9dd0ca5a6c70ce3b28a406066ce492b3 | 3,500 | PASSED |
#include <bits/stdc++.h>
const int N = 2e6 + 101;
int n;
int a[N], b[N], xa[N], ya[N], xb[N], yb[N], vis[N], num[2][2];
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n;
std::vector<int> ans, nex(2 * n + 2, -1);
for (int i = 1; i <= 2 * n; ++i) {
std::ci... | C++ | 6e22beaa3009c5bcb17270bf7c672118 | 5ee05ac77ab007ebeba1c0edb446fd08 | 3,500 | PASSED |
#include<stdio.h>
#include<set>
#include<vector>
#include<queue>
#include<map>
using namespace std;
const int maxn=500005;
int T,n,m,tot,cols;
int ans1[maxn],ans2[maxn],deg[maxn],col[maxn],cen[maxn],size[maxn];
vector<int>v[maxn],t[maxn];
set<int>s;
queue<int>q;
map<pair<int,int>,int>mp;
void dfs1(int x,i... | C++ | 97803cc06d69a133e04e657ad686496a | db1af2d5aebaaca4f4da963a9302da8a | 2,800 | PASSED |
#include<bits/stdc++.h>
#define iter set<int>::iterator
using namespace std;
int n,m,len,fa[1000000],nex[1000000],wen[1000000],hea[1000000],boo[1000000],size[1000000],bo[1000000],an[1000000];
vector<int> ans[1000000];
set<int> s[1000000];
void add(int x,int y)
{
++len;
nex[len]=hea[x];
wen[len]=y;
hea[x]... | C++ | 97803cc06d69a133e04e657ad686496a | 904dba687d69d8998cf914126f905764 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define iter set<int>::iterator
using namespace std;
int n,m,len,fa[1000000],nex[1000000],wen[1000000],hea[1000000],boo[1000000],size[1000000],bo[1000000],an[1000000];
vector<int> ans[1000000];
set<int> s[1000000];
void add(int x,int y)
{
//cout<<x<<"??"<<y<<endl;
++len;
nex[len]=he... | C++ | 97803cc06d69a133e04e657ad686496a | 1b9878d0ef34e5f8c3038a913c0fbd38 | 2,800 | PASSED |
//zxggtxdy!
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+7; bool fl[N],fp[N];
int n,m,k,sn,x[N],y[N],f[N],p[N],q[N],g[N],st[N],rt[N],lt[N],deg[N]; vector<int>v[N],w[N],c[N],z[N];
struct node{
int u,t;
};
inline bool operator < (node A,node B){
return A.t<B.t;
}
priority_queue<node>gt;
inli... | C++ | 97803cc06d69a133e04e657ad686496a | 828bf26ef192c91556138335037af9ab | 2,800 | PASSED |
#include<bits/stdc++.h>
typedef long long LL;
typedef long double LD;
using namespace std;
const int N=5e5+10,M=5e5+10,INF=0x3f3f3f3f;
inline int read(){
char c=getchar();int x=0,f=1;
while(c<'0'||'9'<c){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int t,n... | C++ | 97803cc06d69a133e04e657ad686496a | 0bf0433a7d423224754600a6d2d2361c | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 10101010;
int N, M;
set<int> adj[505050];
set<int> rem;
vector<int> vs[505050];
int deg[505050];
int P[505050];
int Q[505050];
bool chk[505050];
int id;
struct SegTree {
int T[4 * 5050... | C++ | 97803cc06d69a133e04e657ad686496a | 645c80424052e12a1f4f1d9fd5ac869c | 2,800 | PASSED |
#include<bits/stdc++.h>
#define _gc getchar()
#define Pb push_back
#define FOR(i,a,b) for(register int i=a;i<=b;i++)
#define ROF(i,b,a) for(register int i=b;i>=a;i--)
using namespace std;
inline int read(){
int x=0;char s=_gc;
while('0'>s||s>'9')s=_gc;
while('0'<=s&&s<='9'){x=x*10+s-48;s=_gc;}
return x;
... | C++ | 97803cc06d69a133e04e657ad686496a | 73f5b1212987b3f135bb82dd78d12dbd | 2,800 | PASSED |
#include<bits/stdc++.h>
#define _gc getchar()
#define Pb push_back
#define FOR(i,a,b) for(register int i=a;i<=b;i++)
#define ROF(i,b,a) for(register int i=b;i>=a;i--)
using namespace std;
inline int read(){
int x=0;char s=_gc;
while('0'>s||s>'9')s=_gc;
while('0'<=s&&s<='9'){x=x*10+s-48;s=_gc;}
return x;
... | C++ | 97803cc06d69a133e04e657ad686496a | c6939a57ae32658d5dacac6dc58403ad | 2,800 | PASSED |
#include <bits/stdc++.h>
typedef std::pair<int, int> pii;
#define fi first
#define se second
#define pr std::make_pair
const int N = 500000;
std::vector<int>G[N + 5]; int n;
void adde(int u, int v) {
G[u].push_back(v), G[v].push_back(u);
}
namespace segtree{
#define lch (x << 1)
#define rch (x <<... | C++ | 97803cc06d69a133e04e657ad686496a | 0e80af390efc7927d1eb7d282e3bb282 | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int TEST,n,m;
int _u[500005],_v[500005];
int cnt;
int head[500005];
struct eg{
int to,nxt;
}edge[1000005];
void make(int u,int v){
edge[++cnt].to = v;
edge[cnt].nxt = head[u];
head[u] = cnt;
}
int d[500005];
int p[500005],q[500005],Nowuse;
int bin[... | C++ | 97803cc06d69a133e04e657ad686496a | 1131b7f8775244174828956003cb1f2e | 2,800 | PASSED |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef ... | C++ | a31e897ea206ad040df20d4852f7712b | 5d801ffa8b09f8aeb79da2dc21b1d6bc | 3,300 | PASSED |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pa... | C++ | a31e897ea206ad040df20d4852f7712b | 0713e87df1161913f7fb9dfe59d7cff6 | 3,300 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.