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 |
|---|---|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(A) A.rbegin(),A.rend()
#define pb push_back
#define dbg(x) do {cerr << #x <<" = " << (x) << endl; } while (false)
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
/... | C++ | fad12986a0a97a96109734fdce3bd7a7 | ff9ca21eceb0e28424fd38c74bd178c7 | 2,300 | PASSED |
// LUOGU_RID: 95095533
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int mx = (int)1e5;
constexpr int mod = 998244353;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
auto qpow = [](int x, int e) {
int y = 1;
for (; e; e >>= 1, x = (i64)x * x % mod) {
if (... | C++ | fad12986a0a97a96109734fdce3bd7a7 | abf8f7004899d4dd65a241c55b8f56d7 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int mx = (int)1e5;
constexpr int mod = 998244353;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
auto qpow = [](int x, int e) {
int y = 1;
for (; e; e >>= 1, x = (i64)x * x % mod) {
if (e & 1) {
... | C++ | fad12986a0a97a96109734fdce3bd7a7 | 042f5a7386420e941aace6ae68a380c4 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int P = 998244353;
template <class T> T qp(T a, int b) {
T c = 1;
for (; b; b /= 2, a *= a) {
if (b % 2) c *= a;
}
return c;
}
struct mint {
int x;
mint(int _x = 0) : x(_x % P) { x < 0 ? x += P : 0; }
int val() co... | C++ | fad12986a0a97a96109734fdce3bd7a7 | 422aabc9daea640964f4dc793d1825d4 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N=1e5+10,P=998244353;
int t,n;
ll a[N],fac[N],inv[N];
ll ksm(ll a,ll b){
ll ans=1;
while(b){
if(b&1)ans=ans*a%P;
a=a*a%P;
b>>=1;
}
return ans;
}
void init(){
fac[0]=1;
for(int i=1;i<N;i++){
fac[i]=fac[... | C++ | fad12986a0a97a96109734fdce3bd7a7 | c41a53a48fc1b428147b762095f86178 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N=1e5+10,P=998244353;
int t,n;
ll a[N],fac[N],inv[N];
ll ksm(ll a,ll b){
ll ans=1;
while(b){
if(b&1)ans=ans*a%P;
a=a*a%P;
b>>=1;
}
return ans;
}
void init(){
fac[0]=1;
for(int i=1;i<N;i++){
fac[i]=fac[... | C++ | fad12986a0a97a96109734fdce3bd7a7 | 2c7b6f4fdf3b9038a40d55aee706ab43 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N=1e5+10,P=998244353;
int t,n;
ll a[N],fac[N],inv[N];
ll ksm(ll a,ll b){
ll ans=1;
while(b){
if(b&1)ans=ans*a%P;
a=a*a%P;
b>>=1;
}
return ans;
}
void init(){
fac[0]=1;
for(int i=1;i<N;i++){
fac[i]=fac[... | C++ | fad12986a0a97a96109734fdce3bd7a7 | e10041a85a5b3d7eb3f54c3e3632446d | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 998244353;
long long power(long long a, long long b)
{
if (b == 0) return 1;
long long t = power(a, b / 2);
t = t * t % MOD;
if (b % 2 == 1) t = t * a % MOD;
return t;
}
void solve()
{
int n;
scanf("%d", &n);
vector<l... | C++ | fad12986a0a97a96109734fdce3bd7a7 | 242b09bf5956d204f9a78ca772815515 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define rep(a, b, c) for (int a = b; a < (c); a++)
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
struct eertree {
vi s, rem;
struct node {
int len = 0, link = 0, from = 0... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 2ba0888352c68f99962c85a2f964411a | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define rep(a, b, c) for (int a = b; a < (c); a++)
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
struct eertree {
vi s, rem;
struct node {
int len = 0, link = 0, from = 0... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 6240d7934e138dd38f893f777d0b152d | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define rep(a, b, c) for (int a = b; a < (c); a++)
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
struct eertree {
vi s, rem;
struct node {
int len = 0, link = 0, from = 0... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 947abbe72456e0ea30cf263676e1def4 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define rep(a, b, c) for (int a = b; a < (c); a++)
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
struct eertree {
vi s, rem;
struct node {
int len = 0, link = 0, from = 0... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 564355bfefa88816b231af182ed04d28 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
vector<int> suffix_array(const vector<int> &A, int mx){
int N = A.size();
vector<int> sum(mx + 1, 0);
for (int i = 0; i < N; i++){
sum[A[i] + 1]++;
}
for (int i = 0; i < mx; i++){
sum[i + 1] += sum[i];
}
vector<b... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 043b96f620972e7139ba3ecf96fc4256 | 3,300 | PASSED |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
vector<int> suffix_array(const vector<int> &A, int mx){
int N = A.size();
vector<int> sum(mx + 1, 0);
for (int i = 0; i < N; i++){
sum[... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 977535b001d3e5227e46fe4dcdfd2c38 | 3,300 | PASSED |
#include <vector>
#include <utility>
#include <string>
#include <cstring>
#include <iostream>
// Sigma = {'a', 'b', ..., 'z'}
struct Node {
int len;
int slink;
int inSL;
int parent;
int bp;
int ch[26];
char pchar;
Node() {
memset(ch, 0, sizeof(ch));
bp = -1;
inSL = 0;
... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | ce040bf87990fa78a6cb60147cf8b7eb | 3,300 | PASSED |
#include <vector>
#include <utility>
#include <string>
#include <cstring>
#include <iostream>
// Sigma = {'a', 'b', ..., 'z'}
struct Node {
int len;
int slink;
int inSL;
int parent;
std::pair<int, int> bp;
int ch[26];
char pchar;
Node() {
memset(ch, 0, sizeof(ch));
bp = std::... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | bdd0500ef49e43c078ccfcac7cc3fd94 | 3,300 | PASSED |
#include<bits/stdc++.h>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) ... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | 6fc86305b0d5fc42822c8dd3e23f4d86 | 3,300 | PASSED |
#include<bits/stdc++.h>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) ... | C++ | fd5fd38a69a0f645c5e092a15de67f88 | a0d6b16a7104946d1242b6ffc3543757 | 3,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
#define fi first
#define se second
#define sz(c) ((int)(c).size())
#define all(c) (c).beg... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | 720354a5d3e40d5e73fb333593b4cddd | 2,400 | PASSED |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN=2000;
vector<int> parent(MAXN, -1);
void make_set(int v) {
parent[v] = v;
}
int find_set(int v) {
if (v == parent[v]){
return v;
}
return parent[v] = find_set(par... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | 4d4460c9e8261869521070dd02f1c3d6 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define int long long
#define inf 1e18
#define ick cout<<"ickbmi32.9\n"
using namespace std;
bool isprime(int k) {
for(int i = 2; i <= sqrt(k); i++) if(k % i == 0) return false;
return true;
}
... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | a9bb03e7433c14988a3634a8a7eff2da | 2,400 | PASSED |
// Problem: F. Connectivity Addicts
// Contest: Codeforces - Codeforces Global Round 22
// URL: https://codeforces.com/contest/1738/problem/F
// Memory Limit: 512 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define dbg(x...) \
... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | f37dbcc9d4d99c087b19161ae25fbbb2 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define inf 1023456789
using namespace std;
inline int read(){
int ret=0,ff=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') ff=-1;ch=getchar();}
while(isdigit(ch)){ret=ret*10+(ch^48);ch=getchar();}
return ret*ff;
}
struct node{
int i... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | cb89a59553c973a1513cb065d447cdc4 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int i,j,k,n,m,t,it,d[1005],fa[1005],vis[1005];
int find(int x){return (fa[x]==x)?x:fa[x]=find(fa[x]);}
map<int,int> mp;
int main(){
ios::sync_with_stdio(0);
cin>>t;
while(t--){
cin>>n;
vector<pair<int,int> >v;
it=0;
mp.c... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | 9cc5821d8d339abf5460a968242d5a97 | 2,400 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
#define elif else if
#define ALL(x) x.begin(),x.end()
#define lowbit(x) (x&(-x))
using namespace std;
void fileio(const string &s)
{
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int INF=4e1... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | f8b338b2c169798abc9c6f748e2f38ae | 2,400 | PASSED |
//太阳出来我晒太阳，月亮出来我晒月亮咯~
//大丘丘病了，二丘丘瞧。三丘丘采药，四丘丘┗|｀O′|┛ 嗷~~.
//If I can't Accept this problem in ten times.Rice_porridge will wear Lolita.
//发扬类人智慧
/*
太陽の傾いたこの世界で
-broken chronograph-
空の上の森の中の
-late autumn night’s dream-
この戦いが終わったら
-starry road to tomorrow-
帰らぬ者と、待ち続けた者たち
-dice in pot-
誰も彼もが、正義の名のもとに
-... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | 58c576269418f2872d7672087a958686 | 2,400 | PASSED |
#include "bits/stdc++.h"
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
/*
⠄⠄⠄⢰⣧⣼⣯⠄⣸⣠⣶⣶⣦⣾⠄⠄⠄⠄⡀⠄⢀⣿⣿⠄⠄⠄⢸⡇⠄⠄
⠄⠄⠄⣾⣿⠿⠿⠶⠿⢿⣿⣿⣿⣿⣦⣤⣄⢀⡅⢠⣾⣛⡉⠄⠄⠄⠸⢀⣿⠄
⠄⠄⢀⡋⣡⣴⣶⣶⡀⠄⠄⠙⢿⣿⣿⣿⣿⣿⣴⣿⣿⣿⢃⣤⣄⣀⣥⣿⣿⠄
⠄⠄⢸⣇⠻⣿⣿⣿⣧⣀⢀⣠⡌⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⣿⣿⣿⠄
⠄⢀⢸⣿⣷⣤⣤⣤⣬⣙⣛⢿⣿⣿⣿⣿⣿⣿⡿⣿⣿⡍⠄⠄⢀⣤⣄⠉⠋⣰
⠄⣼⣖⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⣿⣿⣿⣿⣿⢇⣿⣿⡷⠶⠶⢿⣿⣿⠇⢀⣤
⠘... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | 1be224e36360262b7cd94505e8f2c81f | 2,400 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e... | C++ | cb05d81d82d16ac3fdf8ec33e69d5ae8 | 4efc1632de66a6ce5ce1ca3449def8b3 | 2,400 | PASSED |
//BISMILLAH
/*
1.TRY TO SOLVE BY YOURSELF
2.MAKE SOME OBSERVATION
3.CHECK CORNER CASE
*/
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define rr return
#define fr(m) for(int i=1;i<=m;i++)
#define frr(m) for(int i=0;i<m;i++)
using namespace std;
vo... | C++ | c247c7c382c243ab6b991c4a11bfc421 | c4267ecf06388c171efd6f545f5ec86d | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin>>n;
vector<int> arr(n);
int ones = 0;
for(int i=0; i<n; i++){
cin>>arr[i];
if(arr[i]==1) {
ones++;
}
}
int op = 0;
int i=n-1;
while(ones){
if(arr[i]==0){
... | C++ | c247c7c382c243ab6b991c4a11bfc421 | 55c06d60850592cb9246c1cfc4798a14 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int test;
cin>>test;
while(test--)
{
int num;
cin>>num;
int arr[num];
for(int i=0;i<num;i++)
{
cin>>arr[i];
}
int i=0;
int j=num-1;
int r=0;
... | C++ | c247c7c382c243ab6b991c4a11bfc421 | 5501626e8d9c130b12cc7500b470262c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
cin>>T;
while(T!=0)
{
int n,x;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int i,j,c=0,d=n-1;
for(i=0;i<n;i++)
... | C++ | c247c7c382c243ab6b991c4a11bfc421 | c25dde5022721857d41781c878a525e9 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define fo(g,a,b) for(int g=a;g<=b;g++)
#define of(g,a,b) for(int g=a;g>=b;g--)
signed main()
{
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int T;int a[100001];
cin>>T;
while(T--)
{
int n;
cin>>n;
fo(i,1,n){
cin>>a[i];
a... | C++ | c247c7c382c243ab6b991c4a11bfc421 | ea4dc89881a0db9ce6eacf69d18f4cdf | 800 | PASSED |
// BELIEVE IN YOURSELF (●'◡'●)❤
// Always Search ◑﹏◐
// ECPC - ACPC - ICPC
// programming needs you pationt so don't give up.
// Everything good comes after a hard work.
// Think twice, Code once!✔
/*
"❤--Salma Hatem--❤"
*/
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define TestCases int t; cin >> t;... | C++ | c247c7c382c243ab6b991c4a11bfc421 | 10c4446ece5d96741774001100b0a198 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int maxn = 2e5 + 10;
int a[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int _;
cin >> _;
while(_--) {
int n;
cin >> n;
for(int... | C++ | c247c7c382c243ab6b991c4a11bfc421 | a250680fa9abb7488db3759a73e55a25 | 800 | PASSED |
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int d[10000];
int main(){
int T;
cin >> T;
int n, k;
int sum;
while(T--){
int n;
cin >> n;
int num[n], cnt[2][n+1];
cnt[0][0] = cnt[1][0] = 0;
for(int i = 0; i < n; i++){
... | C++ | c247c7c382c243ab6b991c4a11bfc421 | e17a3868c0dba07a07ca5fad6b310457 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int t; cin >> t;
while (t--) {
int n; cin >> n;
deque<int> dq;
for (int i = 1; i <= n; ++i) {
int x; cin >> x;
if (x) dq.push_back(i);
}
int last = n + 1, ans = 0;
while (not dq.e... | C++ | c247c7c382c243ab6b991c4a11bfc421 | 7102ce09e27200eef433e6ed0107381b | 800 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef int ii;
typedef unsigned long long ull;
typedef long long int lint;
typedef pair<int, int> pi;
typedef pair<ll, l... | C++ | c247c7c382c243ab6b991c4a11bfc421 | 3639ef1a73bdcb15686bc26602c9f3f6 | 800 | PASSED |
import java.util.*;
public class Main{
public static void main(String[] args) {
// Use the Scanner class
Scanner sc = new Scanner(System.in);
int ntests = sc.nextInt(); // read input as integer
for (int i=0;i<ntests;i++){
int n = sc.nextInt();
... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | ac820cc2adfa0b20ed3ae6be12f3e50f | 800 | PASSED |
import java.util.*;
public class Solution {
private static void getAnswer(int[] nums, int k){
boolean hasOne=false,hasZero=false;
for(int num:nums){
if(num==1){
hasOne=true;
}else{
hasZero=true;
}
}
System... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | b1e10710b0c4e1e34087c6b2c035243a | 800 | PASSED |
import java.util.Arrays;
import java.util.Scanner;
public class cf {
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
// System.out.println("test case");
int test=sc.nextInt();
for (int k=0;k<test;k++) {
// System.out.println("array len... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | 0e097bf2a47b63eaf7b787987383ca58 | 800 | PASSED |
//package Problems;
import java.io.*;
import java.util.*;
public class Anurag {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t-->0) {
int n=sc.nextInt(),k=sc.nextInt();
int[] a=new int[n];
int flag=0;
for(int i=0;i<n;i++) {
a[i]=sc.nextI... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | b4b89e6074ae8209a939892f4a7c8704 | 800 | PASSED |
import java.util.Scanner;
public class CODE {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int t = scanner.nextInt();
while (t>0) {
int n = scanner.nextInt();
int[] a = new int[n];
int k = scanner.nextInt();
... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | dc3eab42b1fe488448d5bdcdf603cd79 | 800 | PASSED |
import java.util.Scanner;
public class CODE {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int t = scanner.nextInt();
while (t>0) {
int n = scanner.nextInt();
int[] a = new int[n];
int k = scanner.nextInt();
... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | ec383883501b407e14f627650e7e4d17 | 800 | PASSED |
import java.util.Scanner;
public class CODE {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int t = scanner.nextInt();
while (t>0) {
int n = scanner.nextInt();
int[] a = new int[n];
int k = scanner.nextInt();
... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | 96b7c9fd16f4fda7b445ddb37d15c44b | 800 | PASSED |
import java.util.Scanner;
public class A1746 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int cases = sc.nextInt();
while(cases --> 0) {
int nums = sc.nextInt();
int chances = sc.nextInt();
int sum = 0;
while... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | 89d4a3c7ca4a5019735b4319515f8e3d | 800 | PASSED |
//package Algorithm;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.ut... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | 9b98472c687d22a72de54956abaabb1c | 800 | PASSED |
import java.io.*;
import java.util.*;
public class MyClass {
public static void main(String args[]) {
Scanner br = new Scanner(System.in);
int t = br.nextInt();
while(t-->0) {
int n = br.nextInt();
int k = br.nextInt();
int count = 0;
... | Java | 95d83cfdb2131f2f23ba5ef005c18b38 | 8b31f0ce81fbc3fa5e318ef4004aa799 | 800 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N = 200010;
int ne[N], e[N], idx, h[N];
typedef long long LL;
LL a[N], f[N][2];
int s[N];
bool cmp(LL x, LL y){
return x > y;
}
void add(int a, int b){
e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
LL... | C++ | 9089fb2547751ca140a65f03fe78c916 | 81f298dac258236657f5ab3ece18b719 | 1,900 | PASSED |
// LUOGU_RID: 91100137
#include <bits/stdc++.h>
#define re register
#define ll long long
#define int ll
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch ==... | C++ | 9089fb2547751ca140a65f03fe78c916 | 020eaeb0b44f8a48a4610f14d01cc404 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define re register
#define ll long long
#define int ll
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch == '-') f=-1 ; ch=getchar... | C++ | 9089fb2547751ca140a65f03fe78c916 | 36b3da970eae09becb0af83c82ab676c | 1,900 | PASSED |
#include <bits/stdc++.h>
#define re register
#define ll long long
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch == '-') f=-1 ; ch=getchar();}
while(ch>... | C++ | 9089fb2547751ca140a65f03fe78c916 | 364c0990b3dab30c43f4c6a996a61023 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define re register
#define ll long long
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch == '-') f=-1 ; ch=getchar();}
while(ch>... | C++ | 9089fb2547751ca140a65f03fe78c916 | d1960f27fa202ba1186316fa6c758aa1 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define re register
#define ll long long
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch == '-') f=-1 ; ch=getchar();}
while(ch>... | C++ | 9089fb2547751ca140a65f03fe78c916 | 92f48464433ffef7e70a19adff047f87 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define re register
#define ll long long
#define drep(a,b,c) for(re int a(b) ; a>=(c) ; --a)
#define rep(a,b,c) for(re int a(b) ; a<=(c) ; ++a)
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch == '-') f=-1 ; ch=getchar();}
while(ch>... | C++ | 9089fb2547751ca140a65f03fe78c916 | b1dfd215e4f41e7e934038610f6febeb | 1,900 | PASSED |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<numeric>
// #define int long long
using namespace std;
using LL = long long;
const int N = 2e5 + 5;
int h[N], e[N], ne[N], idx, w[N], k, n;
LL f[N][2];
void add(int a, int b){
e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
... | C++ | 9089fb2547751ca140a65f03fe78c916 | 46c13451379ed66748bb0d15245a921f | 1,900 | PASSED |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int* val;
long long* tot;
int* par;
long long** ss;
vector<int>* tree;
priority_queue < long long >* p;
long long calc(int i) {
if (tot[i] >= 0)return tot[i];
if (i != 1)
tot[i] = calc(par[i]) + val[i];
else
tot[i] = va... | C++ | 9089fb2547751ca140a65f03fe78c916 | 4722063d0c1836432cc23e6de37e47e7 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int T;
int s[200005];
int n,m;
vector<int>p[200005];
int dp[200005][2];
int ans;
bool cmp(int A,int B){
return dp[A][1]-dp[A][0]>dp[B][1]-dp[B][0];
}
void dfs(int k,int ep){
if(!p[k].size()){
dp[k][1]=(ep+1)*s[k];
dp[k][0... | C++ | 9089fb2547751ca140a65f03fe78c916 | a03f600a842c6d255ae6ddc7534369ab | 1,900 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | 0b70307a034c91704f6a3e0c8fb789d2 | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | 2ecc4a8990076eb6ad411698fa7e2e2e | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | a1afb2eaed9e6c4517296625f3cd505c | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | f5882c7f07d22bb4b8e8f14d7587d62a | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | 3964d3e611b869d33050f1e2d5e4282e | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | e63db31bc2f3c5d7c503a734ae0096b1 | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | c3d367a4d29ae0468c800d757a09ba70 | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | 9d8257038d4e74dc588a0397d89b5687 | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | ca2ecea201c1cba07576d80debb716b3 | 2,500 | PASSED |
#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b)... | C++ | c3e2dae2103e745deebb687b8b9ed699 | 2da0e1706531c25799a1f987ab3809b3 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> ... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | 3819e7ba24515bcbdf22808a807a45c3 | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define speed_booster ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
template<class ForwardIterator>
v... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | acddb6a3f8f307092cf19444fde4967c | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
template<class ForwardIterator>
void read(... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | 2b322fa94cbb5fd8b325e097926f1f7a | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
template<class ForwardIterator>
void read(... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | 3098779671ca3b093abca705e48e479e | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
void debug(int x)
{
cout<<"Value Debu... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | d62931a5f7df31390a8213eb0da5c5ab | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
void debug(int x)
{
cout<<"Value Debu... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | 7ceb4bad7a760f90fc28d4c5a4bfb3cc | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
void debug(int x)
{
cout<<"Value Debu... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | 686b77ecbd07cac187fe7585813970a6 | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
void debug(int x)
{
cout<<"Value Debu... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | 0135b2b7e99ff974f9c8acd25fcf5535 | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
void debug(int x)
{
cout<<"Value Debu... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | b12d4e828e2f6978925e88b447c29e29 | 1,300 | PASSED |
#include<bits/stdc++.h>
#include<cmath>
#include<string.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0),cin.tie(0)
#define ll long long
#define sorta(vec) sort(vec.begin(),vec.end())
#define sortd(vec) sort(vec.begin(),vec.end(),greater<int>())
void debug(int x)
{
cout<<"Value Debu... | C++ | 188c9dbb3e1851b7b762ed6b4b23d1bd | bbabb76bead451f3617fa7824a039b5d | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f;
#ifdef He_Ren
int askcnt = 0;
mt19937 gen((unsigned long long)new char ^ time(0));
bool ask(vector<int>)
{
++askcnt;
return gen() % 2;
}
void answer(int x)
{
printf("answer! ... | C++ | a8334846b495efbded9bb0641d6a1964 | af765ea233b6d268885f5cd7f9e87156 | 3,200 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define LL long long
#define il inline
#define pb push_back
#define pii pair<int,int>
#define fi first
#d... | C++ | a8334846b495efbded9bb0641d6a1964 | cf7c33e05b52c67e5885688fa2ada633 | 3,200 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define LL long long
#define il inline
#define pb push_back
#define pii pair<int,int>
#define fi first
#d... | C++ | a8334846b495efbded9bb0641d6a1964 | f95cbb9ddd3938c7b25d62d3103cb028 | 3,200 | PASSED |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define LL long long
#define il inline
#define pb push_back
#define pii pair<int,int>
#define fi first
#d... | C++ | a8334846b495efbded9bb0641d6a1964 | 4d65b276bea495d6d474b4e354d7d90f | 3,200 | PASSED |
// I'm BAAAACK
#include <bits/stdc++.h>
//#include "iostream"
#include <random>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<int, int> pii;
#define ios {ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
#define pb push_back
#defi... | C++ | a8334846b495efbded9bb0641d6a1964 | 5a41a05ad6734a789df94aeafaff9516 | 3,200 | PASSED |
// I'm BAAAACK
#include <bits/stdc++.h>
//#include "iostream"
#include <random>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<int, int> pii;
#define ios {ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
#define pb push_back
#defi... | C++ | a8334846b495efbded9bb0641d6a1964 | 48c969f4653b7ac8d5f16c1ce00956d2 | 3,200 | PASSED |
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int dp[1005][1005],a[100005],n=0;
char s[10005],s1[10005],s2[10005];
vector<int> t,f,t1,f1,t2,f2;
pair<int,int> g[105][105],b[1000005];
bool cmp(pair<int,int> o,pair<int,int> p)
{
int sum1=o.first+o.second;
... | C++ | a8334846b495efbded9bb0641d6a1964 | e63c27b96a5876e30a5e14a76b5adfce | 3,200 | PASSED |
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int dp[1005][1005],a[100005],n=0;
char s[10005],s1[10005],s2[10005];
vector<int> t,f,t1,f1,t2,f2;
pair<int,int> g[105][105],b[1000005];
bool cmp(pair<int,int> o,pair<int,int> p)
{
int sum1=o.first+o.second;
... | C++ | a8334846b495efbded9bb0641d6a1964 | 0bca7902714f790c71761a41d1a3dc05 | 3,200 | PASSED |
// LUOGU_RID: 94204386
#include<bits/stdc++.h>
#pragma GCC optimize(2,3,"Ofast")
#define N 45
#define inf 0x3f3f3f3f
using namespace std;
int read(){
int w=0,h=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')h=-h;ch=getchar();}
while(ch>='0'&&ch<='9'){w=w*10+ch-'-';ch=getchar();}
return w*h;
}
/*
Easy Versi... | C++ | a8334846b495efbded9bb0641d6a1964 | 3e9c6f7fe290fc645459d7a6b19386a7 | 3,200 | PASSED |
// LUOGU_RID: 94204341
#include<bits/stdc++.h>
#pragma GCC optimize(2,3,"Ofast")
#define N 20
#define inf 0x3f3f3f3f
using namespace std;
int read(){
int w=0,h=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')h=-h;ch=getchar();}
while(ch>='0'&&ch<='9'){w=w*10+ch-'-';ch=getchar();}
return w*h;
}
/*
Easy Versi... | C++ | a8334846b495efbded9bb0641d6a1964 | 3f06b685aeabd990143a99892e1a5ef0 | 3,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)
void err(){cout<<'\n';}
template<class T, class... Ts>
void err(T arg, Ts... args) {
cout<<arg<< ' ';
err(args...);
}
mt19937 r... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 576002dc0539be5a41d91ca54006b8ca | 2,800 | PASSED |
// Problem: F. Kazaee
// Contest: Codeforces - Codeforces Global Round 23
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// Author: abhidot
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 5310a606df1533012308725cf68144b8 | 2,800 | PASSED |
// Problem: F. Kazaee
// Contest: Codeforces - Codeforces Global Round 23
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// Author: abhidot
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 3fba5261724c6abe953fbb29575afaf3 | 2,800 | PASSED |
// Problem: F. Kazaee
// Contest: Codeforces - Codeforces Global Round 23
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// Author: abhidot
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 387fd475bad2e4b47f79c88ce6bbae34 | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std ;
#define endl '\n'
mt19937 rnd(time(0));
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree =
// tree<T,
// null_type,
// less<T>,
// rb_tree_tag,
// tree_order_statistics_node_update>;
//
//#def... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 84c9c3d791e75f09a1894db8f3b992e2 | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std ;
#define endl '\n'
mt19937 rnd(time(0));
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree =
// tree<T,
// null_type,
// less<T>,
// rb_tree_tag,
// tree_order_statistics_node_update>;
//
//#def... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 0c59160c13d7c89b520964e02fd1cb1c | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std ;
#define endl '\n'
mt19937 rnd(time(0));
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree =
// tree<T,
// null_type,
// less<T>,
// rb_tree_tag,
// tree_order_statistics_node_update>;
//
//#def... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 9f0537775a53a0e1edd35ef2c5057c3d | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std ;
#define endl '\n'
mt19937 rnd(time(0));
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree =
// tree<T,
// null_type,
// less<T>,
// rb_tree_tag,
// tree_order_statistics_node_update>;
//
//#def... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 93fc5b5e9fc653920e1b14f8d53e70a4 | 2,800 | PASSED |
//#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
const int u=21;
int seg_tree[u][120000... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | 4c3ab1afaf9dda1c245da6915c0e1189 | 2,800 | PASSED |
// Please submit with C++14! It's best to use C++20 or higher version.
constexpr bool __MTCS__ = 0; // Spectre (admin@rbtree.app)
#ifndef LOCAL // By rbtree (https://rbtree.app)
#pragma region HEAD // DO OR Die
#endif
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math"... | C++ | 6308f9f5dc78dd44af587aea9f0a646c | bfec7dc56faf5aaae1f47dab6bffc531 | 2,800 | PASSED |
#pragma GCC optimize "unroll-loops,tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e5 + 1;
int n;
a... | C++ | 1e5b091fd8cad0cc7741d0ea85974fa8 | 54998f374bfb652b072f6e8796769f4b | 3,500 | PASSED |
#pragma GCC optimize "unroll-loops,tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e5 + 1;
int n;
a... | C++ | 1e5b091fd8cad0cc7741d0ea85974fa8 | 3639c413d2c69d5d6647aa5482c37e5b | 3,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.