oj mrJudge
Toggle navigation
  • Login
    • Forget Password
      Login
User Image

Hello, Stranger

Guest
  • Analysis Mode
  • Problems
    • All Problems
    • Latest Problems
  • Join Us Now
  • Registration
  • Contact Us
  • Infomation
  • About
    • Terms of Use
    • Technical Specifications
    • Credits

otoci Batch , stdin/stdout

Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

README.txt

ATTENTION: We've reimplemented the interactive in the function call format.
All necessary files are in the attachments

Include otoci.h at the beginning of your code. You'll need to implement 4 functions:
void init(int N, int Q, int P[]) - called once at the start
bool bridge(int A, int B) - bridges A and B together, return true if successful, false otherwise
void penguins(int A, int X) - there are now X penguins on island A
int excursion(int A, int B) - returns number of penguins on an excursion from island A to B. If an excursion is impossible, return -1

otoci.pdf

Your browser does not support embedded PDF files. Please download the PDF instead.

Tags

Graph Theory

Subtasks and Limits

Subtask Score #TC Time Memory Scoring
1100105s128MBAverage
2025s128MBAverage

Attachments

Attachment Filesize Last Updated
otoci.h119B30 Jun 2018, 20:21:52
grader.cpp628B30 Jun 2018, 20:21:52

Judge Compile Command

g++-8 otoci.cpp grader.cpp -o otoci -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512

Accepted Submissions

subIDUserTimeMax Time

Past Submissions

subIDUserTimeScore
mrJudge 09.05.20
Copyright © 2020 mrJudge. All rights reserved.