QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#32862	#884. Joining Treasure Hunt	AutumnKite	WA	799ms	6728kb	C++17	1.2kb	2022-05-25 10:04:25	2022-05-25 10:04:25

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-05-25 10:04:25]
评测

测评结果：WA
用时：799ms
内存：6728kb

查看

[2022-05-25 10:04:25]
提交

answer

#include <bits/stdc++.h>

const char name[] = "nsew";

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, m;
  std::cin >> n >> m;
  std::vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    char c;
    std::cin >> c;
    if (c == '?') {
      a[i] = -1;
    } else {
      int x;
      std::cin >> x;
      a[i] = (std::find(name, name + 4, c) - name) * 4 + x - 1;
    }
  }
  std::vector<int> b(m);
  for (int i = 0; i < m; ++i) {
    char c;
    std::cin >> c;
    if (c == '?') {
      b[i] = -1;
    } else {
      int x;
      std::cin >> x;
      b[i] = (std::find(name, name + 4, c) - name) * 4 + x - 1;
    }
  }

  const int C = 28;
  std::vector<std::bitset<400000>> mask(C);
  for (int i = 0; i < C; ++i) {
    mask[i].set();
  }
  for (int i = 0; i < m; ++i) {
    if (b[i] != -1) {
      mask[b[i]].reset(i);
    } else {
      for (int j = 0; j < C; ++j) {
        mask[j].reset(i);
      }
    }
  }
  std::bitset<400000> S;
  S.set();
  int ans = 0;
  for (int i = 0; i < n; ++i) {
    S <<= 1;
    if (a[i] != -1) {
      S |= mask[a[i]];
    }
    if (!S.test(m - 1)) {
      ++ans;
    }
  }
  std::cout << ans << "\n";
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 4ms

memory: 4328kb

input:

4 3
n 4
e 1
?
s 5
?
e 1
?

output:

result:

ok answer is '2'

Test #2:

score: 0

Accepted

time: 0ms

memory: 4544kb

input:

4 3
n 4
e 1
w 3
s 5
?
e 1
?

output:

result:

ok answer is '1'

Test #3:

score: -100

Wrong Answer

time: 799ms

memory: 6728kb

input:

400000 200000
?
?
e 7
e 7
?
?
?
e 7
e 7
?
?
e 7
?
e 7
e 7
?
e 7
?
?
?
e 7
?
?
e 7
?
?
?
?
e 7
?
e 7
?
?
e 7
?
?
e 7
e 7
e 7
?
?
?
?
?
?
e 7
?
e 7
?
?
?
?
?
?
?
?
?
?
e 7
e 7
?
?
e 7
?
e 7
e 7
?
?
e 7
e 7
e 7
?
e 7
e 7
?
?
?
?
?
?
e 7
e 7
?
?
e 7
?
?
?
?
e 7
?
?
?
e 7
?
e 7
?
e 7
?
?
?
?
?
e 7
?
?
?
...

output:

result:

wrong answer expected '133037', found '200001'