MikeMirzayanov's blog

Codeforces Beta Round #44 (Div. 2)
By MikeMirzayanov, 14 years ago, translation, In English
Hello!

Despite the fact that Artem Rakhov prepared the round - I'm writing this post, as he is currently training for the ACM-ICPC World Finals, writing a contest with the teammates.

Contest has been prepared by: Artem Rakhov, Gerald Agapov (congratulations on the "redness") and Maria Belova.

Wish you high rating,
MikeMirzayanov

  • Vote: I like it
  • +15
  • Vote: I do not like it

Comments Comments (22)
| Write comment?
14 years ago, # |
  Vote: I like it 0 Vote: I do not like it
what is pretest 3 of COINS?
→ Reply
  • 14 years ago, # ^ |
      Vote: I like it -14 Vote: I do not like it
    No comments. Testdata is not available for participants.
    → Reply
    • 14 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it
      kindly give an example of Impossible test case
      → Reply
      • 14 years ago, # ^ |
          Vote: I like it +1 Vote: I do not like it
        For example:
        A>B
        B>C
        C>A
        Output: Impossible
        → Reply
    • 14 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it
      If anyone think that by some testcase  he can solve a better problem that he can solve as usual,then I think anyone of us should help him....
      → Reply
      • 14 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it
        I totally agree.
        → Reply
      • 14 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it
        Look at the time that question was asked. Mike meant that during the contest the test cases are not available.
        → Reply
14 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Problem D:
Second sample:
input:
6 3
000000 2
010100 4
111100 0
Is it correct?

May be:
6 3
000000 2
010100 4
000011 0
?
→ Reply
  • 14 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it 
    6 3
000000 2
010100 4
111100 0
    There are no codes that do not contradict the m system responses. Please, you "questions" interface on the problemset page.
    → Reply
14 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Hm, I thing it's really interesting.

Recruit flushfile
Submits:
A - 0:46, B - 0:49, E - 0:52
Hacks:
A - jackoneill (submitted in 0:46, hacked in 0:47), gigacoder (submitted in 0:56, hacked in 0:57)
B - jackoneill (submitted in 0:48, hacked in 0:50), gigacoder (submitted in 0:56, hacked in 0:57)
E - jackoneill (submitted in 0:52, hacked in 0:54), gigacoder (submitted in 0:56, hacked in 0:58)

Recruit resetfile
Submits:
A - 1:00, B - 1:01, E - 1:01
Hacks:
A - delphisourcer (submitted in 1:00, hacked in 1:01)
B - delphisourcer (submitted in 1:00, hacked in 1:01)
E - delphisourcer (submitted in 1:00, hacked in 1:02)
→ Reply
  • 14 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    O!

    Recruit closefile
    Submits:
    A - 1:07, B - 1:07, E - 1:08
    Hacks:
    A - gigacoder2 (submitted in 1:06, hacked in 1:07)
    B -     gigacoder2 (submitted in 1:06, hacked in 1:08)
    E -     gigacoder2 (submitted in 1:07, hacked in 1:09)
    → Reply
    • 14 years ago, # ^ |
      ← Rev. 5   Vote: I like it +4 Vote: I do not like it
      And they all are writing on Delphi/FPC
      → Reply
      • 14 years ago, # ^ |
          Vote: I like it +6 Vote: I do not like it
        Finally, resetfile, closefile and flushfile have "+" with A,B and "-" with E
        → Reply
        • 14 years ago, # ^ |
            Vote: I like it +6 Vote: I do not like it
          This man has spoofed himself only....It's kind of morrons,that are trying ti cheat with their rank.It seems me funny btw)
          Take my advice- dont even pay ur attetion for them:)
          → Reply
14 years ago, # |
  Vote: I like it +6 Vote: I do not like it
What is test 19 of problem C?
→ Reply
  • 14 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    I want to know, too. Please help!
    → Reply
  • 14 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it
    It's such a case where the first solution (according to permutation) is not necessarily "lexicographically minimum one". You may try following case:

    AAA
    AAA
    AAAA
    AAAA
    AAAAAA
    AAAAAA

    Hope it'll help.
    PS: Sorry for my weak English.
    → Reply
    • 14 years ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it
      Is the solution is?
      AAA...
      A.A...
      A.A...
      AAAAAA
      ..A..A
      ..AAAA
      → Reply
      • 14 years ago, # ^ |
        ← Rev. 2   Vote: I like it +3 Vote: I do not like it
        I know my bug of my solution.

        The compare function can *not* be the comparison of a string of all the characters in the map.

        It should be comparison the first line of two Maps, if they are the same, compare the second ones, otherwise return the smaller one.

        Attach the code of the struct Map :
        struct Map {
        char data[33][33];
        int n, m;

        string getString(int n) const { // get line n
        string ret = "";
        for (int j = 0; j < m; j ++) {
        ret.push_back(data[n][j]);
        }
        return ret;
        }

        bool operator<(Map o) const {
        for (int i = 0; i < n; i ++) {
        string a = getString(i);
        string b = o.getString(i);
        if (a == b) {
        continue;
        }
        else {
        return a < b;
        }
        }
        return false;
        }
        };

        Then, I got an AC.
        → Reply
        • 14 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it
          Thanks. AC,too. Compare each line, not every char in a string.
          → Reply
14 years ago, # |
  Vote: I like it 0 Vote: I do not like it
What's the test 16 of problem C please?
→ Reply
14 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Integer to be checked.
→ Reply