oj.uz

Submission #30071

# Submission time Handle Problem Language Result Execution time Memory
30071 2017-07-22T04:35:43 Z 시제연(#1249) Temperature (POI11_tem) C++11
100 / 100
 409 ms 12604 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;
int n;
int S[1000100], E[1000100];
deque<pii> dq;

void push(pii a) {
	while(!dq.empty()&&dq.back().second<=a.second) dq.pop_back();
	dq.push_back(a);
}

int main() {
	int i, j, res = 1;

	scanf("%d",&n);
	for (i=0;i<n;i++) scanf("%d%d",&S[i],&E[i]);
	i = 0; j = -1;
	for (;i<n;i++) {
		if (!dq.empty()&&dq.front().first<i) dq.pop_front();
		if (j<i) {j=i;push(pii(j,S[j]));}
		for (;j+1<n;) {
			if (dq.front().second<=E[j+1]) {j++;push(pii(j,S[j]));}
			else break;
		}
		res = max(res,j-i+1);
	}
	printf("%d\n",res);

    return 0;
}

Compilation message

tem.cpp: In function 'int main()':
tem.cpp:18:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
tem.cpp:19:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i=0;i<n;i++) scanf("%d%d",&S[i],&E[i]);
                                             ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9832 KB Output is correct
2 Correct 0 ms 9832 KB Output is correct
3 Correct 0 ms 9832 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9832 KB Output is correct
2 Correct 0 ms 9832 KB Output is correct
3 Correct 0 ms 9832 KB Output is correct
4 Correct 0 ms 9832 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9832 KB Output is correct
2 Correct 3 ms 9832 KB Output is correct
3 Correct 3 ms 9832 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 9832 KB Output is correct
2 Correct 116 ms 9832 KB Output is correct
3 Correct 146 ms 9832 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 9832 KB Output is correct
2 Correct 283 ms 9832 KB Output is correct
3 Correct 243 ms 11672 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 9832 KB Output is correct
2 Correct 303 ms 9832 KB Output is correct
3 Correct 346 ms 12076 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 373 ms 9832 KB Output is correct
2 Correct 246 ms 9832 KB Output is correct
3 Correct 383 ms 12604 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 10360 KB Output is correct
2 Correct 196 ms 10348 KB Output is correct
3 Correct 279 ms 9832 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 9832 KB Output is correct
2 Correct 213 ms 9832 KB Output is correct
3 Correct 209 ms 9832 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 9832 KB Output is correct
2 Correct 163 ms 9832 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 9832 KB Output is correct
2 Correct 409 ms 12472 KB Output is correct

Subtask #12
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 9832 KB Output is correct
2 Correct 363 ms 12208 KB Output is correct