CSES - Datatähti Open 2017

Submission details
Task:	Grid
Sender:	nigus
Submission time:	2017-01-19 21:54:05 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	35
#2	ACCEPTED	21
#3	ACCEPTED	44

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.03 s	1	details
#6	ACCEPTED	0.04 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.04 s	1	details
#10	ACCEPTED	0.03 s	2	details
#11	ACCEPTED	0.05 s	2	details
#12	ACCEPTED	0.05 s	2	details
#13	ACCEPTED	0.03 s	2	details
#14	ACCEPTED	0.04 s	2	details
#15	ACCEPTED	0.04 s	2	details
#16	ACCEPTED	0.04 s	3	details
#17	ACCEPTED	0.04 s	3	details
#18	ACCEPTED	0.03 s	3	details
#19	ACCEPTED	0.11 s	3	details
#20	ACCEPTED	0.21 s	3	details
#21	ACCEPTED	0.28 s	3	details

Compiler report

input/code.cpp: In function 'void extend(ll)':
input/code.cpp:49:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll c2 = 0; c2 < ind.size(); c2++){
                                      ^
input/code.cpp:69:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(ll c2 = 0; c2 < ind.size(); c2++){
                                          ^
input/code.cpp: In function 'int main()':
input/code.cpp:104:14: warning: unused variable 'c3' [-Wunused-variable]
     ll c1,c2,c3,c4,c5;
              ^
input/code.cpp:104:17: warning: unused variable 'c4' [-Wunused-variable]
     ll c1,c2,c3,c4,c5;
                 ^
input/code.cpp:104:20: warning: unused variable 'c5' [-Wunused-variable]
     ll c1,c2,c3,c4,c5;
                    ^
input/code.cpp:105:12: warning: unused variable 'c' [-Wunused-variable]
     ll a,b,c;
            ^
input/code.cpp:108:21: warning: ignoring return value of '...

Code

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll mod = 1000000007ll;
int n,m,k,x,y;

vector<ll> A;
ll M[1001][1001] = {0};

vector<ll> sum;
vector<ll> ind;
vector<ll> kind;
vector<ll> num;

bool comp(ll i, ll j){
    return sum[i] < sum[j];
}

bool test(){
set<ll> S;
for(ll c1 = 0; c1 < n; c1++){
    ll a = 0;
    ll b = 0;
    for(ll c2 = 0; c2 < n; c2++){
        a += A[n*c1 + c2];
        b += A[n*c2 + c1];
    }
    if(S.find(a) != S.end())return 0;
    S.insert(a);
    if(S.find(b) != S.end())return 0;
    S.insert(b);

}
return 1;
}

void extend(ll i){

    sort(ind.begin() , ind.end() , comp);


    for(ll c1 = 1; c1 <= i; c1++){
        ll curr = 0;
        ll s1 = c1;
        ll s2 = c1;
        set<ll> S;
        for(ll c2 = 0; c2 < ind.size(); c2++){
            curr++;
            if(curr == c1 && c1 != i){
                curr++;
            }
            curr = min(curr , i);
            ll a = ind[c2];
            S.insert(sum[a] + curr);


            if(kind[a] == 0){
                s1 += curr;
            }
            else{
                s2 += curr;
            }
        }
        if(S.find(s1) == S.end() && S.find(s2) == S.end() && s1 != s2){
            M[i-1][i-1] = c1;
            curr = 0;
            for(ll c2 = 0; c2 < ind.size(); c2++){
                curr++;
                if(curr == c1 && c1 != i){
                    curr++;
                }
                curr = min(curr , i);
                ll a = ind[c2];
                sum[a] += curr;
                if(kind[a] == 0){
                    M[num[a]][i-1] = curr;
                }
                else{
                    M[i-1][num[a]] = curr;
                }
            }
            ind.push_back(ind.size());
            ind.push_back(ind.size());
            sum.push_back(s1);
            sum.push_back(s2);
            kind.push_back(1);
            kind.push_back(0);
            num.push_back(i-1);
            num.push_back(i-1);
            break;
        }
    }
    return;
}


int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    ll c1,c2,c3,c4,c5;
    ll a,b,c;


    scanf("%d" , &n);

    if(n <= 3){
        printf("QAQ\n");
    }
    else{
        if(n <= 10){
            for(c1 = 0; c1 < n; c1++){
                for(c2 = 0; c2 < n; c2++){
                    A.push_back(c1+1);
                }
            }
            a = -1;
            for(c1 = 0; c1 < 1000000; c1++){
                random_shuffle(A.begin() , A.end());
                if(test()){a = c1;break;}
            }
            //cout << a << "\n";
            //printf("%d\n" , int(a));
            for(c1 = 0; c1 < n; c1++){
                for(c2 = 0; c2 < n; c2++){
                    //cout << A[c1*n+c2] << " ";
                    printf("%d " , int(A[c1*n+c2]));
                }
                printf("\n");
                //cout << "\n";
            }
        }
        else{

            ll base = 6;
            for(c1 = 0; c1 < base; c1++){
                for(c2 = 0; c2 < base; c2++){
                    A.push_back(c1+1);
                }
            }
            b = n;
            n = base;
            for(c1 = 0; c1 < 1000000; c1++){
                random_shuffle(A.begin() , A.end());
                if(test()){a = c1;break;}
            }
            n = b;
            for(c1 = 0; c1 < base; c1++){
                a = 0;
                for(c2 = 0; c2 < base; c2++){
                    a += A[base*c1+c2];
                    M[c1][c2] = A[base*c1+c2];
                }
                sum.push_back(a);
                kind.push_back(0);
                ind.push_back(ind.size());
                num.push_back(c1);
            }



            for(c1 = 0; c1 < base; c1++){
                a = 0;
                for(c2 = 0; c2 < base; c2++){
                    a += A[base*c2+c1];
                }
                sum.push_back(a);
                kind.push_back(1);
                ind.push_back(ind.size());
                num.push_back(c1);
            }



            for(c1 = base+1; c1 <= n; c1++){
                extend(c1);
            }

            A.clear();

            for(c1 = 0; c1 < n; c1++){
                for(c2 = 0; c2 < n; c2++){
                   // cout << M[c1][c2] << " ";
                    printf("%d " , int(M[c1][c2]));
                    A.push_back(M[c1][c2]);
                }
                //cout << "\n";
                printf("\n");
            }

            //cout << test() << "\n";

        }
    }

    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1` view save

user output
`1 1 3 2 2 1 2 4 3 3 3 4 2 1 4 4` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`2 3 4 1 1 3 4 2 1 2 4 2 3 1 3 4 3 2 1 4 5 5 5 5 5` view save

user output
`1 1 5 3 1 5 4 4 2 3 1 2 3 1 2 5 5 2 2 3 4 3 5 4 4` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`2 3 4 5 1 1 3 4 5 2 1 2 4 5 2 3 1 3 5 2 3 4 1 4 5 4 3 2 1 5 ...` view save

user output
`5 4 4 4 6 5 3 5 2 6 6 1 1 3 1 6 4 1 4 2 3 3 2 1 5 6 2 5 4 2 ...` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`2 3 4 5 6 1 1 3 4 5 6 2 1 2 4 5 6 2 3 1 3 5 6 2 3 4 1 4 6 2 3 4 5 1 5 ...` view save

user output
`5 5 6 5 7 4 3 6 2 1 1 4 3 1 4 7 1 4 5 7 1 2 7 5 1 7 2 3 2 4 2 6 3 4 5 ...` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`2 3 4 5 6 7 1 1 3 4 5 6 7 2 1 2 4 5 6 7 2 3 1 3 5 6 7 2 3 4 1 4 6 7 2 3 4 5 1 5 ...` view save

user output
`6 4 2 3 8 4 4 6 3 6 7 5 6 1 4 2 5 8 8 3 7 5 1 6 7 2 7 8 4 3 6 8 3 2 5 8 1 1 4 3 ...` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`2 3 4 5 6 7 8 1 1 3 4 5 6 7 8 2 1 2 4 5 6 7 8 2 3 1 3 5 6 7 8 2 3 4 1 4 6 7 8 2 3 4 5 1 5 ...` view save

user output
`1 8 1 9 4 2 4 3 1 3 7 7 2 7 8 4 7 2 9 8 3 9 6 8 7 4 1 3 4 1 5 5 5 5 7 5 2 2 5 6 6 4 1 9 6 ...` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`2 3 4 5 6 7 8 9 1 1 3 4 5 6 7 8 9 2 1 2 4 5 6 7 8 9 2 3 1 3 5 6 7 8 9 2 3 4 1 4 6 7 8 9 2 3 4 5 1 5 ...` view save

user output
`10 1 2 3 4 5 6 6 8 9 8 10 9 9 8 7 10 4 7 3 7 4 9 8 1 8 1 3 1 7 5 3 6 9 10 3 5 2 9 1 4 5 1 6 4 4 5 2 9 6 ...` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`3` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`4` view save

correct output
`3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1` view save

user output
`1 1 3 2 2 1 2 4 3 3 3 4 2 1 4 4` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`29` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`48` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`80` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`97` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 16

Group: 3

Verdict: ACCEPTED

input
`3` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`4` view save

correct output
`3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1` view save

user output
`1 1 3 2 2 1 2 4 3 3 3 4 2 1 4 4` view save

Test 18

Group: 3

Verdict: ACCEPTED

input
`111` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 19

Group: 3

Verdict: ACCEPTED

input
`506` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 20

Group: 3

Verdict: ACCEPTED

input
`844` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`991` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`5 4 4 4 6 5 7 8 9 10 11 12 12 ...` view save

Datatähti Open 2017

Grid

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Tasks

Submissions (nigus)