제출 #1145218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145218		asdfghjk	경주 (Race) (IOI11_race)	C++20	컴파일 에러	0 ms	0 KiB

race

#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define con continue
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<ll,ll> pii;

const ll N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll maxn = 6e5 + 5;
const ll inf = 1e9+1;
const ll INF = 1e18;
const ll K = 31;

/*vector <ll> z_function(string s){
//    ll n = s.size();
//    ll l = 0,r = 0;
//    vector <ll> z(n);
//    for(ll i = 1;i < n;i++){
//        if(i <= r){
//            z[i] = (r - i + 1,z[i - l]);
//        }
//        while(i + z[i] < n && s[z[i]] == s[z[i] + i]){
//            z[i]++;
//        }
//        if(i + z[i] - 1 > r){
//            r = i + z[i]-1;
//            l = i;
//        }
//    }
}*/

/*vector <ll> prefix_function(string s){
    ll n = s.size();
    vector <ll> pi(n,0);
    for(ll i = 1;i < n;i++){
        ll j = pi[i - 1];
        while(j > 0 && s[i] != s[j]){
            j = pi[j - 1];
        }
        if(s[i] == s[j])++j;
        pi[i] = j;
    }
    return pi;
}*/

vector <int> g[N];
int n;
int best_path(n,int k,int h[][2],int l[]){

}
//void solve(){
//}
//main(){
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    ll abd = 1;
////    freopen("yinyang.in","r",stdin);
////    freopen("yinyang.out","w",stdout);
//
////    cin >> abd;
//    for(ll i = 1;i <= abd;i++){
//        solve();
//    }
//}

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

race.cpp:54:17: error: expected primary-expression before 'int'
   54 | int best_path(n,int k,int h[][2],int l[]){
      |                 ^~~
race.cpp:54:23: error: expected primary-expression before 'int'
   54 | int best_path(n,int k,int h[][2],int l[]){
      |                       ^~~
race.cpp:54:34: error: expected primary-expression before 'int'
   54 | int best_path(n,int k,int h[][2],int l[]){
      |                                  ^~~
race.cpp:54:41: error: expression list treated as compound expression in initializer [-fpermissive]
   54 | int best_path(n,int k,int h[][2],int l[]){
      |                                         ^