제출 #1110270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1110270		vjudge1	Card Collection (JOI24_collection)	C++17	11 / 100	4116 ms	793176 KiB

Main

#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
int n,m,a[2005],b[2005];
vector<pair<int,int>> vv,truyvan;
vector<pair<int,int>> val[2005][2005];
map<pair<int,int>,bool> mp;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
//	freopen(".INP","r",stdin);
//	freopen(".OUT","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i]>>b[i];
		vv.pb({a[i],b[i]});
	}
	for(int i=1;i<=n;i++)
	{
		val[i][i].pb({a[i],b[i]});
	}
	
	for(int le=2;le<=n;le++)
	{
		for(int l=1;l<=n-le+1;l++)
		{
			int r=l+le-1;
			for(int i=l;i<=r-1;i++)
			{
				for(auto x:val[l][i])
				{
					for(auto y:val[i+1][r])
					{
						pair<int,int> gtri1={min(x.fi,y.fi),min(x.se,y.se)};
						pair<int,int> gtri2={max(x.fi,y.fi),max(x.se,y.se)};
						val[l][r].pb(gtri1);
						val[l][r].pb(gtri2);
					}
				}
			}
			sort(val[l][r].begin(),val[l][r].end());
			val[l][r].erase(unique(val[l][r].begin(),val[l][r].end()),val[l][r].end()); 
		}
	}
	
	for(auto x:val[1][n]) mp[x]=true;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		if(mp[{u,v}]) cout<<i<<' ';
	}
	
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 38
• Subtask 3: 0 / 22
• Subtask 4: 0 / 29