Submission #243224

#	Time	Username	Problem	Language	Result	Execution time	Memory
243224		LittleFlowers__	Duathlon (APIO18_duathlon)	C++17	0 / 100	1129 ms	788492 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

const int N=55;

int n,m,top,cur;
int dd[N],w[N];
vector<int> ad[N];

using unx=tuple<int,int,int>;
vector<unx> val;

void dfs(int u){
    forinc(i,2,top)
        val.pb(mt(cur,w[i],u));
    dd[u]=1;
    w[++top]=u;
    forv(v,ad[u]) if(!dd[v]) dfs(v);
    dd[u]=0;
    top--;
}

main(){
    #define task "3"
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }

    n=in,m=in;
    forinc(i,1,m){
        int u=in,v=in;
        ad[u].pb(v);
        ad[v].pb(u);
    }

    forinc(i,1,n){
        dfs(cur=i);
    }

    sort(all(val)), val.erase(unique(all(val)),val.end());
    cout<<val.size();
}

Compilation message (stderr)

count_triplets.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:44:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(task".inp","r",stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10