Submission #1838443
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rept(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define reps(i,s,n) for(int (i)=(s);(i)<(int)(n);(i)++)
#define repst(i,s,n) for(int (i)=(s);(i)<=(int)(n);(i)++)
#define repr(i,n) for(int (i)=(n);(i)>=0;(i)--)
#define each(itr,v) for(auto (itr):(v))
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define mp(x,y) make_pair((x),(y))
#define fi first
#define se second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define ln "\n"
#define show(x) cout << #x << " = " << x ln
#define dbg(x) cout<<#x"="<<x ln
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<int>> mat;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = (int)1e9;
const ll linf = (ll)1e18;
const int mod = (int)(1e9+7);
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
struct oreno_initializer {
oreno_initializer() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} oreno_initializer;
// ⊂ニニニニニニニニニニニニニ( ^ω^)ニニニニニニニニニニニニニ⊃
int k, n, l[50], s[50];
string v[50], w[50];
bool owari;
bool chek() {
rep(i,n) {
int sum = 0;
// 今仮定してるsの長さを当てはめてみる
rep(j,v[i].length()) {
sum += s[v[i][j]-'1'];
}
// 矛盾するvがあったらダメ
if (sum!=l[i]) return false;
}
return true;
}
void enu(int ii, int kk) {
if (owari) return;
s[ii] = kk;
// もし長さの組み合わせがこれでOKなら与えられたデータを元に答えを生成して終了フラグを立てる
if (ii==k-1) {
if (!chek()) return;
string ans[k];
rep(i,n) {
int left = 0;
rep(j,v[i].length()) {
int idx = v[i][j] - '1';
ans[idx] = w[i].substr(left, s[idx]);
left += s[idx];
}
}
rep(i,k) cout << ans[i] << ln;
owari = true;
return;
}
repst(i,1,3) enu(ii+1,i);
}
int main() {
cin >> k >> n;
rep(i,n) {
cin >> v[i] >> w[i];
l[i] = (int)w[i].length();
}
// s[i]の長さの組み合わせを全通り(最大2*10^4弱)試す
// 長さが決まってれば与えられたテーブルから答えを出せる どっかで矛盾したらcontinue
repst(i,1,3) enu(0,i);
}
Submission Info
Submission Time |
|
Task |
D - 語呂合わせ |
User |
creep04 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2452 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
40 / 40 |
60 / 60 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Subtask1 |
sample-02.txt, sample-03.txt, sample-04.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt |
Subtask2 |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt |
Case Name |
Status |
Exec Time |
Memory |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |
sample-03.txt |
AC |
1 ms |
256 KB |
sample-04.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
AC |
1 ms |
256 KB |
subtask1-04.txt |
AC |
1 ms |
256 KB |
subtask1-05.txt |
AC |
1 ms |
256 KB |
subtask1-06.txt |
AC |
1 ms |
256 KB |
subtask1-07.txt |
AC |
1 ms |
256 KB |
subtask1-08.txt |
AC |
1 ms |
256 KB |
subtask1-09.txt |
AC |
1 ms |
256 KB |
subtask1-10.txt |
AC |
1 ms |
256 KB |
subtask1-11.txt |
AC |
1 ms |
256 KB |
subtask1-12.txt |
AC |
1 ms |
256 KB |
subtask1-13.txt |
AC |
1 ms |
256 KB |
subtask1-14.txt |
AC |
1 ms |
256 KB |
subtask1-15.txt |
AC |
1 ms |
256 KB |
subtask1-16.txt |
AC |
1 ms |
256 KB |
subtask1-17.txt |
AC |
1 ms |
256 KB |
subtask1-18.txt |
AC |
1 ms |
256 KB |
subtask1-19.txt |
AC |
1 ms |
256 KB |
subtask1-20.txt |
AC |
1 ms |
256 KB |
subtask2-01.txt |
AC |
1 ms |
256 KB |
subtask2-02.txt |
AC |
1 ms |
256 KB |
subtask2-03.txt |
AC |
2 ms |
256 KB |
subtask2-04.txt |
AC |
2 ms |
256 KB |
subtask2-05.txt |
AC |
1 ms |
256 KB |
subtask2-06.txt |
AC |
1 ms |
256 KB |
subtask2-07.txt |
AC |
2 ms |
256 KB |
subtask2-08.txt |
AC |
1 ms |
256 KB |
subtask2-09.txt |
AC |
2 ms |
256 KB |
subtask2-10.txt |
AC |
2 ms |
256 KB |
subtask2-11.txt |
AC |
2 ms |
256 KB |
subtask2-12.txt |
AC |
2 ms |
256 KB |
subtask2-13.txt |
AC |
1 ms |
256 KB |
subtask2-14.txt |
AC |
2 ms |
256 KB |
subtask2-15.txt |
AC |
1 ms |
256 KB |
subtask2-16.txt |
AC |
2 ms |
256 KB |
subtask2-17.txt |
AC |
1 ms |
256 KB |
subtask2-18.txt |
AC |
2 ms |
256 KB |
subtask2-19.txt |
AC |
2 ms |
256 KB |
subtask2-20.txt |
AC |
2 ms |
256 KB |