Task: | Thieves and Prisons |
Sender: | Benjamin Noah Lumbye |
Submission time: | 2019-03-06 14:00:52 +0200 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
#5 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.32 s | 2, 4, 5 | details |
#2 | ACCEPTED | 0.24 s | 2, 4, 5 | details |
#3 | ACCEPTED | 0.33 s | 2, 4, 5 | details |
#4 | ACCEPTED | 0.31 s | 2, 4, 5 | details |
#5 | ACCEPTED | 0.24 s | 2, 4, 5 | details |
#6 | ACCEPTED | 0.32 s | 4, 5 | details |
#7 | ACCEPTED | 0.32 s | 4, 5 | details |
#8 | ACCEPTED | 0.33 s | 4, 5 | details |
#9 | ACCEPTED | 0.32 s | 1, 3, 4, 5 | details |
#10 | ACCEPTED | 0.32 s | 1, 3, 4, 5 | details |
#11 | WRONG ANSWER | 0.32 s | 1, 3, 4, 5 | details |
#12 | ACCEPTED | 0.31 s | 1, 3, 4, 5 | details |
#13 | ACCEPTED | 0.31 s | 1, 3, 4, 5 | details |
#14 | ACCEPTED | 0.32 s | 1, 3, 4, 5 | details |
#15 | ACCEPTED | 0.32 s | 1, 3, 4, 5 | details |
#16 | ACCEPTED | 0.24 s | 1, 3, 4, 5 | details |
#17 | ACCEPTED | 0.32 s | 1, 2, 3, 4, 5 | details |
#18 | ACCEPTED | 0.31 s | 1, 3, 4, 5 | details |
#19 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
#20 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
#21 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
#22 | TIME LIMIT EXCEEDED | -- | 5 | details |
#23 | TIME LIMIT EXCEEDED | -- | 5 | details |
#24 | WRONG ANSWER | 0.49 s | 3, 4, 5 | details |
#25 | WRONG ANSWER | 0.46 s | 3, 4, 5 | details |
#26 | WRONG ANSWER | 0.46 s | 3, 4, 5 | details |
#27 | WRONG ANSWER | 0.47 s | 3, 4, 5 | details |
#28 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
#29 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
#30 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
#31 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
#32 | TIME LIMIT EXCEEDED | -- | 2, 4, 5 | details |
#33 | TIME LIMIT EXCEEDED | -- | 2, 4, 5 | details |
#34 | TIME LIMIT EXCEEDED | -- | 2, 4, 5 | details |
#35 | TIME LIMIT EXCEEDED | -- | 2, 4, 5 | details |
#36 | TIME LIMIT EXCEEDED | -- | 3, 5 | details |
#37 | TIME LIMIT EXCEEDED | -- | 3, 5 | details |
#38 | TIME LIMIT EXCEEDED | -- | 3, 5 | details |
#39 | TIME LIMIT EXCEEDED | -- | 3, 5 | details |
#40 | TIME LIMIT EXCEEDED | -- | 5 | details |
#41 | TIME LIMIT EXCEEDED | -- | 5 | details |
#42 | TIME LIMIT EXCEEDED | -- | 5 | details |
#43 | TIME LIMIT EXCEEDED | -- | 5 | details |
#44 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
#45 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
#46 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
#47 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
Code
import java.util.*; public class ThievesAndPrisons { // First method: Brute force - Just try to put the thieves in prison and see if the assignments are valid. // Should we simulate one at a time - or all at the same time? Lets try one at a time // Alternative methods can be to assign events to the prisoners, so we know if they have to be realeased sometime soon and such. public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int thiefCount = scanner.nextInt(); int prisonCount = scanner.nextInt(); int eventCount = scanner.nextInt(); List<Event> events = new ArrayList<>(eventCount); for (int i = 0; i < eventCount; i++) { Event.Type eType = scanner.next().equals("C") ? Event.Type.CAUGHT : Event.Type.OPEN; events.add(new Event(eType, scanner.nextInt() - 1)); } int runCount = 0; outerloop: while (true) { if (runCount > prisonCount * eventCount) { System.out.println("IMPOSSIBLE"); break; } List<Thief> thieves = new ArrayList<>(thiefCount); for (int i = 0; i < thiefCount; i++) { thieves.add(new Thief(i)); } List<Prison> prisons = new ArrayList<>(prisonCount); for (int i = 0; i < prisonCount; i++) { prisons.add(new Prison(i, thiefCount)); } // Loop through the events and run a simulation String solution = ""; int tryNum = runCount; innerloop: for (int i = 0; i < eventCount; i++) { Event e = events.get(i); int prisonNum = tryNum >= prisonCount ? (tryNum % prisonCount) : Math.max(tryNum, 0); tryNum -= prisonNum + 1; if (e.getType() == Event.Type.CAUGHT) { if (thieves.get(e.getThiefId()).getState() == Thief.State.PRISON) { runCount++; continue outerloop; } else { thieves.get(e.getThiefId()).Catch(prisons.get(prisonNum)); } } else { if (thieves.get(e.getThiefId()).getState() == Thief.State.PRISON || prisons.get(prisonNum).getPrisoners().isEmpty()) { runCount++; continue outerloop; } else { prisons.get(prisonNum).OpenGate(); } } solution += (prisonNum + 1) + " "; } // For loop suceeded, the solution must be possible System.out.println(solution.trim()); break; } scanner.close(); } } class Event { enum Type { CAUGHT, OPEN } Type type; int thiefId; public Event(Type type, int thiefId) { this.type = type; this.thiefId = thiefId; } /** * @return the thiefId */ public int getThiefId() { return thiefId; } /** * @return the type */ public Type getType() { return type; } } class Thief { enum State { FREE, PRISON } int id; State state; Prison currentPrison; public Thief(int id) { this.id = id; this.state = State.FREE; this.currentPrison = null; } /** * @return the state */ public State getState() { return state; } /** * @return the id */ public int getId() { return id; } /** * @return the currentPrison */ public Prison getCurrentPrison() { return currentPrison; } public void Catch(Prison prison) { state = State.PRISON; currentPrison = prison; prison.getPrisoners().add(this); } public void Release() { state = State.FREE; currentPrison = null; } } class Prison { int id; List<Thief> prisoners; public Prison(int id, int thiefCount) { this.id = id; this.prisoners = new ArrayList<>(thiefCount); } public void OpenGate() { for (Thief prisoner : prisoners) { prisoner.Release(); } prisoners.clear(); } /** * @return the id */ public int getId() { return id; } /** * @return the prisoners */ public List<Thief> getPrisoners() { return prisoners; } }
Test details
Test 1
Group: 2, 4, 5
Verdict: ACCEPTED
input |
---|
1 1 1 C 1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Group: 2, 4, 5
Verdict: ACCEPTED
input |
---|
1 1 1 O 1 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 3
Group: 2, 4, 5
Verdict: ACCEPTED
input |
---|
1 1 2 C 1 C 1 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 4
Group: 2, 4, 5
Verdict: ACCEPTED
input |
---|
1 1 2 C 1 O 1 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 5
Group: 2, 4, 5
Verdict: ACCEPTED
input |
---|
1 1 2 O 1 C 1 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Group: 4, 5
Verdict: ACCEPTED
input |
---|
2 1 2 C 1 C 2 |
correct output |
---|
1 1 |
user output |
---|
1 1 |
Test 7
Group: 4, 5
Verdict: ACCEPTED
input |
---|
2 1 2 C 1 O 1 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 8
Group: 4, 5
Verdict: ACCEPTED
input |
---|
2 1 2 C 1 O 2 |
correct output |
---|
1 1 |
user output |
---|
1 1 |
Test 9
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 5 C 1 C 2 O 3 C 1 ... |
correct output |
---|
1 1 1 1 1 |
user output |
---|
1 1 1 1 1 |
Test 10
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 5 C 1 C 2 O 3 O 3 ... |
correct output |
---|
2 1 2 1 1 |
user output |
---|
1 2 2 1 1 |
Test 11
Group: 1, 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
3 2 5 C 1 C 2 O 3 O 1 ... |
correct output |
---|
2 1 2 1 1 |
user output |
---|
IMPOSSIBLE |
Test 12
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 5 C 1 C 2 O 1 O 3 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 13
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 4 C 1 O 2 C 1 O 3 |
correct output |
---|
1 1 1 1 |
user output |
---|
1 1 1 1 |
Test 14
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 4 C 1 O 2 C 2 O 1 |
correct output |
---|
1 1 1 1 |
user output |
---|
1 1 1 1 |
Test 15
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 3 C 1 C 2 C 3 |
correct output |
---|
1 1 1 |
user output |
---|
1 1 1 |
Test 16
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
3 2 3 O 1 C 2 C 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 17
Group: 1, 2, 3, 4, 5
Verdict: ACCEPTED
input |
---|
2 2 7 C 1 O 2 O 2 O 2 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 18
Group: 1, 3, 4, 5
Verdict: ACCEPTED
input |
---|
4 2 5 C 2 O 3 C 1 O 4 ... |
correct output |
---|
1 1 1 1 1 |
user output |
---|
1 1 1 1 1 |
Test 19
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 1 C 2 C 3 C 4 ... |
correct output |
---|
50000 49999 49998 49997 49996 ... |
user output |
---|
(empty) |
Test 20
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 1 C 2 C 3 C 4 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 21
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 1 C 2 C 3 C 4 ... |
correct output |
---|
20000 20000 20000 20000 20000 ... |
user output |
---|
(empty) |
Test 22
Group: 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100 100000 C 1 C 2 C 3 C 4 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 23
Group: 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 99 100000 C 1 C 2 C 3 C 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |
Test 24
Group: 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
500 2 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
IMPOSSIBLE |
Test 25
Group: 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
500 2 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 ... |
user output |
---|
IMPOSSIBLE |
Test 26
Group: 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
500 2 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 ... |
user output |
---|
IMPOSSIBLE |
Test 27
Group: 3, 4, 5
Verdict: WRONG ANSWER
input |
---|
500 2 500 C 384 O 62 C 387 C 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
IMPOSSIBLE |
Test 28
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 250 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 29
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 250 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 2 1 3 ... |
user output |
---|
(empty) |
Test 30
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 250 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 3 2 3 3 2 2 2 5 4 2 ... |
user output |
---|
(empty) |
Test 31
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 250 500 C 384 O 62 C 387 C 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 32
Group: 2, 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 33
Group: 2, 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 2 1 3 ... |
user output |
---|
(empty) |
Test 34
Group: 2, 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 500 C 384 O 62 C 387 O 473 ... |
correct output |
---|
1 1 1 1 2 1 3 3 3 2 2 2 2 4 5 ... |
user output |
---|
(empty) |
Test 35
Group: 2, 4, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 500 C 384 O 62 C 387 C 473 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 36
Group: 3, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 37
Group: 3, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 2 2 1 ... |
user output |
---|
(empty) |
Test 38
Group: 3, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 ... |
user output |
---|
(empty) |
Test 39
Group: 3, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 2 100000 C 89384 O 54062 C 85387 C 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 40
Group: 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 50000 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 41
Group: 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 50000 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 3 2 1 ... |
user output |
---|
(empty) |
Test 42
Group: 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 50000 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 3 2 3 3 3 3 3 3 4 5 ... |
user output |
---|
(empty) |
Test 43
Group: 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 50000 100000 C 89384 O 54062 C 85387 C 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 44
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Test 45
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 3 2 1 ... |
user output |
---|
(empty) |
Test 46
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 89384 O 54062 C 85387 O 53318 ... |
correct output |
---|
1 1 1 1 2 1 3 3 3 3 3 3 4 5 3 ... |
user output |
---|
(empty) |
Test 47
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 100000 C 89384 O 54062 C 85387 C 53318 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |