oj.uz

답안 #1067839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067839 2024-08-21T04:18:16 Z mindiyak Lampice (COCI19_lampice) C++14
0 / 110
 246 ms 524288 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

int n;
string a;
vvi paths(5e4+5);
int ans = 1;

void dfs(int pos,vi arr,int P1,int P2){
    
    if(pos == a.size())return;

    int m = arr.size();

    // cerr << int(a[pos]) << " " << P1 << " & " << P2 << " | ";
    // for(int b:arr)cerr << b << " ";
    // cerr << " -> ";

    // EVEN
    if(P1 == -1){
        if(m >= 1){
            if(arr[m-1] == a[pos]){
                P1 = m-1;
                ans = max(ans,2);
            }
        }
    }else{
        if(P1 >= 1){
            P1--;
            if(arr[P1] == a[pos]){
                ans = max(ans,m-P1+1);
            }else{
                P1 = -1;
            }
        }
    }

    // ODD
    if(P2 == -1){
        if(m >= 2){
            if(arr[m-2] == a[pos]){
                P2 = m-2;
                ans = max(ans,3);
            }
        }
    }else{
        if(P2 >= 1){
            P2--;
            if(arr[P2] == a[pos]){
                ans = max(ans,m-P2+1);
            }else{
                P2 = -1;
            }
        }
    }

    // cerr << P1 << " & " << P2 << endl;

    arr.pb(a[pos]);

    // for(int b:paths[pos]){
    //     if(b == prev)continue;
    //     dfs(b,pos,arr,P1,P2);
    // }
    dfs(pos+1,arr,P1,P2);
}

void solve()
{
    cin >> n;
    cin >> a;
    FOR(i,0,n-1){
        int a,b; cin >> a >> b;
        a --; b--;
        paths[a].pb(b);
        paths[b].pb(a);
    }

    FOR(i,0,1){
        vi arr;
        dfs(i,arr,-1,-1);
    }

    cout << ans << endl;
}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

lampice.cpp: In function 'void dfs(int, vi, int, int)':
lampice.cpp:60:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     if(pos == a.size())return;
      |        ~~~~^~~~~~~~~~~
lampice.cpp: In function 'void init(std::string)':
lampice.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lampice.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 246 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 236 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

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