oj.uz

답안 #579312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579312 2022-06-18T20:14:37 Z Sam_a17 Savez (COCI15_savez) C++14
108 / 120
 151 ms 39516 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#pragma GCC optimize("Ofast")
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
 
// Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long N = 2e6 + 10, base = 57, mod = 1e9 + 7;
long long n, h[N], rh[N], sz[N];
vector<string> a;

void hsh(int index) {
  h[0] = (a[index][0] - 'a') + 1;
  for(int i = 1; i < sz[index]; i++) {
    h[i] = h[i - 1] * base + (a[index][i] - 'a' + 1);
    // h[i] %= mod;
  }

  int m = sz[index];
  rh[m - 1] = (a[index][m - 1] - 'a') + 1;
  for(int i = m - 2; i >= 0; i--) {
    rh[i] = rh[i + 1] * base + (a[index][i] - 'a' + 1);
    // rh[i] %= mod
  }
}

unordered_map<long long, long long> dp;

void solve_() {
  cin >> n;
  for(int i = 1; i <= n; i++) {
    string s; cin >> s;
    a.push_back(s), sz[i - 1] = sz(s);
  }

  long long answ = 0;
  for(int i = 0; i < n; i++) {
    hsh(i);

    long long m = sz[i], res = 0;
    for(int j = 0; j < m; j++) {
      if(h[j] == rh[m - j - 1]) {
        res = max(res, dp[h[j]]);
      }
    }

    dp[h[m - 1]] = max(dp[h[m - 1]], res + 1);
    answ = max(answ, dp[h[m - 1]]);
  }

  printf("%lld\n", answ);
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}

Compilation message

savez.cpp: In function 'void setIO(std::string)':
savez.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
savez.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
savez.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
savez.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 1364 KB Output is correct
2 Correct 29 ms 1492 KB Output is correct
3 Correct 30 ms 1516 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 30 ms 1692 KB Output is correct
3 Correct 40 ms 1748 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 1808 KB Output is correct
2 Correct 32 ms 1816 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 2380 KB Output is correct
2 Correct 28 ms 2376 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 3660 KB Output is correct
2 Correct 33 ms 3408 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 5684 KB Output is correct
2 Correct 42 ms 5620 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 9820 KB Output is correct
2 Correct 55 ms 9796 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 18876 KB Output is correct
2 Correct 92 ms 18872 KB Output is correct
3 Correct 151 ms 39516 KB Output is correct