oj.uz

답안 #204995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204995 2020-02-27T16:34:11 Z Haunted_Cpp Shell (info1cup18_shell) C++17
55 / 100
 1000 ms 26488 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cassert>
#include <bitset>
using namespace std;
 
#define FOR(i, a, b) for (int i = a; i < (int) b; i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define f first
#define s second
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

void setIO(string nome) {
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen ((nome + ".in").c_str(), "r", stdin);
  freopen ((nome + ".out").c_str(), "w", stdout);
}

const int N = 1500 + 5;
const int M = 1500 + 5;
const int MOD = 1e9 + 7;

int n, m, k, streak [N];
int dp [N][M];
vvi g (N);

void add (int &a, int b) {
  a += b;
  while (a >= MOD) a -= MOD;
}

int solve (int node, int match) {
  if (node == n - 1) return (match == k);
  int &res = dp[node][match];
  if (~res) return res;
  res = 0;
  int target = (match < k ? streak[match] : -1); 
  GO (to, g[node]) add (res, solve (to, match + (to == target)));
  return res;
} 

int main () {
  ios_base::sync_with_stdio(0); 
  cin.tie(0);
  cin >> n >> m >> k;
  memset (dp, -1, sizeof(dp));
  F0R (i, k) {
    cin >> streak[i];
    --streak[i];
  }
  F0R (i, m) {
    int st, et;
    cin >> st >> et;
    --st; --et;
    g[st].eb(et);
  } 
  cout << solve (0, streak[0] == 0 ? 1 : 0) << '\n';
  return 0;
}

Compilation message

shell.cpp: In function 'void setIO(std::__cxx11::string)':
shell.cpp:39:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ((nome + ".in").c_str(), "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shell.cpp:40:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ((nome + ".out").c_str(), "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9208 KB Output is correct
2 Correct 11 ms 9208 KB Output is correct
3 Correct 9 ms 9208 KB Output is correct
4 Correct 10 ms 9208 KB Output is correct
5 Correct 10 ms 9208 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9208 KB Output is correct
2 Correct 11 ms 9208 KB Output is correct
3 Correct 9 ms 9208 KB Output is correct
4 Correct 10 ms 9208 KB Output is correct
5 Correct 10 ms 9208 KB Output is correct
6 Correct 10 ms 9208 KB Output is correct
7 Correct 47 ms 9464 KB Output is correct
8 Correct 36 ms 9464 KB Output is correct
9 Correct 16 ms 9464 KB Output is correct
10 Correct 23 ms 9596 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 9208 KB Output is correct
2 Correct 950 ms 12128 KB Output is correct
3 Correct 94 ms 16248 KB Output is correct
4 Correct 98 ms 16248 KB Output is correct
5 Correct 170 ms 13944 KB Output is correct
6 Correct 219 ms 26488 KB Output is correct
7 Execution timed out 1050 ms 26488 KB Time limit exceeded

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9208 KB Output is correct
2 Correct 11 ms 9208 KB Output is correct
3 Correct 9 ms 9208 KB Output is correct
4 Correct 10 ms 9208 KB Output is correct
5 Correct 10 ms 9208 KB Output is correct
6 Correct 10 ms 9208 KB Output is correct
7 Correct 47 ms 9464 KB Output is correct
8 Correct 36 ms 9464 KB Output is correct
9 Correct 16 ms 9464 KB Output is correct
10 Correct 23 ms 9596 KB Output is correct
11 Correct 11 ms 9208 KB Output is correct
12 Correct 950 ms 12128 KB Output is correct
13 Correct 94 ms 16248 KB Output is correct
14 Correct 98 ms 16248 KB Output is correct
15 Correct 170 ms 13944 KB Output is correct
16 Correct 219 ms 26488 KB Output is correct
17 Execution timed out 1050 ms 26488 KB Time limit exceeded