oj.uz

답안 #117068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117068 2019-06-14T15:13:37 Z MvC 모임들 (IOI18_meetings) C++14
36 / 100
 1101 ms 239940 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "meetings.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const ll nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,q,i,j,x,y,lst,t,st[4*nmax];
ll h[nmax],p[5050][5050],s[5050][5050],mx;
vector<pair<int,int> >a[nmax],b[nmax];
vector<ll>rs;
void upd(int nod,int l,int r,int p,int v)
{
	if(l==r)
	{
		st[nod]=max(v,st[nod]);
		return;
	}
	int mid=(l+r)/2;
	if(p<=mid)upd(2*nod,l,mid,p,v);
	else upd(2*nod+1,mid+1,r,p,v);
	st[nod]=max(st[2*nod],st[2*nod+1]);
}
int qry(int nod,int l,int r,int tl,int tr)
{
	if(tr<l || tl>r)return 0;
	if(tl<=l && r<=tr)return st[nod];
	int mid=(l+r)/2;
	int v=0;
	if(tl<=mid)v=qry(2*nod,l,mid,tl,tr);
	if(tr>mid)v=max(v,qry(2*nod+1,mid+1,r,tl,tr));
	return v;
}
vector<ll> minimum_costs(vector<int>H,vector<int>L,vector<int>R)
{
	n=H.size(),q=L.size();
	for(i=1;i<=n;i++)h[i]=H[i-1];
	h[n+1]=h[0]=2;
	for(i=0;i<q;i++)
	{
		x=L[i],y=R[i];
		x++,y++;
		if(x>y)swap(x,y);
		a[y].pb(mkp(x,i));
		b[x].pb(mkp(y,i));
	}
	rs.resize(q);
	if(n<=5000 && q<=5000)
	{
		for(i=0;i<q;i++)rs[i]=llinf;
		for(i=1;i<=n;i++)
		{
			mx=0;
			for(j=i;j<=n;j++)
			{
				mx=max(mx,h[j]);
				p[i][j]=p[i][j-1]+mx;
			}
			mx=0;
			for(j=i-1;j>=1;j--)
			{
				mx=max(mx,h[j]);
				s[i][j]=s[i][j+1]+mx;
			}
		}
		for(i=1;i<=n;i++)
		{
			for(j=0;j<a[i].size();j++)
			{
				x=a[i][j].fr,y=i;
				for(t=x;t<=y;t++)
				{
					rs[a[i][j].sc]=min(rs[a[i][j].sc],p[t][y]+s[t][x]);
				}
			}
		}
		return rs;
	}
	for(i=1;i<=n;i++)
	{
		if(h[i]==2)lst=i;
		if(lst!=i && h[i+1]==2)upd(1,1,n,lst+1,i-lst);
		for(j=0;j<a[i].size();j++)rs[a[i][j].sc]=qry(1,1,n,a[i][j].fr,i);
	}
	lst=0;
	for(i=1;i<=n;i++)
	{
		if(h[i]==2)lst=i;
		for(j=0;j<a[i].size();j++)rs[a[i][j].sc]=max(rs[a[i][j].sc],1LL*i-1LL*max(lst,a[i][j].fr-1));
	}
	lst=n+1;
	for(i=n;i>=1;i--)
	{
		if(h[i]==2)lst=i;
		for(j=0;j<b[i].size();j++)rs[b[i][j].sc]=max(rs[b[i][j].sc],1LL*min(lst,b[i][j].fr+1)-1LL*i);
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<a[i].size();j++)
		{
			rs[a[i][j].sc]=rs[a[i][j].sc]+(i-a[i][j].fr+1-rs[a[i][j].sc])*2;
		}
	}
	return rs;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>q;
	for(i=1;i<=n;i++)cin>>h[i];
	h[n+1]=h[0]=2;
	for(i=1;i<=q;i++)
	{
		cin>>x>>y;
		a[y].pb(mkp(x,i-1));
		b[x].pb(mkp(y,i-1));
	}
	rs.resize(q);
	if(n<=5000 && q<=5000)
	{
		for(i=0;i<q;i++)rs[i]=llinf;
		for(i=1;i<=n;i++)
		{
			mx=0;
			for(j=i;j<=n;j++)
			{
				mx=max(mx,h[j]);
				p[i][j]=p[i][j-1]+mx;
			}
			mx=0;
			for(j=i-1;j>=1;j--)
			{
				mx=max(mx,h[j]);
				s[i][j]=s[i][j+1]+mx;
			}
		}
		for(i=1;i<=n;i++)
		{
			for(j=0;j<a[i].size();j++)
			{
				x=a[i][j].fr,y=i;
				for(t=x;t<=y;t++)
				{
					rs[a[i][j].sc]=min(rs[a[i][j].sc],p[t][y]+s[t][x]);
				}
			}
		}
	}
	for(i=1;i<=n;i++)
	{
		if(h[i]==2)lst=i;
		if(lst!=i && h[i+1]==2)upd(1,1,n,lst+1,i-lst);
		for(j=0;j<a[i].size();j++)rs[a[i][j].sc]=qry(1,1,n,a[i][j].fr,i);
	}
	lst=0;
	for(i=1;i<=n;i++)
	{
		if(h[i]==2)lst=i;
		for(j=0;j<a[i].size();j++)rs[a[i][j].sc]=max(rs[a[i][j].sc],1LL*i-1LL*max(lst,a[i][j].fr-1));
	}
	lst=n+1;
	for(i=n;i>=1;i--)
	{
		if(h[i]==2)lst=i;
		for(j=0;j<b[i].size();j++)rs[b[i][j].sc]=max(rs[b[i][j].sc],1LL*min(lst,b[i][j].fr+1)-1LL*i);
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<a[i].size();j++)
		{
			rs[a[i][j].sc]=rs[a[i][j].sc]+(i-a[i][j].fr+1-rs[a[i][j].sc])*2;
		}
	}
    return 0;
}*/

Compilation message

meetings.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
meetings.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:82:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(j=0;j<a[i].size();j++)
            ~^~~~~~~~~~~~
meetings.cpp:97:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<a[i].size();j++)rs[a[i][j].sc]=qry(1,1,n,a[i][j].fr,i);
           ~^~~~~~~~~~~~
meetings.cpp:103:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<a[i].size();j++)rs[a[i][j].sc]=max(rs[a[i][j].sc],1LL*i-1LL*max(lst,a[i][j].fr-1));
           ~^~~~~~~~~~~~
meetings.cpp:109:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<b[i].size();j++)rs[b[i][j].sc]=max(rs[b[i][j].sc],1LL*min(lst,b[i][j].fr+1)-1LL*i);
           ~^~~~~~~~~~~~
meetings.cpp:113:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<a[i].size();j++)
           ~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 113 ms 99780 KB Output is correct
3 Correct 115 ms 99780 KB Output is correct
4 Correct 114 ms 99788 KB Output is correct
5 Correct 116 ms 99828 KB Output is correct
6 Correct 113 ms 99804 KB Output is correct
7 Correct 113 ms 99860 KB Output is correct
8 Correct 113 ms 99832 KB Output is correct
9 Correct 115 ms 99812 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 113 ms 99780 KB Output is correct
3 Correct 115 ms 99780 KB Output is correct
4 Correct 114 ms 99788 KB Output is correct
5 Correct 116 ms 99828 KB Output is correct
6 Correct 113 ms 99804 KB Output is correct
7 Correct 113 ms 99860 KB Output is correct
8 Correct 113 ms 99832 KB Output is correct
9 Correct 115 ms 99812 KB Output is correct
10 Correct 529 ms 239940 KB Output is correct
11 Correct 1099 ms 239788 KB Output is correct
12 Correct 535 ms 239852 KB Output is correct
13 Correct 1101 ms 239784 KB Output is correct
14 Correct 551 ms 239888 KB Output is correct
15 Correct 547 ms 239852 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 55 ms 8252 KB Output is correct
3 Correct 177 ms 14708 KB Output is correct
4 Correct 170 ms 14568 KB Output is correct
5 Correct 171 ms 17016 KB Output is correct
6 Correct 179 ms 16400 KB Output is correct
7 Correct 156 ms 13788 KB Output is correct

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 55 ms 8252 KB Output is correct
3 Correct 177 ms 14708 KB Output is correct
4 Correct 170 ms 14568 KB Output is correct
5 Correct 171 ms 17016 KB Output is correct
6 Correct 179 ms 16400 KB Output is correct
7 Correct 156 ms 13788 KB Output is correct
8 Incorrect 171 ms 14740 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 113 ms 99780 KB Output is correct
3 Correct 115 ms 99780 KB Output is correct
4 Correct 114 ms 99788 KB Output is correct
5 Correct 116 ms 99828 KB Output is correct
6 Correct 113 ms 99804 KB Output is correct
7 Correct 113 ms 99860 KB Output is correct
8 Correct 113 ms 99832 KB Output is correct
9 Correct 115 ms 99812 KB Output is correct
10 Correct 529 ms 239940 KB Output is correct
11 Correct 1099 ms 239788 KB Output is correct
12 Correct 535 ms 239852 KB Output is correct
13 Correct 1101 ms 239784 KB Output is correct
14 Correct 551 ms 239888 KB Output is correct
15 Correct 547 ms 239852 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 55 ms 8252 KB Output is correct
18 Correct 177 ms 14708 KB Output is correct
19 Correct 170 ms 14568 KB Output is correct
20 Correct 171 ms 17016 KB Output is correct
21 Correct 179 ms 16400 KB Output is correct
22 Correct 156 ms 13788 KB Output is correct
23 Incorrect 171 ms 14740 KB Output isn't correct
24 Halted 0 ms 0 KB -