*/ST
2017-2018 individual contest #10
End: 2017-11-29 16:30 BST
05:44:18
Elapsed: 05:44:18 Running Remaining: 00:45:41
Overview
Problem
Status
Rank (05:44:15)
0 Comments
SettingFavoriteCloneUpdateDelete
Previous12345…NextFilterResetRejudge
Username

Prob
	Result 
	Time
(ms)	Mem
(MB)	Lang 
	Submit Time
Shabdan
F
Wrong Answer
C++
2 min ago
Shabdan
F
Wrong Answer
C++
3 min ago
Shabdan
F
Wrong Answer
C++
4 min ago
Mirbek
E
Wrong Answer
C++
8 min ago
Shabdan
F
Wrong Answer
C++
9 min ago
Shabdan
F
Wrong Answer
C++
12 min ago
Mirbek
E
Wrong Answer
C++
13 min ago
kasymovarsen
D
Compilation Error
C++
16 min ago
kasymovarsen
D
 Submit Failed
Bash (GNU bash v4.3.11)
16 min ago
daniel_02
C
Wrong Answer
C++
19 min ago
Shabdan
F
Wrong Answer
C++
29 min ago
Shabdan
F
Wrong Answer
C++
33 min ago
Shabdan
F
Wrong Answer
C++
34 min ago
rinatzh
F
Output Limit Exceeded
C++
39 min ago
rinatzh
F
Wrong Answer
C++
39 min ago
daniel_02
C
Wrong Answer
C++
55 min ago
Talant
C
Accepted
10	0.3	
C++
56 min ago
daniel_02
C
Wrong Answer
C++
57 min ago
Talant
C
Time Limit Exceeded
C++
58 min ago
Talant
C
Wrong Answer
C++
60 min ago

All Copyright Reserved ©2010-2017 Xu Han 
Server Time: 2017-11-29 15:44:18 BST

#11767973 | Shabdan's solution for [AtCoder-3607] [Problem F]
Status
Wrong Answer
Length
1829
Lang
C++14 (GCC 5.3.0)
Submitted
2017-11-29 15:40:39
RemoteRunId
1816290
0.0 / 1.0
Select Code/*
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back

int ans[2003][2003];
deque < int > v;
int sti1, sti2, fii1, fii2;

main() {
    int n = 1408;
    int k = 38;
    printf ("%d %d\n", n, k);
    int cnt = 2;
    for (int i = 1; i <= k; i++) {
        for (int j = 1; j <= k; j++) {
            if (j == 1) {
                ans[i][j] = 1;
            } else {
                ans[i][j] = cnt++;
            }
        }
    }
    int add = k - 1;
    sti1 = 2, fii1 = k;
    for (int i = 2; i <= k; i++) {
        for (int j = 2; j <= k; j++) {
            v.pb(ans[j][i]);
        }
    }
    for (int i = k + 1; i <= k + add; i++) {
        ans[i][1] = 2;
        for (int j = 2; j <= k; j++) {
            ans[i][j] = v.front();
            v.pop_front();
        }
    }
    sti1 = k + 1, fii1 = sti1 + add - 1;
    sti2 = sti1 + add, fii2 = sti2 + add - 1;
    cnt = 3;
    int xi = sti1;
    int res = 0;
    int cn = 0;
//    cout << sti1 << ' ' << fii1 << endl;
//    cout << sti2 << ' ' << fii2 << endl;
    for (int i = sti2; i <= n; i++) {
        ans[i][1] = cnt;
        res++;
        v.clear();
        int ri = sti1 + cn;
        int rj = 2;
        for (int j = 2; j <= k; j++) {
            v.pb(ans[ri][j]);
            ri++;
            if (ri > fii1) {
                ri = sti1;
            }
        }
        for (int j = 2; j <= k; j++) {
            ans[i][j] = v[j - 2];
        }
        cn++;
        if (res >= add) {
            sti1 = sti2;
            fii1 = fii2;
            sti2 = fii1 + 1;
            fii2 = sti2 + add - 1;
            res = 0;
            cnt++;
            cn = 0;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            printf ("%d ", ans[i][j]);
        }
        puts("");
    }

}