제출 #441731

#제출 시각아이디문제언어결과실행 시간메모리
441731julian33슈퍼트리 잇기 (IOI20_supertrees)C++14
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #define deb(...) logger(#__VA_ARGS__, __VA_ARGS__) template<typename ...Args> void logger(string vars, Args&&... values) { cerr<<vars<<" = "; string delim=""; (...,(cerr<<delim<<values,delim=", ")); cerr<<"\n"; } #else #define deb(...) logger(#__VA_ARGS__, __VA_ARGS__) template<typename ...Args> void logger(string vars, Args&&... values) {} #endif #define FOR(i,j,n) for(int i=j;i<n;i++) #define pb push_back #define sz(x) (int)(x.size()) typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<typename T> inline void maxa(T& a,T b){a=max(a,b);} template<typename T> inline void mina(T& a,T b){a=min(a,b);} /* subtask 1: make a line graph subtask 2: make multiple line graphs, make sure no components have contradictions subtask 3: make multiple rings, make sure no contradictions subtask 4: in each component, make components of 2s. Form these into rings. connect the rings. then get components of ones and make them into line graphs. subtask 5: subtask 4 and check for contradictions subtask 6: for the components of 3, make a ring and add an extra edge rings must have at least 3 nodes 3-rings must have at least 4 nodes */ int construct(vector<vector<int>> p){ return 0; } int main(){ cin.sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifdef LOCAL freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); #endif }

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

/usr/bin/ld: /tmp/ccZcZMpc.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccqtjPRc.o:supertrees.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status