| 2025 UP ACM Algolympics Final Round |
|---|
| Finished |
| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
2 s, 256 MB
|
|
|
| C |
standard input/output
1 s, 256 MB
|
|
|
| D |
standard input/output
1 s, 256 MB
|
|
|
| E |
standard input/output
6 s, 512 MB
|
|
|
| F |
standard input/output
1 s, 256 MB
|
|
|
| G |
standard input/output
1 s, 256 MB
|
|
|
| H |
standard input/output
1 s, 256 MB
|
|
|
| I |
standard input/output
2 s, 256 MB
|
|
|
| J |
standard input/output
1 s, 256 MB
|
|
|
| K |
standard input/output
1 s, 256 MB
|
|
|
| L |
standard input/output
2 s, 256 MB
|
|
|
| M |
standard input/output
2 s, 256 MB
|
|
| Question | Answer | |
|---|---|---|
|
2025-10-01 11:31:43
|
The goal is to make databases agree after all the commands have been processed. Only the final state matters.
|
|
|
2025-06-06 15:20:31
|
Announcement |
Problem L. Summoner's Rift
***** Anyone who solves this problem gets a balloon |
|
2025-06-06 12:02:55
|
Problem I. The Keeper vs The Overwriter ***** Do |
Only after all the commands
|
| Name |
|---|


