CODE FESTIVAL 2016 qual A

Submission #900709

Source codeソースコード

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

typedef pair<int,int> pi;

const int N=200000;
const ll INF=1234567890123456LL;

struct edge{int to,cost;};
vector<edge> G[N];
ll val[N];

int main()
{
    int R,C;
    scanf(" %d %d", &R, &C);
    int n;
    scanf(" %d", &n);

    vector<int> r(n), c(n), a(n);
    rep(i,n)
    {
        scanf(" %d %d %d", &r[i], &c[i], &a[i]);
        --r[i];
        --c[i];
        G[r[i]].pb(edge{R+c[i],a[i]});
        G[R+c[i]].pb(edge{r[i],a[i]});
    }

    // 隣り合う辺同士で値を決めていく
    fill(val,val+N,INF);
    rep(i,R+C)
    {
        if(val[i]!=INF) continue;

        val[i]=0;
        queue<int> que;
        que.push(i);
        while(!que.empty())
        {
            int v=que.front();
            que.pop();
            rep(j,G[v].size())
            {
                edge e=G[v][j];
                if(val[e.to]==INF)
                {
                    val[e.to] = (ll)e.cost-val[v];
                    que.push(e.to);
                }
            }

        }
    }

    bool valid=true;

    // 正当性のチェック
    rep(i,n)
    {
        if(val[r[i]]+val[R+c[i]] != (ll)a[i])
        {
            valid=false;
            break;
        }
    }

    if(valid)
    {
        vector<bool> vis(R+C, false);
        rep(i,R+C)
        {
            if(vis[i]) continue;

            queue<int> que;
            vis[i]=true;
            que.push(i);

            ll minr=INF, minc=INF;
            if(i<R) minr=min(minr,val[i]);
            else minc=min(minc,val[i]);

            while(!que.empty())
            {
                int v=que.front();
                que.pop();
                rep(j,G[v].size())
                {
                    edge e=G[v][j];
                    if(!vis[e.to])
                    {
                        vis[e.to]=true;
                        que.push(e.to);

                        if(e.to<R) minr=min(minr,val[e.to]);
                        else minc=min(minc,val[e.to]);
                    }
                }
            }

            if(minr+minc<0)
            {
                valid=false;
                break;
            }
        }
    }

    cout << (valid?"Yes":"No") << endl;
    return 0;
}

Submission

Task問題 D - マス目と整数 / Grid and Integers
User nameユーザ名 imulan
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 800
Source lengthソースコード長 2612 Byte
File nameファイル名
Exec time実行時間 123 ms
Memory usageメモリ使用量 13952 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d", &R, &C);
^
./Main.cpp:26:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d", &n);
^
./Main.cpp:31:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d %d", &r[i], &c[i], &a[i]);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt,0_03.txt,0_04.txt
All 800 / 800 0_00.txt,0_01.txt,0_02.txt,0_03.txt,0_04.txt,1_00.txt,1_01.txt,1_02.txt,1_03.txt,1_04.txt,1_05.txt,1_06.txt,1_07.txt,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt,1_20.txt,1_21.txt,1_22.txt,1_23.txt,1_24.txt,1_25.txt,1_26.txt,1_27.txt,1_28.txt,1_29.txt,1_30.txt,1_31.txt,1_32.txt,1_33.txt,1_34.txt,1_35.txt,1_36.txt,1_37.txt,1_38.txt,1_39.txt,1_40.txt,1_41.txt,1_42.txt,1_43.txt,1_44.txt,1_45.txt,1_46.txt,1_47.txt,1_48.txt,1_49.txt,1_50.txt,1_51.txt,1_52.txt,1_53.txt,1_54.txt,1_55.txt,1_56.txt,1_57.txt,1_58.txt,1_59.txt,1_60.txt,1_61.txt,1_62.txt,1_63.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 9 ms 6528 KB
0_01.txt AC 9 ms 6528 KB
0_02.txt AC 9 ms 6528 KB
0_03.txt AC 9 ms 6528 KB
0_04.txt AC 9 ms 6656 KB
1_00.txt AC 100 ms 6528 KB
1_01.txt AC 100 ms 6528 KB
1_02.txt AC 100 ms 6656 KB
1_03.txt AC 66 ms 6528 KB
1_04.txt AC 100 ms 6528 KB
1_05.txt AC 56 ms 6528 KB
1_06.txt AC 123 ms 13952 KB
1_07.txt AC 112 ms 13952 KB
1_08.txt AC 98 ms 11904 KB
1_09.txt AC 86 ms 11904 KB
1_10.txt AC 118 ms 10752 KB
1_11.txt AC 90 ms 10752 KB
1_12.txt AC 113 ms 10752 KB
1_13.txt AC 86 ms 10752 KB
1_14.txt AC 105 ms 10752 KB
1_15.txt AC 94 ms 10752 KB
1_16.txt AC 108 ms 10752 KB
1_17.txt AC 83 ms 10880 KB
1_18.txt AC 86 ms 10880 KB
1_19.txt AC 93 ms 10752 KB
1_20.txt AC 45 ms 9472 KB
1_21.txt AC 53 ms 8192 KB
1_22.txt AC 36 ms 6784 KB
1_23.txt AC 85 ms 9984 KB
1_24.txt AC 53 ms 10112 KB
1_25.txt AC 49 ms 9472 KB
1_26.txt AC 17 ms 6784 KB
1_27.txt AC 59 ms 7168 KB
1_28.txt AC 72 ms 11264 KB
1_29.txt AC 52 ms 8448 KB
1_30.txt AC 72 ms 11136 KB
1_31.txt AC 91 ms 8832 KB
1_32.txt AC 50 ms 10112 KB
1_33.txt AC 72 ms 11136 KB
1_34.txt AC 39 ms 7296 KB
1_35.txt AC 51 ms 10368 KB
1_36.txt AC 51 ms 7296 KB
1_37.txt AC 32 ms 8320 KB
1_38.txt AC 92 ms 10368 KB
1_39.txt AC 69 ms 7936 KB
1_40.txt AC 83 ms 10240 KB
1_41.txt AC 90 ms 8576 KB
1_42.txt AC 51 ms 10240 KB
1_43.txt AC 63 ms 9984 KB
1_44.txt AC 67 ms 10604 KB
1_45.txt AC 36 ms 7808 KB
1_46.txt AC 74 ms 11008 KB
1_47.txt AC 61 ms 8192 KB
1_48.txt AC 28 ms 7936 KB
1_49.txt AC 35 ms 7168 KB
1_50.txt AC 47 ms 9216 KB
1_51.txt AC 60 ms 10752 KB
1_52.txt AC 76 ms 6912 KB
1_53.txt AC 56 ms 7424 KB
1_54.txt AC 46 ms 8192 KB
1_55.txt AC 38 ms 8576 KB
1_56.txt AC 55 ms 9728 KB
1_57.txt AC 62 ms 11008 KB
1_58.txt AC 64 ms 10496 KB
1_59.txt AC 58 ms 6784 KB
1_60.txt AC 9 ms 6528 KB
1_61.txt AC 9 ms 6528 KB
1_62.txt AC 9 ms 6528 KB
1_63.txt AC 9 ms 6528 KB