oj.uz

답안 #152487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152487 2019-09-08T08:05:28 Z PedroBigMan Lozinke (COCI17_lozinke) C++14
40 / 100
 1000 ms 1780 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
ll N; vector<string> str; string s,t; bool eq;

ll Check(ll a, ll b)
{
    if(a==b){return 0;}
    s=str[a]; t=str[b];
    REP(i,0,(si) t.size()-(si) s.size()+1LL)
    {
        eq=true;
        REP(j,i,i+s.size()) {if(t[j]!=s[j-i]) {eq=false;}}
        if(eq) {return 1;}
    }
    return 0;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>N; string cur;
    REP(i,0,N) {cin>>cur; str.pb(cur);}
    ll ans=0;
    REP(i,0,N)
    {
        REP(j,0,N)
        {
            ans+=Check(i,j);
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

lozinke.cpp: In function 'void Out(std::vector<long long int>)':
lozinke.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
lozinke.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
lozinke.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
lozinke.cpp: In function 'll Check(ll, ll)':
lozinke.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
lozinke.cpp:30:13:
         REP(j,i,i+s.size()) {if(t[j]!=s[j-i]) {eq=false;}}
             ~~~~~~~~~~~~~~       
lozinke.cpp:30:9: note: in expansion of macro 'REP'
         REP(j,i,i+s.size()) {if(t[j]!=s[j-i]) {eq=false;}}
         ^~~

Subtask #1
40.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 12 ms 376 KB Output is correct
5 Correct 72 ms 504 KB Output is correct
6 Correct 199 ms 504 KB Output is correct
7 Correct 245 ms 632 KB Output is correct
8 Correct 209 ms 504 KB Output is correct
9 Execution timed out 1080 ms 1016 KB Time limit exceeded
10 Execution timed out 1063 ms 1016 KB Time limit exceeded
11 Execution timed out 1071 ms 1016 KB Time limit exceeded
12 Execution timed out 1067 ms 1144 KB Time limit exceeded
13 Execution timed out 1080 ms 1648 KB Time limit exceeded
14 Execution timed out 1066 ms 1652 KB Time limit exceeded
15 Execution timed out 1081 ms 1652 KB Time limit exceeded
16 Execution timed out 1080 ms 1780 KB Time limit exceeded
17 Execution timed out 1074 ms 1780 KB Time limit exceeded
18 Execution timed out 1049 ms 1652 KB Time limit exceeded
19 Execution timed out 1070 ms 1652 KB Time limit exceeded
20 Execution timed out 1063 ms 1652 KB Time limit exceeded