제출 #40025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
40025		funcsr	구간 성분 (KOI15_interval)	C++14	61 / 100	589 ms	131072 KiB

interval

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

string S, T;
set<vector<int>> mp;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> S >> T;
  rep(l, S.size()) {
    vector<int> cnt(26, 0);
    for (int r=l; r<S.size(); r++) {
      cnt[S[r]-'a']++;
      mp.insert(cnt);
    }
  }
  int m = 0;
  rep(l, T.size()) {
    vector<int> cnt(26, 0);
    for (int r=l; r<T.size(); r++) {
      cnt[T[r]-'a']++;
      if (mp.find(cnt) != mp.end()) m = max(m, r-l+1);
    }
  }
  cout << m << "\n";
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

interval.cpp: In function 'int main()':
interval.cpp:17:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
interval.cpp:32:3: note: in expansion of macro 'rep'
   rep(l, S.size()) {
   ^
interval.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int r=l; r<S.size(); r++) {
                    ^
interval.cpp:17:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
interval.cpp:40:3: note: in expansion of macro 'rep'
   rep(l, T.size()) {
   ^
interval.cpp:42:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int r=l; r<T.size(); r++) {
                    ^

• Subtask 1: 7 / 7
• Subtask 2: 23 / 23
• Subtask 3: 31 / 31
• Subtask 4: 0 / 39