— Dark mode

Putka Open 2020 – 4/5

Ruudukko

  • Start: 2020-11-06 18:00:00
  • End: 2020-11-08 23:00:00
CSES - Putka Open 2020 – 4/5 - Results
Submission details
Task:Ruudukko
Sender:ollpu
Submission time:2020-11-08 02:59:13 +0200
Language:C++17
Status:READY
Result:5
Feedback
groupverdictscore
#1ACCEPTED5
#20
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 5details
#20.01 s2, 5details
#30.01 s3, 5details
#40.01 s4, 5details
#50.01 s5details
#60.01 s5details
#70.01 s2, 5details
#80.01 s2, 5details
#90.01 s3, 5details
#100.01 s3, 5details
#110.01 s3, 5details
#120.01 s3, 5details
#130.01 s4, 5details
#140.01 s5details
#150.01 s3, 5details
#160.03 s5details

Compiler report

input/code.cpp: In member function 'void G::solve()':
input/code.cpp:92:37: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
     if (X1 < 0 || X1 >= n || Y1 < 0 || Y1 >= m) return;
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
constexpr int ctod(char c) {
  if (c == 'U') return 0;
  if (c == 'R') return 1;
  if (c == 'D') return 2;
  return 3;
}
constexpr char dtoc(int d) {
  return "URDL"[d];
}
template<typename After>
struct WLOGGuard {
  bool active;
  After lambda;
  WLOGGuard(bool a, After _) : active(a), lambda(_) {}
  ~WLOGGuard() { if (active) lambda(); }
};
map<array<int, 6>, int> poss_cache;
struct G {
  int n, m, X1, Y1, X2, Y2;
  vector<int> result;
  bool possible=0;
  void impossible() {
    possible = 0;
  }
  bool iex(int x) { return x == 0 || x == n-1; };
  bool iey(int y) { return y == 0 || y == m-1; };
  bool ic(int x, int y) { return iex(x) && iey(y); };
  bool ie(int x, int y) { return iex(x) || iey(y); };
  
  auto WLOGrev(bool cond=false) {
    if (!cond) {
      swap(X1, X2);
      swap(Y1, Y2);
    }
    return WLOGGuard(!cond, [&]() {
      reverse(result.begin(), result.end());
      if (wres) for (int &d : result) {
        d = (d+2)%4;
      }
      swap(X1, X2);
      swap(Y1, Y2);
    });
  }
  auto WLOGflipx(bool cond=false) {
    if (!cond) {
      X1 = n-X1-1;
      X2 = n-X2-1; 
    }
    return WLOGGuard(!cond, [&]() {
      if (wres) for (int &d : result) {
        if (d%2 == 0) d = (d+2)%4;
      }
      X2 = n-X2-1; 
      X1 = n-X1-1;
    });
  }
  auto WLOGflipy(bool cond=false) {
    if (!cond) {
      Y1 = n-Y1-1;
      Y2 = n-Y2-1; 
    }
    return WLOGGuard(!cond, [&]() {
      if (wres) for (int &d : result) {
        if (d%2 == 1) d = (d+2)%4;
      }
      Y2 = n-Y2-1; 
      Y1 = n-Y1-1;
    });
  }
  auto WLOGtranspose(bool cond=false) {
    if (!cond) {
      swap(n, m);
      swap(X1, Y1);
      swap(X2, Y2);
    }
    return WLOGGuard(!cond, [&]() {
      if (wres) for (int &d : result) {
        if (d%2) d = (d+1)%4;
        else d = (d+3)%4;
      }
      swap(n, m);
      swap(X1, Y1);
      swap(X2, Y2);
    });
  }
  
  bool wres;
  G(int _n, int _m, int _X1, int _Y1, int _X2, int _Y2, bool wr=1) : n(_n), m(_m), X1(_X1), Y1(_Y1), X2(_X2), Y2(_Y2), wres(wr)  {
    if (X1 == X2 && Y1 == Y2) return;
    if (X1 < 0 || X1 >= n || Y1 < 0 || Y1 >= m) return;
    if ((n*m-1)%2 != (abs(X1-X2)+abs(Y1-Y2))%2) return;
    possible = 1;
    
    auto it = poss_cache.find({n, m, X1, Y1, X2, Y2});
    if (it != poss_cache.end()) {
      if (!wr || !it->second) {
        possible = it->second;
        return;
      }
    }
    solve();
    poss_cache[{n, m, X1, Y1, X2, Y2}] = possible;
  }
  void promote() {
    if (!wres && possible) {
      wres = 1;
      result.clear();
      solve();
    }
  }
  void cc(const G &g) {
    if (wres) {
      result.insert(result.end(), g.result.begin(), g.result.end());
    }
  }
  void solve() {
    if (n == 1 || m == 1) {
      auto w1 = WLOGtranspose(n == 1);
      auto w2 = WLOGrev(Y1 < Y2);
      //cout << n << " " << m << ": " << X1 << "," << Y1 << " " << X2 << "," << Y2 << endl;
      if (Y1 != 0 || Y2 != m-1) return impossible();
      if (wres) result = vector<int>(m-1, ctod('R'));
      return;
    }
    if (ic(X1, Y1) && ic(X2, Y2)) {
      if (!wres) return;
      auto w1 = WLOGflipx(X1 == 0);
      auto w2 = WLOGflipy(Y1 == 0);
      auto w3 = WLOGtranspose(X2 == 0 || (X1 != X2 && Y1 != Y2 && m%2));
      bool weird = X2 == 0 && m%2 == 1;
      for (int j = 0; j < (weird ? m-2 : m); ++j) {
        cc(G(n, 1, j%2 ? n-1 : 0, 0,  j%2 ? 0 : n-1, 0));
        if (j != m-1) result.push_back(ctod('R'));
      }
      if (weird) cc(G(n, 2, n-1, 0, 0, 1));
      return;
    }
    auto w1 = WLOGflipx(X1 <= X2);
    auto w2 = WLOGflipy(Y1 <= Y2);
    auto w3 = WLOGtranspose(Y1 != Y2);
    for (int transp = 0; transp < 1+(X1 != X2); ++transp) {
      auto w4 = WLOGtranspose(!transp);
      for (int x : {0, 1, n-2, n-1}) {
        auto g1 = G(n, Y1+1, X1, Y1, x, Y1, false);
        if (!g1.possible) continue;
        auto g2 = G(n, m-Y1-1, x, 0, X2, Y2-Y1-1, false);
        if (!g2.possible) continue;
        if (!wres) return;
        g1.promote();
        g2.promote();
        cc(g1);
        result.push_back(ctod('R'));
        cc(g2);
        return;
      }
      if (Y2-Y1 > 1)
      for (int x : {0, 1, n-2, n-1}) {
        auto g1 = G(n, Y1+2, X1, Y1, x, Y1+1, false);
        if (!g1.possible) continue;
        auto g2 = G(n, m-Y1-2, x, 0, X2, Y2-Y1-2, false);
        if (!g1.possible) continue;
        if (!wres) return;
        g1.promote();
        g2.promote();
        cc(g1);
        result.push_back(ctod('R'));
        cc(g2);
        return;
      }
    }
    return impossible();
  }
  bool print() {
    cout << n << " " << m << ": " << X1 << "," << Y1 << " " << X2 << "," << Y2 << endl;
    return false;
  }
};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  for (int Ti = 0; Ti < T; ++Ti) {
    int n, m, X1, Y1, X2, Y2;
    cin >> n >> m >> X1 >> Y1 >> X2 >> Y2;
    X1--; Y1--; X2--; Y2--;
    G g(n, m, X1, Y1, X2, Y2);
    if (g.possible) {
      cout << "YES\n";
      for (int d : g.result) cout << dtoc(d);
      cout << "\n";
    } else cout << "NO\n";
  }
}

Test details

Test 1

Group: 1, 5

Verdict: ACCEPTED

input
100
1 45 1 45 1 1
1 18 1 1 1 10
1 47 1 17 1 30
1 33 1 28 1 20
...
view save

correct output
YES
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
view save

user output
YES
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
view save

Test 2

Group: 2, 5

Verdict:

input
100
2 43 1 33 1 21
2 2 1 1 2 2
2 32 1 1 2 8
2 14 1 12 1 14
...
view save

correct output
NO
NO
NO
NO
YES
...
view save

user output
NO
NO
NO
NO
YES
...
view save

Test 3

Group: 3, 5

Verdict:

input
100
3 4 2 1 2 4
3 38 2 24 1 22
3 29 2 23 2 3
3 8 3 1 1 2
...
view save

correct output
NO
NO
NO
YES
RRRRRRRUULDLULDLULDLLUR
...
view save

user output
NO
NO
NO
YES
RRRRRRRUULDLULDLULDLLUR
...
view save

Test 4

Group: 4, 5

Verdict:

input
100
4 25 2 19 1 5
4 13 3 10 4 12
4 7 3 1 4 2
4 23 1 19 2 5
...
view save

correct output
YES
DDRRRRRRULLLLLURRRRRULLLLLLLDD...
view save

user output
NO
YES
UULDDLUULDDLUULDDLUULDDLUULDDD...
view save

Test 5

Group: 5

Verdict:

input
100
16 8 13 1 14 8
41 21 19 11 32 12
46 17 13 7 6 11
8 41 4 32 4 12
...
view save

correct output
NO
YES
LURULURULURULURULURRDDDDDDDDDR...
view save

user output
NO
YES
DDDDDDDDDDDDDDDDDDDDDDLUUUUUUU...
view save

Test 6

Group: 5

Verdict:

input
100
31 38 18 35 31 37
35 48 7 13 21 21
46 21 25 2 4 19
35 2 13 2 35 1
...
view save

correct output
YES
LLLLLLLLLLLLDRRRRRRRRRRRRDLLLL...
view save

user output
YES
RDLDRDLDRDLDRDLDRDLDRDLDRDLLUU...
view save

Test 7

Group: 2, 5

Verdict:

input
100
2 4 1 3 1 4
2 4 2 2 1 1
2 4 2 3 1 2
2 4 2 3 1 4
...
view save

correct output
YES
LLDRRRU
NO
NO
NO
...
view save

user output
YES
LLDRRRU
NO
NO
NO
...
view save

Test 8

Group: 2, 5

Verdict:

input
100
2 5 1 2 2 4
2 5 1 2 1 1
2 5 2 1 1 2
2 5 1 1 1 5
...
view save

correct output
YES
LDRRURRDL
YES
RRRDLLLLU
NO
...
view save

user output
YES
LDRRURRDL
YES
DLLLLURRR
NO
...
view save

Test 9

Group: 3, 5

Verdict:

input
100
3 4 1 1 2 3
3 4 2 4 3 2
3 4 2 1 3 1
3 4 1 4 3 4
...
view save

correct output
YES
DDRRRUULLDR
NO
YES
URRRDDLULDL
...
view save

user output
YES
DDRUURRDDLU
NO
YES
URDRURDDLLL
...
view save

Test 10

Group: 3, 5

Verdict:

input
100
3 5 3 4 3 2
3 5 3 5 2 3
3 5 3 1 2 2
3 5 3 1 3 2
...
view save

correct output
NO
NO
YES
UURRRRDDLULDLU
NO
...
view save

user output
NO
NO
YES
UURRRRDDLULDLU
NO
...
view save

Test 11

Group: 3, 5

Verdict:

input
100
3 8 2 8 1 2
3 8 2 4 1 7
3 8 3 4 2 7
3 8 2 5 3 1
...
view save

correct output
NO
NO
NO
YES
LLLDRRRRURDRUULLLLLLLDD
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 12

Group: 3, 5

Verdict:

input
100
3 9 1 3 2 9
3 9 1 6 1 5
3 9 3 6 2 8
3 9 3 2 3 4
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 13

Group: 4, 5

Verdict:

input
100
4 4 2 2 1 4
4 4 4 1 2 2
4 4 2 1 4 3
4 4 3 1 3 3
...
view save

correct output
YES
DDLUUURRDDDRUUU
YES
UUURRRDLDRDLLUU
NO
...
view save

user output
YES
ULDDDRURDRUULUR
YES
UUURRRDDDLLURUL
NO
...
view save

Test 14

Group: 5

Verdict:

input
100
12 27 6 22 1 8
6 25 3 2 4 4
6 16 4 6 5 2
36 33 8 6 1 6
...
view save

correct output
YES
DLDDDDDRUUUURDDDDRUURDDRRULURU...
view save

user output
NO
YES
DDDLUUUUURDRURDRURDRURDRURDRUR...
view save

Test 15

Group: 3, 5

Verdict:

input
100
3 12 3 5 1 4
3 20 3 19 2 19
3 34 3 9 2 9
3 38 2 15 3 15
...
view save

correct output
YES
RRRRRRRUULDLULDLULDLULDLDLULDL...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 16

Group: 5

Verdict:

input
100
50 50 29 1 16 21
50 50 37 5 23 48
50 50 32 22 45 24
50 50 6 28 12 37
...
view save

correct output
YES
DDDDDDDDDDDDDDDDDDDDDRUUUUUUUU...
view save

user output
YES
UUUUUUUUUUUUUUUUUUUUUUUUUUUURD...
view save

Tasks

A Neliöt-B Peli-C Tekijät-D Ruudukko-

Submissions (ollpu)

2020-11-08 22:44:57 1002020-11-08 22:23:44 1002020-11-08 20:28:23 722020-11-08 19:57:00 452020-11-08 16:38:39 172020-11-08 16:02:57 172020-11-08 12:21:29 172020-11-08 12:02:11 172020-11-08 11:45:07 172020-11-08 03:25:36 172020-11-08 02:59:13 5