oj.uz

Submission #496050

# Submission time Handle Problem Language Result Execution time Memory
496050 2021-12-20T13:34:45 Z codebuster_10 Lozinke (COCI17_lozinke) C++17
40 / 100
 1000 ms 1104 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t //be careful about this 

#define pr pair
#define ar array
#define f first
#define s second
#define vt vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define SZ(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a, b, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x;}
template<class H, class... T> void rd(H& h, T&... t) { rd(h); rd(t...);}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a);}

template<class T> bool ckmin(T& a, const T b) { return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T b) { return a < b ? a = b, 1 : 0;}

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<"  ", __f(#__VA_ARGS__, __VA_ARGS__)


void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); 
  cout.precision(20); cout << fixed;
  if(SZ(s)){
    freopen((s+".in").c_str(),"r",stdin);
    freopen((s+".out").c_str(),"w",stdout);
  }
}


/*/--------------------------------------------------look below-----------------------------------------------------------------------------------/*/

































signed main(){
  setIO();
  
  int n;
  rd(n);
  vt<string> s(n);
  rd(s);

  int ans = 0;
  for(int i = 0; i < n; ++i)
    for(int j = 0; j < n; ++j)
      if(i != j){
        for(int k = 0; k + SZ(s[j]) <= SZ(s[i]); ++k)
          if(s[i].substr(k,SZ(s[j])) == s[j]){
            ++ans;
            break;
          }
      }

  cout << ans;
  
  return 0;
}







// tips to avoid bugs.

/*
  * be careful of whats happening you dont want a continue statement to miss imp line of code.
  * be careful when to update what since it might be needed in next segment of code.
  * dont get stuck on one idea.
  * dont use too much space bar so that code is written quickly as possible.
*/

Compilation message

lozinke.cpp: In function 'void setIO(std::string)':
lozinke.cpp:81:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |     freopen((s+".in").c_str(),"r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lozinke.cpp:82:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     freopen((s+".out").c_str(),"w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 8 ms 332 KB Output is correct
5 Correct 39 ms 336 KB Output is correct
6 Correct 85 ms 356 KB Output is correct
7 Correct 165 ms 372 KB Output is correct
8 Correct 138 ms 376 KB Output is correct
9 Execution timed out 1087 ms 592 KB Time limit exceeded
10 Execution timed out 1086 ms 712 KB Time limit exceeded
11 Execution timed out 1065 ms 848 KB Time limit exceeded
12 Execution timed out 1064 ms 840 KB Time limit exceeded
13 Execution timed out 1047 ms 1096 KB Time limit exceeded
14 Execution timed out 1084 ms 976 KB Time limit exceeded
15 Execution timed out 1028 ms 1048 KB Time limit exceeded
16 Execution timed out 1066 ms 1064 KB Time limit exceeded
17 Execution timed out 1059 ms 1096 KB Time limit exceeded
18 Execution timed out 1071 ms 1104 KB Time limit exceeded
19 Execution timed out 1069 ms 976 KB Time limit exceeded
20 Execution timed out 1084 ms 1092 KB Time limit exceeded