oj.uz

Submission #257121

# Submission time Handle Problem Language Result Execution time Memory
257121 2020-08-03T15:49:28 Z islingr Sticks (POI11_pat) C++17
21 / 100
 233 ms 4308 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define ub(x...) upper_bound(x)

const int K = 1 << 6;
vector<int> s[K];

template<class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int k; cin >> k;
	rep(i, 0, k) {
		int n; cin >> n;
		s[i].resize(n);
		for (auto &x : s[i]) cin >> x;
		sort(all(s[i]));
	}
	rep(ca, 0, k) {
		for (int a : s[ca]) {
			int b = -1, cb, c = -1, cc;
			rep(i, 0, k) {
				if (i == ca || s[i].empty()) continue;
				auto it = ub(all(s[i]), a);
				if (it == begin(s[i])) continue;
				if (ckmax(b, *prev(it))) cb = i;
			}
			if (b < 0) continue;
			rep(i, 0, k) {
				if (i == ca || i == cb || s[i].empty()) continue;
				auto it = ub(all(s[i]), b);
				if (it == begin(s[i])) continue;
				if (ckmax(c, *prev(it))) cc = i;
			}
			if (c < 0) continue;
			++ca; ++cb; ++cc;
			if (b + c > a) {
				cout << ca << ' ' << a << ' ' << cb << ' ' << b <<  ' ' << cc << ' ' << c << '\n';
				return 0;
			}
		}
	}
	cout << "NIE\n";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Expected EOF

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Expected EOF
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Expected EOF
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Expected EOF
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Expected EOF
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 640 KB Expected EOF
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 2296 KB Output is correct
2 Correct 64 ms 1656 KB Output is correct
3 Incorrect 45 ms 1272 KB Expected EOF

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 2296 KB Output is correct
2 Correct 71 ms 1784 KB Output is correct
3 Incorrect 93 ms 1528 KB Expected EOF

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 4216 KB Output is correct
2 Correct 84 ms 2040 KB Output is correct
3 Incorrect 90 ms 2040 KB Expected EOF

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 4308 KB Output is correct
2 Correct 98 ms 2168 KB Output is correct
3 Incorrect 111 ms 2552 KB Expected EOF