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 <stdio.h>
#include <iostream>
using namespace std;
int main ( )
{
int n, k;
scanf ( "%d%d", &n, &k );
if ( (n*(n-1))/2 <= k )
printf ( "no solution\n" );
else {
for ( int i = 0; i < n; ++i )
printf ( "0 %d\n", i );
}
return 0;
}
| C++ | a7846e4ae1f3fa5051fab9139a25539c | 445c91d442f584a39d9e4c91f59531fb | 1,300 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | C++ | a7846e4ae1f3fa5051fab9139a25539c | efdfcb7132b28d6c90417e78ade96751 | 1,300 | PASSED |
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <iostream>
#define ll long long
#define oo 1e18
const int N = 1e5 + 10;
using namespace std;
int n, k;
int main()
{
//freopen("... | C++ | a7846e4ae1f3fa5051fab9139a25539c | c3ca11880cec4d0f1acafbc7abbc5f74 | 1,300 | PASSED |
n = raw_input()
n = int(n)
a = map(int, raw_input().split(' '))
for j in xrange(n+1):
for i in xrange(n):
if i%2 == 0:
a[i] += 1
if a[i] > n-1:
a[i] -= n
else:
a[i] -= 1
if a[i] < 0:
a[i] += n
if a == range(n):
print "Yes"
exit()
print "No"
| Python | 6c65ca365352380052b0c9d693e6d161 | 5e0f1475294f07a104f2751198572f3b | 1,100 | PASSED |
#import sys
#sys.stdin=open('test.in','r')
n=input()
m = raw_input()
a = map(int, m.strip().split(' '))
#print a
for i in range(0, n, 2):
a[i] = (n + a[i] - i) % n
for i in range(1, n, 2):
a[i] = (n - a[i] + i) % n
s = False
for i in range(1, n):
if a[i] != a[0]:
s = True
if s:
print 'No'
else... | Python | 6c65ca365352380052b0c9d693e6d161 | a89ea27b3275045bd2391913f969aac2 | 1,100 | PASSED |
import sys, math
def rs():
return sys.stdin.readline().strip()
def ri():
return int(sys.stdin.readline().strip())
def ras():
return list(sys.stdin.readline().strip())
def rai():
return map(int,sys.stdin.readline().strip().split())
def raf():
return map(float,sys.stdin.readline().strip().split())
de... | Python | 6c65ca365352380052b0c9d693e6d161 | 5632983c16c89641cc53082b25e428af | 1,100 | PASSED |
n = int(raw_input())
r = raw_input()
l = r.split(' ')
l = [int(i) for i in l]
length = len(l)
a = 0
if l[0]!= 0:
a = n-l[0]
for x in range(1,length):
if x%2!=0:
b = l[x]-a
if l[x]-a<0:
b = n + l[x] - a
if b!=x:
print 'No'
exit(0)
else:
b = a+l[x]
if a+l[x]>n:
b = b-n
if b!=x:
print 'No'... | Python | 6c65ca365352380052b0c9d693e6d161 | f135fd0bbc9b8e40c9a3ecaf3a681d04 | 1,100 | PASSED |
n=input()
a=map(int,raw_input().split())
print "Yes" if all(i==(a[i]+(-1)**i*(n-a[0]))%n for i in range(n)) else "No" | Python | 6c65ca365352380052b0c9d693e6d161 | cc47412943ba58c4238b3050a546f881 | 1,100 | PASSED |
if __name__== "__main__":
n=input()
a=map(int,raw_input().split())
s1=''.join(map(str,a))
b=[]
for i in range(n):
b.append(str(i))
s2=''.join(b)
while True:
c=[]
for i in range(n):
if i%2:
a[i]-=1
if a[i]==-1:
... | Python | 6c65ca365352380052b0c9d693e6d161 | e574da3dc0f38b1b3327a5ef09c3d362 | 1,100 | PASSED |
n = input()
a = [int(i) for i in raw_input().split()]
for i in xrange(n):
if (a[i]+((-1)**(i%2))*(n-a[0]))%n!=i:
print "No"
break
else:
print "Yes" | Python | 6c65ca365352380052b0c9d693e6d161 | 6a43848098993b11c3c5c03ad7e5345b | 1,100 | PASSED |
n = int(raw_input())
a = [int(item) for item in raw_input().split()]
time1 = n-a[0]
for i in xrange(n):
if i%2==0:
a[i] = (a[i]+time1)%n
else:
a[i] = (a[i]-time1)%n
if a == range(n):
print "Yes"
else:
print "No" | Python | 6c65ca365352380052b0c9d693e6d161 | c682dbcf4f4eae1cc4e1bf1cf50d82bd | 1,100 | PASSED |
def findFirstTooth(gear, activeTooth,firstTooth, target):
pushes = 0
i = activeTooth
while(firstTooth != target):
i += 1
pushes += 1
if(i >= len(gear)):
i = i % len(gear)
firstTooth = gear[i]
return pushes,firstTooth
def findNextTooth(gear, activeTooth, target, pushes):
i = active... | Python | 6c65ca365352380052b0c9d693e6d161 | cccbae3de64ec0d3fe685ed4c6e2ee6c | 1,100 | PASSED |
def f(n,a):
if (n==(a-1)):
return 0
else:
return n+1
def g(n,a):
if (n==0):
return a-1
else:
return n-1
def proc(s):
for i in xrange(len(s)):
if i%2==0:
s[i]=f(s[i],x)
else:
s[i]=g(s[i],x)
return s
x=int(raw_input()... | Python | 6c65ca365352380052b0c9d693e6d161 | 70069d4aaff5ee10107eaba26bdeba65 | 1,100 | PASSED |
// first second push_back unordered return continue break vector visited check flag bool while iterator begin end lower_bound upper_bound temp true false ll_MAX ll_MIN insert erase clear pop push compare ll64_MAX ll64_MIN reverse replace stringstream string::npos length substr front priority_queue
#ifndef ONLINE_JUDG... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | 1a6d00f39bbb59b78be9fadfc5e33cb9 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define inf (int)( 1e9 + 10 )
#define mxs (int)( 1e6 + 10 )
ll ans, t, n, m, i, j , k, a, b, c, d, e, f, g, sz, q, mx, cases, pos, l, r;
string s , s2 , s3 , s4;
vector < ll > graph [ mxs ];
bool visited [ mxs ];
ll ar [ mxs ]... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | 2202ba802d7cb82318249371784a0642 | 2,300 | PASSED |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace st... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | 3eca1c5852b91ccf507124807259317d | 2,300 | PASSED |
#include<bits/stdc++.h>
#define pb push_back
typedef long long ll;
const int N = 1e5+10;
using namespace std;
vector<int> adj[N];
int c[N];
ll ans[N];
int mxt[N];
map<int, int> cl[N];
void dfs(int u = 1, int fa = 0){
for(auto v: adj[u]){
if (fa == v) continue;
dfs(v, u);
if(cl[v].size()... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | 61bc3e74acea8f900701fc989d4e9843 | 2,300 | PASSED |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
inline void read(int &x)
{
char ch;
bool flag = false;
for(ch = getchar(); !isdigit(ch); ch = getchar())if(ch == '-') flag = true;
for(x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
x = flag ? -x : x;
}
cons... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | c4bf9378aae49814096aa63d2468b9de | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, Max, cnt[N], sz[N], col[N], big[N];
long long sum, ans[N];
vector<int> g[N];
void add(int u, int p, int x)
{
cnt[ col[u] ] += x;
if(cnt[ col[u] ] > Max)
{
sum = col[u];
Max = cnt[ col[u] ];
}
else if(cnt[ c... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | d0457092a1fdc9e3a2458cea60d6d9cc | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, Max, cnt[N], sz[N], col[N], big[N];
long long sum, ans[N];
vector<int> g[N];
void add(int u, int p, int x)
{
cnt[ col[u] ] += x;
if(cnt[ col[u] ] > Max)
{
sum = col[u];
Max = cnt[ col[u] ];
}
else if(cnt[ c... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | 925ff0e1720423830126a023762b7638 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, Max, cnt[N], sz[N], col[N], big[N];
long long sum, ans[N];
vector<int> g[N];
void add(int u, int p, int x)
{
cnt[ col[u] ] += x;
if(cnt[ col[u] ] > Max)
{
sum = col[u];
Max = cnt[ col[u] ];
}
else if(cnt[ c... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | cd435984c8e95300618022c41326b26a | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define LL long long
int n, Max, cnt[N], sz[N], col[N], big[N];
LL sum, ans[N];
vector<int> g[N];
void add(int u, int fa, int x)
{
cnt[col[u]]+=x;
if(cnt[col[u]]>Max) sum=col[u], Max=cnt[col[u]];
else if(cnt[col[u]]==Max) sum+=col[u];
for(au... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | cb288baefefd876c4de12496a7724582 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, Max, cnt[N], sz[N], col[N], big[N];
long long sum, ans[N];
vector<int> g[N];
void add(int u, int p, int x)
{
cnt[ col[u] ] += x;
if(cnt[ col[u] ] > Max)
{
sum = col[u];
Max = cnt[ col[u] ];
}
else if(cnt[ c... | C++ | fe01ddb5bd5ef534a6a568adaf738151 | a46a75987fdb2bdfef701dbd1ae8e393 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int m=n;
if(n==3){
printf("1 1 3\n");
return 0;
}
int now=1;
while(n>3){
for(int i=1;i<=(n+1)/2;i++){
printf("%d ",now);
}
n=n/2;
now=now*2;
}
if(n==3){
printf("%d %d %d ",now,now,now*3);
}else if(n==2){
printf(... | C++ | cadff0864835854f4f1e0234f2fd3edf | 7986b88de91f350e7557c5ab01461f62 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(i=j;i<=k;i++)
#define FORK(i,j,k) for(i=j;i<k;i++)
#define FORN(i,j,k) for(i=j;i>=k;i--)
#define pb push_back
#define mp make_pair
#define ll long long
typedef pair<int,int> ii;
template <typename T> inline void read(T &x) {
char c; bool nega=fal... | C++ | cadff0864835854f4f1e0234f2fd3edf | 29efc3a5e07d826e06f2254317862e71 | 1,600 | PASSED |
/*
Author: GracefuISage
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,y=1;
cin>>n;
int r = n/y , s = n/(2*y) , p=log2(n);
bool flag1=true,flag2=false;
while(flag1)
{
if(y>=n || flag2)
flag1 = false;
for(int i=1;i<=r-s && y<=n;i++)
cout<<y<<" ";
... | C++ | cadff0864835854f4f1e0234f2fd3edf | fe9a558ac2d8b6542cda7689ee16c362 | 1,600 | PASSED |
// Problem : C. Sequence Transformation
// Contest : Codeforces Round #514 (Div. 2)
// URL : https://codeforces.com/problemset/problem/1059/C
// Memory Limit : 256.000000 MB
// Time Limit : 2000.000000 milisec
// Powered by CP Editor (https://github.com/coder3101/cp-editor2)
#include<bits/stdc++.h>
#define pb push_... | C++ | cadff0864835854f4f1e0234f2fd3edf | de9a7ea92b59c2787c92da7ef0d17652 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
std::vector<int> res;
int main() {
int n;
cin >> n;
vector<int> A, B;
for(int i = 1; i <= n; ++i) {
A.push_back(i);
}
int val = 1;
while(A.empty() == false) {
if(A.size() == 3) {
res.push_back(A[0]*val);
... | C++ | cadff0864835854f4f1e0234f2fd3edf | 27445cc9ef5ed3a5f596b83994e4b017 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fn(i,n) for(int i=0 ; i< int(n) ; i++)
#define cf(i,c,n) for(int i=int(c) ; i< int(n) ; i++)
#define df(i,n) for(int i=int(n) ; i>=0 ; i--)
typedef long long ll;
typedef long double ld;
typedef unsigned int uni;
typedef unsigned long long ul;
const int INF=1e9;
#def... | C++ | cadff0864835854f4f1e0234f2fd3edf | 4d4d98767aa783f54b27761db4a64579 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<class A> using priority_queue_min=priority_queue<A,vector<A>,greater<A> >;
#define DIM 200009
#define INF 1e11+9
#define amen exit(0)
#define fast ios_base::sync_with_stdio(false),cin.tie(),cout.tie(0)
#define pairll pair<long long,long long>
#define se second
#... | C++ | cadff0864835854f4f1e0234f2fd3edf | e5e331c16f77eaacb9106a98cd7ad351 | 1,600 | PASSED |
//CF1059C 一开始序列是12345...n
//每次删除一个数，并把剩下的数的GCD输出
//要求最后输出要最大字典序
//我的思路：先输出奇数，因为n/2>n/3
//后面输出 2 4 8 16...n
//输出2的次数是1~n只是2的倍数的个数
//输出4的次数是1~n只是4的倍数的个数
//但是这样会WA n=6 应该是111226 而不是111224
//我对最后一个要输出的数进行了特判，然后AC
#include<bits/stdc++.h>
using namespace std;
int dp[25];
int f[25];
vector<int>ans;
int main()
{
int n... | C++ | cadff0864835854f4f1e0234f2fd3edf | 77a2c38d4f4d34e28320bb9c853e6d5e | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int dp[25];
int f[25];
vector<int>ans;
int main()
{
int n;scanf("%d",&n);
if(n==1)
{
printf("1\n");
return 0;
}
for(int i=1;i<=(n+1)/2;i++)
printf("1 ");
dp[0]=1;int up=0;
for(int i=1;;i++)
{
dp[i]=dp[i-1]*2;up++;
if(dp[i]>n)
{
up--;break;
}
}
... | C++ | cadff0864835854f4f1e0234f2fd3edf | d6b1854fc82b4e58190893227a559033 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define PI (2*acos(0.0))
#define eps 1e-9
#define pb push_back
#define endl "\n"
#define watch(x) cout << (#x) << " is ... | C++ | cadff0864835854f4f1e0234f2fd3edf | 9966e5fd484b1d74b163295fe2e2131a | 1,600 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using std::vector;
int main()
{
int v;
std::cin>>v;
for(int i=0; i<v ;i++)
{
int n,k;
std::cin>>n>>k;
vector<long long int> a ;
a.resize(n*k);
long long int count=0;
for(int j=0; j< n*k;j++)
{
cin>>a[j];
}
for(int... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 5cb0953f90a6d638944249aeb3dd3e29 | 900 | PASSED |
#include<bits/stdc++.h>
typedef double D;
typedef long long int LL;
typedef long double LD;
#define OR ||
#define AND &&
#define nl '\n'
#define S string
#define inf INT_MAX
#define SQR(a) (a) * (a)
#define pb push_back... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | d4ce075bb39d43baea69deedf7230a69 | 900 | PASSED |
#include <string>
#include <iostream>
#include <sstream>
#include <iterator>
#include <fstream>
#include <iomanip>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
long long solution(const std::vector<long long> & barrels, const std::vector<long long> & N... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | f9c9d9099df99efb55e746338c35a6d0 | 900 | PASSED |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <cmath>
#include <map>
#include <list>
#include <set>
#include <cstdlib>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using n... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 83a34c5bb326a092c0d38a5a8f3219cf | 900 | PASSED |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
ll a[maxn];
int main () {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
ll sum = 0;
for (int i = 1; i <= n * k; i++) {
cin >> a[i];
}
if (n == 1) {
for (int i = 1; i <= n * k;... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 04589c344a37fc2ab98c447f37a2f20b | 900 | PASSED |
#include<iostream>
#include<vector>
using namespace std;
long long int t,n,k,sumi,mm,aux;
vector<long long int>pila;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>t;
while(t--){
cin>>n>>k;
mm=n/2;
sumi=0;
for(int i=1; i<=n*k; i++){
ci... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 84cb96ec39e60f773a181da200d48198 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 3;
int t, n, k;
int a[N];
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> t;
while (t--) {
cin >> n >> k;
int sum = n * k;
for (int i = 1; i <= sum; ++i) cin >> a[i];
... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 7da1e394a570e7e1b7eaa5e2517001e9 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n,k;
cin>>n>>k;
int ar[n*k];
for(int i=0;i<n*k;i++) {
cin>>ar[i];
}
long long sum = 0;
int c = 0;
for(int i... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | f6dc18d2fe36be4049b78a7283d591c1 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n,k,cnt;
long long int a,i,med,sum,m;
vector<long long int>v;
cin>>t;
while(t--){
sum=0; cnt=0;
cin>>n>>k;
m=n*k;
for(i=0;i<m;i++){
cin>>a;
v.push_back(a);
}
med=n/... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 5ef0ea81f0376e4756e08a2edf44950e | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<ll> a(n * k + 1);
ll sum = 0;
for (int i = 1; i <= n * k; i++)
cin >> a[i];
int cnt = k, i = n * k, val = 1;
while (cnt--) {
sum += a[i -... | C++ | 83d0395cd3618b0fd02c1846dbcd92a2 | 3487b615f1e6699fa1245b79c2dad543 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5,INF=0x3f3f3f3f;
int n,a[N];int neg,zerx,negmax,cnt,pos,zer;bool used[N];
inline int chkmax(int x,int y){
return a[x]>a[y]?x:y;
}
inline void delout(int x){
if(x)cout<<2<<' '<<x<<endl,used[x]=1;
for(int i=1;i<n;){
if(used[i]){++i;continue;}
int j=i+1;... | C++ | f09b435a20a415d65803a80d57152832 | d78159b20ffbc5c64ce701bd0f01b346 | 1,700 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
long long int n;
std::cin>>n;
std::vector<long long int> inputVector;
for (long long int j=0; j<n; j++)
{
long long int m;
std::cin>>m;
inputVector.push_back(m);
}
//n>=2
long long int zeroes=0;
long long int positives=0;
long ... | C++ | f09b435a20a415d65803a80d57152832 | 4035b35cdb2f110066eb695961befb56 | 1,700 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
long long int n;
std::cin>>n;
std::vector<long long int> inputVector;
for (long long int j=0; j<n; j++)
{
long long int m;
std::cin>>m;
inputVector.push_back(m);
}
/... | C++ | f09b435a20a415d65803a80d57152832 | 7e7bbbe5c75d1febc859a838e951e83d | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(x) (int) x.size()
int main() {
iostream::sync_with_stdio(false);
int n;
cin >> n;
set <int> subz, unz, z;
vector <int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if(!a[i]) z.insert(i);
else if (a[i... | C++ | f09b435a20a415d65803a80d57152832 | 4611bdd81506a1a8d7ad15109aff023e | 1,700 | PASSED |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define INF 0x7ffffffffffff
#define maxn 200010
#define int long long
using namespace std;
int n;
int A[maxn];
int min_(int a,int b){
if(a==INF) return b;
if(b==INF) return a;
return A[a]<A[b]?a:b;
}
int max_(int a,int b){
if(a==-INF) return ... | C++ | f09b435a20a415d65803a80d57152832 | be2822469da84de543f0d3547cf75cfd | 1,700 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
int n,i,loc=-1,mn=15e9,neg=0,pos=0,x,y,cnt=-1,zero=0;
cin>>n;
int ar[n+5];
vector<int>vec(n+5, 0);
for(i=0;i<n;i++)
{
cin>>ar[i];
if(ar[i]==0)
{
... | C++ | f09b435a20a415d65803a80d57152832 | be3c0afb78b503b9e67f7bd46cad7b7e | 1,700 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
int n,i,loc=-1,mn=15e9,neg=0,pos=0,x,y,cnt=-1,zero=0;
cin>>n;
int ar[n+5];
vector<int>vec(n+5, 0);
for(i=0;i<n;i++)
{
cin>>ar[i];
if(ar[i]==0)
{
... | C++ | f09b435a20a415d65803a80d57152832 | f9ae57fca2fd2a1b579c0cda3719aaa9 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define y1 theboatman
#define make_struct(args...) {args}
using namespace std;
typedef long long ll;
const long long INF = 1e18 + 10;
const int inf = 1e9 + 10;
const int N = 1e6 + 10;
int main()
{
//cin.tie(0);
//ios::sync_with_stdio(0);
int n;
cin >> n;
set <pair <int... | C++ | f09b435a20a415d65803a80d57152832 | e90586ed6fa0e0e454d19fe7dfc63d8c | 1,700 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define MOD 1000000007
#define pii pair<int,int>
#define vi vector<int>
#define fio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define... | C++ | f09b435a20a415d65803a80d57152832 | a636c4ecf88b4d57425aecab1bfef6ac | 1,700 | PASSED |
/* Be strong, be fearless, be beautiful :D
And believe that anything is possible :))
when you have the right people there
to support you :) */
//RTn_E
#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 _Sync ios... | C++ | f09b435a20a415d65803a80d57152832 | b20993638ddd86f4206c511f92318282 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define OO 5e18
#define oo 2e9
#define yalla ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define FILES freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define sz 100005
#define re return
#define mod 1000000007
#define pi aco... | C++ | c51e15aeb3f287608a26b85865546e85 | 56a79bbf4fc4daa45c3b09a48c67604a | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX5 100005
#define MAX6 1000005
#define mp make_pair
#define pb push_back
ll M = 1e9 + 7;
int main()
{
int m;
ll x;
ll arr[200005];
vector<pair<ll,int>> a;
vector<ll> b;
cin >> m;
for(int i=0;i<m;i++)
{
... | C++ | c51e15aeb3f287608a26b85865546e85 | 146be886053f7344756eab589d207d8c | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX5 100005
#define MAX6 1000005
#define mp make_pair
#define pb push_back
ll M = 1e9 + 7;
int main()
{
int m;
ll x;
ll arr[200005];
vector<pair<ll,int>> a;
vector<ll> b;
cin >> m;
for(int i=0;i<m;i++)
{
... | C++ | c51e15aeb3f287608a26b85865546e85 | 7d48c1fd05055a7d48d792536a9157fe | 1,300 | PASSED |
#include <bits/stdc++.h>
#define ill int long long
#define fi first
#define se second
#define pb push_back
#define ld long double
#define pp push_front
#define mp make_pair
using namespace std;
int n,i,j,x,a[200005];
vector < pair <int,int> > v;
set<int> my;
set<int>::iterator it;
map<int,int> d;
int main()
{
ios_b... | C++ | c51e15aeb3f287608a26b85865546e85 | aaa0eccbe869ac16c2e77faf99a33178 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define re register
#define gcd __gcd
#define ft first
#define sd second
#define mr make_pair
#define lowbit(x) ((x)&-(x))
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
const int N = 2e6+7;
const int M = 4e6+7;
cons... | C++ | c51e15aeb3f287608a26b85865546e85 | 0186c4665f7cc388e3325b8e8448ec96 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000005
#define M 1000000007
/*
*********************************************************************
* Code By *
* ... | C++ | c51e15aeb3f287608a26b85865546e85 | 42dfe6231fd081284ac8a5d485960e14 | 1,300 | PASSED |
// ================
// Himanshu Lal
// MNIT Jaipur
// ================
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define TEZ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rf(i,a,b) for(ll i=a;i>=b;i-... | C++ | c51e15aeb3f287608a26b85865546e85 | 6902f7c3339bff07397999f18d613025 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define pf printf
#define sc scanf
#define PI 2*acos(0.0)
#define fast ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define mem(a,b) memset(a, b, sizeof(a) )
#define gcd(a,b) __gcd(a,b)
#de... | C++ | c51e15aeb3f287608a26b85865546e85 | 4bcfbe9ed8021b4fadd7d11286816eec | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define EPS 1e-9
const int MXX = 2e5 + 5;
int n, a[MXX], b[MXX];
map<pii, int>mp;
int main ()
{
cin>>n;
priority_queue<pii>pq1, pq2;
for(int i = 0; i<n; i++)cin>>a[i], pq1.push({a[i], i});
for(int i = 0; i... | C++ | c51e15aeb3f287608a26b85865546e85 | 1b13cbe0e60f7b7d61aac0385654bad4 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define EPS 1e-9
const int MXX = 2e5 + 5;
int a[MXX], b[MXX], ans[MXX], bk[MXX];
bool cmp(int i, int j)
{
return b[i]<b[j];
}
int main ()
{
int n;cin>>n;
for(int i = 0; i<n; i++)cin>>a[i];
sort(a, a + n, g... | C++ | c51e15aeb3f287608a26b85865546e85 | 71543f08ef3b94fbdc9d78fdc23dc9ba | 1,300 | PASSED |
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<vector>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
vector<int>a[100005];
queue<int>p;
int ji[100005],d[100005],ma=0;
void dfs(int p,int k)
{
ji[p]++;
d[p]=k;
if(k>ma)ma=k;
for(int i=0;i<a[p].size();i++){
... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 9a82de2dbf43eff0d648dcf4e58f8ece | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
vector<vector <int> > adjlist(100001);
pair<int, int> diameter(int i, int par =-1){
int diam =0;
int mxHeight[3] = {-1, -1 ,-1};
for (int j = 0 ; j < adjlist[i].size(); j++)
if(adjlist[i][j] != par)
{
p... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 48ec89b5d79c899ed93fba7d5aca83b4 | 1,500 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int> > a(100000);
vector<bool> used(100000, false);
vector<bool> h(100000);
vector<int> hmax(100000);//����������� ���-�� �������, �� ��������� ���������
int ans = -1e9;
void dfs(int v)
{
used[v] = true;
for(int i = 0; i < a[v].size(); ... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 65a42b0406d09b273fad1454e09521d8 | 1,500 | PASSED |
//my magic will tear you apart!
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <set>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
const int N = 100100;
int n,m, co[N], ... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 0df5b0cc7b5ab56b3144d123aa27166f | 1,500 | PASSED |
#include<iostream>
#include<conio.h>
#include<vector>
#include<queue>
#include<bits/stdc++.h>
#include<conio.h>
#include<cmath>
#include<string>
#include<stdio.h>
#include<algorithm>
#define ff first
#define ss second
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
t... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 42a4d52c226b1965594c3f8b9c2d688e | 1,500 | PASSED |
//Anik_Modak
#include<bits/stdc++.h>
#define MX 100005
#define mem(x,y) memset(x,y,sizeof(x));
#define clear(x) for(int i = 0; i < MX; i++) x[i].clear();
#define set(x,y) for(int i = 0; i < MX; i++) x[i]=y;
#define pii pair<int,int>
#define ll long long
#define pb(x) push_back(x)
using namespace std;
vector <int> adj[... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 5bbff73bd38e566bb213307d2ab0535f | 1,500 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
const int N = 100 * 1000 + 10;
bool mark[N];
int d[N], n;
vector <int> graph[N];
void dfs(int v)
{
mark[v] = true;
for (int i = 0; i < (int) graph[v].size(); i++)
{
int u = graph[v][i];
if (!mark[u])
{
d[u] = d[v] + 1;
dfs(u);
}
}
}
int fu... | C++ | 40a965a28e38bad3aff9c58bdeeeb8f6 | 271566e17b9807f3846f099aa0923921 | 1,500 | PASSED |
/***
chauhan176's code
***/
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define fi first
#define se second
#define mod 1000000007
#define maxn 200005
#define stringio cin.ignore(256, '\n') //to ignore end line before taking string ... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | 6fd1819a87af68ab1ec7675de00cf75e | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi; typedef vector<vi> vii;
typedef vector<ll> vl; typedef vector<vl> vll;
typedef pair<int,int> pi; typedef pair<pi,int> pii;
typedef pair<ll,ll> pl; typedef pair<pl,ll> pll;
typedef pair... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | 15ff89ab0488aacf4bfc6ec277e8bc9a | 1,600 | PASSED |
#include<stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include <cmath>
#include <iostream>
#include <set>
#include <stack>
#include <queue>
#include <numeric>
#include <deque>
#include <cstring>
#include <iterator>
#include <map>
#include<cstdlib>
#include <... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | 834016d6d47814ab9be6b9c05454d027 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define ar array
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL);
int32_t main() {
fast_io;
// int t; cin >> t;
// while (t--) {
// }
int n; cin >> n;
string s; cin >> s;
vector<int> a(n... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | acfc3201e233e1edf5defb109aa409d1 | 1,600 | PASSED |
/*
*
* author: Hamkor
*
**/
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, c = 1, j = 0; cin>>n;
string t; cin>>t;
vector<int> s(n, 0), f(n,0);
vector<bool> u(n,0);
for (int i=1; i<n; ++i){
if (t[i] != t[s[j]]){
++j; s[j] = i;
f[i] = s[j-1];... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | d288b5d56495c7606f677e0e647286f2 | 1,600 | PASSED |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <iostream>
//#include <unordered_set>
#include <unordered_map>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define int ll
typedef long long ll;
typedef long double ld;
//#pragma comment(linker, "/STACK:6... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | 880f2c32134e141c97428516e41ffc0a | 1,600 | PASSED |
#include <stdio.h>
#include <vector>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <sstream>
#include <string>
#define sz(x) ((int)(x).size())
#define all(x) (x)... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | d87b6b6f0bf8e8140a2d6d00c80beb26 | 1,600 | PASSED |
#include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | 9465eb43053e5e8071b6b0a5e88cdb20 | 1,600 | PASSED |
#include<iostream>
#include<stack>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<ctime>
#include<math.h>
#include<functional>
#include<cstring>
#include<iomanip>
#include<set>
#include<utility>
#include<limits.h>
#include<stdio.h>
typedef long long ll;
//
us... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | 609f324e6f9caaa2c4fb526818cafebb | 1,600 | PASSED |
#include<iostream>
#include<stack>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<ctime>
#include<math.h>
#include<functional>
#include<cstring>
#include<iomanip>
#include<set>
#include<utility>
#include<limits.h>
#include<stdio.h>
typedef long long ll;
//
us... | C++ | 7b56edf7cc71a1b3e39b3057a4387cad | b0e2bd8251f8f463ce2ad092f27d01be | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
scanf("%lld", &n);
ll a[n];
set<ll> s;
for(int i = 0; i < n; i++) {
scanf("%lld", a + i);
s.insert(a[i]);
}
ll mex = 1;
ll b[n];
if(a[0]){
b[0] = 0;
mex++;
while(s.count(mex))
mex++;
}
else{
while(s.count(me... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 6ac989804cc24488bf8f085371c3693f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
scanf("%lld", &n);
ll a[n];
set<ll> s;
for(int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
s.insert(a[i]);
}
ll mex = 1;
ll b[n];
if(a[0]){
b[0] = 0;
mex++;
while(s.count(mex))
mex++;
}
else{
while(s.count(m... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 1e2743976c384bdafd504e1e9a2176e2 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul;
const int oo = 1e6;
const ll N = 1e5 + 7;
const ll mod = 1e9 + 7;
int main... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 15a4590ab14308b029b36d687da26170 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define forn(b) for(int i = 0; i < b; i++)
#define rforn(b) for(int i = b - 1 ;i >= 0; i--)
#define It(m) for(aut... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 7acaf0ddb2fe000bce01f9eb01175859 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
bool used[1000000];
bool ind[1000000];
int main()
{
int n,j=0,z=0;
cin>>n;
int ar[n],ans[n];
for(int i=0;i<n;i++)
{
cin>>ar[i];
if(ar[i]==0)z++;
if(ar[i]!=ar[i-1]&&i!=0)
{
ans[i]=ar[i-1];
used[ar[i-1... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 798e3abf659761112d5f2644c1569538 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[100005],b[100005];
bool ex[100005];
int main()
{
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(b,-1,sizeof(b));
for (int i=1;i<=n;i++)
{
if (a[i]!=a[i-1])
{
b[i]=a[i-1];
ex[b... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 1d9fc17f2c072f6eeb589db0414d66ce | 1,600 | PASSED |
/*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include<bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(i=k;i<n;i++)
#define fd(i,k,n) for(i=k;i>n... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 5b4d4cd0aa59eda6b59f5fef372f76d3 | 1,600 | PASSED |
/*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include<bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(i=k;i<n;i++)
#define fd(i,k,n) for(i=k;i>n... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 8e2ad10266d627f5f262ea44e2e0804d | 1,600 | PASSED |
/*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include<bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(i=k;i<n;i++)
#define fd(i,k,n) for(i=k;i>n... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | 4fb3ba440d5c3fba2df0c3c4db8517d8 | 1,600 | PASSED |
/*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include<bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(i=k;i<n;i++)
#define fd(i,k,n) for(i=k;i>n... | C++ | 9a31d88a2fcaf8f3d059ef0e74d6e821 | fd96c6c70ead1d933327e1693a3ee723 | 1,600 | PASSED |
using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using Number = System.Int64;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
v... | C# | 2dfeceace9a820a2e68ca2b8fe69b7cb | 8550ab0b3198e0272bdf1189e0ba561a | 2,800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
/**
* @author Pavel Mavrin
*/
public class D {
private static final double EPS = 1e-9;
private voi... | Java | 2dfeceace9a820a2e68ca2b8fe69b7cb | af08f6067868eb5cdb6b5c646b154ed9 | 2,800 | PASSED |
#include<cstdio>
#include<algorithm>
#define rep(i,x,y) for(int i=(x);i<=(y);i++)
#define dep(i,x,y) for(int i=(x);i>=(y);i--)
#define N 200000
using namespace std;
int n,x,u,tt[N];long long T,T0,T1,t0[N],t1[N];double l,r,m,P,pt[N];
struct pr{long long p,t;int id;}a[N];
inline bool cmp0(const pr &x,const pr &y){return ... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | f06fafa3293cff3969a62c6ac5f0c9fd | 2,800 | PASSED |
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
using namespace std;
#de... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | a985eba07dfc70d797bfa8fdc04cefc1 | 2,800 | PASSED |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
const int MaxN = 150010;
const ll inf = 1ll << 60;
struct node {
int p, t;
ll l, r;
} P[MaxN];
int N;
double ans = 1;
bool cmp(const node &a, const node &b) {
return 1ll * a.t ... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | a16d419b660acfd7f556511a3729b59d | 2,800 | PASSED |
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
class Q
{
public:
ll x, y;
Q() {}
Q(ll x, ll y) :x(x), y(y) {}
bool operator < (Q q)const
{
return x*q.y < y*q.x;
}
bool operator == (Q q)const
{
return x*q.y == y*q.x;
}
};
typedef long double ld;
typedef pai... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | 3842d1b618baf0b89ad10ddbf30899d4 | 2,800 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#define SIZE 150005
#define BT 1024*256*2
#define EPS 1e-10
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
typedef pair <P,int> PP;
/*
�ő�̏�����l���āA
pi(1-c*x/T)+pj(1-c*(x+ti)/T) >= pj(1-c*x/T)+pi(1-c*(x+tj)/T)
<=>... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | cdc69522c3604832b4d290a2cd262214 | 2,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define N (int)(2e5+10)
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define nd second
#define st first
#define inf mod
#define endl '\n'
#define sag (sol|1)
#define sol (root<<1)
#define ort ((bas+son)/2)
... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | d44d808e7554f85f21369f71f8171954 | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define M 200200
typedef long long ll;
typedef pair<ll, ll> pll;
int n;
ll T;
pll pp[M];
bool cmp(pll a, pll b) {
return a.first * b.second != a.second * b.first ? a.first * b.second > a.second * b.first : a.first > b.first;
}
ll p[M], t[M];
bool ok(int i, int j) {
... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | 99d7bb4a9a3a2d506c466f4a22b71c90 | 2,800 | PASSED |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <assert.h>
#include <stdio.h>
#include <ctime>
#include <cstdlib>
#include <string>
#include <utility>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <complex>
#define i... | C++ | 2dfeceace9a820a2e68ca2b8fe69b7cb | 6e3357d30cf3617c984b9717a8bbc0a7 | 2,800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.