oj.uz

Submission #300167

# Submission time Handle Problem Language Result Execution time Memory
300167 2020-09-16T22:06:51 Z model_code Carnival Tickets (IOI20_tickets) C++17
0 / 100
 1 ms 360 KB 
// many-call
#include "tickets.h"
#include <vector>

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	allocate_tickets(x);
	allocate_tickets(x);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 288 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 360 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 360 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: allocate_tickets called more than once
2 Halted 0 ms 0 KB -