제출 #1121403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121403		qrn	Lutrija (COCI19_lutrija)	C++17	63 / 70	617 ms	2044 KiB

lutrija

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

#define SPEED                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(NULL);                \
    cout.tie(NULL);

#define pb push_back
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define intt long long

const intt mxN = 2e5 + 5, L = 20, mxA = 1e15 + 35;

bool isprime(intt n) {
    for(int i = 2; i <= sqrt(n); i++) {
        if(n % i == 0) return false;
    }
    return true;
}

vector<vector<intt>>graph;
vector<intt> visited(mxN, 0), path, v(8);
bool ok = false;

void dfs(intt u, intt end) {
    visited[u] = true;
    path.pb(u);

    if (u == end) {
        ok = true;
        vector<intt>actans;
        for(int i = 0; i < path.size(); i++) {
            if(i < path.size() - 1 && v[path[i]] == v[path[i+1]]) {
                continue;
            }
            actans.pb(v[path[i]]);
        }
        cout << actans.size() << endl;
        for(intt i : actans) cout << i << " ";
        cout << endl;
        return;
    } else {
        for (intt v : graph[u]) {
            if (!visited[v]) {
                dfs(v, end);
            }
        }
    }
  
    
    path.pop_back();
    visited[u] = false;
}

void solve() {
    intt l,r, li =0, ri = 0;
    cin >> l >> r;
    v = {-mxA, 2ll, l - 2, r - 2, l, r, l + 2, r + 2};
    sort(ALL(v));
    
    graph.resize(8);
    for(intt i = 1; i <= 7; i++) {
        if(v[i] == l) li = i;
        if(v[i] == r) ri = i;
        for(intt j = i + 1; j <= 7; j++) {
            if(isprime(v[i]) && isprime(v[j]) && isprime(abs(v[i]-v[j])) && v[i] && v[j]){
                graph[i].pb(j);
                graph[j].pb(i);
            }
        }
    }
    dfs(li, ri);
    if(!ok || path.size() == 0) {
      cout << -1 << endl;
    }
}

int main() {
    SPEED;
    int tst = 1;
    // cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lutrija.cpp: In function 'void dfs(long long int, long long int)':
lutrija.cpp:34:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(int i = 0; i < path.size(); i++) {
      |                        ~~^~~~~~~~~~~~~
lutrija.cpp:35:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |             if(i < path.size() - 1 && v[path[i]] == v[path[i+1]]) {
      |                ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7