제출 #66203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66203		junodeveloper	조화행렬 (KOI18_matrix)	C++17	100 / 100	609 ms	108692 KiB

matrix

#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = 1e9 + 10;
int m, n, a[3][200010];
set<pair<int,int> > st[200010];
pair<int,int> p[200010];
bool Check(int k, pair<int,int>& v) {
	auto it = st[k].lower_bound({v.first, -INF});
	if(it == st[k].begin()) return 0;
	--it;
	return it->second < v.second;
}
void Push(int k, pair<int,int>& v) {
	auto it = st[k].lower_bound({v.first, INF});
	if(it != st[k].begin()) {
		--it;
		if(it->second <= v.second) return;
		if(it->first < v.first) ++it;
	}
	while(it != st[k].end() && it->second >= v.second)
		it = st[k].erase(it);
	st[k].insert(v);
}
int main() {
	scanf("%d%d", &m, &n);
	for(int i=0; i<m; i++) for(int j=1; j<=n; j++)
			scanf("%d", &a[i][j]);
	vector<pair<int,pair<int,int> > > Vq;
	for(int i=1; i<=n; i++)
		Vq.push_back({a[0][i], {a[1][i], a[m == 3 ? 2 : 0][i]}});
	sort(all(Vq));
	int res = 0;
	for(int i=0; i<sz(Vq); i++) {
		int lo = 0, hi = i;
		while(lo < hi) {
			int mid = (lo + hi + 1) / 2;
			if(Check(mid, Vq[i].second)) lo = mid;
			else hi = mid - 1;
		}
		Push(lo+1, Vq[i].second);
		res = max(res, lo+1);
	}
	printf("%d", res);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

matrix.cpp: In function 'int main()':
matrix.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &m, &n);
  ~~~~~^~~~~~~~~~~~~~~~
matrix.cpp:31:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 9 / 9
• Subtask 3: 15 / 15
• Subtask 4: 62 / 62