Submission #72312

#	Time	Username	Problem	Language	Result	Execution time	Memory
72312		BBBSNG (#118)	Easy Data Structure Problem (FXCUP3_easy)	C++17	33 / 100	22 ms	960 KiB

easy

#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }

const int MAXN = 105;

map<vector<int>, int> MP;

struct SEG {
	int d[256];
	int mx;

	void init(int N) {
		for(mx = 1; mx < N; mx <<= 1);
		fill(d, d+256, INF);
	}
	void upd(int x, int r) {
		for(x = x + mx - 1; x; x >>= 1)
			upmin(d[x], r);
	}
	vector<int> get(int s, int e) {
		vector<int> V;
		for(s = s + mx - 1, e = e + mx - 1; s <= e; s >>= 1, e >>= 1) {
			if(s&1) { V.eb(d[s]); s++; }
			if(~e&1) { V.eb(d[e]); e--; }
		}
		sorv(V);
		return V;
	}
} seg;

int A[MAXN];

int N, Q;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> Q; seg.init(N);
	for(int i = 1; i <= N; i++) {
		cin >> A[i];
		seg.upd(i, A[i]);
	}

	for(int i = 1; i <= N; i++) for(int j = i; j <= N; j++)
		MP[seg.get(i, j)] = i<<10|j;
	
	for(int K; Q--;) {
		vector<int> V;
		cin >> K;
		for(int v; K--;) {
			cin >> v;
			V.eb(v);
		}
		auto it = MP.find(V);
		if(MP.end() == it) puts("-1");
		else printf("%d %d\n", (it -> second) >> 10, (it -> second) & 1023);
	}
	return 0;
}

• Subtask 1: 33 / 33
• Subtask 2: 0 / 67