Submission #90912

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
90912	2018-12-25T07:34:17 Z	Rakhmand	Temperature (POI11_tem)	C++14	8 / 100	234 ms	33792 KB

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>

#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define mp make_pair
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define ll long long
#define lp(i, start, finish) for(int i = start; i <= finish; i++)
#define y1 ljdalsdfjak

const long long MXN = 1e6 + 1;
const long long MNN = 3 * 1e3 + 1;
const long long MOD = 1e9 + 7;
const long long INF = 1e16 + 1;
const long long OO = 1e15;

typedef long long llong;
typedef unsigned long long ullong;

using namespace std;

llong n, b[MXN], cnt = 1, mx;
pair<int, int> p[MXN];

int main(){
	ios;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> p[i].F >> p[i].S;
	}b[1] = p[1].F;
	for(int i = 2; i <= n; i++){
		if(p[i].F <= b[i - 1]){
			if(b[i - 1] <= p[i].S){
				b[i] = b[i - 1];
			}else{
				b[i] = p[i].F;
			}
		}else{
			b[i] = p[i].F;
		}
	}for(int i = 1; i <= n; i++){
		if(b[i - 1] <= b[i]){
			cnt++;
		}else{
			mx = max(cnt, mx);
			cnt = 1;
		}
	}cout << mx;
	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	684 KB	Output is correct
2	Incorrect	2 ms	864 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	992 KB	Output is correct
2	Incorrect	3 ms	1168 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	68 ms	11144 KB	Output is correct
2	Incorrect	73 ms	15704 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	149 ms	29512 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	197 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	234 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	202 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	113 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	115 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #11
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	183 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	176 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Submission #90912

Compilation message