| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 863288 |
2023-10-20T01:24:34 Z |
ibm2006 |
Meteors (POI11_met) |
C++17 |
|
6000 ms |
65536 KB |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef __int128 lll;
ll n,e,i,j,k,x,z,w,l,r,m,q,lazy[1100000],a[330000],le[330000],ri[330000],s,seg[1100000],y;
ll te1,te2,te3;
vector<int> v[330000],u[330000];
pair<int,int> p[330000];
pair<pair<int,int>,ll> upd[330000];
void h(ll x,ll y,ll z)
{
if(lazy[z]==0)
return;
if(z>=524288)
{
seg[z]+=lazy[z];
lazy[z]=0;
return;
}
seg[z]+=(y-x+1)*lazy[z];
lazy[z*2]+=lazy[z];
lazy[z*2+1]+=lazy[z];
lazy[z]=0;
return;
}
void Clear()
{
ll i;
for(i=0;i<1100000;i++)
{
seg[i]=0;
lazy[i]=0;
}
}
void f(ll x,ll y,ll z,ll w)
{
h(x,y,z);
if(l>y||x>r)
return;
if(l<=x&&y<=r)
{
lazy[z]+=w;
h(x,y,z);
return;
}
f(x,(x+y)/2,z*2,w);
f((x+y)/2+1,y,z*2+1,w);
seg[z]=seg[z*2]+seg[z*2+1];
}
ll g(ll x,ll y,ll z)
{
h(x,y,z);
if(l>y||x>r)
return 0;
if(l<=x&&y<=r)
{
return seg[z];
}
return g(x,(x+y)/2,z*2)+g((x+y)/2+1,y,z*2+1);
}
int main()
{
scanf("%lld %lld",&te1,&te2);
n=te1;
m=te2;
for(i=1;i<=m;i++)
{
scanf("%lld",&te1);
x=te1;
//x=1;
v[x].push_back(i);
}
for(i=1;i<=n;i++)
{
scanf("%lld",&te1);
a[i]=te1;
//a[i]=1e9;
}
scanf("%lld",&te1);
q=te1;
for(i=1;i<=q;i++)
{
scanf("%lld %lld %lld",&te1,&te2,&te3);
x=te1;
w=te2;
z=te3;
//x=1; w=m; z=1;
upd[i]={{x,w},z};
}
for(i=1;i<=n;i++)
{
le[i]=1;
ri[i]=q+1;
p[i]={(le[i]+ri[i])/2,i};
}
for(e=0;e<40;e++)
{
//printf("!");
//for(i=1;i<=n;i++)
// printf("(%lld,%lld)\n",le[i],ri[i]);
Clear();
s=1;
for(i=1;i<=q+1;i++)
{
u[i].clear();
}
for(i=1;i<=n;i++)
u[p[i].first].push_back(p[i].second);
for(i=1;i<=q+1;i++)
{
//printf("%lld\n",i);
if(i<=q)
{x=upd[i].first.first;
y=upd[i].first.second;
z=upd[i].second;
if(x<=y)
{
l=x;
r=y;
f(1,524288,1,z);
}
else
{
l=x;
r=m;
f(1,524288,1,z);
l=1;
r=y;
f(1,524288,1,z);
}
}
//printf("?");
for(j=0;j<u[i].size();j++)
{
x=u[i][j];
y=0;
for(k=0;k<v[x].size();k++)
{
l=v[x][k];
r=v[x][k];
y+=g(1,524288,1);}
if(a[x]<=y)
{
ri[x]=i;
}
else
le[x]=i+1;
le[x]=min(le[x],q+1);
// printf("[%lld,%lld]\n",(le[x]+ri[x])/2,x);
p[s]={(le[x]+ri[x])/2,x};
s++;
}
}
//swap(p,pp);
}
for(i=1;i<=n;i++)
{
a[p[i].second]=p[i].first;
}
for(i=1;i<=n;i++)
{
te1=a[i];
if(a[i]>=q+1)
{
printf("NIE\n");
}
else
printf("%lld\n",te1);
}
}
Compilation message
met.cpp: In function 'int main()':
met.cpp:133:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
133 | for(j=0;j<u[i].size();j++)
| ~^~~~~~~~~~~~
met.cpp:137:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
137 | for(k=0;k<v[x].size();k++)
| ~^~~~~~~~~~~~
met.cpp:146:17: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
146 | else
| ^~~~
met.cpp:148:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
148 | le[x]=min(le[x],q+1);
| ^~
met.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | scanf("%lld %lld",&te1,&te2);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
met.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | scanf("%lld",&te1);
| ~~~~~^~~~~~~~~~~~~
met.cpp:75:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
75 | scanf("%lld",&te1);
| ~~~~~^~~~~~~~~~~~~
met.cpp:79:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
79 | scanf("%lld",&te1);
| ~~~~~^~~~~~~~~~~~~
met.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
83 | scanf("%lld %lld %lld",&te1,&te2,&te3);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
61 ms |
42588 KB |
Output is correct |
| 2 |
Correct |
62 ms |
42328 KB |
Output is correct |
| 3 |
Correct |
62 ms |
42328 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
42328 KB |
Output is correct |
| 2 |
Correct |
66 ms |
42328 KB |
Output is correct |
| 3 |
Correct |
67 ms |
42332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1340 ms |
45408 KB |
Output is correct |
| 2 |
Correct |
1770 ms |
49108 KB |
Output is correct |
| 3 |
Correct |
1578 ms |
48816 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1599 ms |
46416 KB |
Output is correct |
| 2 |
Correct |
1612 ms |
46392 KB |
Output is correct |
| 3 |
Correct |
1805 ms |
49316 KB |
Output is correct |
| 4 |
Correct |
491 ms |
46128 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
798 ms |
45908 KB |
Output is correct |
| 2 |
Correct |
1165 ms |
49748 KB |
Output is correct |
| 3 |
Correct |
911 ms |
44644 KB |
Output is correct |
| 4 |
Correct |
1514 ms |
49100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1699 ms |
44868 KB |
Output is correct |
| 2 |
Correct |
1551 ms |
46228 KB |
Output is correct |
| 3 |
Correct |
1402 ms |
45372 KB |
Output is correct |
| 4 |
Correct |
1703 ms |
50260 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6061 ms |
65536 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6016 ms |
65536 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
