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 |
|---|---|---|---|---|---|
// Copyright 2021 Nikita Golikov
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using ui64 = uint64_t;
template <class A, class B>
bool smin(A &x, B &&y) {
if (y < x) {
x = y;
return true;
}
return false;
}
template <class A, class B>
bool smax(A &x, B &&y) {
if (x < y) {
x... | C++ | b3b8121400ef9f4811d4461c81f141d6 | 3538f1cfbd98c2a5e7400d77653a7855 | 3,400 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#i... | C++ | b3b8121400ef9f4811d4461c81f141d6 | 20421d0ca2d4181c36fc2b3b0532b899 | 3,400 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
const int mod = 1000000007;
const int INF = 1e9;
void add(int& a, int b) {
a += b;
if (a >= mod) a... | C++ | b3b8121400ef9f4811d4461c81f141d6 | 40c6ffc0b3c8be33dbd424e40873a39a | 3,400 | PASSED |
#include <stdio.h>
#include <bits/stdc++.h>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <string_view>
#include <type_traits>
#include <utility>
#ifdef ROOM_311
#define OLYMP_DEBUG
#else
#define OLYMP_NDEBUG
#endif
//#include <olymp/numeric/epsilonized.h>
//... | C++ | b3b8121400ef9f4811d4461c81f141d6 | e86841ac6f3df58af522a855fcb4dd7e | 3,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, x, vec) for (int i = x; i < (int)vec.size(); i++)
#define lcm(x, y) ((x) / __gcd((x), (y)) * (y))
#define nC3(x) (1ll * (x) * ((x) - 1) * ((x) - 2) / 6)
template <class T>
struct FT {
vector <T> ft;
FT (int _n = 0) {
ft.assign(_n + 5, 0);... | C++ | 2cc753baa293ee832054de494dee0f15 | 80b35f059174eee36f0e47eed7c8b1c4 | 2,300 | PASSED |
#pragma GCC optimize ("Ofast,unroll-loops,-ffloat-store")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
vector <int> divisors[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
... | C++ | 2cc753baa293ee832054de494dee0f15 | 6a6233644cb634d3e5e42f3529f80124 | 2,300 | PASSED |
//#pragma GCC optimize ("Ofast,unroll-loops,-ffloat-store")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
vector <int> divisors[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);... | C++ | 2cc753baa293ee832054de494dee0f15 | 26e903a566c2aa32022bab297f8bae92 | 2,300 | PASSED |
//#pragma GCC optimize ("Ofast,unroll-loops,-ffloat-store")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
vector <int> divisors[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);... | C++ | 2cc753baa293ee832054de494dee0f15 | 316797b1cc072d3b1b7df23881a2f7e6 | 2,300 | PASSED |
#include<bits/stdc++.h>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) f... | C++ | 2cc753baa293ee832054de494dee0f15 | d20dbcf13a62f5a3eafe3925f496b7bb | 2,300 | PASSED |
#include<bits/stdc++.h>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) f... | C++ | 2cc753baa293ee832054de494dee0f15 | 9d8ed8ccacaaba17510a07b83104f533 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define enl '\n'
#define int long long
#define sz(s) (int)s.size()
#define all(v) (v).begin(),(v).end()
mt19937 rng (chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename A, typename B> ostream& operator<< (... | C++ | 2cc753baa293ee832054de494dee0f15 | 4f95694e3a74756312aa9a9685b5fc0c | 2,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <stdlib.h>
#include <stack>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namesp... | C++ | 2cc753baa293ee832054de494dee0f15 | 1781c15f17d903a066b21ef9881a5bf0 | 2,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <stdlib.h>
#include <stack>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namesp... | C++ | 2cc753baa293ee832054de494dee0f15 | 50d660c79af132789f77436b5b2d498e | 2,300 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <array>
#include <cmath>
#include <map>
#include <cassert>
#include <numeric>
#include <random>
#include <iomanip>
#include <string>
using namespace std;
#define int long long
#define all(... | C++ | 2cc753baa293ee832054de494dee0f15 | 30f0ffedfd0b1030b3ec4116c1ce0eee | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll pt;
scanf("%lld",&pt);
while(pt--)
{
ll n;
cin>>n;
if(n==1) cout<<n<<endl;
else{
vector<ll>u;
for(int i=1;i<=n;i++) {
u.push_back(i);
... | C++ | be3295b4d43a11ee94022b103f4221a5 | 25ae1bade7c0163e5ac637b63ab8939f | 800 | PASSED |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int t,n;
int main(){
cin>>t;
while(t--){
cin>>n;
if(n&1){
cout<<"1 ";
for(int i=2;i<=n;i+=2){
cout<<i+1<<" "<<i<<" ";
}
}
else{
for(int i=1;i<=n;i+=2){
cout<<i+1<<" "<<i<<" ";
}
}
cout<<"\n";
}
... | C++ | be3295b4d43a11ee94022b103f4221a5 | e6f10cc666f65cc80f8bcbb8dadcacf9 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n;
int main(){
cin>>t;
while(t--){
cin>>n;
if(n&1){
cout<<"1 ";
for(int i=2;i<=n;i+=2){
cout<<i+1<<" "<<i<<" ";
}
}
else{
for(int i=1;i<=n;i+=2){
cout<<i+1<<" "<<i<<" ";
}
}
cout<<"\n";
}
} | C++ | be3295b4d43a11ee94022b103f4221a5 | 91b21c5cbfd82c6c614630f6979ec28b | 800 | PASSED |
#include<bits/stdc++.h>
#include<unordered_set>
#pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
... | C++ | be3295b4d43a11ee94022b103f4221a5 | bc0e460f84e032c0d7ac606c2ce00a5f | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
if(n==1)
{
cout<<"1"<<" ";
}
else if(n%2==0)
{
for(int i=1;i<=n;i++)
{
... | C++ | be3295b4d43a11ee94022b103f4221a5 | 79383b9abba03fee97c0f2290d3d8729 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector <int> a;
for(int i=0;i<n;i++){
a.push_back(i+1);
}
for(int i=n-1;i>... | C++ | be3295b4d43a11ee94022b103f4221a5 | fafa1efb276fdebbec07cfa490390aa6 | 800 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
void solve(){
int n;
cin >> n;
vector<int> answ(n);
if(n == 1){
answ[0] = 1;
}else{
if(n % 2 == 0){
for(int i = n; i >= 1; i--){
if(i % 2 == 1){
answ[i - 1] = i + 1... | C++ | be3295b4d43a11ee94022b103f4221a5 | d6a10f698dc21b1bffb8cc96fedb78e3 | 800 | PASSED |
/* _ ___ _ __ __ _ _
| |/ / |__ _ _ ___| |__ \ \ / /_ _ ___ _ __ (_) | __
| ' /| '_ \| | | / __| '_ \ \ \ /\ / / _` / __| '_ \| | |/ /
| . \| | | | |_| \__ \ | | | \ V V / (_| \__ \ | | | | <
|_|\_\_| |_|\__,_|___/_| |_| \_/\_/ \__,_|___/_| |_|_|_|\_\... | C++ | be3295b4d43a11ee94022b103f4221a5 | 7cbb706ac1e6b0eee856272c513e2da4 | 800 | PASSED |
// Problem: B. Woeful Permutation
// Contest: Codeforces - Codeforces Round #813 (Div. 2)
// URL: https://codeforces.com/contest/1712/problem/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-08-13 23:13:18
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;... | C++ | be3295b4d43a11ee94022b103f4221a5 | 7c4e27aab42ea3b5bc0373e786e1e15a | 800 | PASSED |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int T, n;
int main () {
scanf ("%d", &T);
while (T --) {
scanf ("%d", &n);
if (n % 2 == 1) {
printf ("1 ");
for (int i = 2; i <= n; i ++) {
if (i % 2) {
printf ("%d ", i - 1);
} else {
printf ("%d ", i + 1);
... | C++ | be3295b4d43a11ee94022b103f4221a5 | ece95ad6b386d07a56c0f9a288b1a8d5 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n,u=-1,d=0,ans=0;
cin>>n;
vector<int>v(n);
vector<int>b;
vector<int>y(100000);
for(int i=0;n>i;i++){
cin>>v[i];
y[v[i]-1]++;
... | C++ | 68e830551c1580bb5aff40d7848d968d | 913ae50e0737582a7f5bd837bead1154 | 1,100 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#include<unordered_set>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n,u=-1,d=0,ans=0;
cin>>n;
vector<int>v(n);
vector<int>b;
vector<int>y(100000);
for(int i=0;n>i;i++){... | C++ | 68e830551c1580bb5aff40d7848d968d | 0d9d4a4ed0b0aae3be7fa3c95b1a532e | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t,n,x;
cin>>t;
for(int i=0;i<t;i++){
cin>>n;
set<int> col;
int ans = 0;
int last = 0;
for(int k=0;k<n;k++){
cin>>x;
if(last>x){
ans=col.size(... | C++ | 68e830551c1580bb5aff40d7848d968d | ce617e844780ce369e98d7a24474480d | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
const double eps=1e-3;
const double pi=3.14159265358979323846264338327950;
#define double long double
int main() {
ll t;
cin>>t;
while(t--)
{
ll n,ans=0;
cin>>n;
vector<ll>o,e;
ll a[n... | C++ | 68e830551c1580bb5aff40d7848d968d | cacbe1223a02ebf30038922e676e9d8d | 1,100 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define MAXN 200005
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll t;
cin >> t;
while(t-- > 0){
ll n;
cin >> n;
vector<ll> A(n + 1, INT_MAX);
map<ll, ll> M;
for(ll i = 0;... | C++ | 68e830551c1580bb5aff40d7848d968d | 7379055dc0c31c354f9d648f59f3951c | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void makearray(ll a[], int n, ll b[])
{
ll sum = 0;
for (int i = 0; i < n; i++)
{
if (a[i] != a[i - 1])
{
sum++;
}
b[i] = sum;
}
}
int main()
{
// int n, m;
// cin >> n >> m;
... | C++ | 68e830551c1580bb5aff40d7848d968d | 44d7cf0c88a9ddce5f5660b3e02e1e1a | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void makearray(ll a[], int n, ll b[])
{
ll sum = 0;
for (int i = 0; i < n; i++)
{
if (a[i] != a[i - 1])
{
sum++;
}
b[i] = sum;
}
}
int main()
{
// int n, m;
// cin >> n >> m;
... | C++ | 68e830551c1580bb5aff40d7848d968d | 55f6d16c51d42cc873fb2854fc24654d | 1,100 | PASSED |
#include <iostream>
#include <set>
#include <vector>
#include <string>
using namespace std;
int main() {
int t;
cin>>t;
for(int k = 0;k<t;k++){
int n;
cin>>n;
vector<int>vec(n);
for(int i = 0;i<n;i++) cin>>vec[i];
int flag = 0;
set<int> s;
int i=... | C++ | 68e830551c1580bb5aff40d7848d968d | feef9bab1bb8e1c88705451b72cf3df7 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> v2l;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typ... | C++ | 68e830551c1580bb5aff40d7848d968d | 35e721a3cf2b9ace4d4c6e20ca885eff | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<vector<int>> graph;
void solve(int t) {
int n; cin >> n;
//if(t == 9956) cout << "n:" << n;
vi data(n+1, 0);
vi ar(n);
unordered_set<int> us;
bool nu = true;... | C++ | 68e830551c1580bb5aff40d7848d968d | 8d14d88dc1d0bcffda6ea38207979347 | 1,100 | PASSED |
// LUOGU_RID: 95055230
#include<bits/stdc++.h>
using namespace std ;
int T , Ans ;
int N , K ;
int P_i ;
int main( ) {
scanf("%d" , &T ) ;
while( T -- ) { Ans = false ;
scanf("%d %d" , &N , &K ) ;
for(int i = 1 ; i <= N ; i ++ ) {
scanf("%d" , &P_i ) ;
if( i <= K && P_i > K ) Ans ++ ;
} prin... | C++ | 10927dcb59007fc3a31fdb6b5d13846f | 6fbb9638b50d36240250dcf92b1522aa | 800 | PASSED |
// LUOGU_RID: 92070236
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b)
{
if(b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
long long int lcm(long long int a, long long int b) {
return a * b / gcd(a, b);
}
int main() {
ios::... | C++ | 10927dcb59007fc3a31fdb6b5d13846f | b326f632a28da2e2391b1e06331a8052 | 800 | PASSED |
// LUOGU_RID: 90582695
#include<bits/stdc++.h>
using namespace std;
int main(){
int q,n,k,x,count; scanf("%d", &q);
while(q--){
scanf("%d %d", &n, &k);
count = 0;
for(int i = 0; i<n; i++){
scanf("%d", &x);
if(x>k && i<k) count++;
}
pri... | C++ | 10927dcb59007fc3a31fdb6b5d13846f | 2770b96c73fd425e412a9ac753f73fdb | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=110;
int a[N];
int n,k;
int T;
int main()
{
cin>>T;
while(T--)
{
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
int ans=0;
for(int i=1;i<=k;i++)
{
if(a[i]>k)
{
ans++;
}
}
cout<<ans<<endl;
}
return 0;
} | C++ | 10927dcb59007fc3a31fdb6b5d13846f | b9219cf894e411d9c5a455eb19884436 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long t,n,m,k,i,a[100001],b;
int main()
{
scanf("%lld",&t);
for(k=1;k<=t;k=k+1)
{
scanf("%lld%lld",&n,&m);b=0;
for(i=1;i<=n;i=i+1)
{
scanf("%lld",&a[i]);
if(i<=m&&a[i]>m)b=b+1;
}
printf("%lld\n",b);
}
return 0;
}
| C++ | 10927dcb59007fc3a31fdb6b5d13846f | 2611ad8267ae1c7c60fd6cf15e6bd24f | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,p,T,a[110],t,k;
int main()
{
cin>>T;
for(int i=1;i<=T;i++)
{
cin>>n>>k;
t=0;
for(int j=1;j<=n;j++)
{
cin>>a[j];
}
for(int j=1;j<=k;j++)
{
if(a[j]>k)
t++;
}
cout<<t<<endl;
}
return 0;
} | C++ | 10927dcb59007fc3a31fdb6b5d13846f | e0867a0bd3f4c8500ca9f0921111d93a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,k,a[10005],ans,b[10005];
int main()
{
scanf("%d",&t);
while(t--){
ans=0;
memset(b,0,sizeof(b));
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=k;i++)
b[a[i]]++;
for(int i=1;i<=k;i++)
if(b[i]==0) ans+... | C++ | 10927dcb59007fc3a31fdb6b5d13846f | 66e4a84e4c48fadc86c0cd16b1afb6c0 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,k,ans=0;
int a[1001],b[1001];
int main() {
scanf("%d",&t);
while(t--) {
ans=0;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%d",&a[i]);
b[a[i]]=i;
}
for(int i=1;i<=k;i++)
if(b[i]>k)
ans++;
printf("%d\n",ans);
}
re... | C++ | 10927dcb59007fc3a31fdb6b5d13846f | 1ff2e93aa1627e2e77750bb26aaac259 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
struct node
{
int w,s;
}a[MAXN];
bool cmp(node x,node y)
{
return x.w<y.w;
}
int t,n,k;
signed main()
{
ios::sync_with_stdio(false);
cin>>t;
while(t--)
{
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i].w;
a[i].s=i;
... | C++ | 10927dcb59007fc3a31fdb6b5d13846f | a527e577df5429c9a93925f14b4f19b3 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,k,i,j,K,a[101];
int main()
{
for (scanf("%d",&t);i++ < t;printf("%d\n",K),j = K = 0)
{
for (scanf("%d%d",&n,&k);j < n;scanf("%d",&a[j++]));
for (j = 0;j < k;j++)
if (a[j] > k)
K++;
}
return 0;
} | C++ | 10927dcb59007fc3a31fdb6b5d13846f | 0140a748cc2ca0580ffb950a7d016bc3 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define Test
#define mid ((l+r)>>1)
#define all(x) x.begin(),x.end()
#define lowbit(x) (x&-x)
typedef long long LL;
typedef pair<int, int> PII;
const int N = 3e5+10, mod = 998244353;
#define Y1 "yes"
#define N1 "no"
#define P(f) puts((f)?Y1:N1)
int a[N];
L... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 18074ac521c10cc566f1e8d9391e96d6 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pairii pair<int, int>
#define minqi priority_queue<int, vi, greater<int>>
#define minqll priority_queue<ll, vll, greater<ll>>
#define srt(a) sort(a.begin(), a.end())
#define I_MAX 0x7fffffff... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | ab80aab438ba93781a0db0993da1009f | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pairii pair<int, int>
#define minqi priority_queue<int, vi, greater<int>>
#define minqll priority_queue<ll, vll, greater<ll>>
#define srt(a) sort(a.begin(), a.end())
#define I_MAX 0x7fffffff
#define ... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 8279e8da6548a283e9d0b0e340d0e720 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pairii pair<int, int>
#define minqi priority_queue<int, vi, greater<int>>
#define minqll priority_queue<ll, vll, greater<ll>>
#define srt(a) sort(a.begin(), a.end())
#define I_MAX 0x7fffffff
#define ... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 1e37122c2876bc5f8589a4229e4fe222 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pairii pair<int, int>
#define minqi priority_queue<int, vi, greater<int>>
#define minqll priority_queue<ll, vll, greater<ll>>
#define srt(a) sort(a.begin(), a.end())
#define I_MAX 0x7fffffff
#define ... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 55caa352a8e006f7a11111d6581e5d94 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pairii pair<int, int>
#define minqi priority_queue<int, vi, greater<int>>
#define minqll priority_queue<ll, vll, greater<ll>>
#define srt(a) sort(a.begin(), a.end())
#define I_MAX 0x7fffffff
#define ... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 6133fc575ac32e6d4ea3989f04ef9e3c | 2,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define llu unsigned long long
#define ld long double
#define pii pair<ll,ll>
#define fi first
#define se second
using namespace std;
ll ans[200005];
vector<ll> ch[200005];
vector<pii> query[200005];
struct ST{
ll tree[800005]={0,},sz;
void upd(int ... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 7f8729e441ff784e64acf425b0575c64 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef MATVEY
#define _dbg(x) do { cout << #x << "=" << x << "; "; } while (0)
#define _name(name, _1, _2, _3, _4, N, ...) name ## N
#define _dbg1(x) _dbg(x)
#define _dbg2(x, ...) _dbg(x); _dbg1(__VA_ARGS__)
#define _dbg3(x, ...) _dbg(x); _dbg2(__VA_ARGS__)
#def... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | ff8b6808f72f968f69fab73ebac5dda3 | 2,500 | PASSED |
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | d2b6596686f6aeacfb01e792dbcb5000 | 2,500 | 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;
#define int long long
#define endl '\n'
#define sz(x) (int)(x.size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define un... | C++ | 6a3043daecdb0442f4878ee08a8b70ba | 315f974911dbbecfd9fc7200d1d4f57f | 2,500 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define end ed
#define N 1000005
int fa[N],f1[N],qwq,f2[N],f3[N],fir[N],end[N],dep[N],tot,rmq[N<<1],D[N<<1][21],lg[N<<1],LG;
vector<int>son[N];
struct node{
int x,y;
}f[N];
int Dis(int x,int y){
LG=lg[y-x+1];
return min(D[x][LG],D... | C++ | d6277076a6711cb4e421427bc161a533 | 70705a1b135e4129047b9f31659110ed | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define len(a) int((a).size())
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...)
#endif // LOCAL
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
... | C++ | d6277076a6711cb4e421427bc161a533 | 486dfcea0d3fd087348e3b3900100bff | 3,200 | PASSED |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define len(a) int((a).size())
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...)
#endif // LOCAL
template<typename Fun>
struct y_c... | C++ | d6277076a6711cb4e421427bc161a533 | c9c7d9ec932d49c914a4d01d46bef972 | 3,200 | PASSED |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define len(a) int((a).size())
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...)
#endif // LOCAL
template<typename Fun>
struct y_c... | C++ | d6277076a6711cb4e421427bc161a533 | 3c8df18a57c6ea0ad53f48d76772323a | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define len(a) int((a).size())
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...)
#endif // LOCAL
template<typename Fun>
struct y_combinator {
const Fun fun;
... | C++ | d6277076a6711cb4e421427bc161a533 | b1dfb9a647ec7e5805510eb08cff829b | 3,200 | PASSED |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define len(a) int((a).size())
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...)
#endif // LOCAL
template<typename Fun>
struct y_c... | C++ | d6277076a6711cb4e421427bc161a533 | dd1bad4a776314a11175464044f3e301 | 3,200 | PASSED |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <qu... | C++ | d6277076a6711cb4e421427bc161a533 | 900b9472deeb89841ef17b7e15539b8c | 3,200 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
... | C++ | d6277076a6711cb4e421427bc161a533 | d3518286b6771a77af8f0c060688048f | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
/// #define int long long
struct T {
int a;
int b;
};
const int N = (int) 1e6 + 77;
const int INF = (int) 1e9 + 7;
int n;
int q;
int dist[N];
vector<int> g[N];
int min_dist[N];
vector<int> queries;
v... | C++ | d6277076a6711cb4e421427bc161a533 | 355e412ad3f8612a8b6c06cb98f7d97e | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9+10;
const ll inf_ll = 1e18+10;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define cmax(x, y) (x = max(x, y))
#define cmin(x, y) (x = min(x, y))
#ifndef LOCAL
#define debug(...) 0
#else
#include "../..... | C++ | d6277076a6711cb4e421427bc161a533 | ca44f1c6420134481d016f1cc75b4cfd | 3,200 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 1e9;
int T;
int n, k;
int a[N], t[N];
int pre[N], suf[N];
signed main() {
int i, j;
scanf("%lld", &T);
while (T--) {
scanf("%lld %lld", &n, &k);
for (i = 1; i <= n; ++i) scanf("%lld", a + i), t[i... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | f9ecd50148b22883528e9c0c4ad6b936 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 1e9;
int T;
int n, k;
int a[N], t[N];
int pre[N], suf[N];
signed main() {
int i, j;
scanf("%lld", &T);
while (T--) {
scanf("%lld %lld", &n, &k);
for (i = 1; i <= n; ++i) sca... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 642ecdd3a0fa197841e673b2fb0066be | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+86;
int inf=1e9;
inline int read()
{
int num=0,f=1;
char ss=getchar();
while(ss<'0'||ss>'9') {if(ss=='-') f=-f; ss=getchar();}
while('0'<=ss&&ss<='9') {num=(num<<1)+(num<<3)+(ss^48);ss=getchar();}
return num*f;
}
struct pp{int bh,zhi;}a[m... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 55affcf9972cdabe1c13c5ebd6c5a2da | 2,000 | PASSED |
#include "bits/stdc++.h"
#define ll long long int
#define MOD 1000000007
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
ll modPow(ll x, ll n, ll mod)
{
if (n == 0)
return 1;
ll res = modPow((x * x)%mod, n / 2, mod);
return n % 2 == 1 ? res * x : res;
}
... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 1aaa47e8761eabaeda8a9528744eab72 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using INT = long long;
const int NN = 3e5 + 100;
int a[NN], b[NN];
int _max(int n, int k){
int ret = 0;
for(int i = 1; i < n; i ++) ret = max(ret, min(b[i+1], b[i]));
return ret;
}
int solve(){
int n, k; scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i ++) scanf("%d", ... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 3cd2b6a822fa173f8e1d2f4a11d028a7 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define INT long long
#define x first
#define y second
using namespace std;
const int NN = 100100;
const int INF = 1e9;
int a[NN], b[NN];
typedef pair<int, int> pi;
pi p[NN];
void solve(){
int n, k;
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i ++) scanf("%d", a + i);
for(int i = 1; i <= ... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 158302a51ee0692933550f16a0abc4f8 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN = 1e5 + 10;
const int inf = 1e9;
int A[NN], id[NN], B[NN];
bool cmp(int u, int v){
return A[u] < A[v];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int t; cin >> t;
while(t --){
int n, k; scanf... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 03fafe85e56871ccb3fa4f70ebe37e88 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 2e5 + 10;
int A[NN],B[NN];
char str[NN];
const int mxx = 1e9;
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
int q;
cin >> q;
while(q--){
int n,k;
scanf("%d%d",&n,&k);
int mn ... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | d0b5250f93660bab930d00c497dd5e35 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[100100],b[100100];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
int t;cin>>t;
while(t--){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++) scanf("%d",a+i),b[i]=a[i];a[n+1]=b[n+1]=1e9;
sort(a+1,a+n+1);
for(int... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 06f466e39adc9910f61eaec821f36f20 | 2,000 | PASSED |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define Gura_is_cute ios_base::sync_with_stdio(0);cin.tie(0)
#define mp make_pair
#define pb push_back
#define ll long long
#define lli long long int
#define F first
#define S second
#define endl "\n"
lli t, n, a[200005], b[200005], k;... | C++ | d1c2caeec0fe1ac33a6735b03d7c75ce | 36d25d7ff6ff7fe14bc21a603b61a63d | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<pll> vll;
typedef vector<vl> vvl;
#define for... | C++ | ab89b5642465e632547fb57b9895beb6 | fbae9560b4be190280bd3d4fe8dd34c9 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
const int inf = 1e4;
vector<vector<int>> nxt;
void init(string& p, vi& f) {
nxt.resize(f.size() + 1, vi(2));
int k = 0;
for(int i = 1; i < p.size(); ++i){
while (k && p[i] != p[k]) k = f[k];
if(p[... | C++ | ab89b5642465e632547fb57b9895beb6 | 781f196c2c4d1e87baefb742ce0e920d | 2,200 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
long long MOD = 1000000007;
int dp[501]... | C++ | ab89b5642465e632547fb57b9895beb6 | 8fde5231ce036dd48888542267aff65b | 2,200 | PASSED |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <random>
#include <complex>
#include <bitset>
... | C++ | ab89b5642465e632547fb57b9895beb6 | fd1cd32045c7db82339f13b99288baf5 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#... | C++ | ab89b5642465e632547fb57b9895beb6 | fb7e7889b13d81999460c4de303240aa | 2,200 | PASSED |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(...) emplace_back(__VA_ARGS__)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I... | C++ | ab89b5642465e632547fb57b9895beb6 | 055d4edd6ba5216e38b6dd168a127639 | 2,200 | 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++ | ab89b5642465e632547fb57b9895beb6 | ca0915d4d47b861b0621ff7e43cddf0a | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const double eps = 1e-8;
typedef long long ll;
int dp[505][505][505], pi[505], pi2[505][505];
char s[505], t[505], tmp[505];
void getnext(char* s, int* pi) {
int n = strlen(s);
for (int i = 1, j = 0; i < n... | C++ | ab89b5642465e632547fb57b9895beb6 | a076bf605da68ac87996a53a2ddea2be | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int Sz = 5e2 + 5;
const int inf = 1e9;
int tab[Sz];
int f[Sz][Sz][Sz];
string a, b;
int n, m;
int dif[Sz][Sz];
int sam[Sz][Sz];
void Process(){
int i = 1;
int j = 0;
tab[0] = 0;
while(i < m){
if(b[i] == b[j]) tab[i++] = ++j;
else if(j... | C++ | ab89b5642465e632547fb57b9895beb6 | 14f3fa04964879b0ee4a99be0f81ae2c | 2,200 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#include <time.h>
#include <chrono>
#include <random>
//#include <math.h>
#include <cmath>
#include <fstream>
#include <deque>
#include <unordered_ma... | C++ | ab89b5642465e632547fb57b9895beb6 | 8b11a13c2b4df3b9e3e2deb412899b47 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | 91ce3f67d3929cd128a1d62acea1c818 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | dcf2cc4e9fc858d4d2d5ffe5e8902abb | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | 3a7a22645fa29c18326e48b7ec96a974 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | c748508e924844898464010d6a0e1019 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | 17eab237e9e39717a65b422d8e4bbb55 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | d204e5e9fcba65b1129156cd96a9e40a | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | 1aad3e82ae16556a0c112fd7a53f8adc | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// Question: https://codeforces.com/problemset/problem/1575/A
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, m; //n - number of books, m - length of book(s)'s name
cin >> n >> m;
vector <pair<string, int>> books(n);
... | C++ | 6b75105015e5bf753ee93f6e0639a816 | c4dfd2dc14e41aa108aa165a546824ee | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
int m;
inline bool cmp(pair<int, string> a, pair<int, string> b)
{
for (int j = 0; j < m; ++j)
if (a.s[j] != b.s[j])
return (j % 2 == 0 ? a.s[j] < b.s[j] : a.s[j] > b.s[j]);
return 0;
}
signed ma... | C++ | 6b75105015e5bf753ee93f6e0639a816 | ab4f7b4d3eec834de3a2c4c3522bb3e3 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
int m;
inline bool cmp(pair<int, string> a, pair<int, string>b)
{
for(int j=0;j<m;++j)
if(a.s[j]!=b.s[j])
return(j%2==0? a.s[j]<b.s[j]:a.s[j]>b.s[j]);
return 0;
}
signed main()
{
ios::sync_with_stdio(0);... | C++ | 6b75105015e5bf753ee93f6e0639a816 | eb77c3c64f02368119b4e53705cda000 | 1,100 | PASSED |
#include <iostream>
#include <string>
using namespace std;
int arr[1009][1009];
int main()
{
int n,m,s,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)cin>>arr[i][j];
}
int x=1,y,ans;
while(k--){
cin>>y;
s=1,x=1;
while(s){
if(arr[x][y]==1){
arr[x][y]=2;
y++;
}else if(arr[x... | C++ | eb480feb52669fba538c18544e7cad16 | 1416eaa79411f990676f6078156c4645 | 1,500 | PASSED |
#include<stdio.h>
int a[1009][1009];
int main()
{
int n,m,k,l;
scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
scanf("%d",&a[i][j]);
}
}
while(k--)
{
scanf("%d",&l);
int x=1,y=l;
while(x<=n)
{
if(a[x][y]==1)
... | C++ | eb480feb52669fba538c18544e7cad16 | 0de7a037a5eca2eb2891d227d134d92d | 1,500 | PASSED |
#include<iostream>
using namespace std;
int n,m,k,c,a[1005][1005];
int main()
{
cin>>n>>m>>k;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
cin>>a[i][j];
}
}
while(k--)
{
cin>>c;
int q=1,p=c;
while(q<=n)
{
if... | C++ | eb480feb52669fba538c18544e7cad16 | ddebe32ced2bddb22757b0c2277ee415 | 1,500 | PASSED |
#include<iostream>
using namespace std;
int a[1005][1005];
int main()
{
long long n,m,k;
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>a[i][j];
}
}
while(k--)
{
int x=1,y=1;
cin>>y;
while(x<=n)
{
if(a[x][y]==1)
{
a[x][y]=2;
y++;
}
else... | C++ | eb480feb52669fba538c18544e7cad16 | 28e8734ae287fa708da3e2811c7757bf | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cctype>
#include <sstream>
#include <cmath>
using namespace std;
typedef long long LL;
typedef pair <int, int> PII;
typedef unsigned long long LLU;
const int N = 10010;
int a[N][N];
int main()
{
int n, m, p;
cin >> n >> m >> p;
... | C++ | eb480feb52669fba538c18544e7cad16 | 7da2aa84c5f3362f44a9a310c50b1df8 | 1,500 | PASSED |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <stack>
#include <queue>
using namespace std;
int n,m,k,c,a[1009][1009];
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
scanf("%d",&a[i][j]);
... | C++ | eb480feb52669fba538c18544e7cad16 | f6b769dd9b7716ac136c9001960d4d3c | 1,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.