Submission #921603

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
9216032024-02-04 07:51:29firewaterElection Campaign (JOI15_election_campaign)C++14
20 / 100
1044 ms27092 KiB
#include<bits/stdc++.h>
#define fs first
#define sn second
#define mp make_pair
#define N 100100
#define ll long long
using namespace std;
ll n,m,ans,x,y,z,w,tot,h[N],f[N],sz[N],hs[N],top[N],fa[N],dep[N],dfn[N],low[N],v[N];
vector<pair<pair<ll,ll>,ll> >d[N];
struct rec
{
ll to,nx;
}e[N<<1];
void addl(ll x,ll y)
{
e[++tot].to=y;
e[tot].nx=h[x];
h[x]=tot;
return;
}
struct Tree
{
#define ls x*2
#define rs x*2+1
ll s[N<<2];
void push_up(ll x)
{
s[x]=s[ls]+s[rs];
return;
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

election_campaign.cpp: In member function 'void Tree::change(long long int, long long int, long long int, long long int, long long int)':
election_campaign.cpp:38:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |   ll mid=l+r>>1;
      |          ~^~
election_campaign.cpp: In member function 'long long int Tree::ask(long long int, long long int, long long int, long long int, long long int)':
election_campaign.cpp:48:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |   ll mid=L+R>>1;
      |          ~^~
election_campaign.cpp: In function 'int main()':
election_campaign.cpp:131:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |   for(ll j=0;j<d[x].size();++j){
      |              ~^~~~~~~~~~~~
election_campaign.cpp:109:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |  scanf("%lld",&n);
      |  ~~~~~^~~~~~~~~~~
election_campaign.cpp:111:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |   scanf("%lld%lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~
election_campaign.cpp:119:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |  scanf("%lld",&m);
      |  ~~~~~^~~~~~~~~~~
election_campaign.cpp:121:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |   scanf("%lld%lld%lld",&x,&y,&z);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
election_campaign.cpp: In member function 'void Tree::change(long long int, long long int, long long int, long long int, long long int)':
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:33:24: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   33 |   if(l>r||y<l||y>r)s[-1]=1;
      |                    ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp: In member function 'long long int Tree::ask(long long int, long long int, long long int, long long int, long long int)':
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp: In function 'long long int ask(long long int, long long int)':
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
election_campaign.cpp:46:29: warning: array subscript -1 is below array bounds of 'long long int [400400]' [-Warray-bounds]
   46 |   if(L>R||l>r||l<L||r>R)s[-1]=1;
      |                         ~~~~^
election_campaign.cpp:25:5: note: while referencing 'Tree::s'
   25 |  ll s[N<<2];
      |     ^
election_campaign.cpp:53:2: note: defined here 'T'
   53 | }T;
      |  ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...