oj.uz

Submission #200419

# Submission time Handle Problem Language Result Execution time Memory
200419 2020-02-06T19:41:52 Z wjdqhdhfflavldkem12 None (KOI17_cut) C++14
100 / 100
 436 ms 24132 KB 
#include <stdio.h>
#include <vector>
#include <utility>
#include <algorithm>
#include <limits.h>

using namespace std;

#define LEFT 0
#define RIGHT 1
#define node pair<int, bool>

int n, inPeak, outPeak;
vector<node> LIST;

bool compare(node a, node b){
	return a.first < b.first;
}

int main(){
	int i;

	/*변수입력*/
	//꼭짓점의 개수 입력
	scanf("%d", &n);
	//각 꼭짓점의 x, y좌표 입력 & 가장 왼쪽에 있는 수직선분의 두 점 중 아래의 점으로 시작지점으로 지정할 점을 찾는다.
	int xtemp, ytemp, start;
	int minx = INT_MAX, miny = INT_MAX;
	vector<int> x, y;
	for (i = 0; i < n; i++){
		scanf("%d %d", &xtemp, &ytemp);
		x.push_back(xtemp);
		y.push_back(ytemp);
		if (ytemp <= miny && xtemp <= minx){
			start = i;
			minx = xtemp; miny = ytemp;
		}
	}
	// 시작지점 이전의 점들을 시작지점 이후로 옮겨 붙인다.
	for (i = 0; i < start; i++){
		x.push_back(x[i]);
		y.push_back(y[i]);
	}

	/*봉우리의 시작 기둥과 끝기둥을 찾아 입력한다.*/
	//두 개의 기둥을 왼쪽 기둥과 오른쪽 기둥으로 구분하여 입력한다.
	int size = 0;
	pair<int, int> temp;
	for (i = start; i < n+start-1; i++){
		if (y[i]<0 && y[i + 1]>0){
			size++;
			temp.first = i;
		}
		else if (y[i]>0 && y[i + 1] < 0){
			size++;
			temp.second = i;
			if (x[temp.first] < x[temp.second]){
				LIST.push_back(node(x[temp.first], LEFT));
				LIST.push_back(node(x[temp.second], RIGHT));
			}
			else{
				LIST.push_back(node(x[temp.first], RIGHT));
				LIST.push_back(node(x[temp.second], LEFT));
			}
		}
	}

	/*입력된 기둥을 x좌표를 기준으로 오름차순 정렬한다.*/
	sort(LIST.begin(), LIST.end(), compare);
	
	/*기둥의 배치를 이용하여 원하는 봉우리의 개수를 찾는다.*/
	int count = 0;
	for (i = 0; i < size; i++){
		if (LIST[i].second == LEFT){
			count++;
			if (count == 1)
				outPeak++;
		}
		else{
			count--;
			if (LIST[i - 1].second == LEFT)
				inPeak++;
		}
	}

	/*표준출력에 맞추어 출력한다.*/
	printf("%d %d\n", outPeak, inPeak);


	return 0;
}

Compilation message

cut.cpp: In function 'int main()':
cut.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
cut.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &xtemp, &ytemp);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cut.cpp:27:20: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int xtemp, ytemp, start;
                    ^~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 6 ms 380 KB Output is correct
19 Correct 8 ms 632 KB Output is correct
20 Correct 9 ms 760 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 9 ms 760 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 9 ms 760 KB Output is correct
25 Correct 9 ms 760 KB Output is correct
26 Correct 9 ms 760 KB Output is correct
27 Correct 9 ms 760 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 11 ms 1016 KB Output is correct
30 Correct 9 ms 888 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 6 ms 380 KB Output is correct
19 Correct 8 ms 632 KB Output is correct
20 Correct 9 ms 760 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 9 ms 760 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 9 ms 760 KB Output is correct
25 Correct 9 ms 760 KB Output is correct
26 Correct 9 ms 760 KB Output is correct
27 Correct 9 ms 760 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 11 ms 1016 KB Output is correct
30 Correct 9 ms 888 KB Output is correct
31 Correct 87 ms 5848 KB Output is correct
32 Correct 366 ms 20572 KB Output is correct
33 Correct 84 ms 5904 KB Output is correct
34 Correct 321 ms 20644 KB Output is correct
35 Correct 410 ms 23860 KB Output is correct
36 Correct 397 ms 24100 KB Output is correct
37 Correct 428 ms 24132 KB Output is correct
38 Correct 415 ms 23916 KB Output is correct
39 Correct 436 ms 23844 KB Output is correct
40 Correct 397 ms 20016 KB Output is correct
41 Correct 394 ms 20052 KB Output is correct
42 Correct 416 ms 23844 KB Output is correct
43 Correct 383 ms 23980 KB Output is correct
44 Correct 393 ms 24036 KB Output is correct
45 Correct 398 ms 24016 KB Output is correct