Submission #90646

#	Time	Username	Problem	Language	Result	Execution time	Memory
90646		314rate	보물 찾기 (CEOI13_treasure2)	C++14	100 / 100	2 ms	660 KiB

treasure

#include "treasure.h"
#include <bits/stdc++.h>

using namespace std;

const int N=100+5;

int ask(int r1,int c1,int r2,int c2)
{
    return countTreasure(r1,c1,r2,c2);
}

int s[N][N];

int askk(int r,int c)
{
    return s[r][c]-s[r-1][c]-s[r][c-1]+s[r-1][c-1];
}

int nn;

int co(int r1,int c1,int r2,int c2)
{
    int a=(r2-r1+1)*(c2-c1+1);
    return nn*nn+1-a;
}

void hack(int i,int j)
{
    if(i>nn-i)
    {
        if(j>nn-j)
        {
            s[i][j]=ask(1,1,i,j);
        }
        else
        {
            s[i][j]=s[i][nn]-ask(1,j+1,i,nn);
        }
    }
    else
    {
        if(j>nn-j)
        {
            s[i][j]=s[nn][j]-ask(i+1,1,nn,j);
        }
        else
        {
            s[i][j]=s[i][nn]+s[nn][j]-s[nn][nn]+ask(i+1,j+1,nn,nn);
        }
    }
}

int findTreasure(int n)
{
    nn=n;
    s[n][n]=ask(1,1,n,n);
    for(int i=1;i<n;i++)
    {
        if(co(1,1,i,n)<co(i+1,1,n,n))
        {
            s[i][n]=ask(1,1,i,n);
            s[n][i]=ask(1,1,n,i);
        }
        else
        {
            s[i][n]=s[n][n]-ask(i+1,1,n,n);
            s[n][i]=s[n][n]-ask(1,i+1,n,n);
        }
    }
    for(int i=1;i<n;i++)
    {
        for(int j=1;j<n;j++)
        {
            hack(i,j);
        }
    }
    ///for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {cout<<askk(i,j)<<" "; if(j==n) cout<<"\n";}
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(askk(i,j))
            {
                Report(i,j);
            }
        }
    }
}

Compilation message (stderr)

treasure.cpp: In function 'int findTreasure(int)':
treasure.cpp:89:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 100 / 100