Using Segment tree In every range , I am keeping maximum & minimum height
and updating ranges ...
But WA
whats the wrong..
#include<bits/stdc++.h>
#define ll long long int
#define MX 100009
#define mod 1000000007
#define ff first
#define ss second
using namespace std;
ll hh,ans,kk,xx,yy,n ...
Search found 10 matches
- Sat Jul 23, 2016 9:21 pm
- Forum: Volume 12 (1200-1299)
- Topic: 1232 - SKYLINE
- Replies: 2
- Views: 3080
- Fri Dec 04, 2015 10:47 am
- Forum: Volume 106 (10600-10699)
- Topic: 10622 - Perfect P-th Powers
- Replies: 47
- Views: 31723
Re: 10622 - Perfect P-th Powers
Verdict: WA
but can not find the problem
please help someone.......
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,m,i,j,ans,a,c;
double b;
while(scanf("%lld",&n) && n)
{
ans=1;
m=n;
n=abs(n);
for(i=2; i<33; i++)
{
b=1.0/(i*1.0);
a=ceil( pow( n,b ...
but can not find the problem
please help someone.......
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n,m,i,j,ans,a,c;
double b;
while(scanf("%lld",&n) && n)
{
ans=1;
m=n;
n=abs(n);
for(i=2; i<33; i++)
{
b=1.0/(i*1.0);
a=ceil( pow( n,b ...
- Fri Sep 25, 2015 10:25 am
- Forum: Volume 7 (700-799)
- Topic: 719 - Glass Beads
- Replies: 41
- Views: 29760
Re: 719 - Glass Beads
Verdict: WA
can not get the problem..
please help......
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll Rank[109][200009];
struct info
{
ll idx,tup[2];
bool operator< (const info &a) const
{
if(tup[0]==a.tup[0])
return tup[1]<a.tup[1];
else
return tup[0]<a.tup[0 ...
can not get the problem..
please help......
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll Rank[109][200009];
struct info
{
ll idx,tup[2];
bool operator< (const info &a) const
{
if(tup[0]==a.tup[0])
return tup[1]<a.tup[1];
else
return tup[0]<a.tup[0 ...
- Tue Sep 22, 2015 9:43 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10537 - The Toll! Revisited
- Replies: 27
- Views: 14874
Re: 10537 - The Toll! Revisited
Verdict: WA
can not get the problem..
please help......
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define sc(a) scanf("%lld",&a)
bool visit[100000];
vector<ll>graph[10000];
ll des,deliver,strt,m,ok;
vector<ll>par,par1;
bool bfs(ll sum)
{
ll u,v,i,l,dis[1000];
queue<ll ...
can not get the problem..
please help......
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define sc(a) scanf("%lld",&a)
bool visit[100000];
vector<ll>graph[10000];
ll des,deliver,strt,m,ok;
vector<ll>par,par1;
bool bfs(ll sum)
{
ll u,v,i,l,dis[1000];
queue<ll ...
- Sat Feb 14, 2015 2:33 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10685 - Nature
- Replies: 41
- Views: 25479
Re: 10685 - Nature
Thanks brianfrybrianfry713 wrote:Don't read from a file.
- Wed Feb 11, 2015 6:39 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11173 - Grey Codes
- Replies: 5
- Views: 6649
Re: 11173 - Grey Codes
As i understand you form binary number in bin but in decimal base.
For n = 30 and some values of k value of bin can be about 10^30.
Max value of unsigned long long is 18446744073709551615.
Change bin to string variant.
Or do it using bitwise operations - &, | <<, >>. It will become very easy when ...
For n = 30 and some values of k value of bin can be about 10^30.
Max value of unsigned long long is 18446744073709551615.
Change bin to string variant.
Or do it using bitwise operations - &, | <<, >>. It will become very easy when ...
- Wed Feb 11, 2015 5:47 pm
- Forum: Volume 123 (12300-12399)
- Topic: 12376 - As Long as I Learn, I Live
- Replies: 9
- Views: 5700
Re: 12376 - As Long as I Learn, I Live
Thank you brianfrybrianfry713 wrote:Try the I/O in this thread.
- Wed Feb 11, 2015 3:44 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10685 - Nature
- Replies: 41
- Views: 25479
- Sat Jan 31, 2015 8:25 pm
- Forum: Volume 123 (12300-12399)
- Topic: 12376 - As Long as I Learn, I Live
- Replies: 9
- Views: 5700
- Sat Jul 19, 2014 3:14 am
- Forum: Volume 111 (11100-11199)
- Topic: 11173 - Grey Codes
- Replies: 5
- Views: 6649