oj.uz

Submission #651390

# Submission time Handle Problem Language Result Execution time Memory
651390 2022-10-18T16:19:24 Z Alan Handcrafted Gift (IOI20_gift) C++17
0 / 100
 1 ms 304 KB 
#include <bits/stdc++.h>
#include "gift.h"
using namespace std;

int construct(int n, int m, vector<int> a, vector<int> b, vector<int> x) {
    string s (n, 0);
	vector<int> d (n+1), ps (n+1);
	for (int i = 0; i < m; i++) if (x[i] == 1) {
		d[a[i]]++;
		d[b[i]+1]--;
	}
	bool r = true;
	for (int i = 0; i < n; i++) {
		if (!d[i]) r = !r;
		s[i] = r ? 'R' : 'B';
		ps[i] += s[i] == 'B';
		if (i) ps[i] += ps[i-1];
	}
	for (int i = 0; i < m; i++) if (x[i] == 2) {
		int diff = ps[b[i]] - (a[i] ? ps[a[i]] : 0);
		if (diff == 0 || diff == b[i]-a[i]+1) return 0;
	}
	craft(s);
    return 1;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Requirement 0 not satisfied
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Possible does not match answer file
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Possible does not match answer file
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 304 KB Possible does not match answer file
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Requirement 0 not satisfied
2 Halted 0 ms 0 KB -