Submission #1869690
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include <iostream> #include <iomanip> #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <string> #include <vector> #include <stack> #include <queue> #include <set> #include <map> #include <functional> #include <utility> #include <tuple> #include <cctype> using namespace std; #define INF 0x3f3f3f3f //#define INF 1100000000000000000LL #define MOD 1000000007 #define mp make_pair #define mt make_tuple #define pb push_back typedef long long ll; typedef long double ld; typedef pair<int, int> pint; typedef tuple<int,int,int> tint; typedef vector<int> vint; typedef vector<ll> vll; int dx[8]={0,0,-1,1,1,1,-1,-1}; int dy[8]={-1,1,0,0,1,-1,1,-1}; const int SIZE=5050; //ここまでテンプレ int main() { //置くべき位置が決まっているか? //must[数字]=マス int must[26]={}; for(int i=1;i<=25;i++){ int c; cin>>c; must[c]=i; } int a[2]={-5,5},b[2]={-1,1}; int tate[26][2]={},yoko[26][2]={}; //縦につながっているマスどうしのpathを記録 for(int i=1;i<=25;i++){ for(int j=0;j<2;j++){ if(i+a[j]<1 || 25<i+a[j]) continue; tate[i][j]=i+a[j]; } } //横につながっているマスどうしのpathを記録 for(int i=1;i<=25;i++){ for(int j=0;j<2;j++){ if(j==0 && (i+b[j])%5==0) continue; if(j==1 && (i+b[j])%5==1) continue; yoko[i][j]=i+b[j]; } } //状態を表す整数 int now=0; int DP[67108900]={}; for(int i=0;i<67108900;i++){ DP[i]=i; } cout<<DP[25]<<endl; cout<<DP[5468765]<<endl; //1から順番に数字を置いていく for(int i=1;i<=25;i++){ //must[i]==0ならば、好きなとこにおけるので全マス調べる } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 25個の整数 |
User | takeo1116 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1839 Byte |
Status | RE |
Exec Time | 98 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Subtask1 | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt |
Subtask2 | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | RE | 97 ms | 256 KB |
sample-02.txt | RE | 96 ms | 256 KB |
sample-03.txt | RE | 96 ms | 256 KB |
sample-04.txt | RE | 96 ms | 256 KB |
test-1-01.txt | RE | 97 ms | 256 KB |
test-1-02.txt | RE | 97 ms | 256 KB |
test-1-03.txt | RE | 97 ms | 256 KB |
test-1-04.txt | RE | 97 ms | 256 KB |
test-1-05.txt | RE | 96 ms | 256 KB |
test-1-06.txt | RE | 97 ms | 256 KB |
test-1-07.txt | RE | 96 ms | 256 KB |
test-1-08.txt | RE | 96 ms | 256 KB |
test-1-09.txt | RE | 96 ms | 256 KB |
test-1-10.txt | RE | 97 ms | 256 KB |
test-1-11.txt | RE | 97 ms | 256 KB |
test-1-12.txt | RE | 96 ms | 256 KB |
test-1-13.txt | RE | 97 ms | 256 KB |
test-1-14.txt | RE | 97 ms | 256 KB |
test-1-15.txt | RE | 97 ms | 256 KB |
test-2-01.txt | RE | 96 ms | 256 KB |
test-2-02.txt | RE | 96 ms | 256 KB |
test-2-03.txt | RE | 97 ms | 256 KB |
test-2-04.txt | RE | 97 ms | 256 KB |
test-2-05.txt | RE | 98 ms | 256 KB |
test-2-06.txt | RE | 97 ms | 256 KB |
test-2-07.txt | RE | 97 ms | 256 KB |
test-2-08.txt | RE | 97 ms | 256 KB |
test-2-09.txt | RE | 97 ms | 256 KB |
test-2-10.txt | RE | 97 ms | 256 KB |