| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 7234438 | Jul/24/2014 23:05 | niyaznigmatul# | H3 - Edges are Being Added, Graph is Growing (subtask 3) | GNU C++0x | Time limit exceeded on test 31 | 1000 ms | 15600 KB |
| 7234420 | Jul/24/2014 23:03 | niyaznigmatul# | H2 - Edges are Being Added, Graph is Growing (subtask 2) | GNU C++0x | Accepted | 62 ms | 15600 KB |
| 7234390 | Jul/24/2014 23:01 | niyaznigmatul# | F2 - Multiplication of Polynomials (subtask 2) | GNU C++0x | Accepted | 156 ms | 900 KB |
| 7234388 | Jul/24/2014 23:01 | niyaznigmatul# | F1 - Multiplication of Polynomials (subtask 1) | GNU C++0x | Accepted | 30 ms | 900 KB |
| 7234346 | Jul/24/2014 22:57 | niyaznigmatul# | H3 - Edges are Being Added, Graph is Growing (subtask 3) | GNU C++0x | Time limit exceeded on test 31 | 1000 ms | 15600 KB |
| 7234330 | Jul/24/2014 22:55 | niyaznigmatul# | H3 - Edges are Being Added, Graph is Growing (subtask 3) | GNU C++0x | Time limit exceeded on test 31 | 1000 ms | 29000 KB |
| 7234268 | Jul/24/2014 22:51 | niyaznigmatul# | H3 - Edges are Being Added, Graph is Growing (subtask 3) | GNU C++0x | Time limit exceeded on test 31 | 1000 ms | 26700 KB |
| 7234266 | Jul/24/2014 22:51 | niyaznigmatul# | H2 - Edges are Being Added, Graph is Growing (subtask 2) | GNU C++0x | Accepted | 92 ms | 24600 KB |
| 7234264 | Jul/24/2014 22:51 | niyaznigmatul# | H1 - Edges are Being Added, Graph is Growing (subtask 1) | GNU C++0x | Accepted | 30 ms | 24100 KB |
| 7234228 | Jul/24/2014 22:49 | niyaznigmatul# | H1 - Edges are Being Added, Graph is Growing (subtask 1) | GNU C++0x | Wrong answer on test 7 | 30 ms | 24100 KB |
| 7234221 | Jul/24/2014 22:48 | niyaznigmatul# | H1 - Edges are Being Added, Graph is Growing (subtask 1) | GNU C++0x | Wrong answer on test 7 | 30 ms | 24100 KB |
| 7234033 | Jul/24/2014 22:35 | niyaznigmatul# | B2 - A Set of Subsets (subtask 2) | GNU C++0x | Time limit exceeded on test 12 | 1000 ms | 74200 KB |
| 7233952 | Jul/24/2014 22:31 | niyaznigmatul# | B2 - A Set of Subsets (subtask 2) | GNU C++0x | Time limit exceeded on test 14 | 1000 ms | 0 KB |
| 7233861 | Jul/24/2014 22:26 | niyaznigmatul# | B2 - A Set of Subsets (subtask 2) | GNU C++0x | Time limit exceeded on test 14 | 1000 ms | 0 KB |
| 7233846 | Jul/24/2014 22:26 | niyaznigmatul# | B1 - A Set of Subsets (subtask 1) | GNU C++0x | Accepted | 30 ms | 0 KB |
| 7233739 | Jul/24/2014 22:20 | niyaznigmatul# | B2 - A Set of Subsets (subtask 2) | GNU C++0x | Time limit exceeded on test 13 | 1000 ms | 0 KB |
| 7233673 | Jul/24/2014 22:17 | niyaznigmatul# | B2 - A Set of Subsets (subtask 2) | GNU C++0x | Time limit exceeded on test 13 | 1000 ms | 0 KB |
| 7233657 | Jul/24/2014 22:17 | niyaznigmatul# | B1 - A Set of Subsets (subtask 1) | GNU C++0x | Accepted | 156 ms | 0 KB |
| 7199744 | Jul/22/2014 09:15 | Al2K | F2 - Multiplication of Polynomials (subtask 2) | GNU C++ | Accepted | 92 ms | 7800 KB |
| 7199739 | Jul/22/2014 09:14 | Al2K | F1 - Multiplication of Polynomials (subtask 1) | GNU C++ | Accepted | 30 ms | 7800 KB |
| 7053447 | Jul/09/2014 17:34 | morojenoe | H1 - Edges are Being Added, Graph is Growing (subtask 1) | GNU C++ | Wrong answer on test 2 | 62 ms | 11700 KB |
| 7052912 | Jul/09/2014 15:54 | morojenoe | I4 - Sum of everything (subtask 4) | GNU C++ | Accepted | 436 ms | 200 KB |
| 7052909 | Jul/09/2014 15:54 | morojenoe | I3 - Sum of everything (subtask 3) | GNU C++ | Accepted | 62 ms | 200 KB |
| 7052906 | Jul/09/2014 15:53 | morojenoe | I2 - Sum of everything (subtask 2) | GNU C++ | Accepted | 30 ms | 200 KB |
| 7052902 | Jul/09/2014 15:53 | morojenoe | I1 - Sum of everything (subtask 1) | GNU C++ | Accepted | 30 ms | 200 KB |
| 7052346 | Jul/09/2014 14:14 | morojenoe | G2 - Division of Polynomials (subtask 2) | GNU C++ | Accepted | 124 ms | 1600 KB |
| 7052345 | Jul/09/2014 14:14 | morojenoe | G1 - Division of Polynomials (subtask 1) | GNU C++ | Accepted | 30 ms | 1600 KB |
| 7052276 | Jul/09/2014 14:00 | morojenoe | G1 - Division of Polynomials (subtask 1) | GNU C++ | Wrong answer on test 10 | 30 ms | 1600 KB |
| 7052123 | Jul/09/2014 13:31 | morojenoe | F2 - Multiplication of Polynomials (subtask 2) | GNU C++ | Accepted | 156 ms | 1600 KB |
| 7052120 | Jul/09/2014 13:31 | morojenoe | F1 - Multiplication of Polynomials (subtask 1) | GNU C++ | Accepted | 30 ms | 1600 KB |
| 7052015 | Jul/09/2014 13:10 | morojenoe | H3 - Edges are Being Added, Graph is Growing (subtask 3) | GNU C++ | Time limit exceeded on test 29 | 1000 ms | 27300 KB |
| 7052012 | Jul/09/2014 13:10 | morojenoe | H2 - Edges are Being Added, Graph is Growing (subtask 2) | GNU C++ | Accepted | 248 ms | 14600 KB |
| 7052010 | Jul/09/2014 13:10 | morojenoe | H1 - Edges are Being Added, Graph is Growing (subtask 1) | GNU C++ | Accepted | 30 ms | 12000 KB |
| 7052009 | Jul/09/2014 13:09 | morojenoe | H1 - Edges are Being Added, Graph is Growing (subtask 1) | GNU C++ | Accepted | 30 ms | 11900 KB |
| 6639286 | May/17/2014 02:55 | ikheifets | K1 - Maximal clique (subtask 1) | FPC | Accepted | 436 ms | 0 KB |
| 6639178 | May/17/2014 02:09 | ikheifets | A1 - Triple-matching (subtask 1) | GNU C++ | Accepted | 92 ms | 0 KB |
| 6607595 | May/13/2014 08:25 | I_love_Tanya_Romanova | O2 - Almost bipartite beast (subtask 2) | GNU C++ | Wrong answer on test 49 | 468 ms | 200 KB |
| 6607594 | May/13/2014 08:24 | I_love_Tanya_Romanova | O1 - Almost bipartite beast (subtask 1) | GNU C++ | Accepted | 468 ms | 200 KB |
| 6607557 | May/13/2014 08:13 | I_love_Tanya_Romanova | N2 - SAT USAT (subtask 2) | GNU C++ | Time limit exceeded on test 19 | 1000 ms | 0 KB |
| 6607553 | May/13/2014 08:12 | I_love_Tanya_Romanova | N1 - SAT USAT (subtask 1) | GNU C++ | Accepted | 62 ms | 0 KB |
| 6607552 | May/13/2014 08:11 | I_love_Tanya_Romanova | M5 - The Easiest Way is to Paint in Three Colors (subtask 5) | GNU C++ | Time limit exceeded on test 78 | 1000 ms | 300 KB |
| 6607550 | May/13/2014 08:10 | I_love_Tanya_Romanova | M4 - The Easiest Way is to Paint in Three Colors (subtask 4) | GNU C++ | Accepted | 122 ms | 300 KB |
| 6607544 | May/13/2014 08:09 | I_love_Tanya_Romanova | M3 - The Easiest Way is to Paint in Three Colors (subtask 3) | GNU C++ | Accepted | 30 ms | 300 KB |
| 6607543 | May/13/2014 08:09 | I_love_Tanya_Romanova | M2 - The Easiest Way is to Paint in Three Colors (subtask 2) | GNU C++ | Accepted | 30 ms | 300 KB |
| 6607542 | May/13/2014 08:08 | I_love_Tanya_Romanova | M1 - The Easiest Way is to Paint in Three Colors (subtask 1) | GNU C++ | Accepted | 30 ms | 200 KB |
| 6607537 | May/13/2014 08:07 | I_love_Tanya_Romanova | L3 - Learning to paint (subtask 3) | GNU C++ | Wrong answer on test 69 | 124 ms | 3400 KB |
| 6607535 | May/13/2014 08:06 | I_love_Tanya_Romanova | L2 - Learning to paint (subtask 2) | GNU C++ | Accepted | 154 ms | 3400 KB |
| 6607533 | May/13/2014 08:05 | I_love_Tanya_Romanova | L1 - Learning to paint (subtask 1) | GNU C++ | Accepted | 122 ms | 3400 KB |
| 6607520 | May/13/2014 08:02 | I_love_Tanya_Romanova | K3 - Maximal clique (subtask 3) | GNU C++ | Wrong answer on test 23 | 872 ms | 0 KB |
| 6607515 | May/13/2014 08:01 | I_love_Tanya_Romanova | K2 - Maximal clique (subtask 2) | GNU C++ | Accepted | 342 ms | 0 KB |