oj.uz

Submission #277612

# Submission time Handle Problem Language Result Execution time Memory
277612 2020-08-21T06:17:12 Z 임성재(#5118) Interval Collection (CCO20_day2problem2) C++17
0 / 25
 7000 ms 6728 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define mb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int q;
multiset<pii> s;
multiset<pii> ans;

int main() {
	fast;

	cin >> q;

	for(int i=0; i<q; i++) {
		char c;
		int l, r;
		cin >> c >> l >> r;

		if(c == 'A') {
			s.insert(mp(l, r));
		}
		else {
			s.erase(mp(l, r));
		}

		ans.clear();
		for(auto i : s) {
			for(auto j : s) {
				int u = max(0, min(i.se, j.se) - max(i.fi, j.fi));
				int v = max(i.se, j.se) - min(i.fi, j.fi);

				ans.insert(mp(u, v));
			}
		}

		cout << ans.begin()->se << "\n";
	}
}

Subtask #1
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6278 ms 3496 KB Output is correct
2 Correct 205 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6714 ms 3724 KB Output is correct
6 Correct 242 ms 512 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 128 ms 564 KB Output is correct
9 Execution timed out 7041 ms 6124 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6278 ms 3496 KB Output is correct
2 Correct 205 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6714 ms 3724 KB Output is correct
6 Correct 242 ms 512 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 128 ms 564 KB Output is correct
9 Execution timed out 7041 ms 6124 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6278 ms 3496 KB Output is correct
2 Correct 205 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6714 ms 3724 KB Output is correct
6 Correct 242 ms 512 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 128 ms 564 KB Output is correct
9 Execution timed out 7041 ms 6124 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 7042 ms 6728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6278 ms 3496 KB Output is correct
2 Correct 205 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 6714 ms 3724 KB Output is correct
6 Correct 242 ms 512 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 128 ms 564 KB Output is correct
9 Execution timed out 7041 ms 6124 KB Time limit exceeded
10 Halted 0 ms 0 KB -