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 |
|---|---|---|---|---|---|
// LUOGU_RID: 93988327
// QwQ
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> PII;
typedef long long LL;
template <typename T> void inline read(T& x)
{
x=0; int f=1; char ch;
while((ch=getchar())>'9... | C++ | e27ffab64e694b9d612fe100f4c503b8 | f6a85cd1b819318bb4364e429feb878d | 2,200 | PASSED |
// QwQ
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> PII;
typedef long long LL;
template <typename T> void inline read(T& x)
{
x=0; int f=1; char ch;
while((ch=getchar())>'9' || ch<'0') if(ch=='-'... | C++ | e27ffab64e694b9d612fe100f4c503b8 | 0ba1664c1b0fc7e3f2c890c5c423a3b1 | 2,200 | PASSED |
// QwQ
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> PII;
typedef long long LL;
template <typename T> void inline read(T& x)
{
x=0; int f=1; char ch;
while((ch=getchar())>'9' || ch<'0') if(ch=='-'... | C++ | e27ffab64e694b9d612fe100f4c503b8 | a8b727a1fa1ae8dcb1358ed3dfd6ff83 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MN = 510, MM = 250010;
int n, m;
vector<int> nexts[MN];
vector<vector<LL>> edges(MM, vector<LL>(3));
vector<int> getDist(int v0){
vector<int> ans(n + 1, -1);
ans[v0] = 0;
queue<int> que;
que.push(v0);
whi... | C++ | e27ffab64e694b9d612fe100f4c503b8 | 7cd44ee61c9ae46f56e1bd973f1539a0 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MN = 510, MM = 250010;
int n, m;
vector<int> nexts[MN];
vector<vector<LL>> edges(MM, vector<LL>(3));
void solve(){
cin >> n >> m;
vector<vector<int>> dist(n + 1, vector<int>(n + 1, MN));
for(int i = 0; i < m; i ++)... | C++ | e27ffab64e694b9d612fe100f4c503b8 | d4675985f989b9d08f0df8aaa5bf1bcd | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MN = 510, MM = 250010;
int n, m;
vector<int> nexts[MN];
vector<vector<LL>> edges(MM, vector<LL>(3));
void solve(){
cin >> n >> m;
vector<vector<int>> dist(n + 1, vector<int>(n + 1, MN));
for(int i = 0; i < m; i ++)... | C++ | e27ffab64e694b9d612fe100f4c503b8 | 311e49e412006ebc2c2a9d70d0db218c | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MN = 510, MM = 250010;
int n, m;
vector<vector<LL>> edges(MM, vector<LL>(3));
void solve(){
cin >> n >> m;
vector<vector<int>> dist(n + 1, vector<int>(n + 1, MN));
for(int i = 0; i < m; i ++){
cin >> edges[... | C++ | e27ffab64e694b9d612fe100f4c503b8 | ca9a9a7c035bab397a516b5dbd65a186 | 2,200 | PASSED |
// LUOGU_RID: 90283435
#include <cstdio>
#define N 510
#define inf 0x3f3f3f3f
#define ll long long
int n,m,f[N][N],g[N][N];
ll min(ll x,ll y){return x<y?x:y;}
void once()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) f[i][j]=i==j?0:inf,g[i][j]=inf;
for(int u,v,w;m--;)
{
scan... | C++ | e27ffab64e694b9d612fe100f4c503b8 | 933fbca77b245b6bf832868402d10d7e | 2,200 | PASSED |
#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
// mt19937 rnd(239);
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define n_l '\n'
#define int long long
int max_n = 1e9;
int max... | C++ | 10812427d3052ce91cd0951911d3acb9 | b63dda8a261e3e6d62d44caa5c5e5a24 | 1,300 | PASSED |
#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
// mt19937 rnd(239);
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define n_l '\n'
#define int long long
int max_n = 1e9;
int max... | C++ | 10812427d3052ce91cd0951911d3acb9 | 3047c82599ebadc75060b33a7c29cd6c | 1,300 | PASSED |
#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
// mt19937 rnd(239);
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define n_l '\n'
#define int long long
int max_n = 1e9;
int ma... | C++ | 10812427d3052ce91cd0951911d3acb9 | 7b5067150680641ad7fa73be4733351a | 1,300 | PASSED |
#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
// mt19937 rnd(239);
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define n_l '\n'
#define int long long
int max_n = 1e9;
int ma... | C++ | 10812427d3052ce91cd0951911d3acb9 | 878acc2493e448cf40bebbc84eb796b9 | 1,300 | PASSED |
// Create by LeeWang
#include <iostream>
#include <string.h>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <sstream>
#include <set>
//#include <bits/stdc++.h>
#define endl '\n'
#define ll lo... | C++ | 10812427d3052ce91cd0951911d3acb9 | 657a7a48af69dd84fe2a471efa12a082 | 1,300 | PASSED |
#include <iostream>
#include <math.h>
using namespace std;
#define int long long
signed main () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while (t--) {
int l,r;
cin>>l>>r;
int ans{};
int temp1=sqrt((lon... | C++ | 10812427d3052ce91cd0951911d3acb9 | c75a9dc4423973e55e439abf99f16dc4 | 1,300 | PASSED |
#include <iostream>
#include <math.h>
using namespace std;
#define int long long
signed main () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while (t--) {
int l,r;
cin>>l>>r;
int ans{};
int temp1=sqrt((lon... | C++ | 10812427d3052ce91cd0951911d3acb9 | 65aa15785f5bb98e0c5cd563fefcf556 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
double eps=1e-6;
long long bs_sqrt(long long x) {
long long lo=1, hi=INT_MAX, mid;
while(hi>lo+1){
mid = (hi+lo)/2;
if(mid*mid <= x){
lo = mid;
}else{
hi = mid;
}
}//O(2*log(x*(10^eps)))
int p=lo... | C++ | 10812427d3052ce91cd0951911d3acb9 | eae07488bede9f3438310914d962c184 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
double eps=1e-6;
long long bs_sqrt(long long x) {
long long lo=1, hi=1e10, mid;
while(hi>lo+1){
mid = (hi+lo)/2;
if(mid*mid <= x){
lo = mid;
}else{
hi = mid;
}
}//O(2*log(x*(10^eps)))
int p=lo;
... | C++ | 10812427d3052ce91cd0951911d3acb9 | 1e2e1d8bab4d797554b046096c23611a | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
double eps=1e-6;
long long bs_sqrt(long long x) {
long long lo=1, hi=2000000123, mid;
while(hi>lo+1){
mid = (hi+lo)/2;
if(mid*mid <= x){
lo = mid;
}else{
hi = mid;
}
}//O(2*log(x*(10^eps)))
int p... | C++ | 10812427d3052ce91cd0951911d3acb9 | dac018dd5d6840a92b738371066f74d1 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
bool middleone( pair<int,int> p1, pair<int,int> p2, pair<int,int> p3)
{
if((p1.first == p2.first || p1.first==p2.second )&&( p1.second==p3.first || p1.second==p3.second))
return true;
else if((p1.second == ... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | a86d0bc6e9d4169259877e527af0227c | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t; t=1;
cin>>t;
while(t--){
int n,k; cin>>n>>k;
string s; cin>>s;
vector<int> keep(26,0);
for(int i=0; i<n; i++)
{
... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | 8db4d0f237243f0738e58a50f2fadfcd | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, k, cnt[1000];
string a;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int T;
cin >> T;
while (T--) {
cin >> n >> k >> a;
for (int i = 0; i < n; i++)
cnt[a[i]]++;
for (int i = 0; i < k; i++) {
int ans = 0;
fo... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | ce0ea4f52eb5fcb6ec2728b20a7ab014 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
constexpr char nl = '\n';
void solve() {
int n, k; cin >> n >> k;
string s; cin >> s;
map<char, int> mp;
for (char c : s) mp[c]++;
for (int _ = 0; _ < k; _++) {
bool ok = false;
char c;
for (c = 'a'; c < 'a' + n / k; c++)... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | a87fe9406f971e50409f122f03739263 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
constexpr char nl = '\n';
void solve() {
int n, k; cin >> n >> k;
string s; cin >> s;
map<char, int> mp;
for (char c : s) mp[c]++;
string res;
for (int _ = 0; _ < k; _++) {
char c = 'a';
while (c < 'a' + n / k && mp[c] > 0) ... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | 4b0c6f2992da78083dcf1dfb9e20eed2 | 900 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define en endl
#define eb emplace_back
#define pb push_back
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define FOR(x,strt,end) for(x=strt;x<=end;x++)
#define RFOR(x,end,strt) for(x=end;x>=strt;x--)
using namespace std;
const ll mod = (ll)1e9... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | a3ec9b9a36b90c7cd8de5835bba696b9 | 900 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define yes cout << "YES"<<endl;
#define no cout << "NO" << endl;
#define Fast ios_base::sync_with_stdio(0), cin.tie(0);
using namespace std;
const int N= 1e5+5,OO = 2*0x3f3f3f3f,mod =1000000007;
const int cons = 11 ,max_cons = 30... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | dd54fa11119312ec97f8f0e7d1781967 | 900 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define yes cout << "YES"<<endl;
#define no cout << "NO" << endl;
#define Fast ios_base::sync_with_stdio(0), cin.tie(0);
using namespace std;
const int N= 1e5+5,OO = 2*0x3f3f3f3f,mod =1000000007;
const int cons = 11 ,max_cons = 30... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | 84025d634d54072589d4914d60c77a7e | 900 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define yes cout << "YES"<<endl;
#define no cout << "NO" << endl;
#define Fast ios_base::sync_with_stdio(0), cin.tie(0);
using namespace std;
const int N= 1e5+5,OO = 2*0x3f3f3f3f,mod =1000000007;
const int cons = 11 ,max_cons = 30... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | 797513443416f4b0ff74b21397555b82 | 900 | PASSED |
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define yes cout << "YES"<<endl;
#define no cout << "NO" << endl;
#define Fast ios_base::sync_with_stdio(0), cin.tie(0);
using namespace std;
const int N= 1e5+5,OO = 2*0x3f3f3f3f,mod =1000000007;
int main()
{
Fast
// fre... | C++ | 9c86925036cd1f83273bc21e2ea3e5c8 | 411f2fdbadd7f50c2afa032a2ccde2a3 | 900 | PASSED |
#ifdef LOCAL
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define dbg(x...)
#endif
#define int long long
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define endl "\n"
int32_t main() {
ios::sync_w... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | c5bd020f66f2ddb6b6df3177607916a9 | 1,500 | PASSED |
#include <bits/stdc++.h> //Enjoy coding,don't be disturbed by boring rank and contest
using namespace std;
typedef long long ll;
const ll Mod = 1e9 + 7;
const ll Maxn = 2e6 + 10;
const ll INF = 1e18;
#define mpr make_pair
#define pii pair <int,int>
using pll = pair<ll, ll>;
int n, r1, c1, r2, c2, r3, ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | dbd8220864e37f697910234811a7488a | 1,500 | PASSED |
#include <bits/stdc++.h> //Enjoy coding,don't be disturbed by boring rank and contest
using namespace std;
typedef long long ll;
const ll Mod = 1e9 + 7;
const ll Maxn = 2e6 + 10;
const ll INF = 1e18;
#define mpr make_pair
#define pii pair <int,int>
using pll = pair<ll, ll>;
int n, r1, c1, r2, c2, r3, ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | e982a4bbbe8a01836c7a44e8d7a55231 | 1,500 | PASSED |
#include <bits/stdc++.h> //Enjoy coding,don't be disturbed by boring rank and contest
using namespace std;
typedef long long ll;
const ll Mod = 1e9 + 7;
const ll Maxn = 2e6 + 10;
const ll INF = 1e18;
#define mpr make_pair
#define pii pair <int,int>
using pll = pair<ll, ll>;
int n, r1, c1, r2, c2, r3, ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | 268a8f58ab5d5e2387323ec57670ae8b | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<ll,ll>
const int N=3e5+100;
ll t,n,m,k;
string s;
ll a[N], b[N];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>t;
while(t--)
{
cin>>n;
vector<int> r(3), c(3);
... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | 340d6a1fa9480d715c9c26d6a7721e22 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define f0(e) for(int i = 0; i < (e); ++i)
#define f1(e) for(int i = 1; i <= (e); ++i)
#define f2(i,e) for(int i = 0; i < (e); ++i)
#define fr(i,a,b) for ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | ff9c7f8a621f9b0d6b99c87d6ba565ce | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define f0(e) for(int i = 0; i < (e); ++i)
#define f1(e) for(int i = 1; i <= (e); ++i)
#define f2(i,e) for(int i = 0; i < (e); ++i)
#define fr(i,a,b) for ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | 5b0950a687334ec817c79b48a12fed1e | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pr<ll,ll>
#define vll vector <ll>
#define vii vector <ll>
#define tests ll t;cin>>t; while(t--)
#define yes cout << "YES\n"
#define no cout << "NO\n"
// vector<vector<ll>> vis(501,vector<ll>(501,0));
// vector<vector<ll>> pos(50... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | a4e01cdd23574497d7e2027414c8962c | 1,500 | PASSED |
/************KESHAV GARG***********/
/****TRY EXTRA HARDER EVERYTIME****/
#include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
// #define ll long long int
// #define ll ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | 562a3e3814070c090ffdb33ee37e1616 | 1,500 | PASSED |
/************KESHAV GARG***********/
/****TRY EXTRA HARDER EVERYTIME****/
#include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
// #define ll long long int
// #define ll ... | C++ | e5a0005e0832e2ca3dd248f6aefb2238 | ec12c600e95428d76548c785422b3230 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
using namespace std;
const int N ... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 03d77c566928e821ac5b2a67fa1bd84b | 3,300 | PASSED |
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
long long t,l,r,a,b,c,d,n,p[20],i,m,j;
vector <long long> V[1300000];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>t;
while(t--){
cin>>m;c=0;
for(i=1;i<=m;i+... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 429b2e33fc4fc2129f2dedb5cf042a79 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("-O3")
int m, b[18], check[18], cnt[5];
vector<int>v;
vector<vector<int>>a;
void initialize(int m)
{
fill(b, b+m+1, 0);
fill(check, check+m+1, 0);
fill(cnt, cnt+5,0);
v.clear();
a.clear();
}
void insert1(int p1, int c1)
{
v[p1] = c1;
a.push_b... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 133e90bd399d4edbd0e5fca4f67cac50 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void chmin(T& x, const T& y) {
if (x > y) x = y;
}
template<typename T>
void chmax(T& x, const T& y) {
if (x < y) x = y;
}
typedef int64_t s64;
typedef uint64_t u64;
typedef uint32_t u32;
typedef pair<int, int> pii;
#define rep(i... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | e5f0aad3408f0deb81a095c065867c9c | 3,300 | PASSED |
#include <stdio.h>
#include <vector>
using namespace std;
int a[1000], n, pos1, pos;
void print_ans(vector<vector<int>> &res) {
for(vector<int> &v : res) {
for(int elem : v) printf("%d ", elem);
printf("\n");
}
}
void push_all(vector<vector<int>> &to, vector<vector<int>> from) {
vector<int> first;
... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 5e56ead03ab24f7f6b4cf435a8f45714 | 3,300 | PASSED |
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define X first
#define Y second
const ll mod = 1000000007;
//const ll mod = 998244353;
ll gcd(ll a, ll b)
{
a = abs(a);
b = abs(b);
if (a==0 or b==0) return... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 034be26f89e25a46e8ce7d6b148db68c | 3,300 | PASSED |
/*
_/ _/ _/_/_/ _/ _/ _/ _/_/_/_/_/
_/ _/ _/ _/ _/ _/ _/ _/
_/ _/ _/ _/ _/ _/ _/
_/_/ _/ _/ _/ _/_/_/_/
_/ _/ _/ _/ _/ _/
... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 5219bc6bbb0f63f65c2a209e493ab500 | 3,300 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | c9a13de044963d5829cca533746090b6 | 3,300 | PASSED |
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define F first
#define S second
#define ll long long
#define N (1<<20)+10
using namespace std;
vector<ll> sz[N];
ll a[N],ans[N][16],n,m;
int main(){
ll T,i,j,k;
scanf("%lld",&T)... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 540192a93b9eb1aa3810d18747607aa3 | 3,300 | PASSED |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define forn(i, n) for(int i = 0; i < n; ++i)
const int MOD = 1000000007;
us... | C++ | b5bfe2090f8ca8c84cce018781d9ed4e | 4e7e74e7fb996f638f01fc93a3b6ad92 | 3,300 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | C++ | 783aa30db9c781b81f4222b5a22a259e | 7ac0656f5c64ae1f28295e5092d08c41 | 3,500 | PASSED |
/*
Author: QAQAutoMaton
Lang: C++
Code: G.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define int long long
#define debug(qaq...) fprintf(stderr,qaq)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,... | C++ | 783aa30db9c781b81f4222b5a22a259e | 81aba3e7560c50f1b9d2f7d9cd0d0073 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 inf = 2e18;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 100005;
int n, d, q, x[N];
char s[N];
struct query {
int t, k, id;
inline bool operator<(const query &rhs) const {
... | C++ | 783aa30db9c781b81f4222b5a22a259e | 36b73fb36488be247be5722d8d82cf06 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 inf = 2e18;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 100005;
int n, d, q, x[N];
char s[N];
struct query {
int t, k, id;
inline bool operator<(const query &rhs) const {
... | C++ | 783aa30db9c781b81f4222b5a22a259e | a8e63b96b18ba1cdfeb8de189917fca2 | 3,500 | PASSED |
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a... | C++ | 783aa30db9c781b81f4222b5a22a259e | ec797caf268e70b955ea539606bec46c | 3,500 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
const int BUFFER = 1 << 18;
struct ostream
{
char buffer[BUFFER], *pos = buffer, *end = buffer + BUFFER;
~ostream() { flush(); }
void flush() { fwrite(buffer, 1, pos - buffer, stdout), pos = buffer; }
void put(char ch)
{
if (pos == end)
... | C++ | 783aa30db9c781b81f4222b5a22a259e | 1d3ee4559ce286014cbc39905996e505 | 3,500 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
const int BUFFER = 1 << 18;
struct ostream
{
char buffer[BUFFER], *pos = buffer, *end = buffer + BUFFER;
~ostream() { flush(); }
void flush() { fwrite(buffer, 1, pos - buffer, stdout), pos = buffer; }
void put(char ch)
{
if (pos == end)
... | C++ | 783aa30db9c781b81f4222b5a22a259e | 54b2c3e816025ff3161175c247bff65c | 3,500 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
const int BUFFER = 1 << 18;
struct ostream
{
char buffer[BUFFER], *pos = buffer, *end = buffer + BUFFER;
~ostream() { flush(); }
void flush() { fwrite(buffer, 1, pos - buffer, stdout), pos = buffer; }
void put(char ch)
{
if (pos == end)
... | C++ | 783aa30db9c781b81f4222b5a22a259e | 76708e605b241bfd0b528d0bdf485260 | 3,500 | PASSED |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;
template <typename T>
inline void read(T &f) {
f = 0; T fu = 1; char c = g... | C++ | 783aa30db9c781b81f4222b5a22a259e | 2415c431caa4a70861faddd36cee5cff | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
class node {
public:
int id;
node* l;
node* r;
node* p;
bool rev;
int sz;
// ... | C++ | 783aa30db9c781b81f4222b5a22a259e | 154623f1337afe630464db1ae1f28f22 | 3,500 | PASSED |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1000111222;
const int max_n = 211;
struct point {
int x, y;
};
ll get_sqr(const point& p1, const point& p2, const point& p... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 39372e1b1b1badad1cf86368effbb024 | 3,000 | PASSED |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1000111222;
const int max_n = 211;
struct point {
int x, y;
};
ll get_sqr(const point& p1, const point& p2, const point& p... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 8d25a2320bd05fbf32dd7b5bab5f75cd | 3,000 | PASSED |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1000111222;
const int max_n = 211;
struct point {
int x, y;
};
ll get_sqr(const point& p1, const point& p2, const point& p3) {
ll res = 0;
res... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 2a223fbd2dfdc1ebe2438673f47a861a | 3,000 | PASSED |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1000111222;
const int max_n = 211;
struct point {
int x, y;
};
ll get_sqr(const point& p1, const point& p2, const point& p... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 57ed4a78f68a8d3d48921adc161a89f6 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int inf = 1e9;
const ll inf64 = 1e18;
struct pt {
int x = 0;
int y = ... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 813b7ac0565d16ec5e85d7ef0a252283 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
struct point {
int x, y;
friend point operator - (const point& a, const point& b) {
return {a.x - b.x, a.y - b.y};
}
friend constexpr long long cross(const point& a, const point& b) {
return (long long) a.x * b.y - (long long)... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | adddb395416a762b24c33e19f526aaed | 3,000 | PASSED |
/*input
8 4
-2 -4
2 -2
4 2
1 5
0 5
-4 4
-5 0
-5 -1
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tre... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 14c0099fc7dd519ff607787f269ef5f8 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 679078ada6fb7f0630b2818b0f79e6bc | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 1eaf993f8bb042d82232a694c80c9a7a | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define... | C++ | 5b829e1cfac5d61ace35e671ad9d0af9 | 22428cc9f9952145ac0e9d594a23ce47 | 3,000 | PASSED |
#include<iostream>
#include<cstdio>
#define N 200005
#define ll long long
using namespace std;
int n,q;
namespace segtree{
ll tree[N<<2],tag[N<<2];
void build(int rt,int l,int r){
if(l==r){
tree[rt]=1;
return;
}
int mid=l+r>>1;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
tree[rt]=tre... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 3f642c21757b37e5fbf37b0a5a9c6269 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+20 ;
#define ll long long
#define lll __int128
#define lb long double
#define D double
#define psb push_back
#define mkp make_pair
#define min3(xxx,yyy,zzz) min(min(xxx,yyy),zzz)
#define max3(xxx,yyy,zzz) max(max(xxx,yyy),zzz)
#define gi gr... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | bbeb7c9ae412fb74851a0bda27e2d699 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+20 ;
#define int long long
#define ll long long
#define lll __int128
#define lb long double
#define D double
#define psb push_back
#define mkp make_pair
#define min3(xxx,yyy,zzz) min(min(xxx,yyy),zzz)
#define max3(xxx,yyy,zzz) max(max(xxx,yyy... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 86443db9447ec0b1e5c18702aeb9a43f | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=200025;
const int INF=1e9;
int n,m,i,j,t,k,s;
//tree I:b array
ll segb[maxn<<2];int lazb[maxn<<2],len[maxn<<2];
//tree II:seg beats for w
int mx[maxn<<2],smx[maxn<<2],mlaz[maxn<<2];
int tmx[maxn<<2];
void build(int rt,int l,i... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 37056a12bbabcf7896ca7fd4de15aa10 | 3,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "mmx,sse,sse2,sse3,sse4,avx,avx2,fma,abm,popcnt,tune=native" //#pragma GCC optimiz... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 1e0f241ce16d48b77904e64b5debf448 | 3,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "mmx,sse,sse2,sse3,sse4,avx,avx2,fma,abm,popcnt,tune=native" //#pragma GCC optimiz... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 515530191d90e9fd8aff3ac80538f33d | 3,400 | PASSED |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,po... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 8f39ff4579467d82d54fce079d146abf | 3,400 | PASSED |
#include <bits/stdc++.h>
#define rep(i,n) for(register int i=0;i<n;++i)
#define repn(i,n) for(register int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 06213db494a861c3344818db32e941b1 | 3,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for (int i=(a);i<=(n);i++)
#define per(i,a,n) for (int i=(n);i>=(a);i--)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define lowbi... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | b4a647cf1a91e9dc1dd8afa4b9f07721 | 3,400 | PASSED |
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int lz[4 * N], tot[4 * N], n;
struct node {
int m1, m2, c;
} t[4 * N];
///////
void Push(int u, int l,int r) {
if(!lz[u]) return;
... | C++ | 8114fe999e5a2d65b16467a6029c00f1 | 23cd1d980228877494335711c7685036 | 3,400 | PASSED |
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define INF INT_MAX
#define ENF INT_MIN
#define llINF 1e17
#define loop(i,n) for(int i=1 ; i<=n ; i++)
#define loop0(i,n) for(int i=0 ; i<n ; i++)
#define debug(arr, n) for(int i=1 ; i<=n ; i+... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | ba38a6a9f8d86df6bf9e41259329435d | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve(){
string s;
cin >> s;
int n = s.length();
map<char, char> m;
m[s[0]] = '(';
if(s[0] == s[n-1]){
cout << "NO\n";
return;
}
m[s[n-1]] = ')';
int left = 0, open = 0, close = 0;
char c;
for(int i = 0; i ... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | 6252b732c719251b1718c35da8d0d422 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s, temp;
char c[2] = {'(', ')'};
void solve(){
cin >> s;
temp = s;
for(int i=0; i<=1; i++){
for(int j=0; j<=1; j++){
for(int k=0; k<=1; k++){
for(int id=0; id<s.size(); id++){
... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | 3aa5ee922cfbbb2f631b45e1c9d24078 | 900 | PASSED |
#include<bits/stdc++.h>
/*
Writher:ZhengZhiLin
Time:2022-09-06-25
*/
#define int long long
#define for1(i,a) for(int i=0; i<a ; i++)
#define for2(i,a,b) for(int i=a; i<b ; i++)
#define for3(i,a,b,c) for(int i=a; i<b ;i+=c)
#define len(x) ll(x.size())
const int base=131;
int lowbit(int x) {return x & (-x);}
inline int... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | 08bf73e47ef2e7ce69f26d194ff3b181 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t;
int main()
{
cin>>t;
while(t--)
{
string s;
cin>>s;
bool succ=false;
for(int i=1;i<=6;i++)
{
bool f=false;
unordered_map<char,char>trans;
if(i==1)
{
trans['A']='(';
trans['B']='(';
trans['C']=')';
}
else if(i==2)
{
... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | 6f4b98b12f0cab1ec0dab5dab79506fa | 900 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<functional>
using namespace std;
const int N=1e6;
typedef long long ll;
ll a[N];
void solve(){
string s;
cin>>s;
int n=s.size();
int cnt1=0,cnt2=0,cnt3=0;
bool f=0;
int sum1=0,sum2=0,sum3=0;
for(int i... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | 8a83173bd8837ab969cabe97afe924de | 900 | PASSED |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int t;
cin >> t;
while(t --)
{
string s;
cin >> s;
int t = 0;
int f = 0;
int a[3] = {0};
for(int i = 0; i < s.size(); i ++) a[s[i] - 'A'] ++;
char id;
for(int i = 0; i <... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | 68d6675849d59afb1d476a00ad31ed79 | 900 | PASSED |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int t;
cin>>t;
while(t--) {
string j;
cin>>j;
if(j[0]==j[j.size()-1])
cout<<"NO"<<'\n';
else {
string q1="",q2="";
char m=j[0],n=j[j.size()-1];
... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | eee9b72f4cbe1767f35851de9ba96f55 | 900 | PASSED |
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=55;
int t;
char str[maxn];
int has[256];
int main(){
scanf("%d",&t);
while(t--){
scanf("%s",&str);
int n=strlen(str);
for(int i=0;i<n;i++){
has[str[i]]++;
}
int p;
for(int i='A';i<='C';i++){
if(has[i]>=n/2){
... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | d29aabfd1adc42e4959fd80007960d41 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int ,int > PII;
const int MAXN=1e5+10;
const int INF=0x3f3f3f3f;
int T,n,m,k,x;
string s, t;
bool check(char *s) {
char stk[MAXN],top=0;
for(int i=0; s[i]; i++) {
if(s[i]=='(') stk[++top]='(';
else if(!top||stk[top--]==')') return... | C++ | 4d24aaf5ebf70265b027a6af86e09250 | ce7970c64c4afff24d4b14a198a444e4 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, u, r, d, l, north, east, south, west, northeast, southeast, southwest, northwest;
void solve(){
cin >> n >> u >> r >> d >> l;
... | C++ | 1c94596da439c56b56e59da36734a912 | 9d6a8c44f81afe79f95dcf9059390338 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
int n, u, r, d, l;
bool check(){
for(int i=0; i<=1; i++){
for(int j=0; j<=1; j++){
for(int k=0; k<=1; k++){
for(int m=0; m<=1; m++){
int cu = u;
int cr = r;
int cd = d;
int cl = l;
// cout<<cu<<' '<<cr<... | C++ | 1c94596da439c56b56e59da36734a912 | 5e14def64e72e42876d06c613af79f82 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORO(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 10000... | C++ | 1c94596da439c56b56e59da36734a912 | 2feadd22b5c839f98f6f86ab2d2ac49f | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t;
while(t--){
int n,U,R,D,L;
cin >> n >> U >> R >> D >> L;
if(n-2 >= max({U,R,D,L})){
cout << "YES\n";
continue;
}
vector<int> idxs = {0,1... | C++ | 1c94596da439c56b56e59da36734a912 | 802f87cf99028eb3b645563155c6656a | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector<int>d(4), f(4, 0);
cin >> d[0] >> d[1] >> d[2] >> d[3];
f[0] = d[0];
if (d[0] >= n - 1) {
if (d[0] == n - 1) {
if (d[1] - f[1] < d[3] - f[... | C++ | 1c94596da439c56b56e59da36734a912 | 5e032d8fb4205b7136c90cdbb39e13f8 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define al... | C++ | 1c94596da439c56b56e59da36734a912 | 2ada6f59a5aec4c48487bf3f5ca73bf8 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,U,R,D,L,k;
bool st;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>U>>R>>D>>L;
st=true;
if(n==1)
{
if(!(U==1 && R==1 && D==1 && L==1)) st=false;
}
else
{
int cnt=0;
k=n-2;
if(U-k==2) L--,R--;
if(U-k==1) cnt++;
if(D-k==2) L--,R--;
... | C++ | 1c94596da439c56b56e59da36734a912 | a5179a9c87b19ca5188674dd84840a1a | 1,400 | PASSED |
#include<bits/stdc++.h>
#define lson rt<<1
#define rson rt<<1|1
#define pb push_back
#define x first
#define y second
#define llINF 9223372036854775807
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int main()... | C++ | 1c94596da439c56b56e59da36734a912 | e29a3038cb77f7287b23a8b5da35d30f | 1,400 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define dbg(x) cout << #x << " = " << x << endl;
const int maxn = 3e5 + 7;
#define lowbit(x) (x&(-x))
int t, n, u, r, d, l;
int a[4];
bool check(int x)
{
return x >= 0 && x <= n - 2;
}
bool dfs(int dp)
{
if (dp == 4)
{
i... | C++ | 1c94596da439c56b56e59da36734a912 | 2fe726e60b09ff337a23ca04c3b9be76 | 1,400 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t;
cin>>t;
while(t--)
{
ll n,a,b,c,d;
cin>>n>>a>>b>>c>>d;
bool ans=false;
for(int i=0; i<2; i++)
... | C++ | 1c94596da439c56b56e59da36734a912 | 6aecebff1c8dee2c5fda4595db66dae6 | 1,400 | PASSED |
// LUOGU_RID: 94350830
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
using ll = long long;
const int maxn = 2e5 + 10;
int res[maxn],q1[maxn],q2[maxn],n1,n2,nn1,nn2;
vector<int> neg,pos,nres,pres;
inline int range(int l,int r,int s)
{
if(s)
{
int l1=0,r1=n1-1;
if(pos[... | C++ | a2b99448d6267a66bddfdcad9add311b | 00fed41a2da5421f9fb1b6060c2231ff | 1,900 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2... | C++ | a2b99448d6267a66bddfdcad9add311b | 15010e9e9f99b04567ac423798b7f15f | 1,900 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.