제출 #109688

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109688		njchung99	Matryoshka (JOI16_matryoshka)	C++14	26 / 100	3 ms	384 KiB

matryoshka

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
vector<vector<int>> vt;
int dap = 0;
int q, w;
int de[2010];
pair<int, int> a[2010];
int visited[2010];
void dfs(int here) {
	visited[here] = 1;
	for (int i = 0; i < vt[here].size(); i++) {
		int next = vt[here][i];
		if (a[next].first >= q && a[next].second <= w&&!visited[next]) {
			dfs(next);
			break;
		}
	}
}
int main()
{
	int n,m;
	scanf("%d %d", &n,&m);
	vt.resize(n + 1);
	for (int i = 0; i < n; i++) {
		scanf("%d %d", &a[i].first, &a[i].second);
	}
	sort(a, a + n);
	reverse(a, a + n);
	for (int i = 0; i < n; i++) {
		for (int y = 0; y < n; y++)
		{
			if (a[i].first > a[y].first&&a[i].second > a[y].second)
				vt[i].push_back(y);
		}
	}
	while(m--){
		scanf("%d %d", &q, &w);
		memset(de, 0, sizeof(de));
		memset(visited, 0, sizeof(visited));
		int oo = 0;
		for (int i = 0; i < n; i++) {
			if (a[i].first >= q && a[i].second <= w&&!visited[i]) {
				dfs(i);
				oo++;
			}
		}
		printf("%d\n", oo);
	}
}

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

matryoshka.cpp: In function 'void dfs(int)':
matryoshka.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vt[here].size(); i++) {
                  ~~^~~~~~~~~~~~~~~~~
matryoshka.cpp: In function 'int main()':
matryoshka.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n,&m);
  ~~~~~^~~~~~~~~~~~~~~~
matryoshka.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a[i].first, &a[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
matryoshka.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &q, &w);
   ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 15 / 15
• Subtask 3: 0 / 25
• Subtask 4: 0 / 49