oj.uz

답안 #1099749

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099749 2024-10-12T05:08:53 Z model_code Treasure (IOI24_treasure) C++17
0 / 100
 1 ms 588 KB 
// failed/wa-idk.cpp

#include <bits/stdc++.h>
#include "treasure.h"
 
using namespace std;
 
const int N=2e5+5;
 
int vis[N];
 
vector<int> encode(vector<pair<int,int>> points)
{
	vector<int> x,y;
	for(int i=0;i<(int)points.size();i++)
	{
		x.push_back(points[i].first);
		y.push_back(points[i].second);
	}
	vector<vector<int> > a;
	for(int i=0;i<(int)x.size();i++)
		a.push_back({x[i],y[i]});
	int n=a.size();
	sort(a.begin(),a.end());
	vector<int> ret;
	for (int i=0;i<n;i++)
	{
		ret.push_back((int)1e9+a[i][0]);
		ret.push_back((int)1.5e9+a[i][1]);
	}
	vector<pair<int,int> > tmp;
	for (int i=0;i<n;i++)
	tmp.push_back({a[i][1],i});
	sort(tmp.begin(),tmp.end());
	int cur=0;
	for (int i=0;i<n;i++)
	{
		cur+=tmp[i].second;
		ret.push_back(cur);
	}
	ret.pop_back();
	return ret;
}
 
vector<pair<int,int>> decode(vector<int> em)
{
	int n=em.size()/3;
	em.push_back(0);
	sort(em.begin(),em.end());
	vector<int> p(n);
	for (int i=1;i<=n;i++)
	p[i-1]=em[i]-em[i-1];
	vector<vector<int> > v;
	for (int i=n+1;i<=2*n;i++)
	v.push_back({em[i]-(int)1e9,0});
	for (int i=2*n+1;i<=3*n;i++)
	v[p[i-2*n-1]][1]=em[i]-(int)1.5e9;
	vector<pair<int,int>> ret;
	for(int i=0;i<n;i++)
	{
		ret.push_back({v[i][0], v[i][1]});
	}
	return ret;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 336 KB Unexpected end of file - int32 expected ()
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 332 KB Unexpected end of file - int32 expected ()
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 588 KB Unexpected end of file - int32 expected ()
2 Halted 0 ms 0 KB -