oj.uz

답안 #852393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852393 2023-09-21T18:13:13 Z Benmath Paths (BOI18_paths) C++14
23 / 100
 3000 ms 968040 KB 
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <bits/stdc++.h>

using namespace std;
long long int dp[100005][6][6][6][6];
int boja[100005];
int n;
int m;
int k;
vector<int>adjl[100005];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++){
        cin >> boja[i];
    }
    for (int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        adjl[x].push_back(y);
        adjl[y].push_back(x);
    }
    long long int ans = 0;
    for (int i = k; i >= 0; i--){
        for (int j = k; j >= 0; j--){
            for (int t = k; t >= 0; t--){
                for (int t1 = k; t1 >= 0; t1--){
                    int check1 = 0;
                    if (i == 0){
                        if(j==0 and t==0 and t1==0){
                        
                        }else{
                            check1++;
                        }
                    }else{
                        if(j==0){
                            if(t==0 and t1==0){
                                
                            }else{
                                check1++;
                            }
                        }else{
                            if(t==0){
                                if(t1!=0){
                                    check1++;
                                }
                            }
                        }
                    }
                    if(check1==0){
                    for (int node = 1; node <= n; node++){
                       if (i == 0){
                         if (j == 0 and t == 0 and t1 == 0){
                            for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
                                int x = boja[adjl[node][susjed]];
                                if(x != boja[node] and x != i and x != j and x != t and x != t1){
                                    dp[node][i][j][t][t1] += dp[adjl[node][susjed]][boja[node]][0][0][0];
                                }
                            }
                        }
                    }else{
                        if (j == 0){
                            if (t == 0 and t1 == 0){
                                 for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
                                    int x = boja[adjl[node][susjed]];
                                    if(x != boja[node] and x != i and x != j and x != t and x!=t1){
                                         dp[node][i][j][t][t1] += dp[adjl[node][susjed]][i][boja[node]][0][0];
                                    }
                                  }
                            }
                        }else{
                            if (t == 0){
                                if(t1==0){
                                for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
                                    int x = boja[adjl[node][susjed]];
                                    if(x != boja[node] and x != i and x != j and x != t and x!=t1){
                                         dp[node][i][j][t][t1] += dp[adjl[node][susjed]][i][j][boja[node]][0];
                                    }
                               }
                                }
                            }else{
                              for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
                                    int x = boja[adjl[node][susjed]];
                                    if(x != boja[node] and x != i and x != j and x != t and x!=t1){
                                         dp[node][i][j][t][t1] += dp[adjl[node][susjed]][i][j][t][boja[node]];
                                    }
                               }
                            }
                        }
                    }
                    int check = 0;
                    if (i == j and i > 0){
                        check ++;
                    } 
                    if (j == t and j > 0){
                        check ++;
                    }
                    if (i == t and i > 0){
                        check ++;
                    }
                    if (i == t1 and i > 0){
                        check ++;
                    }
                    if(j==t1 and j>0){
                        check++;
                    }
                    if(t==t1 and t>0){
                        check++;
                    }
                    if(boja[node] != i and boja[node] != j and boja[node] != t and check == 0 and boja[node] != t1){
                        dp[node][i][j][t][t1] += 1;
                    }
                    if(i == 0 and j == 0 and t == 0 and t1==0){
                        ans = ans + dp[node][i][j][t][t1];
                        ans --;
                    }
                    //cout << dp[node][i][j][t]<<" "<<i<<" "<<j<<" "<<t<<" "<<node<<" "<<boja[node]<<endl;
                }
                    }
            }
        }
    }
    }
    cout << ans << endl;
}

Compilation message

paths.cpp: In function 'int main()':
paths.cpp:63:57: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |                             for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
      |                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~
paths.cpp:73:62: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |                                  for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
      |                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~
paths.cpp:83:61: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |                                 for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~
paths.cpp:91:59: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |                               for (int susjed = 0; susjed < adjl[node].size(); susjed ++){
      |                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 2 ms 4696 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 666 ms 57772 KB Output is correct
2 Correct 558 ms 15440 KB Output is correct
3 Runtime error 33 ms 9560 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 2 ms 4696 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 666 ms 57772 KB Output is correct
12 Correct 558 ms 15440 KB Output is correct
13 Runtime error 33 ms 9560 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1152 ms 9808 KB Output is correct
3 Correct 192 ms 9552 KB Output is correct
4 Correct 1151 ms 968040 KB Output is correct
5 Correct 831 ms 892616 KB Output is correct
6 Execution timed out 3089 ms 750964 KB Time limit exceeded
7 Halted 0 ms 0 KB -