結果
問題 | No.345 最小チワワ問題 |
ユーザー |
![]() |
提出日時 | 2016-02-26 23:31:28 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,671 bytes |
コンパイル時間 | 875 ms |
コンパイル使用メモリ | 97,964 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-25 11:26:01 |
合計ジャッジ時間 | 1,736 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
ソースコード
//include//------------------------------------------#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <cstring>#include <ctime>using namespace std;inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }template<class T> inline T sqr(T x) { return x*x; }typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<string> VS;typedef pair<int, int> PII;typedef long long ll;//repetition//------------------------------------------#define FOR(i,a,b) for(int i=(a);i<(b);++i)#define rep(i,n) FOR(i,0,n)#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))#define ALL(a) (a).begin(),(a).end()#define RALL(a) (a).rbegin(), (a).rend()#define PB push_back#define MP make_pair#define SZ(a) int((a).size())#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)#define EXIST(s,e) ((s).find(e)!=(s).end())#define SORT(c) sort((c).begin(),(c).end())int gcd(int x, int y) {if (y == 0) return x;else return gcd(y,x%y);}int lcm(int a, int b) {return a / gcd(a, b) * b;}bool is_prime(int n) {for (int i = 2; i * i <= n; i++) {if (n % i == 0) return false;}return n != 1;}map<int, int> prime_factor(int n) {map<int, int> res;for (int i = 2; i * i <= n; i++) {while (n % i == 0) {++res[i];n /= i;}}if (n != 1) res[n] = 1;return res;}vector<string> split(const string &str, char delim) {vector<string> res;size_t current = 0, found;while ((found = str.find_first_of(delim, current)) != string::npos) {res.push_back(string(str, current, found - current));current = found + 1;}res.push_back(string(str, current, str.size() - current));return res;}int main() {string s,a;cin >> s;int n = s.size();int ans = 111111111;for (int i = 0; i < n; i++) {for (int j = 1; j <= n - i; j++) {a = s.substr(i, j);int cc=-1, w1=-1, w2=-1;for (int k = 0; k < j; k++) {if (a[k] == 'c' && cc == -1) {cc = k;}if (a[k] == 'w' && w1 == -1) {w1 = k;continue;}if (a[k] == 'w' &&w1!=-1 && w2 == -1) {w2 = k;}}if (cc == -1 || w1 == -1 || w2 == -1 || cc>w1) continue;ans = min(ans, j);}}if (ans == 111111111) ans = -1;cout <<ans << endl;return 0;}